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ę "efficient" wg kryterium: Wszystkie pola

  Lista filtrów
Wyrównaj
Wyświetlanie 1-15 z 33
Tytuł:
The non-symmetric s-step Lanczos algorithm: Derivation of efficient recurrences and synchronization-reducing variants of BiCG and QMR
Autorzy:
Feuerriegel, S.
Bücker, H. M.
Powiązania:
https://bibliotekanauki.pl/articles/331344.pdf
Data publikacji:
2015
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
synchronization reducing
s-step Lanczos
s-step BiCG
s-step QMR
efficient recurrences
Opis:
The Lanczos algorithm is among the most frequently used iterative techniques for computing a few dominant eigenvalues of a large sparse non-symmetric matrix. At the same time, it serves as a building block within biconjugate gradient (BiCG) and quasi-minimal residual (QMR) methods for solving large sparse non-symmetric systems of linear equations. It is well known that, when implemented on distributed-memory computers with a huge number of processes, the synchronization time spent on computing dot products increasingly limits the parallel scalability. Therefore, we propose synchronization-reducing variants of the Lanczos, as well as BiCG and QMR methods, in an attempt to mitigate these negative performance effects. These so-called s-step algorithms are based on grouping dot products for joint execution and replacing time-consuming matrix operations by efficient vector recurrences. The purpose of this paper is to provide a rigorous derivation of the recurrences for the s-step Lanczos algorithm, introduce s-step BiCG and QMR variants, and compare the parallel performance of these new s-step versions with previous algorithms.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2015, 25, 4; 769-785
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Cmac and Its Extensions for Efficient System Modelling
Autorzy:
Szabo, T.
Horvath, G.
Powiązania:
https://bibliotekanauki.pl/articles/908287.pdf
Data publikacji:
1999
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
sieć neuronowa
implementacja sprzętowa
budowle hydrotechniczne
CMAC
neural networks
hardware implementation
Opis:
This paper deals with the family of CMAC neural networks. The most important properties of this family are the extremely fast learning capability and a special architecture that makes effective digital hardware implementation possible. The paper gives an overview of the classical binary CMAC, shows the limitations of its modelling capability, gives a critical survey of its different extensions and suggests two further modifications. The aim of these modifications is to improve the modelling capability while maintaining the possibility of an effective realization. The basic element of the first suggested hardware structure is a new matrix-vector multiplier which is based on a canonical signed digit (CSD) number representation and a distributed arithmetic. In the other version, a hierarchical network structure and a special sequential training method are proposed which can constitute a trade-off between the approximation error and generalization. The proposed versions (among them a dynamic extension of the originally static CMAC) are suitable for embedded applications where the low cost and relatively high speed operation are the most important requirements.
Źródło:
International Journal of Applied Mathematics and Computer Science; 1999, 9, 3; 571-598
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Implementation of Adaptive Generalized Sidelobe Cancellers Using Efficient Complex Valued Arithmetic
Autorzy:
Glentis, G. O.
Powiązania:
https://bibliotekanauki.pl/articles/908084.pdf
Data publikacji:
2003
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
elektronika
adaptive beamforming
generalized sidelobe canceller
LMS algorithm
complex valued arithmetic
Opis:
Low complexity realizations of Least Mean Squared (LMS) error, Generalized Sidelobe Cancellers (GSCs) applied to adaptive beamforming are considered. The GSC method provides a simple way for implementing adaptive Linear Constraint Minimum Variance (LCMV) beamformers. Low complexity realizations of adaptive GSCs are of great importance for the design of high sampling rate, and/or small size and low power adaptive beamforming systems. The LMS algorithm and its Transform Domain (TD-LMS) counterpart are considered for the adaptive processing task involved in the design of optimum GSC systems. Since all input signals are represented by complex variables, complex valued arithmetic is utilized for the realization of GSC algorithms, either on general purpose computers, or on dedicated VLSI ASICs. Using algorithmic strength reduction (SR) techniques, two novel algorithms are developed for efficient realizations of both LMS GSCs and TD-LMS GSC schemes. Both of the proposed algorithms are implemented using real valued arithmetic only, whilst reducing the number of multipliers by 25% and 20%, respectively. When VLSI implementation aspects are considered, both the proposed algorithms result in reduced power dissipation and silicon area realizations. The performance of the proposed realizations of the LMS based GSC methods is illustrated in the context of typical beamforming applications.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2003, 13, 4; 549-566
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A numerical procedure for filtering and efficient high-order signal differentiation
Autorzy:
Ibrir, S.
Diop, S.
Powiązania:
https://bibliotekanauki.pl/articles/907392.pdf
Data publikacji:
2004
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
walidacja krzyżowa
różniczkowanie sygnału
wygładzanie
generalized cross validation
smoothing
differentiation
splines functions
optimization
Opis:
In this paper, we propose a numerical algorithm for filtering and robust signal differentiation. The numerical procedure is based on the solution of a simplified linear optimization problem. A compromise between smoothing and fidelity with respect to the measurable data is achieved by the computation of an optimal regularization parameter that minimizes the Generalized Cross Validation criterion (GCV). Simulation results are given to highlight the effectiveness of the proposed procedure.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2004, 14, 2; 201-208
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Efficient nonlinear predictive control based on structured neural models
Autorzy:
Ławryńczuk, M.
Powiązania:
https://bibliotekanauki.pl/articles/907652.pdf
Data publikacji:
2009
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
sterowanie procesami
sterowanie predykcyjne
sieć neuronowa
optymalizacja
linearyzacja
process control
model predictive control
neuron network
optimisation
linearisation
Opis:
This paper describes structured neural models and a computationally efficient (suboptimal) nonlinear Model Predictive Control (MPC) algorithm based on such models. The structured neural model has the ability to make future predictions of the process without being used recursively. Thanks to the nature of the model, the prediction error is not propagated. This is particularly important in the case of noise and underparameterisation. Structured models have much better long-range prediction accuracy than the corresponding classical Nonlinear Auto Regressive with eXternal input (NARX) models. The described suboptimal MPC algorithm needs solving on-line only a quadratic programming problem. Nevertheless, it gives closed-loop control performance similar to that obtained in fully-fledged nonlinear MPC, which hinges on online nonconvex optimisation. In order to demonstrate the advantages of structured models as well as the accuracy of the suboptimal MPC algorithm, a polymerisation reactor is studied.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2009, 19, 2; 233-246
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Efficient Calculation of the Reed-Muller Form by Means of the Walsh Transform
Autorzy:
Porwik, P.
Powiązania:
https://bibliotekanauki.pl/articles/908505.pdf
Data publikacji:
2002
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
informatyka
Reed-Muller coefficients
Walsh coefficients
coefficient distribution
Boolean function
synthesis of Boolean functions
Opis:
The paper describes a spectral method for combinational logic synthesis using the Walsh transform and the Reed-Muller form. A new algorithm is presented that allows us to obtain the mixed polarity Reed-Muller expansion of Boolean functions. The most popular minimisation (sub-minimisation) criterion of the Reed-Muller form is obtained by the exhaustive search of all the polarity vectors. This paper presents a non-exhaustive method for Reed-Muller expansions. The new method allows us to build the Reed-Muller form based on the analysis of Walsh-Hadamard coefficients. The presented method has much less complexity than the procedures which have been applied until now. Both the transforms and the presented Walsh-Hadamard spectral characterization of the Reed-Muller expansion are compared. An analysis of the properties of the spectra obtained from these transforms is made.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2002, 12, 4; 571-579
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Efficient Numerical Algorithms for Balanced Stochastic Truncation
Autorzy:
Benner, P.
Quintana-Orti, E. S.
Quintana-Orti, G.
Powiązania:
https://bibliotekanauki.pl/articles/908055.pdf
Data publikacji:
2001
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
algorytmy
metoda Newtona
model reduction
stochastic realization
balanced truncation
sign function method
Newton's method
Opis:
We propose an efficient numerical algorithm for relative error model reduction based on balanced stochastic truncation. The method uses full-rank factors of the Gramians to be balanced versus each other and exploits the fact that for large-scale systems these Gramians are often of low numerical rank. We use the easy-to-parallelize sign function method as the major computational tool in determining these full-rank factors and demonstrate the numerical performance of the suggested implementation of balanced stochastic truncation model reduction.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2001, 11, 5; 1123-1150
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An efficient eigenspace updating scheme for high-dimensional systems
Autorzy:
Gangl, S.
Mongus, D.
Žalik, B.
Powiązania:
https://bibliotekanauki.pl/articles/330681.pdf
Data publikacji:
2014
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
eigenspace updating
projection space
data compression
principal component analysis
przestrzeń rzutowa
kompresja danych
analiza składowych głównych
Opis:
Systems based on principal component analysis have developed from exploratory data analysis in the past to current data processing applications which encode and decode vectors of data using a changing projection space (eigenspace). Linear systems, which need to be solved to obtain a constantly updated eigenspace, have increased significantly in their dimensions during this evolution. The basic scheme used for updating the eigenspace, however, has remained basically the same: (re)computing the eigenspace whenever the error exceeds a predefined threshold. In this paper we propose a computationally efficient eigenspace updating scheme, which specifically supports high-dimensional systems from any domain. The key principle is a prior selection of the vectors used to update the eigenspace in combination with an optimized eigenspace computation. The presented theoretical analysis proves the superior reconstruction capability of the introduced scheme, and further provides an estimate of the achievable compression ratios.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2014, 24, 1; 123-131
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
ASA-graphs for efficient data representation and processing
Autorzy:
Horzyk, Adrian
Bulanda, Daniel
Starzyk, Janusz A.
Powiązania:
https://bibliotekanauki.pl/articles/1838165.pdf
Data publikacji:
2020
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
self balancing trees
self sorting trees
self aggregating data structures
associative structures
data access efficiency
representation of relationships
Opis:
Fast discovering of various relationships in data is an important feature of modern data mining, cognitive, knowledge-based, and explainable AI systems, including deep neural networks. The ability to represent a rich set of relationships between stored data and objects is essential for fast inferences, finding associations, representing knowledge, and extracting useful patterns or other pieces of information. This paper introduces self-balancing, aggregating, and sorting ASA-graphs for efficient data representation in various data structures, databases, and data mining systems. These graphs are smaller and use more efficient algorithms for searching, inserting, and removing data than the most commonly used self-balancing trees. ASA-graphs also automatically aggregate and count all duplicates of values and represent them by the same nodes, connecting them in order, and simultaneously providing very fast data access based on a binary search tree approach. The proposed ASA-graph structure combines the advantages of sorted lists, binary search trees, B-trees, and B+trees, eliminating their weaknesses. Our experiments proved that the ASA-graphs outperform many commonly used self-balancing trees.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2020, 30, 4; 717-731
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An active exploration method for data efficient reinforcement learning
Autorzy:
Zhao, Dongfang
Liu, Jiafeng
Wu, Rui
Cheng, Dansong
Tang, Xianglong
Powiązania:
https://bibliotekanauki.pl/articles/331205.pdf
Data publikacji:
2019
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
reinforcement learning
information entropy
PILCO
data efficiency
uczenie ze wzmocnieniem
entropia informacji
wydajność danych
Opis:
Reinforcement learning (RL) constitutes an effective method of controlling dynamic systems without prior knowledge. One of the most important and difficult problems in RL is the improvement of data efficiency. Probabilistic inference for learning control (PILCO) is a state-of-the-art data-efficient framework that uses a Gaussian process to model dynamic systems. However, it only focuses on optimizing cumulative rewards and does not consider the accuracy of a dynamic model, which is an important factor for controller learning. To further improve the data efficiency of PILCO, we propose its active exploration version (AEPILCO) that utilizes information entropy to describe samples. In the policy evaluation stage, we incorporate an information entropy criterion into long-term sample prediction. Through the informative policy evaluation function, our algorithm obtains informative policy parameters in the policy improvement stage. Using the policy parameters in the actual execution produces an informative sample set; this is helpful in learning an accurate dynamic model. Thus, the AEPILCOalgorithm improves data efficiency by learning an accurate dynamic model by actively selecting informative samples based on the information entropy criterion. We demonstrate the validity and efficiency of the proposed algorithm for several challenging controller problems involving a cart pole, a pendubot, a double pendulum, and a cart double pendulum. The AEPILCO algorithm can learn a controller using fewer trials compared to PILCO. This is verified through theoretical analysis and experimental results.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2019, 29, 2; 351-362
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A numerically efficient fuzzy MPC algorithm with fast generation of the control signal
Autorzy:
Marusak, Piotr M.
Powiązania:
https://bibliotekanauki.pl/articles/1838187.pdf
Data publikacji:
2021
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
model predictive control
fuzzy system
fuzzy control
nonlinear control
sterowanie predykcyjne
system rozmyty
sterowanie rozmyte
sterowanie nieliniowe
Opis:
Model predictive control (MPC) algorithms are widely used in practical applications. They are usually formulated as optimization problems. If a model used for prediction is linear (or linearized on-line), then the optimization problem is a standard, i.e., quadratic, one. Otherwise, it is a nonlinear, in general, nonconvex optimization problem. In the latter case, numerical problems may occur during solving this problem, and the time needed to calculate control signals cannot be determined. Therefore, approaches based on linear or linearized models are preferred in practical applications. A novel, fuzzy, numerically efficient MPC algorithm is proposed in the paper. It can offer better performance than the algorithms based on linear models, and very close to that of the algorithms based on nonlinear optimization. Its main advantage is the short time needed to calculate the control value at each sampling instant compared with optimization-based numerical algorithms; it is a combination of analytical and numerical versions of MPC algorithms. The efficiency of the proposed approach is demonstrated using control systems of two nonlinear control plants: the first one is a chemical CSTR reactor with a van de Vusse reaction, and the second one is a pH reactor.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2021, 31, 1; 59-71
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Efficient generation of 3D surfel maps using RGB-D sensors
Autorzy:
Wilkowski, A.
Kornuta, T.
Stefańczyk, M.
Kasprzak, W.
Powiązania:
https://bibliotekanauki.pl/articles/331116.pdf
Data publikacji:
2016
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
RGB-D sensor
V-SLAM
surfel map
frustum culling
octree
czujnik RGB-D
drzewo ósemkowe
Opis:
The article focuses on the problem of building dense 3D occupancy maps using commercial RGB-D sensors and the SLAM approach. In particular, it addresses the problem of 3D map representations, which must be able both to store millions of points and to offer efficient update mechanisms. The proposed solution consists of two such key elements, visual odometry and surfel-based mapping, but it contains substantial improvements: storing the surfel maps in octree form and utilizing a frustum culling-based method to accelerate the map update step. The performed experiments verify the usefulness and efficiency of the developed system.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2016, 26, 1; 99-122
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Optimization on the complementation procedure towards efficient implementation of the index generation function
Autorzy:
Borowik, G.
Powiązania:
https://bibliotekanauki.pl/articles/330597.pdf
Data publikacji:
2018
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
data reduction
feature selection
indiscernibility matrix
logic synthesis
index generation function
redukcja danych
selekcja cech
synteza logiczna
funkcja generowania indeksów
Opis:
In the era of big data, solutions are desired that would be capable of efficient data reduction. This paper presents a summary of research on an algorithm for complementation of a Boolean function which is fundamental for logic synthesis and data mining. Successively, the existing problems and their proposed solutions are examined, including the analysis of current implementations of the algorithm. Then, methods to speed up the computation process and efficient parallel implementation of the algorithm are shown; they include optimization of data representation, recursive decomposition, merging, and removal of redundant data. Besides the discussion of computational complexity, the paper compares the processing times of the proposed solution with those for the well-known analysis and data mining systems. Although the presented idea is focused on searching for all possible solutions, it can be restricted to finding just those of the smallest size. Both approaches are of great application potential, including proving mathematical theorems, logic synthesis, especially index generation functions, or data processing and mining such as feature selection, data discretization, rule generation, etc. The problem considered is NP-hard, and it is easy to point to examples that are not solvable within the expected amount of time. However, the solution allows the barrier of computations to be moved one step further. For example, the unique algorithm can calculate, as the only one at the moment, all minimal sets of features for few standard benchmarks. Unlike many existing methods, the algorithm additionally works with undetermined values. The result of this research is an easily extendable experimental software that is the fastest among the tested solutions and the data mining systems.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2018, 28, 4; 803-815
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Efficient storage, retrieval and analysis of poker hands: An adaptive data framework
Autorzy:
Gorawski, M.
Lorek, M.
Powiązania:
https://bibliotekanauki.pl/articles/330018.pdf
Data publikacji:
2017
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
big data
storage model design
data architecture
data access
path optimization
zbiór danych
architektura danych
udostępnianie danych
optymalizacja obszaru
Opis:
In online gambling, poker hands are one of the most popular and fundamental units of the game state and can be considered objects comprising all the events that pertain to the single hand played. In a situation where tens of millions of poker hands are produced daily and need to be stored and analysed quickly, the use of relational databases no longer provides high scalability and performance stability. The purpose of this paper is to present an efficient way of storing and retrieving poker hands in a big data environment. We propose a new, read-optimised storage model that offers significant data access improvements over traditional database systems as well as the existing Hadoop file formats such as ORC, RCFile or SequenceFile. Through index-oriented partition elimination, our file format allows reducing the number of file splits that needs to be accessed, and improves query response time up to three orders of magnitude in comparison with other approaches. In addition, our file format supports a range of new indexing structures to facilitate fast row retrieval at a split level. Both index types operate independently of the Hive execution context and allow other big data computational frameworks such as MapReduce or Spark to benefit from the optimized data access path to the hand information. Moreover, we present a detailed analysis of our storage model and its supporting index structures, and how they are organised in the overall data framework. We also describe in detail how predicate based expression trees are used to build effective file-level execution plans. Our experimental tests conducted on a production cluster, holding nearly 40 billion hands which span over 4000 partitions, show that multi-way partition pruning outperforms other existing file formats, resulting in faster query execution times and better cluster utilisation.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2017, 27, 4; 713-726
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Iterative methods for efficient sampling-based optimal motion planning of nonlinear systems
Autorzy:
Ha, J. S.
Choi, H. L.
Jeon, J. H.
Powiązania:
https://bibliotekanauki.pl/articles/330028.pdf
Data publikacji:
2018
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
optimal motion planning
sampling based algorithm
nonlinear dynamics
planowanie ruchu
algorytm próbkowania
dynamika nieliniowa
Opis:
This paper extends the RRT* algorithm, a recently developed but widely used sampling based optimal motion planner, in order to effectively handle nonlinear kinodynamic constraints. Nonlinearity in kinodynamic differential constraints often leads to difficulties in choosing an appropriate distance metric and in computing optimized trajectory segments in tree construction. To tackle these two difficulties, this work adopts the affine quadratic regulator-based pseudo-metric as the distance measure and utilizes iterative two-point boundary value problem solvers to compute the optimized segments. The proposed extension then preserves the inherent asymptotic optimality of the RRT* framework, while efficiently handling a variety of kinodynamic constraints. Three numerical case studies validate the applicability of the proposed method.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2018, 28, 1; 155-168
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 33

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