Skocz do pozycji: 1.

Tytuł:

The idea of using the A* algorithm for route planning an unmanned vehicle “Edredon”

Autorzy:

Naus, K.
Wąż, M.

Powiązania:

https://bibliotekanauki.pl/articles/359690.pdf

Data publikacji:

2013

Wydawca:

Akademia Morska w Szczecinie. Wydawnictwo AMSz

Tematy:

A* algorithm
navigation system
route planning
electronic chart
vehicle „Edredon”

Opis:

This article presents the concept of algorithm A* functioning in a navigation system equipped with electronic navigational chart for autonomous planning the shortest and safest route crossing an offshore unmanned vehicle “Edredon”. The first part describes the general technical architecture and functionality of the vehicle's navigation system. In the second part shows in detail the modules of the system responsible for the planning of the road and how to implement them in the A* algorithm. The third part describes the proper operation of testing whether the A* algorithm in the navigation system, while the task of planning the route of the autonomous vehicle. Final part is a discussion of the results obtained from tests carried out in order to evaluate the applicability of the A* algorithm for route planning in autonomous navigation systems.

Źródło:

Zeszyty Naukowe Akademii Morskiej w Szczecinie; 2013, 36 (108) z. 2; 143-147
1733-8670
2392-0378

Pojawia się w:

Zeszyty Naukowe Akademii Morskiej w Szczecinie

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 2.

Tytuł:

An Application of Probabilistic Grammars to Efficient Machne Translation

Autorzy:

Skórzewski, Paweł

Powiązania:

https://bibliotekanauki.pl/articles/1037598.pdf

Data publikacji:

2010-09-15

Wydawca:

Uniwersytet im. Adama Mickiewicza w Poznaniu

Tematy:

a* algorithm
machine translation
natural language parsing
pcfg
probabilistic grammars

Opis:

In this paper we present one of the algorithms used to parse probabilistic context-free grammars: the A* parsing algorithm, which is based on the A* graph search method. We show an example of application of the algorithm in an existing machine translation system. The existing CYK-based parser used in the Translatica system was modified by applying the A* parsing algorithm in order to examine the possibilities of improving its performance. This paper presents the results of applying the A* algorithm with different heuristic functions and their impact on the performance of the parser.

Źródło:

Investigationes Linguisticae; 2010, 21; 90-98
1426-188X
1733-1757

Pojawia się w:

Investigationes Linguisticae

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 3.

Tytuł:

Artificial intelligence in solving collision problem in restricted area

Autorzy:

Mąka, M.
Dramski, M.

Powiązania:

https://bibliotekanauki.pl/articles/359349.pdf

Data publikacji:

2013

Wydawca:

Akademia Morska w Szczecinie. Wydawnictwo AMSz

Tematy:

shortest path
safe route
restricted area
trapezoidal grid
area discretization
simplified ant algorithm
A* algorithm

Opis:

This paper presents one of the approaches to solve the collision problem in restricted area for two moving objects using artificial intelligence (SACO algorithm). Although AI should be used only when the classic methods fail, a simple comparison between them is very interesting. As we know the main task of navigation is to conduct safely an object from the point of departure to destination. This problem does not seem easy, especially if we consider the movement in restricted areas such narrow passages, ports etc.

Źródło:

Zeszyty Naukowe Akademii Morskiej w Szczecinie; 2013, 36 (108) z. 2; 118-122
1733-8670
2392-0378

Pojawia się w:

Zeszyty Naukowe Akademii Morskiej w Szczecinie

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 4.

Tytuł:

Dynamic Key Generation During a Communication Instance Over GSM

Autorzy:

Zalaket, J.
Challita, K.

Powiązania:

https://bibliotekanauki.pl/articles/108666.pdf

Data publikacji:

2013

Wydawca:

Społeczna Akademia Nauk w Łodzi

Tematy:

mobile communication
encryption
GSM
A5 algorithm

Opis:

Mobile phone may become the protagonist of the new electronic technology. If we compare it with that of other technologies, the infiltration rate of mobile phones in the world is extremely high, both in cities than rural communities of the most of the countries. According to estimates made by the International Telecommunication Union the access to mobile networks is growing much faster than the access to Internet. This emergence has led many companies to allow new activities which were previously running strictly over the Internet to run over the mobile network such as the electronic payment. These circumstances make the security of mobile communication a priority to preserve the authentication, confidentiality and integrity of data sent between subscribers and mobile network. In this paper, we propose a dynamic key generation for the A5 GSM encryption algorithm to enforce the security and protect the transferred data. Our algorithm can be implemented over any GSM generation GSM/3G/4G.

Źródło:

Journal of Applied Computer Science Methods; 2013, 5 No. 1; 47-57
1689-9636

Pojawia się w:

Journal of Applied Computer Science Methods

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 5.

Tytuł:

Task allocation algorithms for maximizing reliability of heterogeneous distributed computing systems

Autorzy:

Mahmood, A.

Powiązania:

https://bibliotekanauki.pl/articles/205582.pdf

Data publikacji:

2001

Wydawca:

Polska Akademia Nauk. Instytut Badań Systemowych PAN

Tematy:

heurystyka
niezawodność
obliczenie zdecentralizowane
przetwarzanie rozproszone
A* algorithm
branch-and-bound
distributed computing
heuristics
reliability
task allocation

Opis:

The rapid progress of microprocessor and communication technologies has made the distributed computing system economically attractive for many computer applications. One of the first problems encountered in the operation of a distributed system is the problem of allocating the tasks among the processing nodes. The task allocation problem is known to be computationally intractable for large task sets. In this paper, we consider the task allocation problem with the goal of maximizing reliability of heterogeneous distributed systems. After presenting a quantitative task allocation model, we present a least-cost branch-and-bound algorithm to find optimal task allocations. We also present two heuristic algorithms to obtain suboptimal allocations for realistic size large problems in a reasonable amount of computational time. Simulation was used to study the performance of the proposed algorithms for a large number of problems. Also, performance of the proposed algorithms has been compared with a well-known heuristics available in the literature.

Źródło:

Control and Cybernetics; 2001, 30, 1; 115-130
0324-8569

Pojawia się w:

Control and Cybernetics

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 6.

Tytuł:

Analiza i implementacja algorytmów odnajdywania ścieżki do zastosowania w grach przeglądarkowych
Analysis and implementation of pathfinding algorithms for use in browser games

Autorzy:

Laszkiewicz, Beata
Sobczak, Tomasz

Powiązania:

https://bibliotekanauki.pl/articles/2146697.pdf

Data publikacji:

2022

Wydawca:

Wrocławska Wyższa Szkoła Informatyki Stosowanej Horyzont

Tematy:

gra przeglądarkowa
graf
algorytm Bellmana-Forda
algorytm Dijkstry
algorytm A-star
browser game
graph
Bellman-Ford algorithm
Dijkstra algorithm
A-star algorithm

Opis:

Celem tego artykułu jest przedstawienie, porównanie oraz implementacja algorytmów odnajdywania ścieżki do zastosowania w grach przeglądarkowych z wykorzystaniem ogólnodostępnych, darmowych technologii internetowych. Pokazano również możliwość wykorzystania najlepszego algorytmu w grze przeglądarkowej
The goal of this article is to present, compare and implement path finding algorithms for use in browser games, using public, free internet technologies. The possibility of using the best algorithm in a browser game is also shown.

Źródło:

Biuletyn Naukowy Wrocławskiej Wyższej Szkoły Informatyki Stosowanej. Informatyka; 2022, 9, 1; 16--24
2082-9892

Pojawia się w:

Biuletyn Naukowy Wrocławskiej Wyższej Szkoły Informatyki Stosowanej. Informatyka

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 7.

Tytuł:

Metoda zarządzania niezawodnością i procesami obsługi linii produkcyjnej wspomagana statystyczną analizą danych
Method for reliability and production line processes management aided by statistical analysis of reliability data

Autorzy:

Piesik, J.

Powiązania:

https://bibliotekanauki.pl/articles/268652.pdf

Data publikacji:

2016

Wydawca:

Politechnika Gdańska. Wydział Elektrotechniki i Automatyki

Tematy:

algorytm a priori
predykcja uszkodzeń
algorithm a priori
defects prediction

Opis:

W referacie zostanie przedstawiona metoda zarządzania niezawodnością i procesem obsługi linii produkcyjnej wraz z implementacją wspomaganych komputerowo narzędzi statystycznych na linii produkcji półfabrykatów do produkcji opon. Referat ma na celu pokazanie skutecznych, relatywnie tanich oraz łatwych w implementacji w różnych środowiskach przemysłowych narzędzi do poprawy niezawodności maszyn, oraz pośrednio poprawy wyników jakościowych produkowanych wyrobów.
The paper presents the management method of reliability and service process of production line with the implementation of computer-aided statistical tool on the production line of semi-finished products for tire production. Author proposed the complex strategy of reliability management composed of three elements: Total Productive Maintenance (TPM), Reliability Centered Maintenance (RCM) and computer-aided statistical tool with prediction of potential defects and failures (CAST-P). Important issue is to obey the order of deployments of those techniques (TPM-RCM-CAST-P). CAST-P tool using Apriori algorithm analyze the historical data gathered by the supervising production system to find the rules. Created set of rules is used for filtering current data from the production line and find potential defects and failures. Rapport with potential defects is send at web page version to maintenance breakdown worker. The final step is the reaction of maintenance personnel for predicted symptoms. The paper aims to show effective, relatively cheap and easy to implement in a variety of industrial environments tools to improve machine reliability and indirectly improve the quality of produced goods.

Źródło:

Zeszyty Naukowe Wydziału Elektrotechniki i Automatyki Politechniki Gdańskiej; 2016, 51; 151-154
1425-5766
2353-1290

Pojawia się w:

Zeszyty Naukowe Wydziału Elektrotechniki i Automatyki Politechniki Gdańskiej

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 8.

Tytuł:

Minimal Decision Rules Based on the Apriori Algorithm

Autorzy:

Fernandez, M. C.
Menasalvas, E.
Marban, O.
Pena, J. M.
Millan, S.

Powiązania:

https://bibliotekanauki.pl/articles/908364.pdf

Data publikacji:

2001

Wydawca:

Uniwersytet Zielonogórski. Oficyna Wydawnicza

Tematy:

baza danych
algorytmy
rough sets
rough dependencies
association rules
a priori algorithm
minimal decision rules

Opis:

Based on rough set theory many algorithms for rules extraction from data have been proposed. Decision rules can be obtained directly from a database. Some condition values may be unnecessary in a decision rule produced directly from the database. Such values can then be eliminated to create a more comprehensible (minimal) rule. Most of the algorithms that have been proposed to calculate minimal rules are based on rough set theory or machine learning. In our approach, in a post-processing stage, we apply the Apriori algorithm to reduce the decision rules obtained through rough sets. The set of dependencies thus obtained will help us discover irrelevant attribute values.

Źródło:

International Journal of Applied Mathematics and Computer Science; 2001, 11, 3; 691-704
1641-876X
2083-8492

Pojawia się w:

International Journal of Applied Mathematics and Computer Science

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 9.

Tytuł:

Modyfikacje algorytmów planowania trasy uwzględniające ograniczenia czasowe i odległościowe
Modification of path-finding algorithms introducing time and distance limitations

Autorzy:

Wolanin, Mateusz
Korniszuk, Klaudia
Smołka, Jakub

Powiązania:

https://bibliotekanauki.pl/articles/98100.pdf

Data publikacji:

2019

Wydawca:

Politechnika Lubelska. Instytut Informatyki

Tematy:

wyznaczanie trasy
rower miejski
algorytm A*
algorytm BFS
route planning
bike sharing system
algorithm A*
algorithm BFS

Opis:

Artykuł przedstawia modyfikacje algorytmów wyszukiwania ścieżki w grafie mające na celu wprowadzenie ograniczeń: czasowych lub odległościowych do znalezionej trasy. Zmodyfikowane zostały dwa algorytmy: A* oraz BFS. Zaproponowana została również modyfikacja algorytmu A*, która łączy atuty tych dwóch algorytmów – wygenerowanie najkrótszych tras o jak najmniejszej liczbie wierzchołków. Zmodyfikowane algorytmy umożliwią stworzenie aplikacji pozwalającej na łatwiejsze i bardziej oszczędne poruszanie się z wykorzystaniem usług typu rowerem miejski.
This paper describes modifications of path-finding algorithms. The modifications add time and distance constraints to generated paths. A* and BFS algorithms are modified. Additionally, A* algorithm modification which combines the advantages (generating the shortest routes with the smallest number of vertices) of A* and BFS is presented.. This allows for creating a route planning app that enables users of bike sharing services to travel more easily and economically.

Źródło:

Journal of Computer Sciences Institute; 2019, 10; 18-23
2544-0764

Pojawia się w:

Journal of Computer Sciences Institute

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 10.

Tytuł:

Method for location of an external dump in surface mining using the A-star algorithm
Metoda lokalizacji zwałowiska zewnętrznego w górnictwie odkrywkowym z wykorzystaniem algorytmu A-star

Autorzy:

Zajączkowski, M.
Kasztelewicz, Z.
Sikora, M.

Powiązania:

https://bibliotekanauki.pl/articles/219312.pdf

Data publikacji:

2014

Wydawca:

Polska Akademia Nauk. Czytelnia Czasopism PAN

Tematy:

górnictwo odkrywkowe
zwałowisko zewnętrzne
wkop udostępniający
teoria grafów
algorytm A-star
surface mining
dump
excavation site
graph theory
A-star algorithm

Opis:

The construction of a surface mine always involves the necessity of accessing deposits through the removal of the residual overburden above. In the beginning phase of exploitation, the masses of overburden are located outside the perimeters of the excavation site, on the external dump, until the moment of internal dumping. In the case of lignite surface mines, these dumps can cover a ground surface of several dozen to a few thousand hectares. This results from a high concentration of lignite extraction, counted in millions of Mg per year, and the relatively large depth of its residual deposits. Determining the best place for the location of an external dump requires a detailed analysis of existing options, followed by a choice of the most favorable one. This article, using the case study of an open-cast lignite mine, presents the selection method for an external dump location based on graph theory and the A-star algorithm. This algorithm, based on the spatial distribution of individual intersections on the graph, seeks specified graph states, continually expanding them with additional elementary fields until the required surface area for the external dump - defined by the lowest value of the occupied site - is achieved. To do this, it is necessary to accurately identify the factors affecting the choice of dump location. On such a basis, it is then possible to specify the target function, which reflects the individual costs of dump construction on a given site. This is discussed further in chapter 3. The area of potential dump location has been divided into elementary fields, each represented by a corresponding geometrical locus. Ascribed to this locus, in addition to its geodesic coordinates, are the appropriate attributes reflecting the degree of development of its elementary field. These tasks can be carried out automatically thanks to the integration of the method with the system of geospatial data management for the given area. The collection of loci, together with geodesic coordinates, constitutes the points on the graph used during exploration. This is done using the A-star algorithm, which uses a heuristic function, allowing it to identify the optimal solution; therefore, the collection of elementary fields, which occupy the potential construction area of a dump, characterized by the lowest value representing the cost of occupation and dumping of overburden in the area. The precision of the boundary, generated by the algorithm, is dependent on the established size of the elementary field, and should be refined each time by the designer of the surface mine. This article presents the application of the above method of dump location using the example of “Tomisławice,” a lignite surface mine owned by PAK KWB Konin S. A. The method made it possible to identify the most favorable dump location on the northeast side of the initial pit, within 2 kilometers of its surrounding area (discussed further in chapter 3). This method is universal in nature and, after certain modifications, can be implemented for other surface mines as well.
Budowa kopalni odkrywkowej wiąże się zawsze z koniecznością udostępnienia złoża poprzez zdjęcie zalegającego nad nim nadkładu. W początkowej fazie eksploatacji masy nadkładowe lokalizowane są poza granicami wyrobiska odkrywkowego na zwałowisku zewnętrznym, aż do momentu przejścia do zwałowania wewnętrznego. W przypadku kopalń odkrywkowych węgla brunatnego zwałowiska te osiągają powierzchnię od kilkudziesięciu do nawet kilku tysięcy hektarów. Spowodowane jest to dużą koncentracją wydobycia węgla brunatnego liczoną w milionach Mg na rok oraz stosunkowo dużą głębokością zalegania tych złóż. W celu wyboru najkorzystniejszej jego lokalizacji powinno się przeprowadzić szczegółową analizę alternatywnych wariantów, a następnie wybrać wariant najkorzystniejszy. W artykule przedstawiono metodę wyboru lokalizacji zwałowiska zewnętrznego na przykładzie wieloodkrywkowej kopalni węgla brunatnego opartą na teorii grafów i algorytmie A-star. Algorytm ten na podstawie przestrzennego rozmieszczenia poszczególnych węzłów w grafie przeszukuje określone stany grafu, rozbudowując je o kolejne pola elementarne, aż do uzyskania wymaganej wielkości powierzchni przeznaczonej pod budowę zwałowiska zewnętrznego charakteryzującej się przy tym najmniejszą wartością zajętego terenu. Aby to osiągnąć konieczne jest dokładne zidentyfikowanie czynników mających wpływ na wybór lokalizacji zwałowiska zewnętrznego. Na ich podstawie można określić funkcję celu odzwierciedlającą wielkość poszczególnych kosztów budowy zwałowiska zewnętrznego na danym terenie, co zostało szczegółowo opisane w rozdziale 3. Obszar potencjalnej lokalizacji zwałowiska zewnętrznego podzielono na pola elementarne, którego reprezentantem jest centrodia. Centroidzie tej, oprócz jej współrzędnych geodezyjnych, przypisano odpowiednie atrybuty odzwierciedlające stopień zagospodarowania jej pola elementarnego. Czynności te mogła zostać przeprowadzone automatycznie dzięki zintegrowaniu opracowanej metody z systemem zarządzania danymi geoprzestrzennymi o terenie. Zbiór centroid wraz z jej współrzędnymi geodezyjnymi i przydzielonymi atrybutami stanowił wierzchołki grafu do przeszukiwania, którego użyto algorytmu A-star. Algorytm ten wykorzystuje funkcję heurystyczną, dzięki której jest w stanie za każdym razem wskazywać optymalne rozwiązanie, a więc taki zbiór pól elementarnych, których zajęcie pod budowę zwałowiska zewnętrznego będzie charakteryzowało się najmniejszą wartością reprezentującą koszty zajęcia i zwałowania mas nadkładowych na tym obszarze. Dokładność przebiegu granicy wygenerowanej przez algorytm uzależniona jest od przyjętej wielkości pola elementarnego i za każdym razem powinna być ona uszczegółowiona przez projektanta kopalni odkrywkowej. W artykule przedstawiono zastosowanie powyższej metody lokalizacji zwałowiska zewnętrznego na przykładzie kopalni odkrywkowej węgla brunatnego „Tomisławice” należącej do PAK KWB Konin S.A. Dzięki niej możliwe było wskazanie najkorzystniejszej lokalizacji zwałowiska po północno-wschodniej stronie wkopu udostępniającego i oddalonego od niego o ok. 2 km, co zostało opisane w rozdziale 3. Opracowana metoda ma charakter uniwersalny i po pewnych modyfikacjach może być zaimplementowana także dla kopalń odkrywkowych innych kopalin.

