Program Code Research Articles

Vulnus Web: A Web-Based Procedure for the Seismic Vulnerability Assessment of Masonry Buildings

Masonry is a widespread construction system, but it is very prone to seismic damage. In Italy, almost 60% of residential buildings are constructed in masonry, and 85% of them were built before 1980 without specific design regulation; thus, there is the need for large-scale vulnerability assessment. When large stocks of residential buildings (>50–100) are involved, also in historical centers, seismic vulnerability analysis must resort to simplified and computer-aided methods. Among these, the best known analyze (i) the overall shear strength normalized to the weight; (ii) the activation coefficient of local mechanisms; and (iii) dimensionless indexes obtained from the weighted sum of scores associated with a set of vulnerability factors. The Vulnus procedure proposes a vulnerability function in the 3D space defined by these factors, namely VIP, VOP and VV. The ‘mechanical’ indexes VIP and VOP determine the capacity of the building (in-plane and out-of-plane, respectively), whereas the ‘empirical’ index VV sets the pace at which this capacity is reached and the uncertainty in its final value. The procedure considers the confidence level of the indexes by means of fuzzy set theory, which enables expression of the vulnerability in linguistic terms (e.g., ‘high’ or ‘low’), as well as through a fragility curve. In this paper, a web toolbox based on the Vulnus procedure, namely, Vulnus Web, is proposed. It enables the central archiving of data, improved interaction with the program code and a wider dissemination. The new procedure was applied to a masonry building hit by the Central Italy 2016 earthquake; both the vulnerability level assessed numerically and the damage prediction were in good accordance with the actual seismic performance of the building.

Accuracy Comparison of Data Mining Methods for Internet Gaming Disorder Classification

Excessive access to online games by players can lead to addiction. Online game addiction can be detected through various ways including self-report questionnaires. Based on the value of the answers in the questionnaire a person can be categorized into groups, mild addiction, moderate addiction and severe addiction. Generally, this assessment calculation is done manually or through procedural programming languages. This is not efficient for processing more and more data, for that the mechine learning classification model is applied to solve the problem of program code repetition. This study compared the performance of three mechine learning methods against two different types of questionnaires, namely questionnaires with Likert scale and questionnaires with yes no type. The case study used in this study is online game addiction among high school students in Banda Aceh City, Indonesia. This research successfully proved that the algorithm ... It is better to use questionnaires with data types...., while algorithms....are better to use for questionnaires with types.....with the accuracy of the three algorithms are as follows. This study reveals the emergence of online game addiction, especially among high school students within Banda Aceh city. The results depicted that as many as 6% of high school students in the city of Banda Aceh indicated experiencing online game addiction based on their reports. Another objective of this research is to find the best accuracy between Naive Bayes and Support vector machine (SVM) in classifying the severity of the online game. It found that SVM accuracy was higher than Naive Bayes for the case of online game addiction level classification in high school students in Banda Aceh. This study provided baseline data for further research.

DESIGN AND SIMULATION OF THE MANUFACTURING PROCESS PLAY HINO TRUCK VEHICLE SHAFT USING THE MASTERCAM X5 TO GENERATE G-CODE

In its development, every manufacturing industry increasingly makes people think more creatively and are faced with new problems, especially in making new innovations. The purpose of these production issues is to achieve faster and more efficient production targets. The metal machining process is an important factor to support the quality of the final product, but there is one obstacle that must be faced.The main shaft is a component on hino truck vehicles, to produce components that are precise in terms of size and good surfaces are used for machining processes using a CNC machine, to simplify the manufacturing process, it is assisted by the Cam X5 master program to produce the G Code program to be used on the machine CNC. The manufacturing process uses a CNC Turning Machine.This research is an application of the CAD CAM course, the mastercam software application is very helpful in component manufacturing innovation. The main shaft is a form of a product resulting from the machining process, the material for the main shaft is made of AISI 1050 material

VERIFICATION OF THE WAVE FACTORIZATION METHOD FOR CALCULATION OF DISTRIBUTED SYSTEMS DURING TOWING IN A FLOW IN ACCELERATION MODE

