Temat: computations - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Parallel Dynamic Programming Algorithms : Multitransputer Systems
Autorzy:: Sadecki, J.
Powiązania:: https://bibliotekanauki.pl/articles/907983.pdf
Data publikacji:: 2002
Wydawca:: Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:: automatyka
dynamic programming
parallel computations
transputers
multitransputer systems
parallel optimization algorithms
Opis:: The present paper discusses real parallel computations. On the basis of a selected group of dynamic programming algorithms, a number of factors affecting the efficiency of parallel computations such as, e.g., the way of distributing tasks, the interconnection structure between particular elements of the parallel system or the way of organizing of interprocessor communication are analyzed. Computations were implemented in the parallel multitransputer SUPER NODE 1000 system using from 5 to 50 transputers.
Źródło:: International Journal of Applied Mathematics and Computer Science; 2002, 12, 2; 241-255
1641-876X
2083-8492
Pojawia się w:: International Journal of Applied Mathematics and Computer Science
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 2.

Tytuł:: Application of a Java-Based Framework to Parallel Simulation of Large-Scale Systems
Autorzy:: Niewiadomska-Szynkiewicz, E.
Żmuda, M.
Malinowski, K.
Powiązania:: https://bibliotekanauki.pl/articles/908095.pdf
Data publikacji:: 2003
Wydawca:: Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:: informatyka
parallel computations
simulation
large-scale systems
computer systems
computer-aided system design
Opis:: Large-scale systems, such as computer and telecommunication networks, complex control systems and many others, operate in inherently parallel environments. It follows that there are many opportunities to admit parallelism into both the algorithm of control implementation and simulation of the system operation considered. The paper addresses issues associated with the application of parallel discrete event simulation (PDES). We discuss the PDES terminology and methodology. Particular attention is paid to the software environment CSA&S/PV (Complex Systems Analysis & Simulation-Parallel Version), which provides a framework for simulation experiments performed on parallel computers. CSA&S/PV was applied to investigate several real-life problems. The case studies are presented for both computer and water networks.
Źródło:: International Journal of Applied Mathematics and Computer Science; 2003, 13, 4; 537-547
1641-876X
2083-8492
Pojawia się w:: International Journal of Applied Mathematics and Computer Science
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 3.

Tytuł:: Applications of a hyper-graph grammar system in adaptive finite-element computations
Autorzy:: Gurgul, P.
Jopek, K.
Pingali, K.
Paszyńska, A.
Powiązania:: https://bibliotekanauki.pl/articles/331397.pdf
Data publikacji:: 2018
Wydawca:: Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:: adaptive finite element method
hypergraph grammar
mesh-based computations
metoda elementów skończonych
gramatyka hipergrafu
siatka obliczeniowa
Opis:: This paper describes application of a hyper-graph grammar system for modeling a three-dimensional adaptive finite element method. The hyper-graph grammar approach allows obtaining a linear computational cost of adaptive mesh transformations and computations performed over refined meshes. The computations are done by a hyper-graph grammar driven algorithm applicable to three-dimensional problems. For the case of typical refinements performed towards a point or an edge, the algorithm yields linear computational cost with respect to the mesh nodes for its sequential execution and logarithmic cost for its parallel execution. Such hyper-graph grammar productions are the mathematical formalism used to describe the computational algorithm implementing the finite element method. Each production indicates the smallest atomic task that can be executed concurrently. The mesh transformations and computations by using the hyper-graph grammar-based approach have been tested in the GALOIS environment. We conclude the paper with some numerical results performed on a shared-memory Linux cluster node, for the case of three-dimensional computational meshes refined towards a point, an edge and a face.
Źródło:: International Journal of Applied Mathematics and Computer Science; 2018, 28, 3; 569-582
1641-876X
2083-8492
Pojawia się w:: International Journal of Applied Mathematics and Computer Science
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 4.