Źródło:

Archives of Mining Sciences; 2014, 59, 3; 721-730
0860-7001

Pojawia się w:

Archives of Mining Sciences

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 11.

Tytuł:

Algorithm CFP-SFPwith parallel processing

Autorzy:

Kujawiak, M.

Powiązania:

https://bibliotekanauki.pl/articles/92930.pdf

Data publikacji:

2008

Wydawca:

Uniwersytet Przyrodniczo-Humanistyczny w Siedlcach

Tematy:

association rules
data mining
web logs
a priori
a priori TID
a priori hybrid algorithm
FP-Tree

Opis:

Existing algorithms for finding association rules do not implement parallel processing. This paper proposes CFP-SFP (Creating Frequent Patterns with Set from Frequent Patterns) algorithm with parallel processing. The research involves running CEP-SEP algorithm with one thread and a dozen or so threads that are executed simultaneously. The research was conducted on a computer with one processor and dual-core processor.

Źródło:

Studia Informatica : systems and information technology; 2008, 1(10); 87-93
1731-2264

Pojawia się w:

Studia Informatica : systems and information technology

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 12.

Tytuł:

Multi-population-based algorithm with an exchange of training plans based on population evaluation

Autorzy:

Łapa, Krystian
Cpałka, Krzysztof
Kisiel-Dorohinicki, Marek
Paszkowski, Józef
Dębski, Maciej
Le, Van-Hung

Powiązania:

https://bibliotekanauki.pl/articles/2147148.pdf

Data publikacji:

2022

Wydawca:

Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych

Tematy:

population-based algorithm
multi-population algorithm
hybrid algorithm
island algorithm
subpopulation evaluation
training plan

Opis:

Population Based Algorithms (PBAs) are excellent search tools that allow searching space of parameters defined by problems under consideration. They are especially useful when it is difficult to define a differentiable evaluation criterion. This applies, for example, to problems that are a combination of continuous and discrete (combinatorial) problems. In such problems, it is often necessary to select a certain structure of the solution (e.g. a neural network or other systems with a structure usually selected by the trial and error method) and to determine the parameters of such structure. As PBAs have great application possibilities, the aim is to develop more and more effective search formulas used in them. An interesting approach is to use multiple populations and process them with separate PBAs (in a different way). In this paper, we propose a new multi-population-based algorithm with: (a) subpopulation evaluation and (b) replacement of the associated PBAs subpopulation formulas used for their processing. In the simulations, we used a set of typical CEC2013 benchmark functions. The obtained results confirm the validity of the proposed concept.

Źródło:

Journal of Artificial Intelligence and Soft Computing Research; 2022, 12, 4; 239--253
2083-2567
2449-6499

Pojawia się w:

Journal of Artificial Intelligence and Soft Computing Research

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 13.

Tytuł:

Learning from heterogeneously distributed data sets using artificial neural networks and genetic algorithms

Autorzy:

Peteiro-Barral, D.
Guijarro-Berdiñas, B.
Pérez-Sánchez, B.

Powiązania:

https://bibliotekanauki.pl/articles/91888.pdf

Data publikacji:

2012

Wydawca:

Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych

Tematy:

artificial neural networks
genetic algorithm
Devonet algorithm

Opis:

It is a fact that traditional algorithms cannot look at a very large data set and plausibly find a good solution with reasonable requirements of computation (memory, time and communications). In this situation, distributed learning seems to be a promising line of research. It represents a natural manner for scaling up algorithms inasmuch as an increase of the amount of data can be compensated by an increase of the number of distributed locations in which the data is processed. Our contribution in this field is the algorithm Devonet, based on neural networks and genetic algorithms. It achieves fairly good performance but several limitations were reported in connection with its degradation in accuracy when working with heterogeneous data, i.e. the distribution of data is different among the locations. In this paper, we take into account this heterogeneity in order to propose several improvements of the algorithm, based on distributing the computation of the genetic algorithm. Results show a significative improvement of the performance of Devonet in terms of accuracy.

Źródło:

Journal of Artificial Intelligence and Soft Computing Research; 2012, 2, 1; 5-20
2083-2567
2449-6499

Pojawia się w:

Journal of Artificial Intelligence and Soft Computing Research

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 14.

Tytuł:

On Some Aspects of Genetic and Evolutionary Methods for Optimization Purposes

Autorzy:

Woźniak, M.
Połap, D.

Powiązania:

https://bibliotekanauki.pl/articles/227353.pdf

Data publikacji:

2015

Wydawca:

Polska Akademia Nauk. Czytelnia Czasopism PAN

Tematy:

computational intelligence
genetic algorithm
heuristic algorithm
optimization

Opis:

In this paper, the idea of applying some hybrid genetic algorithms with gradient local search and evolutionary optimization techniques is formulated. For two different test functions the proposed versions of the algorithms have been examined. Research results are presented and discussed to show potential efficiency in optimization purposes.

Źródło:

International Journal of Electronics and Telecommunications; 2015, 61, 1; 7-16
2300-1933

Pojawia się w:

International Journal of Electronics and Telecommunications

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 15.

Tytuł:

Parallel PBIL applied to power system controller design

Autorzy:

Folly, K.

Powiązania:

https://bibliotekanauki.pl/articles/91747.pdf

Data publikacji:

2013

Wydawca:

Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych

Tematy:

Population-Based Incremental Learning algorithm
PBIL algorithm

Opis:

Population-Based Incremental Learning (PBIL) algorithm is a combination of evolutionary optimization and competitive learning derived from artificial neural networks. PBIL has recently received increasing attention in various engineering fields due to its effectiveness, easy implementation and robustness. Despite these strengths, it was reported in the last few years that PBIL suffers from issues of loss of diversity in the population. To deal with this shortcoming, this paper uses parallel PBIL based on multi-population. In parallel PBIL, two populations are used where both probability vectors (PVs) are initialized to 0.5. It is believed that by introducing two populations, the diversity in the population can be increased and better results can be obtained. The approach is applied to power system controller design. Simulations results show that the parallel PBIL approach performs better than the standard PBIL and is as effective as another diversity increasing PBIL called adaptive PBIL.

Źródło:

Journal of Artificial Intelligence and Soft Computing Research; 2013, 3, 3; 215-223
2083-2567
2449-6499

Pojawia się w:

Journal of Artificial Intelligence and Soft Computing Research

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 16.

Tytuł:

Selection of the heat transfer coefficient using swarming algorithms

Autorzy:

Gawrońska, Elżbieta
Dyja, Robert
Zych, Maria
Domek, Grzegorz

Powiązania:

https://bibliotekanauki.pl/articles/2204686.pdf

Data publikacji:

2022

Wydawca:

Politechnika Białostocka. Oficyna Wydawnicza Politechniki Białostockiej

Tematy:

swarm algorithm
ABC algorithm
ACO algorithm
heat transfer coefficient
computer simulation
numerical modelling

Opis:

The article presents the use of swarming algorithms in selecting the heat transfer coefficient, taking into account the boundary condition of the IV types. Numerical calculations were made using the proprietary TalyFEM program and classic form of swarming algorithms. A function was also used for the calculations, which, during the calculation, determined the error of the approximate solution and was minimalised using a pair of individually employed algorithms, namely artificial bee colony (ABC) and ant colony optimisation (ACO). The tests were carried out to select the heat transfer coefficient from one range. Describing the geometry for a mesh of 408 fine elements with 214 nodes, the research carried out presents two squares (one on top of the other) separated by a heat transfer layer with a κ coefficient. A type III boundary condition was established on the right and left of both edges. The upper and lower edges were isolated, and a type IV boundary condition with imperfect contact was established between the squares. Calculations were made for ABC and ACO, respectively, for populations equal to 20, 40 and 60 individuals and 2, 6 and 12 iterations. In addition, in each case, 0%, 1%, 2% and 5% noise of the reference values were also considered. The obtained results are satisfactory and very close to the reference values of the κ parameter. The obtained results demonstrate the possibility of using artificial intelligence (AI) algorithms to reconstruct the IV type boundary condition value during heat conduction modelling.

Źródło:

Acta Mechanica et Automatica; 2022, 16, 4; 325--339
1898-4088
2300-5319

Pojawia się w:

Acta Mechanica et Automatica

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 17.

Tytuł:

Teoria i metody algorytmu ewolucyjnego w uczeniu jednowarstwowej sieci neuronowej
Implementation of the Evolutionary Algorithm Theory and Methods in the Learning Process of One-Layer ANN

Autorzy:

Płaczek, Stanisław

Powiązania:

https://bibliotekanauki.pl/articles/509173.pdf

Data publikacji:

2016

Wydawca:

Akademia Finansów i Biznesu Vistula

Tematy:

algorytmy genetyczne
algorytmy ewolucyjne
sztuczne sieci neuronowe
algorytmy uczenia sieci
algorytmy selekcji
algorytmy krzyżowania
algorytmy mutacji
genetic algorithm
evolutionary algorithm
artificial neural network
learning algorithm
selection algorithm
crossover algorithm
mutation algorithm

Opis:

Rozwój teorii sztucznych sieci neuronowych, a także pojawienie się nowych, efektywnych narzędzi programistycznych (systemy wieloprocesorowe, programowanie wielowątkowe) umożliwia zastosowanie algorytmów genetycznych oraz ewolucyjnych do uczenia sztucznych sieci neuronowych (SSN). W literaturze dotyczącej zasad działania SSN podkreśla się ich atrakcyjne własności, takie jak: aproksymacja dowolnych nieliniowych odwzorowań, równolegle i rozproszone przetwarzanie, adaptacja i uczenie. Szczególnie równoległe i rozproszone przetwarzanie koresponduje ze strukturą algorytmu genetycznego i ewolucyjnego. Klasyczne algorytmy genetyczne operują na ciągach binarnych o stałej długości. Natomiast algorytmy ewolucyjne można interpretować jako uogólnienie algorytmów genetycznych. W algorytmach tych stosuje się zasady ewolucji i dziedziczenia oraz wykorzystuje się właściwą strukturę danych do reprezentacji chromosomów (liczby rzeczywiste, macierze, grafy). Definiuje się również inne operatory krzyżowania i mutacji. Tak więc struktura algorytmu ewolucyjnego jest prawie taka sama jak genetycznego. Różnice ukryte są na niższych poziomach przetwarzania – w strukturach danych. W artykule przedstawiono próbę implementacji algorytmu ewolucyjnego do uczenia jednowarstwowej sieci neuronowej. Sieć opisuje się w postaci macierzy połączeń między wektorami – wejściowym X oraz wyjściowym Y. Funkcja uczenia SSN zdefiniowana jest jako nieliniowa funkcja wag sieci oraz nieliniowej funkcji aktywacji minimalizującej błąd średniokwadratowy między wektorem wyjściowym Y a wektorem uczącym Z, dla całej paczki uczącej. Pojawienie się nieliniowości utrudnia zastosowanie algorytmu uczenia opartego na wstecznej propagacji błędu. Funkcja celu, oprócz minimum globalnego, może zawierać wiele minimów lokalnych, w których algorytm oparty na badaniu gradientu funkcji celu może się zatrzymać. Oczywiście stosuje się różne techniki i metody umożliwiające wyjście algorytmu z tego typu pułapek. Tym niemniej dla sprawdzenia poprawności otrzymanych wyników uruchamia się proces uczenia SSN dla różnych danych początkowych. W zaproponowanym algorytmie ewolucyjnym tworzy się zbiór osobników. Każdy z osobników przedstawia możliwe rozwiązanie zadania minimalizacji funkcji celu i jest reprezentowany przez macierzową strukturę danych. Każde rozwiązanie cząstkowe ocenia się na podstawie dopasowania funkcji celu, a następnie tworzy się nową populację (potomków) przez selekcję osobników o najlepszych dopasowaniach oraz dwa algorytmy krzyżowania i mutacji. W artykule omówiono zaproponowaną strukturę osobników, przyjęte algorytmy selekcji z ich wadami i zaletami oraz różne algorytmu krzyżowania i mutacji. Na wstępie zdefiniowano takie podstawowe pojęcia, jak gen, chromosom oraz najogólniejszą strukturę algorytmu ewolucyjnego. Artykuł ma charakter koncepcyjny.
The article proposes implementation of a modified version of genetic algorithms in neural networks, what in literature is known as “evolutionary algorithm” or “evolutionary programming”. An evolutionary algorithm is a probabilistic algorithm that works in a set of weight variability of neurons and seeks the optimal value solution within a population of individuals, avoiding the local maximum. For chromosomes, the real value variables and matrix structure are proposed. In the article, this decision is widely elaborated and discussed. In the original versions of genetic algorithms, all variables’ values are transformed into binary versions. The chromosomes bit sequences could include thousands of positions. It does not simplify the crossover and mutation operations. Processes could be very time-consuming and the algorithm convergence could also be slow. For a single-layer neural network matrix data structure is used. A particular emphasis is put on mutation and crossover algorithms. What is also important in both genetic and evolutionary algorithms is the selection process. The primary population, known as the parent population, is employed to build a new set of individuals using the selection process. These individuals are known as the children population. The selection algorithm should converge on the two very important issues: population diversity and selective pressure. Selective pressure can manifest in the overrepresentation of the best individuals in the new population. The area, in which the optimal solution is sought, is reduced too fast. Premature convergence is not desirable due to the high probability of achieving the local maximum. Reducing the selective pressure may result in increasing the time it takes to search for the solution.

Źródło:

Zeszyty Naukowe Uczelni Vistula; 2016, 49(4) Informatyka; 23-39
2353-2688

Pojawia się w:

Zeszyty Naukowe Uczelni Vistula

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 18.

Tytuł:

Community Clustering on Fraud Transactions Applied the Louvain-Coloring Algorithm

Autorzy:

Mardiansyah, Heru
Suwilo, Saib
Nababan, Erna Budiarti
Efendi, Syahril

Powiązania:

https://bibliotekanauki.pl/articles/27311927.pdf

Data publikacji:

2023

Wydawca:

Polska Akademia Nauk. Czasopisma i Monografie PAN

Tematy:

fraud Money Transfer
Louvain Coloring algorithm
Louvain Algorithm

Opis:

The contribution main from this research is modularity and better processing time in detecting community by using K-1 coloring. Testing performed on transaction datasets remittance on P2P platforms where the Louvain Coloring algorithm is better in comparison to Louvain Algorithm Data used is data transfer transactions made by customers on the P2P Online platform. The data is the User data that has information transfer transactions, Card data that has information card, IP data that has IP information, and Device data that has information device. Every user owns unique 128-bit identification, and other nodes representing card, device, and IP are assigned a random UUID. The Device node has the guide, and device properties. IP nodes only have property guide and node User has property fraud Money Transfer, guide, money Transfer Error Cancel Amount, first Charge back Date. Each node has a unique 128-bit guide, with the amount whole of as many as 789,856 nodes. Application technique K-1 staining on Louvain algorithm shows enhancement value modularity and better processing time for detecting community on the network large scale. Through a series of exercises and tests carried out in various scenarios, it shows that the experiments carried out in this paper, namely the Louvain Coloring algorithm, are more effective and efficient than the Louvain algorithm in scenario 1,3, and 5 meanwhile For Scenarios 2 and 4 Louvain Algorithm is better.

Źródło:

International Journal of Electronics and Telecommunications; 2023, 69, 3; 593-598
2300-1933

Pojawia się w:

International Journal of Electronics and Telecommunications

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 19.

Tytuł:

Minig rules of concept drift using genetic algorithm

Autorzy:

Vivekanandan, P.
Nedunchezhian, R.

Powiązania:

https://bibliotekanauki.pl/articles/91705.pdf

Data publikacji:

2011

Wydawca:

Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych

Tematy:

genetic algorithm
CDR-tree algorithm
rules
data mining

Opis:

In a database the data concepts changes over time and this phenomenon is called as concept drift. Rules of concept drift describe how the concept changes and sometimes they are interesting and mining those rules becomes more important. CDR tree algorithm is currently used to identify the rules of concept drift. Building a CDR tree becomes a complex process when the domain values of the attributes get increased. Genetic Algorithms are traditionally used for data mining tasks. In this paper, a Genetic Algorithm based approach is proposed for mining the rules of concept drift, which makes the mining task simpler and accurate when compared with the CDR-tree algorithm.

Źródło:

Journal of Artificial Intelligence and Soft Computing Research; 2011, 1, 2; 135-145
2083-2567
2449-6499

Pojawia się w:

Journal of Artificial Intelligence and Soft Computing Research

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 20.

Tytuł:

Profesor Tadeusz Łobos i jego algorytm A4
Professor Tadeusz Llobos and his A4 algorithm

Autorzy:

Chrzan, K. L.

Powiązania:

https://bibliotekanauki.pl/articles/1203359.pdf

Data publikacji:

2018

Wydawca:

Sieć Badawcza Łukasiewicz - Instytut Napędów i Maszyn Elektrycznych Komel

Tematy:

cyfrowa ochrona linii
algorytmy identyfikacji zwarć
algorytm Łobosa
algorytm A4
digital line protection
algorithms for distance protection
Lobos’s algorithm A4

Opis:

This document shows cirriculum vitae, scientific work and achievement of Prof. Tadeusz Łobos. The most known his achievement is algorithm A3 and especially algorithm A4. This second one was many times referred and explained in reading books. What is visible in his carrier it is a very intensive co-operation with German scientists. During 48 years scientific activity he spent over 10 years in Germany in the frame of 13 different scholarships and on the 4 years long contract in Darmstadt, Erlangen, Saarbruecken and Dresden. As alone from polish electrical engineers he became the prestigious Humboldt Research Award. Tadeusz Łobos published over 300 articles and conference papers, got 7 patents and was the supervisor of 13 doctor theses.
W pracy opisano życiorys, pracę naukową i osiągnięcia prof. Tadeusza Łobosa. Najbardziej znanym jego osiągnięciem są algorytmy Łobosa A3, a szczególnie algorytm A4 wielokrotnie cytowany i opisany w książkach. Zwraca uwagę niezwykle intensywna współpraca z partnerami niemieckimi. W ciągu swej 48 letniej pracy naukowej, przebywał w sumie ponad 10 lat na co najmniej 13 stypendiach oraz 4-letnim kontrakcie w Darmstadzie, Erlangen, Saarbruecken i Dreźnie. Jako jedyny polski elektrotechnik otrzymał prestiżową Humboldt Research Award, opublikował ponad 300 artykułów i referatów konferencyjnych, otrzymał 7 patentów i był promotorem 13 prac doktorskich.

Źródło:

Maszyny Elektryczne: zeszyty problemowe; 2018, 4, 120; 143-147
0239-3646
2084-5618

Pojawia się w:

Maszyny Elektryczne: zeszyty problemowe

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 21.

Tytuł:

Implementing evolutionary algorithm into training single-layer artificial neural network in classification task

Autorzy:

Płaczek, S.

Powiązania:

https://bibliotekanauki.pl/articles/95001.pdf

Data publikacji:

2016

Wydawca:

Szkoła Główna Gospodarstwa Wiejskiego w Warszawie. Wydawnictwo Szkoły Głównej Gospodarstwa Wiejskiego w Warszawie

Tematy:

genetic algorithm
evolutionary algorithm
selection process
mutation
recombination
replacement

Opis:

The article proposes implementing a modified version of genetic algorithm in a neural network, what in literature is known as “evolutionary algorithm” or “evolutionary programming”. An Evolutionary Algorithm is a probabilistic algorithm that works in a set of weight variability of neurons and seeks the optimal value solution within a population of individuals, avoiding the local maximum. For chromosomes the real value variables and matrix structure are proposed to a single-layer neural network. Particular emphasis is put on mutation and crossover algorithms. What is also important in both genetic and evolutionary algorithms is the selection process. In the calculation example, the implementation of theoretical considerations to a classification task is demonstrated.

Źródło:

Information Systems in Management; 2016, 5, 3; 377-388
2084-5537
2544-1728

Pojawia się w:

Information Systems in Management

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 22.

Tytuł:

Real-time interpolation of streaming data

Autorzy:

Dębski, Roman

Powiązania:

https://bibliotekanauki.pl/articles/1839246.pdf

Data publikacji:

2020

Wydawca:

Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH

Tematy:

streaming algorithm
online algorithm
spline interpolation
cubic Hermite spline

Opis:

One of the key elements of the real-time C 1 -continuous cubic spline interpolation of streaming data is an estimator of the first derivative of the interpolated function that is more accurate than those based on finite difference schemas. Two such greedy look-ahead heuristic estimators, based on the calculus of variations (denoted as MinBE and MinAJ2), are formally defined (in closed form), along with the corresponding cubic splines that they generate. They are then comparatively evaluated in a series of numerical experiments involving different types of performance measures. The presented results show that the cubic Hermite splines generated by heuristic MinAJ2 significantly outperformed those that were based on finite difference schemas in terms of all of the tested performance measures (including convergence). The proposed approach is quite general. It can be directly applied to streams of univariate functional data like time-series. Multi-dimensional curves that are defined parametrically (after splitting) can be handled as well. The streaming character of the algorithm means that it can also be useful in processing data sets that are too large to fit in the memory (e.g., edge computing devices, embedded time-series databases).

Źródło:

Computer Science; 2020, 21 (4); 513-532
1508-2806
2300-7036

Pojawia się w:

Computer Science

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 23.

Tytuł:

Empirical Evaluation of Oclus and Genrandomclust Algorithms of Generating Cluster Structures

Autorzy:

Korzeniewski, Jerzy

Powiązania:

https://bibliotekanauki.pl/articles/973546.pdf

Data publikacji:

2014

Wydawca:

Główny Urząd Statystyczny

Tematy:

cluster analysis
cluster structure generation
OCLUS algorithm
genRandomClust algorithm

Opis:

The OCLUS algorithm and genRandomClust algorithm are newest proposals of generating multivariate cluster structures. Both methods have the capacity of controlling cluster overlap, but both do it quite differently. It seems that OCLUS method has much easier, intuitive interpretation. In order to verify this opinion a comparative assessment of both algorithms was carried out. For both methods multiple cluster structures were generated and each of them was grouped into the proper number of clusters using k-means. The groupings were assessed by means of divisions similarity index (modified Rand index) referring to the classification resulting from the generation. The comparison criterion is the behaviour of the overlap parameters of structures. The monotonicity of the overlap parameters with respect to the similarity index is assessed as well as the variability of the similarity index for the fixed value of overlap parameters. Moreover, particular attention is given to checking the existence of an overlap parameter limit for the classical grouping procedures as well as uniform nature of overlap control with respect to all clusters.

Źródło:

Statistics in Transition new series; 2014, 15, 3; 487-494
1234-7655

Pojawia się w:

Statistics in Transition new series

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 24.

Tytuł:

Application of the Rasch model in categorical pedigree analysis using MCEM: I binary data

Autorzy:

Qian, G.
Huggins, R.
Loesch, D.

Powiązania:

https://bibliotekanauki.pl/articles/729756.pdf

Data publikacji:

2004

Wydawca:

Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii

Tematy:

pedigree analysis
binary data
MCEM algorithm
Metropolis-Hastings algorithm

Opis:

An extension of the Rasch model with correlated latent variables is proposed to model correlated binary data within families. The latent variables have the classical correlation structure of Fisher (1918) and the model parameters thus have genetic interpretations. The proposed model is fitted to data using a hybrid of the Metropolis-Hastings algorithm and the MCEM modification of the EM-algorithm and is illustrated using genotype-phenotype data on a psychological subtest in families where some members are affected by the genetic disorder fragile X. In addition, hypothesis testing and model selection methods based on the Wald statistic are discussed.

Źródło:

Discussiones Mathematicae Probability and Statistics; 2004, 24, 2; 255-280
1509-9423

Pojawia się w:

Discussiones Mathematicae Probability and Statistics

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 25.

Tytuł:

Combinatorial Properties and Defragmentation Algorithms in WSW1 Switching Fabrics

Autorzy:

Rajewski, Remigiusz
Kabaciński, Wojciech
Al-Tameemi, Atyaf

Powiązania:

https://bibliotekanauki.pl/articles/227184.pdf

Data publikacji:

2020

Wydawca:

Polska Akademia Nauk. Czytelnia Czasopism PAN

Tematy:

elastic optical network
switching networks
rearrenging algorithm
defragmentation algorithm

Opis:

A spectrum defragmentation problem in elastic optical networks was considered under the assumption that all connections can be realized in switching nodes. But this assumption is true only when the switching fabric has appropriate combinatorial properties. In this paper, we consider a defragmentation problem in one architecture of wavelength-space-wavelength switching fabrics. First, we discuss the requirements for this switching fabric, below which defragmentation does not always end with success. Then, we propose defragmentation algorithms and evaluate them by simulation. The results show that proposed algorithms can increase the number of connections realized in the switching fabric and reduce the loss probability.

Źródło:

International Journal of Electronics and Telecommunications; 2020, 66, 1; 99-105
2300-1933

Pojawia się w:

International Journal of Electronics and Telecommunications

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 26.

Tytuł:

Parallel MCNN (PMCNN) with application to prototype selection on large and streaming data

Autorzy:

Devi, V. S.
Meena, L.

Powiązania:

https://bibliotekanauki.pl/articles/91686.pdf

Data publikacji:

2017

Wydawca:

Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych

Tematy:

prototype selection
one-pass algorithm
streaming data
distributed algorithm

Opis:

The Modified Condensed Nearest Neighbour (MCNN) algorithm for prototype selection is order-independent, unlike the Condensed Nearest Neighbour (CNN) algorithm. Though MCNN gives better performance, the time requirement is much higher than for CNN. To mitigate this, we propose a distributed approach called Parallel MCNN (pMCNN) which cuts down the time drastically while maintaining good performance. We have proposed two incremental algorithms using MCNN to carry out prototype selection on large and streaming data. The results of these algorithms using MCNN and pMCNN have been compared with an existing algorithm for streaming data.

Źródło:

Journal of Artificial Intelligence and Soft Computing Research; 2017, 7, 3; 155-169
2083-2567
2449-6499

Pojawia się w:

Journal of Artificial Intelligence and Soft Computing Research

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 27.

Tytuł:

New Methods for Designing and Reduction of Neuro-Fuzzy Systems

Autorzy:

Cpałka, K.

Powiązania:

https://bibliotekanauki.pl/articles/108790.pdf

Data publikacji:

2010

Wydawca:

Społeczna Akademia Nauk w Łodzi

Tematy:

algorithm of best global eliminations
algorithm of best local eliminations
consecutive eliminations algorithm
consecutive mergings algorithm
interpretability
logical approach
neuro-fuzzy system

Opis:

In the paper, we propose novel methods for designing and reduction of neuro-fuzzy systems without the deterioration of their accuracy. The reduction and merging algorithms gradually eliminate inputs, rules, antecedents, and the number of discretization points of integrals in the center of area defuzzification method. Our algorithms have been tested using well known classification benchmark.

Źródło:

Journal of Applied Computer Science Methods; 2010, 2 No. 2; 113-126
1689-9636

Pojawia się w:

Journal of Applied Computer Science Methods

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 28.

Tytuł:

A lower bound on the independence number of a graph in terms of degrees

Autorzy:

Harant, Jochen
Schiermeyer, Ingo

Powiązania:

https://bibliotekanauki.pl/articles/743603.pdf

Data publikacji:

2006

Wydawca:

Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii

Tematy:

independence
stability
algorithm

Opis:

For a connected and non-complete graph, a new lower bound on its independence number is proved. It is shown that this bound is realizable by the well known efficient algorithm MIN.

Źródło:

Discussiones Mathematicae Graph Theory; 2006, 26, 3; 431-437
2083-5892

Pojawia się w:

Discussiones Mathematicae Graph Theory

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 29.

Tytuł:

Clustering large-scale data based on modified affinity propagation algorithm

Autorzy:

Serdah, A. M.
Ashour, W. M.

Powiązania:

https://bibliotekanauki.pl/articles/91694.pdf

Data publikacji:

2016

Wydawca:

Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych

Tematy:

clustering
clustering algorithm
data clustering algorithm
propagation algorithm
Affinity Propagation
AP
klasteryzacja
algorytm klastrowania
algorytm propagacji

Opis:

Traditional clustering algorithms are no longer suitable for use in data mining applications that make use of large-scale data. There have been many large-scale data clustering algorithms proposed in recent years, but most of them do not achieve clustering with high quality. Despite that Affinity Propagation (AP) is effective and accurate in normal data clustering, but it is not effective for large-scale data. This paper proposes two methods for large-scale data clustering that depend on a modified version of AP algorithm. The proposed methods are set to ensure both low time complexity and good accuracy of the clustering method. Firstly, a data set is divided into several subsets using one of two methods random fragmentation or K-means. Secondly, subsets are clustered into K clusters using K-Affinity Propagation (KAP) algorithm to select local cluster exemplars in each subset. Thirdly, the inverse weighted clustering algorithm is performed on all local cluster exemplars to select well-suited global exemplars of the whole data set. Finally, all the data points are clustered by the similarity between all global exemplars and each data point. Results show that the proposed clustering method can significantly reduce the clustering time and produce better clustering result in a way that is more effective and accurate than AP, KAP, and HAP algorithms.

Źródło:

Journal of Artificial Intelligence and Soft Computing Research; 2016, 6, 1; 23-33
2083-2567
2449-6499

Pojawia się w:

Journal of Artificial Intelligence and Soft Computing Research

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 30.

Tytuł:

Performance investigation and element optimization of 2D array transducer using Bat Algorithm

Autorzy:

Tantawy, Dina Mohamed
Eladawy, Mohamed
Hassan, Mohamed Alimaher
Mubarak, Roaa

Powiązania:

https://bibliotekanauki.pl/articles/140685.pdf

Data publikacji:

2020

Wydawca:

Polska Akademia Nauk. Czytelnia Czasopism PAN

Tematy:

2D ultrasound arrays
Binary Bat Algorithm
Genetic Algorithm
Optimization

Opis:

One of the least expensive and safest diagnostic modalities routinely used is ultrasound imaging. An attractive development in this field is a two-dimensional (2D) matrix probe with three-dimensional (3D) imaging. The main problems to implement this probe come from a large number of elements they need to use. When the number of elements is reduced the side lobes arising from the transducer change along with the grating lobes that are linked to the periodic disposition of the elements. The grating lobes are reduced by placing the elements without any consideration of the grid. In this study, the Binary Bat Algorithm (BBA) is used to optimize the number of active elements in order to lower the side lobe level. The results are compared to other optimization methods to validate the proposed algorithm.

Źródło:

Archives of Electrical Engineering; 2020, 69, 3; 561-579
1427-4221
2300-2506

Pojawia się w:

Archives of Electrical Engineering

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 31.

Tytuł:

Multilevel inverter with optimal THD through the firefly algorithm

Autorzy:

El Mehdi Belkacem, R.
Benzid, R.
Bouguechal, N.

Powiązania:

https://bibliotekanauki.pl/articles/141495.pdf

Data publikacji:

2017

Wydawca:

Polska Akademia Nauk. Czytelnia Czasopism PAN

Tematy:

firefly algorithm (FFA)
genetic algorithm (GA)
inverter
multilevel
optimized THD

Opis:

Reduction of the Total Harmonic Distortion (THD) in multilevel inverters requires resolution of complex nonlinear transcendental equations; in this paper we propose a combination of one of the best existing optimized hardware structures with the recent firefly algorithm, which was used to optimize the THD, through finding the best switching angles and guaranteeing the minimization of harmonics within a user defined bandwidth. The obtained THD through the simulation of the thirteen-level symmetric inverter has been reduced down to 5% (FFT of 60 harmonics). In order to validate the simulation results, a thirteen-level symmetric inverter prototype has been made, and practically experimented and tested with different loads. Consequently, the measured THD with resistive load was 4.7% on a bandwidth of 3 kHz. The main advantage of the achieved work is the reduction of the THD.

Źródło:

Archives of Electrical Engineering; 2017, 66, 1; 141-154
1427-4221
2300-2506

Pojawia się w:

Archives of Electrical Engineering

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 32.

Tytuł:

Quantum Factorization of Integers 21 and 91 using Shor’s Algorithm

Autorzy:

Ardhyamath, Poornima
Naghabhushana, N. M.
Ujjinimatad, Rohitha

Powiązania:

https://bibliotekanauki.pl/articles/1070857.pdf

Data publikacji:

2019

Wydawca:

Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN

Tematy:

Euclidean Algorithm
Factorization
GCD
Quantum Fourier Transform
Shor’s Algorithm

Opis:

In this paper we focused on the factorization of integer in detail using well known Shor’s algorithm and its quantum part realization. The algorithm finds prime factors any integer more efficiently than any known classical algorithm. It is based on prior knowledge of the answer to the factorization problem. Algorithm includes finding gcd using polynomial time Euclidean algorithm, determination of unknown period from quantum computer and continued fraction expansion approach. Factorization of two integers 21 and 91 are shown in this paper with all steps. Quantum part of the factorization described mathematically.

Źródło:

World Scientific News; 2019, 123; 102-113
2392-2192

Pojawia się w:

World Scientific News

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 33.

Tytuł:

Znaczenie algorytmu dydaktycznego w projektowaniu multimedialnych programów dydaktycznych
The importance of the algorithm in the design of multimedia teaching programs

