Electronic modeling

Vol 44, No 1 (2022)

CONTENTS

Computatinal Processes and Systems

  SAUKH S.Ye., BORYSENKO A.V.
Unit Commitment Model with Cyclic Forecasting Period


3-28
  ROGOZA W., ISHCHENKO G.
Method for Forecasting Short-term Time Series Using Sensitivity Functions


29-42
  EFANOV D.V.
The Equal-length Redundant Code Development for the Self-checking Combinational Devices Synthesis Based on Data on their Structures

43-52

Parallel calculations

  CHEMERYS O.A., BORUKAYEV Z.Kh., BLINOV I.V.
Use of Loop Transformation Techniques to Optimize Parallel Applications

53-69

Application of Modeling Methods and Facilities

  PLESKACH B.M.
Computer Monitoring of Energy Consumption with Assessment of Hidden Energy Losses


70-80
  HONCHAROV V.V., CHORNY O.O.,SKARGA-BANDUROVA I.S, SAMOYLOV V.D.
Computer Simulation of the Results of Chromium, Molybdenum and Titanium Ion Implantation in the Surface of Stainless Steel


81-92
  YERMOSHYN V.V., KARASIUK G.O., HONCHAR S.F.
Research of Current Cyber Risks of Automated Technological Process Control Systems


93-106
  DAVYDIUK A.V.
The Artifacts Verification Approaches to Providing Critical Purpose Objects Cybersecurity Process

107-117

Short notes

  KUTSAN Yu.G.
Proceedings of the meeting of public council at the Ministry of Energy of Ukraine

118-123

UNIT COMMITMENT MODEL WITH CYCLIC FORECASTING PERIOD

S.Ye Saukh, A.V. Borysenko

Èlektron. model. 2021, 44(1):03-29

https://doi.org/10.15407/emodel.44.01.003

ABSTRACT

Well known Unit Commitment (UC-) models of loading generating units of power systems have a common feature: they are all determined on the basis of linear time, where there are past, current and future periods. UC-models are "tied" to the initial conditions and, therefore, cannot cover long-term forecasting horizon due to the excessive computational complexity of algorithms using to solve large-scale integer programming problems. To eliminate such an insurmountable limitation in the application of UC-models, the UC-model of loading generating blocks on the cyclic forecasting horizon (UCC-model) is proposed. The UCC model reproduces block-loading modes on a cyclical weekly forecast horizon and does not require initial conditions, as it establishes a relationship between the states of generating blocks at the end and beginning of the forecast horizon. The weekly distance of the extreme points of the forecast horizon in the UCC model can significantly reduce the interaction of the conditions of cyclic loading of blocks. The UCC model adequately reflects the loading modes of generating units of NPP, TPP, powerful CHTPP, HPP and energy storage systems, including powerful PSP. The UCC model is a multi-node model and takes into account the limitations on the volume of electricity transmission by interconnection power lines. The UCC model takes into account system-wide requirements for the placement of primary and secondary power reserves on loaded units, including energy storage systems. The UCC model is a tool for analyzing the adequacy of shunting power in the tasks of medium- and long-term forecasting of power systems development in terms of increasing electricity production of wind and solar power plants.

KEYWORDS

power system, model, loading of generating units, cyclic forecasting horizon.

