Informacja

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

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "search algorithm" wg kryterium: Temat

  Lista filtrów

Dostawca treści

Wyrównaj
Wyświetlanie 1-50 z 64
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
Artykuł
Tytuł:
Single-objective optimal power flow for electric power systems based on crow search algorithm
Autorzy:
Fathy, A.
Abdelaziz, A.
Powiązania:
https://bibliotekanauki.pl/articles/140618.pdf
Data publikacji:
2018
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
crow search algorithm
distribution network
optimal power flow
Opis:
This paper presents the application of a recent meta-heuristic optimization technique named a crow search algorithm (CSA) in solving the problem of an optimal power flow (OPF) for electric power systems. Various constrained objective functions, total fuel cost, active power loss and pollutant emission are proposed. The generators’ output powers, generators’ terminal voltages, transmission lines’ taps and the shunt capacitors’ reactive powers are considered as variables to be designed. The proposed methodology based on the CSA is applied on an IEEE 30-bus system and IEEE 118-bus system. The obtained results via the CSA are compared to others and they ensure the superiority of the CSA in solving the OPF problem in electric power systems.
Źródło:
Archives of Electrical Engineering; 2018, 67, 1; 123-138
1427-4221
2300-2506
Pojawia się w:
Archives of Electrical Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Genetic algorithm combined with a local search method for identifying susceptibility genes
Autorzy:
Yang, C -H.
Moi, S. -H.
Lin, Y. -D.
Chuang, L. -Y.
Powiązania:
https://bibliotekanauki.pl/articles/91586.pdf
Data publikacji:
2016
Wydawca:
Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
Tematy:
genetic algorithms
identifying susceptibility genes
local search algorithm
Opis:
Detecting genetic association models between single nucleotide polymorphisms (SNPs) in various disease-related genes can help to understand susceptibility to disease. Statistical tools have been widely used to detect significant genetic association models, according to their related statistical values, including odds ratio (OR), chi-square test (χ2), p-value, etc. However, the high number of computations entailed in such operations may limit the capacity of such statistical tools to detect high-order genetic associations. In this study, we propose lsGA algorithm, a genetic algorithm based on local search method, to detect significant genetic association models amongst large numbers of SNP combinations. We used two disease models to simulate the large data sets considering the minor allele frequency (MAF), number of SNPs, and number of samples. The three-order epistasis models were evaluated by chi-square test (χ2) to evaluate the significance (P-value < 0.05). Analysis results showed that lsGA provided higher chi-square test values than that of GA. Simple linear regression indicated that lsGA provides a significant advantage over GA, providing the highest β values and significant p-value.
Źródło:
Journal of Artificial Intelligence and Soft Computing Research; 2016, 6, 3; 203-212
2083-2567
2449-6499
Pojawia się w:
Journal of Artificial Intelligence and Soft Computing Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Learning Search Algorithms: An Educational View
Autorzy:
Janota, M.
Šimák, V.
Hrbček, J.
Powiązania:
https://bibliotekanauki.pl/articles/116502.pdf
Data publikacji:
2014
Wydawca:
Uniwersytet Morski w Gdyni. Wydział Nawigacyjny
Tematy:
Search Algorithm
Learning Search Algorithms
educational view
Artificial Intelligence Method
Search Method
Labyrinth
Dijkstra algorithm
Opis:
Artificial intelligence methods find their practical usage in many applications including maritime industry. The paper concentrates on the methods of uninformed and informed search, potentially usable in solving of complex problems based on the state space representation. The problem of introducing the search algorithms to newcomers has its technical and psychological dimensions. The authors show how it is possible to cope with both of them through design and use of specialized authoring systems. A typical example of searching a path through the maze is used to demonstrate how to test, observe and compare properties of various search strategies. Performance of search methods is evaluated based on the common criteria.
Źródło:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2014, 8 no. 4; 565-570
2083-6473
2083-6481
Pojawia się w:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Scheduling of multiunit projects using tabu search algorithm
Autorzy:
Podolski, M.
Powiązania:
https://bibliotekanauki.pl/articles/347178.pdf
Data publikacji:
2015
Wydawca:
Akademia Wojsk Lądowych imienia generała Tadeusza Kościuszki
Tematy:
construction works scheduling
optimization
job scheduling
tabu search algorithm
Opis:
The paper describes problems of discrete optimization in scheduling of multiunit projects. A model of this kind of project with possibility of using many workgroups by the contractor has been presented. It leads to reduction of project duration. For solving NP-hard optimization problem, a tabu search algorithm has been applied in the model. The example of mod-el and application of the algorithm are also included in the paper.
Źródło:
Zeszyty Naukowe / Wyższa Szkoła Oficerska Wojsk Lądowych im. gen. T. Kościuszki; 2015, 1; 110-122
1731-8157
Pojawia się w:
Zeszyty Naukowe / Wyższa Szkoła Oficerska Wojsk Lądowych im. gen. T. Kościuszki
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Cryptographically Strong Elliptic Curves of Prime Order
Autorzy:
Barański, Marcin
Gliwa, Rafał
Szmidt, Janusz
Powiązania:
https://bibliotekanauki.pl/articles/1844627.pdf
Data publikacji:
2021
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
Mersenne primes
elliptic curves
security requirements
search algorithm
Magma
Opis:
The purpose of this paper is to generate cryptographically strong elliptic curves over prime fields Fp, where p is a Mersenne prime, one of the special primes or a random prime. We search for elliptic curves which orders are also prime numbers. The cryptographically strong elliptic curves are those for which the discrete logarithm problem is computationally hard. The required mathematical conditions are formulated in terms of parameters characterizing the elliptic curves. We present an algorithm to generate such curves. Examples of elliptic curves of prime order are generated with Magma.
Źródło:
International Journal of Electronics and Telecommunications; 2021, 67, 2; 207-212
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
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
Artykuł
Tytuł:
Optimization of convolutional neural networks using the fuzzy gravitational search algorithm
Autorzy:
Poma, Yutzil
Melin, Patricia
González, Claudia I.
Martínez, Gabriela E.
Powiązania:
https://bibliotekanauki.pl/articles/384794.pdf
Data publikacji:
2020
Wydawca:
Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
Tematy:
neural networks
convolutional neural network
fuzzy gravitational search algorithm
deep learning
Opis:
This paper presents an approach to optimize a Convolutional Neural Network using the Fuzzy Gravitational Search Algorithm. The optimized parameters are the number of images per block that are used in the training phase, the number of filters and the filter size of the convolutional layer. The reason for optimizing these parameters is because they have a great impact on performance of the Convolutional Neural Networks. The neural network model presented in this work can be applied for any image recognition or classification applications; nevertheless, in this paper, the experiments are performed in the ORL and Cropped Yale databases. The results are compared with other neural networks, such as modular and monolithic neural networks. In addition, the experiments were performed manually, and the results were obtained (when the neural network is not optimized), and comparison was made with the optimized results to validate the advantage of using the Fuzzy Gravitational Search Algorithm.
Źródło:
Journal of Automation Mobile Robotics and Intelligent Systems; 2020, 14, 1; 109-120
1897-8649
2080-2145
Pojawia się w:
Journal of Automation Mobile Robotics and Intelligent Systems
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Development of rapid and reliable cuckoo search algorithm for global maximum power point tracking of solar PV systems in partial shading condition
Autorzy:
Bentata, Khadidja
Mohammedi, Ahmed
Benslimane, Tarak
Powiązania:
https://bibliotekanauki.pl/articles/1845531.pdf
Data publikacji:
2021
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
photovoltaic system
maximum power point tracking
partial shading
cuckoo search algorithm
Opis:
The solar photovoltaic output power fluctuates according to solar irradiation, temperature, and load impedance variations. Due to the operating point fluctuations, extracting maximum power from the PV generator, already having a low power conversion ratio, becomes very complicated. To reach a maximum power operating point, a maximum power point tracking technique (MPPT) should be used. Under partial shading condition, the nonlinear PV output power curve contains multiple maximum power points with only one global maximum power point (GMPP). Consequently, identifying this global maximum power point is a difficult task and one of the biggest challenges of partially shaded PV systems. The conventional MPPT techniques can easily be trapped in a local maximum instead of detecting the global one. The artificial neural network techniques used to track the GMPP have a major drawback of using huge amount of data covering all operating points of PV system, including different uniform and non-uniform irradiance cases, different temperatures and load impedances. The biological intelligence techniques used to track GMPP, such as grey wolf algorithm and cuckoo search algorithm (CSA), have two main drawbacks; to be trapped in a local MPP if they have not been well tuned and the precision-transient tracking time complex paradox. To deal with these drawbacks, a Distributive Cuckoo Search Algorithm (DCSA) is developed, in this paper, as GMPP tracking technique. Simulation results of the system for different partial shading patterns demonstrated the high precision and rapidity, besides the good reliability of the proposed DCSA- GMPPT technique, compared to the conventional CSA-GMPPT.
Źródło:
Archives of Control Sciences; 2021, 31, 3; 495-526
1230-2384
Pojawia się w:
Archives of Control Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Failure Correction of a Linear Array of Coupled Parallel Vertical Dipole Antennas
Autorzy:
Patidar, Hemant
Mahanti, Gautam Kumar
Muralidharan, R.
Singh, Prasanna Kumar
Powiązania:
https://bibliotekanauki.pl/articles/308045.pdf
Data publikacji:
2020
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
array failure correction
cuckoo search algorithm
wide null depth
mutual coupling
Opis:
In this paper, a cuckoo search algorithm based on the combined characteristics of the brood parasite behavior and Levy flights is applied to correct the radiation pattern of a linear antenna array composed of parallel dipoles with faulty elements. An effort is made to restore the radiation pattern similar to one without any faulty elements, and the difference in the values of side lobe level and wide null depth of both patterns, as well as the voltage standing wave ratio obtained from the new voltage excitations become diminished. The examples presented in this paper show the effectiveness of this algorithm in correcting the radiation pattern of a linear array of 36 and 120 dipole antennas with four and ten failed elements, respectively. The results show that the matching condition and the wide null control produced by Cuckoo Search algorithm are more efficient in comparison with the benchmark failure correction algorithm. The approach adopted herein may be applied to other array configurations as well.
Źródło:
Journal of Telecommunications and Information Technology; 2020, 1; 62-69
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Development of rapid and reliable cuckoo search algorithm for global maximum power point tracking of solar PV systems in partial shading condition
Autorzy:
Bentata, Khadidja
Mohammedi, Ahmed
Benslimane, Tarak
Powiązania:
https://bibliotekanauki.pl/articles/1845518.pdf
Data publikacji:
2021
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
photovoltaic system
maximum power point tracking
partial shading
cuckoo search algorithm
Opis:
The solar photovoltaic output power fluctuates according to solar irradiation, temperature, and load impedance variations. Due to the operating point fluctuations, extracting maximum power from the PV generator, already having a low power conversion ratio, becomes very complicated. To reach a maximum power operating point, a maximum power point tracking technique (MPPT) should be used. Under partial shading condition, the nonlinear PV output power curve contains multiple maximum power points with only one global maximum power point (GMPP). Consequently, identifying this global maximum power point is a difficult task and one of the biggest challenges of partially shaded PV systems. The conventional MPPT techniques can easily be trapped in a local maximum instead of detecting the global one. The artificial neural network techniques used to track the GMPP have a major drawback of using huge amount of data covering all operating points of PV system, including different uniform and non-uniform irradiance cases, different temperatures and load impedances. The biological intelligence techniques used to track GMPP, such as grey wolf algorithm and cuckoo search algorithm (CSA), have two main drawbacks; to be trapped in a local MPP if they have not been well tuned and the precision-transient tracking time complex paradox. To deal with these drawbacks, a Distributive Cuckoo Search Algorithm (DCSA) is developed, in this paper, as GMPP tracking technique. Simulation results of the system for different partial shading patterns demonstrated the high precision and rapidity, besides the good reliability of the proposed DCSA-GMPPT technique, compared to the conventional CSA-GMPPT.
Źródło:
Archives of Control Sciences; 2021, 31, 3; 495-526
1230-2384
Pojawia się w:
Archives of Control Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Optimization of the Morphological Parameters of a Metal Foam for the Highest Sound Absorption Coefficient Using Local Search Algorithm
Autorzy:
Jafari, Mohammad Javad
Khavanin, Ali
Ebadzadeh, Touraj
Fazlali, Mahmood
Sharak, Mohsen Niknam
Madvari, Rohollah Fallah
Powiązania:
https://bibliotekanauki.pl/articles/176536.pdf
Data publikacji:
2020
Wydawca:
Polska Akademia Nauk. Czasopisma i Monografie PAN
Tematy:
SAC
Sound Absorption Coefficient
LSA
Local Search Algorithm
metal foam
optimization
Opis:
Due to its unique features, the metal foam is considered as one of the newest acoustic absorbents. It is a navel approach determining the structural properties of sound absorbent to predict its acoustical behavior. Unfortunately, direct measurements of these parameters are often difficult. Currently, there have been acoustic models showing the relationship between absorbent morphology and sound absorption coefficient (SAC). By optimizing the effective parameters on the SAC, the maximum SAC at each frequency can be obtained. In this study, using the Benchmarking method, the model presented by Lu was validated in MATLAB coding software. Then, the local search algorithm (LSA) method was used to optimize the metal foam morphology parameters. The optimized parameters had three factors, including porosity, pore size, and metal foam pore opening size. The optimization was applied to a broad band of frequency ranging from 500 to 8000 Hz. The predicted values were in accordance with benchmark data resulted from Lu model. The optimal range of the parameters including porosity of 50 to 95%, pore size of 0.09 to 4.55 mm, and pore opening size of 0.06 to 0.4 mm were applied to obtain the highest SAC for the frequency range of 500 to 800 Hz. The optimal amount of pore opening size was 0.1 mm in most frequencies to have the highest SAC. It was concluded that the proposed method of the LSA could optimize the parameters affecting the SAC according to the Lu model. The presented method can be a reliable guide for optimizing microstructure parameters of metal foam to increase the SAC at any frequency and can be used to make optimized metal foam.
Źródło:
Archives of Acoustics; 2020, 45, 3; 487-497
0137-5075
Pojawia się w:
Archives of Acoustics
Dostawca treści:
Biblioteka Nauki
Artykuł
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
Artykuł
Tytuł:
Weryfikacja poprawności działania algorytmu tabu search w elastycznym modelu szeregowania zadań w systemach pomiarowo - sterujących
Verification of correct operation of a tabu search algorithm for elastic task model scheduling in control and measurement systems
Autorzy:
Powroźnik, P.
Powiązania:
https://bibliotekanauki.pl/articles/152993.pdf
Data publikacji:
2010
Wydawca:
Stowarzyszenie Inżynierów i Techników Mechaników Polskich
Tematy:
szeregowanie zadań
elastyczny model
algorytm tabu search
task scheduling
elastic task model
tabu search algorithm
Opis:
W artykule przedstawiono ideę zastosowania algorytmu tabu search do wyznaczenia okresu zadań w elastycznym modelu szeregowania zadań. Wyniki przeprowadzonych symulacji dowodzą przydatność algorytmu w doborze parametrów czasowych w elastycznym modelu szeregowania zadań. Rozdział pierwszy zawiera tło zastosowania teorii szeregowania zadań w systemach pomiarowo - sterujących. Rozdział drugi wprowadza czytelnika do zastosowania elastycznego modelu szeregowania zadań w systemach pomiarowo - sterujących. Rozdział ten zawiera krótki przegląd literaturowy prezentowanej tematyki [1, 2, 3]. Rozdział trzeci przedstawia ideę zastosowania wybranego algorytmu heurystycznego tabu serach w elastycznym modelu szeregowania zadań w systemach pomiarowo - sterujących. Rysunek pierwszy przedstawia schemat blokowy szeregowania zadań przy zastosowaniu algorytmu tabu search. Rozdział czwarty zawiera wyniki z przeprowadzonych symulacji zastosowania algorytmu tabu search w elastycznym modelu szeregowania zadań w systemach pomiarowo - sterujących. Podsumowanie zawiera najważniejsze wnioski wynikające ze stosowania omawianego algorytmu w elastycznym modelu szeregowania zadań w systemach pomiarowo - sterujących.
In this paper use of a tabu search algorithm for elastic task model scheduling is presented. The results of simulations confirm usefulness of this method for assigning the time parameters in elastic task model scheduling. In the first section, the background of application of task model scheduling to control and measurement systems is outlined. The second section deals with introduction to using the elastic task model scheduling for control and measurement systems. This section provides a brief literature review of the presented subjects [1, 2, 3]. The third section presents an idea of applying the selected tabu search heuristic algorithm to the elastic task model scheduling in control and measurement systems. The block diagram of the elastic task model scheduling with use of the tabu search algorithm is shown in Fig. 1. The fourth section contains the results of simulations carried out for the elastic task model scheduling with use of the tabu search algorithm in control and measurement systems. At the end there are presented the main conclusions drawn from using the tabu search algorithm for assigning the task time parameters in the elastic task model scheduling in control and measurement systems.
Źródło:
Pomiary Automatyka Kontrola; 2010, R. 56, nr 11, 11; 1345-1347
0032-4140
Pojawia się w:
Pomiary Automatyka Kontrola
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Real-time validation of an automatic generation control system considering HPA-ISE with crow search algorithm optimized cascade FOPDN-FOPIDN controller
Autorzy:
Babu, Naladi Ram
Chiranjeevi, Tirumalasetty
Devarapalli, Ramesh
Knypiński, Łukasz
Garcìa Màrquez, Fausto Pedro
Powiązania:
https://bibliotekanauki.pl/articles/27312009.pdf
Data publikacji:
2023
Wydawca:
Polska Akademia Nauk. Czasopisma i Monografie PAN
Tematy:
crow search algorithm
dish-stirling solar system
AGC
RT Lab
FOPDN-FOPIDN controller
Opis:
This article validates the application of RT-Lab for the AGC studies of three-area systems. All the areas are employed with thermal-DSTS systems. A new controller named cascade FOPDN-FOPPIDN is employed. Its parameters are optimized using a CSA, subjecting to a new PI named HPA-ISE. The responses of the FOPDN-FOPIDN controller are related and are superior over PIDN and TIDN controllers. Moreover, the dominance of HPA-ISE is verified with ISE, and it performs better in terms of system dynamics. Further, the system performance reliability is analyzed with the AC-HVDC and is better than the AC system. Besides, sensitivity analysis recommends that the proposed FOPDN-FOPIDN at diverse conditions is robust and more reliability.
Źródło:
Archives of Control Sciences; 2023, 33, 2; 371--390
1230-2384
Pojawia się w:
Archives of Control Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The Tabu Search approach in coherent co-synthesis of multiprocessors systems
Autorzy:
Drabowski, M.
Czajkowski, K.
Powiązania:
https://bibliotekanauki.pl/articles/92834.pdf
Data publikacji:
2006
Wydawca:
Uniwersytet Przyrodniczo-Humanistyczny w Siedlcach
Tematy:
synthesis of system
coherent
identification resources
task scheduling
NP-complete problem
heuristic algorithm
tabu search algorithm
Opis:
This paper presents the use of Tabu Search algorithm for solving the problems of coherent synthesis of multiprocessor computer systems. The paper includes a coherent solution of both optimization of partition resources and optimization of tasks scheduling. This publication shows results of computational experiments for different instances of system synthesis problems.
Źródło:
Studia Informatica : systems and information technology; 2006, 1(7); 31-45
1731-2264
Pojawia się w:
Studia Informatica : systems and information technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Cuckoo search algorithm for optimal placement and sizing of static var compensator in large-scale power systems
Autorzy:
Nguyen, K. P.
Fujita, G.
Dieu, V. N.
Powiązania:
https://bibliotekanauki.pl/articles/91782.pdf
Data publikacji:
2016
Wydawca:
Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
Tematy:
Cuckoo search algorithm
optimal placement and sizing
shunt VAR compensator
optimal power flow
FACTS
Opis:
This paper presents an application of Cuckoo search algorithm to determine optimal location and sizing of Static VAR Compensator. Cuckoo search algorithm is a modern heuristic technique basing Cuckoo species’ parasitic strategy. The L´evy flight has been employed to generate random Cuckoo eggs. Moreover, the objective function is a multiobjective problem, which minimizes loss power, voltage deviation and investment cost of Static VAR Compensator while satisfying other operating constraints in power system. Cuckoo search algorithm is evaluated on three case studies and compared with the Teaching-learning-based optimization, Particle Swarm optimization and Improved Harmony search algorithm. The results show that Cuckoo search algorithm is better than other optimization techniques and its performance is also better.
Źródło:
Journal of Artificial Intelligence and Soft Computing Research; 2016, 6, 2; 59-68
2083-2567
2449-6499
Pojawia się w:
Journal of Artificial Intelligence and Soft Computing Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Balancing of a linear elastic rotor-bearing system with arbitrarily distributed unbalance using the Numerical Assembly Technique
Autorzy:
Quinz, Georg
Prem, Marcel S.
Klanner, Michael
Ellermann, Katrin
Powiązania:
https://bibliotekanauki.pl/articles/2086883.pdf
Data publikacji:
2021
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
Numerical Assembly Technique
rotor dynamics
modal balancing
recursive eigenvalue search algorithm
dynamika wirnika
wyważanie modalne
Opis:
In this paper, a new application of the Numerical Assembly Technique is presented for the balancing of linear elastic rotor-bearing systems with a stepped shaft and arbitrarily distributed mass unbalance. The method improves existing balancing techniques by combining the advantages of modal balancing with the fast calculation of an efficient numerical method. The rotating stepped circular shaft is modelled according to the Rayleigh beam theory. The Numerical Assembly Technique is used to calculate the steady-state harmonic response, eigenvalues and the associated mode shapes of the rotor. The displacements of a simulation are compared to measured displacements of the rotor-bearing system to calculate the generalized unbalance for each eigenvalue. The generalized unbalances are modified according to modal theory to calculate orthogonal correction masses. In this manner, a rotor-bearing system is balanced using a single measurement of the displacement at one position on the rotor for every critical speed. Three numerical examples are used to show the accuracy and the balancing success of the proposed method.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2021, 69, 6; e138237, 1--7
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Minimized Group Delay FIR Low Pass Filter Design Using Modified Differential Search Algorithm
Autorzy:
Prajapati, Sonelal
Rai, Sanjeev
Tiwari, Manish
Dwivedi, Atul Kumar
Powiązania:
https://bibliotekanauki.pl/articles/24200750.pdf
Data publikacji:
2023
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
differential search optimization algorithm
FIR filter
optimization
small group delay
Opis:
Designing a finite impulse response (FIR) filter with minimal group delay has proven to be a difficult task. Many research studies have focused on reducing pass band and stop band ripples in FIR filter design, often overlooking the optimization of group delay. While some works have considered group delay reduction, their approaches were not optimal. Consequently, the achievement of an optimal design for a filter with a low group delay value still remains a challenge. In this work, a modified differential search optimization algorithm has been used for the purpose of designing a minimal group delay FIR filter. The results obtained have been compared with the classical techniques and they turned out to be promising.
Źródło:
Journal of Telecommunications and Information Technology; 2023, 3; 78--84
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Embedded direct search of optimal designs for finite noise experiments
Optymalne planowanie eksperymentów w przypadku dużego szumu metodą homotopii opartej na bezgradientowej minimalizacji
Autorzy:
Schulz, F.
Frischmuth, K.
Powiązania:
https://bibliotekanauki.pl/articles/224216.pdf
Data publikacji:
2010
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
planowanie eksperymentu
układ dynamiczny
optymalizacja
model nieliniowy
parameter identification
nonlinear regression
embedding method
direct search algorithm
Opis:
We study experimental designs for the identification of nonlinear model parameters. As optimality criterion we assume minimality of the error in a huge number of identifications run on simulated data, which are generated with known parameters and a given error distribution. The optimal design depends on the nonlinear parameters. We find the optimal solution set by combining a path following strategy and a direct search method.
W pracy badane są optymalne plany eksperymentów wykonywanych do celów identyfikacji parametrów modelu nieliniowego układu dynamicznego. Jako kryterium optymalności przyjęto minimum błędów otrzymanych w dużej liczbie identyfikacji wykonanych na symulowanych danych, które zostały wygenerowane ze znanymi parametrami i przy założonym rozkładzie błędów. Optymalny plan zależy od parametrów modelu. Badano metody bezgradientowe połączone z homotopia, które okazują się bardzo efektywne w przypadku rozpatrywanego zagadnienia. Wyniki otrzymane w przypadku skończonych wartości błędów mogą się istotnie różnić od wyników otrzymanych z wykorzystaniem teorii asymptotycznej dla małego szumu.
Źródło:
Archives of Transport; 2010, 22, 1; 119-137
0866-9546
2300-8830
Pojawia się w:
Archives of Transport
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Multi-Layer Perceptron Neural Network Utilizing Adaptive Best-Mass Gravitational Search Algorithm to Classify Sonar Dataset
Autorzy:
Mosavi, Mohammad Reza
Khishe, Mohammad
Naseri, Mohammad Jafar
Parvizi, Gholam Reza
Ayat, Mehdi
Powiązania:
https://bibliotekanauki.pl/articles/176971.pdf
Data publikacji:
2019
Wydawca:
Polska Akademia Nauk. Czasopisma i Monografie PAN
Tematy:
MLP NN
Multi-Layer Perceptron Neural Network
ABGSA
Adaptive Best Mass Gravitational Search Algorithm
sonar
classification
Opis:
In this paper, a new Multi-Layer Perceptron Neural Network (MLP NN) classifier is proposed for classifying sonar targets and non-targets from the acoustic backscattered signals. Besides the capabilities of MLP NNs, it uses Back Propagation (BP) and Gradient Descent (GD) for training; therefore, MLP NNs face with not only impertinent classification accuracy but also getting stuck in local minima as well as lowconvergence speed. To lift defections, this study uses Adaptive Best Mass Gravitational Search Algorithm (ABGSA) to train MLP NN. This algorithm develops marginal disadvantage of the GSA using the bestcollected masses within iterations and expediting exploitation phase. To test the proposed classifier, this algorithm along with the GSA, GD, GA, PSO and compound method (PSOGSA) via three datasets in various dimensions will be assessed. Assessed metrics include convergence speed, fail probability in local minimum and classification accuracy. Finally, as a practical application assumed network classifies sonar dataset. This dataset consists of the backscattered echoes from six different objects: four targets and two non-targets. Results indicate that the new classifier proposes better output in terms of aforementioned criteria than whole proposed benchmarks.
Źródło:
Archives of Acoustics; 2019, 44, 1; 137-151
0137-5075
Pojawia się w:
Archives of Acoustics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Cancer growth treatment using immune linear quadratic regulator based on crow search optimization algorithm
Autorzy:
Hussein, Mohammed A.
Karam, Ekhlas H.
Habeeb, Rokaia S.
Powiązania:
https://bibliotekanauki.pl/articles/1837793.pdf
Data publikacji:
2021
Wydawca:
Polskie Towarzystwo Promocji Wiedzy
Tematy:
oncolytic virotherapy
feedback mechanism
crow search algorithm
Immune-LQR
wiroterapia onkolityczna
mechanizm sprzężenia zwrotnego
algorytm wyszukiwania w tłumie
Opis:
The rapid and uncontrollable cell division that spreads to surrounding tissues medically termed as malignant neoplasm, cancer is one of the most common diseases worldwide. The need for effective cancer treatment arises due to the increase in the number of cases and the anticipation of higher levels in the coming years. Oncolytic virotherapy is a promising technique that has shown encouraging results in several cases. Mathematical models of virotherapy have been widely developed, and one such model is the interaction between tumor cells and oncolytic virus. In this paper an artificially optimized Immune-Linear Quadratic Regulator (LQR) is introduced to improve the outcome of oncolytic virotherapy. The control strategy has been evaluated in silico on number of subjects. The crow search algorithm is used to tune immune and LQR parameters. The study is conducted on two subjects, S1 and S3, with LQR and Immune-LQR. The experimental results reveal a decrease in the number of tumor cells and remain in the treatment area from day ten onwards, this indicates the robustness of treatment strategies that can achieve tumor reduction regardless of the uncertainty in the biological parameters.
Źródło:
Applied Computer Science; 2021, 17, 2; 56-69
1895-3735
Pojawia się w:
Applied Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The application of dynamic bayesian network to reliability assessment of emu traction system
Zastosowanie dynamicznych sieci bayesowskich do oceny niezawodności elektrycznego systemu trakcyjnego
Autorzy:
Wang, Y.
Bi, L.
Wang, S.
Lin, S.
Xiang, W.
Powiązania:
https://bibliotekanauki.pl/articles/302105.pdf
Data publikacji:
2017
Wydawca:
Polska Akademia Nauk. Polskie Naukowo-Techniczne Towarzystwo Eksploatacyjne PAN
Tematy:
dynamiczna sieć bayesowska
system trakcyjny
ocena niezawodności
algorytm przeszukiwania wszerz
DBN
traction system
reliability assessment
breadth-first-search algorithm
Opis:
W artykule omówiono nowatorskie zastosowanie dynamicznej sieci bayesowskiej (DBN) do oceny niezawodności elektrycznego systemu trakcyjnego ze szczególnym uwzględnieniem metod modelowania DBN. W związku z rosnącą złożonością elektrycznych systemów trakcyjnych oraz wynikającą z niej coraz większą ilością współzależności między komponentami, systemy te narażone są coraz częściej na awarie części składowych. Chociaż istnieje wiele badań dotyczących oceny niezawodności systemów trakcyjnych, stosowane obecnie narzędzia nie mają odpowiedniej mocy modelowania koniecznej do opisu zależności funkcjonalnych i czasowych pomiędzy częściami składowymi. W niniejszej pracy zaproponowano nową metodę modelowania generowania DBN, którą można stosować w odniesieniu do systemów składających się z pewnych określonych komponentów oraz różnych typów rozchodzących się przez nie przepływów. Zależności funkcjonalne i czasowe opisano, odpowiednio, za pomocą tablicy komponentowych prawdopodobieństw warunkowych (Component-based Conditional Probability Table, CPT) oraz tablicy czasowo-zależnych prawdopodobieństw warunkowych. Ponieważ złożoność systemu nie pozwala na zamodelowanie go w prosty sposób jako DBN, do automatycznej budowy modelu DBN wykorzystano algorytm przeszukiwania wszerz (Breadth-First-Search). Oceny niezawodności systemu trakcyjnego z wykorzystaniem proponowanej metody opartej na DBN można dokonywać w dowolnym czasie, co ma ogromne znaczenie przy planowaniu konserwacji w celu zapewnienia bezpieczeństwa systemu.
The article introduces a novel application of a Dynamic Bayesian Network (DBN) in the reliability assessment with regard to the traction system of Electric Multiple Units (EMU), which focus on modeling approach to DBN construction. As a result of high complexity and growing interdependencies, it is increasingly vulnerable to the failure of components. Although many studies on the use of BN for estimating the system reliability have been conducted, there is a lack of effective modeling power regarding current tools in depicting both functional and temporal dependencies between components. In this paper, a new modeling approach to DBN generation is submitted, which can be applied to the system made up of certain components and different types of flows propagating through them. The Component-based CPT (Conditional Probability Table) and Time-dependent CPT are used to describe functional dependencies and temporal dependencies respectively. As the complexity of the system cannot be modeled in a tractable way as a DBN, a Breadth-First-Search (BFS) algorithm is introduced for the construction of the DBN model in an automated manner. With the application of the proposed DBN-based approach, the reliability of the traction system can be evaluated at any given time, which is of great significance to determine the plan of maintenance in an effort to ensure the system safety.
Źródło:
Eksploatacja i Niezawodność; 2017, 19, 3; 349-357
1507-2711
Pojawia się w:
Eksploatacja i Niezawodność
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A new method of decision making in multi-objective optimal placement and sizing of distributed generators in the smart grid
Autorzy:
Khoshayand, Hossein Ali
Wattanapongsakorn, Naruemon
Mahdavian, Mehdi
Ganji, Ehsan
Powiązania:
https://bibliotekanauki.pl/articles/2202555.pdf
Data publikacji:
2023
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
backward-forward load distribution
fuzzy logic
iterative search algorithm
multi-objective optimization
shortest distance from the origin
weighted sum
Opis:
One of the most important aims of the sizing and allocation of distributed generators (DGs) in power systems is to achieve the highest feasible efficiency and performance by using the least number of DGs. Considering the use of two DGs in comparison to a single DG significantly increases the degree of freedom in designing the power system. In this paper, the optimal placement and sizing of two DGs in the standard IEEE 33-bus network have been investigated with three objective functions which are the reduction of network losses, the improvement of voltage profiles, and cost reduction. In this way, by using the backward-forward load distribution, the load distribution is performed on the 33-bus network with the power summation method to obtain the total system losses and the average bus voltage. Then, using the iterative search algorithm and considering problem constraints, placement and sizing are done for two DGs to obtain all the possible answers and next, among these answers three answers are extracted as the best answers through three methods of fuzzy logic, the weighted sum, and the shortest distance from the origin. Also, using the multi-objective non-dominated sorting genetic algorithm II (NSGA-II) and setting the algorithm parameters, thirty-six Pareto fronts are obtained and from each Pareto front, with the help of three methods of fuzzy logic, weighted sum, and the shortest distance from the origin, three answers are extracted as the best answers. Finally, the answer which shows the least difference among the responses of the iterative search algorithm is selected as the best answer. The simulation results verify the performance and efficiency of the proposed method.
Źródło:
Archives of Electrical Engineering; 2023, 72, 1; 253--271
1427-4221
2300-2506
Pojawia się w:
Archives of Electrical Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
DSSA+: distributed collision avoidance algorithm in an environment where both course and speed changes are allowed
Autorzy:
Hirayama, K.
Miyake, K.
Shiotani, T.
Okimoto, T.
Powiązania:
https://bibliotekanauki.pl/articles/116483.pdf
Data publikacji:
2019
Wydawca:
Uniwersytet Morski w Gdyni. Wydział Nawigacyjny
Tematy:
collision avoidance
collision avoidance algorithm
vessel course changes
vessel speed changes
Distributed Stochastic Search Algorithm (DSSA)
colregs
ARPA
Distributed Constraint Optimization Problem (DCOP)
Opis:
Distributed Stochastic Search Algorithm (DSSA) is one of state-of-the-art distributed algorithms for the ship collision avoidance problem. In DSSA, whenever a ship encounters with any number of other ships (neighboring ships), she will select her course with a minimum cost after coordinating their decisions with her neighboring ships. The original DSSA assumes that ships can change only their courses while keeping their speed considering kinematic properties of ships in general. However, considering future possibilities to address more complex situations that may cause ship collision or to deal with collision of other vehicles (such as mobile robots or drones), the options of speed changes are necessary for DSSA to make itself more flexible and extensive. In this paper, we present DSSA+, as a generalization of DSSA, in which speed change are naturally incorporated as decision variables in the original DSSA. Experimental evaluations are provided to show how powerful this generalization is.
Źródło:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2019, 13, 1; 117-123
2083-6473
2083-6481
Pojawia się w:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Controlling the mean arterial pressure by modified model reference adaptive controller based on two optimization algorithms
Autorzy:
Haamed, Rawaa
Hameed, Ekhlas
Powiązania:
https://bibliotekanauki.pl/articles/117814.pdf
Data publikacji:
2020
Wydawca:
Polskie Towarzystwo Promocji Wiedzy
Tematy:
Mean Arterial Pressure
Squirrel Search Algorithm
Model Reference Adaptive Controller
średnie ciśnienie tętnicze
algorytm wyszukiwania
kontroler adaptacyjny odniesienia modelu
Opis:
This paper Presents Modified Model Reference Adaptive Controller (MRAC) to regulate the hight blood pressure. It is based on slate model that repre-sent the mathematical equation that clarifies relationship between blood pressure and vasoactive drug injection. In this work Squirrel Search Algo-rithm (SSA) and Grey Wolf Optimizer (GWO) algorithms are considered to optimize the controller parameters. the results showed that the suggested controller has good performance and stabilize the mean arterial pressure with small settling time (below than 400s) and small overshoot (below than 1 mmHg) with low amount of error.
Źródło:
Applied Computer Science; 2020, 16, 2; 53-67
1895-3735
Pojawia się w:
Applied Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Analiza wpływu obiektów przewodzących i magnetycznych na dokładność działania systemu elektromagnetycznej nawigacji medycznej oraz możliwości ograniczenia tego wpływu
Analysis of the influence of conductive and magnetic objects on the accuracy of electro-magnetic medical navigation system operation and possibilities of reducing that influence
Autorzy:
Tewel, N.
Moroń, Z.
Powiązania:
https://bibliotekanauki.pl/articles/157705.pdf
Data publikacji:
2013
Wydawca:
Stowarzyszenie Inżynierów i Techników Mechaników Polskich
Tematy:
elektromagnetyczna nawigacja medyczna
deformacje rozkładu pola magnetycznego
błąd określenia położenia w przestrzeni
electromagnetic medical navigation
distortion of magnetic field
"pattern search" algorithm
Opis:
Przedmiotem artykułu są badania wpływu obiektów przewodzących i magnetycznych na dokładność działania systemu nawigacji elektromagnetycznej przeznaczonego do zastosowań medycznych oraz możliwości eliminacji lub ograniczenia tego wpływu. Stosując modelowanie i symulację metodą elementów skończonych (MES) dokonano liczbowego oszacowania wpływu typowych obiektów wymienionego rodzaju na błąd określenia położenia punktów w przestrzeni z użyciem takiego systemu. Wynikiem tych prac jest zbiór wskazówek i wytycznych umożliwiających ograniczenie tego wpływu.
Medical navigation is used both in surgery and diagnostics to compute position of the distant end of medical tools immersed inside the patient’s body [1]. One of medical navigation methods is the electromagnetic navigation. Its main advantage is lack of requirement of providing a clean line of sight (LOS) between the tools and a source of the magnetic field (emitter). A real disadvantage of the electromagnetic method is its sensitivity to the influence of conductive and magnetic objects placed inside the operating space of the system [4, 5]. The main subject of this paper is an analysis of the influence of typical medical tools and other metal objects that can be used inside or close to the electromagnetic navigation system intended for laryngological applications. The objective set was obtained by using the finite element method of modeling and simulation. Description of the used models is given in Tables 1 and 2, and Fig. 1. Figs. 3 – 10 show the position determination error caused by the presence of conductive and magnetic objects, at different frequencies of the exciting field. According to the presented results, it is impossible to select the frequency range enabling simultaneous reduction of errors caused by both conductive non-magnetic and magnetic objects of different size and shape. However, for some selected objects used in the laryngological system, the most appropriate range of frequency seems to be hundreds of kilohertz. Bigger conductive or magnetic objects should be spaced at a distance no smaller than single meters from the operating space of the system.
Źródło:
Pomiary Automatyka Kontrola; 2013, R. 59, nr 5, 5; 473-476
0032-4140
Pojawia się w:
Pomiary Automatyka Kontrola
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Zastosowanie algorytmów przeszukiwania grafów do analizy obrazów medycznych
Analysis of medical images based on graph search algorithms
Autorzy:
Dimitrova-Grekow, T.
Dąbkowski, A.
Powiązania:
https://bibliotekanauki.pl/articles/156629.pdf
Data publikacji:
2012
Wydawca:
Stowarzyszenie Inżynierów i Techników Mechaników Polskich
Tematy:
analiza obrazów medycznych
algorytmy przeszukiwania grafów
uczenie maszynowe
eksploracja danych
rozpoznawanie choroby
image analysis
graph search algorithm
machine learning
data mining
disease recognition
Opis:
W artykule przedstawiono wyniki testów niekonwencjonalnego zastosowania metod do przeszukiwania grafów w celu analizy obrazów powstałych z rezonansu magnetycznego głowy. Zaprezentowano GUI do automatycznej obróbki serii obrazów. Zbudowane klasyfikatory wykazały, że metoda BFS analizy plików DICOM, po odpowiednej selekcji cech, pozwala na 100% rozpoznawanie chorych na wodogłowie i ponad 90% zdrowych, co zachęca do dalszych badań i obserwacji, np. czy osoby sklasyfikowane błędnie jako chorzy, po czasie rzeczywiście nie rozwinęli tej choroby.
There are many methods for image segmentation [1, 2]: threshold, area, edge and hybrid methods. Area methods indicate groups of similar pixels form local regions [3, 4]. Edge methods detect boundaries between homogeneous segments [5, 6, 7]. In this paper we present the results of tests of unconventional implementation of graph search methods for the analysis of images generated from magnetic resonance imaging [8]. We explored the effectiveness of different approaches for dividing areas within a similar gray scale, using adapted graph search algorithms (DFS, BFS) after appropriate modification (Fig. 1). For this purpose, the Weka package (a tool for pre-processing, classification, regression, clustering and data visualization) was used [9]. A training set was generated after analyzing all the series of images from the database. First, we evaluated models created using certain algorithms and compared their efficacy (Tab. 1). This was followed by a selection of attributes (Tab. 2) and a re-evaluation of the models (Tab. 3). Comparison of the results of both evaluations showed that after selection of the relevant product attributes, you can achieve up to 100% detection of patients with hydrocephalus and over 90% proper recognition of healthy persons. This encourages further research and observation, such as whether persons wrongly classified as sick actually developed the disease in time. We designed a web application for the study, written in Windows Azure, as well as a GUI for automatic processing of a series of images (Fig. 2).
Źródło:
Pomiary Automatyka Kontrola; 2012, R. 58, nr 7, 7; 578-580
0032-4140
Pojawia się w:
Pomiary Automatyka Kontrola
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Optimizing the harmony search algorithm for combined heat and power economic dispatch in american english
Autorzy:
Benayed, F.Z.
Abdelhakem-Koridak, L.
Bouadi, A.
Rahli, M.
Powiązania:
https://bibliotekanauki.pl/articles/41184379.pdf
Data publikacji:
2023
Wydawca:
Politechnika Warszawska, Instytut Techniki Cieplnej
Tematy:
combined heat and power system
harmony search algorithm
optimization of power systems
połączony system ciepłowniczy i elektroenergetyczny
algorytm poszukiwania harmonii
optymalizacja systemów energetycznych
Opis:
Achieving optimal utilization of multiple combined heat and power (CHP) systems is a complex problem that requires powerful methods for resolution. This paper presents a harmony search (HS) algorithm to address the economic dispatch issue in CHP (CHPED ). The recently developed metaheuristic HS algorithm has been successfully employed in a wide range of optimization problems. The method is demonstrated through a test case from existing literature and a new one proposed by the authors. Numerical results indicate that the proposed algorithm can identify superior solutions compared to traditional methods, and that the Harmony Search algorithm can be effectively applied to CHPED-related problems.
Źródło:
Journal of Power Technologies; 2023, 103, 1; 14-20
1425-1353
Pojawia się w:
Journal of Power Technologies
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Verification of ships trajectory planning algorithms using real navigational data
Autorzy:
Lazarowska, A.
Powiązania:
https://bibliotekanauki.pl/articles/117103.pdf
Data publikacji:
2019
Wydawca:
Uniwersytet Morski w Gdyni. Wydział Nawigacyjny
Tematy:
Visibility Graph-search Algorithm (VGA)
Discrete Artificial Potential Field (DAPF)
real navigational data
ARPA
ship's trajectory planning
ship's trajectory planning algorithms
Ant Colony Optimization (ACO)
Trajectory Base Algorithm (TBA)
Opis:
The paper presents results of ship's safe trajectory planning algorithms verification. Real navigational data registered from a radar with an Automatic Radar Plotting Aid on board the research and training ship Horyzont II were used as input data to the algorithms. The algorithms verified in the presented research include the Ant Colony Optimization algorithm (ACO), the Trajectory Base Algorithm (TBA), the Visibility Graph-search Algorithm (VGA) ant the Discrete Artificial Potential Field algorithm (DAPF). Details concerning data registration and exemplary results obtained with the use or real navigational data are introduced and summarized in the paper. Presented results prove the applicability of proposed algorithms for solving the ship's safe trajectory planning problem.
Źródło:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2019, 13, 3; 559-564
2083-6473
2083-6481
Pojawia się w:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Harmonogramowanie robót budowlanych z zastosowaniem algorytmu Tabu Search z rozmytymi czasami wykonania zadań
Scheduling of construction works using a tabu search algorithm with fuzzy task completion times
Autorzy:
Rogalska, M.
Bożejko, W.
Hejducki, Z.
Wodecki, M.
Powiązania:
https://bibliotekanauki.pl/articles/161714.pdf
Data publikacji:
2009
Wydawca:
Polski Związek Inżynierów i Techników Budownictwa
Tematy:
inwestycja budowlana
proces budowlany
harmonogram robót
niepewność
czas wykonania zadań
czas rozmyty
algorytm tabu search
construction project
construction process
schedule of works
uncertainty
task execution time
fuzzy time
tabu search algorithm
Opis:
Praca ta stanowi kontynuację studiów różnych autorów nad zagadnieniami związanymi z uwzględnieniem niepewności w harmonogramowaniu robót budowlanych. Jednym ze sposobów reprezentowania niepewności jest zastosowanie elementów teorii zbiorów rozmytych, umożliwiających oszacowanie czasów wykonania prac oraz cyklu realizacji kompleksu robót.
This paper continues the authors' work on issues relating to taking account of uncertainties in the scheduling of construction works. One way of representing uncertainty is to use elements of the theory of fuzzy sets, which make it possible to estimate work completion times and the execution cycle for a comprehensive series of works.
Źródło:
Przegląd Budowlany; 2009, R. 80, nr 7-8, 7-8; 76-80
0033-2038
Pojawia się w:
Przegląd Budowlany
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A novel hybrid cuckoo search algorithm for optimization of a line-start PM synchronous motor
Autorzy:
Knypiński, Łukasz
Powiązania:
https://bibliotekanauki.pl/articles/2204509.pdf
Data publikacji:
2023
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
hybrid cuckoo search algorithm
heuristic algorithms
multi-objective optimization
permanent magnet synchronous motor
PMSM
algorytm kukułki hybrydowy
algorytm Cuckoo
algorytm heurystyczny
optymalizacja wielocelowa
silnik synchroniczny z magnesem trwałym
Opis:
The paper presents a novel hybrid cuckoo search (CS) algorithm for the optimization of the line-start permanent magnet synchronous motor (LSPMSM). The hybrid optimization algorithm developed is a merger of the heuristic algorithm with the deterministic Hooke–Jeeves method. The hybrid optimization procedure developed was tested on analytical benchmark functions and the results were compared with the classical cuckoo search algorithm, genetic algorithm, particle swarm algorithm and bat algorithm. The optimization script containing a hybrid algorithm was developed in Delphi Tiburón. The results presented show that the modified method is characterized by better accuracy. The optimization procedure developed is related to a mathematical model of the LSPMSM. The multi-objective compromise function was applied as an optimality criterion. Selected results were presented and discussed.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2023, 71, 1; art. no. e144586
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Optimal design of RC frames using a modified hybrid PSOGSA algorithm
Optymalny projekt ramy RC z wykorzystaniem zmodyfikowanego algorytmu hybrydowego PSOGSA
Autorzy:
Chutani, S.
Singh, J.
Powiązania:
https://bibliotekanauki.pl/articles/230376.pdf
Data publikacji:
2017
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
projekt optymalny
konstrukcja żelbetowa
optymalizacja demokratyczna roju cząstek
samoadaptacyjny algorytm
grawitacyjnego wyszukiwania
projektowanie
Indie
norma indyjska
optimum design
reinforced concrete structure
democratic particle swarm optimization
selfadaptive gravitational search algorithm
design
Indian standard
Opis:
The present study has been taken up to emphasize the role of the hybridization process for optimizing a given reinforced concrete (RC) frame. Although various primary techniques have been hybrid in the past with varying degree of success, the effect of hybridization of enhanced versions of standard optimization techniques has found little attention. The focus of the current study is to see if it is possible to maintain and carry the positive effects of enhanced versions of two different techniques while using their hybrid algorithms. For this purpose, enhanced versions of standard particle swarm optimization (PSO) and a standard gravitational search algorithm (GSA), were considered for optimizing an RC frame. The enhanced version of PSO involves its democratization by considering all good and bad experiences of the particles, whereas the enhanced version of the GSA is made self-adaptive by considering a specific range for certain parameters, like the gravitational constant and a set of agents with the best fitness values. The optimization process, being iterative in nature, has been coded in C++. The analysis and design procedure is based on the specifications of Indian codes. Two distinct advantages of enhanced versions of standard PSO and GSA, namely, better capability to escape from local optima and a faster convergence rate, have been tested for the hybrid algorithm. The entire formulation for optimal cost design of a frame includes the cost of beams and columns. The variables of each element of structural frame have been considered as continuous and rounded off appropriately to consider practical limitations. An example has also been considered to emphasize the validity of this optimum design procedure.
W niniejszym artykule przedstawiono bardziej realistyczny i optymalny projekt żlbetowych ram konstrukcyjnych (RC) poprzez hybrydyzację ulepszonych wersji standardowej optymalizacji roju cząsteczek (PSO) oraz standardowy algorytm wyszukiwania grawitacyjnego (GSA). Podejście proponowane w niniejszej pracy koncentruje się na hybrydyzacji ulepszonych wersji standardowej optymalizacji roju cząsteczek (PSO) oraz standardowym algorytmie wyszukiwania grawitacyjnego (GSA). PSO została zdemokratyzowana poprzez uwzględnienie wszystkich dobrych i złych doświadczeń w zakresie cząsteczek, podczas gdy GSA został zmieniony na samodostosowujący, uwzględniając określony zakres dla niektórych parametrów, takich jak np. stała grawitacyjna i zestaw czynników o najlepszych wartościach sprawności. Optymalny rozmiar i wzmocnienie elementów zostały określone dzięki zastosowaniu techniki w środowisku komputerowym, w którym cały proces analizy, projektowania i optymalizacji został zakodowany w C++. Procedura analizy i projektowania przebiega zgodnie ze specyfikacjami kodów indyjskich. Okazało się, że zastosowanie samodostosowującego algorytmu wyszukiwania grawitacyjnego wraz z demokratyczną techniką optymalizacji roju cząsteczek zapewnia dwie wyraźne przewagi nad standardową PSO i GSA, a mianowicie lepszą zdolność do ucieczki od lokalnej optymalności i szybszy współczynnik konwergencji. Całe sformułowanie dla optymalnego projektu kosztów ramy obejmuje zarówno koszt belek i słupów. W tym podejściu, zmienne każdego elementu ramy konstrukcyjnej zostały uznane za funkcje ciągłe i zaokrąglone odpowiednio do zastosowania praktycznego znaczenia niniejszego badania. Rozważono kilka przykładów, które podkreślają ważność optymalnej procedury projektowania, a wyniki porównano z wcześniejszymi badaniami, w celu sprawdzenia ich skuteczności i efektywności. Proponowany algorytm pokonuje ograniczenia dwóch indywidualnych algorytmów, biorąc pod uwagę ich hybrydę, a tym samym poprawia ogólną wydajność. Wprowadzono niezbędne zmiany, aby badanie było zgodne z wcześniejszymi badaniami. Porównanie z innymi wcześniej stosowanymi technikami hybrydowymi pokazuje, że czas potrzebny na przeprowadzenie procesu optymalizacji w niniejszym badaniu – z wykorzystaniem techniki MPSOGSA – został znacznie zmniejszony. Ponadto, podczas projektowania ram RC obniżono całkowity koszt za pomocą techniki MPSOGSA. Obniżenie kosztów w obszarze stali odgrywa większą rolę w optymalizacji, w porównaniu do redukcji kosztów w przekroju poprzecznym elementów ramy, co zostało szczegółowo przeanalizowane na przykładzie.
Źródło:
Archives of Civil Engineering; 2017, 63, 4; 123-134
1230-2945
Pojawia się w:
Archives of Civil Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Loadability maximisation in bilateral network for real-time forecasting system using cuckoo search algorithm
Autorzy:
Venkatasivanagaraju, S.
Rao, M. Venkateswara
Powiązania:
https://bibliotekanauki.pl/articles/38699704.pdf
Data publikacji:
2023
Wydawca:
Instytut Podstawowych Problemów Techniki PAN
Tematy:
optimal power flow
NR method
short-term load forecasting
long-term load forecasting
cuckoo search algorithm
optimisation
loss minimisation
optymalny przepływ mocy
metoda NR
krótkoterminowe prognozowanie obciążeń
długoterminowe prognozowanie obciążeń
algorytm kukułki
optymalizacja
minimalizacja strat
Opis:
This manuscript proposes an optimal power flow (OPF) solution in a coordinated bilateralpower network. The primary goal of this project is to maximise the benefits of the powermarket using Newton–Raphson (NR) and cuckoo search algorithm CSA methodologies.The global solution is found using a CSA-based optimisation approach. The study isconducted on real-time bus system. To avoid this, creative techniques have lately beenused to handle the OPF problem, such as loadability maximisation for real-time predictionsystems employing the CSA. In this work, cuckoo search (CS) is used to optimise theobtained parameters that help to minimise parameters in the predecessor and consequentunits of each sub-model. The proposed approach is used to estimate the power load in thelocal area. The constructed models show excellent predicting performance based on derivedperformance. The results confirm the method’s validity. The outcomes are compared withthose obtained by using the NR method. CSA outperformed the other methods in thisinvestigation and gave more accurate predictions. The OPF problem is solved via CSAin this study. Implementing a real-time data case bus system is recommended to test theperformance of the established method in the MATLAB programme.
Źródło:
Computer Assisted Methods in Engineering and Science; 2023, 30, 1; 73-88
2299-3649
Pojawia się w:
Computer Assisted Methods in Engineering and Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Lung cancer detection using an integration of fuzzy K-Means clustering and deep learning techniques for CT lung images
Autorzy:
Prasad, J. Maruthi Nagendra
Chakravarty, S.
Krishna, M. Vamsi
Powiązania:
https://bibliotekanauki.pl/articles/2173683.pdf
Data publikacji:
2022
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
fuzzy K-means
artificial neural networks
SVM
support vector machine
crow search optimization algorithm
algorytm rozmytych k-średnich
sztuczne sieci neuronowe
maszyna wektorów wspierających
algorytm optymalizacji wyszukiwania kruków
Opis:
Computer aided detection systems are used for the provision of second opinion during lung cancer diagnosis. For early-stage detection and treatment false positive reduction stage also plays a vital role. The main motive of this research is to propose a method for lung cancer segmentation. In recent years, lung cancer detection and segmentation of tumors is considered one of the most important steps in the surgical planning and medication preparations. It is very difficult for the researchers to detect the tumor area from the CT (computed tomography) images. The proposed system segments lungs and classify the images into normal and abnormal and consists of two phases, The first phase will be made up of various stages like pre-processing, feature extraction, feature selection, classification and finally, segmentation of the tumor. Input CT image is sent through the pre-processing phase where noise removal will be taken care of and then texture features are extracted from the pre-processed image, and in the next stage features will be selected by making use of crow search optimization algorithm, later artificial neural network is used for the classification of the normal lung images from abnormal images. Finally, abnormal images will be processed through the fuzzy K-means algorithm for segmenting the tumors separately. In the second phase, SVM classifier is used for the reduction of false positives. The proposed system delivers accuracy of 96%, 100% specificity and sensitivity of 99% and it reduces false positives. Experimental results shows that the system outperforms many other systems in the literature in terms of sensitivity, specificity, and accuracy. There is a great tradeoff between effectiveness and efficiency and the proposed system also saves computation time. The work shows that the proposed system which is formed by the integration of fuzzy K-means clustering and deep learning technique is simple yet powerful and was effective in reducing false positives and segments tumors and perform classification and delivers better performance when compared to other strategies in the literature, and this system is giving accurate decision when compared to human doctor’s decision.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2022, 70, 3; art. no. e139006
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An Adaptation of an Algorithm of Search and Rescue Operations to Ship Manoeuvrability
Autorzy:
Kasyk, L.
Pleskacz, K.
Powiązania:
https://bibliotekanauki.pl/articles/116946.pdf
Data publikacji:
2015
Wydawca:
Uniwersytet Morski w Gdyni. Wydział Nawigacyjny
Tematy:
search and rescue (SAR)
Ship Manoeuvrability
Algorithm
Search and Rescue Operations
Hydrometeorological Conditions
IAMSAR
SAR Action Algorithm
ECDIS
Opis:
This article presents an overview of an algorithm to facilitate action when planning search and rescue operations, taking into account actual hydro-meteorological conditions and the maneuverability of ships involved in the search.
Źródło:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2015, 9, 2; 265-268
2083-6473
2083-6481
Pojawia się w:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Falcon optimization algorithm for bayesian network structure learning
Autorzy:
Kareem, Shahab Wahhab
Okur, Mehmet Cudi
Powiązania:
https://bibliotekanauki.pl/articles/2097968.pdf
Data publikacji:
2021
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
Bayesian network
global search
falcon optimization algorithm
structure learning
search and score
Opis:
In machine-learning, some of the helpful scientific models during the production of a structure of knowledge are Bayesian networks. They can draw the relationships of probabilistic dependency among many variables. The score and search method is a tool that is used as a strategy for learning the structure of a Bayesian network. The authors apply the falcon optimization algorithm (FOA) to the learning structure of a Bayesian network. This paper has employed reversing, deleting, moving, and inserting to obtain the FOA for approaching the optimal solution of a structure. Essentially, the falcon prey search strategy is used in the FOA algorithm. The result of the proposed technique is associated with pigeon-inspired optimization, greedy search, and simulated annealing that apply the BDeu score function. The authors have also examined the performances of the confusion matrix of these techniques by utilizing several benchmark data sets. As shown by the experimental evaluations, the proposed method has a more reliable performance than other algorithms (including the production of excellent scores and accuracy values).
Źródło:
Computer Science; 2021, 22 (4); 553--569
1508-2806
2300-7036
Pojawia się w:
Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Problem-Independent Approach to Multiprocessor Dependent Task Scheduling
Autorzy:
Król, D.
Zydek, D.
Koszałka, L.
Powiązania:
https://bibliotekanauki.pl/articles/226364.pdf
Data publikacji:
2012
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
tasks scheduling
DAG
genetic algorithm
tabu search
makespan
Opis:
This paper concerns Directed Acyclic Graph task scheduling on parallel executors. The problem is solved using two new implementations of Tabu Search and genetic algorithm presented in the paper. A new approach to solution coding is also introduced and implemented in both metaheuristics algorithms. Results given by the algorithms are compared to those generated by greedy LPT and SS-FF algorithms; and HAR algorithm. The analysis of the obtained results of multistage simulation experiments confirms the conclusion that the proposed and implemented algorithms are characterized by very good performance and characteristics.
Źródło:
International Journal of Electronics and Telecommunications; 2012, 58, 4; 369-379
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A Short Introduction to Stochastic Optimization
Autorzy:
Ombach, Jerzy
Powiązania:
https://bibliotekanauki.pl/articles/1373633.pdf
Data publikacji:
2014
Wydawca:
Uniwersytet Jagielloński. Wydawnictwo Uniwersytetu Jagiellońskiego
Tematy:
global optimization
stochastic algorithm
random search
convergence of metaheuristics
Opis:
We present some typical algorithms used for finding global minimum/ maximum of a function defined on a compact finite dimensional set, discuss commonly observed procedures for assessing and comparing the algorithms’ performance and quote theoretical results on convergence of a broad class of stochastic algorithms.
Źródło:
Schedae Informaticae; 2014, 23; 9-20
0860-0295
2083-8476
Pojawia się w:
Schedae Informaticae
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A strategy in sports betting with the nearest neighbours search and genetic algorithms
Autorzy:
Borycki, D.
Powiązania:
https://bibliotekanauki.pl/articles/106184.pdf
Data publikacji:
2011
Wydawca:
Uniwersytet Marii Curie-Skłodowskiej. Wydawnictwo Uniwersytetu Marii Curie-Skłodowskiej
Tematy:
sports betting
nearest neighbour search
genetic algorithm
English Premier League
Opis:
The point of sports betting is not merely to correctly predict the outcome of a game, but to actually win on a bet. We propose a model of sports betting that uses the nearest neighbours search and genetic algorithms to do the job. It uses data on the teams playing, their respective formations, individual players, results of previous games, as well as odds offered by bookmakers. The model has been trained using the data from the seasons 2002/03 until 2008/09 of the English Premier League and tested against the already played games of the seasons 2009/10 and 2010/11.
Źródło:
Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica; 2011, 11, 1; 7-13
1732-1360
2083-3628
Pojawia się w:
Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Minimizing the Makespan and Total Tardiness in Hybrid Flow Shop Scheduling with Sequence-Dependent Setup Times
Autorzy:
Mousavi, Seyyed Mostafa
Shahnazari-Shahrezaei, Parisa
Powiązania:
https://bibliotekanauki.pl/articles/2201180.pdf
Data publikacji:
2023
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
dispatching rule
genetic algorithm
hybrid flow shop
neighborhood search structure
Opis:
The paper considers the production scheduling problem in a hybrid flow shop environment with sequence-dependent setup times and the objectives of minimizing both the makespan and the total tardiness. The multi-objective genetic algorithm is applied to solve this problem, which belongs to the non-deterministic polynomial-time (NP)-hard class. In the structure of the proposed algorithm, the initial population, neighborhood search structures and dispatching rules are studied to achieve more efficient solutions. The performance of the proposed algorithm compared to the efficient algorithm available in literature (known as NSGA-II) is expressed in terms of the data envelopment analysis method. The computational results confirm that the set of efficient solutions of the proposed algorithm is more efficient than the other algorithm.
Źródło:
Management and Production Engineering Review; 2023, 14, 1; 13--24
2080-8208
2082-1344
Pojawia się w:
Management and Production Engineering Review
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Evaluation of the PageRank algorithm effectiveness
Autorzy:
Worwa, K.
Konopacki, G.
Powiązania:
https://bibliotekanauki.pl/articles/94755.pdf
Data publikacji:
2013
Wydawca:
Szkoła Główna Gospodarstwa Wiejskiego w Warszawie. Wydawnictwo Szkoły Głównej Gospodarstwa Wiejskiego w Warszawie
Tematy:
search engine
crawling
Page rank algorithm
wyszukiwarka
algorytm Pagerank
efektywność
Opis:
In this paper the challenges in building good search engines are discussed. Many of the search engines use well-known information retrieval algorithms and techniques. They use Web crawlers to maintain their index databases amortizing the cost of crawling and indexing over the millions of queries received by them. Web crawlers are programs that exploit the graph structure of the Web to move from page to page. Paper analyses the PageRank algorithm one of these Web crawlers. The results of the impact of the PageRank parameter value on the effectiveness of determining the so-called PageRank vector are considered in the paper. Investigations are illustrated by means of the results of a some simulation experiments to analyze the PageRank algorithm efficiency for different density graph (representing analyzed part of www) coefficient values.
Źródło:
Information Systems in Management; 2013, 2, 1; 73-84
2084-5537
2544-1728
Pojawia się w:
Information Systems in Management
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Bi-directional search in route planning in navigation
Autorzy:
Dramski, M.
Powiązania:
https://bibliotekanauki.pl/articles/360091.pdf
Data publikacji:
2014
Wydawca:
Akademia Morska w Szczecinie. Wydawnictwo AMSz
Tematy:
shortest path
safe route
restricted area
bi-directional search
Dijkstra algorithm
Opis:
The shortest path problem is one of the most significant ones in the field of maritime navigation. One of the most efficient algorithms was proposed by E. Dijkstra in 1959. Taking into account the development of computer technology was offered another interesting approach to the issue. The main idea is to execute the shortest path algorithm simultaneously forward from the source and backward from the target. The results are presented and discussed.
Źródło:
Zeszyty Naukowe Akademii Morskiej w Szczecinie; 2014, 39 (111); 57-62
1733-8670
2392-0378
Pojawia się w:
Zeszyty Naukowe Akademii Morskiej w Szczecinie
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Monte Carlo Tree Search Algorithm for the Euclidean Steiner Tree Problem
Autorzy:
Bereta, M.
Powiązania:
https://bibliotekanauki.pl/articles/308683.pdf
Data publikacji:
2017
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
Euclidean Steiner tree problem
MCTS
Monte Carlo Tree Search
UCT algorithm
Opis:
This study is concerned with a novel Monte Carlo Tree Search algorithm for the problem of minimal Euclidean Steiner tree on a plane. Given p p p points (terminals) on a plane, the goal is to find a connection between all the points, so that the total sum of the lengths of edges is as low as possible, while an addition of extra points (Steiner points) is allowed. Finding the minimum Steiner tree is known to be np-hard. While exact algorithms exist for this problem in 2D, their efficiency decreases when the number of terminals grows. A novel algorithm based on Upper Confidence Bound for Trees is proposed. It is adapted to the specific characteristics of Steiner trees. A simple heuristic for fast generation of feasible solutions based on Fermat points is proposed together with a correction procedure. By combing Monte Carlo Tree Search and the proposed heuristics, the proposed algorithm is shown to work better than both the greedy heuristic and pure Monte Carlo simulations. Results of numerical experiments for randomly generated and benchmark library problems (from OR-Lib) are presented and discussed.
Źródło:
Journal of Telecommunications and Information Technology; 2017, 4; 71-81
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Application of RRAP reliability optimization as a test of nature-inspired algorithms
Autorzy:
Pieprzycki, Adam
Filipowicz, Bogusław
Powiązania:
https://bibliotekanauki.pl/articles/35533466.pdf
Data publikacji:
2024-02-15
Wydawca:
Akademia Tarnowska
Tematy:
reliability optimization
RRAP
Firefly Algorithm (FA)
Cuckoo Search (CS)
ANOVA
Lévy flight
Opis:
This paper presents a discussion on the application of two swarm intelligence algorithms, Cuckoo Search (CS) and Firey Algorithm (FA), to maximize the reliability of two complex systems with resource constraints, which have been well-known in the literature. The reliability of the systems is also evaluated using several classical methods. The results indicate that although the CS algorithm, which utilizes Lévy flight, is eective, the FA rey algorithm outperformed it in the presented optimization tasks, within the given parameter range. These ndings contribute to the ongoing discussion on using nature-inspired algorithms for solving Reliability Redundancy Allocation Problem (RRAP) problems, and the two test scenarios used in the study can be useful for validating other algorithms in RRAP problems. The paper introduces metrics and methods for analyzing and comparing the performance of algorithms in RRAP optimization, including the comparison of criterion function values and other parameters introduced in the paper. Additionally, the paper discusses statistical analyses of variance (ANOVA) with post-hoc RIR Tuckey tests.
Źródło:
Science, Technology and Innovation; 2023, 18, 3-4; 1-14
2544-9125
Pojawia się w:
Science, Technology and Innovation
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Application of the Harmony Search algorithm in solving the inverse heat conduction problem
Zastosowanie algorytmu "Harmony Search" do rozwiązania odwrotnego zagadnienia przewodnictwa ciepła
Autorzy:
Hetmaniok, E.
Jama, D.
Słota, D.
Zielonka, A.
Powiązania:
https://bibliotekanauki.pl/articles/87282.pdf
Data publikacji:
2011
Wydawca:
Politechnika Śląska. Wydawnictwo Politechniki Śląskiej
Tematy:
algorytm optymalizacyjny
Harmony Search
dźwięk
przewodnictwo cieplne
harmonia
zagadnienie odwrotne
optimization algorithm
harmony search
sound
heat conduction
harmony
inverse problem
Opis:
In this paper the inverse heat conduction problem with boundary condition of the third kind is solved by applying the recently invented Harmony Search algorithm belonging to the group of optimization algorithms inspired by the natural behaviors or processes. In this case the applied algorithm imitates the process of searching for the harmony in jazz music composition.In this paper the inverse heat conduction problem with boundary condition of the third kind is solved by applying the recently invented Harmony Search algorithm belonging to the group of optimization algorithms inspired by the natural behaviors or processes. In this case the applied algorithm imitates the process of searching for the harmony in jazz music composition.
Celem niniejszego artykułu jest rozwiązanie odwrotnego zagadnienia przewodnictwa ciepła z warunkiem brzegowym trzeciego rodza- ju przy użyciu niedawno zaproponowanego algorytmu „Harmony Search” (poszukiwania harmonii). Zastosowany algorytm należy do grupy algoryt- mów optymalizacyjnych inspirowanych zachowaniami bądź procesami za- chodzącymi w rzeczywistym świecie, w szczególności imituje proces poszu- kiwania harmonii dźwięków podczas improwizacji jazzowej.
Źródło:
Zeszyty Naukowe. Matematyka Stosowana / Politechnika Śląska; 2011, 1; 99-108
2084-073X
Pojawia się w:
Zeszyty Naukowe. Matematyka Stosowana / Politechnika Śląska
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
B-TREE algorithm complexity analysis to evaluate the feasibility of its application in the university course timetabling problem
Autorzy:
Cruz Chávez, M. A.
Martínez Oropeza, A.
Powiązania:
https://bibliotekanauki.pl/articles/91757.pdf
Data publikacji:
2013
Wydawca:
Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
Tematy:
B-TREE
algorithm
Binary Search Algorithms
complexity analysis
University Course Timetabling Problem
UCTP
Opis:
This paper presents a comparative analysis of complexity between the B-TREE and the Binary Search Algorithms, both theoretically and experimentally, to evaluate their efficiency in finding overlap of classes for students and teachers in the University Course Timetabling Problem (UCTP). According to the theory, B-TREE Search complexity is lower than Binary Search. The performed experimental tests showed the B-TREE Search Algorithm is more efficient than Binary Search, but only using a dataset larger than 75 students per classroom.
Źródło:
Journal of Artificial Intelligence and Soft Computing Research; 2013, 3, 4; 251-263
2083-2567
2449-6499
Pojawia się w:
Journal of Artificial Intelligence and Soft Computing Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Derivative free optimal thrust allocation in ship dynamic positioning based on direct search algorithms
Autorzy:
Valčić, M.
Prpić-Oršić, J.
Powiązania:
https://bibliotekanauki.pl/articles/116991.pdf
Data publikacji:
2020
Wydawca:
Uniwersytet Morski w Gdyni. Wydział Nawigacyjny
Tematy:
algorithm
dynamic positioning
direct search algorithms
sequential quadratic programing (SQP)
Singular Values Decomposition (SVD)
Lagrangian Multiplier Method (LMM)
Direct Search (DS)
Mesh Adaptive Direct Search (MADS)
Opis:
In dynamic positioning systems, nonlinear cost functions, as well as nonlinear equality and inequality constraints within optimal thrust allocation procedures cannot be handled directly by means of the solvers like industry-standardized quadratic programing (QP), at least not without appropriate linearization technique applied, which can be computationally very expensive. Thus, if optimization requirements are strict, and problem should be solved for nonlinear objective function with nonlinear equality and inequality constraints, than one should use some appropriate nonlinear optimization technique. The current state-of-the-art in nonlinear optimization for gradient-based algorithms is surely the sequential quadratic programing (SQP), both for general applications and specific thrust allocation problems. On the other hand, in recent time, one can also notice the increased applications of gradient-free optimization methods in various engineering problems. In this context, the implementation of selected derivative free direct search algorithms in optimal thrust allocation is proposed and discussed in this paper, and avenues for future research are provided.
Źródło:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2020, 14, 2; 309-314
2083-6473
2083-6481
Pojawia się w:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Decision support systems in search, rescue and salvage operations at sea
Autorzy:
Małyszko, M.
Wielgosz, M.
Powiązania:
https://bibliotekanauki.pl/articles/135080.pdf
Data publikacji:
2016
Wydawca:
Akademia Morska w Szczecinie. Wydawnictwo AMSz
Tematy:
decision support
search and rescue
salvage operations
environment protection
working procedures
simplified algorithm
Opis:
This article presents the concept of a decision support system for maritime search, rescue and salvage operations. It describes the main ideas for systems in three areas of maritime rescue – search and rescue (saving lives), salvage (saving property at sea), and environment protection operations. It contains an analysis of the factors influencing the decisions of both marine navigators and shore-based centres. The general ideas of the systems are presented in the form of flow charts. An analysis was made of input data, working procedures, and the decisions based on these data and procedures. The simplified algorithm of the system is described. The principles of system utilisation are explained, developmental trends are described, and conclusions are drawn.
Źródło:
Zeszyty Naukowe Akademii Morskiej w Szczecinie; 2016, 45 (117); 191-195
1733-8670
2392-0378
Pojawia się w:
Zeszyty Naukowe Akademii Morskiej w Szczecinie
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Optimization of linear functions on a cyclic permutation. Based on the random search
Autorzy:
Grebennik, I.
Baranov, O.
Chorna, A.
Gorbacheva, E.
Powiązania:
https://bibliotekanauki.pl/articles/411110.pdf
Data publikacji:
2016
Wydawca:
Polska Akademia Nauk. Oddział w Lublinie PAN
Tematy:
combinatorial optimization
linear function
cyclic permutations
random search
branch and bound algorithm
parallel computing
Opis:
For creating adequate mathematical models of combinatorial problems of constructing optimal cyclic routes, mathematical modeling and solving a number of planning and control tasks solutions of optimization problems on the set of cyclic permutations are required. Review of the publications on combinatorial optimization demonstrates that the optimization problem on the cyclic permutations have not been studied sufficiently. This paper is devoted to solving optimization problem of a linear function with linear constraints on the set of cyclic permutations. For solving problems of this class using of known methods, taking into account the properties of a combinatorial set of cyclic permutations, is proposed. For this purpose we propose a method based on the ideology of random search. Heuristic method based on the strategy of the branch and bound algorithm is proposed to solve auxiliary optimization problem of a linear function without constraints on the set of cyclic permutations. Since application of the branch and bound algorithm immediately leads to an exponential growth of the complexity with increasing the dimension of the problem a number of modifications are suggested. Modifications allow reducing computational expenses for solving higher dimension problems. The effectiveness of the proposed improvements is demonstrated by computational experiments.
Źródło:
ECONTECHMOD : An International Quarterly Journal on Economics of Technology and Modelling Processes; 2016, 5, 3; 211-216
2084-5715
Pojawia się w:
ECONTECHMOD : An International Quarterly Journal on Economics of Technology and Modelling Processes
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-50 z 64

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