FAST NETWORK CODING SIMULATION WITH PARALLELIZATION OF PROCESSES IN THE DTSMS SYSTEM

2021 ◽  
Author(s):  
С.С. ВЛАДИМИРОВ
Keyword(s):  
Network Coding ◽  
Network Model ◽  
Computer Algebra ◽  
Computer Algebra System ◽  
Simulation System ◽  
Butterfly Network ◽  
Fast Network ◽  
Multicore Computers ◽  
Simulation Time

Изложены принципы быстрого имитационного моделирования процедур сетевого кодирования с распараллеливанием процессов в многоядерных ЭВМ на основе разработанной системы моделирования DTSMS. Представлены способы и схемы взаимодействия элементов модели с реализацией модели сети в соответствии с общепринятой в сетевом кодировании архитектурой «бабочка» для последовательного и асинхронного режимов работы. Выполнена оценка объема выделяемой памяти и времени моделирования для DTSMS в сравнении с реализацией на открытой системе компьютерной алгебры GNU/Octave. The principles of fast network coding simulation with parallelization of processes in multicore computers based on the developed DTSMS simulation system are stated. Methods and schemes of the sequential and asynchronous model elements interaction within the framework of the "butterfly" network model architecture generally accepted in network coding are presented. The allocated memory amount and simulation time for DTSMS are estimated in comparison with the open computer algebra system GNU/Octave.

Continuous-variable quantum network coding protocol based on butterfly network model

2020 ◽  
Vol 32 (2) ◽  
pp. 69
Author(s):  
Zhiguo Qu ◽  
Zhexi Zhang ◽  
Mingming Wang ◽  
Shengyao Wu ◽  
Xiaojun Wang
Keyword(s):  
Network Coding ◽  
Network Model ◽  
Continuous Variable ◽  
Quantum Network ◽  
Butterfly Network ◽  
Quantum Network Coding

Continuous-variable quantum network coding protocol based on butterfly network model

2020 ◽  
Vol 32 (2) ◽  
pp. 69
Author(s):  
Shengyao Wu ◽  
Xiaojun Wang ◽  
Mingming Wang ◽  
Zhiguo Qu ◽  
Zhexi Zhang
Keyword(s):  
Network Coding ◽  
Network Model ◽  
Continuous Variable ◽  
Quantum Network ◽  
Butterfly Network ◽  
Quantum Network Coding

Generation of Correlated Logistic-Normal Random Variates for Medical Decision Trees

1998 ◽  
Vol 37 (03) ◽  
pp. 235-238 ◽  
Author(s):  
M. El-Taha ◽  
D. E. Clark
Keyword(s):  
Monte Carlo ◽  
Decision Trees ◽  
Computer Algebra ◽  
Taylor Series ◽  
Computer Algebra System ◽  
Random Variable ◽  
Monte Carlo Analysis ◽  
Normal Random Variable ◽  
Medical Decision ◽  
Theoretical Results

AbstractA Logistic-Normal random variable (Y) is obtained from a Normal random variable (X) by the relation Y = (ex)/(1 + ex). In Monte-Carlo analysis of decision trees, Logistic-Normal random variates may be used to model the branching probabilities. In some cases, the probabilities to be modeled may not be independent, and a method for generating correlated Logistic-Normal random variates would be useful. A technique for generating correlated Normal random variates has been previously described. Using Taylor Series approximations and the algebraic definitions of variance and covariance, we describe methods for estimating the means, variances, and covariances of Normal random variates which, after translation using the above formula, will result in Logistic-Normal random variates having approximately the desired means, variances, and covariances. Multiple simulations of the method using the Mathematica computer algebra system show satisfactory agreement with the theoretical results.

The Maple computer algebra system: A review

1995 ◽  
Vol 10 (3) ◽  
pp. 329-337 ◽  
Author(s):  
John Hutton ◽  
James Hutton
Keyword(s):  
Computer Algebra ◽  
Computer Algebra System ◽  
System A
Sign in / Sign up

Export Citation Format

Share Document