REFERENCES

  1. Gaur,S., Das, P., Jain, A., Bhakar, R. and Mathur, J. (2019), “Long-term energy system planning considering short-term operational constraints”, Energy Strategy Reviews, Vol. 26, pp. 1562–1568.
    https://doi.org/10.1016/j.esr.2019.100383
  2. Arroyo, J.M. and Conejo, A.J. (2004), “Modeling of Start-Up and Shut-Down Power Trajectories of Thermal Units”, IEEE Transactions on Power Systems, 19, no. 3, pp. 1562–1568.
    https://doi.org/10.1109/TPWRS.2004.831654
  3. Arroyo, J.M. and Conejo, A.J. (2002), “Optimal Response of a Power Generator to Energy, AGC, and Reserve Pool-Based Markets”, IEEE Transactions on Power Systems, 17, no. 2, pp. 404–410.
    https://doi.org/10.1109/TPWRS.2002.1007910
  4. Carrión, M. and Arroyo, J.M. (2006), “A Computationally Efficient Mixed-Integer Linear Formulation for the Thermal Unit Commitment Problem”, IEEE Transactions on Power Systems, 21, no. 3, pp. 1371–1378.
    https://doi.org/10.1109/TPWRS.2006.876672
  5. Soroudi, A. (2017), Power System Optimization Modeling in GAMS,
    https://doi.org/10.1007/978-3-319-62350-4
  6. Bergh, K., Bruninx, K., Delarue, E. and D’haeseleer, W. (2016), LUSYM: a unit commitment model formulated as a mixed-integer linear program, KU Leuven Energy Institute, Belgium.
  7. Shulzhenko, S.V., Turutikov, O.I. and Tarasenko, P.V. (2019), “Model of mathematical programming with integer variables for determining the optimal regime of loading of hydroelectric pumped storage power plants for balancing daily profile of electric loads of the power system of Ukraine”, Problemy zahalʹnoyi enerhetyky, 59, no. 4, pp. 13–23.
    https://doi.org/10.15407/pge2019.04.013
  8. Stetsyuk, P.I., Zhurbenko, M.G. and Likhovid, O.P. (2012), Matematychni modeli ta prohramne zabezpechennya v zadachakh enerhetyky [Mathematical models and software in energy problems], Instytut kibernetyky im. V.M. Hlushkova, Kyiv, Ukraine.
  9. Hong, Y.-Y. and Francesco, G. (2021), Uncertainty in Unit Commitment in Power Systems: A Reviewof Models, Methods, and Applications, Energies, available at: https:// mdpi.com/1996-1073/14/20/6658/pdf.
    https://doi.org/10.3390/en14206658
  10. Voorspools, K.R. and D'haeseleer, W. (2003), “Long-term Unit Commitment optimisation for large power systems: Unit decommitment versus advanced priority listing, Applied Energy, Vol. 76, no. 1-3, pp. 157-167.
    https://doi.org/10.1016/S0306-2619(03)00057-6
  11. Hall, L.M.H. and Buckley, A.R. (2016), “A review of energy systems models in the UK: prevalent usage and categorization”, Applied Energy, Vol. 169, pp. 607-628, available at:
    https://doi.org/10.1016/j.apenergy.2016.02.044
  12. Saukh, S.Ye. and Borysenko, A.V. (2020), Matematychne modelyuvannya elektroenerhetyky v rynkovykh umovakh [Mathematical modeling of electric power in market conditions], "Try K", Kyiv, Ukraine.

Full text: PDF

 

METHOD FOR FORECASTING SHORT-TERM TIME SERIES USING SENSITIVITY FUNCTIONS

W. Rogoza, G. Ishchenko

Èlektron. model. 2021, 44(1):29-43

https://doi.org/10.15407/emodel.44.01.029

ABSTRACT

The article investigates the problem of forecasting time series in the conditions of a small amount of experimental data. The latter are presented in the form of samples that contain the values of the parameters of the object of study. To create predictive mathematical models, it is proposed to use second-order Kolmogorov-Gabor polynomials, the coefficients of which are calculated according to certain rules on the basis of experimental data (the stage of calculating these coefficients can be interpreted as model training). Because there is a small amount of experimental data, it is not possible to establish statistical characteristics of changes in the parameters of the object, so in these conditions, classical forecasting methods become inappropriate, and the reliability and accuracy of mathematical models is crucial. The article proposes an approach to building mathematical predictive models based on the principles of system identification, i,e, the object of research is considered as a "black box", data known from experiments - as input parameters, and predicted parameters - as output parameters of the conditional multiport. To predict the magnitude of each parameter of the object in future moments of time, several alternative mathematical models are created, called particular prediction models. To enhance the probability of a reliable prediction, among the alternative models are selected those models that meet certain conditions of reliability. of the proposed method.

KEYWORDS

time series, time-limited forecasting, small number of experimental samples, system identification.