Autorzy:

LIB, Waldemar

Powiązania:

https://bibliotekanauki.pl/articles/456222.pdf

Data publikacji:

2010

Wydawca:

Uniwersytet Rzeszowski

Tematy:

algorytm
algorytm dydaktyczny
multimedialny program
algorithm
didactic algorithm
multimedia program

Opis:

Komputerowe programy prezentacyjne oraz łatwe w obsłudze edytory języków programowania stworzyły nauczycielom nieograniczone moŜliwości projektowania i wykonywania własnych opracowań metodycznych opartych na technologiach informatycznych i informacyjnych. Jak wielkie znaczenie cywilizacyjne wywarło upowszechnienie się hiperteksu wyjaśnia szerzej W. Furmanek w opracowaniu Cywilizacyjne i osobowe znaczenie hipertekstu [2008]. W artykule poruszana jest problematyka związana z projektowaniem multimedialnych programów dydaktycznych. To na etapie projektowania podejmowane są decyzje dotyczące struktury programu dydaktycznego, sposobu prezentowania treści kształcenia, ich układu metodycznego, doboru mediów słuŜących do przekazywania i sprawdzania nowo nabytych wiadomości. Często konsekwencją ustalenia struktury multimedialnego programu dydaktycznego i zastosowania określonych mediów jest wybór technologii informatycznych słuŜących do jego realizacji.
Presentation computer programs and easy to use word processors for programming language have offered teachers inexhaustible possibilities of designing and performing their own methodological studies based on information technology. W. Furmanek broadly explains the civilisation significance of popularising a hypertext in the study Civilisation and personal significance of hypertext (2008). The article presents the issues connected with designing multimedia didactic programmes. During the designing stage, there are decisions taken on the structure of a didactic programme, the way of presenting its educational contents, their methodological layout as well as the adjustment of media needed to pass and check newly acquired knowledge. In most cases, the creation of the structure of a multimedia didactic programme and application of specific media relies on the selection of information technologies that allow for its implementation.

Źródło:

Edukacja-Technika-Informatyka; 2012, 3, 2; 173-181
2080-9069

Pojawia się w:

Edukacja-Technika-Informatyka

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 34.

Tytuł:

Methods for imputation of missing values and their influence on the results of segmentation research
Metody uzupełniania braków danych i ich wpływ na wyniki badań segmentacyjnych.

Autorzy:

Gąsior, Marcin
Skowron, Łukasz

Powiązania:

https://bibliotekanauki.pl/articles/425241.pdf

Data publikacji:

2016

Wydawca:

Wydawnictwo Uniwersytetu Ekonomicznego we Wrocławiu

Tematy:

missing values
cluster analysis
k-means algorithm
k-medoids algorithm

Opis:

The lack of answers is a common problem in all types of research, especially in the field of social sciences. Hence a number of solutions were developed, including the analysis of complete cases or imputations that supplement the missing value with a value calculated according to different algorithms. This paper evaluates the influence of the adopted method for the supplementation of missing answers regarding the result of segmentation conducted with the use of cluster analysis. In order to achieve this we used a set of data from an actual consumer research in which the cases with missing values were deleted or supplemented with the use of various methods. Cluster analyses were then performed on those sets of data, both with the assumption of ordinal and ratio level of measurement, and then the grouping quality, as expressed by different indicators, was evaluated. This research proved the advantage of imputation over the analysis of complete cases, it also proved the validity of using more complex approaches than the simple supplementation with an average or median value.

Źródło:

Econometrics. Ekonometria. Advances in Applied Data Analytics; 2016, 4 (54); 61-71
1507-3866

Pojawia się w:

Econometrics. Ekonometria. Advances in Applied Data Analytics

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 35.

Tytuł:

Nash-lambda algorithm with applications in safety and reliability

Autorzy:

Cui, Y.
Guo, R.

Powiązania:

https://bibliotekanauki.pl/articles/2069567.pdf

Data publikacji:

2011

Wydawca:

Uniwersytet Morski w Gdyni. Polskie Towarzystwo Bezpieczeństwa i Niezawodności

Tematy:

lambda algorithm
Nash equilibrium
genetic algorithm
safety
reliability
terrorist threa

Opis:

In this paper, a new algorithm, named as Nash-lambda algorithm by merging Nash equilibrium solution and the lambda algorithm, is proposed. The lambda algorithm, a new global optimization algorithm, is created by imitating ancient Chinese human body system model, which has already demonstrated its simplicity in searching scheme, codes and efficiency in computation comparing to the genetic algorithm. The noncorporative game environments determine the optimization problems which are different from those of the traditional safety and reliability optimizations because of the engagement of the Nash equilibrium for seeking the best strategy. The lambda algorithm serves the searching the Nash equilibrium solution efficiently. In other worlds, the Nash-lambda algorithm is just developed to address the optimization problems of the multiple objective functions representing non-corporative players’ interests.

Źródło:

Journal of Polish Safety and Reliability Association; 2011, 2, 1; 51--58
2084-5316

Pojawia się w:

Journal of Polish Safety and Reliability Association

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 36.

Tytuł:

Lambda algorithm and maximum likelihood estimation

Autorzy:

Cui, Y.
Guo, R.
Guo, D.

Powiązania:

https://bibliotekanauki.pl/articles/2069616.pdf

Data publikacji:

2011

Wydawca:

Uniwersytet Morski w Gdyni. Polskie Towarzystwo Bezpieczeństwa i Niezawodności

Tematy:

lambda algorithm
genetic algorithm
reliability
repairable system
likelihood-lambda procedure

Opis:

In this paper, a new global optimization algorithm by imitating ancient Chinese human body system model, named as lambda algorithm, is introduced. The lambda algorithm utilizes five-element multi-segment string to represent the n-dimensional Euclidean point and hence the string based operation rules for expansion, comparison and sorting candidate strings. The algorithm enjoys the simplest mathematical operations but generates highest searching speed and accuracy. We furthermore explore to merge the lambda algorithm with maximum likelihood procedure for creating a non-derivative scheme – likelihood- lambda procedure. A illustrative example is given.

Źródło:

Journal of Polish Safety and Reliability Association; 2011, 2, 1; 59--72
2084-5316

Pojawia się w:

Journal of Polish Safety and Reliability Association

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 37.

Tytuł:

Parallel constructing of the shortest coverings of large Boolean matrices

Autorzy:

Novikov, S.

Powiązania:

https://bibliotekanauki.pl/articles/92853.pdf

Data publikacji:

2016

Wydawca:

Uniwersytet Przyrodniczo-Humanistyczny w Siedlcach

Tematy:

Boolean matrix
shortest covering
decomposition
sequential algorithm
parallel algorithm
cluster

Opis:

The paper presents two options of the parallel algorithm for finding the shortest covering of a large Boolean matrix, where the decomposition of the initial matrix into matrices of smaller sizes is based on the partitioning of rows. The parallel algorithm COVMB contains sequential algorithms for partitioning of initial m × n Boolean matrix on submatrices, building special matrices, summering of the shortest coverings of special Boolean matrices with smaller sizes as well as the sequential algorithm SECNOP for finding the shortest coverings of smaller Boolean matrices.

Źródło:

Studia Informatica : systems and information technology; 2016, 1-2(20); 27-37
1731-2264

Pojawia się w:

Studia Informatica : systems and information technology

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 38.

Tytuł:

Evolutionary computing in operational research for two-layer neural networks

Autorzy:

Płaczek, S.

Powiązania:

https://bibliotekanauki.pl/articles/94935.pdf

Data publikacji:

2017

Wydawca:

Szkoła Główna Gospodarstwa Wiejskiego w Warszawie. Wydawnictwo Szkoły Głównej Gospodarstwa Wiejskiego w Warszawie

Tematy:

evolutionary algorithm
neural network
optimization algorithm
mutation operator
crossover operator

Opis:

Considering the non-linear characteristics of the activation functions, the entire task is multidimensional and non-linear with a multimodal target function. Implementing evolutionary computing in the multimodal optimization tasks gives developers new and effective tools for seeking the global minimum. A developer has to find the optimal and simple transformation between the realization of a phenotype and a genotype. In the article, a two-layer neural network is analysed. In the first step, the population is created. In the main algorithm loop, a parent selection mechanism is used together with the fitness function. To evaluate the quality of evolutionary computing process different measured characteristics are used. The final results are depicted using charts and tables.

Źródło:

Information Systems in Management; 2017, 6, 2; 119-130
2084-5537
2544-1728

Pojawia się w:

Information Systems in Management

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 39.

Tytuł:

FPGA-based secure and noiseless image transmission using lea and optimized bilateral filter

Autorzy:

Hebbale, Sunil B.
Akula, V.S. Giridhar
Baraki, Parashuram

Powiązania:

https://bibliotekanauki.pl/articles/27312891.pdf

Data publikacji:

2022

Wydawca:

Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH

Tematy:

lightweight encryption algorithm
bilateral filter
whale optimization algorithm
discrete wavelet transform

Opis:

In today’s world, the transmission of secured and noiseless images is a difficult task. Therefore, effective strategies are important for securing data or secret images from attackers. Besides, denoising approaches are important for obtaining noise-free images. For this, an effective crypto-steganography method that is based on a lightweight encryption algorithm (LEA) and the modified least significant bit (MLSB) method for secured transmission is proposed. Moreover, a bilateral filter-based whale optimization algorithm (WOA) is used for image denoising. Before the image transmission, a secret image is encrypted by the LEA algorithm and embedded into the cover image using discrete wavelet transform (DWT) and MLSB techniques. After the image transmission, an extraction process is performed in order to recover the secret image. Finally, a bilateral WOA filter is used to remove the noise from the secret image. The Verilog code for the proposed model is designed and simulated in Xilinx software. Finally, the simulation results show that the proposed filtering technique results in performance that is superior to conventional bilateral and Gaussian filters in terms of the peak signal-to-noise ratio (PSNR) and structural similarity index measure (SSIM).

Źródło:

Computer Science; 2022, 23 (4); 451--466
1508-2806
2300-7036

Pojawia się w:

Computer Science

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 40.

Tytuł:

Model i implementacja systemowego algorytmu ewolucyjnego do poszukiwania nowego stanu systemu elektroenergetycznej sieci przesyłowej

Autorzy:

Tchórzewski, J.
Ruciński, A.

Powiązania:

https://bibliotekanauki.pl/articles/92875.pdf

Data publikacji:

2005

Wydawca:

Uniwersytet Przyrodniczo-Humanistyczny w Siedlcach

Tematy:

algorytm genetyczny
systemowy algorytm ewolucyjny
SAE
genetic algorithm
system evolving algorithm

Opis:

In article some results of using system evolving algorithm SAE for search a new state of development of electric power transmission network Is presented. Electric power transmission network Is simulated as a operator of transmission system (polish: Operator Systemu Przesyłowego: OSP). It is received by them existing distributed beginning popu¬lation and existing fitness function which takes advantage of systems divergence. Identification of electric power transmission system (ESP) which Is understudied as technology system and which Is management by OSP is carried out using System Identification Toolbox. In result Is obtained model of system in characteristic form such as th, tf, zpk, ss, ABCD. Next on the base model of OSP in transmission form Is generated beginning population, which Is using as chromosome population. After them SAE algorithm Is generated new population, by them SAE Is implemented in Matlab language. Results which Is obtained In this process was Interpreted using function from for example Control System Toolbox.

Źródło:

Studia Informatica : systems and information technology; 2005, 1(5); 59-67
1731-2264

Pojawia się w:

Studia Informatica : systems and information technology

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 41.

Tytuł:

Multi-objective optimization of high speed vehicle-passenger catamaran by genetic algorithm. Part II. Computational simulations

Autorzy:

Sekulski, Z.

Powiązania:

https://bibliotekanauki.pl/articles/260598.pdf

Data publikacji:

2011

Wydawca:

Politechnika Gdańska. Wydział Inżynierii Mechanicznej i Okrętownictwa

Tematy:

ship structure
multi-objective optimization
evolutionary algorithm
genetic algorithm
Pareto domination

Opis:

Real ship structural design problems are usually characterized by presence of many conflicting objectives. Simultaneously, a complete definition of the optimum structural design requires a formulation of size-topology-shape-material optimization task unifying the optimization problems of the four areas and giving an effective solution of the problem. So far, a significant progress towards the solution of the problem has not been obtained. An objective of the present paper was to develop an evolutionary algorithm for multiobjective optimization of structural elements of large spatial sections of ships. Selected elements of the multi-criteria optimization theory have been presented in detail. Methods for solution of the multi-criteria optimization problems have been discussed with the focus on the evolutionary optimization algorithms. In the paper an evolutionary algorithm where selection takes place based on the aggregated objective function combined with domination attributes as well as distance to the asymptotic solution, is proposed and applied to solve the problem of optimizing structural elements with respect to their weight and surface area on a high speed vehicle-passenger catamaran structure, with several design variables, such as plate thickness, scantlings of longitudinal stiffeners and transverse frames, and spacing between longitudinal and transversal members, taken into account. Details of the computational models were at the level typical for conceptual design. Scantlings were analyzed by using selected rules of a classification society. The results of numerical experiments with the use of the developed algorithm, are presented. They show that the proposed genetic algorithm can be an efficient tool for multi-objective optimization of ship structures. The paper is published in three parts: Part I: Theoretical background on evolutionary multi-objective optimization, Part II: Computational investigations, and Part III: Analysis of the results.

Źródło:

Polish Maritime Research; 2011, 3; 3-30
1233-2585

Pojawia się w:

Polish Maritime Research

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 42.

Tytuł:

Predicting in multivariate incomplete time series. Application of the expectation-maximisation algorithm supplemented by the Newton-Raphson method

Autorzy:

Korczyński, Adam

Powiązania:

https://bibliotekanauki.pl/articles/1806793.pdf

Data publikacji:

2021-08-24

Wydawca:

Główny Urząd Statystyczny

Tematy:

missing data
multivariate time series
expectation-maximisation algorithm
Newton-Raphson algorithm

Opis:

Statistical practice requires various imperfections resulting from the nature of data to be addressed. Data containing different types of measurement errors and irregularities, such as missing observations, have to be modelled. The study presented in the paper concerns the application of the expectation-maximisation (EM) algorithm to calculate maximum likelihood estimates, using an autoregressive model as an example. The model allows describing a process observed only through measurements with certain level of precision and through more than one data series. The studied series are affected by a measurement error and interrupted in some time periods, which causes the information for parameters estimation and later for prediction to be less precise. The presented technique aims to compensate for missing data in time series. The missing data appear in the form of breaks in the source of the signal. The adjustment has been performed by the EM algorithm to a hybrid version, supplemented by the Newton-Raphson method. This technique allows the estimation of more complex models. The formulation of the substantive model of an autoregressive process affected by noise is outlined, as well as the adjustment introduced to overcome the issue of missing data. The extended version of the algorithm has been verified using sampled data from a model serving as an example for the examined process. The verification demonstrated that the joint EM and Newton-Raphson algorithms converged with a relatively small number of iterations and resulted in the restoration of the information lost due to missing data, providing more accurate predictions than the original algorithm. The study also features an example of the application of the supplemented algorithm to some empirical data (in the calculation of a forecasted demand for newspapers).

Źródło:

Przegląd Statystyczny; 2021, 68, 1; 17-46
0033-2372

Pojawia się w:

Przegląd Statystyczny

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 43.

Tytuł:

Mosaic reasoning for discoveries

Autorzy:

Stilman, B.

Powiązania:

https://bibliotekanauki.pl/articles/91717.pdf

Data publikacji:

2013

Wydawca:

Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych

Tematy:

algorithm optimizing warfighting
Linguistic Geometry
LG
Algorithm of Discovery
DNA
mosaic

Opis:

We investigate structure of the Primary Language of the human brain as introduced by J. von Neumann in 1957. Two components have been investigated, the algorithm optimizing warfighting, Linguistic Geometry (LG), and the algorithm for inventing new algorithms, the Algorithm of Discovery. The latter is based on multiple thought experiments, which manifest themselves via mental visual streams (“mental movies”). There are Observation, Construction and Validation classes of streams. Several visual streams can run concurrently and exchange information between each other. The streams may initiate additional thought experiments, program them, and execute them in due course. The visual streams are focused employing the algorithm of “a child playing a construction set” that includes a visual model, a construction set, and the Ghost. Mosaic reasoning introduced in this paper is one of the major means to focusing visual streams in a desired direction. It uses analogy with an assembly of a picture of various colorful tiles, components of a construction set. In investigating role of mosaic reasoning in the Algorithm of Discovery, in this paper, I replay a series of four thought experiments related to the discovery of the structure of the molecule of DNA. Only the fourth experiment was successful. This series of experiments reveals how a sequence of failures eventually leads the Algorithm to a discovery. This series permits to expose the key components of the mosaic reasoning, tiles and aggregates, local and global matching rules, and unstructured environment. In particular, it reveals the aggregates and the rules that played critical role in the discovery of the structure of DNA. They include the generator and the plug-in aggregates, the transformation and complementarity matching rules, and the type of unstructured environment. For the first time, the Algorithm of Discovery has been applied to replaying discoveries not related to LG and even to mathematics.

Źródło:

Journal of Artificial Intelligence and Soft Computing Research; 2013, 3, 3; 147-173
2083-2567
2449-6499

Pojawia się w:

Journal of Artificial Intelligence and Soft Computing Research

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 44.

Tytuł:

Wykorzystanie algorytmów genetycznych i mrówkowych w problemach transportowych
Using genetic and ant algorithms to solve transport problems

