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

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-7 z 7
    Tytuł:
    Two-dimensional stable Lavrentiev phenomenon with and without boundary conditions
    Autorzy:
    Caetano, A.
    Sarychev, A.
    Seabra, D.
    Powiązania:
    https://bibliotekanauki.pl/articles/970549.pdf
    Data publikacji:
    2005
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    multidimensional calculus of variations
    Lavrentiev phenomenon
    Opis:
    This work contains examples of regular 2D problems of the Calculus of Variations which exhibit stable Lavrentiev phenomenon, under different types of boundary conditions.
    Źródło:
    Control and Cybernetics; 2005, 34, 3; 689-707
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    The grouping differential evolution algorithm for multi-dimensional optimization problems
    Autorzy:
    Piotrowski, A. P.
    Napiórkowski, J. J.
    Powiązania:
    https://bibliotekanauki.pl/articles/969839.pdf
    Data publikacji:
    2010
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    differential evolution
    multidimensional problems
    multimodal problems
    metaheuristics
    Opis:
    A variant of the Differential Evolution method is presented. The classical Differential Evolution approach is very successful for simple problems, but does not perform well enough for troublesome multi-dimensional non-convex continuous functions. To overcome some of the drawbacks, the Grouped Multi-Strategy Differential Evolution algorithm is proposed here. The main idea behind the new approach is to exploit the knowledge about the local minima already found in different parts of the search space in order to facilitate further search for the global one. In the proposed method, the population is split into four groups: three of them rarely communicate with the others, but one is allowed to gain all available knowledge from the whole population throughout the search process. The individuals simultaneously use three different crossover/mutation strategies, which makes the algorithm more flexible. The proposed approach was compared with two Differential Evolution based algorithms on a set of 10- to 100-dimensional test functions of varying difficulty. The proposed method achieved very encouraging results; its advantage was especially significant when more difficult 50- and 100-dimensional problems were considered. When dividing population into separate groups, the total number of individuals becomes a crucial restriction. Hence, the impact of the number of individuals on the performance of the algorithms was studied. It was shown that increasing the number of individuals above the number initially proposed for classic Differential Evolution method is in most cases not advantageous and sometimes may even result in deterioration of results.
    Źródło:
    Control and Cybernetics; 2010, 39, 2; 527-550
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A new method for identifying outlying subsets of data
    Autorzy:
    Zalewska, M.
    Grzanka, A.
    Niemiro, W.
    Samoliński, B.
    Powiązania:
    https://bibliotekanauki.pl/articles/970610.pdf
    Data publikacji:
    2008
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    misclassification error
    discriminant analysis
    multidimensional homogeneity test
    medical data
    Opis:
    In various branches of science, e.g. medicine, economics, sociology, it is necessary to identify or detect outlying subsets of data. Suppose that the set of data is partitioned into many relatively small subsets and we have some reason to suspect that one or several of these subsets may be atypical or aberrant. We propose applying a new measure of separability, based on the ideas borrowed from the discriminant analysis. In our paper we define two versions of this measure, both using a jacknife, leave-one-out, estimator of classification error. If a suspected subset is significantly well separated from the main bulk of data, then we regard it as outlying. The usefulness of our algorithm is illustrated on a set of medical data collected in a large survey "Epidemiology of Allergic Diseases in Poland" (ECAP). We also tested our method on artificial data sets and on the classical IRIS data set. For a comparison, we report the results of a homogeneity test of Bartoszyński, Pearl and Lawrence, applied to the same data sets.
    Źródło:
    Control and Cybernetics; 2008, 37, 3; 693-709
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Bayesian multidimensional-matrix polynomial empirical regression
    Autorzy:
    Mukha, Vladimir S.
    Powiązania:
    https://bibliotekanauki.pl/articles/2050059.pdf
    Data publikacji:
    2020
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    regression function
    parameter estimation
    maximum likelihood estimation
    Bayesian estimation
    multidimensional matrice
    Opis:
    The problem of parameter estimation for the polynomial in the input variables regression function is formulated and solved. The input and output variables of the regression function are multidimensional matrices. The parameters of the regression function are assumed to be random independent multidimensional matrices with Gaussian distribution and known mean value and variance matrices. The solution to this problem is a multidimensional-matrix system of the linear algebraic equations in multidimensional-matrix unknown regression function parameters. We consider the particular cases of constant, affine and quadratic regression function, for which we have obtained formulas for parameter calculation. Computer simulation of the quadratic regression function is performed for the two-dimensional matrix input and output variables.
    Źródło:
    Control and Cybernetics; 2020, 49, 3; 291--314
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Selection of lease contracts in an asset-backed securitization : a real case analysis
    Autorzy:
    Mansini, R.
    Speranza, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/206882.pdf
    Data publikacji:
    1999
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    programowanie liniowe
    investment
    lease contracts
    multidimensional knapsack problem
    securities trading
    securitization
    Opis:
    Asset-backed securities represent one of the most attractive financial novelties for institutional investors. More precisely, asset-backed securities are the output of a complex financial operation, so-called securitization, in which bonds are issued to finance a collection of assets in such a way that the bonds issue design is integrated with the funded assets. We consider a real case of securitization, in which the assets are lease contracts. Through the market issuance of tranches of notes a bank (seller) receives funds from a factor (purchaser) and pay them back in terms of pools of credits associated with lease contracts. In this paper we analyze the problem of selecting the most convenient collection of lease contracts (assets) for the seller to hand over to the purchaser. A 0-1 linear programming model is presented which is shown to be equivalent to a 0-1 Multidimensional Knapsack Problem. Heuristic solution procedures are proposed and computational results based on data from the discussed real case are presented.
    Źródło:
    Control and Cybernetics; 1999, 28, 4; 739-754
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Tabu search: global intensification using dynamic programming
    Autorzy:
    Wilbaut, C.
    Hanafi, S.
    Fréville, A.
    Balev, S.
    Powiązania:
    https://bibliotekanauki.pl/articles/970871.pdf
    Data publikacji:
    2006
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    programowanie dynamiczne
    tabu search
    dynamic programming
    global intensification
    multidimensional 0-1 knapsack problem
    Opis:
    Tabu search has proven highly successful in solving hard combinatorial optimization problems. In this paper, we propose a hybrid method that combines adaptive memory, sparse dynamic programming, and reduction techniques to reduce and explore the search space. Our approach starts with a bi-partition of the variables, involving a small core problem, which never exceeds 15 variables, solved using the "forward" phase of the dynamic programming procedure. Then, the remaining subspace is explored using tabu search, and each partial solution is completed with the information stored during the forward phase of dynamic programming. Our approach can be seen as a global intensification mechanism, since at each iteration, the move evaluations involve solving a reduced problem implicitly. The proposed specialized tabu search approach was tested in the context of the multidimensional 0-1 knapsack problem. Our approach was compared to ILOG's commercial product CPLEX and to the corresponding "pure" tabu search (i.e., without a core problem) for various sets of test problems available in OR-libraries. The results are encouraging. In particular, this enhances the robustness of the approach, given that it performs better than the corresponding pure tabu search most of the time. Moreover, our approach compares well with CPLEX when the number of variables is large; it is able to provide elite feasible solutions in a very reasonable amount of computational time.
    Źródło:
    Control and Cybernetics; 2006, 35, 3; 579-598
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Limiting ellipsoid for reachability set of 2D continuous-discrete linear system with disturbances
    Autorzy:
    Krasoń, E.
    Powiązania:
    https://bibliotekanauki.pl/articles/205518.pdf
    Data publikacji:
    1999
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    dyskretny system sterowania
    system liniowy
    2D continuous-discrete linear system
    continous time systems
    discrete systems
    linear systems
    multidimensional systems
    reachability set
    support function
    Opis:
    A model of 2D continuous-discrete linear system is considered whose input disturbances are unknown but bounded by known ellipsoid. The formula for a support function of reachability set of this system is presented. A method of construction of ellipsoid limiting reachability set is proposed and illustrated with an example.
    Źródło:
    Control and Cybernetics; 1999, 28, 2; 269-279
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-7 z 7

      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