For purposes of asymmetric confrontation with the Russian Navy, distributed systems (DS; cable, tethered, etc.) for unmanned underwater vehicles need further development and improvement. To date, specifics and methods of designing such DSs are insufficiently covered in scientific and technical literature. Distributed systems include towed systems of constant or variable length in a flow of liquid, underwater communication cables, pillars of offshore oil platforms, etc. This definition includes mechanical objects with one of the linear dimensions at least 10 – 20 times larger than the other two. The main limitations for application of the finite difference method (FDM) for numerical modeling of wave propagation and reflection in DS are the peculiarities of the defining quasi-linear equations. They are related to the need of simultaneous calculation of variables responsible for fast and slow wave processes. The term "singularly perturbed system of equations" is used for such systems of equations. These perturbations are the result of a significant difference in propagation velocities of longitudinal, configurational, bending, and torsional waves in DS at the physical level, etc. In this regard, it is necessary to apply the special step-by-step methods of regularization and filtering of numerical results. This imposes certain limitations on the possibility of simulating real processes and on the accuracy of obtained results, and forces the use of the implicit difference schemes and high-frequency filtering. The method of parallelization of the finite-difference operator and the program code according to the wave type is considered. The idea of parallelization by waves is based on the physical feature of propagation of different types of waves in distributed systems – a difference of 10 – 100 or more times between the propagation velocities of the longitudinal, transverse (configurational), bending and torsional waves in DS. The increase in productivity of the MPI version of a programming code when performing calculations on the SMP system is on average at least 30 – 100%, depending on the required accuracy of calculations and parallelization options. The version of the parallelized code, which uses the wave factorization method, is relevant when solving tasks of DS control, operational numerical analysis of transient modes of motion, etc., where performance is critically necessary. The comparative assessment of the accuracy of the experimental data, the original (non-parallelized) algorithm and the parallelized algorithm was carried out using the example of the numerical solution of the problem of the towing vessel’s movement in the acceleration mode when towing the DS.

IMPROVING EFFICIENCY OF SSCA KIDYM DYNAMICS PROGRAM MODULE BY USING AUTOMATICALLY GENERATED DLL-PROCEDURE AND BY OTHER MEANS

The paper presents the results of research on the significant increase in the speed of solving the problems of the dynamics of discrete mechanical systems of an arbitrary form with arbitrary links by a special system of computer algebra (SSCA) KiDyM. In particular, an algorithm for determining the parameters of the additional rotation of the central coordinate systems (CS) of solid bodies in the presence of a non-diagonal inertia tensor to transform them into the main central SCs, in which Euler's equations have the simplest form, is implemented. The main central moments of inertia of the body are determined. A simpler description of SC transformations of robot links with open kinematic chains is proposed. It consists in a separate description of the positions of the SC of the links and the positions of the center of mass and the central SC in relation to the SC of the link. This approach leads to localized description of the kinematics of the mechanism and complete information about the inertial parameters of the link, such as mass, inertia tensor, position of the central SC. The possibility of errors in model descriptions is thereby reduced. On the example of the model of the lower limbs of an human like robot, the gain in the number of machine operations of this description is shown. The use of the software-generated DLL procedure for saving the mathematical model of the system is analyzed in detail. If necessary, it is loaded from an external medium (disk) into the computer's memory during numerical integration. For this purpose, a special procedure has been created in SSCA KiDyM, which transforms the internal representation of analytical expressions of the computer algebra system into program code in C++, calls the appropriate compiler, which creates and saves the DLL-procedure on the disk. In the numerical integration block, the system can load it and calculate the right-hand sides of the Cauchy form of the dynamic equations by the Runge-Kutta procedure. The time gain of this integration method compared to direct calculations of formula trees in PC memory for various tasks is shown. The time gain increases with the increase in the complexity of the mechanical system. A criterion for automatically switching such an algorithm depending on the amount of C++ code in the DLL procedure is proposed.

