Implications of Computational Thinking in the Initial Training of Future Primary and Pre-School Teachers by Gabriela Mestic, Anca Ani-Rus, Horațiu Catalano, Andreea-Ionela Dohotaru, Ana Rus

“…Computational thinking is defined as a process of breaking down a problem into steps that are simple enough to understand, identifying solutions that can lead to automation. …”
Get full text

Computational Study of the Yield of Solid Wood Pyrolysis Products under High Pressure by S. V. Vasilevich, M. V. Malko, D. V. Degterov, A. N. Asadchyi

“…Based on the developed model, a computer program for calculating the main parameters of the pyrolysis process under pressure was created and the mass yield of solid pyrolysis products under various conditions was calculated. …”
Get full text

SIMULATION OF COMPUTER NETWORK LOAD PARAMETERS OVER A GIVEN PERIOD OF TIME by Yurii Davydovskyi, Oleksandr Reva, Olesia Artiukh, Viktor Kosenko

“…The article deals with the processes of data transmission on computer networks in terms of functional and non-functional indicators of network performance. …”
Get full text

Paediatric computed tomography diagnostic reference levels in Africa: A systematic review by Emmanuel Gyan, Christiana Subaar, George Edusei, Linda Antwi Nyarko

“…Two reviewers were involved in the article selection process which involved a three‐stage screening process of identifying; article titles, abstracts and full‐test reading. …”
Get full text

Computer «ProNRS-І» System and Energy-Saving Problems in Ingot Metallurgy by A. N. Chichko, Yu. V. Yatskevich

“…Models for computer analysis of crystallization process in metallurgical ingots obtained as a result of continuous steel casting are proposed in the paper. …”
Get full text

Basic Principles of Industrial Electric Power Network Computer Aided Design and Engineering by M. I. Fursanov, I. I. Dul

“…A conceptual model for a computer aided design and engineering system has been developed in the paper. …”
Get full text

Library as Laboratory: Computer Science Students Practice Usability Engineering in an Academic Library. by Margaret Mellinger

Get full text

A Quantum Processing Framework for Quantum Algorithms by Mohammad Reza Soltan Aghaei, Zuriati Ahmad Zukarnain

“…The framework is used to increase the implementation performance of quantum algorithms and design Quantum Processing Units (QPU). The framework shows a general plan for the architecture of quantum processors who is capable of run the quantum algorithms. …”
Get full text

Analysis on Computer Interlocking Logic Design for Main Line of Urban Rail Transit by LIANG Yun-peng, WANG Cheng, LV Hao-jiong

“…Based on the investigation and analysis, the proposed computer interlocking logic design for main line of urban rail transit was expected to meet the requirement of customers and speed up the process of localization of urban rail transit signal system.…”
Get full text

Comparative Analysis of Computed Tomography and Laparoscopy Data in Preoperative Staging of Gastric Cancer by N. K. Silanteva, T. A. Аgababyan, A. A. Kholeva, V. Yu. Skoropad, Z. N. Shavladze, S. A. Ivanov, L. P. Zhavoronkov

“…Objective: to compare the data of computed tomography (CT) and diagnostic laparoscopy (DL) in the preoperative estimation of the extension of gastric cancer.Material and methods. …”
Get full text

From Viewing to Structure: A Computational Framework for Modeling and Visualizing Visual Exploration by Kuan-Chen Chen, Chang-Franw Lee, Teng-Wen Chang, Cheng-Gang Wang, Jia-Rong Li

“…This study proposes a computational framework that transforms eye-tracking analysis from statistical description to cognitive structure modeling, aiming to reveal the organizational features embedded in the viewing process. …”
Get full text

Effects of Limited Computational Precision on the Discrete Chaotic Sequences and the Design of Related Solutions by Chunlei Fan, Qun Ding

“…In this paper, we analyzed the periodicity of discrete Logistic and Tent sequences with different computational precision in detail. Further, we found that the process of iterations of the Logistic and Tent mapping is composed of transient and periodic stages. …”
Get full text

