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

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-4 z 4
    Tytuł:
    Solution of an inverse kinematics problem using dual quaternions
    Autorzy:
    Chen, Lei
    Zielinska, Teresa
    Wang, Jikun
    Ge, Weimin
    Powiązania:
    https://bibliotekanauki.pl/articles/331496.pdf
    Data publikacji:
    2020
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    dual quaternions
    inverse kinematics problem
    screw theory
    kwaterniony dualne
    zadanie odwrotne kinematyki
    teoria śrub
    Opis:
    The paper proposes a solution to an inverse kinematics problem based on dual quaternions algebra. The method, relying on screw theory, requires less calculation effort compared with commonly used approaches. The obtained kinematic description is very concise, and the singularity problem is avoided. The dual quaternions formalism is applied to the problem decomposition and description. As an example, the kinematics problem of a multi-DOF serial manipulator is considered. Direct and inverse kinematics problems are solved using division into sub-problems. Each new sub-problem proposed is concerned with rotation about two subsequent axes by a given amount. The presented example verifies the correctness and feasibility of the proposed approach.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2020, 30, 2; 351-361
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Mean Squared Load Criteria for Scheduling Independent Tasks
    Autorzy:
    Dzemyda, G.
    Powiązania:
    https://bibliotekanauki.pl/articles/908277.pdf
    Data publikacji:
    1999
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    przetwarzanie równoległe
    szeregowanie
    zadanie kombinatoryczne
    parallel processing
    scheduling
    combinatorial problems
    minimum makespan problem
    mean squared load
    Opis:
    Results of this paper extend the set of criteria which characterize the scheduling quality as well as the set of possible scheduling strategies. A new view on the minimum makespan criterion is presented in terms of the mean squared load of processing units. This leads in turn to the development of new scheduling algorithms. The interaction between processes of minimizing the new criteria and the maximum finishing time (makespan of the schedule) was discovered. We show the possibility of minimizing the maximum finishing time by minimizing the new criteria that characterize the mean squared load of processing units. Moreover, the optimal workload of processing units determined with the use of the proposed criteria is usually smoother (more balanced) than that found for traditional ones.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 1999, 9, 4; 939-954
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    An agent-oriented hierarchic strategy for solving inverse problems
    Autorzy:
    Smołka, M.
    Schaefer, R.
    Paszyński, M.
    Pardo, D.
    Álvarez-Aramberri, J.
    Powiązania:
    https://bibliotekanauki.pl/articles/329764.pdf
    Data publikacji:
    2015
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    inverse problem
    hybrid optimization method
    memetic algorithm
    multi-agent system
    magnetotelluric data inversion
    zadanie odwrotne
    optymalizacja hybrydowa
    algorytm memetyczny
    system wieloagentowy
    Opis:
    The paper discusses the complex, agent-oriented hierarchic memetic strategy (HMS) dedicated to solving inverse parametric problems. The strategy goes beyond the idea of two-phase global optimization algorithms. The global search performed by a tree of dependent demes is dynamically alternated with local, steepest descent searches. The strategy offers exceptionally low computational costs, mainly because the direct solver accuracy (performed by the hp-adaptive finite element method) is dynamically adjusted for each inverse search step. The computational cost is further decreased by the strategy employed for solution inter-processing and fitness deterioration. The HMS efficiency is compared with the results of a standard evolutionary technique, as well as with the multi-start strategy on benchmarks that exhibit typical inverse problems’ difficulties. Finally, an HMS application to a real-life engineering problem leading to the identification of oil deposits by inverting magnetotelluric measurements is presented. The HMS applicability to the inversion of magnetotelluric data is also mathematically verified.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2015, 25, 3; 483-498
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A metaheuristic for a numerical approximation to the mass transfer problem
    Autorzy:
    Avendaño-Garrido, M. L.
    Gabriel-Argüelles, J. R.
    Quintana-Torres, L.
    Mezura-Montes, E.
    Powiązania:
    https://bibliotekanauki.pl/articles/329972.pdf
    Data publikacji:
    2016
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    Monge–Kantorovich mass transfer problem
    finite dimensional linear programming
    transport problem
    metaheuristic algorithm
    scatter search
    programowanie skończenie wymiarowe
    zadanie transportowe
    algorytm metaheurystyczny
    Opis:
    This work presents an improvement of the approximation scheme for the Monge–Kantorovich (MK) mass transfer problem on compact spaces, which is studied by Gabriel et al. (2010), whose scheme discretizes the MK problem, reduced to solve a sequence of finite transport problems. The improvement presented in this work uses a metaheuristic algorithm inspired by scatter search in order to reduce the dimensionality of each transport problem. The new scheme solves a sequence of linear programming problems similar to the transport ones but with a lower dimension. The proposed metaheuristic is supported by a convergence theorem. Finally, examples with an exact solution are used to illustrate the performance of our proposal.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2016, 26, 4; 757-766
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-4 z 4

      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