Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "methods" wg kryterium: Temat


Tytuł:
On an application of an interval backward finite difference method for solving the one-dimensional heat conduction problem
Autorzy:
Jankowska, M.
Marciniak, A.
Hoffmann, T.
Powiązania:
https://bibliotekanauki.pl/articles/205521.pdf
Data publikacji:
2015
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
interval methods
interval arithmetic
finite difference methods
heat conduction problem
Opis:
The paper concerns the interval method for solving the one-dimensional heat conduction problem. It is based on the conventional backward finite difference scheme with the appropriate local truncation error terms that are also taken into account. For the theoretical formulation of the interval approach we can show that the exact solution is included in the interval one. In practice, there are problems, for which we cannot determine the endpoints of the error term intervals exactly. Nevertheless, if we use the appropriate approximation, related to the endpoints considered, then the numerical experiments confirm that the interval solution includes the exact one.
Źródło:
Control and Cybernetics; 2015, 44, 4; 463-480
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
High-order long-step methods for solving semidefinite linear complementarity problems
Autorzy:
Preiss, M.
Stoer, J.
Powiązania:
https://bibliotekanauki.pl/articles/1839179.pdf
Data publikacji:
2003
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
semidefinite linear complementarity problems
infeasible-interior-point methods
long-step methods
Opis:
The authors studied in Preiss and Stoer (2003) the analyticity properties of infeasible-interior-point paths encountered in the context of semidefinite linear complementarity problems. It will be shown that these results allow for the design of infeasible-interior-point methods of long-step type with an arbitrarily high order of local convergence for solving such problems.
Źródło:
Control and Cybernetics; 2003, 32, 3; 659-670
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Regularized penalty method for non-coercive parabolic optimal control problems
Autorzy:
Kaplan, A.
Tichatschke, R.
Powiązania:
https://bibliotekanauki.pl/articles/205538.pdf
Data publikacji:
1998
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
sterowanie optymalne
distributed control
ill-posed parabolic control problems
penalty methods
proximal point methods
Opis:
The application of a proximal point approach to illposed convex control problems governed by linear parabolic equations is studied. A stable penalty method is constructed by means of multi-step proximal regularization (only w.r.t. the control functions) in the penalized problems. For distributed control problems with state constraints convergence of the approximately determined solutions of the regularized problems to an optimal process is proved.
Źródło:
Control and Cybernetics; 1998, 27, 1; 5-27
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A reliable synthesis of discrete-time Η∞ control. Part I: basic theorems and J-lossless conjugators
Autorzy:
Suchomski, P. J.
Powiązania:
https://bibliotekanauki.pl/articles/969759.pdf
Data publikacji:
2007
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
linear systems
discrete-time systems
Riccati equations
Η∞ methods
lossless systems
perturbation analysis
numerical methods
Opis:
The paper gives a basis for solving many problems of numerically reliable synthesis of sub-optimal discrete-time control in Η∞. The approach is based on J-lossless factorisations of the delta-domain chain-scattering descriptions of continuous-time plants being controlled. Relevant properties of poles and zeros of chain-scattering models are given. Necessary and sufficient conditions for the existence of stabilising J-lossless conjugators are presented and discussed. Some aspects of numerical conditioning of synthesis of such conjugators are considered. A numerical example illustrating synthesis of stabilising right J-lossless conjugators is also included.
Źródło:
Control and Cybernetics; 2007, 36, 1; 97-141
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A method of hybrid MT for related languages
Autorzy:
Homola, P.
Kubon, V.
Powiązania:
https://bibliotekanauki.pl/articles/969803.pdf
Data publikacji:
2010
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
machine translation
related languages
shallow methods
Opis:
The paper introduces a hybrid approach to a very specific field in machine translation - the translation of closely related languages. It mentions previous experiments performed for closely related Scandinavian, Slavic, Turkic and Romanic languages and describes a novel method, a combination of a simple shallow parser of the source language (Czech) combined with a stochastic ranker of (parts of) sentences in the target language (Slovak, Russian, Slovenian). The ranker exploits a simple stochastic model of the target language and its main task is to choose the best translation among those provided by the system. The last section of the paper presents results indicating better translation quality compared to the existing MT system for Czech and Slovak and compares them with the results obtained by the translation from Czech to Russian using the same system.
Źródło:
Control and Cybernetics; 2010, 39, 2; 421-438
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Fundamentals of scatter search and path relinking
Autorzy:
Glover, F.
Laguna, M.
Marti, R.
Powiązania:
https://bibliotekanauki.pl/articles/205907.pdf
Data publikacji:
2000
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
optymalizacja
evolutionary methods
metaheuristics
optimization
tabu search
Opis:
The evolutionary approach called Scatter Search, and its generalized form called Path Relinking, have proved unusually effective for solving a diverse array of optimization problems from both classical and real world settings. Scatter Search and Path Relinking differ from other evolutionary procedures, such as genetic algorithms, by providing unifying principles for joining solutions based on generalized path constructions (in both Euclidean and neighborhood spaces) and by utilizing strategic designs where other approaches resort to randomization. Scatter Search and Path Relinking are also intimately related to the Tabu Search metaheuristic, and derive additional advantages by making use of adaptive memory and associated memory-exploiting mechanisms that are capable of being adapted to particular contexts. We describe the features of Scatter Search and Path Relinking that set them apart from other evolutionary approaches, and that offer opportunities for creating increasingly more versatile and effective methods in the future.
Źródło:
Control and Cybernetics; 2000, 29, 3; 653-684
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Godunov-type algorithms for numerical modeling of solar plasma
Autorzy:
Murawski, K.
Lee, D.
Powiązania:
https://bibliotekanauki.pl/articles/206269.pdf
Data publikacji:
2012
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
computer science
modelling
numerical methods
hyperbolic equations
Opis:
We discuss numerical methods to solve the Cauchy problem for hyperbolic equations, paying attention to equations which describe physical phenomena in fluid dynamics. We concentrate on Godunov-type methods which adopt Riemann solvers. These methods constitute a formidable task due to complexity of hyperbolic equations. Despite this complexity we show that the Godunov-type methods can be successfully applied to simulate complex systems such as described by equations of magnetohydrodynamics. In particular, we simulate thermal mode in a two-dimensional x-point magnetic field topology that is embedded in a gravitationally stratified solar atmosphere.
Źródło:
Control and Cybernetics; 2012, 41, 1; 35-56
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A new concept of an artificial ecosystem algorithm for optimization problems
Autorzy:
Baczynski, D.
Powiązania:
https://bibliotekanauki.pl/articles/205935.pdf
Data publikacji:
2016
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
artificial ecosystem algorithm
optimization
computational intelligence methods
Opis:
This article provides, first, a review of applications of the ecosystem idea in different computational intelligence methods. The article presents the bases of ecosystem operation and a new concept for modelling the phenomena occurring in an ecosystem, with the aim of using these for optimization purposes. The author’s original form of the Artificial Ecosystem Algorithm (AEA) and its constituent parts are presented. The construction of the proposed algorithm was dedicated for continuous optimisation. The operation of the Artificial Ecosystem Algorithm is also compared with an Evolutionary Algorithm and PSO for six test functions for various numbers of variables. Conclusions concerning operation, structure and complexity of AEA are provided at the end.
Źródło:
Control and Cybernetics; 2016, 45, 1; 5-36
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
MPI-GPU/CUDA implementation of TVDLF method for the two-dimensional advection equation
Autorzy:
Murawski, K.
Stpiczyński, P.
Powiązania:
https://bibliotekanauki.pl/articles/206329.pdf
Data publikacji:
2014
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
computer science
modelling
numerical methods
hyperbolic equations
Opis:
We implement Total Variation Diminishing Lax Friedrichs (TVDLF, or Rusanov) method to obtain numerical solutions of the two-dimensional advection equation. Despite the simplicity of this equation, solving it numerically is a formidable task. Based on the use of the original C++ MPI-GPU/CUDA code we present results of numerical tests we performed. These tests show that our code represents well the square wave profiles, leading to up to 60- times faster calculations with the use of MPI than with its serial counter-part.
Źródło:
Control and Cybernetics; 2014, 43, 2; 307-320
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Singular extremals in multi-input time-optimal problems: a sufficient condition
Autorzy:
Chittaro, F. C.
Stefani, G.
Powiązania:
https://bibliotekanauki.pl/articles/970214.pdf
Data publikacji:
2010
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
second variation
singular extremal
sufficient condition
Hamiltonian methods
Opis:
In this paper we study second order sufficient conditions for the strong-local optimality of singular Pontryagin extremals. In particular, we focus on the minimum-time problem for a control-affine system with vector inputs. We use Hamiltonian methods to prove that the coercivity of a suitably-defined second variation - plus an involutivity assumption on the distribution of the controlled fields - is a sufficient condition for the strong optimality of a candidate extremal.
Źródło:
Control and Cybernetics; 2010, 39, 4; 1029-1068
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Empirical justification of the uncertain equivalence method
Autorzy:
Nikolova, N.
Powiązania:
https://bibliotekanauki.pl/articles/969703.pdf
Data publikacji:
2009
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
one-dimensional utility
monotonic preferences
elicitation methods
statistical tests
Opis:
The uncertain equivalence method (UE) is a newly proposed technique for elicitation of 1-D utilities in the case of monotonic preferences. Previous publications argue that the rationale behind the introduction of this technique is that UE estimates are not influenced by certainty effect, UE elicits points that well describe the curvature of the utility function, which is somewhat closer to the true function than the one of the lottery equivalence method (LE), and there is no increase in the width of the elicited UE uncertainty intervals compared to those of the certainty equivalence method (CE). This paper analyzes these assumptions quantitatively on the basis of empirical data from 104 volunteers who constructed their utility functions over monetary prizes using CE, LE and UE. The data was analyzed with the help of four one-tail statistical tests for paired samples. Results showed that: 1) UE results are not influenced by the certainty effect, unlike CE; 2) the UE utility function is more curved than that of LE, but that might be associated with the better selection of approximation nodes and not with the certainty effect; 3) the length of the UE uncertainty intervals is greater than that of the CE intervals, perhaps because of higher complexity of the method, but the increase is only by 30%.
Źródło:
Control and Cybernetics; 2009, 38, 3; 811-834
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Optimal control of partial differential equations with affine control constraints
Autorzy:
Reyes, J. R. de los
Kunisch, K.
Powiązania:
https://bibliotekanauki.pl/articles/1839187.pdf
Data publikacji:
2009
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
optimal control
affine control constraints
semi-smooth Newton methods
Opis:
Numerical solution of PDE optimal control problems involving affine pointwise control constraints is investigated. Optimality conditions are derived and a semi-smooth Newton method is presented. Global and local superlinear convergence of the method are obtained for linear problems. Differently from box constraints, in the case of general affine constraints a proper weighting of the control costs is essential for superlinear convergence of semi-smooth Newton methods. This is also demonstrated numerically by controlling the two-dimensional Stokes equations with different kinds of affine constraints.
Źródło:
Control and Cybernetics; 2009, 38, 4A; 1217-1249
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Selection of prototypes with the EkP system
Autorzy:
Grudziński, K.
Powiązania:
https://bibliotekanauki.pl/articles/969794.pdf
Data publikacji:
2010
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
classification of data
selection of reference vectors
prototype methods
Opis:
A new system for selection of reference instances, which is called the EkP system (Exactly k Prototypes), has been introduced by us recently. In this paper we study suitability of the EkP method for training data reduction on seventeen datasets. As the underlaying classifier the well known IB1 system (1-Nearest Neighbor classifier) has been chosen. We compare generalization ability of our method to performance of IB1 trained on the entire training data and performance of LVQ, Learning Vector Quantization, for which the same number of codebooks has been chosen as the number of prototypes selected by the EkP system. The comparison indicates that even with only a few prototypes which have been chosen by the EkP method on nearly all seventeen datasets statistically indistinguishable results from those given by the IB1 system have been obtained. On many datasets generalization ability of the EkP method has been higher than the one attained with LVQ.
Źródło:
Control and Cybernetics; 2010, 39, 2; 487-503
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A new mathematical model for analytical risk assessment and prediction in IT systems
Autorzy:
Fray, I. E.
Kurkowski, M.
Pejaś, J.
Maćków, W.
Powiązania:
https://bibliotekanauki.pl/articles/206238.pdf
Data publikacji:
2012
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
risk analysis
risk analysis methods
formal model for risk analysis
Opis:
In this paper, we propose a new formal model to describe risk analysis and measurement process for IT systems. Our model complies with international standards and recommendations for non-profit organisations. The model accounts for solutions used in widely known and recommended risk analysis methods and provides for evaluation of efficacy of these solutions. A simple example illustrates the application of the proposed model for effective risk analysis of any IT system.
Źródło:
Control and Cybernetics; 2012, 41, 1; 241-268
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On convergence of the Monotone Structural Evolution
Autorzy:
Korytowski, A.
Szymkat, M.
Powiązania:
https://bibliotekanauki.pl/articles/206572.pdf
Data publikacji:
2016
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
optimal control
direct computational methods
gradient optimization
monotone structural evolution
Opis:
The paper studies convergenceof the Monotone Structural Evolution (MSE), a computational method of optimal control. The principles of MSE are described and an expository example presents the method in action. It is then proved that under appropriate assumptions the method is convergent to the decision space stationarity conditions. Observations on finite convergence and on connections with Pontryagin’s maximum principle are also provided.
Źródło:
Control and Cybernetics; 2016, 45, 4; 483-512
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł

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