Computer Simulation of Amino Acid Oligomerization in Aqueous Solutions Induced by Condensing Agent by Maxim Lubov, Yuri Trushin, Igor Eliseev, Ivan Terterov, Michael Dubina

“…Growth model of the L-Glu monomer chain induced by the condensing agent in the aqueous solutions with and without metal ions was proposed. Computer simulation of oligomerization process was conducted and from the comparison of the calculated and experimental data attachment energy of the Leuchs anhydride of L-Glu to the oligomer was estimated.…”
Get full text

Impossibility Results for Byzantine-Tolerant State Observation, Synchronization, and Graph Computation Problems by Ajay D. Kshemkalyani, Anshuman Misra

“…This paper considers the solvability of several fundamental problems in asynchronous message-passing distributed systems in the presence of Byzantine processes using distributed algorithms. These problems are the following: mutual exclusion, global snapshot recording, termination detection, deadlock detection, predicate detection, causal ordering, spanning tree construction, minimum spanning tree construction, all–all shortest paths computation, and maximal independent set computation. …”
Get full text

Evapotranspiration Dynamics and Partitioning in a Grassed Vineyard: Ecophysiological and Computational Modeling Approaches by Flávio Bastos Campos, Torben Oliver Callesen, Carina Verónica Gonzalez, Giorgio Alberti, Leonardo Montagnani, Massimo Tagliavini, Jacob A. Nelson, Damiano Zanotelli

Get full text

Enhancing classroom learning through computer-mediated reflective writing and peer feedback by Lok Tik Ruth Ong, Richard Pemberton

“… This research was initiated to gauge students' perception of computer-mediated journaling as a way to enhance classroom learning experience through a limited style of blogging. …”
Get full text

Efficient Computation of Collatz Sequence Stopping Times: A Novel Algorithmic Approach by Eyob Solomon Getachew, Beakal Gizachew Assefa

“…The Collatz conjecture, which posits that any positive integer will eventually reach 1 through a specific iterative process, is a classic unsolved problem in mathematics. …”
Get full text

HR Management Big Data Mining Based on Computational Intelligence and Deep Learning by Genliang Zhao, Zhe Xue

Get full text

Efficient algorithm for calculating short cycles in Tanner graph based on matrix computation by Qing ZHU, Le-nan WU, Yong-biao YANG, Jie LI, Shi-ming XU

“…Loop distribution of Tanner graph affects the BER performance of low-density parity-check codes(LDPC) decoding.To count short cycles in the Tanner graph efficiently,a side by side recursion algorithm based on matrix computation was proposed.Firstly,5 basic graph structures were defined to realize recursive calculate in the implementation process.Compared with previous works,the algorithm provided many methods for counting the same length of cycles.The same result confirmed the correctness of the algorithm.The new algorithm could not only calculate the total number of cycles,but also gave the number each edge participating in fixed-length cycles.Its complexity was proportional to the product of D and square of N,where D was the average degree of variable nodes,and N denoted the code length.For LDPC codes,D was far less than N.For most of the LDPC codes,the calculation for numbers of cycle-length g、g+2、g+4 was only several seconds.…”
Get full text

Efficient algorithm for calculating short cycles in Tanner graph based on matrix computation by Qing ZHU, Le-nan WU, Yong-biao YANG, Jie LI, Shi-ming XU

“…Loop distribution of Tanner graph affects the BER performance of low-density parity-check codes(LDPC) decoding.To count short cycles in the Tanner graph efficiently,a side by side recursion algorithm based on matrix computation was proposed.Firstly,5 basic graph structures were defined to realize recursive calculate in the implementation process.Compared with previous works,the algorithm provided many methods for counting the same length of cycles.The same result confirmed the correctness of the algorithm.The new algorithm could not only calculate the total number of cycles,but also gave the number each edge participating in fixed-length cycles.Its complexity was proportional to the product of D and square of N,where D was the average degree of variable nodes,and N denoted the code length.For LDPC codes,D was far less than N.For most of the LDPC codes,the calculation for numbers of cycle-length g、g+2、g+4 was only several seconds.…”
Get full text