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

  Lista filtrów
Wyrównaj
Wyświetlanie 1-15 z 25
Tytuł:
Adaptive synthesis of a wavelet transform using fast neural network
Autorzy:
Stolarek, J.
Powiązania:
https://bibliotekanauki.pl/articles/202390.pdf
Data publikacji:
2011
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
wavelets
neural networks
filter parametrization
fast algorithms
Opis:
This paper introduces a new method for an adaptive synthesis of a wavelet transform using a fast neural network with a topology based on the lattice structure. The lattice structure and the orthogonal lattice structure are presented and their properties are discussed. A novel method for unsupervised training of the neural network is introduced. The proposed approach is tested by synthesizing new wavelets with an expected energy distribution between low- and high-pass filters. Energy compaction of the proposed method and Daubechies wavelets is compared. Tests are performed using sound and image signals.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2011, 59, 1; 9-13
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The binary algorithm of cascade connection of nonlinear digital filters described in functional series
Autorzy:
Siwczyński, M.
Żaba, S.
Powiązania:
https://bibliotekanauki.pl/articles/199880.pdf
Data publikacji:
2019
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
functional series
operators
cascade connection
binary algorithms
Opis:
The article presents an example of the use of functional series for the analysis of nonlinear systems for discrete time signals. The homogeneous operator is defined and it is decomposed into three component operators: the multiplying operator, the convolution operator and the alignment operator. An important case from a practical point of view is considered – a cascade connection of two polynomial systems. A new, binary algorithm for determining the sequence of complex kernels of cascade from two sequences of kernels of component systems is presented. Due to its simplicity, it can be used during iterative processes in the analysis of nonlinear systems (e.g. feedback systems).
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2019, 67, 5; 963-968
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Portable Raman spectrometer - design rules and applications
Autorzy:
Gnyba, M.
Smulko, J.
Kwiatkowski, A.
Wierzba, P.
Powiązania:
https://bibliotekanauki.pl/articles/200133.pdf
Data publikacji:
2011
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
Raman spectroscopy
chemical detection
lasers
detection algorithms
Opis:
Raman spectroscopy has become more popular due to its new prospective field applications in forensic sciences, war against terrorism, environment protection and other field chemical analysis. Raman spectrometers can be miniaturised to portable devices and their price is decreasing due to development of optoelectronics components. Unfortunately, this technology has still numerous limitations that influence their design and limit the scope of possible applications. The conception and design of the portable Raman spectrometer is described, including discussion of performance and limitations of representative components of such device available on the market. An enhanced portable Raman spectrometer using two lasers, one emitting at 355 nm and the other at 785 nm, and employing advanced signal acquisition and data processing methods is presenented. Advantages of such system are outlined and example measurement results acquired using equivalent hardware are presented. Data processing flow for identification of chemicals is also described.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2011, 59, 3; 325-329
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Evolutionary algorithms for global parametric fault diagnosis in analogue integrated circuits
Autorzy:
Jantos, P.
Grzechca, D.
Rutkowski, J.
Powiązania:
https://bibliotekanauki.pl/articles/201078.pdf
Data publikacji:
2012
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
analogue integrated circuits
fault diagnosis
localization
identification
evolutionary algorithms
Opis:
An evolutionary method for analogue integrated circuits diagnosis is presented in this paper. The method allows for global parametric faults localization at the prototype stage of life of an analogue integrated circuit. The presented method is based on the circuit under test response base and the advanced features classification. A classifier is built with the use of evolutionary algorithms, such as differential evolution and gene expression programming. As the proposed diagnosis method might be applied at the production phase there is a method for shortening the diagnosis time suggested. An evolutionary approach has been verified with the use of several exemplary circuits – an oscillator, a band-pass filter and two operational amplifiers. A comparison of the presented algorithm and two classical methods – the linear classifier and the nearest neighborhood method – proves that the heuristic approach allows for acquiring significantly better results.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2012, 60, 1; 133-142
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Stationary supercapacitor energy storage operation algorithm based on neural network learning system
Autorzy:
Jefimowski, W.
Nikitenko, A.
Drążek, Z.
Wieczorek, M.
Powiązania:
https://bibliotekanauki.pl/articles/200935.pdf
Data publikacji:
2020
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
stationary energy storage
operation algorithms
machine learning
supervised learning
prediction
Opis:
The paper proposes to apply an algorithm for predicting the minimum level of the state of charge (SoC) of stationary supercapacitor energy storage system operating in a DC traction substation, and for changing it over time. This is done to insure maximum energy recovery for trains while braking. The model of a supercapacitor energy storage system, its algorithms of operation and prediction of the minimum state of charge are described in detail; the main formulae, graphs and results of simulation are also provided. It is proposed to divide the SoC curve into equal periods of time during which the minimum states of charge remain constant. To predict the SoC level for the subsequent period, the learning algorithm based on the neural network could be used. Then, the minimum SoC could be based on two basic types of data: the first one is the time profile of the energy storage load during the previous period with the constant minimum SoC retained, while the second one relies on the trains’ locations and speed values in the previous period. It is proved that the use of variable minimum SoC ensures an increase of the energy volume recovered by approximately 10%. Optimum architecture and activation function of the neural network are also found.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2020, 68, 4; 733-738
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
GPU-based tuning of quantum-inspired genetic algorithm for a combinatorial optimization problem
Autorzy:
Nowotniak, R.
Kucharski, J.
Powiązania:
https://bibliotekanauki.pl/articles/201268.pdf
Data publikacji:
2012
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
quantum-inspired genetic algorithm
evolutionary computing
meta-optimization
parallel algorithms
GPGPU
Opis:
This paper concerns efficient parameters tuning (meta-optimization) of a state-of-the-art metaheuristic, Quantum-Inspired Genetic Algorithm (QIGA), in a GPU-based massively parallel computing environment (NVidia CUDATMtechnology). A novel approach to parallel implementation of the algorithm has been presented. In a block of threads, each thread transforms a separate quantum individual or different quantum gene; In each block, a separate experiment with different population is conducted. The computations have been distributed to eight GPU devices, and over 400× speedup has been gained in comparison to Intel Core i7 2.93GHz CPU. This approach allows efficient meta-optimization of the algorithm parameters. Two criteria for the meta-optimization of the rotation angles in quantum genes state space have been considered. Performance comparison has been performed on combinatorial optimization (knapsack problem), and it has been presented that the tuned algorithm is superior to Simple Genetic Algorithm and to original QIGA algorithm.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2012, 60, 2; 323-330
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Guidance impulse algorithms for air bomb control
Autorzy:
Głębocki, R.
Powiązania:
https://bibliotekanauki.pl/articles/201697.pdf
Data publikacji:
2012
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
control
flying objects
control algorithms
air bombs
automatic flight control systems
Opis:
In this paper, some results of research concerning the development of guidance of bombs were presented. The paper presents conceptions of an impulse (gasodynamic) control system, the measurement unit based on IMU/GPS signals and control algorithms based on predicted trajectories. The presented results of simulation research are based on the numerical model of the bomb and real signals from measurement devices.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2012, 60, 4; 825-833
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Multiobjective shape optimization of selected coupled problems by means of evolutionary algorithms
Autorzy:
Długosz, A.
Burczyński, T.
Powiązania:
https://bibliotekanauki.pl/articles/202348.pdf
Data publikacji:
2012
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
multiobjective optimization
evolutionary algorithms
multiphysics
coupled field problems
finite element method
Opis:
In present paper an improved multi-objective evolutionary algorithm is used for Pareto optimization of selected coupled problems. Coupling of mechanical, electrical and thermal fields is considered. Boundary-value problems of the thermo-elasticity, piezoelectricity and electro-thermo-elasticity are solved by means of finite element method (FEM). Ansys Multiphysics and MSC.Mentat/Marc software are used to solve considered coupled problems. Suitable interfaces between optimization tool and the FEM software are created. Different types of functionals are formulated on the basis of results obtained from the coupled field analysis. Functionals depending on the area or volume of the structure are also proposed. Parametric curves NURBS are used to model some optimized structures. Numerical examples for exemplary three-objective optimization are presented in the paper.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2012, 60, 2; 215-222
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Swarm optimization of stiffeners locations in 2-D structures
Autorzy:
Szczepanik, M.
Burczyński, T.
Powiązania:
https://bibliotekanauki.pl/articles/201314.pdf
Data publikacji:
2012
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
swarm algorithms
optimization
finite element method
bars
plane stress
bending plates
shells
Opis:
The paper is devoted to the application of the swarm methods and the finite element method to optimization of the stiffeners location in the 2-D structures (plane stress, bending plates and shells). The structures are optimized for the stress and displacement criteria. The numerical examples demonstrate that the method based on the swarm computation is an effective technique for solving the computer aided optimal design. The additional comparisons of the effectiveness of the particle swarm optimizer (PSO) and evolutionary algorithms (EA) are presented.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2012, 60, 2; 241-246
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Application of evolutionary algorithm to design minimal phase digital filters with non-standard amplitude characteristics and finite bit word length
Autorzy:
Słowik, A.
Powiązania:
https://bibliotekanauki.pl/articles/202324.pdf
Data publikacji:
2011
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
artificial intelligence
evolutionary algorithms
digital filters
minimal phase
finite bits word length
Opis:
In this paper an application of evolutionary algorithm to design minimal phase digital filters with non-standard amplitude characteristics and with finite bit word length is presented. Four digital filters with infinite impulse response were designed using the proposed method. These digital filters possess: linearly falling characteristics, linearly growing characteristics, nonlinearly falling characteristics, and nonlinearly growing characteristics, and they are designed using bit words with an assumed length. This bit word length is connected with a processing register size. This register size depends on hardware possibilities where digital filter is to be implemented. In this paper, a modification of the mutation operator is introduced too. Due to this modification, better results were obtained in relation to the results obtained using the evolutionary algorithm with other mutation operators. The digital filters designed using the proposed method can be directly implemented in the hardware (DSP system) without any additional modifications.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2011, 59, 2; 125-135
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Asymptotic guarantee of success for multi-agent memetic systems
Autorzy:
Byrski, A.
Schaefer, R.
Smołka, M.
Cotta, C.
Powiązania:
https://bibliotekanauki.pl/articles/201942.pdf
Data publikacji:
2013
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
computational multi-agent systems
asymptotic analysis
global optimization
parallel evolutionary algorithms
Markov chain modeling
Opis:
The paper introduces a stochastic model for a class of population-based global optimization meta-heuristics, that generalizes existing models in the following ways. First of all, an individual becomes an active software agent characterized by the constant genotype and the meme that may change during the optimization process. Second, the model embraces the asynchronous processing of agent’s actions. Third, we consider a vast variety of possible actions that include the conventional mixing operations (e.g. mutation, cloning, crossover) as well as migrations among demes and local optimization methods. Despite the fact that the model fits many popular algorithms and strategies (e.g. genetic algorithms with tournament selection) it is mainly devoted to study memetic algorithms. The model is composed of two parts: EMAS architecture (data structures and management strategies) allowing to define the space of states and the framework for stochastic agent actions and the stationary Markov chain described in terms of this architecture. The probability transition function has been obtained and the Markov kernels for sample actions have been computed. The obtained theoretical results are helpful for studying metaheuristics conforming to the EMAS architecture. The designed synchronization allows the safe, coarse-grained parallel implementation and its effective, sub-optimal scheduling in a distributed computer environment. The proved strong ergodicity of the finite state Markov chain results in the asymptotic stochastic guarantee of success, which in turn imposes the liveness of a studied metaheuristic. The Markov chain delivers the sampling measure at an arbitrary step of computations, which allows further asymptotic studies, e.g. on various kinds of the stochastic convergence.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2013, 61, 1; 257-278
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Improved algorithm for periodic steady-state analysis in nonlinear electromagnetic devices
Autorzy:
Sobczyk, T. J.
Radzik, M.
Powiązania:
https://bibliotekanauki.pl/articles/201260.pdf
Data publikacji:
2019
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
electromagnetic devices
steady-state analysis
periodic solutions
analysis in time domain
discrete differential operator
iterative algorithms
Opis:
This paper presents the improved methodology for the direct calculation of steady-state periodic solutions for electromagnetic devices, as described by nonlinear differential equations, in the time domain. A novel differential operator is developed for periodic functions and the iterative algorithm determining periodic steady-state solutions in a selected set of time instants is identified. Its application to steady-state analysis is verified by an elementary example. The modified algorithm reduces the complexity of steady-state analysis, particularly for electromagnetic devices described by high-dimensional nonlinear differential equations.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2019, 67, 5; 863-869
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The digital function filters – algorithms and applications
Autorzy:
Siwczyński, M.
Drwal, A.
Żaba, S.
Powiązania:
https://bibliotekanauki.pl/articles/199949.pdf
Data publikacji:
2013
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
digital function filters
digital irrational filters
analysis and synthesis irrational filters
recursive algorithms of function filters
Opis:
The simple digital filters are not sufficient for digital modeling of systems with distributed parameters. It is necessary to apply more complex digital filters. In this work, a set of filters, called the digital function filters, is proposed. It consists of digital filters, which are obtained from causal and stable filters through some function transformation. In this paper, for several basic functions: exponential, logarithm, square root and the real power of input filter, the recursive algorithms of the digital function filters have been determined The digital function filters of exponential type can be obtained from direct recursive formulas. Whereas, the other function filters, such as the logarithm, the square root and the real power, require using the implicit recursive formulas. Some applications of the digital function filters for the analysis and synthesis of systems with lumped and distributed parameters (a long line, phase shifters, infinite ladder circuits) are given as well.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2013, 61, 2; 371-377
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Control system with a non-parametric predictive algorithm for a high-speed rotating machine with magnetic bearings
Autorzy:
Kurnyta-Mazurek, Paulina
Szolc, Tomasz
Henzel, Maciej
Falkowski, Krzysztof
Powiązania:
https://bibliotekanauki.pl/articles/2086845.pdf
Data publikacji:
2021
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
magnetic bearing
predictive algorithms
high speed rotating machine
łożysko magnetyczne
algorytm predykcyjny
maszyna wirująca dużej prędkości
Opis:
This paper deals with research on the magnetic bearing control systems for a high-speed rotating machine. Theoretical and experimental characteristics of the control systems with the model algorithmic control (MAC) algorithm and the proportional-derivative (PD) algorithm are presented. The MAC algorithm is the non-parametric predictive control method that uses an impulse response model. A laboratory model of the rotor-bearing unit under study consists of two active radial magnetic bearings and one active axial (thrust) magnetic bearing. The control system of the rotor position in air gaps consists of the fast prototyping control unit with a signal processor, the input and output modules, power amplifiers, contactless eddy current sensors and the host PC with dedicated software. Rotor displacement and control current signals were registered during investigations using a data acquisition (DAQ) system. In addition, measurements were performed for various rotor speeds, control algorithms and disturbance signals generated by the control system. Finally, the obtained time histories were presented, analyzed and discussed in this paper.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2021, 69, 6; e138998, 1--9
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Heuristic algorithm to predict the location of C0 separators for efficient isogeometric analysis simulations with direct solvers
Autorzy:
Paszyńska, A.
Jopek, K.
Woźniak, M.
Paszyński, M.
Powiązania:
https://bibliotekanauki.pl/articles/201497.pdf
Data publikacji:
2018
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
refined isogeometric analysis
finite element method
multi-frontal direct solver
heuristic algorithms
analiza izogeometryczna
metoda elementów skończonych
algorytmy heurystyczne
Opis:
We focus on two and three-dimensional isogeometric finite element method computations with tensor product Ck B-spline basis functions. We consider the computational cost of the multi-frontal direct solver algorithm executed over such tensor product grids. We present an algorithm for estimation of the number of floating-point operations per mesh node resulting from the execution of the multi-frontal solver algorithm with the ordering obtained from the element partition trees. Next, we propose an algorithm that introduces C0 separators between patches of elements of a given size based on the stimated number of flops per node. We show that the computational cost of the multi-frontal solver algorithm executed over the computational grids with C0 separators introduced is around one or two orders of magnitude lower, while the approximability of the functional space is improved. We show O(NlogN) computational complexity of the heuristic algorithm proposing the introduction of the C0 separators between the patches of elements, reducing the computational cost of the multi-frontal solver algorithm.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2018, 66, 6; 907-917
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 25

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