Electronic Life Cycle Monitoring System for Various Types of Lead Acid Batteries

With the development of renewable sources of electricity, more and more attention is paid to electricity storage systems and their research. In order to make the research process of various types of batteries automatic, an automatic system for monitoring of the working characteristics and parameters of batteries was created. System management is based on the ATmega328 series microcontrollers. The system control program code and computer application were created using programming languages C and Delphi. The developed system is able to support the automated process of battery testing and to inform the operator about the deviations that have occurred by offering solutions. After the development of this system, a study of the charging and degradation process of four types of batteries was carried out. Four types of lead-based batteries (non-deep cycle battery, deep-cycle battery, GEL battery and AGM battery) were used for the research. Research has shown that GEL-type batteries have the highest number of life cycles, with the number of cycles reaching up to 750. This type of batteries is best suited for storing electricity obtained using renewable energy sources.

«Lacrimosa» by Oleksandr Shchetynskyі: music written in wartime with the faith in triumph of Humanity and Light

Statement of the problem. Recent research and publications. The piece titled “Lacrimosa” for six instruments by Oleksandr Shchetynsky has been written in the beginning of full-scale war, when the Russian troops were dislocated near Kyiv, when the city was shelled every day. The relevancy of this topic of research is caused by a need for musicological comprehension of a musical piece, written in the times of war as a critical situation. Theoretical basis of the article is founded on the sources from the different spheres of humanitarian knowledge. The usage of the term “crisis” caused appeal to the works on psychology, philosophy and aesthetics (Bulakh, 2016; Stasevska, 2016; Frankle, 2020; Fromm, 2013) with the aim to accentuate personal, spiritual aspect of this phenomenon. The main theses of the article by Australian scholars (Meyrick & Barnett, 2020) are used to emphasise importance and necessity of creative activity as a mechanism allowing to preserve humanity in the conditions of a crisis. The work by А. Erll (2011) became a foundation of the idea about musical text being a reminiscence about traumatic past or present times. The research by P. Rud (2021 a, 2021 b) is an important addition to studying O. Shchetynsky’s work. Objectives and scientific novelty of the studу. The purpose of the article is to research Oleksandr Shchetynsky’s “Lacrimosa” for six instruments (2022) in the context of a spiritual crisis that took place in the beginning of full-scale war of Russia against Ukraine. Novelty of the study is caused by comprehension of a musical work in several dimensions: 1) as one that was written “here and now”, one being an objectification of artist’s reflection on the war; 2) one continuing the row of instrumental works on spiritual themes in the context of the composer’s creativity, his search in the spheres of sonority and organization of the sound in the time and space; 3) the one being the part of Ukrainian and European musical cultures of XXI century. Research results and conclusion. O. Shchetynsky’s “Lacrimosa” continues a row of spiritual works by the composer, being a text of memory, which bears the information about traumatic present codified in it. The concentration on today (“darkness”) is combined with a semantic vector directed to the future (“victory over it”) determines the specifics of the temporal organization of the work, where there is a movement towards a cathartic melody in the spirit of a Ukrainian folk song. Semantic multidimensionality of the prayer, that becomes a code programming the composition, defines the organization of sound space as well, which has lines and layers of different significance interacting with each other, as well as work with the sound and sound matter, that is essential for O. Shchetynsky’s compositional technique. Elegant construction of the composition is caused by well-thought organization of different attributes: pitches, motives, themes, rhythms, textures and timbres. Thus, the end result is an artistic unity, with the experience of creating and understanding it is a way to overcome destructive influence of critical situation, allowing to realize the idea of productive creative life, “spiritual energy of harmony”

Method of generating ORM models software code based on relational database schemes

