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ę "Algorithm" wg kryterium: Temat

  Lista filtrów
Wyrównaj
Wyświetlanie 1-15 z 247
Tytuł:
On Some Aspects of Genetic and Evolutionary Methods for Optimization Purposes
Autorzy:
Woźniak, M.
Połap, D.
Powiązania:
https://bibliotekanauki.pl/articles/227353.pdf
Data publikacji:
2015
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
computational intelligence
genetic algorithm
heuristic algorithm
optimization
Opis:
In this paper, the idea of applying some hybrid genetic algorithms with gradient local search and evolutionary optimization techniques is formulated. For two different test functions the proposed versions of the algorithms have been examined. Research results are presented and discussed to show potential efficiency in optimization purposes.
Źródło:
International Journal of Electronics and Telecommunications; 2015, 61, 1; 7-16
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Combinatorial Properties and Defragmentation Algorithms in WSW1 Switching Fabrics
Autorzy:
Rajewski, Remigiusz
Kabaciński, Wojciech
Al-Tameemi, Atyaf
Powiązania:
https://bibliotekanauki.pl/articles/227184.pdf
Data publikacji:
2020
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
elastic optical network
switching networks
rearrenging algorithm
defragmentation algorithm
Opis:
A spectrum defragmentation problem in elastic optical networks was considered under the assumption that all connections can be realized in switching nodes. But this assumption is true only when the switching fabric has appropriate combinatorial properties. In this paper, we consider a defragmentation problem in one architecture of wavelength-space-wavelength switching fabrics. First, we discuss the requirements for this switching fabric, below which defragmentation does not always end with success. Then, we propose defragmentation algorithms and evaluate them by simulation. The results show that proposed algorithms can increase the number of connections realized in the switching fabric and reduce the loss probability.
Źródło:
International Journal of Electronics and Telecommunications; 2020, 66, 1; 99-105
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Performance investigation and element optimization of 2D array transducer using Bat Algorithm
Autorzy:
Tantawy, Dina Mohamed
Eladawy, Mohamed
Hassan, Mohamed Alimaher
Mubarak, Roaa
Powiązania:
https://bibliotekanauki.pl/articles/140685.pdf
Data publikacji:
2020
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
2D ultrasound arrays
Binary Bat Algorithm
Genetic Algorithm
Optimization
Opis:
One of the least expensive and safest diagnostic modalities routinely used is ultrasound imaging. An attractive development in this field is a two-dimensional (2D) matrix probe with three-dimensional (3D) imaging. The main problems to implement this probe come from a large number of elements they need to use. When the number of elements is reduced the side lobes arising from the transducer change along with the grating lobes that are linked to the periodic disposition of the elements. The grating lobes are reduced by placing the elements without any consideration of the grid. In this study, the Binary Bat Algorithm (BBA) is used to optimize the number of active elements in order to lower the side lobe level. The results are compared to other optimization methods to validate the proposed algorithm.
Źródło:
Archives of Electrical Engineering; 2020, 69, 3; 561-579
1427-4221
2300-2506
Pojawia się w:
Archives of Electrical Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Multilevel inverter with optimal THD through the firefly algorithm
Autorzy:
El Mehdi Belkacem, R.
Benzid, R.
Bouguechal, N.
Powiązania:
https://bibliotekanauki.pl/articles/141495.pdf
Data publikacji:
2017
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
firefly algorithm (FFA)
genetic algorithm (GA)
inverter
multilevel
optimized THD
Opis:
Reduction of the Total Harmonic Distortion (THD) in multilevel inverters requires resolution of complex nonlinear transcendental equations; in this paper we propose a combination of one of the best existing optimized hardware structures with the recent firefly algorithm, which was used to optimize the THD, through finding the best switching angles and guaranteeing the minimization of harmonics within a user defined bandwidth. The obtained THD through the simulation of the thirteen-level symmetric inverter has been reduced down to 5% (FFT of 60 harmonics). In order to validate the simulation results, a thirteen-level symmetric inverter prototype has been made, and practically experimented and tested with different loads. Consequently, the measured THD with resistive load was 4.7% on a bandwidth of 3 kHz. The main advantage of the achieved work is the reduction of the THD.
Źródło:
Archives of Electrical Engineering; 2017, 66, 1; 141-154
1427-4221
2300-2506
Pojawia się w:
Archives of Electrical Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Improved Method of Searching the Associative Rules while Developing the Software
Autorzy:
Savchuk, Tamara O.
Pryimak, Natalia V.
Slyusarenko, Nina V.
Smolarz, Andrzej
Smailova, Saule
Amirgaliyev, Yedilkhan
Powiązania:
https://bibliotekanauki.pl/articles/226118.pdf
Data publikacji:
2020
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
software development
classification
C4.5 algorithm
associated rules
FPG-algorithm
Opis:
As the delivery of good quality software in time is a very important part of the software development process, it's a very important task to organize this process very accurately. For this, a new method of the searching associative rules were proposed. It is based on the classification of all tasks on three different groups, depending on their difficulty, and after this, searching associative rules among them, which will help to define the time necessary to perform a specific task by the specific developer.
Źródło:
International Journal of Electronics and Telecommunications; 2020, 66, 3; 425-430
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Is Swarm Intelligence Able to Create Mazes?
Autorzy:
Połap, D.
Woźniak, M.
Napoli, C.
Tramontana, E.
Powiązania:
https://bibliotekanauki.pl/articles/226726.pdf
Data publikacji:
2015
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
computational intelligence
heuristic algorithm
Opis:
In this paper, the idea of applying Computational Intelligence in the process of creation board games, in particular mazes, is presented. For two different algorithms the proposed idea has been examined. The results of the experiments are shown and discussed to present advantages and disadvantages.
Źródło:
International Journal of Electronics and Telecommunications; 2015, 61, 4; 305-310
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Firefly algorithm in optimization of queueing systems
Autorzy:
Kwiecień, J.
Filipowicz, B.
Powiązania:
https://bibliotekanauki.pl/articles/201299.pdf
Data publikacji:
2012
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
queueing systems
firefly algorithm
Opis:
Queueing theory provides methods for analysis of complex service systems in computer systems, communications, transportation networks and manufacturing. It incorporates Markovian systems with exponential service times and a Poisson arrival process. Two queueing systems with losses are also briefly characterized. The article describes firefly algorithm, which is successfully used for optimization of these queueing systems. The results of experiments performed for selected queueing systems have been also presented.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2012, 60, 2; 363-368
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Real-Time Cloud-based Game Management System via Cuckoo Search Algorithm
Autorzy:
Połap, D.
Woźniak, M.
Napoli, C.
Tramontana, E.
Powiązania:
https://bibliotekanauki.pl/articles/226816.pdf
Data publikacji:
2015
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
computational intelligence
heuristic algorithm
Opis:
This paper analyses the idea of applying Swarm Intelligence in the process of managing the entire 2D board game in a real-time environment. For the proposed solution Game Management System is used as a cloud resource with a dedicated intelligent control agent. The described approach has been analysed on the basis of board games like mazes. The model and the control algorithm of the system is described and examined. The results of the experiments are presented and discussed to show possible advantages and isadvantages of the proposed method.
Źródło:
International Journal of Electronics and Telecommunications; 2015, 61, 4; 333-338
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Particle Swarm Optimization Algorithm for Leakage Power Reduction in VLSI Circuits
Autorzy:
Leela Rani, V.
Madhavi Latha, M.
Powiązania:
https://bibliotekanauki.pl/articles/225990.pdf
Data publikacji:
2016
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
leakage power
PSO algorithm
genetic algorithm
minimum leakage vector
Verilog-HDL implementation
Opis:
Leakage power is the dominant source of power dissipation in nanometer technology. As per the International Technology Roadmap for Semiconductors (ITRS) static power dominates dynamic power with the advancement in technology. One of the well-known techniques used for leakage reduction is Input Vector Control (IVC). Due to stacking effect in IVC, it gives less leakage for the Minimum Leakage Vector (MLV) applied at inputs of test circuit. This paper introduces Particle Swarm Optimization (PSO) algorithm to the field of VLSI to find minimum leakage vector. Another optimization algorithm called Genetic algorithm (GA) is also implemented to search MLV and compared with PSO in terms of number of iterations. The proposed approach is validated by simulating few test circuits. Both GA and PSO algorithms are implemented in Verilog HDL and the simulations are carried out using Xilinx 9.2i. From the simulation results it is found that PSO based approach is best in finding MLV compared to Genetic based implementation as PSO technique uses less runtime compared to GA. To the best of the author’s knowledge PSO algorithm is used in IVC technique to optimize power for the first time and it is quite successful in searching MLV.
Źródło:
International Journal of Electronics and Telecommunications; 2016, 62, 2; 179-186
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Controllability-oriented placement of actuators for active noise-vibration control of rectangular plates using a memetic algorithm
Autorzy:
Wrona, S.
Pawełczyk, M.
Powiązania:
https://bibliotekanauki.pl/articles/176577.pdf
Data publikacji:
2013
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
active control
flexible structures
actuators placement
controllability Gramian
evolutionary algorithm
memetic algorithm
Opis:
For successful active control with a vibrating plate it is essential to appropriately place actuators. One of the most important criteria is to make the system controllable, so any control objectives can be achieved. In this paper the controllability-oriented placement of actuators is undertaken. First, a theoretical model of a fully clamped rectangular plate is obtained. Optimization criterion based on maximization of controllability of the system is developed. The memetic algorithm is used to find the optimal solution. Obtained results are compared with those obtained by the evolutionary algorithm. The configuration is also validated experimentally.
Źródło:
Archives of Acoustics; 2013, 38, 4; 529-536
0137-5075
Pojawia się w:
Archives of Acoustics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Heuristic algorithms applied to the problems of servicing actors in supply chains
Autorzy:
Izdebski, M.
Jacyna-Gołda, I.
Markowska, K.
Murawski, J.
Powiązania:
https://bibliotekanauki.pl/articles/224087.pdf
Data publikacji:
2017
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
supply chain
genetic algorithm
ant algorithm
łańcuchy dostaw
algorytm genetyczny
algorytm mrówkowy
Opis:
The paper discusses main decision problems analysed in the subject matter of servicing actors operating in the supply chains, i.e. the vehicle routing problem, vehicles-to-task assignment problem and the problem of entities’ localization in the supply chain. The input data used to describe supply chains is given as well as the basic constraints and the criterion functions used in the development of mathematical models describing the supply chains. Servicing actors in supply chains is the complex decision making problem. Operators in the supply chains are constrained by: production capacity of the suppliers, the demand of the customers in particular working days, storage capacities of warehouses, handling capacities of warehouses, suppliers’ and warehouses’ time windows and other. The efficiency of supply chain is described by cost of transport between operators, costs of passing cargoes through warehouses and delivery time to the recipient. The heuristic algorithms, like genetic and ant algorithms are detailed and used to identify issues related to the operation of actors operating in the supply chains are described. These algorithms are used for solving localization problems in supply chains, vehicle routing problems, and assignment problems. The complexity of presented issues (TSP is known as NP-hard problem) limits the use of precise algorithms and implies the need to use heuristic algorithms. It should be noted that solutions generated by these algorithms for complex decision instances are sub-optimal solutions, but nonetheless it is accepted from the practical point of view.
Źródło:
Archives of Transport; 2017, 44, 4; 25-34
0866-9546
2300-8830
Pojawia się w:
Archives of Transport
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Optimization of electric and magnetic field intensities in proximity of power lines using genetic and particle swarm algorithms
Autorzy:
Król, K.
Machczyński, W.
Powiązania:
https://bibliotekanauki.pl/articles/141588.pdf
Data publikacji:
2018
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
power line
electric field
magnetic field
optimization
genetic algorithm
particle swarm algorithm
Opis:
The paper presents optimization of power line geometrical parameters aimed to reduce the intensity of the electric field and magnetic field intensity under an overhead power line with the use of a genetic algorithm (AG) and particle swarm optimization (PSO). The variation of charge distribution along the conductors as well as the sag of the overhead line and induced currents in earth wires were taken into account. The conductor sag was approximated by a chain curve. The charge simulation method (CSM) and the method of images were used in the simulations of an electric field, while a magnetic field were calculated using the Biot–Savart law. Sample calculations in a three-dimensional system were made for a 220 kV single – circuit power line. A comparison of the used optimization algorithms was made.
Źródło:
Archives of Electrical Engineering; 2018, 67, 4; 829-843
1427-4221
2300-2506
Pojawia się w:
Archives of Electrical Engineering
Dostawca treści:
Biblioteka Nauki
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ł:
Parallel patterns determination in solving cyclic flow shop problem with setups
Autorzy:
Bożejko, W.
Chaczko, Z.
Uchroński, M.
Wodecki, M.
Powiązania:
https://bibliotekanauki.pl/articles/229926.pdf
Data publikacji:
2017
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
cyclic scheduling
parallel algorithm
metaheuristics
Opis:
The subject of this work is the new idea of blocks for the cyclic flow shop problem with setup times, using multiple patterns with different sizes determined for each machine constituting optimal schedule of cities for the traveling salesman problem (TSP). We propose to take advantage of the Intel Xeon Phi parallel computing environment during so-called ’blocks’ determination basing on patterns, in effect significantly improving the quality of obtained results.
Źródło:
Archives of Control Sciences; 2017, 27, 2; 183-195
1230-2384
Pojawia się w:
Archives of Control Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An analysis of Chosen Image Formation Algorithms for Synthetic Aperture Radar with FMCW
Autorzy:
Okoń-Fąfara, M.
Serafin, P.
Kawalec, A.
Powiązania:
https://bibliotekanauki.pl/articles/227061.pdf
Data publikacji:
2016
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
signal processing
synthetic aperture radar
time domain correlation
range-Doppler algorithm
range migration algorithm
Opis:
The modelling of FMCW SAR systems, due to long signal duration time, commonly used start-stop approximation for pulsed radars causes errors in the image. Continuous motion of the radar platform results in additional range-azimuth couplings and range walk term that should be considered in processing of signal from this type of radar. The paper presents an analysis of the following algorithms: Time Domain Correlation (TDC), Range Doppler Algorithm (RDA), and Range Migration Algorithm (RMA). The comparison of the algorithms is based on theoretical estimation of their computation complexity and the quality of images obtained on the basis of real signals of FMCW SAR systems.
Źródło:
International Journal of Electronics and Telecommunications; 2016, 62, 4; 323-328
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 247

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