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ę "distributed algorithms" wg kryterium: Wszystkie pola

  Lista filtrów
Wyrównaj
Wyświetlanie 1-25 z 27
Tytuł:
Distributed asynchronous algorithms in the Internet - new routing and traffic control methods
Autorzy:
Karbowski, A.
Powiązania:
https://bibliotekanauki.pl/articles/309014.pdf
Data publikacji:
2005
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
computer networks
optimization
shortest path
traffic control
decomposition
distributed computations
asynchronous algorithms
Opis:
The paper presents several new algorithms concerning the third (network) and the fourth (transport) layer of ISO/OSI network model. For the third layer two classes of the shortest paths algorithms - label correcting and auction algorithms - are proposed. For the fourth layer an application of price decomposition to network optimization and Internet congestion control is suggested.
Źródło:
Journal of Telecommunications and Information Technology; 2005, 3; 29-36
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Distributed, asynchronous algorithms for network control with contracted flow rates - a review
Autorzy:
Karbowski, A.
Powiązania:
https://bibliotekanauki.pl/articles/308928.pdf
Data publikacji:
2006
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
computer networks
asynchronous algorithms
distributed optimization
routing
service level agreement
service quality
Opis:
The paper reviews current algorithms for distributed, asynchronous control of networks when the customer is guaranteed to get some predetermined (e.g., as a part of a service level agreement - SLA) values of flow. Two cases are considered - both with single and multiple commodity. It is assumed, that the flow cost functions are convex with special attention devoted to linear and strictly convex cases.
Źródło:
Journal of Telecommunications and Information Technology; 2006, 4; 46-52
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Selected application of the Chinese remainder theorem in multiparty computation
Autorzy:
Jakubski, A.
Powiązania:
https://bibliotekanauki.pl/articles/122387.pdf
Data publikacji:
2016
Wydawca:
Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
Tematy:
multiparty cryptography
secret sharing
distributed algorithms
modular arithmetic
kryptografia wielopartyjna
algorytmy rozproszone
arytmetyka modularna
Opis:
In this paper we present protocols checking the equality of two distributed numbers and calculation of the product in such a way that the distributed numbers are unknown to anyone. The presented protocols use the Chinese Remainder Theorem. As a result, the obtained protocols have many interesting cryptographic features.
Źródło:
Journal of Applied Mathematics and Computational Mechanics; 2016, 15, 1; 39-47
2299-9965
Pojawia się w:
Journal of Applied Mathematics and Computational Mechanics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Learning decision rules using a distributed evolutionary algorithm
Autorzy:
Kwedlo, W.
Krętowski, M.
Powiązania:
https://bibliotekanauki.pl/articles/1986918.pdf
Data publikacji:
2002
Wydawca:
Politechnika Gdańska
Tematy:
decision rule learning
distributed evolutionary algorithms
Opis:
A new parallel method for learning decision rules from databases by using an evolutionary algorithm is proposed. We describe an implementation of EDRL-MD system in the cluster of multiprocessor machines connected by Fast Ethernet. Our approach consists in a distribution of the learning set into processors of the cluster. The evolutionary algorithm uses a master-slave model to compute the fitness function in parallel. The remiander of evolutionary algorithm is executed in the master node. The experimental results show, that for large datasets our approach is able to obtain a significant speed-up in comparison to a single processor version.
Źródło:
TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk; 2002, 6, 3; 483-492
1428-6394
Pojawia się w:
TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Computational Methods for Two-Level 0-1 Programming Problems through Distributed Genetic Algorithms
Autorzy:
Niwa, K.
Hayashida, T.
Sakawa, M.
Powiązania:
https://bibliotekanauki.pl/articles/309162.pdf
Data publikacji:
2010
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
distributed genetic algorithm
Stackelberg solution
two-level 0-1 programming problem
Opis:
In this paper, we consider a two-level 0-1 programming problem in which there is not coordination between the decision maker (DM) at the upper level and the decision maker at the lower level. We propose a revised computational method that solves problems related to computational methods for obtaining the Stackelberg solution. Specifically, in order to improve the computational accuracy of approximate Stakelberg solutions and shorten the computational time of a computational method implementing a genetic algorithm (GA) proposed by the authors, a distributed genetic algorithm is introduced with respect to the upper level GA, which handles decision variables for the upper level DM. Parallelization of the lower level GA is also performed along with parallelization of the upper level GA. The proposed algorithm is also improved in order to eliminate unnecessary computation during operation of the lower level GA, which handles decision variables for the lower level DM. In order to verify the effectiveness of the proposed method, we propose comparisons with existing methods by performing numerical experiments to verify both the accuracy of the solution and the time required for the computation.
Źródło:
Journal of Telecommunications and Information Technology; 2010, 2; 78-87
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Reducing transfer costs of fragments allocation in replicated distributed database using genetic algorithms
Autorzy:
Sourati, N. K
Ramezni, F
Powiązania:
https://bibliotekanauki.pl/articles/102446.pdf
Data publikacji:
2015
Wydawca:
Stowarzyszenie Inżynierów i Techników Mechaników Polskich
Tematy:
distributed database
genetic algorithms
communication costs
GA
data segmentation
Fitness
Crossover
node
fragment data
Opis:
Distributed databases were developed in order to respond to the needs of distributed computing. Unlike traditional database systems, distributed database systems are a set of nodes that are connected with each other by network and each of nodes has its own database, but they are available by other systems. Thus, each node can have access to all data on entire network. The main objective of allocated algorithms is to attribute fragments to various nodes in order to reduce the shipping cost. Thus, firstly fragments of nodes must be accessible by all nodes in each period, secondly, the transmission cost of fragments to nodes must be reduced and thirdly, the cost of updating all components of nodes must be optimized, that results in increased reliability and availability of network. In this study, more efficient hybrid algorithm can be produced combining genetic algorithms and previous algorithms.
Źródło:
Advances in Science and Technology. Research Journal; 2015, 9, 25; 1-6
2299-8624
Pojawia się w:
Advances in Science and Technology. Research Journal
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Efficiency analysis of control algorithms in spatially distributed systems with chaotic behavior
Autorzy:
Korus, Ł.
Powiązania:
https://bibliotekanauki.pl/articles/331175.pdf
Data publikacji:
2014
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
controlling spatiotemporal chaos
coupled map lattice
system stability
Lyapunov exponent
net direction phase
stabilność układu
wykładnik Lapunowa
kierunek fazy
Opis:
The paper presents results of examination of control algorithms for the purpose of controlling chaos in spatially distributed systems like the coupled map lattice (CML). The mathematical definition of the CML, stability analysis as well as some basic results of numerical simulation exposing complex, spatiotemporal and chaotic behavior of the CML were already presented in another paper. The main purpose of this article is to compare the efficiency of controlling chaos by simple classical algorithms in spatially distributed systems like CMLs. This comparison is made based on qualitative and quantitative evaluation methods proposed in the previous paper such as the indirect Lyapunov method, Lyapunov exponents and the net direction phase indicator. As a summary of this paper, some conclusions which can be useful for creating a more efficient algorithm of controlling chaos in spatially distributed systems are made.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2014, 24, 4; 759-770
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Towards a distributed solution to multi-robot task allocation problem with energetic and spatiotemporal constraints
Autorzy:
Zitouni, Farouq
Harous, Saad
Maamri, Ramdane
Powiązania:
https://bibliotekanauki.pl/articles/305365.pdf
Data publikacji:
2020
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
multi-robot systems
multi-robot task allocation
energetic constraints
spatial constraints
temporal constraints
objective function
parallel distributed guided genetic algorithms
Opis:
This paper tackles the Multi-Robot Task Allocation problem. It consists of two distinct sets: a set of tasks (requiring resources), and a set of robots (offering resources). Then, the tasks are allocated to robots while optimizing a certain objective function subject to some constraints; e.g., allocating the maximum number of tasks, minimizing the distances traveled by the robots, etc. Previous works mainly optimized the temporal and spatial constraints, but no work focused on energetic constraints. Our main contribution is the introduction of energetic constraints on multi-robot task allocation problems. In addition, we propose an allocation method based on parallel distributed guided genetic algorithms and compare it to two state-of-the-art algorithms. The performed simulations and obtained results show the effectiveness and scalability of our solution, even in the case of a large number of robots and tasks. We believe that our contribution is applicable in many contemporary areas of research such as smart cities and related topics.
Źródło:
Computer Science; 2020, 21 (1); 3-24
1508-2806
2300-7036
Pojawia się w:
Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Parallel and distributed implementation of optimization algorithms in fe analyses
Implementacja optymalizacyjnych algorytmów równoległych i rozproszonych w analizie MES
Autorzy:
Handrik, M.
Vasko, M.
Kopas, P.
Powiązania:
https://bibliotekanauki.pl/articles/196393.pdf
Data publikacji:
2012
Wydawca:
Politechnika Śląska. Wydawnictwo Politechniki Śląskiej
Tematy:
FEM analysis
optimization
parallel computing
distributed computing
BOINC
grid computing
evolutionary algorithms
analiza MES
optymalizacja
obliczenia równoległe
obliczenia rozproszone
rozproszony model obliczeniowy
algorytm ewolucyjny
Opis:
The aim of this paper is analysis of optimization algorithms in terms of their possible solutions in parallelization and distributed computing systems. Main goal is using of evolutionary algorithms and implementation of parallel algorithms. As the software platform for application of distributed optimization algorithms is using software package BOINC. For evaluation of the objective function is used FEM program ADINA.
Artykuł analizuje algorytmy optymalizacyjne pod kątem ich możliwości obliczeń równoległych oraz rozproszonych systemów obliczeniowych. Ukierunkowany jest przede wszystkim na algorytmy ewolucyjne oraz ich implementację równoległą. Jako platforma softwarowa do zastosowania rozproszonego systemu obliczeniowego algorytmu zostało zastosowane oprogramowanie pośredniczące BOINC. W celu oceny funkcji docelowej został zastosowany w MES program ADINA.
Źródło:
Zeszyty Naukowe. Transport / Politechnika Śląska; 2012, 76; 67-74
0209-3324
2450-1549
Pojawia się w:
Zeszyty Naukowe. Transport / Politechnika Śląska
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Implementation and Analysis of Elliptic Curves-Based Cryptographic Algorithms in the Integrated Programming Environment
Autorzy:
Lukaszewski, R.
Sobieszek, M.
Bilski, P.
Powiązania:
https://bibliotekanauki.pl/articles/963936.pdf
Data publikacji:
2011
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
cryptography
distributed measurement systems
integrated programming environments
Opis:
The paper presents the implementation of the Elliptic Curves Cryptography (ECC) algorithms to ensure security in the distributed measurement system. The algorithms were deployed in the LabWindows/CVI environment and are a part of its cryptographic library. Their functionality is identical with the OpenSSL package. The effectiveness of implemented algorithms is presented with the comparison of the ECDSA against the DSA systems. The paper is concluded with future prospects of the implemented library.
Źródło:
International Journal of Electronics and Telecommunications; 2011, 57, 3; 257-262
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Distributed System for Power Quality Improvement
Autorzy:
Klempka, R.
Powiązania:
https://bibliotekanauki.pl/articles/262783.pdf
Data publikacji:
2008
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie
Tematy:
distributed system
power quality
genetic algorithms
Opis:
On the basis of the current trends for solving complex technical problems, a new concept of power quality improvement is proposed. It consists in creating a distributed system for supply conditions improvement in a given islanding power system, in e.g. geographical terms (with determined points of delivery), or as an internal installation system of an industrial consumer.
Źródło:
Electrical Power Quality and Utilisation. Journal; 2008, 14, 2; 53-68
1896-4672
Pojawia się w:
Electrical Power Quality and Utilisation. Journal
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Distributed temperature sensing in optical fibers based on Raman scattering: demodulation algorithms
Autorzy:
Shatarah, I. S. M.
Olbrycht, R.
Powiązania:
https://bibliotekanauki.pl/articles/114052.pdf
Data publikacji:
2017
Wydawca:
Stowarzyszenie Inżynierów i Techników Mechaników Polskich
Tematy:
Distributed Temperature Sensing (DTS)
Optical Time Domain Reflectometry (OTDR)
spontaneous Raman back-scattering
demodulation algorithms
Opis:
Distributed temperature sensing systems (DTS) has improved over years thanks to the improvements in configurations, components and demodulation calculating algorithms. The demodulation algorithms have been improved depending on the application and the environment, in which the fiber is installed, in order to obtain accurate measurements of temperature and distance. This study discusses the conventional calculating methods and proposed algorithms for different configurations for DTS systems.
Źródło:
Measurement Automation Monitoring; 2017, 63, 2; 45-47
2450-2855
Pojawia się w:
Measurement Automation Monitoring
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Task allocation algorithms for maximizing reliability of heterogeneous distributed computing systems
Autorzy:
Mahmood, A.
Powiązania:
https://bibliotekanauki.pl/articles/205582.pdf
Data publikacji:
2001
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
heurystyka
niezawodność
obliczenie zdecentralizowane
przetwarzanie rozproszone
A* algorithm
branch-and-bound
distributed computing
heuristics
reliability
task allocation
Opis:
The rapid progress of microprocessor and communication technologies has made the distributed computing system economically attractive for many computer applications. One of the first problems encountered in the operation of a distributed system is the problem of allocating the tasks among the processing nodes. The task allocation problem is known to be computationally intractable for large task sets. In this paper, we consider the task allocation problem with the goal of maximizing reliability of heterogeneous distributed systems. After presenting a quantitative task allocation model, we present a least-cost branch-and-bound algorithm to find optimal task allocations. We also present two heuristic algorithms to obtain suboptimal allocations for realistic size large problems in a reasonable amount of computational time. Simulation was used to study the performance of the proposed algorithms for a large number of problems. Also, performance of the proposed algorithms has been compared with a well-known heuristics available in the literature.
Źródło:
Control and Cybernetics; 2001, 30, 1; 115-130
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Optimal placement and sizing of distributed generator units using genetic optimization algorithms
Autorzy:
Haesens, E.
Espinoza, M.
Pluymers, B.
Goethals, I.
Thong, V. V.
Driesen, J.
Belmanss, R.
Moor, B. de
Powiązania:
https://bibliotekanauki.pl/articles/262691.pdf
Data publikacji:
2005
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie
Tematy:
distributed generation
optimization methods
microgrid
Opis:
In this article the authors describe how genetic optimization algorithms can be used to find the optimal size and location of distributed generation units in a residential distribution grid. Power losses are minimized while the voltage profile is kept at an acceptable level. The method is applied on a system based on an existing grid topology with production and residential load data based on measurements. Different scenarios are chosen to run the algorithm. The obtained optimal location and size prove to depend strongly on the given conditions.
Źródło:
Electrical Power Quality and Utilisation. Journal; 2005, 11, 1; 97-104
1896-4672
Pojawia się w:
Electrical Power Quality and Utilisation. Journal
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Decentralized and distributed active fault diagnosis: Multiple model estimation algorithms
Autorzy:
Straka, Ondřej
Punčochář, Ivo
Powiązania:
https://bibliotekanauki.pl/articles/330423.pdf
Data publikacji:
2020
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
fault diagnosis
large scale system
multiple model
diagnostyka błędu
system dużej skali
model wieloskładnikowy
Opis:
The paper focuses on active fault diagnosis (AFD) of large scale systems. The multiple model framework is considered and two architectures are treated: the decentralized and the distributed one. An essential part of the AFD algorithm is state estimation, which must be supplemented with a mechanism to achieve feasible implementation in the multiple model framework. In the paper, the generalized pseudo Bayes and interacting multiple model estimation algorithms are considered. They are reformulated for a given model of a large scale system. Performance of both AFD architectures is analyzed for different combinations of multiple model estimation algorithms using a numerical example.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2020, 30, 2; 239-249
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Learning from heterogeneously distributed data sets using artificial neural networks and genetic algorithms
Autorzy:
Peteiro-Barral, D.
Guijarro-Berdiñas, B.
Pérez-Sánchez, B.
Powiązania:
https://bibliotekanauki.pl/articles/91888.pdf
Data publikacji:
2012
Wydawca:
Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
Tematy:
artificial neural networks
genetic algorithm
Devonet algorithm
Opis:
It is a fact that traditional algorithms cannot look at a very large data set and plausibly find a good solution with reasonable requirements of computation (memory, time and communications). In this situation, distributed learning seems to be a promising line of research. It represents a natural manner for scaling up algorithms inasmuch as an increase of the amount of data can be compensated by an increase of the number of distributed locations in which the data is processed. Our contribution in this field is the algorithm Devonet, based on neural networks and genetic algorithms. It achieves fairly good performance but several limitations were reported in connection with its degradation in accuracy when working with heterogeneous data, i.e. the distribution of data is different among the locations. In this paper, we take into account this heterogeneity in order to propose several improvements of the algorithm, based on distributing the computation of the genetic algorithm. Results show a significative improvement of the performance of Devonet in terms of accuracy.
Źródło:
Journal of Artificial Intelligence and Soft Computing Research; 2012, 2, 1; 5-20
2083-2567
2449-6499
Pojawia się w:
Journal of Artificial Intelligence and Soft Computing Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Heuristic algorithms for optimization of task allocation and result distribution in peer-to-peer computing systems
Autorzy:
Chmaj, G.
Walkowiak, K.
Tarnawski, M.
Kucharzak, M.
Powiązania:
https://bibliotekanauki.pl/articles/330970.pdf
Data publikacji:
2012
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
system obliczeniowy P2P
przetwarzanie rozproszone
optymalizacja
heurystyka
algorytm ewolucyjny
P2P computing system
distributed computing
optimization
heuristics
evolutionary algorithms
Opis:
Recently, distributed computing system have been gaining much attention due to a growing demand for various kinds of effective computations in both industry and academia. In this paper, we focus on Peer-to-Peer (P2P) computing systems, also called public-resource computing systems or global computing systems. P2P computing systems, contrary to grids, use personal computers and other relatively simple electronic equipment (e.g., the PlayStation console) to process sophisticated computational projects. A significant example of the P2P computing idea is the BOINC (Berkeley Open Infrastructure for Network Computing) project. To improve the performance of the computing system, we propose to use the P2P approach to distribute results of computational projects, i.e., results are transmitted in the system like in P2P file sharing systems (e.g., BitTorrent). In this work, we concentrate on offline optimization of the P2P computing system including two elements: scheduling of computations and data distribution. The objective is to minimize the system OPEX cost related to data processing and data transmission. We formulate an Integer Linear Problem (ILP) to model the system and apply this formulation to obtain optimal results using the CPLEX solver. Next, we propose two heuristic algorithms that provide results very close to an optimum and can be used for larger problem instances than those solvable by CPLEX or other ILP solvers.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2012, 22, 3; 733-748
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
But seriously: what do algorithms want? Implying collective intentionalities in algorithmic relays - a distributed cognition approach
Autorzy:
Toscano, Javier
Powiązania:
https://bibliotekanauki.pl/articles/28763330.pdf
Data publikacji:
2022
Wydawca:
Copernicus Center Press
Tematy:
algorithm studies
distributed cognition
collective intentionalities
socio-computing infrastructures
cognitive anthropology
Opis:
Describing an algorithm can provide a formalization of a specific process. However, different ways of conceptualizing algorithms foreground certain issues while obscuring others. This article attempts to define an algorithm in a broad sense as a cultural activity of key importance to make sense of socio-cognitive structures. It also attempts to develop a sharper account on the interaction between humans and tools, symbols and technologies. Rather than human or machine-centered analyses, I draw upon sociological and anthropological theories that underline social practices to propose expanding our understanding of an algorithm through the notion of ‘collective intentionalities’. To make this term clear, a brief historical review is presented, followed by an argumentation on how to incorporate it in an integral perspective. The article responds to recent debates in critical algorithm studies about the significance of the term. It develops a discussion along the lines of cognitive anthropology and the cognitive sciences, therefore advancing a definition that is grounded in observed practices as well as in modeled descriptions. The benefit of this approach is that it encourages scholars to explore cognitive structures via archaeologies of technological assemblages, where intentionalities play a defining role in understanding socio-structured practices and cognitive ecologies.
Źródło:
Zagadnienia Filozoficzne w Nauce; 2022, 73; 47-76
0867-8286
2451-0602
Pojawia się w:
Zagadnienia Filozoficzne w Nauce
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Solution of linear and non-linear boundary value problems using population-distributed parallel differential evolution
Autorzy:
Nasim, Amnah
Burattini, Laura
Fateh, Muhammad Faisal
Zameer, Aneela
Powiązania:
https://bibliotekanauki.pl/articles/91569.pdf
Data publikacji:
2019
Wydawca:
Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
Tematy:
parallel evolutionary algorithms
differential evolution
boundary value problems
optimization
Opis:
Cases where the derivative of a boundary value problem does not exist or is constantly changing, traditional derivative can easily get stuck in the local optima or does not factually represent a constantly changing solution. Hence the need for evolutionary algorithms becomes evident. However, evolutionary algorithms are compute-intensive since they scan the entire solution space for an optimal solution. Larger populations and smaller step sizes allow for improved quality solution but results in an increase in the complexity of the optimization process. In this research a population-distributed implementation for differential evolution algorithm is presented for solving systems of 2nd-order, 2-point boundary value problems (BVPs). In this technique, the system is formulated as an optimization problem by the direct minimization of the overall individual residual error subject to the given constraint boundary conditions and is then solved using differential evolution in the sense that each of the derivatives is replaced by an appropriate difference quotient approximation. Four benchmark BVPs are solved using the proposed parallel framework for differential evolution to observe the speedup in the execution time. Meanwhile, the statistical analysis is provided to discover the effect of parametric changes such as an increase in population individuals and nodes representing features on the quality and behavior of the solutions found by differential evolution. The numerical results demonstrate that the algorithm is quite accurate and efficient for solving 2nd-order, 2-point BVPs.
Źródło:
Journal of Artificial Intelligence and Soft Computing Research; 2019, 9, 3; 205-218
2083-2567
2449-6499
Pojawia się w:
Journal of Artificial Intelligence and Soft Computing Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Algorytm wyznaczania Consensusu w sytuacji konfliktu wiedzy nieustrukturalizowanej w rozproszonych informatycznych systemach wspomagających zarządzani
Consensus determining algorithm in a situationof unstructured knowledge conflictsin distributed information managementsupport systems
Autorzy:
Bytniewski, Andrzej
Hernes, Marcin
Powiązania:
https://bibliotekanauki.pl/articles/424815.pdf
Data publikacji:
2013
Wydawca:
Wydawnictwo Uniwersytetu Ekonomicznego we Wrocławiu
Tematy:
unstructured knowledge
knowledge conflicts
term frequency matrix
consensus algorithms
Opis:
The problem of unstructured knowledge conflicts solving in the management support systems is presented in the article. The first part of the article pays attention to the fact that unstructured knowledge is an important element of organizations functioning, especially in terms of competition. Next, the sources and essence of unstructured conflicts of unstructured knowledge are characterized. This knowledge is stored at wide mining text documents. In the final part of the article, assuming the representation of text document in the binary form of frequency matrix, the consensus determining algorithm is elaborated allowing to solve unstructured knowledge conflicts, which is the basic purpose of the article.
Źródło:
Econometrics. Ekonometria. Advances in Applied Data Analytics; 2013, 4(42); 153-164
1507-3866
Pojawia się w:
Econometrics. Ekonometria. Advances in Applied Data Analytics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Wykorzystanie własnych zasobów obliczeniowych przedsiębiorstwa w procesie planowania produkcji
The use of company’s own computational resources for production planning process
Autorzy:
Dłubacz, W.
Duda, J.
Powiązania:
https://bibliotekanauki.pl/articles/952147.pdf
Data publikacji:
2018
Wydawca:
Uniwersytet Humanistyczno-Przyrodniczy im. Jana Długosza w Częstochowie. Wydawnictwo Uczelniane
Tematy:
planowanie produkcji
optymalizacja dyskretna
algorytmy genetyczne
obliczenia rozproszone
production planning
discrete optimization
genetic algorithms
distributed computing
Opis:
W artykule przedstawiony został nowoczesny system obliczeń rozproszonych, umożliwiający łatwe wykorzystanie dostępnych zasobów obliczeniowych przedsiębiorstwa. Opracowany system pozwala na przygotowanie planów produkcji w oparciu o różne modele matematyczne. Do rozwiązania problemów został wykorzystany rozproszony algorytm genetyczny z różnymi reprezentacjami chromosomu oraz operatorami genetycznymi, dostosowanymi do specyfiki danego problemu. W ten sposób wykazana została uniwersalność zaproponowanego systemu i jego zdolność do rozwiązywania rzeczywistych problemów zarządzania produkcją.
The article presents a modern system of distributed computing, allowing easy use of available computational resources of the company. The developed system allows for the generation of production plans based on various mathematical models. A distributed genetic algorithm with different solution representations and different genetic operators tailored to the specific problem is used to solve the problems. In this way, the universality of the proposed system and its ability to solve real problems of production management were demonstrated.
Źródło:
Prace Naukowe Akademii im. Jana Długosza w Częstochowie. Technika, Informatyka, Inżynieria Bezpieczeństwa; 2018, T. 6; 355-369
2300-5343
Pojawia się w:
Prace Naukowe Akademii im. Jana Długosza w Częstochowie. Technika, Informatyka, Inżynieria Bezpieczeństwa
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Online optimization of a preview controller - structure and algorithms
Bieżąca optymalizacja sterowania typu "preview", jego struktura i algorytmy optymalizacji
Autorzy:
Luckel, J.
Munch, E.
Vocking, H.
Hestermeyer, T.
Powiązania:
https://bibliotekanauki.pl/articles/280386.pdf
Data publikacji:
2005
Wydawca:
Polskie Towarzystwo Mechaniki Teoretycznej i Stosowanej
Tematy:
mechatronika
nauczanie
dystrybucja optymalizacji
aktywne zawieszenia
koleje
mechatronics
learning
distributed optimization
active suspension
railway systems
Opis:
Active suspension systems are used to increase ride comfort and safety of vehicles. Optimal results can be achieved if disturbances from the track are known in advance. Usually, this causes a problem as track excitations cannot be measured until they take effect on the vehicle. Here, we present an approach to disturbance compensation for railway vehicles coupled in a network. Information on stationary arising track disturbances are gathered by vehicles and stored locally at track sections. By repeated runs over a respective section this information is iteratively optimized and can be used for the disturbance compensation in subsequent vehicles. The developed optimization algorithm is described. Design criteria are derived from digital control theory. The procedure was implemented on a testbed for a semi-vehicle with three degrees of freedom, where its usability was proved. The results are discussed and, finally, some aspects of generalization are considered.
Układy zawieszeń aktywnych stosowane są w celu zwiększenia komfortu i bezpieczeństwa ruchu pojazdów. Optymalne parametry pracy takich zawieszeń uzyskuje się, gdy zaburzenia od drogi znane są z góry. Zwykle jednak zaburzenia te mogą być dopiero zmierzone, gdy zaczynają już oddziaływać na pojazd. W pracy zaprezentowano metodę kompensacji zakłóceń ruchu na przykładzie pojazdów szynowych poruszających się w sieci. Informacje o nierównościach toru pojawiających się stacjonarnie zbierane są i przechowywane dla poszczególnych sekcji toru. Poprzez kolejne przejazdy pociągów wzdłuż tych sekcji informacje są iteracyjnie optymalizowane tak, aby mogły zostać wykorzystane przez następny pociąg. W artykule opisano zaproponowany algorytm optymalizacji. Kryteria strukturalne procedury zaczerpnięto z teorii sterowania cyfrowego. Algorytm wdrożono do stanowiska doświadczalnego modelu pociągu o trzech stopniach swobody. Badania pokazały skuteczność wprowadzonej metody sterowania. Rezultaty badań przedyskutowano także pod kątem możliwości ich uogólnienia na inne typy pociągów.
Źródło:
Journal of Theoretical and Applied Mechanics; 2005, 43, 3; 575-591
1429-2955
Pojawia się w:
Journal of Theoretical and Applied Mechanics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Zaawansowane algorytmy przetwarzania sygnałów, cyfrowego sterowania i optymalizacji w systemach dynamicznych
Advanced algorithms for signal processing, digital control and optimization in dynamical systems
Autorzy:
Byrski, W.
Grega, W.
Turnau, A.
Powiązania:
https://bibliotekanauki.pl/articles/154242.pdf
Data publikacji:
2007
Wydawca:
Stowarzyszenie Inżynierów i Techników Mechaników Polskich
Tematy:
dokładna obserwacja stanu
komputerowe systemy sterowania rozproszonego
systemy nieliniowe
exact state observation
distributed computer control systems
nonlinear systems
Opis:
Artykuł przedstawia prace badawcze prowadzone w ostatnich latach w zespole Laboratorium Sterowania, Katedry Automatyki. Prace dotyczą nowych zagadnień i algorytmów przetwarzania sygnałów pomiarowych dla celów dokładnej obserwacji stanu oraz nowych metod sterowania rozproszonego i sterowania optymalnego w układach nieliniowych, takich jak kompleksowe procesy wymiany masy i energii (proces destylacji, proces dystrybucji energii cieplnej, układ zbiorników, nagrzewnica powietrza), lewitacja magnetyczna, wahadło zawieszone na wózku, ciężki łańcuch obciążony masą, trójwymiarowa suwnica i manipulator-robot.
The paper presents research works conducted during last years by the team of Control Laboratory in the Department of Automatics. Researches are concerned with new algorithms of measurement signal processing for exact state observation as well as new distributed control methods and optimal control of nonlinear systems such as: mass and energy exchange systems (distillation process, heat energy distribution process, tank system, air blow heater), magnetic levitation, pendulum on a cart system, heavy chain with payload, 3D crane and robot - manipulator.
Źródło:
Pomiary Automatyka Kontrola; 2007, R. 53, nr 3, 3; 9-25
0032-4140
Pojawia się w:
Pomiary Automatyka Kontrola
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Heuristic algorithms for joint optimization of unicast and anycast traffic in elastic optical network-based large-scale computing systems
Autorzy:
Markowski, M.
Powiązania:
https://bibliotekanauki.pl/articles/330713.pdf
Data publikacji:
2017
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
elastic optical network
joint optimization
distributed data center
metaheuristic algorithm
tabu search
elastyczna sieć optyczna
optymalizacja wspólna
baza danych rozproszona
algorytm heurystyczny
metoda tabu search
Opis:
In recent years elastic optical networks have been perceived as a prospective choice for future optical networks due to better adjustment and utilization of optical resources than is the case with traditional wavelength division multiplexing networks. In the paper we investigate the elastic architecture as the communication network for distributed data centers. We address the problems of optimization of routing and spectrum assignment for large-scale computing systems based on an elastic optical architecture; particularly, we concentrate on anycast user to data center traffic optimization. We assume that computational resources of data centers are limited. For this offline problems we formulate the integer linear programming model and propose a few heuristics, including a meta-heuristic algorithm based on a tabu search method. We report computational results, presenting the quality of approximate solutions and efficiency of the proposed heuristics, and we also analyze and compare some data center allocation scenarios.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2017, 27, 3; 605-622
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Multi-objective optimal allocation and sizing of hybrid photovoltaic distributed generators and distribution static var compensators in radial distribution systems using various optimization algorithms
Autorzy:
Zellagui, Mohamed
Belbachir, Nasreddine
El-Bayeh, Claude Ziad
Bekkouche, Benaissa
Powiązania:
https://bibliotekanauki.pl/articles/41185993.pdf
Data publikacji:
2023
Wydawca:
Politechnika Warszawska, Instytut Techniki Cieplnej
Tematy:
renewable sources
radial distribution system
photovoltaic distributed enerators
distribution static var compensator
źródła odnawialne
systemy dystrybucji promieniowej
generator fotowoltaiczny
Opis:
In the recent years, a considerable growth was about the integration of renewable sources in the Radial Distribution Systems (RDS), as Photovoltaic Distributed Generators (PVDG) due to their importance in achieving plenty desired technical and economic benefits. Implementation of the Distribution Static Var Compensator (DSVC) in addition to the PVDG would be one of the best choices that may provide the maximum of those benefits. Hence, it is crucial to determine the optimal allocation of the devices (PVDG and DSVC) into RDS to get satisfactory results and solutions. This paper is devoted to solving the allocation problem (location and sizing) of hybrid PVDG and DSVC units into the standards test systems IEEE 33-bus and 69-bus RDSs. Solving the formulated problem of the optimal integration of hybrid PVDG and DSVC units are based on minimizing the proposed Multi-Objective Functions (MOF) which is represented as the sum of the technical-economic parameters of Total Active Power Loss (TAPL), Total Reactive Power Loss (TRPL), Total Voltage Deviation (TVD), Total Operation Time (TOT) of the overcurrent relays (OCRs) installed in the RDS, the Investment Cost of PVDGs (ICPVDG) and the Investment Cost of DSVC (ICDSVC)), by applying various recent metaheuristic optimization algorithms. The simulation results reveal the superiority and the effectiveness of the Slime Mould Algorithm (SMA) in providing the minimum of MOF, including minimization of the powers losses until 16.209 kW and 12.110 kVar for the first RDS, 4.756 kW and 7.003 kVar for the second RDS, enhancing the voltage profiles and the overcurrent protection system. Based on the paper’s results it is recommended to optimally integrate both PVDG and DSVC units into practical distribution networks.
Źródło:
Journal of Power Technologies; 2023, 103, 2; 89-103
1425-1353
Pojawia się w:
Journal of Power Technologies
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-25 z 27

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