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-15 z 64
Tytuł:
A metaheuristic for a numerical approximation to the mass transfer problem
Autorzy:
Avendaño-Garrido, M. L.
Gabriel-Argüelles, J. R.
Quintana-Torres, L.
Mezura-Montes, E.
Powiązania:
https://bibliotekanauki.pl/articles/329972.pdf
Data publikacji:
2016
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
Monge–Kantorovich mass transfer problem
finite dimensional linear programming
transport problem
metaheuristic algorithm
scatter search
programowanie skończenie wymiarowe
zadanie transportowe
algorytm metaheurystyczny
Opis:
This work presents an improvement of the approximation scheme for the Monge–Kantorovich (MK) mass transfer problem on compact spaces, which is studied by Gabriel et al. (2010), whose scheme discretizes the MK problem, reduced to solve a sequence of finite transport problems. The improvement presented in this work uses a metaheuristic algorithm inspired by scatter search in order to reduce the dimensionality of each transport problem. The new scheme solves a sequence of linear programming problems similar to the transport ones but with a lower dimension. The proposed metaheuristic is supported by a convergence theorem. Finally, examples with an exact solution are used to illustrate the performance of our proposal.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2016, 26, 4; 757-766
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
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ł:
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ł:
A performance analysis of a hybrid golden section search methodology and a nature-inspired algorithm for MPPT in a solar PV system
Autorzy:
Mostafa, Hazem H.
Ibrahim, Amr M.
Anis, Wagdi R.
Powiązania:
https://bibliotekanauki.pl/articles/141645.pdf
Data publikacji:
2019
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
hybrid optimization
golden sections search
multi-verse optimization algorithm
maximum power point tracking
perturb and observe
photovoltaic (PV)
Opis:
This research presents a comparative study for maximum power point tracking (MPPT) methodologies for a photovoltaic (PV) system. A novel hybrid algorithm golden section search assisted perturb and observe (GSS-PO) is proposed to solve the problems of the conventional PO (CPO). The aim of this new methodology is to boost the efficiency of the CPO. The new algorithm has a very low convergence time and a very high efficiency. GSS-PO is compared with the intelligent nature-inspired multi-verse optimization (MVO) algorithm by a simulation validation. The simulation study reveals that the novel GSS- PO outperforms MVO under uniform irradiance conditions and under a sudden change in irradiance.
Źródło:
Archives of Electrical Engineering; 2019, 68, 3; 611-627
1427-4221
2300-2506
Pojawia się w:
Archives of Electrical Engineering
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ł:
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ł:
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ł:
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ł:
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ł:
Applying Hunger Game Search (HGS) for selecting significant blood indicators for early prediction of ICU COVID-19 severity
Autorzy:
Sayed, Safynaz AbdEl-Fattah
ElKorany, Abeer
Sayed, Sabah
Powiązania:
https://bibliotekanauki.pl/articles/27312915.pdf
Data publikacji:
2023
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
ICU severity prediction
COVID-19
clinical blood tests
Hunger Game search
HGS
optimization algorithm
support vector machine
SVM
feature selection
Opis:
This paper introduces an early prognostic model for attempting to predict the severity of patients for ICU admission and detect the most significant features that affect the prediction process using clinical blood data. The proposed model predicts ICU admission for high-severity patients during the first two hours of hospital admission, which would help assist clinicians in decision-making and enable the efficient use of hospital resources. The Hunger Game search (HGS) meta-heuristic algorithm and a support vector machine (SVM) have been integrated to build the proposed prediction model. Furthermore, these have been used for selecting the most informative features from blood test data. Experiments have shown that using HGS for selecting features with the SVM classifier achieved excellent results as compared with four other meta-heuristic algorithms. The model that used the features that were selected by the HGS algorithm accomplished the topmost results (98.6 and 96.5%) for the best and mean accuracy, respectively, as compared to using all of the features that were selected by other popular optimization algorithms.
Źródło:
Computer Science; 2023, 24 (1); 113--136
1508-2806
2300-7036
Pojawia się w:
Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Automatic parametric fault detection in complex analog systems based on a method of minimum node selection
Autorzy:
Bilski, A.
Wojciechowski, J.
Powiązania:
https://bibliotekanauki.pl/articles/330761.pdf
Data publikacji:
2016
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
complex analog system
support vector machine (SVM)
tabu search
genetic algorithm
parametric fault detection
system analogowy
maszyna wektorów wspierających
metoda tabu search
algorytm genetyczny
detekcja uszkodzeń
Opis:
The aim of this paper is to introduce a strategy to find a minimal set of test nodes for diagnostics of complex analog systems with single parametric faults using the support vector machine (SVM) classifier as a fault locator. The results of diagnostics of a video amplifier and a low-pass filter using tabu search along with genetic algorithms (GAs) as node selectors in conjunction with the SVM fault classifier are presented. General principles of the diagnostic procedure are first introduced, and then the proposed approach is discussed in detail. Diagnostic results confirm the usefulness of the method and its computational requirements. Conclusions on its wider applicability are provided as well.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2016, 26, 3; 655-668
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Automatic search of rational self-equivalences
Autorzy:
Stępień, L.
Stępień, M. R.
Powiązania:
https://bibliotekanauki.pl/articles/950276.pdf
Data publikacji:
2018
Wydawca:
Uniwersytet Humanistyczno-Przyrodniczy im. Jana Długosza w Częstochowie. Wydawnictwo Uczelniane
Tematy:
rational self-equivalences
automorphisms of Witt rings
Witt rings
algebra
algorithm
automatic search
automorfizm
pierścień Witta
algorytm
Opis:
Two Witt rings that are not strongly isomorphic (i.e., two Witt rings over two fields that are not Witt equivalent) have different groups of strong automorphisms. Therefore, the description of a group of strong automorphisms is different for almost every Witt ring, which requires the use various tools in proofs. It is natural idea to use computers to generate strong automorphisms of the Witt rings, which is especially effective in the case of the finitely generated Witt rings, where a complete list of strong automorphisms can be created. In this paper we present the algorithm that was used to generate strong automorphisms from the infinite group of strong automorphisms of the Witt ring of rational numbers W(Q).
Źródło:
Scientific Issues of Jan Długosz University in Częstochowa. Mathematics; 2018, 23; 67-74
2450-9302
Pojawia się w:
Scientific Issues of Jan Długosz University in Częstochowa. Mathematics
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ł
Wyświetlanie 1-15 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