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ę "discrete distributed systems" wg kryterium: Temat


Wyświetlanie 1-3 z 3
Tytuł:
Optimizing the Linear Quadratic Minimum-Time Problem for Discrete Distributed Systems
Autorzy:
Rachik, M.
Abdelhak, A.
Powiązania:
https://bibliotekanauki.pl/articles/907998.pdf
Data publikacji:
2002
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
informatyka
discrete distributed systems
time-delay systems
minimum time
optimal control
Opis:
With reference to the work of Verriest and Lewis (1991) on continuous finite-dimensional systems, the linear quadratic minimum-time problem is considered for discrete distributed systems and discrete distributed time delay systems. We treat the problem in two variants, with fixed and free end points. We consider a cost functional J which includes time, energy and precision terms, and then we investigate the optimal pair (N,u) which minimizes J.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2002, 12, 2; 153-160
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Transforming Source Code to Mathematical Relations for Performance Evaluation
Autorzy:
Izadkhah, H.
Powiązania:
https://bibliotekanauki.pl/articles/106274.pdf
Data publikacji:
2015
Wydawca:
Uniwersytet Marii Curie-Skłodowskiej. Wydawnictwo Uniwersytetu Marii Curie-Skłodowskiej
Tematy:
Distributed Software Systems
source code
speed up
Discrete Time Markov Chains
Opis:
Assessing software quality attributes (such as performance, reliability, and security) from source code is of the utmost importance. The performance of a software system can be improved by its parallel and distributed execution. The aim of the parallel and distributed execution is to speed up by providing the maximum possible concurrency in executing the distributed segments. It is a well known fact that distributing a program cannot be always caused speeding up the execution of it; in some cases, this distribution can have negative effects on the running time of the program. Therefore, before distributing a source code, it should be specified whether its distribution could cause maximum possible concurrency or not. The existing methods and tools cannot achieve this aim from the source code. In this paper, we propose a mathematical relationship for object oriented programs that statically analyze the program by verifying the type of synchronous and asynchronous calls inside the source code. Then, we model the invocations of the software methods by Discrete Time Markov Chains (DTMC). Using the properties of DTMC and the proposed mathematical relationship, we will determine whether or not the source code can be distributed on homogeneous processors. The experimental results showed that we can specify whether the program is distributable or not, before deploying it on the distributed systems.
Źródło:
Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica; 2015, 15, 2; 7-13
1732-1360
2083-3628
Pojawia się w:
Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica
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ł
    Wyświetlanie 1-3 z 3

    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