Wyniki wyszukiwania - BazTech

1

Graph models with multiple Bayesian networks

Shayakhmetova Assem

Przegląd Elektrotechniczny

|

2020

|

R. 96, nr 12

252--255

EN

This paper is devoted to some issues of using multiple Bayesian networks in the various applied problems. Sometimes we deal with applied problems that are difficult to describe with a model that is represented by only one Bayesian network. At the same time, the considered problem may contain blocks with various types of uncertainties that can be well described by multiple Bayesian networks. Even if the problem can be described by only one Bayesian network, the size of this network could be so large that it will be impossible to find the solution with the help of existing software products. In this case, it is better to decompose in some way this large Bayesian network into several smaller ones. However, existing software products are poorly adapted to work with several Bayesian networks simultaneously. In this project, we develop and describe a software product that allows us to work with several Bayesian networks simultaneously.

PL

Artykuł ten jest poświęcony niektórym zagadnieniom związanym z wykorzystaniem szeregu sieci bayesowskich w różnych obszarach zastosowań. Czasami mamy do czynienia z zagadnieniami stosowanymi, które są trudne do opisania za pomocą modelu, który jest reprezentowany przez pojedynczą sieć Bayesa. Jednocześnie, rozważany problem może zawierać bloki z różnymi rodzajami niepewności, które mogą być dobrze opisane przez wiele sieci Bayesa. Nawet jeśli problem może być opisany tylko przez jedną sieć Bayesa, rozmiar tej sieci może być tak duży, że niemożliwe będzie znalezienie rozwiązania przy pomocy istniejącego oprogramowania. W tym przypadku lepiej jest rozłożyć w jakiś sposób tę dużą sieć na kilka mniejszych. Istniejące oprogramowanie jest jednak słabo przystosowane do pracy z kilkoma sieciami jednocześnie. W tym celu opracowaliśmy i opisaliśmy oprogramowanie, które pozwala nam na pracę z kilkoma sieciami Bayesa jednocześnie.

2

Network winner determination problem

Kaleta M.

Archives of Control Sciences

|

2018

|

Vol. 28, No. 1

51--88

EN

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.

3

Multi-agent parallel implementation of VLSI CAD procedures

Doudkin A. A., Petrovsky A. I., Otvagin A V., Sadyhov R. Kh.

Journal of Research and Applications in Agricultural Engineering

|

2013

|

Vol. 58, nr 1

35--38

EN

The integrated framework for parallel processing of data describing integrated circuits layouts that based on a graphoriented parallel algorithm representation is represented. A parallel program is developed from single computational units (grains) in specialized visual editor. This visual schema is translated into XML form that is interpreted by multi agent runtime system, based on a MPI library. The runtime system realizes a dynamic optimization of parallel computations with the algorithm of virtual associative network. The proposed tools are well suited for rapid development, analysis and execution of parallel algorithms with adaptation to specific cluster architecture.

4

Verification of Design Decisions

Tkachenko S.

Machine Dynamics Research

|

2011

|

Vol. 35, No. 3

74-78

EN

Each level of the design of complex objects and systems requires, as a rule, the verification of the results of design. In the problems of synthesis and optimization of the design object model that represents it, maybe a graph or hypergraph. In this case, the comparison of the results of a design phase with the reference input for the design for this phase can be reduced to establish the isomorphism pair of graphs. Similar problems arise when typing or unifying structure design objects that correspond to models on graph search in a graph or isomorphic subgraphs isomorphic embedding of a graph into a graph of higher dimension. Algorithms for solving these problems, which use the parallel method (optimal reduction), which has polynomial computational complexity. Software implementation of algorithms confirms the possibility of their effective use.