Abstract. Problem. Databases and data stores are an important part of any system, regardless of the field of application. It is at this level that all system information is stored, such as a list of online store products, user personal data, system configuration parameters, etc. In addition, they allow to structure information in the desired format. Although the use of databases is associated with obvious advantages, it has some disadvantages, in particular the process of designing them and integrating their software code is labor-intensive and time-consuming. This problem is usually attempted to be circumvented by using ORM libraries, which provide a convenient programming interface for performing basic queries. But the process of setting up an ORM library including developing ORM models still takes a lot of time. Goal. The purpose of the work is to develop an algorithm for the automatic generation of software code for ORM models based on the selected ORM library and the data scheme presented in the form of a configuration file. To achieve the goal, it is necessary to establish the optimal representation of the data scheme in text format, to determine the structure of the data configuration scheme and to describe all stages of the generation of software code for ORM models. Methodology. System approach, analysis of existing methods of visual design, formats of text representation of configuration data and methods of configuration data storing. Results. The developed method for software code generation for the selected ORM library based on the scheme of the relational database provides the user with the opportunity to obtain a qualitatively designed software code with minimal time expenditure. Originality. The developed method implements a unique approach which allows to create program code for various ORM libraries, supports the syntax and features of a specific programming language, and provides work with data schemas from various relational databases. Practical value. Developed generation algorithm can be used as part of the software in which the automated process of preparing the data schema in the appropriate text formatted form will be implemented. As a result, such a web-application will represent a platform for working with the data layer for IT professionals.

SYSTEMATIC DISCUSSION OF ARTIFICIAL INTELLIGENCE’S PERSONALITY IN CRIMINAL LAW AND THE PUNISHABILITY FOR IMPROPER OMISSION BY THE GROUP ACTING AS THEIR GUARANTOR POSITION

The rapid development of artificial intelligence (AI) in the twenty-first century not only makes our life more convenient but also brings some invisible concerns. Through the study of several typical AI applications, it is found that today's AI cannot realize its full functionality without its users. Therefore, users still bear most of the legal liability for damage to legally-protected interests caused by AI. However, despite the continuous development of AI, the ways of remedy for damages to legally-protected interests, that may occur as a result of the crime of omission, arising during the logical writing of program codes are rarely conclusive. In addition to distinguishing the main framework between AI, machine learning, and deep learning in criminal law, this research arguing, based on philosophical jurisprudence, concludes that although AI has yet to meet the personality characteristics in criminal law due to its lack of independence, AI scientists or legal persons representing it must hold the guarantor position in an improper omission. This will render the scientists and legal persons punishable and relief petitions possible, supplying a considerable legal basis for future formulation of legal norms on AI based on the principle of nulla poena sine lege (no crime without law, or principle of legality).

An empirical examination of newcomer contribution costs in established OSS communities: a knowledge-based perspective

PurposeTo remain sustainable, open source software (OSS) projects must attract new members—or newcomers—who make contributions. In this paper, the authors develop a set of hypotheses based on the knowledge barriers framework that examines how OSS communities can encourage contributions from newcomers.Design/methodology/approachEmploying longitudinal data from the source code repositories of 232 OSS projects over a two-year period, the authors employ a Poisson-based mixed model to test how community characteristics, such as the main drivers of knowledge-based costs, relate to newcomers' contributions.FindingsThe results indicate that community characteristics, such as programming language choice, documentation effort and code structure instability, are the main drivers of knowledge-based contribution costs. The findings also suggest that managing these costs can result in more inclusive OSS communities, as evidenced by the number of contributing newcomers; the authors highlight the importance of maintaining documentation efforts for OSS communities.Originality/valueThis paper assumes that motivational factors are a necessary but insufficient condition for newcomer participation in OSS projects and that the cost to participation should be considered. Using the knowledge barriers framework, this paper identifies the main knowledge-based costs that hinder newcomer participation. To the best of the authors' knowledge, this is the first empirical study that does not limit data collection to a single hosting platform (e.g., SourceForge), which improves the generalizability of the findings.

An AADL Contract Language Supporting Integrated Model- and Code-Level Verification