Tytuł:: Event monitoring of parallel computations
Autorzy:: Gruzlikov, A. M.
Kolesov, N. V.
Tolmacheva, M. V.
Powiązania:: https://bibliotekanauki.pl/articles/330568.pdf
Data publikacji:: 2015
Wydawca:: Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:: parallel computations
monitoring
discrete event system
real time system
obliczenia równoległe
układ zdarzeń dyskretnych
system czasu rzeczywistego
Opis:: The paper considers the monitoring of parallel computations for detection of abnormal events. It is assumed that computations are organized according to an event model, and monitoring is based on specific test sequences.
Źródło:: International Journal of Applied Mathematics and Computer Science; 2015, 25, 2; 311-321
1641-876X
2083-8492
Pojawia się w:: International Journal of Applied Mathematics and Computer Science
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 5.

Tytuł:: Niching mechanisms in evolutionary computations
Autorzy:: Kowalczuk, Z.
Białaszewski, T.
Powiązania:: https://bibliotekanauki.pl/articles/908461.pdf
Data publikacji:: 2006
Wydawca:: Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:: algorytm genetyczny
projektowanie inżynierskie
obliczenia ewolucyjne
obserwator detekcyjny
niching
ranking
Pareto optimality
genetic algorithms
evolutionary computations
multi-objective optimisation
solutions diversity
engineering designs
detection observers
Opis:: Different types of niching can be used in genetic algorithms (GAs) or evolutionary computations (ECs) to sustain the diversity of the sought optimal solutions and to increase the effectiveness of evolutionary multi-objective optimization solvers. In this paper four schemes of niching are proposed, which are also considered in two versions with respect to the method of invoking: a continuous realization and a periodic one. The characteristics of these mechanisms are discussed, while as their performance and effectiveness are analyzed by considering exemplary multi-objective optimization tasks both of a synthetic and an engineering (FDI) design nature.
Źródło:: International Journal of Applied Mathematics and Computer Science; 2006, 16, 1; 59-84
1641-876X
2083-8492
Pojawia się w:: International Journal of Applied Mathematics and Computer Science
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 6.

Tytuł:: Object library of algorithms for dynamic optimization problems; Benchmarking SQP and nonlinear interior point methods
Autorzy:: Błaszczyk, J.
Karbowski, A.
Malinowski, K.
Powiązania:: https://bibliotekanauki.pl/articles/929795.pdf
Data publikacji:: 2007
Wydawca:: Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:: optymalizacja dynamiczna
programowanie kwadratowe sekwencyjne
różniczkowanie automatyczne
obliczenia numeryczne
analiza danych
dynamic optimization
large-scale optimization
sequential quadratic programming
nonlinear interior-point methods
object-oriented numerical computations
automatic differentiation
performance data analysis
Opis:: The main purpose of this paper is to describe the design, implementation and possibilities of our object-oriented library of algorithms for dynamic optimization problems. We briefly present library classes for the formulation and manipulation of dynamic optimization problems, and give a general survey of solver classes for unconstrained and constrained optimization. We also demonstrate methods of derivative evaluation that we used, in particular automatic differentiation. Further, we briefly formulate and characterize the class of problems solved by our optimization classes. The solution of dynamic optimization problems with general constraints is performed by transformation into structured large-scale nonlinear programming problems and applying methods for nonlinear optimization. Two main algorithms of solvers for constrained dynamic optimization are presented in detail: the sequential quadratic programming (SQP) exploring the multistage structure of the dynamic optimization problem during the solution of a sequence of quadratic subproblems, and the nonlinear interior-point method implemented in a general-purpose large-scale optimizer IPOPT. At the end, we include a typical numerical example of the application of the constrained solvers to a large-scale discrete-time optimal control problem and we use the performance profiles methodology to compare the efficiency and robustness of different solvers or different options of the same solver. In conclusions, we summarize our experience gathered during the library development.
Źródło:: International Journal of Applied Mathematics and Computer Science; 2007, 17, 4; 515-537
1641-876X
2083-8492
Pojawia się w:: International Journal of Applied Mathematics and Computer Science
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Informacja

Wyszukujesz frazę "computations" wg kryterium: Temat

Źródło danych

Dostawca treści

Kolekcja

Rok wydania

Wydawca

Temat

Autor

Typ dokumentu

Język