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

  Lista filtrów

Dostawca treści

Podbaza

Wyrównaj
Wyświetlanie 1-15 z 91
Tytuł:
Iterative Construction and Optimization of Fuzzy Models
Autorzy:
Golea, N.
Benmahammed, K.
Powiązania:
https://bibliotekanauki.pl/articles/908273.pdf
Data publikacji:
1999
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
aproksymacja rozmyta
optymalizacja iteracyjna
fuzzy approximation
decoupled learning
iterative optimization
Opis:
In this paper, a constructive approach to the fuzzy model selection problem is developed. First, the selection of membership functions is decoupled from parameter calculations using an orthogonalization procedure. Since each membership function depends only on its own parameters, the selection of rules is performed in a sequential manner. At each learning step, a new membership function is created and its parameters are optimized. The resulting parameter calculation boils down to the solution of a triangular system. This approach reduces significantly the computational complexity, and allows for the derivation of a simple optimization algorithm. In addition, optimization of the membership functions is related to the approximation accuracy. Simulation results, when compared with the orthogonal least-squares algorithm, show that this approach is less sensitive to the size of the training data and converges rapidly.
Źródło:
International Journal of Applied Mathematics and Computer Science; 1999, 9, 4; 899-919
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Random approximations in multiobjective programming - with an application to portfolio optimization with shortfall constraints
Autorzy:
Vogel, S.
Powiązania:
https://bibliotekanauki.pl/articles/205947.pdf
Data publikacji:
1999
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
aproksymacja stochastyczna
optymalizacja
prawdopodobieństwo
programowanie matematyczne
stabilność
estimated quantities
Markowitz model
multiobjective progranming
portfolio
probabilistic constraints
stability
Opis:
Decision makers often heave to deal with a programming problem vhere some of the quantities are unknown. They will usually estimate these quantities and solve the problem as it then appears - the "approximate problem". Thus, there is a need to establish conditions which will ensure that the solutions to the approximate problem will come close to the solutions to the true problem in a suitable manner. The paper summarizes such results for multiobjective programming problems. The results ase illustrated by means of the Markowitz model of portfolio optimization. In order to show how probabilistic constraints may be dealt with using this framework, a shortfall constraint is taken into account.
Źródło:
Control and Cybernetics; 1999, 28, 4; 703-724
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Stochastic Neural Networks for Feasibility Checking
Autorzy:
Strausz, G.
Powiązania:
https://bibliotekanauki.pl/articles/908272.pdf
Data publikacji:
1999
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
optymalizacja
sieć neuronowa
aproksymacja
optimization
neural networks
simulated annealing
mean-field approximation
Opis:
Complex diagnosis problems, defined by high-level models, often lead to constraint-based discrete optimization tasks. A logical description of large, complex systems usually contains numerous variables. The first test of the logical description is typically to check the feasibility in order to know that there is no contradiction in the model. This can be formulated as an optimization problem and methods of discrete optimization theory can then be used. The purpose of the paper is to show that stochastic neural networks can be applied to this type of tasks and the networks are efficient tools for finding feasible or good-quality configurations. Boltzmann and mean-field neural networks were tested on large-sized complex problems.The paper presents simulation results obtained from a real application task and compares the performance of the neural networks being examined.
Źródło:
International Journal of Applied Mathematics and Computer Science; 1999, 9, 4; 921-937
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Kinematic Approximation of Robotic Manipulators
Autorzy:
Dulęba, I.
Powiązania:
https://bibliotekanauki.pl/articles/911220.pdf
Data publikacji:
2000
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
manipulator
kinematyka
aproksymacja
kinematics
approximation
metrics
ULB robot
Opis:
A kinematic approximation of the nominal, reference kinematics of a manipulator is addressed. The approximation task leads to a minimax optimization problem. Some modifications facilitating the implementation of the algorithm in search spaces of high dimensionalities are presented. A sub-gradient mesh algorithm of solving the minimax task is given in detail. The approximation of the CYBOTECH manipulator with a ULB robot is provided based on the use of the Chebyshev metric. As an alternative, some measures of proximity of manipulators are also introduced.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2000, 10, 3; 605-622
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Similarity-based methods : a general framework for classification, approximation and association
Autorzy:
Duch, W.
Powiązania:
https://bibliotekanauki.pl/articles/206007.pdf
Data publikacji:
2000
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
aproksymacja
klasyfikacja
optymalizacja
pamięć asocjacyjna
approximation
associative memory
classification
feature selection
kNN
optimization
similarity-based methods
Opis:
Similarity-based methods (SBM) are a generalization of the minimal distance (MD) methods which form a basis of several machine learning and pattern recognition methods. Investigation of similarity leads to a fruitful framework in which many classification, approximation and association methods are accommodated. Probability p(C|X; M) of assigning class C to a vector X, given a classification model M, depends on adaptive parameters and procedures used in construction of the model. Systematic overview of choices available for model building is presented and numerous improvements suggested. Similarity-Based Methods have natural neural-network type realizations. Such neural network models as the Radial Basis Functions (RBF) and the Multilayer Perceptrons (MLPs) are included in this framework as special cases. SBM may also include several different submodels and a procedure to combine their results. Many new versions of similarity-based methods are derived from this framework. A search in the space of all methods belonging to the SBM framework finds a particular combination of parameterizations and procedures that is most appropriate for a given data. No single classification method can beat this approach. Preliminary implementation of SBM elements tested on a real-world datasets gave very good results.
Źródło:
Control and Cybernetics; 2000, 29, 4; 937-967
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Approximation of Large-Scale Dynamical Systems: an Overview
Autorzy:
Antoulas, A. C.
Sorensen, D. C.
Powiązania:
https://bibliotekanauki.pl/articles/908058.pdf
Data publikacji:
2001
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
aproksymacja
system dynamiczny
model reduction
SVD
Hankel
balancing
Krylov
Opis:
In this paper we review the state of affairs in the area of approximation of large-scale systems. We distinguish three basic categories, namely the {SVD}-based, the {Krylov}-based and the {SVD-Krylov}-based approximation methods. The first two were developed independently of each other and have distinct sets of attributes and drawbacks. The third approach seeks to combine the best attributes of the first two.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2001, 11, 5; 1093-1121
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On uniformly approximate convex and strongly alpha(.)-paraconvex functions
Autorzy:
Rolewicz, S.
Powiązania:
https://bibliotekanauki.pl/articles/205953.pdf
Data publikacji:
2001
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
aproksymacja funkcji wypukłych i parawypukłych
różniczkowalność Frecheta
approximate convex and paraconvex functions
Frechet differentiability
Opis:
In the paper the equivalence of the notions of uniformly approximate convex functions and strongly alpha(.)-paraconvex functions will be presented. As a consequence we obtain that uniformly approximate convex functions are Frechet differentiable on residual sets.
Źródło:
Control and Cybernetics; 2001, 30, 3; 323-330
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Error estimates for the finite-element approximation of a semilinear elliptic control problem
Autorzy:
Casas, E.
Troeltzsch, F.
Powiązania:
https://bibliotekanauki.pl/articles/206743.pdf
Data publikacji:
2002
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
aproksymacja numeryczna
metoda elementu skończonego
równanie eliptyczne półliniowe
sterowanie rozproszone
distributed control
error estimates
finite element method
numerical approximation
semilinear elliptic equation
Opis:
We consider the finite-element approximation of a distributed optimal control problem governed by a semilinear elliptic partial differential equation, where pointwise constraints on the control are given. We prove the existence of local approximate solutions converging to a given local reference solution. Moreover, we derive error estimates for local solutions in the maximum norm.
Źródło:
Control and Cybernetics; 2002, 31, 3; 695-712
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Neuro-fuzzy TSK network for approximation of static and dynamic functions
Autorzy:
Linh, T.
Osowski, S.
Powiązania:
https://bibliotekanauki.pl/articles/205951.pdf
Data publikacji:
2002
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
algorytm uczenia się
aproksymacja
sieć neuronowo-rozmyta
approximation
learning algorithms
neuro-fuzzy networks
Opis:
The paper presents the neuro-fuzzy network in application to the approximation of the static and dynamic functions. The network implements the Takagi-Sugeno inference rules. The learning algorithm is based on the hybrid approach, splitting the learning phase into two stages : the adaptation of the linear output weights using the SVD algorithm and the conventional steepest descent backpropagation rule in application to the adaptation of the nonlinear parameters of the membership functions. The new approach to the generation of the inference rules, based on the fuzzy self-organization is proposed and the algorithm of automatic determination of the number of these rules has been also implemented. The method has been applied for the off-line modelling of static nonlinear relations and on-line simulation of the dynamic systems.
Źródło:
Control and Cybernetics; 2002, 31, 2; 309-326
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Optimal control of constrained delay-differential inclusions with multivalued initial conditions
Autorzy:
Mordukhovich, B. S.
Wang, L.
Powiązania:
https://bibliotekanauki.pl/articles/970519.pdf
Data publikacji:
2003
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
aproksymacja dyskretna
warunek konieczny optymalności
analiza wariacyjna
stabilność
optymalizacja niegładka
różniczkowanie uogólnione
delay-differential inclusions
discrete approximations
necessary optimality conditions
variational analysis
stability
nonsmooth optimization
generalized differentiation
Opis:
This paper studies a general optimal control problem for nonconvex delay-differential inclusions with endpoint constraints. In contrast to previous publications on this topic, we incorporate time-dependent set constraints on the initial interval, which are specific for systems with delays and provide an additional source for optimization. Our variational analysis is based on well-posed discrete approximations of constrained delay-differential inclusions by a family of time-delayed systems with discrete dynamics and perturbed constraints. Using convergence results for discrete approximations and advanced tools of nonsmooth variational analysis, we derive necessary optimality conditions for constrained delay-differential inclusions in both Euler-Lagrange and Hamiltonian forms involving nonconvex generalized differential constructions for nonsmooth functions, sets, and set-valued mappings.
Źródło:
Control and Cybernetics; 2003, 32, 3; 585-609
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Error analysis of discrete approximations to bang-bang optimal control problems: the linear case
Autorzy:
Veliov, V. M.
Powiązania:
https://bibliotekanauki.pl/articles/970563.pdf
Data publikacji:
2005
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
liniowy system sterowania
aproksymacja dyskretna
szacowanie błędów
linear control systems
discrete approximations
error estimates
Opis:
The paper presents an error estimate for Runge-Kutta direct discretizations of terminal optimal control problems for linear systems. The optimal control for such problems is typically discontinuous, and Lipschitz stability of the solution with respect to perturbations does not necessarily hold. The estimate (in terms of the optimal controls) is of first order if certain recently obtained sufficient conditions for structural stability hold, and of fractional order, otherwise. The main tool in the proof is the established relation between the local convexity index of the reachable set and the multiplicity of zeros of appropriate switching functions associated with the problem.
Źródło:
Control and Cybernetics; 2005, 34, 3; 967-982
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Finite horizon nonlinear predictive control by the Taylor approximation: Application to robot tracking trajectory
Autorzy:
Hedjar, R.
Toumi, R.
Boucher, P.
Dumur, D.
Powiązania:
https://bibliotekanauki.pl/articles/908454.pdf
Data publikacji:
2005
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
układ nieliniowy
układ ciągły
sterowanie predykcyjne
aproksymacja Taylora
śledzenie trajektorii
nonlinear continuous time predictive control
Taylor approximation
tracking trajectory and robot
Opis:
In industrial control systems, practical interest is driven by the fact that today’s processes need to be operated under tighter performance specifications. Often these demands can only be met when process nonlinearities are explicitly considered in the controller. Nonlinear predictive control, the extension of well-established linear predictive control to nonlinear systems, appears to be a well-suited approach for this kind of problems. In this paper, an optimal nonlinear predictive control structure, which provides asymptotic tracking of smooth reference trajectories, is presented. The controller is based on a finite–horizon continuous time minimization of nonlinear predicted tracking errors. A key feature of the control law is that its implementation does not need to perform on-line optimization, and asymptotic tracking of smooth reference signal is guaranteed. An integral action is used to increase the robustness of the closed-loop system with respect to uncertainties and parameters variations. The proposed control scheme is first applied to planning motions problem of a mobile robot and, afterwards, to the trajectory tracking problem of a rigid link manipulator. Simulation results are performed to validate the tracking performance of the proposed controller.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2005, 15, 4; 527-540
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Optimal control of semilinear evolution inclusions via discrete approximations
Autorzy:
Mordukhovich, B. S.
Wang, D.
Powiązania:
https://bibliotekanauki.pl/articles/1839178.pdf
Data publikacji:
2005
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
sterowanie optymalne
analiza wariacyjna
różniczkowanie uogólnione
aproksymacja dyskretna
warunek konieczny optymalności
optimal control
variational analysis
generalized differentiation
semilinear evolution inclusions
discrete approximations
necessary optimality conditions
Opis:
This paper studies a Mayer type optimal control problem with general endpoint constraints for semilinear unbounded evolution inclusions in reflexive and separable Banach spaces. First, we construct a sequence of discrete approximations to the original optimal control problem for evolution inclusions and prove that optimal solutions to discrete approximation problems uniformly converge to a given optimal solution for the original continuous-time problem. Then, based on advanced tools of generalized differentiation, we derive necessary optimality conditions for discrete-time problems under fairly general assumptions. Combining these results with recent achievements of variational analysis in infinite-dimensional spaces, we establish new necessary optimality conditions for constrained continuous-time evolution inclusions by passing to the limit from discrete approximations.
Źródło:
Control and Cybernetics; 2005, 34, 3; 849-870
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Approximation of pitching motion of S-175 containership in irregular waves on the basis of ships service parameters
Autorzy:
Cepowski, T.
Powiązania:
https://bibliotekanauki.pl/articles/259629.pdf
Data publikacji:
2006
Wydawca:
Politechnika Gdańska. Wydział Inżynierii Mechanicznej i Okrętownictwa
Tematy:
aproksymacja
właściwości morskie
kiwania
parametry ruchu statków
sztuczne sieci neuronowe
fale nieregularne
seakeeping qualities
pitching
artificial neural networks
approximation
ship service parameters
irregular waves
Opis:
This paper presents approximations of pitching motion of S-175 containership in irregular waves within the full range of ship's service parameters. It continues the research described in [1] dealing with application of artificial neural networks to predict ship's motions. Reference pitch values were calculated by means of SEAWAY software based on accurate numerical methods. Approximating function was elaborated by using the artificial neural networks.
Źródło:
Polish Maritime Research; 2006, 1; 22-25
1233-2585
Pojawia się w:
Polish Maritime Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Continuous and smooth minimax spline-approximation of sensor temperature characteristic and its sensitivity
Ciągła i gładka aproksymacja minimaksowa funkcjami sklejanymi charakterystyki czujnika temperatury
Autorzy:
Andrunyk, V.
Malachivskyy, P.
Pizyur, Y.
Yatsuk, V.
Powiązania:
https://bibliotekanauki.pl/articles/155206.pdf
Data publikacji:
2007
Wydawca:
Stowarzyszenie Inżynierów i Techników Mechaników Polskich
Tematy:
spline approximation
minimax Chebyshev polynom
aproksymacja funkcjami sklejanymi
Opis:
The problem under consideration is the construction of continuous and smooth spline-approximation whose any link is polynomial approximation according to a minimax criterion. The algorithm of such a spline-approximation with a priory given error is proposed. The practical sample of its application for the description of a temperature characteristic and sensitivity of cryogen thermodiode sensor is described.
Zbadano własności ciągłej i zarazem gładkiej aproksymacji funkcjami sklejanymi, w których wszystkie ogniwa są wielomianami. Zaproponowano algorytm konstrukcji takiego przybliżenia realizującego aproksymację z założoną dokładnością. Algorytm ten zastosowano do przybliżenia charakterystyki temperaturowej czujnika diodowego pracującego w obszarze temperatur kriogenicznych.
Źródło:
Pomiary Automatyka Kontrola; 2007, R. 53, nr 9 bis, 9 bis; 617-620
0032-4140
Pojawia się w:
Pomiary Automatyka Kontrola
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 91

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