Model-based systems engineering approaches support the early adoption of a model - a collection of abstractions - of the system under development. The system model can be augmented with key properties of the system including formal specifications of system behavior that codify portions of system and unit-level requirements. There are obvious gaps between the model with formally specified behavior and the deployed system. Previous work on component contract languages has shown how behavior can be specified in models defined using the Architecture Analysis and Design Language (AADL) - a SAE International standard (AS5506C). That work demonstrated the effectiveness of model-level formal methods specification and verification but did not provide a strong and direct connection to system implementations developed using conventional programming languages. In particular, there was no refinement of model-level contracts to programming language-level contracts nor a framework for formally verifying that program code conforms to model-level behavioral specifications. To address these gaps and to enable the practical application of model-contract languages for verification of deployed high-integrity systems, this paper describes the design of the GUMBO AADL contract language that integrates and extends key concepts from earlier contract languages. The GUMBO contract language (GCL) is closely aligned to a formal semantics of the AADL run-time framework, which provides a platform- and language- independent specification of AADL semantics. We have enhanced the HAMR AADL code generation framework to translate model-level contracts to programming language-level contracts in the Slang high-integrity language. We demonstrate how the Logika verification tool can automatically verify that Slang-based AADL component implementations conform to contracts, both at the code-level and model-level. Slang-based implementations of AADL systems can be executed directly or compiled to C for deployments on Linux or the seL4 verified microkernel.

Elasto-plastic analysis and optimal design of composite integral abutment bridge extended with limited residual plastic deformation

Due to the growing significance of structural theories concerning the composite structure analysed and designed plastically, this paper introduces a new optimisation method for controlling the plastic behaviour of a full-scale composite integral abutment bridge by employing complementary strain energy of residual forces that existed within the reinforcing rebars. Composite bridges are structures made of components such as steel and concrete, which are frequent and cost-effective building methods. Thus, various objective functions were used in this work when applying optimum elasto-plastic analysing and designing the composite integrated bridge structure that was tested experimentally in the laboratory. In contrast, the plastic deformations were constrained by restricting the complementary strain energy of the residual internal forces aiming to find the maximum applied load and the minimum number of steel bars used to reinforce the concrete column part of the structure. The numerical model employed in this paper was validated and calibrated using experimental results, which were considered inside ABAQUS to produce the validated numerical model, using concrete damage plasticity (CDP) constitutive model and concrete data from laboratory testing to solve the nonlinear programming code provided by the authors. This paper presents a novel optimization method using complementary strain energy to control the plastic behaviour of a full-scale composite integral abutment bridge, with the original contribution being the incorporation of residual forces within reinforcing rebars to limit plastic deformations. Following that, a parametric investigation of the various optimisation problems revealed how models performed variously under different complementary strain energy values, which influenced the general behaviour of the structure as it transitioned from elastic to elasto-plastic to plastic; also results showed how the complementary strain energy value is connected with the amount of damaged accrued in both concrete and steel.

Dynamics of Forest Vegetation in an Urban Agglomeration Based on Landsat Remote Sensing Data for the Period 1990–2022: A Case Study

In recent years, the vegetation cover in urban agglomerations has been changing very rapidly due to technogenic influence. Satellite images play a huge role in studying the dynamics of forest vegetation. Special programs are used to process satellite images. The purpose of the study is to analyze forest vegetation within the territory of the Tomsk agglomeration based on Landsat remote sensing data for the period from 1990 to 2022. The novelty of the study is explained by the development of a unique program code for the analysis of Landsat satellite data on the previously unexplored territory of the Tomsk agglomeration with the prospect of moving to the scale of the entire state in the future. In this study, the authors present an algorithm implemented in Python to quantify the change in the area of vegetation in an urban agglomeration using Landsat multispectral data. The tool allows you to read space images, calculate spectral indices (NDVI, UI, NDWI), and perform statistical processing of interpretation results. The created tool was applied to study the dynamics of vegetation within the Tomsk urban agglomeration during the period 1990–2022. Key findings and conclusions: (1) The non-forest areas increased from 1990 to 1999 and from 2013 to 2022. It is very likely that this is due to the deterioration of the standard of living in the country during these periods. The first time interval corresponds to the post-Soviet period and the devastation in the economy in the 1990s. The second period corresponds to the implementation and strengthening of sanctions pressure on the Russian Federation. (2) The area of territories inhabited by people has been steadily falling since 1990. This is due to the destruction of collective agriculture in the Russian Federation and the outflow of the population from the surrounding rural settlements to Tomsk and Seversk.

