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

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-12 z 12
    Tytuł:
    Controllability of nonlinear implicit fractional integrodifferential systems
    Autorzy:
    Balachandran, K.
    Divya, S.
    Powiązania:
    https://bibliotekanauki.pl/articles/329784.pdf
    Data publikacji:
    2014
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    controllability
    fractional derivative
    integrodifferential equations
    fixed point theorem
    sterowalność
    pochodna ułamkowa
    równanie różniczkowe
    punkty stałe
    Opis:
    In this paper, we study the controllability of nonlinear fractional integrodifferential systems with implicit fractional derivative. Sufficient conditions for controllability results are obtained through the notion of the measure of noncompactness of a set and Darbo’s fixed point theorem. Examples are included to verify the result.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2014, 24, 4; 713-722
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Time to the convergence of evolution in the space of population states
    Autorzy:
    Karcz-Dulęba, I.
    Powiązania:
    https://bibliotekanauki.pl/articles/907643.pdf
    Data publikacji:
    2004
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    ewolucja fenotypowa
    układ dynamiczny
    punkt stały
    phenotypic evolution
    dynamical system
    time to convergence
    fixed points
    Opis:
    Phenotypic evolution of two-element populations with proportional selection and normally distributed mutation is considered. Trajectories of the expected location of the population in the space of population states are investigated. The expected location of the population generates a discrete dynamical system. The study of its fixed points, their stability and time to convergence is presented. Fixed points are located in the vicinity of optima and saddles. For large values of the standard deviation of mutation, fixed points become unstable and periodical orbits arise. In this case, fixed points are also moved away from optima. The time to convergence to fixed points depends not only on the mutation rate, but also on the distance of the points from unstability. Results show that a population spends most time wandering slowly towards the optimum with mutation as the main evolution factor.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2004, 14, 3; 279-287
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Detection and Control Problems for Non-Linear Distributed-Parameter Systems With Delays
    Autorzy:
    Namir, A.
    Lahmidi, F.
    Labriji, E. H.
    Powiązania:
    https://bibliotekanauki.pl/articles/911203.pdf
    Data publikacji:
    2000
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    system z rozproszonymi parametrami
    detekcja
    sterowanie
    distributed-parameter systems
    non-linear discrete-time systems
    detection
    control
    fixed-point theorems
    Opis:
    First, we consider non-linear discrete-time and continuous-time systems with unknown inputs. The problem of reconstructing an input using the information given by an output equation is investigated. Then we examine a control problem for non-linear discrete-time hereditary systems, i.e. the problem of finding a control which drives the state of the system from its initial value to a given desired final state. The methods used to solve these problems are based on the state-space technique and fixed-point theorems. To illustrate the outlined ideas, various numerical simulation results are presented.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2000, 10, 3; 437-464
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    The controllability of nonlinear implicit fractional delay dynamical systems
    Autorzy:
    Joice Nirmala, R.
    Balachandran, K.
    Powiązania:
    https://bibliotekanauki.pl/articles/331001.pdf
    Data publikacji:
    2017
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    controllability
    fractional delay
    differential equation
    Mittag-Leffler function
    fixed point theorem
    sterowalność
    opóźnienie ułamkowe
    równanie różniczkowe
    funkcja Mittag-Lefflera
    Opis:
    This paper is concerned with the controllability of nonlinear fractional delay dynamical systems with implicit fractional derivatives for multiple delays and distributed delays in control variables. Sufficient conditions are obtained by using the Darbo fixed point theorem. Further, examples are given to illustrate the theory.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2017, 27, 3; 501-513
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Codings and operators in two genetic algorithms for the leaf-constrained minimum spanning tree problem
    Autorzy:
    Julstrom, B. A.
    Powiązania:
    https://bibliotekanauki.pl/articles/907639.pdf
    Data publikacji:
    2004
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    algorytm ewolucyjny
    algorytm genetyczny
    kod Prüfera
    evolutionary codings
    leaf-constrained spanning trees
    Prüfer strings
    Blob Code
    fixed-length subsets
    Opis:
    The features of an evolutionary algorithm that most determine its performance are the coding by which its chromosomes represent candidate solutions to its target problem and the operators that act on that coding. Also, when a problem involves constraints, a coding that represents only valid solutions and operators that preserve that validity represent a smaller search space and result in a more effective search. Two genetic algorithms for the leaf-constrained minimum spanning tree problem illustrate these observations. Given a connected, weighted, undirected graph G with n vertices and a bound l, this problem seeks a spanning tree on G with at least l leaves and minimum weight among all such trees. A greedy heuristic for the problem begins with an unconstrained minimum spanning tree on G, then economically turns interior vertices into leaves until their number reaches l. One genetic algorithm encodes candidate trees with Prüfer strings decoded via the Blob Code. The second GA uses strings of length n - l that specify trees' interior vertices. Both GAs apply operators that generate only valid chromosomes. The latter represents and searches a much smaller space. In tests on 65 instances of the problem, both Euclidean and with weights chosen randomly, the Blob-Coded GA cannot compete with the greedy heuristic, but the subset-coded GA consistently identifies leaf-constrained spanning trees of lower weight than the greedy heuristic does, particularly on the random instances.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2004, 14, 3; 385-396
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Maintaining the feasibility of hard real-time systems with a reduced number of priority levels
    Autorzy:
    Qureshi, M. B.
    Alrashed, S.
    Min-Allah, N.
    Kołodziej, J.
    Arabas, P.
    Powiązania:
    https://bibliotekanauki.pl/articles/330305.pdf
    Data publikacji:
    2015
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    real time system
    feasibility analysis
    fixed priority scheduling
    rate monotonic algorithm
    online scheduling
    system czasu rzeczywistego
    analiza wykonalności
    algorytm szeregowania
    Opis:
    When there is a mismatch between the cardinality of a periodic task set and the priority levels supported by the underlying hardware systems, multiple tasks are grouped into one class so as to maintain a specific level of confidence in their accuracy. However, such a transformation is achieved at the expense of the loss of schedulability of the original task set. We further investigate the aforementioned problem and report the following contributions: (i) a novel technique for mapping unlimited priority tasks into a reduced number of classes that do not violate the schedulability of the original task set and (ii) an efficient feasibility test that eliminates insufficient points during the feasibility analysis. The theoretical correctness of both contributions is checked through formal verifications. Moreover, the experimental results reveal the superiority of our work over the existing feasibility tests by reducing the number of scheduling points that are needed otherwise.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2015, 25, 4; 709-722
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Controllability of nonlinear stochastic systems with multiple time-varying delays in control
    Autorzy:
    Karthikeyan, S.
    Balachandran, K.
    Sathya, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/330584.pdf
    Data publikacji:
    2015
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    relative controllability
    stochastic control system
    multiple delays in control
    Banach fixed point theorem
    układ sterowania stochastyczny
    twierdzenie Banacha o kontrakcji
    Opis:
    This paper is concerned with the problem of controllability of semi-linear stochastic systems with time varying multiple delays in control in finite dimensional spaces. Sufficient conditions are established for the relative controllability of semilinear stochastic systems by using the Banach fixed point theorem. A numerical example is given to illustrate the application of the theoretical results. Some important comments are also presented on existing results for the stochastic controllability of fractional dynamical systems.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2015, 25, 2; 207-215
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    An output controllability problem for semilinear distributed hyperbolic systems
    Autorzy:
    Zerrik, E.
    Larhrissi, R.
    Bourray, H.
    Powiązania:
    https://bibliotekanauki.pl/articles/929815.pdf
    Data publikacji:
    2007
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    system o parametrach rozłożonych
    system półliniowy
    system hyperboliczny
    sterowność wymuszona
    punkt stały
    distributed-parameter systems
    semilinear hyperbolic systems
    constrained controllability
    fixed point
    Opis:
    The paper aims at extending the notion of regional controllability developed for linear systems to the semilinear hyperbolic case. We begin with an asymptotically linear system and the approach is based on an extension of the Hilbert uniqueness method and Schauder’s fixed point theorem. The analytical case is then tackled using generalized inverse techniques and converted to a fixed point problem leading to an algorithm which is successfully implemented numerically and illustrated with examples.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2007, 17, 4; 437-446
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A new sufficient schedulability analysis for hybrid scheduling
    Autorzy:
    Zhang, F.
    Zhai, Y.
    Liao, J.
    Powiązania:
    https://bibliotekanauki.pl/articles/330353.pdf
    Data publikacji:
    2016
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    scheduling algorithm
    real time system
    schedulability analysis
    preemptive scheduling
    earliest deadline first
    fixed priority
    algorytm szeregowania
    system czasu rzeczywistego
    analiza szeregowalności
    Opis:
    Earliest deadline first (EDF) and fixed priority (FP) are the most commonly used and studied scheduling algorithms for real-time systems. This paper focuses on combining the EDF and FP strategies in one system. We provide a new sufficient schedulability analysis for real-time hybrid task systems which are scheduled by EDF and FP. The proposed analysis has a polynomial time complexity and no restrictions on task parameters, where the relative deadline of each task could be less than, equal to, or greater than its period. By extensive experiments, we show that our proposed analysis significantly improves the acceptance ratio compared with the existing results of the sufficient schedulability test for hybrid scheduling systems.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2016, 26, 3; 683-692
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A method of lower and upper solutions for control problems and application to a model of bone marrow transplantation
    Autorzy:
    Parajdi, Lorand Gabriel
    Precup, Radu
    Haplea, Ioan Ştefan
    Powiązania:
    https://bibliotekanauki.pl/articles/24200690.pdf
    Data publikacji:
    2023
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    control problem
    lower and upper solution
    fixed point
    approximation algorithm
    numerical solution
    medical application
    sterowanie optymalne
    punkt stały
    algorytm aproksymacyjny
    rozwiązanie numeryczne
    zastosowanie medyczne
    Opis:
    A lower and upper solution method is introduced for control problems related to abstract operator equations. The method is illustrated on a control problem for the Lotka-Volterra model with seasonal harvesting and applied to a control problem of cell evolution after bone marrow transplantation.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2023, 33, 3; 409--418
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    On the convergence of sigmoidal fuzzy grey cognitive maps
    Autorzy:
    Harmati, István Á.
    Kóczy, László T.
    Powiązania:
    https://bibliotekanauki.pl/articles/331060.pdf
    Data publikacji:
    2019
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    fuzzy cognitive map
    grey system theory
    fuzzy grey cognitive map
    fixed point
    mapa kognitywna rozmyta
    teoria szarych systemów
    rozmyta mapa poznawcza
    punkt stały
    Opis:
    Fuzzy cognitive maps (FCMs) are recurrent neural networks applied for modelling complex systems using weighted causal relations. In FCM-based decision-making, the inference about the modelled system is provided by the behaviour of an iteration. Fuzzy grey cognitive maps (FGCMs) are extensions of fuzzy cognitive maps, applying uncertain weights between the concepts. This uncertainty is expressed by the so-called grey numbers. Similarly as in FCMs, the inference is determined by an iteration process which may converge to an equilibrium point, but limit cycles or chaotic behaviour may also turn up. In this paper, based on the grey connections between the concepts and the parameters of the sigmoid threshold function, we give sufficient conditions for the existence and uniqueness of fixed points of sigmoid FGCMs.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2019, 29, 3; 453-466
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Schauder’s fixed-point theorem in approximate controllability problems
    Autorzy:
    Babiarz, A.
    Klamka, J.
    Niezabitowski, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/329939.pdf
    Data publikacji:
    2016
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    approximate controllability
    Banach space
    Hilbert space
    Schauder's fixed point theorem
    infinite dimensional space
    sterowalność aproksymacyjna
    przestrzeń Banacha
    przestrzeń Hilberta
    twierdzenie o punkcie stałym
    przestrzeń nieskończenie wymiarowa
    Opis:
    The main objective of this article is to present the state of the art concerning approximate controllability of dynamic systems in infinite-dimensional spaces. The presented investigation focuses on obtaining sufficient conditions for approximate controllability of various types of dynamic systems using Schauder’s fixed-point theorem. We describe the results of approximate controllability for nonlinear impulsive neutral fuzzy stochastic differential equations with nonlocal conditions, impulsive neutral functional evolution integro-differential systems, stochastic impulsive systems with control-dependent coefficients, nonlinear impulsive differential systems, and evolution systems with nonlocal conditions and semilinear evolution equation.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2016, 26, 2; 263-275
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-12 z 12

      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