Autorzy:

Zduńczuk, J.
Przystupa, W.

Powiązania:

https://bibliotekanauki.pl/articles/287396.pdf

Data publikacji:

2008

Wydawca:

Polskie Towarzystwo Inżynierii Rolniczej

Tematy:

transport
algorytm genetyczny
algorytm mrówkowy
metaheurystyka
genetic algorithm
ant algorithm
metaheuristics

Opis:

W pracy przedstawiono możliwości zastosowania metaheurystyk w transporcie. Przy użyciu algorytmu genetycznego i mrówkowego dokonano optymalizacji długości trasy przejazdu, a rezultaty porównano ze znanymi wynikami. Przedstawiono również próbę optymalizacji tras ze względu na czas trwania przejazdu.
The paper presents possibilities to employ metaheuristics in transport. The research involved using genetic and ant algorithm to optimise drive/ride route length, and obtained results were compared to known results. Moreover, the paper presents an effort to optimise routes with regard to drive duration.

Źródło:

Inżynieria Rolnicza; 2008, R. 12, nr 7(105), 7(105); 237-243
1429-7264

Pojawia się w:

Inżynieria Rolnicza

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 45.

Tytuł:

Timber wolf optimization algorithm for real power loss diminution

Autorzy:

Lenin, Kanagasabai

Powiązania:

https://bibliotekanauki.pl/articles/950973.pdf

Data publikacji:

2020

Wydawca:

Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów

Tematy:

TWO algorithm
optimal reactive power
transmission loss
Timber Wolf optimization algorithm

Opis:

In this paper Timber Wolf optimization (TWO) algorithm is proposed to solve optimal reactive power problem. Timber Wolf optimization (TWO) algorithm is modeled based on the social hierarchy and hunting habits of Timber wolf towards finding prey. Based on their fitness values social hierarchy has been replicated by classifying the population of exploration agents. Exploration procedure has been modeled by imitating the hunting actions of timber wolf by using searching, encircling, and attacking the prey. There are three fittest candidate solutions embedded as α, β and γ to lead the population toward capable regions of the exploration space in each iteration of Timber Wolf optimization. Proposed Timber Wolf optimization (TWO) algorithm has been tested in standard IEEE 14, 30 bus test systems and simulation results show the projected algorithm reduced the real power loss efficiently.

Źródło:

Journal of Automation Mobile Robotics and Intelligent Systems; 2020, 14, 1; 24-28
1897-8649
2080-2145

Pojawia się w:

Journal of Automation Mobile Robotics and Intelligent Systems

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 46.

Tytuł:

Improved Method of Searching the Associative Rules while Developing the Software

Autorzy:

Savchuk, Tamara O.
Pryimak, Natalia V.
Slyusarenko, Nina V.
Smolarz, Andrzej
Smailova, Saule
Amirgaliyev, Yedilkhan

Powiązania:

https://bibliotekanauki.pl/articles/226118.pdf

Data publikacji:

2020

Wydawca:

Polska Akademia Nauk. Czytelnia Czasopism PAN

Tematy:

software development
classification
C4.5 algorithm
associated rules
FPG-algorithm

Opis:

As the delivery of good quality software in time is a very important part of the software development process, it's a very important task to organize this process very accurately. For this, a new method of the searching associative rules were proposed. It is based on the classification of all tasks on three different groups, depending on their difficulty, and after this, searching associative rules among them, which will help to define the time necessary to perform a specific task by the specific developer.

Źródło:

International Journal of Electronics and Telecommunications; 2020, 66, 3; 425-430
2300-1933

Pojawia się w:

International Journal of Electronics and Telecommunications

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 47.

Tytuł:

The golden algorithm and the Tower of Babel versus freedom and democracy: the answer to biodiversity

Autorzy:

Flick, Giovanni Maria

Powiązania:

https://bibliotekanauki.pl/articles/28865975.pdf

Data publikacji:

2023

Wydawca:

Uniwersytet im. Adama Mickiewicza w Poznaniu

Tematy:

algorithm
freedom
democracy
biodiversity

Źródło:

Ruch Prawniczy, Ekonomiczny i Socjologiczny; 2023, 85, 3; 5-12
0035-9629
2543-9170

Pojawia się w:

Ruch Prawniczy, Ekonomiczny i Socjologiczny

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 48.

Tytuł:

Application of the Apriori algorithm in the management of sports training

Autorzy:

Nawrocka, Monika
Nawrocki, Mateusz
Kostorz, Karolina
Dygacz, Agnieszka

Powiązania:

https://bibliotekanauki.pl/articles/1179490.pdf

Data publikacji:

2017

Wydawca:

Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN

Tematy:

algorithm
management
sports training

Opis:

The objective of the study was to test the Apriori algorithm of classification for obtaining training components that are connected with one another in the strongest way, in athletic training of race walkers. The presented algorithm expansion of the selection process will also generalize and obtain a system for recognizing the effectiveness of athletic training. Furthermore, particular properties of the criteria of component sets will be specified in terms of general selection in order to combine the relative and non-relative criteria.

Źródło:

World Scientific News; 2017, 78; 255-266
2392-2192

Pojawia się w:

World Scientific News

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 49.

Tytuł:

The EM Algorithm applied to determining new limit points of Mahler measures

Autorzy:

El Otmani, S.
Rhin, G.
Sac-Epee, J. M.

Powiązania:

https://bibliotekanauki.pl/articles/970173.pdf

Data publikacji:

2010

Wydawca:

Polska Akademia Nauk. Instytut Badań Systemowych PAN

Tematy:

Mahler measure
EM algorithm

Opis:

In this work, we propose new candidates expected to be limit points of Mahler measures of polynomials. The tool we use for determining these candidates is the Expectation-Maximization algorithm, whose goal is to optimize the likelihood for the given data points, i.e. the known Mahler measures up to degree 44, to be generated by a specific mixture of Gaussians. We will give the mean (which is a candidate to be a new limit point) and the relative amplitude of each component of the more likely gaussian mixture.

Źródło:

Control and Cybernetics; 2010, 39, 4; 1185-1192
0324-8569

Pojawia się w:

Control and Cybernetics

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 50.

Tytuł:

Mixing in a stirred vessel. A parallel implementation with lattice Boltzmann coloured particles model

Autorzy:

Misci, L.
Felici, M.

Powiązania:

https://bibliotekanauki.pl/articles/1964147.pdf

Data publikacji:

2005

Wydawca:

Politechnika Gdańska

Tematy:

lattice Boltzmann
parallel algorithm

Opis:

The main purpose of this paper is to present a new method for the study of single fluid mixing in a stirred vessel. The simulation has been realized with a parallel implementation of the Lattice Boltzmann coloured particles model. The mixing phenomenon is compared with the one derived with a Lagrangian approach.

Źródło:

TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk; 2005, 9, 4; 449-459
1428-6394

Pojawia się w:

TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 51.

Tytuł:

Simulation of the time - spatial filtration algorithm by 2d FFT expanded method and its properties

Autorzy:

Janowski, T
Kotłowski, A.
Męciński, W.
Okuniewski, M.

Powiązania:

https://bibliotekanauki.pl/articles/331969.pdf

Data publikacji:

2003

Wydawca:

Polskie Towarzystwo Akustyczne

Tematy:

spatial filtration algorithm
acoustics

Opis:

The article presents the simulation results of the time-spatial matched filtration algorithm in detail described in [1]. The features of the algorithm are presented on figures of the realized simulations. Firstly, the simulation results in case of jar field are described. Successively the realizability of different filtrations types within algorithms is presented. Next the possibility of the algorithm adaptation to nearfield is shown. The last of the presented properties are possibilities of the directions of arrival choice.

Źródło:

Hydroacoustics; 2003, 6; 229-234
1642-1817

Pojawia się w:

Hydroacoustics

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 52.

Tytuł:

Is Swarm Intelligence Able to Create Mazes?

Autorzy:

Połap, D.
Woźniak, M.
Napoli, C.
Tramontana, E.

Powiązania:

https://bibliotekanauki.pl/articles/226726.pdf

Data publikacji:

2015

Wydawca:

Polska Akademia Nauk. Czytelnia Czasopism PAN

Tematy:

computational intelligence
heuristic algorithm

Opis:

In this paper, the idea of applying Computational Intelligence in the process of creation board games, in particular mazes, is presented. For two different algorithms the proposed idea has been examined. The results of the experiments are shown and discussed to present advantages and disadvantages.

Źródło:

International Journal of Electronics and Telecommunications; 2015, 61, 4; 305-310
2300-1933

Pojawia się w:

International Journal of Electronics and Telecommunications

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 53.

Tytuł:

Firefly algorithm in optimization of queueing systems

Autorzy:

Kwiecień, J.
Filipowicz, B.

Powiązania:

https://bibliotekanauki.pl/articles/201299.pdf

Data publikacji:

2012

Wydawca:

Polska Akademia Nauk. Czytelnia Czasopism PAN

Tematy:

queueing systems
firefly algorithm

Opis:

Queueing theory provides methods for analysis of complex service systems in computer systems, communications, transportation networks and manufacturing. It incorporates Markovian systems with exponential service times and a Poisson arrival process. Two queueing systems with losses are also briefly characterized. The article describes firefly algorithm, which is successfully used for optimization of these queueing systems. The results of experiments performed for selected queueing systems have been also presented.

Źródło:

Bulletin of the Polish Academy of Sciences. Technical Sciences; 2012, 60, 2; 363-368
0239-7528

Pojawia się w:

Bulletin of the Polish Academy of Sciences. Technical Sciences

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 54.

Tytuł:

Extending the MAX Algorithm for Maximum Independent Set

Autorzy:

Lê, Ngoc C.
Brause, Christoph
Schiermeyer, Ingo

Powiązania:

https://bibliotekanauki.pl/articles/31339469.pdf

Data publikacji:

2015-05-01

Wydawca:

Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii

Tematy:

maximum independent set
stable set
stability number
independence number
reduction
graph transformation
MAX Algorithm
MIN Algorithm
Vertex Order Algorithm

Opis:

The maximum independent set problem is an NP-hard problem. In this paper, we consider Algorithm MAX, which is a polynomial time algorithm for finding a maximal independent set in a graph G. We present a set of forbidden induced subgraphs such that Algorithm MAX always results in finding a maximum independent set of G. We also describe two modifications of Algorithm MAX and sets of forbidden induced subgraphs for the new algorithms.

Źródło:

Discussiones Mathematicae Graph Theory; 2015, 35, 2; 365-386
2083-5892

Pojawia się w:

Discussiones Mathematicae Graph Theory

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 55.

Tytuł:

On the application of elastic band method to repeatable inverse kinematics in robot manipulators

Autorzy:

Duleba, I.
Opalka, M.

Powiązania:

https://bibliotekanauki.pl/articles/384535.pdf

Data publikacji:

2013

Wydawca:

Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów

Tematy:

inverse kinematics
repeatability
algorithm

Opis:

In this paper an idea of the elastic band method was exploited to design a repeatable inverse kinematics algorithm for robot manipulators. The method incorporates an optimization process at many stages of its performance and admits some extensions. Performance of the algorithm was illustrated on models of the three DOF planar pendulum and the PUMA robot. A comparison with a standard pseudo-inverse Jacobian algorithm, which does not preserve repeatability of inverse kinematics, is also provided.

Źródło:

Journal of Automation Mobile Robotics and Intelligent Systems; 2013, 7, 4; 5-12
1897-8649
2080-2145

Pojawia się w:

Journal of Automation Mobile Robotics and Intelligent Systems

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 56.

Tytuł:

Real-Time Cloud-based Game Management System via Cuckoo Search Algorithm

Autorzy:

Połap, D.
Woźniak, M.
Napoli, C.
Tramontana, E.

Powiązania:

https://bibliotekanauki.pl/articles/226816.pdf

Data publikacji:

2015

Wydawca:

Polska Akademia Nauk. Czytelnia Czasopism PAN

Tematy:

computational intelligence
heuristic algorithm

Opis:

This paper analyses the idea of applying Swarm Intelligence in the process of managing the entire 2D board game in a real-time environment. For the proposed solution Game Management System is used as a cloud resource with a dedicated intelligent control agent. The described approach has been analysed on the basis of board games like mazes. The model and the control algorithm of the system is described and examined. The results of the experiments are presented and discussed to show possible advantages and isadvantages of the proposed method.

Źródło:

International Journal of Electronics and Telecommunications; 2015, 61, 4; 333-338
2300-1933

Pojawia się w:

International Journal of Electronics and Telecommunications

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 57.

Tytuł:

The concept of using evolutionary algorithms as tools for optimal planning of multimodal composition in the didactic texts

Autorzy:

Jakubowski, M. A.
Charlak, M.
Gryniewicz-Jaworska, M.

Powiązania:

https://bibliotekanauki.pl/articles/102285.pdf

Data publikacji:

2014

Wydawca:

Stowarzyszenie Inżynierów i Techników Mechaników Polskich

Tematy:

algorithm
didactic text
connectivism

Opis:

At the beginning we would like to provide a short description of the new theory of learning in the digital age called connectivism. It is the integration of principles explored by the following theories: chaos, network, complexity and self-organization. Next, we describe in short new visual solutions for the teaching of writing so called multimodal literacy 5–11. We define and describe the following notions: multimodal text and original theory so called NOS (non-optimum systems methodology) as a basis for new methods of visual solutions at the classes and audiovisual texts applications. Especially, we would like to emphasize the tremendous usefulness of evolutionary algorithms VEGA and NSGA as tools for optimal planning of multimodal composition in teaching texts. Finally, we give some examples of didactic texts for classrooms, which provide a deep insight into learning skills and tasks needed in the Internet age.

Źródło:

Advances in Science and Technology. Research Journal; 2014, 8, 24; 83-89
2299-8624

Pojawia się w:

Advances in Science and Technology. Research Journal

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 58.

Tytuł:

Decomposition of the GUI by means of modified algorithm algebra

Autorzy:

Ovsyak, V.
Ovsyak, O.

Powiązania:

https://bibliotekanauki.pl/articles/114373.pdf

Data publikacji:

2015

Wydawca:

Stowarzyszenie Inżynierów i Techników Mechaników Polskich

Tematy:

control icon
graphic interface
GUI
icon model
algorithm algebra
algorithm formula processing

Opis:

Using operations of cyclic sequencing and cyclic paralleling of the modified algebra of algorithms we have built compact model of decomposition of the formulas processing system of algebra of algorithms. We have developed the generalized abstract model of user graphic interface of a computer system. Based on the generalized model we have created the model of a user interface fragment for formulas processing of algorithm algebra.

Źródło:

Measurement Automation Monitoring; 2015, 61, 8; 413-415
2450-2855

Pojawia się w:

Measurement Automation Monitoring

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 59.

Tytuł:

Particle Swarm Optimization Algorithm for Leakage Power Reduction in VLSI Circuits

Autorzy:

Leela Rani, V.
Madhavi Latha, M.

Powiązania:

https://bibliotekanauki.pl/articles/225990.pdf

Data publikacji:

2016

Wydawca:

Polska Akademia Nauk. Czytelnia Czasopism PAN

Tematy:

leakage power
PSO algorithm
genetic algorithm
minimum leakage vector
Verilog-HDL implementation

Opis:

Leakage power is the dominant source of power dissipation in nanometer technology. As per the International Technology Roadmap for Semiconductors (ITRS) static power dominates dynamic power with the advancement in technology. One of the well-known techniques used for leakage reduction is Input Vector Control (IVC). Due to stacking effect in IVC, it gives less leakage for the Minimum Leakage Vector (MLV) applied at inputs of test circuit. This paper introduces Particle Swarm Optimization (PSO) algorithm to the field of VLSI to find minimum leakage vector. Another optimization algorithm called Genetic algorithm (GA) is also implemented to search MLV and compared with PSO in terms of number of iterations. The proposed approach is validated by simulating few test circuits. Both GA and PSO algorithms are implemented in Verilog HDL and the simulations are carried out using Xilinx 9.2i. From the simulation results it is found that PSO based approach is best in finding MLV compared to Genetic based implementation as PSO technique uses less runtime compared to GA. To the best of the author’s knowledge PSO algorithm is used in IVC technique to optimize power for the first time and it is quite successful in searching MLV.

Źródło:

International Journal of Electronics and Telecommunications; 2016, 62, 2; 179-186
2300-1933

Pojawia się w:

International Journal of Electronics and Telecommunications

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 60.

Tytuł:

Controllability-oriented placement of actuators for active noise-vibration control of rectangular plates using a memetic algorithm

Autorzy:

Wrona, S.
Pawełczyk, M.

Powiązania:

https://bibliotekanauki.pl/articles/176577.pdf

Data publikacji:

2013

Wydawca:

Polska Akademia Nauk. Czytelnia Czasopism PAN

Tematy:

active control
flexible structures
actuators placement
controllability Gramian
evolutionary algorithm
memetic algorithm

Opis:

For successful active control with a vibrating plate it is essential to appropriately place actuators. One of the most important criteria is to make the system controllable, so any control objectives can be achieved. In this paper the controllability-oriented placement of actuators is undertaken. First, a theoretical model of a fully clamped rectangular plate is obtained. Optimization criterion based on maximization of controllability of the system is developed. The memetic algorithm is used to find the optimal solution. Obtained results are compared with those obtained by the evolutionary algorithm. The configuration is also validated experimentally.

Źródło:

Archives of Acoustics; 2013, 38, 4; 529-536
0137-5075

Pojawia się w:

Archives of Acoustics

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 61.

Tytuł:

Population diversity maintenance in brain storm optimization algorithm