REFERENCES

  1. Russel, S.T. and Norvig, P. (2003), Artificial Intelligence. A Modern Approach, Prentice Hall, New Jersey, USA.
  2. Witten, I.H. and Frank, E. (2005), Data Mining: Practical machine learning tools and techniques, Morgan Kaufmann, Prentice Hall, USA.
  3. Box, G. and Jenkins, G. (1970), Time Series Analysis: Forecasting and Control, Holden-Day, San Francisco, USA.
  4. Ljung, L. (1999), System Identification - Theory For the User. Prentice Hall, N.J., USA.
  5. Kalman, R.E. (1960), “A new approach to linear filtering and prediction problems”, Journal of Basic Engineering, Vol. 82, no. 1, pp. 35-45.
    https://doi.org/10.1115/1.3662552
  6. Ivakhnenko, A.G. (1982), Induktivny metod samoorganizacii modeley slozhnyh system [Inductive method of self-organization of complex systems], Naukova Dumka, Kyiv, Ukraine.
  7. Rogoza, W. (2019), “Method for the prediction of time series using small sets of experimental samples”, Applied Mathematics and Computation, Vol. 355, pp. 108-122.
    https://doi.org/10.1016/j.amc.2019.02.062

Full text: PDF

 

The equal-length redundant code development for the self-checking combinational devices synthesis based on data on their structures

D.V. Efanov, D.Sc.

Federal State Autonomous Educational Institution
of Higher Education "Russian University of Transport"

Russian Federation, 127994, Moscow, st. Obraztsova, 9, building 9

tel. (+7) (911) 7092164, e-mail: This email address is being protected from spambots. You need JavaScript enabled to view it.

Èlektron. model. 2021, 44(1):43-52

https://doi.org/10.15407/emodel.44.01.043

ABSTRACT

The problem of organizing the automation and computer technology combinational devices control with the diagnostic tools synthesized using redundant coding is considered. In contrast to the known approaches, a method is proposed for generating a uniform separable code, considering the structural features of the original combination devices. This method makes it possible to use data about possible errors at the outputs of the circuit in the code under construction and take this into account when synthesizing the control circuit. When setting the problem, a fault model is determined, relative to which the code will be built with the detection of all (or, possibly, part) errors at the circuit outputs. In contrast to the known redundant codes used to organize the combinational device’s control, the proposed method of generating a code makes it possible to consider the individual features of their structures. Such an approach in the self-checking combinational devices organization with an unchangeable design expands the number of ways to construct them compared to the previously known duplication and use of circuit outputs groups controlled by codes with unique diagnostic properties.

KEYWORDS

the self-checking combinational device, equal-length redundant code, error detection at the combinational device’s outputs, code construction “under the circuit”, a self-che­cking device structural redundancy.