DEVELOPMENT OF LEARNING MODELS IN WEB PROGRAMMING COURSES WITH COMPUTER-BASED LEARNING TUTORIALS

Web programming courses are practical courses that can only run with the help of computer devices. The content or learning content in web programming courses is in program code directly created with a computer. The models developed include conceptual models, procedural models, and physical models. The research method used is Research and Development (R&D) using the Dick & Carey instructional system design model combined with the Hannafin & Peck model. The learning model was tested for feasibility and effectiveness before being implemented. The learning model developed has four components: syntax, reaction principle, social system, and support system. The feasibility of the model is seen from the percentage of the results of the one-to-one evaluation, which is 91.47%, the small group evaluation is 94.88% and the field trial evaluation is 92%. The effectiveness test results can be seen from the increase in the post-test score with the pre-test reaching 68.7% and the percentage of the success rate of student studies who have carried out learning with the tutorial learning model reaching 83%. The result of this research is a web programming learning model computer-based learning tutorial that is effective for improving student learning outcomes in web programming courses.

The Impact of the Hour of Coding Program on Motivation and Attitude Towards Learning Programming Among Female Students in Middle and High School in Riyadh City

The Impact of the Hour of Coding Program on Motivation and Attitude Towards Learning Programming Among Female Students in Middle and High School in Riyadh City

Pengembangan Mobile Learning Management System Berbasis Blended Learning pada Pembelajaran Masa WFH Pandemic Covid-19

The spread of the Coronavirus (Covid-19) outbreak, which has spread so quickly throughout the world, has caused anxiety and sadness for humanity to grieve. Starting from Wuhan China since the end of January 2020. The World Health Organization (WHO) has determined the phenomenon of this incident as a pandemic. A pademic occurs when an infectious disease spreads easily from human to human in various places in all corners of the world. Until the last two weeks, cases of Covid-19 outside China have increased thirteen times, causing concern for the world community. This research tries to provide solutions to the problem of how to develop and access LMS for learning anywhere and anytime (ubiquitos learning) both online and offline, using mobile devices that have limited connections. The M-LMS application being developed will be in the form of a prototype that takes the open source Moodle LMS model, and will focus on only a few important modules, namely the Subject Description module, Assignment module, Quiz module, Subject matter module. In its implementation, this research will be divided into three stages, namely pre-development data collection, development and implementation, and post-development data collection. The pre-development data collection is intended to obtain provision for a preliminary study of the core problems being faced, while the development and implementation stages focus on modeling software designs into diagrams and creating programming code to implement the designs that have been made. While the post-development data collection stages are for improving the applications made, drawing conclusions, and suggestions for further research topics.

Numerical solution of Kiefer-Weiss problems when sampling from continuous exponential families

