Abstract: The use of pointers and indirect memory accesses in the program, as well as the complex control flow are some of the main weaknesses of the static analysis of programs. The program properties investigated by this analysis are too conservative to accurately describe program behavior and hence they prevent parallel execution of the program. The application of dynamic analysis allows us to expand the capabilities of semi-automatic parallelization. In the SAPFOR system (System FOR Automated Parallelization), a dynamic analysis tool has been implemented, based on on the instrumentation of the LLVM representation of an analyzed program, which allows the system to explore programs in both C and Fortran programming languages. The capabilities of the static analysis implemented in SAPFOR are used to reduce the overhead program execution, while maintaining the completeness of the analysis. The use of static analysis allows to reduce the number of analyzed memory accesses and to ignore scalar variables, which can be explored in a static way. The developed tool was tested on performance tests from the NAS Parallel Benchmarks package for C and Fortran languages. The implementation of dynamic analysis, in addition to traditional types of data dependencies (flow, anit, output), allows us to determine privitizable variables and a possibility of pipeline execution of loops. Together with the capabilities of DVM and OpenMP these greatly facilitates program parallelization and simplify insertion of the appropriate compiler directives.

Abstract: The system for automated parallelization SAPFOR (System FOR Automated Parallelization) includes tools for program analysis and transformation. The main goal of the system is to reduce the complexity of program parallelization. SAPFOR system is focused on the investigation of multilingual applications in Fortran and C programming languages. The low-level LLVM IR representation is used in SAPFOR for program analysis. This representation allows us to perform various IR-level optimizations to improve the quality of program analysis. At the same time, it loses some features of the program, which are available in its higher level representation. One of these features is the multi-dimensional structure of the arrays. Data dependence analysis is one of the main problems which should be solved to automate program parallelization. Moreover, such an analysis belongs to the class of NP-hard problems. Knowledge of the multidimensional structure of arrays allows in many cases to take into account the structure of index expressions in calls to arrays and reduce the complexity of the analysis. In addition, the use of multi-dimensional arrays allows us to use multi-dimensional processor matrix and to parallelize a whole loop nests, rather than a single loop in the nest. So, parallelism of a program is going to be increased. These opportunities are natively supported in the DVM system. This paper discusses the approach used in the SAPFOR system to recover the form of multi-dimensional arrays by their linearized representation in LLVM IR. The proposed approach has been successfully evaluated on various applications including performance tests from the NAS Parallel Benchmarks suite.

Abstract: Experience of designing different variants for web-based development environment (IDE) for Optimizing parallelizing system and compiler for reconfigurable architecture is described. Designed system is based on existing tools and frameworks such as Jupyter Notebook and Eclipse Che. Set of requirements for Optimizing parallelizing system components is developed to make it possible to integrate them into web-based development environment accessible through the Internet. Designing portable environment for compiler development, compiler technology demonstration and teaching parallel program development is also described. Examples of performing newly developed program transformations are shown to be used during program optimizations for FPGA inside the designed web environment. Means of program transformation visualization are described for use with Jupyter Notebook. The work shown demonstrates possibility to organize remote access to library of instruments and tools for program optimizations currently under development that would be convenient for application developers.

Abstract: In this paper developed model of information-computational system for conducting scientific research based on statistical processing and analysis of spatially distributed geophysical data obtained as results of observations and modeling is presented. Accumulated experience of developing information-computational web-systems providing computational processing and visualization of large archives of geo-referenced data was used during the implementation. Functional capabilities of the model comprise a set of procedures of mathematical and statistical analysis, processing and visualization of data, which allows optimizing of routine calculation tasks. As one of applications of the system being developed program modules for analysis of regional features of main climatic characteristics dynamics and interrelations as well as for graphical representation of results as plots, diagrams and 3-D fields layered on maps of corresponding territories by means of Web GIS technologies were implemented.

Abstract:

The article draws attention to the problem of measuring the effect that programming solutions have on the programming productivity and performance, in educational programming and the correctness-saving program improvements. The results of some experiments concerning these questions are discussed. The hypothesis that  functional models can provide a metric scale capable of separating features of programming languages and systems from features of programs and programming solutions is proposed. The results of a preliminary demonstrative experiment in studying the dependence of the program productivity upon the opted compiler and, on the other hand, upon the representation of the programming solution in the opted programming languages are described. Analysis of these results leads to a method that can reveal such dependencies. The long experience in sifting educational and contest programs revealed some unnoticed aspects of this problem.

Abstract:

The procedure for setting vertex weights is a very time consuming and difficult task for any 3D model artist. Therefore, the use of procedural methods to facilitate this procedure is very important.

This article analyzes various skinning techniques and identifies their advantages and disadvantages. The most frequent variants of skinning defects that arise when using standard approaches are described. The analysis of tools for skinning in the Maya 3D modeling environment has been carried out. Methods for solving some of the existing problems are proposed, but do not imply a procedural solution. Also, on the basis of neural networks, an idea of their own solution was proposed as an additional tool for the Maya program. This tool will overcome most of the disadvantages of other methods and speed up the skinning process of the model.

Abstract: This article analyzes the development trends of processing Big Data tools and multi-format data storage and analysis. This analysis was carried out as part of our program of basic research of the Department of Mathematical Sciences, Russian Academy of Sciences “Algebraic and Combinatorial Methods of Mathematical Cybernetics and information systems of the new generation", as well as RFBR grant number 14-07-00783 “Way to store and process a large volume of scientific and reference data modern hardware platforms”.

Abstract: Mason and Spence’s (1999) work demonstrate a detailed view into the concept of knowing. Although they highlight the importance of not-knowing as a first step, it is a topic that is not well researched. This study aims at expanding that research, by analyzing not-knowing expressions from teacher to student and possible connections to be found. During a course of geometric reasoning student teachers were asked to reason with a tangram while simultaneously recording their expressions of not-knowing and reflecting on it periodically. Student teachers were then tasked to teach this lesson to their students, who would also reflect and express their forms of not-knowing. Findings presented no real link between teacher-student expressions of not-knowing, but two major conclusions were made. Individuals altogether struggle conveying their not-knowing clearly and when they did express it, these expressions leaned heavily on not-knowing-that and not-knowing-how forms. A discussion follows to interpret said findings. A conclusion is made detailing key points in the study and what comes next for the concept of not-knowing.

Abstract: The report is devoted to the analysis of the method of comparison of programming languages, convenient for assessing the expressive power of languages and the complexity of the programming systems. The method is adapted to substantiate practical, objective criteria of program decomposition, which can be considered as an approach to solving the problem of factorization of very complicated definitions of programming languages and their support systems. The article presents the results of the analysis of the most well-known programming paradigms and outlines an approach to navigation in the modern expanding space of programming languages, based on the classification of paradigms on the peculiarities of problem statements and semantic characteristics of programming languages and systems with an emphasis on the criteria for the quality of programs and priorities in decision-making in their implementation.

Abstract:

Relevance of the issue under study is due to tenuity of methods proposed by other researchers that use simple heuristics or machine learning algorithms. The purpose of the article is to provide better way to extract titles from scientific PDF documents and offer better and more reasonable approach to title selection generally. The leading approach to the study is regard as many cases and problems appeared during extraction as possible and find an approach to solve all of them. The results showed the efficiency of chosen approach in case of having a document set with all of considered problems. The research highlights that deep analysis of current task problem is a perspective to make the best solutions and tools. The article may be useful for all researchers and developers who often encounter the problem of document structural analysis or title detection as secondary task of a main program workflow.

Abstract: A description of the user interface elements for native mobile applications with augmented reality. Specifically, an analysis of the different UI components required for augmented reality apps (for example, support of basic gesture recognition for interactions between the application user and 3D objects, possible color combinations), as well as a comparison between these components.

Abstract: Framework for development of native mobile applications with augmented reality. Analysis of various development spheres: game development, mobile applications development. The concept of a new framework and a set of tools for developing mobile applications with augmented reality is presented.

Abstract: The purpose of the article is the choice of presenting the results of a comparison of programming languages, convenient for assessing the expressive power of languages and the complexity of the implementation of programming systems. Forms of such a presentation should be adapted to substantiate practical criteria for program decomposition, which can be viewed as an approach to solving the problem of factorization of very sophisticated definitions of programming languages.
The relevance of choosing concise and quickly perceived forms is useful for working in the rapidly developing space of new problem-oriented programming languages. Along the way, you can show the distance in the conceptual complexity between programming and the development of programming systems.

Abstract: The report is devoted to the analysis of the possibilities of using the modern IT potential in solving problems of processing large and complex data by the example of program texts and definitions of programming languages. The problem of improving modern programming systems and creating new programming languages aimed at efficiently solving problems of developing reliable and convenient information systems is considered.

Abstract: The use of different metaprogramming mechanisms for program libraries development in Java may have some negative effect on build time and end products. The article is aimed to describe metaprogramming mechanisms in the Java language and present the results of experiments that compare the impact of approaches on the build time of small and large projects.