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


Wyświetlanie 1-5 z 5
Tytuł:
Resource and Task Allocation Algorithm for WAN-based Distributed Computing Environment
Autorzy:
Markowski, M.
Powiązania:
https://bibliotekanauki.pl/articles/226934.pdf
Data publikacji:
2010
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
capacity and flow assignment problem
distributed computing
resource management
wide area networks
Opis:
In the paper an approximate algorithm for optimizing of distributed computing WAN network is proposed. Distributed computing systems become the common tools in different kind of business, science and even entertainment. In order to minimize processing time of data and utilize spare resources available on remote systems, many companies and institutions decide to build and maintain own wide area networks (WAN) for ensuring reliable and secure distributed processing of data. Design of WANs in concerned with solving different optimization problems, like routing assignment, capacities of channel selection, resource (i.e. servers, management centre) allocation. Due to peculiar structure of wide area networks and nature of protocols, proper optimization methods and algorithms should be constructed for WAN-based distributed computing systems. In the paper the model of the distributed environment, built on WAN infrastructure is presented. Then, the optimization problem for routing assignment, channel capacities assignment and grid management center (data repository) allocation is formulated. Finally, an approximate algorithm is presented for formulated problem. Proposed algorithm, observations and conclusions should effect in improving of distributed computing systems design.
Źródło:
International Journal of Electronics and Telecommunications; 2010, 56, 2; 197-202
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Permutation, no-wait, no-idle flow shop problems
Autorzy:
Makuchowski, M.
Powiązania:
https://bibliotekanauki.pl/articles/229973.pdf
Data publikacji:
2015
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
flow shop problem
permutation constraint
no-wait constraint
no-idle constraint
permutation-graph models
Opis:
The paper compares the schedules of different variants of the flow shop problem, i.e. permutation, no waiting and no idle flow shop problems. It is assessed the impact of the constraints on the extension of the schedules and correlations of the length of the schedules for these variants. It is also examined the effectiveness of a set of insert type algorithms. The efficiency of the algorithms is tested on well-known literature benchmarks.
Źródło:
Archives of Control Sciences; 2015, 25, 2; 189-199
1230-2384
Pojawia się w:
Archives of Control Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Application of electrical capacitance tomography and artificial neural networks to rapid estimation of cylindrical shape parameters of industrial flow structure
Autorzy:
Garbaa, H.
Jackowska-Strumiłło, L.
Grudzień, K.
Romanowski, A.
Powiązania:
https://bibliotekanauki.pl/articles/140587.pdf
Data publikacji:
2016
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
artificial neural networks
electrical capacitance tomography
flow parameters estimation
inverse problem
Opis:
A new approach to solve the inverse problem in electrical capacitance tomography is presented. The proposed method is based on an artificial neural network to estimate three different parameters of a circular object present inside a pipeline, i.e. radius and 2D position coordinates. This information allows the estimation of the distribution of material inside a pipe and determination of the characteristic parameters of a range of flows, which are characterised by a circular objects emerging within a cross section such as funnel flow in a silo gravitational discharging process. The main advantages of the proposed approach are explicitly: the desired characteristic flow parameters are estimated directly from the measured capacitances and rapidity, which in turn is crucial for online flow monitoring. In a classic approach in order to obtain these parameters in the first step the image is reconstructed and then the parameters are estimated with the use of image processing methods. The obtained results showed significant reduction of computations time in comparison to the iterative LBP or Levenberg-Marquard algorithms.
Źródło:
Archives of Electrical Engineering; 2016, 65, 4; 657-669
1427-4221
2300-2506
Pojawia się w:
Archives of Electrical Engineering
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Numerical modeling of heat and mass transfer in cylindrical ducts
Autorzy:
Duda, P.
Mazurkiewicz, G.
Powiązania:
https://bibliotekanauki.pl/articles/240939.pdf
Data publikacji:
2010
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
obliczenia numeryczne
przepływ burzliwy
przepływ laminarny
wymiana ciepła
Graetz problem
heat transfer
laminar and turbulent flow
numerical solution
Opis:
In this work, numerical modeling of steady state heat and mass transfer is presented. Both laminar and hydrodynamically fully developed turbulent flow in a pipe are shown. Numerical results are compared with values obtained from analytical solution of such problems. The problems under consideration are often denoted as extended Graetz problems. They occur in heat exchangers using liquid metals as working fluid, in cooling systems for electric components or in chemical process lines. Calculations were carried out gradually decreasing the mesh size in order to examine the convergence of numerical method to analytical solution.
Źródło:
Archives of Thermodynamics; 2010, 31, 1; 33-43
1231-0956
2083-6023
Pojawia się w:
Archives of Thermodynamics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Network winner determination problem
Autorzy:
Kaleta, M.
Powiązania:
https://bibliotekanauki.pl/articles/229592.pdf
Data publikacji:
2018
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
network auctions
network winner determination problem (NWDP)
complexity of the NWDP
MILP models
multi-commodity flow optimization
graph models
Opis:
Many real-world marketplaces involve some additional constraints to be addressed during the market clearing process. This is the case of various infrastructure sectors of the economy, where market commodities are associated with some elements of the infrastructure, e.g., elements of telecommunication, power transmission or transportation network. Transactions are allowed only if the infrastructure, modeled as a flow network, is able to serve them. Determination of the best offers is possible by solving the optimization problem, so called the Winner Determination Problem (WDP). We consider a new subclass of the WDP, i.e., the Network Winner Determination Problem (NWDP). We characterize different poblems in the NWDP class and analyze their computational complexity. The sharp edge of tractability for NWDP-derived problems is generally designated by integer offers. However, we show that some specific settings of the problem can still be solved in polytime. We also presents ome exemplary applications of NWDP in telecommunication bandwidth market and electrical energy balancing market.
Źródło:
Archives of Control Sciences; 2018, 28, 1; 51-88
1230-2384
Pojawia się w:
Archives of Control Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-5 z 5

    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