In this article, we deal with problems of testing hypotheses in the framework of sequential statistical analysis. The main concern is the optimal design and performance evaluation of sampling plans in Kiefer-Weiss problems. The main goal of the Kiefer-Weiss problem is designing hypothesis tests that minimize the maximum average sample number, over all parameter values, as opposed to both the sequential probability tests (SPRTs) minimizing the average sample number only at two hypothesis points and the classical fixed-sample-size test. For observations that follow a distribution from an exponential family of the continuous type, we provide algorithms for optimal design in the modified Kiefer-Weiss problem and obtain formulas for evaluating the performance of sequential tests by calculating the operating characteristic function, the average sample number, and some related characteristics. These formulas cover, as a particular case, the SPRTs and their truncated versions, as well as optimal finite-horizon sequential tests. In the setting of the original Kiefer-Weiss problem we apply the method of our recent work (Sequential Analysis 2022, 41(2), 198–219) for numerical construction of the optimal tests. For the particular case of sampling from a normal distribution with a known variance, we make numerical comparisons of the Kiefer-Weiss solution with the SPRT and the fixed-sample-size test provided that the three tests have the same levels of the error probabilities. All of the algorithms are implemented in the form of computer code written in the R programming language and are available at the GitHub public repository (https://github.com/tosinabase/Kiefer-Weiss). Guidelines on the adaptation of the program code to other exponential family distributions are provided.

Toward More Efficient Statistical Debugging with Abstraction Refinement

Debugging is known to be a notoriously painstaking and time-consuming task. As one major family of automated debugging, statistical debugging approaches have been well investigated over the past decade, which collect failing and passing executions and apply statistical techniques to identify discriminative elements as potential bug causes. Most of the existing approaches instrument the entire program to produce execution profiles for debugging, thus incurring hefty instrumentation and analysis cost. However, as in fact a major part of the program code is error-free, full-scale program instrumentation is wasteful and unnecessary. This article presents a systematic abstraction refinement-based pruning technique for statistical debugging. Our technique only needs to instrument and analyze the code partially. While guided by a mathematically rigorous analysis, our technique is guaranteed to produce the same debugging results as an exhaustive analysis in deterministic settings. With the help of the effective and safe pruning, our technique greatly saves the cost of failure diagnosis without sacrificing any debugging capability. We apply this technique to two different statistical debugging scenarios: in-house and production-run statistical debugging. The comprehensive evaluations validate that our technique can significantly improve the efficiency of statistical debugging in both scenarios, while without jeopardizing the debugging capability.

Research of the Properties of the Breadth-First Search Algorithm for Finding the Movement Route of Robots

Purpose of research. The research presented in this article is aimed at improving the speed of finding a path for the movement route of robots. The scientific novelty is the obtained correlation of time and field size.Methods. To find the path in the maze, the depth-first search and breadth-first search algorithms were used, the basis of which is the cyclic processing of adjacent previously unvisited graph vertices. Performance is estimated in terms of the speed of program code execution on prepared samples. Scientific novelty was obtained by studying the influence of map sizes on the performance of depth-first and breadth-first search algorithms.Results. A software implementation of breadth-first and depth-first search algorithms has been developed. The article provides a more detailed description of the breadth-first search algorithm in the form of pseudo and program codes, which are based on the while loop, where the queue of checked graph vertices is processed. Based on the evaluation of the speed of the found path, it was concluded that the breadth-first search is not the fastest. Based on the assessment of the influence of various factors on the speed of the algorithm, it was concluded that an increase in the size of the field, a decrease in the number of obstacles and a distance between the starting and final points increases the execution time of the algorithm.Conclusion. The breadth-first search algorithm and its software implementation were presented. In the course of experimental studies, it was found that this algorithm is not the fastest in time, but in all tests, it found the shortest path. The correlation ta = f(w, h) was also obtained for the prepared samples of the desired field, which is expressed as the dependence of the algorithm execution time on the length and width of the field. And we can conclude that it is applicable for finding the movement path of robots, since it always finds the shortest path.

Usability of Inexpensive Optical Pulse Sensors for Textile Integration and Heartbeat Detection Code Development

Low-cost sensors and single circuit boards such as Arduino and Raspberry Pi have increased the possibility of measuring biosignals by smart textiles with embedded electronics. One of the main problems with such e-textiles is their washability. While batteries are usually removed before washing, single-board computers and microcontrollers, as well as electronic sensors, would ideally be kept inside a user-friendly smart garment. Here, we show results of washing tests with optical pulse sensors, which can be used in smart gloves not only for hospitalized patients, and ATtiny85 as an example of a single-board microcontroller, sewn onto different cotton fabrics. We report that even without any encapsulation, all tested sensors and microcontrollers endured 10 washing cycles at 30–60 °C without defects. For easier garment integration, we suggest using an ESP8266 with integrated Wi-Fi functionality and offer a new program code to measure beats per minute (BMP) with optimized accuracy.