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

  Lista filtrów

Dostawca treści

Wyrównaj
Wyświetlanie 1-15 z 17
Tytuł:
A counterexample to the $L^{p}$-Hodge decomposition
Autorzy:
Hajłasz, Piotr
Powiązania:
https://bibliotekanauki.pl/articles/1359021.pdf
Data publikacji:
1996
Wydawca:
Polska Akademia Nauk. Instytut Matematyczny PAN
Tematy:
nonuniqueness
Dirichlet problem
Laplace equation
Hodge decomposition
Opis:
We construct a bounded domain $Ω ⊂ ℝ^2$ with the cone property and a harmonic function on Ω which belongs to $W_0^{1,p}(Ω)$ for all 1 ≤ p < 4/3. As a corollary we deduce that there is no $L^p$-Hodge decomposition in $L^{p}(Ω,ℝ^2)$ for all p > 4 and that the Dirichlet problem for the Laplace equation cannot be in general solved with the boundary data in $W^{1,p}(Ω)$ for all p > 4.
Źródło:
Banach Center Publications; 1996, 33, 1; 79-83
0137-6934
Pojawia się w:
Banach Center Publications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Convergence of Tolands critical points for sequences of D.C. functions and application to the resolution of semilinear elliptic problems
Autorzy:
Yassine, A.
Alaa, N.
Elhilali Alaoui, A.
Powiązania:
https://bibliotekanauki.pl/articles/206580.pdf
Data publikacji:
2001
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
algorytm proksymalny
funkcje D.C.
optymalizacja niewypukła
punkt krytyczny Tolanda
semiliniowe zagadnienie eliptyczne
dc functions
non-convex optimization
normalized D.C. decomposition
proximal algorithm
semilinear elliptic problem
Toland's critical point
Opis:
We prove that if a sequence (fn)n of D.C. functions (Difference of two Convex functions) converges to a D.C. function f in some appropriate way and if un is a critical point of fn, in the sense described by Toland, and is such that (un)n converges to u, then a is a critical point of f, still in Toland's sense. We also build a new algorithm which searches for this critical point u and then apply it in order to compute the solution of a semilinear elliptic equation.
Źródło:
Control and Cybernetics; 2001, 30, 4; 405-417
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A note on minimax rates of convergence in the Spektor-Lord-Willis problem
Autorzy:
Szkutnik, Z.
Powiązania:
https://bibliotekanauki.pl/articles/254773.pdf
Data publikacji:
2010
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
poisson inverse problem
rate minimaxity
singular value decomposition
stereology
Opis:
In this note, attainable lower bounds are constructed for the convergence rates in a stereological problem of unfolding spheres size distribution from linear sections, which shows that a spectral type estimator is strictly rate minimax over some Sobolev-type classes of functions.
Źródło:
Opuscula Mathematica; 2010, 30, 2; 203-207
1232-9274
2300-6919
Pojawia się w:
Opuscula Mathematica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A window based method to reduce the end-effect in Empirical Mode Decomposition
Autorzy:
Cotogno, M.
Cocconcelli, M.
Rubini, R.
Powiązania:
https://bibliotekanauki.pl/articles/328237.pdf
Data publikacji:
2013
Wydawca:
Polska Akademia Nauk. Polskie Towarzystwo Diagnostyki Technicznej PAN
Tematy:
empirical mode decomposition
intrinsic mode function
end-effect problem
windowing
Opis:
Empirical Mode Decomposition technique (EMD) is a recent development in non-stationary and non-linear data analysis. It is an algorithm which adaptively decomposes the signal in the sum of Intrinsic Mode Functions (IMFs) from which the instantaneous frequency can be easily computed. EMD has proven its effectiveness but is still affected from various problems. One of these is the “end-effect”, a phenomenon occurring at the start and at the end of the data due to the splines fitting on which the EMD is based. Various techniques have been tried to overcome the end-effect, like different data extension or mirroring procedures at the data boundary. In this paper we made use of the IMFs orthogonality property to apply a symmetrical window to the data before EMD for end-effect reduction. Subsequently the IMFs are post-processed to compensate for data alteration due to windowing. The simulations show that IMFs obtained with this method are of better quality near the data boundaries while remaining almost identical to classical EMD ones.
Źródło:
Diagnostyka; 2013, 14, 1; 3-10
1641-6414
2449-5220
Pojawia się w:
Diagnostyka
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Wavelet approximation of Adomian’s decomposition applied to the nonlinear problem of a double-beam response subject to a series of moving loads
Autorzy:
Koziol, P
Powiązania:
https://bibliotekanauki.pl/articles/279493.pdf
Data publikacji:
2014
Wydawca:
Polskie Towarzystwo Mechaniki Teoretycznej i Stosowanej
Tematy:
infinite double-beam
nonlinear problem
Adomian’s decomposition
coiflet approximation
moving load
Opis:
The dynamic response of a double-beam resting on a nonlinear viscoelastic foundation and subjected to a finite series of moving loads is analysed. The beams are connected by a viscoelastic layer and the load moving along the upper beam represents motion of a train on the rail track. The mathematical model is described by a coupled system of fourth order partial differential equations with homogeneous boundary conditions. The nonlinearity is included in the foundation stiffness of medium supporting a lower beam. The coiflet based approximation combined with Adomian’s decomposition is adopted for the displacements derivation. The developed approach allows one to overcome difficulties related to direct calculation of Fourier integrals as well as the small parameter method. The conditions for correctness of the approximate solution are defined. The influence of some factors on the system sensitivity is discussed, with special focus on the distance between the separated loads. Numerical examples are presented for a certain system of physical parameters.
Źródło:
Journal of Theoretical and Applied Mechanics; 2014, 52, 3; 687-697
1429-2955
Pojawia się w:
Journal of Theoretical and Applied Mechanics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Nonlinear solution to a non-Fourier heat conduction problem in a slab heated by laser source
Nieliniowe rozwiązanie problemu niefourierowskiego przewodzenia ciepła w płycie nagrzewanej źródłem laserowym
Autorzy:
Noroozi, M. J.
Saedodin, S.
Ganji, D. D.
Powiązania:
https://bibliotekanauki.pl/articles/950685.pdf
Data publikacji:
2016
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
non-Fourier heat conduction problem
nonlinear analysis
C-V model
Adomian Decomposition Method ADM
laser heating
problem niefourierowski przewodzenia ciepła
analiza nieliniowa
model C-V
metoda dekompozycji Adomiana ADM
nagrzewanie laserowe
Opis:
The effect of laser, as a heat source, on a one-dimensional finite body was studied in this paper. The Cattaneo-Vernotte non-Fourier heat conduction model was used for thermal analysis. The thermal conductivity was assumed temperature-dependent which resulted in a non-linear equation. The obtained equations were solved using the approximate-analytical Adomian Decomposition Method (ADM). It was concluded that the non-linear analysis is important in non-Fourier heat conduction problems. Significant differences were observed between the Fourier and non-Fourier solutions which stresses the importance of non-Fourier solutions in the similar problems.
W artykule badano działanie laserowego źródła ciepła na ciało jednowymiarowe o skończonych wymiarach. Do analizy rozkładu temperatury zastosowano niefourierowski model przewodnictwa ciepła Cattaneo-Vernotte. Założono, że przewodność cieplna jest zależna od temperatury, w wyniku czego otrzymano równania nieliniowe. Do rozwiązania równań zastosowano przybliżoną analityczną metodę dekompozycji Adomiana (ADM). Stwierdzono, że analiza nieliniowa ma istotne znaczenie w problemach przewodnictwa ciepła typu niefourierowskiego. Zaobserwowano istotne różnice między rozwiązaniami fourierowskimi i niefourierowskimi, co podkreśla celowość stosowania tych ostatnich w podobnych problemach.
Źródło:
Archive of Mechanical Engineering; 2016, LXIII, 1; 129-144
0004-0738
Pojawia się w:
Archive of Mechanical Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Using the one-versus-rest strategy with samples balancing to improve pairwise coupling classification
Autorzy:
Chmielnicki, W.
Stąpor, K.
Powiązania:
https://bibliotekanauki.pl/articles/330749.pdf
Data publikacji:
2016
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
multiclass classification
pairwise coupling
problem decomposition
support vector machine (SVM)
klasyfikacja wieloklasowa
rozkład problemu
maszyna wektorów wspierających
Opis:
The simplest classification task is to divide a set of objects into two classes, but most of the problems we find in real life applications are multi-class. There are many methods of decomposing such a task into a set of smaller classification problems involving two classes only. Among the methods, pairwise coupling proposed by Hastie and Tibshirani (1998) is one of the best known. Its principle is to separate each pair of classes ignoring the remaining ones. Then all objects are tested against these classifiers and a voting scheme is applied using pairwise class probability estimates in a joint probability estimate for all classes. A closer look at the pairwise strategy shows the problem which impacts the final result. Each binary classifier votes for each object even if it does not belong to one of the two classes which it is trained on. This problem is addressed in our strategy. We propose to use additional classifiers to select the objects which will be considered by the pairwise classifiers. A similar solution was proposed by Moreira and Mayoraz (1998), but they use classifiers which are biased according to imbalance in the number of samples representing classes.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2016, 26, 1; 191-201
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Złożoność sytuacji problemowych – wybrane zagadnienia
Complexity of the problem situations
Autorzy:
Zoleński, W.
Powiązania:
https://bibliotekanauki.pl/articles/323334.pdf
Data publikacji:
2016
Wydawca:
Politechnika Śląska. Wydawnictwo Politechniki Śląskiej
Tematy:
sytuacja problemowa
dekompozycja złożoności
problem situations
decomposition of complexity
Opis:
Złożoność sytuacji problemowych jest ważnym powodem trudności występujących w procesie rozwiązywania problemów. W artykule przedstawiono wybrane zagadnienia dekompozycji złożoności. W szczególności dokonano typologii sytuacji problemowych oraz opisano możliwość zastosowania metod teorii systemów.
Complexity of the problem is an important reason for the difficulties in the process of solving problems. The article presents selected issues decomposition of complexity. In particular, they made a typology of problem situations and describes the possibility of using methods of systems theory.
Źródło:
Zeszyty Naukowe. Organizacja i Zarządzanie / Politechnika Śląska; 2016, 89; 593-603
1641-3466
Pojawia się w:
Zeszyty Naukowe. Organizacja i Zarządzanie / Politechnika Śląska
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A new numerical technique for solving fractional Bratu’s initial value problems in the Caputo and Caputo-Fabrizio sense
Autorzy:
Khalouta, Ali
Kadem, Abdelouahab
Powiązania:
https://bibliotekanauki.pl/articles/1839797.pdf
Data publikacji:
2020
Wydawca:
Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
Tematy:
fractional Bratu’s initial value problem
Caputo fractional derivative
Caputo-Fabrizio fractional derivative
natural transform method
Adomian decomposition method
ułamkowa pochodna Caputo
ułamkowa pochodna Caputo-Fabrizio
metoda transformacji naturalnej
metoda dekompozycji Adomiana
Opis:
The purpose of this paper is to propose a new numerical technique called the natural decomposition method (NDM) for solving fractional Bratu’s initial value problems (FBIVP) in the Caputo and Caputo-Fabrizio sense. The NDM is a combined form of the natural transform method and the Adomian decomposition method. The numerical example is provided in order to validate the efficiency and reliability of the proposed method. The obtained results reveal that the proposed method is a very efficient and simple tool for solving fractional differential equations.
Źródło:
Journal of Applied Mathematics and Computational Mechanics; 2020, 19, 1; 43-56
2299-9965
Pojawia się w:
Journal of Applied Mathematics and Computational Mechanics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A new numerical technique for solving fractional Bratu’s initial value problems in the Caputo and Caputo-Fabrizio sense
Autorzy:
Khalouta, Ali
Kadem, Abdelouahab
Powiązania:
https://bibliotekanauki.pl/articles/122619.pdf
Data publikacji:
2020
Wydawca:
Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
Tematy:
fractional Bratu’s initial value problem
Caputo fractional derivative
Caputo-Fabrizio fractional derivative
natural transform method
Adomian decomposition method
ułamkowa pochodna Caputo
ułamkowa pochodna Caputo-Fabrizio
metoda transformacji naturalnej
metoda dekompozycji Adomiana
Opis:
The purpose of this paper is to propose a new numerical technique called the natural decomposition method (NDM) for solving fractional Bratu’s initial value problems (FBIVP) in the Caputo and Caputo-Fabrizio sense. The NDM is a combined form of the natural transform method and the Adomian decomposition method. The numerical example is provided in order to validate the efficiency and reliability of the proposed method. The obtained results reveal that the proposed method is a very efficient and simple tool for solving fractional differential equations.
Źródło:
Journal of Applied Mathematics and Computational Mechanics; 2020, 19, 1; 43-56
2299-9965
Pojawia się w:
Journal of Applied Mathematics and Computational Mechanics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Local Levenberg-Marquardt algorithm for learning feedforwad neural networks
Autorzy:
Bilski, Jarosław
Kowalczyk, Bartosz
Marchlewska, Alina
Zurada, Jacek M.
Powiązania:
https://bibliotekanauki.pl/articles/1837415.pdf
Data publikacji:
2020
Wydawca:
Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
Tematy:
feed-forward neural network
neural network learning algorithm
optimization problem
Levenberg-Marquardt algorithm
QR decomposition
Givens rotation
Opis:
This paper presents a local modification of the Levenberg-Marquardt algorithm (LM). First, the mathematical basics of the classic LM method are shown. The classic LM algorithm is very efficient for learning small neural networks. For bigger neural networks, whose computational complexity grows significantly, it makes this method practically inefficient. In order to overcome this limitation, local modification of the LM is introduced in this paper. The main goal of this paper is to develop a more complexity efficient modification of the LM method by using a local computation. The introduced modification has been tested on the following benchmarks: the function approximation and classification problems. The obtained results have been compared to the classic LM method performance. The paper shows that the local modification of the LM method significantly improves the algorithm’s performance for bigger networks. Several possible proposals for future works are suggested.
Źródło:
Journal of Artificial Intelligence and Soft Computing Research; 2020, 10, 4; 299-316
2083-2567
2449-6499
Pojawia się w:
Journal of Artificial Intelligence and Soft Computing Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Parameter Estimation Using LU Decomposition in the Logistic Regression Model for Credit Scoring Analysis
Autorzy:
Rahmani, Ulfa
Pribadi, Diantiny Mariam
Purwani, Sri
Powiązania:
https://bibliotekanauki.pl/articles/1031893.pdf
Data publikacji:
2020
Wydawca:
Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN
Tematy:
Credit Scoring
LU Decomposition
Logistic Regression
Problem Loans
Opis:
Banking is a financial institution that has a very important role in economic and trade activities which is useful for channeling funds in the form of loans to the public who need fresh funds for business in the hope of helping to improve the people's economy. In the loan process, banks are often exposed to risks known as credit risk or non-performing loans. Therefore, a credit analysis is performed by estimating the parameters using LU Decomposition in the Logistic Regression model. In this paper, the data used are data about cooperative financial services in Indonesia. Variables taken in the study are including the age of debtors (X1), family dependents (X2), the amount of savings (X3), the value of collateral (X4), the amount of income per month (X5), given the credit limit (X6), take home pay (X7), and the loan term (X8).
Źródło:
World Scientific News; 2020, 140; 1-11
2392-2192
Pojawia się w:
World Scientific News
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Improving logic-based Benders’ algorithms for solving min-max regret problems
Autorzy:
Assunção, Lucas
Santos, Andréa Cynthia
Noronha, Thiago F.
Andrade, Rafael
Powiązania:
https://bibliotekanauki.pl/articles/2099670.pdf
Data publikacji:
2021
Wydawca:
Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
Tematy:
robust optimisation
min-max regret problem
Benders’ decomposition
warm-start procedure
Opis:
This paper addresses a class of problems under interval data uncertainty, composed of min-max regret generalisations of classical 0-1 optimisation problems with interval costs. These problems are called robust-hard when their classical counterparts are already NP-hard. The state-of-the-art exact algorithms for interval 0-1 min-max regret problems in general work by solving a corresponding mixed- -integer linear programming formulation in a Benders’ decomposition fashion. Each of the possibly exponentially many Benders’ cuts is separated on the fly by the resolution of an instance of the classical 0-1 optimisation problem counterpart. Since these separation subproblems may be NP-hard, not all of them can be easily modelled using linear programming (LP), unless P equals NP. In this work, we formally describe these algorithms through a logic-based Benders’ decomposition framework and assess the impact of three warm-start procedures. These procedures work by providing promising initial cuts and primal bounds through the resolution of a linearly relaxed model and an LP-based heuristic. Extensive computational experiments in solving two challenging robust-hard problems indicate that these procedures can highly improve the quality of the bounds obtained by the Benders’ framework within a limited execution time. Moreover, the simplicity and effectiveness of these speed-up procedures make them an easily reproducible option when dealing with interval 0-1 min-max regret problems in general, especially the more challenging subclass of robust-hard problems.
Źródło:
Operations Research and Decisions; 2021, 31, 2; 23--57
2081-8858
2391-6060
Pojawia się w:
Operations Research and Decisions
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The Spectrum Problem for the Connected Cubic Graphs of Order 10
Autorzy:
Adams, Peter
El-Zanati, Saad I.
Odabaşi, Uğur
Wannasit, Wannasiri
Powiązania:
https://bibliotekanauki.pl/articles/32226816.pdf
Data publikacji:
2021-11-01
Wydawca:
Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:
spectrum problem
graph decomposition
cubic graphs
Opis:
We show that if G is a connected cubic graph of order 10, then there exists a G-decomposition of Kv if and only if v ≡ 1 or 10 (mod 15) except when v = 10 and G is one of 5 specific graphs.
Źródło:
Discussiones Mathematicae Graph Theory; 2021, 41, 4; 963-980
2083-5892
Pojawia się w:
Discussiones Mathematicae Graph Theory
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Using the FITradeoff method to solve a shopping mall location problem in the northeastern countryside of Brazil
Autorzy:
Ribeiro, Manoel Lucas Sousa
Roselli, Lucia Reis Peixoto
Frej, Eduarda Asfora
Almeida de, Adiel Teixeira
Morais, Danielle Costa
Powiązania:
https://bibliotekanauki.pl/articles/2183429.pdf
Data publikacji:
2021
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
location problem
shopping mall
FITradeoffmethod
elicitation by decomposition
holistic evaluation
multi-criteria decision making/aiding
MCDM/A
Opis:
This paper presents a practical case involving a shopping mall location problem in the northeast countryside of Brazil. In this problem, conflicting objectives have been expressed in terms of seven criteria. Then, ten cities of the northeastern countryside have been selected to compose the space of actions. The problem plays a special role since Brazil is a big country that requires investments in the countryside. Thus, the shopping mall aims to stimulate economic growth in the respective region. In the study, this multi-objective problem is solved using the FITradeoff method. In FITradeoff, the combination of the paradigms of holistic evaluation and elicitation by decomposition in preference modeling are well explored, bringing different perspectives for the decision-maker during the decision process.
Źródło:
Control and Cybernetics; 2021, 50, 1; 109--126
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 17

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