A Mobile Suitcase for Informatic Teachers Related to the “Digital” Didactic Goals of the 21st Century

This study deals with the optimal equipment of a mobile case for computer science teachers, which offers the possibility to teach the skills of the curricula from primary to high school of the 21st century. First, the Single Board Computers (SBCs) in question are filtered out from previous studies and the accessory parts required are determined through a quantitative market analysis. Then, by combining the results with a qualitative analysis according to Mayring, the degree of curricular coverage of individual accessories is determined and binarized. Afterwards, the optimal equipment of the mobile case is evaluated and established based on the cost overlap by horizontal summation and vertical inclusion of the necessary accessories after recording the prices and the budget. The results were clearly presented in network diagrams and lists. This study thus provides computer science teachers and computer science professors with a budget-dependent basis for making decisions about the contents of a mobile case for computer science lessons or a computer science laboratory for learning the skills of the curricula from primary to high school of the 21st century. The study closes with a summary and an outlook.

Pathway Tools Visualization of Organism-Scale Metabolic Networks

Metabolomics, synthetic biology, and microbiome research demand information about organism-scale metabolic networks. The convergence of genome sequencing and computational inference of metabolic networks has enabled great progress toward satisfying that demand by generating metabolic reconstructions from the genomes of thousands of sequenced organisms. Visualization of whole metabolic networks is critical for aiding researchers in understanding, analyzing, and exploiting those reconstructions. We have developed bioinformatics software tools that automatically generate a full metabolic-network diagram for an organism, and that enable searching and analyses of the network. The software generates metabolic-network diagrams for unicellular organisms, for multi-cellular organisms, and for pan-genomes and organism communities. Search tools enable users to find genes, metabolites, enzymes, reactions, and pathways within a diagram. The diagrams are zoomable to enable researchers to study local neighborhoods in detail and to see the big picture. The diagrams also serve as tools for comparison of metabolic networks and for interpreting high-throughput datasets, including transcriptomics, metabolomics, and reaction fluxes computed by metabolic models. These data can be overlaid on the metabolic charts to produce animated zoomable displays of metabolic flux and metabolite abundance. The BioCyc.org website contains whole-network diagrams for more than 18,000 sequenced organisms. The ready availability of organism-specific metabolic network diagrams and associated tools for almost any sequenced organism are useful for researchers working to better understand the metabolism of their organism and to interpret high-throughput datasets in a metabolic context.

Algorithm for create network diagrams for planning maintenance of agricultural machines

Reducing the maintenance man-hour is one of the ways to improve of operation efficiency of agricultural machines. The total maintenance time of the agricultural machine is determined by the critical path and other network planning parameters. The network model in the form of network diagrams is used for visualization and analysis of maintenance processes. Building network diagrams be not a trivial task and it takes a long time to build. Therefore, automating the creation of network diagrams of technological maintenance of agricultural machines is an urgent task. This work aims to develop an algorithm for creating and analyzing network diagrams for planning the processes of technological maintenance and repair of various agricultural machines. When building an algorithm for creating network diagrams, the methodological apparatus of network planning and basic algorithmic structures were used. The algorithm is realized in the Matlab programming language. The article presents the flowchart and a description of the formation of an array of all and full paths. The description of identifying fictitious operations in the network diagram is given. The present algorithm calculates the maintenance man-hour of paths, determines the critical path of the network diagram and visualizes it on the graph, and also calculates the time reserves of the specified work. The logic of the algorithm is developed in accordance with the rules for building network models and excludes dead-end and tail events, closed loops. Thus, the algorithm will increase the efficiency of solving practical tasks of network planning of maintenance of agricultural machinery, shorten working hours and time for the building of the network diagram and reduce the associated possible errors.

FEATURES OF FINDING OPTIMAL SOLUTIONS IN NETWORK PLANNING

The object of research is a test network diagram, in relation to which the task of minimizing the objective function qmax/qmin→min is posed, which requires maximizing the uniformity of the workload of personnel when implementing an arbitrary project using network planning. The formulation of the optimization problem, therefore, assumed finding such times of the beginning of the execution of operations, taken as input variables, in order to ensure the minimum value of the ratio of the peak workload of personnel to the minimum workload. The procedure for studying the response surface proposed in the framework of RSM is described in relation to the problem of optimizing network diagrams. A feature of this procedure is the study of the response surface by a combination of two methods – canonical transformation and ridge analysis. This combination of methods for studying the response surface allows to see the difference between optimal solutions in the sense of "extreme" and in the sense of "best". For the considered test network diagram, the results of the canonical transformation showed the position on the response surface of the extrema in the form of maxima, which is unacceptable for the chosen criterion for minimizing the objective function qmax/qmin→min. It is shown that the direction of movement towards the best solutions with respect to minimizing the value of the objective function is determined on the basis of a parametric description of the objective function and the restrictions imposed by the experiment planning area. A procedure for constructing nomograms of optimal solutions is proposed, which allows, after its implementation, to purposefully choose the best solutions based on the real network diagrams of your project

FEATURES OF FINDING OPTIMAL SOLUTIONS IN NETWORK PLANNING

The object of research is a test network diagram, in relation to which the task of minimizing the objective function qmax/qmin→min is posed, which requires maximizing the uniformity of the workload of personnel when implementing an arbitrary project using network planning. The formulation of the optimization problem, therefore, assumed finding such times of the beginning of the execution of operations, taken as input variables, in order to ensure the minimum value of the ratio of the peak workload of personnel to the minimum workload. The procedure for studying the response surface proposed in the framework of RSM is described in relation to the problem of optimizing network diagrams. A feature of this procedure is the study of the response surface by a combination of two methods – canonical transformation and ridge analysis. This combination of methods for studying the response surface allows to see the difference between optimal solutions in the sense of "extreme" and in the sense of "best". For the considered test network diagram, the results of the canonical transformation showed the position on the response surface of the extrema in the form of maxima, which is unacceptable for the chosen criterion for minimizing the objective function qmax/qmin→min. It is shown that the direction of movement towards the best solutions with respect to minimizing the value of the objective function is determined on the basis of a parametric description of the objective function and the restrictions imposed by the experiment planning area. A procedure for constructing nomograms of optimal solutions is proposed, which allows, after its implementation, to purposefully choose the best solutions based on the real network diagrams of your project