Autorzy:

Cheng, S.
Shi, Y.
Qin, Q.
Zhang, Q
Bai, R.

Powiązania:

https://bibliotekanauki.pl/articles/91571.pdf

Data publikacji:

2014

Wydawca:

Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych

Tematy:

brainstorm
optimization algorithm
convergence
divergence
brainstorm optimization
BSO
swarm intelligence
BSO algorithm

Opis:

The convergence and divergence are two common phenomena in swarm intelligence. To obtain good search results, the algorithm should have a balance on convergence and divergence. The premature convergence happens partially due to the solutions getting clustered together, and not diverging again. The brain storm optimization (BSO), which is a young and promising algorithm in swarm intelligence, is based on the collective behavior of human being, that is, the brainstorming process. The convergence strategy is utilized in BSO algorithm to exploit search areas may contain good solutions. The new solutions are generated by divergence strategy to explore new search areas. Premature convergence also happens in the BSO algorithm. The solutions get clustered after a few iterations, which indicate that the population diversity decreases quickly during the search. A definition of population diversity in BSO algorithm is introduced in this paper to measure the change of solutions’ distribution. The algorithm’s exploration and exploitation ability can be measured based on the change of population diversity. Different kinds of partial reinitialization strategies are utilized to improve the population diversity in BSO algorithm. The experimental results show that the performance of the BSO is improved by part of solutions re-initialization strategies.

Źródło:

Journal of Artificial Intelligence and Soft Computing Research; 2014, 4, 2; 83-97
2083-2567
2449-6499

Pojawia się w:

Journal of Artificial Intelligence and Soft Computing Research

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 62.

Tytuł:

Hybrydowy algorytm mrówkowy wykorzystujący algorytm genetyczny do wyznaczania trasy w systemie nawigacji
A hybrid ant algorithm using genetic algorithm to determine the route in navigation system

Autorzy:

Komar, D.

Powiązania:

https://bibliotekanauki.pl/articles/131927.pdf

Data publikacji:

2013

Wydawca:

Wrocławska Wyższa Szkoła Informatyki Stosowanej Horyzont

Tematy:

algorytm mrówkowy
algorytm genetyczny
system nawigacji
ant algorithm
genetic algorithm
navigation system

Opis:

Artykuł ma na celu zaprezentowanie nowej implementacji hybrydowego algorytmu mrówkowego, który do rozwiązywania postawionego problemu wyznaczenia optymalnej trasy przejazdu będzie wykorzystywał również algorytm genetyczny. Autor przedstawi wyniki symulacji przeprowadzonej na podstawie rzeczywistych danych, ukazując znaczny wzrost efektywności rozwiązywania problemu. Otrzymane wyniki wykazały, że nowy algorytm wyznaczał w większej liczbie przypadków znacznie krótszy czas przejazdu, a tym samym redukował występujące czynniki zakłócające i negatywnie wpływające na osobę kierującą pojazdem.
The purpose of this paper is to present the new implementation of a hybrid ant algorithm that will also use a genetic algorithm in order to solve the problem consisting in optimal route calculation. The author will present results of simulations that were performed based on real data and showed a significant increase of problem solution effectiveness. The obtained results proved that the new algorithm determined in more number of cases a significantly shorter journey time and in consequence reduced the occurring confounding factors which had a negative impact on the person driving a vehicle.

Źródło:

Biuletyn Naukowy Wrocławskiej Wyższej Szkoły Informatyki Stosowanej. Informatyka; 2013, 3; 23-27
2082-9892

Pojawia się w:

Biuletyn Naukowy Wrocławskiej Wyższej Szkoły Informatyki Stosowanej. Informatyka

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 63.

Tytuł:

Software Systems Clustering Using Estimation of Distribution Approach

Autorzy:

Tajgardan, M.
Izadkhah, H.
Lotfi, S.

Powiązania:

https://bibliotekanauki.pl/articles/108635.pdf

Data publikacji:

2016

Wydawca:

Społeczna Akademia Nauk w Łodzi

Tematy:

Software System
Clustering, Genetic Algorithm
Estimation of Distribution Algorithm (EDA)
Probability Model

Opis:

Software clustering is usually used for program understanding. Since the software clustering is a NP-complete problem, a number of Genetic Algorithms (GAs) are proposed for solving this problem. In literature, there are two wellknown GAs for software clustering, namely, Bunch and DAGC, that use the genetic operators such as crossover and mutation to better search the solution space and generating better solutions during genetic algorithm evolutionary process. The major drawbacks of these operators are (1) the difficulty of defining operators, (2) the difficulty of determining the probability rate of these operators, and (3) do not guarantee to maintain building blocks. Estimation of Distribution (EDA) based approaches, by removing crossover and mutation operators and maintaining building blocks, can be used to solve the problems of genetic algorithms. This approach creates the probabilistic models from individuals to generate new population during evolutionary process, aiming to achieve more success in solving the problems. The aim of this paper is to recast EDA for software clustering problems, which can overcome the existing genetic operators’ limitations. For achieving this aim, we propose a new distribution probability function and a new EDA based algorithm for software clustering. To the best knowledge of the authors, EDA has not been investigated to solve the software clustering problem. The proposed EDA has been compared with two well-known genetic algorithms on twelve benchmarks. Experimental results show that the proposed approach provides more accurate results, improves the speed of convergence and provides better stability when compared against existing genetic algorithms such as Bunch and DAGC.

Źródło:

Journal of Applied Computer Science Methods; 2016, 8 No. 2; 99-113
1689-9636

Pojawia się w:

Journal of Applied Computer Science Methods

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 64.

Tytuł:

Heuristic algorithms applied to the problems of servicing actors in supply chains

Autorzy:

Izdebski, M.
Jacyna-Gołda, I.
Markowska, K.
Murawski, J.

Powiązania:

https://bibliotekanauki.pl/articles/224087.pdf

Data publikacji:

2017

Wydawca:

Polska Akademia Nauk. Czytelnia Czasopism PAN

Tematy:

supply chain
genetic algorithm
ant algorithm
łańcuchy dostaw
algorytm genetyczny
algorytm mrówkowy

Opis:

The paper discusses main decision problems analysed in the subject matter of servicing actors operating in the supply chains, i.e. the vehicle routing problem, vehicles-to-task assignment problem and the problem of entities’ localization in the supply chain. The input data used to describe supply chains is given as well as the basic constraints and the criterion functions used in the development of mathematical models describing the supply chains. Servicing actors in supply chains is the complex decision making problem. Operators in the supply chains are constrained by: production capacity of the suppliers, the demand of the customers in particular working days, storage capacities of warehouses, handling capacities of warehouses, suppliers’ and warehouses’ time windows and other. The efficiency of supply chain is described by cost of transport between operators, costs of passing cargoes through warehouses and delivery time to the recipient. The heuristic algorithms, like genetic and ant algorithms are detailed and used to identify issues related to the operation of actors operating in the supply chains are described. These algorithms are used for solving localization problems in supply chains, vehicle routing problems, and assignment problems. The complexity of presented issues (TSP is known as NP-hard problem) limits the use of precise algorithms and implies the need to use heuristic algorithms. It should be noted that solutions generated by these algorithms for complex decision instances are sub-optimal solutions, but nonetheless it is accepted from the practical point of view.

Źródło:

Archives of Transport; 2017, 44, 4; 25-34
0866-9546
2300-8830

Pojawia się w:

Archives of Transport

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 65.

Tytuł:

Optimization of electric and magnetic field intensities in proximity of power lines using genetic and particle swarm algorithms

Autorzy:

Król, K.
Machczyński, W.

Powiązania:

https://bibliotekanauki.pl/articles/141588.pdf

Data publikacji:

2018

Wydawca:

Polska Akademia Nauk. Czytelnia Czasopism PAN

Tematy:

power line
electric field
magnetic field
optimization
genetic algorithm
particle swarm algorithm

Opis:

The paper presents optimization of power line geometrical parameters aimed to reduce the intensity of the electric field and magnetic field intensity under an overhead power line with the use of a genetic algorithm (AG) and particle swarm optimization (PSO). The variation of charge distribution along the conductors as well as the sag of the overhead line and induced currents in earth wires were taken into account. The conductor sag was approximated by a chain curve. The charge simulation method (CSM) and the method of images were used in the simulations of an electric field, while a magnetic field were calculated using the Biot–Savart law. Sample calculations in a three-dimensional system were made for a 220 kV single – circuit power line. A comparison of the used optimization algorithms was made.

Źródło:

Archives of Electrical Engineering; 2018, 67, 4; 829-843
1427-4221
2300-2506

Pojawia się w:

Archives of Electrical Engineering

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 66.

Tytuł:

Meta-heuristic approach based on genetic and greedy algorithms to solve flexible job-shop scheduling problem

Autorzy:

Rezaeipanah, Amin
Sarhangnia, Fariba
Abdollahi, Mohammad Javad

Powiązania:

https://bibliotekanauki.pl/articles/2097966.pdf

Data publikacji:

2021

Wydawca:

Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH

Tematy:

job-shop scheduling
meta-heuristic method
genetic algorithm
greedy algorithm
jobs priority

Opis:

Job-shop scheduling systems are one of the applications of group technology in industry, the purpose of which is to take advantage of the physical or operational similarities of products in their various aspects of construction and design. Additionally, these systems are identified as cellular manufacturing systems (CMS). In this paper, a meta-heuristic method that is based on combining genetic and greedy algorithms has been used in order to optimize and evaluate the performance criteria of the flexible job-shop scheduling problem. In order to improve the efficiency of the genetic algorithm, the initial population is generated by the greedy algorithm, and several elitist operators are used to improve the solutions. The greedy algorithm that is used to improve the generation of the initial population prioritizes the cells and the job in each cell and, thus, offers quality solutions. The proposed algorithm is tested over the P-FJSP dataset and compared with the state-of-the-art techniques of this literature. To evaluate the performance of the diversity, spacing, quality, and run-time criteria were used in a multi-objective function. The results of the simulation indicate the better performance of the proposed method as compared to the NRGA and NSGA-II methods.

Źródło:

Computer Science; 2021, 22 (4); 463--488
1508-2806
2300-7036

Pojawia się w:

Computer Science

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 67.

Tytuł:

Evolutionary algorithm with a configurable search mechanism

Autorzy:

Łapa, Krystian
Cpałka, Krzysztof
Laskowski, Łukasz
Cader, Andrzej
Zeng, Zhigang

Powiązania:

https://bibliotekanauki.pl/articles/1837536.pdf

Data publikacji:

2020

Wydawca:

Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych

Tematy:

evolutionary algorithm
population-based algorithm
optimization
operator pool
operator selection
individual selection

Opis:

In this paper, we propose a new population-based evolutionary algorithm that automatically configures the used search mechanism during its operation, which consists in choosing for each individual of the population a single evolutionary operator from the pool. The pool of operators comes from various evolutionary algorithms. With this idea, a flexible balance between exploration and exploitation of the problem domain can be achieved. The approach proposed in this paper might offer an inspirational alternative in creating evolutionary algorithms and their modifications. Moreover, different strategies for mutating those parts of individuals that encode the used search operators are also taken into account. The effectiveness of the proposed algorithm has been tested using typical benchmarks used to test evolutionary algorithms.

Źródło:

Journal of Artificial Intelligence and Soft Computing Research; 2020, 10, 3; 151-171
2083-2567
2449-6499

Pojawia się w:

Journal of Artificial Intelligence and Soft Computing Research

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 68.

Tytuł:

Ship Collision Avoidance by Distributed Tabu Search

Autorzy:

Kim, D.
Hirayama, K.
Okimoto, M.

Powiązania:

https://bibliotekanauki.pl/articles/116919.pdf

Data publikacji:

2015

Wydawca:

Uniwersytet Morski w Gdyni. Wydział Nawigacyjny

Tematy:

Safety of Navigation
Collision Avoidance
Distributed Tabu Search Algorithm (DTSA)
Distributed Local Search Algorithm (DLSA)
Quasi-Local Minimum (QLM)
Tabu Search Algorithm
Local Search Algorithm
Distributed Tabu Search

Opis:

More than 90% of world trade is transported by sea. The size and speed of ships is rapidly increasing in order to boost economic efficiency. If ships collide, the damage and cost can be astronomical. It is very difficult for officers to ascertain routes that will avoid collisions, especially when multiple ships travel the same waters. There are several ways to prevent ship collisions, such as lookouts, radar, and VHF radio. More advanced methodologies, such as ship domain, fuzzy theory, and genetic algorithm, have been proposed. These methods work well in one-on-one situations, but are more difficult to apply in multiple-ship situations. Therefore, we proposed the Distributed Local Search Algorithm (DLSA) to avoid ship collisions as a precedent study. DLSA is a distributed algorithm in which multiple ships communicate with each other within a certain area. DLSA computes collision risk based on the information received from neighboring ships. However, DLSA suffers from Quasi-Local Minimum (QLM), which prevents a ship from changing course even when a collision risk arises. In our study, we developed the Distributed Tabu Search Algorithm (DTSA). DTSA uses a tabu list to escape from QLM that also exploits a modified cost function and enlarged domain of next-intended courses to increase its efficiency. We conducted experiments to compare the performance of DLSA and DTSA. The results showed that DTSA outperformed DLSA.

Źródło:

TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2015, 9, 1; 23-29
2083-6473
2083-6481

Pojawia się w:

TransNav : International Journal on Marine Navigation and Safety of Sea Transportation

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 69.

Tytuł:

A Comparative Study of PID Controller Tuning Using GA, EP, PSO and ACO

Autorzy:

Nagaraj, B.
Vijayakumar, P.

Powiązania:

https://bibliotekanauki.pl/articles/384767.pdf

Data publikacji:

2011

Wydawca:

Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów

Tematy:

ant colony algorithm
evolutionary program
genetic algorithm particle swarm optimization and soft computing

Opis:

Proportional - Integral - Derivative control schemes continue to provide the simplest and effective solutions to most of the control engineering applications today. How ever PID controller are poorly tuned in practice with most of the tuning done manually which is difficult and time consuming. This article comes up with a hybrid approach involving Genetic Algorithm (GA), Evolutionary Pro gramming (EP), Particle Swarm Optimization (PSO) and Ant Colony Optimization (ACO). The proposed hybrid algorithm is used to tune the PID parameters and its per formance has been compared with the conventional me thods like Ziegler Nichols and Cohen Coon method. The results obtained reflect that use of heuristic algorithm based controller improves the performance of process in terms of time domain specifications, set point tracking, and regulatory changes and also provides an optimum stability. Speed control of DC motor process is used to assess the efficacy of the heuristic algorithm methodology

Źródło:

Journal of Automation Mobile Robotics and Intelligent Systems; 2011, 5, 2; 42-48
1897-8649
2080-2145

Pojawia się w:

Journal of Automation Mobile Robotics and Intelligent Systems

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 70.

Tytuł:

Analiza konwencjonalnych algorytmów DDC w układach regulacji automatycznej
The analysis conventional algorithms DCC in arrangements of automatic regulation

Autorzy:

Panfil, S.

Powiązania:

https://bibliotekanauki.pl/articles/154543.pdf

Data publikacji:

2003

Wydawca:

Stowarzyszenie Inżynierów i Techników Mechaników Polskich

Tematy:

algorytmy przyrostowe
przeregulowanie całkowite
algorytmy prędkościowe
growth algorithm
speedent algorithm
integral over-regulation

Opis:

The paper concerns practical of the synthesios of the algorithms DDC Direct Digital Control of the continous objects. Discreate version of the classic continuous algorithms PID Proportional- Integro-Differential which are nowadays often put in industrial practice are described. There are various forms of their notation including recurrence formulas and chosem methods of the technical realization inthe memory of the microcomputer control gear given this paper too.As the representative adeptin application software LOGICMASTER 90 for PLC made by GE FANUC is presented.

Źródło:

Pomiary Automatyka Kontrola; 2003, R. 49, nr 9, 9; 21-24
0032-4140

Pojawia się w:

Pomiary Automatyka Kontrola

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 71.

Tytuł:

Surface-to-air missile path planning using genetic and PSO algorithms

Autorzy:

Zandavi, S. M.

Powiązania:

https://bibliotekanauki.pl/articles/280277.pdf

Data publikacji:

2017

Wydawca:

Polskie Towarzystwo Mechaniki Teoretycznej i Stosowanej

Tematy:

path planning
genetic algorithm
PSO algorithm
surface-to-air missile
3DOF simulation

Opis:

Optimization algorithms use various mathematical and logical methods to find optimal points. Given the complexity of models and design levels, this paper proposes a heuristic optimization model for surface-to-air missile path planning in order to achieve the maximum range and optimal height based on 3DOF simulation. The proposed optimization model involves design variables based on the pitch programming and initial pitch angle (boost angle). In this optimization model, we used genetic and particle swarm optimization (PSO) algorithms. Simulation results indicated that the genetic algorithm was closer to reality but took longer computation time. PSO algorithm offered acceptable results and shorter computation time, so it was found to be more efficient in the surface-to-air missile path planning.

Źródło:

Journal of Theoretical and Applied Mechanics; 2017, 55, 3; 801-812
1429-2955

Pojawia się w:

Journal of Theoretical and Applied Mechanics

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 72.

Tytuł:

Fault Current Limiter optimal sizing considering different Microgrid operational modes using Bat and Cuckoo Search Algorithm

Autorzy:

Arani, A. A. K.
Bayati, N.
Mohammadi, R.
Gharehpetian, G. B.
Sadeghi, S. H.

Powiązania:

https://bibliotekanauki.pl/articles/140644.pdf

Data publikacji:

2018

Wydawca:

Polska Akademia Nauk. Czytelnia Czasopism PAN

Tematy:

fault current limiter (FCL)
Bat Algorithm (BA)
Cuckoo Search Algorithm (CSA)
microgrid (MG)

Opis:

Nowadays, the development of smart grids has been the focus of attention due to its advantages for power systems. One of the aspects of smart grids defined by using distributed generation (DG) in a low voltage network is a microgrid (MG). Based on its operational states, MG can operate in different configurations such as grid-connected mode or off-grid mode. The switching between these states is one of the challenging issues in this technical area. The fault currents in different buses have higher value compared to islanded mode of MG when the MG is connected to the main grid, which influences the protection equipment. In this situation, some electrical devices may be damaged due to the fault currents. Application of a fault current limiter (FCL) is considered as an effective way to overcome this challenge. The optimal size of these FCLs can optimize the performance of an MG. In this paper, an index for FCL size optimization has been used. In addition, two optimization algorithms (Bat Algorithm and Cuckoo Search Algorithm) have been applied to the problem. The application of an FCL has been studied in grid-connected and islanded-mode. In addition, the application of the capacitor bank in both modes has been investigated. The results of simulations carried out by MATLAB have been presented and compared.

Źródło:

Archives of Electrical Engineering; 2018, 67, 2; 321--332
1427-4221
2300-2506

Pojawia się w:

Archives of Electrical Engineering

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 73.

Tytuł:

Multi-variable optimization of an ytterbium-doped fiber laser using genetic algorithm

Autorzy:

Hashemi, S. S.
Ghavami, S. S.
Khorsandi, A

Powiązania:

https://bibliotekanauki.pl/articles/175086.pdf

Data publikacji:

2015

Wydawca:

Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej

Tematy:

fiber laser
optimization
genetic algorithm

Opis:

We introduce the genetic algorithm for the optimization of an Yb3+-doped double-clad fiber laser based on a multi-variable scheme. The output characteristic of the laser is numerically simulated using real practical values. This is performed through solving the associated steady-state rate equation and investigating the effects of input variables such as pump and signal wavelengths and length of the fiber on the laser output. It is found that pumping of the medium around 975 nm is conducted to attain the maximum output power of ~34.8 W, while the stability of the outcoupled power is significantly improved when pumping at 920 nm, confirming good agreement with the reported experimental results. We have also found that by using genetic algorithm base multi-variable optimization, the output power can be significantly increased by about three orders of magnitude and reaches to ~28.5 W with optimum and shorter fiber length of ~57.5 m. Obtained results show that based on the genetic algorithm multi-variable discipline, fiber characteristics can be optimized according to the gaining of maximum output power.

Źródło:

Optica Applicata; 2015, 45, 3; 355-367
0078-5466
1899-7015

Pojawia się w:

Optica Applicata

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 74.

Tytuł:

Assembling the SARS-CoV genome - new method based on graph theoretical approach.

Autorzy:

Błażewicz, Jacek
Figlerowicz, Marek
Formanowicz, Piotr
Kasprzak, Marta
Nowierski, Bartosz
Styszyński, Rafał
Szajkowski, Łukasz
Widera, Paweł
Wiktorczyk, Mariusz

Powiązania:

https://bibliotekanauki.pl/articles/1041512.pdf

Data publikacji:

2004

Wydawca:

Polskie Towarzystwo Biochemiczne

Tematy:

algorithm
assembling
SARS-CoV
graphs

Opis:

Nowadays, scientists may learn a lot about the organisms studied just by analyzing their genetic material. This requires the development of methods of reading genomes with high accuracy. It has become clear that the knowledge of the changes occuring within a viral genome is indispensable for effective fighting of the pathogen. A good example is SARS-CoV, which was a cause of death of many people and frightened the entire world with its fast and hard to prevent propagation. Rapid development of sequencing methods, like shotgun sequencing or sequencing by hybridization (SBH), gives scientists a good tool for reading genomes. However, since sequencing methods can read fragments of up to 1000 bp only, methods for sequence assembling are required in order to read whole genomes. In this paper a new assembling method, based on graph theoretical approach, is presented. The method was tested on SARS-CoV and the results were compared to the outcome of other widely known methods.

Źródło:

Acta Biochimica Polonica; 2004, 51, 4; 983-993
0001-527X

Pojawia się w:

Acta Biochimica Polonica

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 75.

Tytuł:

New estimate for the curvature of an order-convex set and related questions

Autorzy:

Ramazanov, Ali B.

Powiązania:

https://bibliotekanauki.pl/articles/2050043.pdf

Data publikacji:

2020

Wydawca:

Polska Akademia Nauk. Instytut Badań Systemowych PAN

Tematy:

gradient
estimates
curvature
convexity
algorithm

Opis:

It is well known that in discrete optimization problems, gradient (local) algorithms do not always guarantee an optimal solution. Therefore, the problem arises of finding the accuracy of the gradient algorithm. This is a fairly well-known problem and numerous publications have been devoted to it. In establishing accuracy, various approaches are used. One of these approaches is to obtain guaranteed estimates of the accuracy of the gradient algorithm in terms of the curvature of the admissible domain. With this approach, it is required to find the curvatures of the admissible region. Since finding the exact value of curvature is a difficult problem to solve, curvature estimates in terms of more or less simply calculated parameters of the problem are relevant. A new improved bound for the curvature of an order-convex set is found and is presented in this paper in terms of the steepness and parameters of strict convexity of the function.

Źródło:

Control and Cybernetics; 2020, 49, 2; 233-240
0324-8569

Pojawia się w:

Control and Cybernetics

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 76.

Tytuł:

An Ant Algorithm for the Maximum Clique Problem in a Special Kind of Graph

Autorzy:

Schiff, K.

Powiązania:

https://bibliotekanauki.pl/articles/384647.pdf

Data publikacji:

2015

Wydawca:

Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów

Tematy:

ant algorithm
maximum clique problem

Opis:

The maximum clique problem is a very well-known NP-complete problem of the kind for which meta-heuristic algorithms, which include ant algorithms, have been developed. Well-known instances of problems enable the assessment of the quality of elaborated algorithms; however, there is a particular kind of graph in which each vertex has a nearly equal number of adjacent edges. It is very difficult to find a maximum clique in such a graph. The search for the maximum clique in this particular kind of graph is investigated and compared to the best known ant algorithms.

Źródło:

Journal of Automation Mobile Robotics and Intelligent Systems; 2015, 9, 2; 20-23
1897-8649
2080-2145

Pojawia się w:

Journal of Automation Mobile Robotics and Intelligent Systems

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 77.

Tytuł:

Modified music algorithm for DOA estimation using the a-priori defined unitary matrix

Autorzy:

Janowski, T.
Porosińska, E.
Zając, R.

Powiązania:

https://bibliotekanauki.pl/articles/332526.pdf

Data publikacji:

2009

Wydawca:

Polskie Towarzystwo Akustyczne

Tematy:

DOA
unitary matrix
music algorithm

Opis:

The determination of the number of the simultaneously observed objects is an important problem of the MUSIC algorithm. As the result of the covariance matrix eigendecomposition the eingevector and unitary matrix are obtained. The unitary matrix defines the transformation of the measurement vector. Consequently the obtained vector is orthogonal to the noise subspace. The solution of the eigendecomposition problem can be avoided assuming a-priori knowledge of the unitary matrix. Practically, the passive sonar detects the first appeared noisy object. This enable to beforehand define the set of the unitary matrixes exactly matched to the previously determined directions of the signal arrival. The article presents the form of the matrix and features of the measurement vector transformation. The results of the DOA algorithm computer simulation for passive sonar composed of four hydrophones developed in the OBR CTM S.A. are also presented.

Źródło:

Hydroacoustics; 2009, 12; 77-82
1642-1817

Pojawia się w:

Hydroacoustics

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 78.

Tytuł:

Synthesis of Reconfigurable Multiple Shaped Beams of a Concentric Circular Ring Array Antenna Using Evolutionary Algorithms

Autorzy:

Dubey, Sanjay Kumar
Mandal, Debasis

Powiązania:

https://bibliotekanauki.pl/articles/2200965.pdf

Data publikacji:

2023

Wydawca:

Instytut Łączności - Państwowy Instytut Badawczy

Tematy:

cosec2 beam
differential evolution algorithm (DE)
firefly algorithm (FA)
flat top beam
genetic algorithm (GA)
multiple shaped beam patterns
pencil beam

Opis:

The approach described in this paper uses evolutionary algorithms to create multiple-beam patterns for a concentric circular ring array (CCRA) of isotropic antennas using a common set of array excitation amplitudes. The flat top, cosec2, and pencil beam patterns are examples of multiple-beam patterns. All of these designs have an upward angle of θ = 0◦. All the patterns are further created in three azimuth planes (φ = 0◦, 5◦, and 10◦). To create the necessary patterns, non-uniform excitations are used in combination with evenly spaced isotropic components. For the flat top and cosecant-squared patterns, the best combination of common components, amplitude and various phases is applied, whereas the pencil beam pattern is produced using the common amplitude only. Differential evolutionary algorithm (DE), genetic algorithm (GA), and firefly algorithm (FA) are used to generate the best 4-bit discrete magnitudes and 5-bit discrete phases. These discrete excitations aid in lowering the feed network design complexity and the dynamic range ratio (DRR). A variety of randomly selected azimuth planes are used to verify the excitations as well. With small modifications in the desired parameters, the patterns are formed using the same excitation. The results proved both the efficacy of the suggested strategy and the dominance of DE over GA as well as FA.

Źródło:

Journal of Telecommunications and Information Technology; 2023, 1; 8--17
1509-4553
1899-8852

Pojawia się w:

Journal of Telecommunications and Information Technology

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 79.

Tytuł:

Some Aspects of the Application of Genetic Algorithm for Solving the Assignment Problem of Tasks to Resources in a Transport Company

Autorzy:

Izdebski, Mariusz
Jacyna, Marianna

Powiązania:

https://bibliotekanauki.pl/articles/504281.pdf

Data publikacji:

2014

Wydawca:

Międzynarodowa Wyższa Szkoła Logistyki i Transportu

Tematy:

assignment problem
genetic algorithm
optimization

Opis:

The article defines the assignment problem of tasks to resources in a transport company. The paper describes mathematical model of a transport system taking into account the assignment of vehicles to the tasks. It also provides stages of creation of the genetic algorithm for solving the assignment problem in the transport company.

Źródło:

Logistics and Transport; 2014, 21, 1; 13-20
1734-2015

Pojawia się w:

Logistics and Transport

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 80.

Tytuł:

The Conceptual Algorithm of the International Multimodal Transport (CAIMT)

Autorzy:

Miler, Ryszard
Kuriata, Andrzej

Powiązania:

https://bibliotekanauki.pl/articles/504483.pdf

Data publikacji:

2019

Wydawca:

Międzynarodowa Wyższa Szkoła Logistyki i Transportu

Tematy:

algorithm
International Multimodal Transport
containerization

Opis:

The presented paper comes as a summary of a theoretical work presenting an original algorithm describing International Multimodal Transport (IMT) mechanisms and processes. Since containers appeared in early 1960s on the regional, and later on, on global scale in logistic operations, the IMT has become the fastest growing combination of an international through-transport. With use of various modes of transport IMT has significant influence on global trade development. Due to its characteristic the IMT process is exposed on the global unitization, standardization, safety, security and economization (optimization) challenges. Thus, there is a need for scientific approach in building a standardized conceptual model of IMT referred in this paper to CAIMT. CAIMT is an original, deterministic algorithm, presented in the block notation, identifying typical procedures as a logical continuation of the programmed sequence of the basic IMT operations. The suggested CAIMT has a potential in further standardization of IMT procedures and can be scientifically developed through the modeling of the IMT processes and safety/security procedures. In addition, in terms of empirical aspects, algorithmization of the main IMT processes can lead to their application in the various expert systems. Summing up, this method (CAIMT) comes as an optimal instrument that can be utilized in order to build further pillars for IMT development, standardization and optimization.

Źródło:

Logistics and Transport; 2019, 41, 1; 113-128
1734-2015

Pojawia się w:

Logistics and Transport

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 81.

Tytuł:

Genetic algorithm as optimizing tool in line balancing process

Autorzy:

Hnat, J.
Gregor, M.

Powiązania:

https://bibliotekanauki.pl/articles/117771.pdf

Data publikacji:

2007

Wydawca:

Polskie Towarzystwo Promocji Wiedzy

Tematy:

balancing
assembly line
genetic algorithm

Opis:

This article deals with assembly line balancing problem and with possibility of using genetic algorithm as an optimizing tool in balancing process. There is briefly described line balancing problem and the main goals of balancing. Also it is shown here how genetic algorithm work and what are the advantages of this tool.

Źródło:

Applied Computer Science; 2007, 3, 2; 18-33
1895-3735

Pojawia się w:

Applied Computer Science

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 82.

Tytuł:

Minimizing makespan in general flow-shop scheduling problem using a GA-based improvement heuristic

Autorzy:

Semančo, P.

Powiązania:

https://bibliotekanauki.pl/articles/117960.pdf

Data publikacji:

2011

Wydawca:

Polskie Towarzystwo Promocji Wiedzy

Tematy:

flow-shop production
evolutionary algorithm

Opis:

In the paper an improvement heuristic is proposed for permutation flow-shop problem based on the idea of evolutionary algorithm. The approach employs constructive heuristic that gives a good initial solution. GA-based improvement heuristic is applied in conjunction with three well-known constructive heuristics, namely CDS, Gupta’s algorithm and Palmer’s Slope Index. The approach is tested on benchmark set of 10 problems range from 4 to 25 jobs and 4 to 30 machines. The results are also compared to the best-known lower-bound solutions.

Źródło:

Applied Computer Science; 2011, 7, 1; 57-64
1895-3735

Pojawia się w:

Applied Computer Science

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 83.

Tytuł:

Computer simulation of the genetic controller for the EB flue gas treatment process

Autorzy:

Moroz, Z.
Boużyk, J.
Sowiński, M.
Chmielewski, A.

Powiązania:

https://bibliotekanauki.pl/articles/147569.pdf

Data publikacji:

2001

Wydawca:

Instytut Chemii i Techniki Jądrowej

Tematy:

genetic algorithm controller
flue gas

Opis:

The use of the computer genetic algorithm (GA) for driving a controller device for the industrial flue gas purification systems employing the electron beam irradiation, has been studied. As the mathematical model of the installation the properly trained artificial neural net (ANN) was used. Various cost functions and optimising strategies of the genetic code were tested. These computer simulations proved, that ANN + GA controller can be sufficiently precise and fast to be applied in real installations.

Źródło:

Nukleonika; 2001, 46, 3; 107-115
0029-5922
1508-5791

Pojawia się w:

Nukleonika

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 84.

Tytuł:

Ant algorithm for AP-N aimed at optimization of complex systems

Autorzy:

Mikulik, J.
Zajdel, M.

Powiązania:

https://bibliotekanauki.pl/articles/375987.pdf

Data publikacji:

2010

Wydawca:

Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH

Tematy:

assignment problem
ant algorithm
optimization

Opis:

Assignment Problem (AP), which is well known combinatorial problem, has been studied extensively in the course of many operational and technical researches. It has been shown to be NP-hard for three or more dimensions and a few non-deterministic methods have been proposed to solve it. This paper pays attention on new heuristic search method for the n-dimensional assignment problem, based on swarm intelligence and comparing results with those obtained by other scientists. It indicates possible direction of solutions of problems and presents a way of behaviour using ant algorithm for multidimensional optimization complex systems. Results of researches in the form of computational simulations outcomes are presented.

Źródło:

Decision Making in Manufacturing and Services; 2010, 4, 1-2; 29-36
1896-8325
2300-7087

Pojawia się w:

Decision Making in Manufacturing and Services

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 85.

Tytuł:

Hydroacoustics waves direct-of-arrival estimation using music algorithm - simulations results

Autorzy:

Żak, A.

Powiązania:

https://bibliotekanauki.pl/articles/332842.pdf

Data publikacji:

2009

Wydawca:

Polskie Towarzystwo Akustyczne

Tematy:

music algorithm
hydroacoustics waves
hydroacoustics

Opis:

Paper presents simulations results of hydroacoustics waves' direction-of-arrival estimation using MUSIC algorithm. Firstly, the research problem is formulated by general description of studied case and release of simplifying assumption. Next the used to direct-of-arrival estimation MUSIC algorithm was discussed. The mathematical formulations, algorithm of calculation and some computational issues were presented. At the end of the paper the simulations results of estimation of direction-of-arrival using MUSIC algorithm for hypothetical situation were presented.

Źródło:

Hydroacoustics; 2009, 12; 249-256
1642-1817

Pojawia się w:

Hydroacoustics

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 86.

Tytuł:

Optimization of the pulse transformer using circuit-field model

Autorzy:

Łyskawiński, W.
Knypiński, Ł.
Nowak, L.
Jędryczka, C.

Powiązania:

https://bibliotekanauki.pl/articles/1395761.pdf

Data publikacji:

2013

Wydawca:

Politechnika Poznańska. Wydawnictwo Politechniki Poznańskiej

Tematy:

pulse transformer
optimization
genetic algorithm

Opis:

The paper presents the new strategy of the optimization of pulse transformer (PT). In order to reduce calculation time the optimization problem has been decomposed into two stages. In the first stage, to determine functional parameters of PT the circuit model is used. The goal of circuit calculations is to limit the space of design variables that meets formulated requirements. The genetic algorithm has been applied for this task. In order to include constraints, the penalty function has been engaged. The transformer dimensions obtained in the first stage of calculations are used as initial values in the second stage of design process. In the second stage the field model of PT is employed. Obtained results prove that presented approach allows for fast optimization of the PT design.