REFERENCES

  1. Sogomonyan, E.S. and Slabakov, E.V. (1989), Samoproverjaemyje ustrojstva i otkazo­ustojchivyje sistemy [Self-checking devices and fault-tolerant systems], Radio i Svjaz`, Moscow, USSR.
  2. Piestrak, S.J. (1995), Design of Self-Testing Checkers for Unidirectional Error Detecting Codes, Oficyna Wydawnicza Politechniki Wrocłavskiej, Wrocław, Poland.
  3. Lala, P.K. (2001), Self-Checking and Fault-Tolerant Digital Design, Morgan Kaufmann Publishers, San Francisco, USA.
  4. Göessel, M., Ocheretny, V., Sogomonyan, E. and Marienfeld, D. (2008), New Methods of Concurrent Checking: Edition 1, Springer Science+Business Media B.V., Dordrecht,
  5. Drozd, A.V., Kharchenko, V.S. and Antoshchuk, S.G. (2012), Rabochee diagnostirovanie bezopasnykh informatsionno-upravljayustchikh sistem [Objects and Methods of On-Line Testing for Safe Instrumentation and Control Systems], National Aerospace University "KhAI", Kharkov, Ukraine.
  6. Sapozhnikov, V.V., Sapozhnikov, Vl.V. and Efanov, D.V. (2020), Kody s summirovaniem dlya sistem tekhnicheskogo diagnostirovaniya. Tom 1: Klassicheskie kody Bergera i ih modifikacii [Sum Codes for Technical Diagnostics Systems. Volume 1: Classical Ber­ger Codes and Their Modifications], Nauka, Moscow, Russia.
  7. Sapozhnikov, V.V., Sapozhnikov, Vl.V. and Efanov, D.V. (2021), Kody s summirovaniem dlya sistem tekhnicheskogo diagnostirovaniya. Tom 2: Vzveshennyje kody s summirovanijem [Sum Codes for Technical Diagnostics Systems. Volume 2: Weight-Based Sum Codes], Nauka, Moscow, Russia.
  8. Sapozhnikov V.V., Sapozhnikov Vl.V. and Efanov D.V. (2015), “Klassifikatsija oshibok v informatsionnykh vektorakh sistematicheskikh kodov”, Izvestiya Vysshikh Uchebnykh Zavedeniy. Priborostroenie, Vol. 58, no. 5, pp. 333—343,
    https://doi.org/10.17586/0021-3454-2015-58-5-333-343
  9. Berger, J.M. (1961), “А Note on Error Detecting Codes for Asymmetric Channels”, Information and Control, Vol. 4, no. 1, рp. 68—73, 
    https://doi.org/10.1016/S0019-9958(61)80037-5
  10. Freiman, C.V. (1962), “Optimal Error Detection Codes for Completely Asymmetric Binary Channels”, Information and Control, Vol. 5, no. 1, pp. 64—71.
    https://doi.org/10.1016/S0019-9958(62)90223-1
  11. Efanov, D.V., Sapozhnikov, V.V, and Sapozhnikov, Vl.V. (2017), “Usloviya obnaru­zheniya neispravnosti logicheskogo ehlementa v kombinacionnom ustrojstve pri funkcio­nal'nom kontrole na osnove koda Bergera”, Avtomatika i telemekhanika, Vol. 5, pp. 152—165.
  12. Sapozhnikov V.V., Sapozhnikov Vl.V. and Efanov D.V. (2020), “Obnaruzhenie neisprav­nostej v kombinacionnyh logicheskih skhemah na osnove ih kontrolya po gruppam simmetrichno nezavisimyh vyhodov”, Electronnoje Modelirovanije, Vol. 42, no. 2, pp. 3—23, https://doi.org/10.15407/emodel.42.02.003
  13. Efanov, D.V., Sapozhnikov, V.V. and Sapozhnikov, Vl.V. (2020), “Organization of a Fully Self-Checking Structure of a Combinational Device Based on Searching for Groups of Symmetrically Independent Outputs”, Automatic Control and Computer Sciences, Vol. 54, no. 4, рp. 279—290, 
    https://doi.org/10.3103/S0146411620040045
  14. Efanov, D., Sapozhnikov, Vl., Sapozhnikov, V. and Plotnikov, D. (2018), “The Evaluation of Error Detection Probability at the Outputs of Combinational Circuits Under Concurrent Error Detection on the Basis of Summation Codes”, Proceedings of 16th IEEE East-West Design & Test Symposium (EWDTS’2018), Kazan, Russia, September 14-17, 2018, pp. 154—158, 
    https://doi.org/10.1109/EWDTS.2018.8524735
  15. Zakrevskij, A., Pottosin, Yu. and Cheremisinova, L. (2009), Optimization in Boolean Space, TUT Press, Tallinn, Estonia.
  16. Gessel M., Morozov A.A., Sapozhnikov V.V. and Sapozhnikov Vl.V. (1997), “Issledovanie kombinacionnyh samoproveryaemyh ustrojstv s nezavisimymi i monotonno nezavisimymi vyhodami”, Avtomatika i telemechanika, Vol. 2, pp. 180—193.
  17. Efanov D.V., Sapozhnikov V.V. and Sapozhnikov Vl.V. (2018), “Sintez samoproveryaemyh kombinacionnyh ustrojstv na osnove vydeleniya special'nyh grupp vyhodov”, Avto­matika i telemekhanika, Vol. 9, pp. 79—94.
    https://doi.org/10.1134/S0005117918090060
  18. Sapozhnikov, V.V., Morosov, A., Sapozhnikov,Vl.V. and Göessel, M. (1998), “A New Design Method for Self-Checking Unidirectional Combinational Circuits”, Journal of Electronic Testing: Theory and Applications, Vol. 12, no. 1-2, рp. 41—53, 
    https://doi.org/10.1007/978-1-4757-6069-9_4
  19. Morosow, A, Sapozhnikov, V.V., Sapozhnikov, Vl.V. and Goessel, M. (1998), “Self-Checking Combinational Circuits with Unidirectionally Independent Outputs”, VLSI Design, Vol. 5, no. 4, рp. 333—345, 
    https://doi.org/10.1155/1998/20389

Full text: PDF

 

USE OF LOOP TRANSFORMATION TECHNIQUES TO OPTIMIZE PARALLEL APPLICATIONS

O.A. Chemerys, Z. Kh. Borukayev, I.V. Blinov

Èlektron. model. 2021, 44(1):53-68

https://doi.org/10.15407/emodel.44.01.053

ABSTRACT

The possibility of programs optimizing, in particular, existing parallel ones, is considered. Minimization of program execution time on a parallel computer system was chosen as the optimization function. To optimize, we use algorithms for affine transformation of the iterative space of loop operators, each of which is represented as a graph based on the dependencies between the operators that create relationships in the iteration graph of the loop operator. As an example, we consider the process of optimizing the software package MFDn, which is used in nuclear physics to find a multibody nuclear Hamiltonian. Optimized program run time decreasing is shown.

KEYWORDS

parallelization, program optimization, program transformation, affine transformations.

REFERENCES

  1. Sternberg, P. (2008), “Accelerating Configuration Interaction Calculations for Nuclear Structure”, Proceedings of the ACM/IEEE Conference on Supercomputing, Austin, TX, USA, рр. 1-12.
    https://doi.org/10.1109/SC.2008.5220090
  2. Collard, J.F. (1995), “Construction of do loops from systems of affine constraints”, Parallel Processing Letters, Vol. 5, pp. 421-436.
    https://doi.org/10.1142/S0129626495000394
  3. Chemeris, A., Gorunova, J. and Lazorenko, D. (2012), “Loop Nests Parallelization for Digital System Synthesis”, Proceedings of IEEE East-West Design & Test Symposium (EWDTS’2012), Kharkov, Ukraine, September 14–17, 2012, рр. 118-121.
  4. Bielecki, W. and Hyduke, S. (1999), “Kompilator jezyka VHDL do syntezy ukladow logicznych”, Reprogramowalne uklady cyfrowe (RUC’99), Szczecin, рр. 183-190.
  5. Lim, A.W. and Lam, M.S. (1995), “Communication-free parallelization via affine transformations”, Languages and Compilers for Parallel Computing: 7th International Workshop Ithaca, Berlin, Springer Berlin Heidelberg, рр. 92—106.
    https://doi.org/10.1007/BFb0025873
  6. Vasilache, N., Cohen, A. and Pouchet, L.-N. (2007), “Automatic Correction of Loop Transformations”, Parallel Architectures and Compilation Techniques, Conference Proceedings, PACT, Brasov, Romania, рр. 292-304.
    https://doi.org/10.1109/PACT.2007.4336220
  7. Fraboulet, A., Huard, G. and Mignotte, A. (1999), “Loop Alignment for Memory Accesses Optimization”, Twelfth International Symposium on System Synthesis, Piscataway, NJ, USA, рр. 71–77.
  8. Aktulga, H.M., Buluç, A., Williams, S. and Yang, C. (2014), “Optimizing Sparse Matrix-Multiple Vectors Multiplication for Nuclear Configuration Interaction Calculations”, 2014 IEEE 28th International Parallel and Distributed Processing Symposium, pp. 1213-1222, 
    https://doi.org/10.1109/IPDPS.2014.125
  9. Bielecki, W. (2003), “Finding Synchronization - Free Parallelism for Non-uniform Loops”, Proceedings of the Computational Science (ICCS 2003), Lecture Notes in Computer Science, Vol. 2658, pp. 925-934.
    https://doi.org/10.1007/3-540-44862-4_100

Full text: PDF