Źródło:

Computer Applications in Electrical Engineering; 2013, 11; 159-167
1508-4248

Pojawia się w:

Computer Applications in Electrical Engineering

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 87.

Tytuł:

Algebraic construction of a coboundary of a given cycle

Autorzy:

Mazur, M.
Szybowski, J.

Powiązania:

https://bibliotekanauki.pl/articles/255494.pdf

Data publikacji:

2007

Wydawca:

Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH

Tematy:

algorithm
homology theory
cycle
coboundary

Opis:

We present an algebraic construction of the coboundary of a given cycle as a simpler alternative to the geometric one introduced in [4, 5].

Źródło:

Opuscula Mathematica; 2007, 27, 2; 291-300
1232-9274
2300-6919

Pojawia się w:

Opuscula Mathematica

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 88.

Tytuł:

Utrwalanie w nauczaniu historii przy pomocy algorytmu SuperMemo i jemu podobnych – propozycja metody redagowania treści historycznych
Consolidating knowledge in teaching history with the help of the SuperMemo and similar algorithms – a proposed method of editing historical content

Autorzy:

Piotrowski, Mikołaj

Powiązania:

https://bibliotekanauki.pl/articles/2194682.pdf

Data publikacji:

2022-12-30

Wydawca:

Uniwersytet im. Adama Mickiewicza w Poznaniu

Tematy:

algorithm
history
editing
SuperMemo
consolidation

Opis:

The historical knowledge of Poles, including Polish students, leaves much to be desired, even on a basic level. The insufficient or even the lack of consolidation is the most likely explanation of this phenomenon. The proposed solution to this problem is the SuperMemo and its similar algorithms, along with school history content specially edited for its needs. Basically an algorithm is a set of steps leading to the completion of a task. In the SuperMemo case, the task is to optimize learning, or rather to reduce forgetfulness, while reducing the time devoted to still well-remembered knowledge. Both the SuperMemo and its similar have been implemented in many applications. Quizlet or the software with the same name as the algorithm – SuperMemo, are the examples of such applications. They allow you to learn your own materials as well as those already edited, either by the producer or by other users. The previously edited school historical content for the SuperMemo algorithm and its similar cannot be considered satisfactory if important issues such as: compliance with the core curriculum, division into classes and topics, historical narrative coherence, relationships between pairs of questions and answers, or degrees of difficulty, are regarded. This article proposes a method that can improve this state of affairs. It is the result of theoretical and quasi-experimental work, corrected later on the basis of more serious editorial experience.

Źródło:

Kultura-Społeczeństwo-Edukacja; 2022, 22, 2; 259-273
2300-0422

Pojawia się w:

Kultura-Społeczeństwo-Edukacja

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 89.

Tytuł:

A simulator supporting the distribution of the primary subsidy in a faculty at Wroclaw University of Technology

Autorzy:

Rekuć, W.
Szczurowski, L.

Powiązania:

https://bibliotekanauki.pl/articles/406255.pdf

Data publikacji:

2015

Wydawca:

Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej

Tematy:

algorithm for subsidy distribution
simulator

Opis:

Chosen aspects of a simulator supporting the distribution of the primary teaching subsidy in a faculty of Wroclaw University of Technology have been presented. The mathematical equations forming the basis for the algorithm have been analyzed. The general premises of adapting the set of teaching duties within a faculty to this model have been formulated. Various scenarios illustrating how the distribution of this subsidy works in practice have been shown. Introductory results of such simulations (using MS EXCEL) for a chosen scenario have been presented and discussed.

Źródło:

Operations Research and Decisions; 2015, 25, 4; 35-49
2081-8858
2391-6060

Pojawia się w:

Operations Research and Decisions

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 90.

Tytuł:

A collision avoidance algorithm in Simultaneous Localization and Mapping problem for mobile platforms

Autorzy:

Małecki, Tomasz
Narkiewicz, Janusz

Powiązania:

https://bibliotekanauki.pl/articles/2086976.pdf

Data publikacji:

2022

Wydawca:

Polskie Towarzystwo Mechaniki Teoretycznej i Stosowanej

Tematy:

algorithm
modeling
path planning
SLAM

Opis:

A collision avoidance algorithm applicable in simultaneous localization and mapping (SLAM) has been developed with a prospect of an on-line application for mobile platforms to search and map the operation area and avoid contact with obstacles. The algorithm, which was implemented in MATLAB software, is based on a linear discrete-time state transition model for determination of the platform position and orientation, and a ‘force’ points method for collision avoidance and definition of the next-step of platform motion. The proposed approach may be incorporated into real-time applications with limited on-board computational resources.

Źródło:

Journal of Theoretical and Applied Mechanics; 2022, 60, 2; 317--328
1429-2955

Pojawia się w:

Journal of Theoretical and Applied Mechanics

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 91.

Tytuł:

An approximation algorithm for the total covering problem

Autorzy:

Hatami, Pooya

Powiązania:

https://bibliotekanauki.pl/articles/743460.pdf

Data publikacji:

2007

Wydawca:

Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii

Tematy:

covering
total covering
approximation algorithm

Opis:

We introduce a 2-factor approximation algorithm for the minimum total covering number problem.

Źródło:

Discussiones Mathematicae Graph Theory; 2007, 27, 3; 553-558
2083-5892

Pojawia się w:

Discussiones Mathematicae Graph Theory

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 92.

Tytuł:

Algorithmic aspects of total-subdomination in graphs

Autorzy:

Harris, Laura
Hattingh, Johannes
Henning, Michael

Powiązania:

https://bibliotekanauki.pl/articles/744186.pdf

Data publikacji:

2006

Wydawca:

Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii

Tematy:

total k-subdomination
algorithm
tree

Opis:

Let G = (V,E) be a graph and let k ∈ Z⁺. A total k-subdominating function is a function f: V → {-1,1} such that for at least k vertices v of G, the sum of the function values of f in the open neighborhood of v is positive. The total k-subdomination number of G is the minimum value of f(V) over all total k-subdominating functions f of G where f(V) denotes the sum of the function values assigned to the vertices under f. In this paper, we present a cubic time algorithm to compute the total k-subdomination number of a tree and also show that the associated decision problem is NP-complete for general graphs.

Źródło:

Discussiones Mathematicae Graph Theory; 2006, 26, 1; 5-18
2083-5892

Pojawia się w:

Discussiones Mathematicae Graph Theory

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 93.

Tytuł:

Parallel patterns determination in solving cyclic flow shop problem with setups

Autorzy:

Bożejko, W.
Chaczko, Z.
Uchroński, M.
Wodecki, M.

Powiązania:

https://bibliotekanauki.pl/articles/229926.pdf

Data publikacji:

2017

Wydawca:

Polska Akademia Nauk. Czytelnia Czasopism PAN

Tematy:

cyclic scheduling
parallel algorithm
metaheuristics

Opis:

The subject of this work is the new idea of blocks for the cyclic flow shop problem with setup times, using multiple patterns with different sizes determined for each machine constituting optimal schedule of cities for the traveling salesman problem (TSP). We propose to take advantage of the Intel Xeon Phi parallel computing environment during so-called ’blocks’ determination basing on patterns, in effect significantly improving the quality of obtained results.

Źródło:

Archives of Control Sciences; 2017, 27, 2; 183-195
1230-2384

Pojawia się w:

Archives of Control Sciences

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 94.

Tytuł:

Automatyczne wydzielenie układu wyspowego w procesie obrony systemu elektroenergetycznego przed awarią katastrofalną
Automatic separation of islanding zone as the power system

Autorzy:

Szymanek, M.

Powiązania:

https://bibliotekanauki.pl/articles/408163.pdf

Data publikacji:

2012

Wydawca:

Politechnika Lubelska. Wydawnictwo Politechniki Lubelskiej

Tematy:

bezpieczeństwo SEE
plany obrony
algorytm kontrolowanego wydzielenia wyspy obciążeniowej
power system safety
protection schemes
algorithm for a controlled separation of a load island

Opis:

Rosnące zagrożenie awarią systemową typu blackout w polskim systemie elektroenergetycznym wymaga doskonalenia istniejących metod obrony i odbudowy. Artykuł zawiera przegląd istniejących środków techniczno-organizacyjnych w tym zakresie. Przedstawia również nowy algorytm kontrolowanego wydzielenia zbilansowanej wyspy obciążeniowej ze źródłem mocy w postaci elektrociepłowni miejskiej. Algorytm stanowi uzupełnienie i usprawnienie metod obrony KSE i zwiększa niezawodność zasilania aglomeracji miejsko-przemysłowej.
Ever growing hazard of blackout occurrence in the Polish power system requires enhancing of already used methods for the power system protection and restoration. The paper includes a review of structures and technical means presently used for that purpose. It also presents a new algorithm for controlled separation of a balanced load island with a municipal CHP as a power source. The algorithm supplements a method for the power system protection and increases power supply reliability for an industrial-urban agglomeration.

Źródło:

Informatyka, Automatyka, Pomiary w Gospodarce i Ochronie Środowiska; 2012, 4a; 25-28
2083-0157
2391-6761

Pojawia się w:

Informatyka, Automatyka, Pomiary w Gospodarce i Ochronie Środowiska

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 95.

Tytuł:

Synthesis and optimization of sequencing operation algorithm

Autorzy:

Ovsyak, O.
Petrushka, J.
Kozelko, M.

Powiązania:

https://bibliotekanauki.pl/articles/114365.pdf

Data publikacji:

2015

Wydawca:

Stowarzyszenie Inżynierów i Techników Mechaników Polskich

Tematy:

algebra of algorithms
operation of sequencing
synthesis of algorithm formula
optimization of algorithm formula

Opis:

Synthesis and optimization ways of sequencing operation applied in computer system, are described in the paper. The ways are general, and use sequencing and eliminating operations of algorithm algebra. They allow for automated synthesis of the sequencing operations. Optimization of algorithm formulas has been made on the basis of the properties of sequencing operations.

Źródło:

Measurement Automation Monitoring; 2015, 61, 10; 484-487
2450-2855

Pojawia się w:

Measurement Automation Monitoring

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 96.

Tytuł:

Ant Quantitative Algorithms Applied to Electronic Systems Diagnosis
Ilościowe algorytmy mrówkowe stosowane do diagnostyki systemów elektronicznych

Autorzy:

Drabarek, J.
Kania, P.

Powiązania:

https://bibliotekanauki.pl/articles/118504.pdf

Data publikacji:

2010

Wydawca:

Politechnika Koszalińska. Wydawnictwo Uczelniane

Tematy:

ant algorithm
quantitative algorithm
electronic systems diagnosis
algorytm mrówkowy
algorytm ilościowy
diagnostyka systemów elektronicznych

Opis:

Main problems of using ant algorithms in diagnosis are presented in this article. A knowledge representation and a searching solution mechanism with help of ant algorithms were elaborated. The usefulness of an ant-quantitative algorithm in faults localizations is presented on TV set.

Źródło:

Zeszyty Naukowe Wydziału Elektroniki i Informatyki Politechniki Koszalińskiej; 2010, 2; 47-64
1897-7421

Pojawia się w:

Zeszyty Naukowe Wydziału Elektroniki i Informatyki Politechniki Koszalińskiej

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 97.

Tytuł:

Adaptive ant-colony algorithm for semantic query routing

Autorzy:

Gómez Santillán, C.
Cruz Reyes, L.
Schaeffer, E.
Meza, E.
Rivera Zarate, G.

Powiązania:

https://bibliotekanauki.pl/articles/384885.pdf

Data publikacji:

2011

Wydawca:

Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów

Tematy:

parameter tuning
search algorithm
peer-to-peer
adaptive algorithm
local environment
ant colony algorithms

Opis:

The most prevalent P2P application today is file sha ring, both among scientific users and the general public. Afundamental process in file sharing systems is the search mechanism. The unstructured nature of real-world largescale complex systems poses a challenge to the search me thods, because global routing and directory services are impractical to implement. This paper presents a new antcolony algorithm, Adaptive Neighboring-Ant Search (AdaNAS), for the semantic query routing problem (SQRP) in a P2P network. The proposed algorithm incor porates an adaptive control parameter tuning technique for runtime estimation of the time-to-live (TTL) of the ants. AdaNAS uses three strategies that take advantage of the local environment: learning, characterization, and explo ration. Two classical learning rules are used to gain ex perience on past performance using three new learning functions based on the distance traveled and the resources found by the ants. The experimental results show that the AdaNAS algorithm outperforms the NAS algorithm where the TTLvalue is not tuned at runtime.

Źródło:

Journal of Automation Mobile Robotics and Intelligent Systems; 2011, 5, 1; 85-94
1897-8649
2080-2145

Pojawia się w:

Journal of Automation Mobile Robotics and Intelligent Systems

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 98.

Tytuł:

An analysis of Chosen Image Formation Algorithms for Synthetic Aperture Radar with FMCW

Autorzy:

Okoń-Fąfara, M.
Serafin, P.
Kawalec, A.

Powiązania:

https://bibliotekanauki.pl/articles/227061.pdf

Data publikacji:

2016

Wydawca:

Polska Akademia Nauk. Czytelnia Czasopism PAN

Tematy:

signal processing
synthetic aperture radar
time domain correlation
range-Doppler algorithm
range migration algorithm

Opis:

The modelling of FMCW SAR systems, due to long signal duration time, commonly used start-stop approximation for pulsed radars causes errors in the image. Continuous motion of the radar platform results in additional range-azimuth couplings and range walk term that should be considered in processing of signal from this type of radar. The paper presents an analysis of the following algorithms: Time Domain Correlation (TDC), Range Doppler Algorithm (RDA), and Range Migration Algorithm (RMA). The comparison of the algorithms is based on theoretical estimation of their computation complexity and the quality of images obtained on the basis of real signals of FMCW SAR systems.

Źródło:

International Journal of Electronics and Telecommunications; 2016, 62, 4; 323-328
2300-1933

Pojawia się w:

International Journal of Electronics and Telecommunications

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 99.

Tytuł:

Neural network-based allocation and self-improved firefly-based optimal sizing of fuel cells in distributed generation systems

Autorzy:

Subramanyam, T. C.
Tulasi Ram, S. S.
Subrahmanyam, J. B. V.

Powiązania:

https://bibliotekanauki.pl/articles/1839111.pdf

Data publikacji:

2018

Wydawca:

Polska Akademia Nauk. Instytut Badań Systemowych PAN

Tematy:

DG system
fuel cells
location
sizing
multiple objectives
firefly algorithm
self-improved firefly algorithm

Opis:

The notion of Distributed Generation (DG) refers to the production of power at the level of consumption. Production of energy on-site, instead of offering it centrally, reduces the cost, internal dependencies, difficulties, inefficiencies, and risks that are related to transmission and distribution systems. In case DG is realized with fuel cells, several issues exist in respect to allocating and sizing of these fuel cells in the system. For solving those issues, dual stage intelligent technique is employed in this paper. First, the Neural Networks (NN) technique is adopted for determining the required location to place the fuel cells. Secondly, an enhanced version of Self Improved Fire-Fly (SIFF) algorithm is adopted for finding the optimal size of the fuel cells. The implemented technique is simulated in four IEEE benchmark test bus systems, and the respective performance analysis along with statistical analysis serves for validation purposes. The here proposed technique is compared with six other known algorithms, namely Particle Swarm Optimization (PSO), Firefly (FF) algorithm, Artificial Bee colony (ABC) algorithm, Improved Artificial Bee colony algorithm (IABC), Genetic Algorithm (GA) and Global Search Optimizer (GSO). The results obtained from the comparative analysis show the enhanced performance of the proposed mechanism.

Źródło:

Control and Cybernetics; 2018, 47, 4; 357-381
0324-8569

Pojawia się w:

Control and Cybernetics

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 100.

Tytuł:

The Use of Heuristic Algorithms to Optimize the Transport Issues on the Example of Municipal Services Companies

Autorzy:

Izdebski, M.

Powiązania:

https://bibliotekanauki.pl/articles/223579.pdf

Data publikacji:

2014

Wydawca:

Polska Akademia Nauk. Czytelnia Czasopism PAN

Tematy:

municipal services companies
transport
optimization
genetic algorithm
ant algorithm
usługi komunalne
optymalizacja
algorytm genetyczny

Opis:

In this article the main optimization problems in the municipal services companies were presented. These problems concern the issue of vehicle routing. The mathematical models of these problems were described. The function of criterion and the conditions on designating the vehicle routing were defined. In this paper the hybrid algorithm solving the presented problems was proposed. The hybrid algorithm consists of two heuristic algorithms: the ant and the genetic algorithm. In this paper the stages of constructing of the hybrid algorithm were presented. A structure of the data processed by the algorithm, a function of adaptation, a selection of chromosomes, a crossover, a mutation and an inversion were characterized. A structure of the data was presented as string of natural numbers. In selection process the roulette method was used and in the crossover process the operator PMX was presented. This algorithm was verified in programming language C #. The process of verification was divided into two stages. In the first stage the best parameters of the hybrid algorithm were designated. In the second stage the algorithm was started with these parameters and the result was compared with the random search algorithm. The random search algorithm generates 2000 routes and the best result is compared with the hybrid algorithm.

Źródło:

Archives of Transport; 2014, 29, 1; 27-36
0866-9546
2300-8830

Pojawia się w:

Archives of Transport

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce