Logical Relations as Types: Proof-Relevant Parametricity for Program Modules

The theory of program modules is of interest to language designers not only for its practical importance to programming, but also because it lies at the nexus of three fundamental concerns in language design: the phase distinction , computational effects , and type abstraction . We contribute a fresh “synthetic” take on program modules that treats modules as the fundamental constructs, in which the usual suspects of prior module calculi (kinds, constructors, dynamic programs) are rendered as derived notions in terms of a modal type-theoretic account of the phase distinction. We simplify the account of type abstraction (embodied in the generativity of module functors) through a lax modality that encapsulates computational effects, placing projectibility of module expressions on a type-theoretic basis. Our main result is a (significant) proof-relevant and phase-sensitive generalization of the Reynolds abstraction theorem for a calculus of program modules, based on a new kind of logical relation called a parametricity structure . Parametricity structures generalize the proof-irrelevant relations of classical parametricity to proof- relevant families, where there may be non-trivial evidence witnessing the relatedness of two programs—simplifying the metatheory of strong sums over the collection of types, for although there can be no “relation classifying relations,” one easily accommodates a “family classifying small families.” Using the insight that logical relations/parametricity is itself a form of phase distinction between the syntactic and the semantic, we contribute a new synthetic approach to phase separated parametricity based on the slogan logical relations as types , by iterating our modal account of the phase distinction. We axiomatize a dependent type theory of parametricity structures using two pairs of complementary modalities (syntactic, semantic) and (static, dynamic), substantiated using the topos theoretic Artin gluing construction. Then, to construct a simulation between two implementations of an abstract type, one simply programs a third implementation whose type component carries the representation invariant.

Agroecological optimization of the technology for growing spring barley in the Penza region using the DSS

The article presents the results of modeling the cultivation of barley on leached chernozems of the Penza region. In order to conduct modeling, the Decision Support System (DSS) for agroecological optimization of adaptive farming systems was modernized. The adaptation of the program modules to the climatic and soil conditions of a particular research area allowed us to reach 7% of the error when modeling the cultivation of agricultural crops in the presence of a complete set of indicators necessary for building the model. Technological calculations of the model made it possible to reduce the number of minimum necessary technological operations, as well as rationally distribute the application of mineral fertilizers for the planned yield. The economic calculations of the model allowed us to achieve a high profitability of production of 66±7%. The constructed model was tested at the experimental field in 2020. Practical verification showed the possibility of using the model in agricultural production under normal climatic conditions and its high correlation with the actual results obtained. Statistical analysis of the calculated data of the model and the actual yield with the achieved economic indicators in the conditions of the model field showed the level of reliability of calculations of 95%. Keywords: AGROECOLOGICAL OPTIMIZATION, AGROECOLOGICAL ASSESSMENT, AGROECOLOGICAL MODELING

SecureVision: An Open-Source User-Customizable Image Encryption Program

Data security has become indispensable, with a view to keep sensitive information confidential. One important method is through image encryption, upon which features in an image would no longer be visible. The original image with its features could only be restored upon decryption using a set of keys. There are prestigious works in the literature regarding image encryption. However, there is a lack of easy-to-use, GUI-based, user-customizable computer programs for image encryption. In the present work, we developed a GUI-based image encryption and decryption program with server file transfer support, namely, SecureVision. A custom-made random number generator using the equation of an ellipse was developed to randomly shuffle the pixel positions. SecureVision was found to be robust, user-friendly and fast in both encryption and decryption. The program was highly sensitive to the supplied keys, which prevented brute-force attacks. SecureVision provided full user control, where users could modify the program modules to match their desired applications, which was particularly desirable for pedagogical purposes in that interested parties had the freedom to explore the concept of image encryption and decryption. SecureVision is distributed under a GPLv3 license, which would allow everyone to use, modify and distribute the program without any restriction.

Enkripsi Base 64, Hashing SHA1 dan MD5 pada QR Code Presensi Kuliah

The lecture attendance application at the University of Muhammadiyah Bengkulu needs to be developed so that it is easier in the implementation process. One way to simplify the process is to use the presence of a Quick Response Code which can be done in online or offline lectures. The method used is in the form of encrypted and hashed Uniform Resource Locator storage combined with internet protocol address filtering so that the information stored in the Quick Response Code becomes more secure than in plain text. The data collection method uses observation and interview techniques to previous application users and then analysis, design and experimental programming are carried out on program modules that play a role in the presence process. From the results of this study, the Quick Response Code can be protected and used successfully and can be integrated with several learning management systems, social media applications that are often used by lecturers, especially at the University of Muhammadiyah Bengkulu. The results of this study have been used in the lecture process in the Even Semester of the 2020 Academic Year.

Research of a mathematical model for designing a barge-towing complex for the Republic of the Union of Myanmar

В статье описана математическая модель проектирования барже-буксирного комплекса с учётом особенности эксплуатации в условиях Республики Союз Мьянма. В статье исследуются особенности ББК как объекта оптимизации, описана математическая модель ББК, отображается его как сложную техническую систему. В рамках модели приведены математические зависимости и алгоритмы для определения элементов теоретического чертежа, мощности главных двигателей, для решения некоторых вопросов общего расположения с учетом расстояния главных водонепроницаемых переборок корпуса, для расчета нагрузки и устойчивости. Метод комплексной оценки эффективности применения барже-буксирного комплекса на стадии технико-экономического обоснования проекта в условиях развивающихся стран, в частности в условиях Республики Союз Мьянмы. В результате работы были полностью определены параметры основных типов барже-буксировочных комплексов для перспективной системы внутреннего водного транспорта Республики Союза Мьянма. На базе методов случайного поиска создан алгоритм оптимизации элементов ББК, решающий задачу математического программирования с процедурным характером функции критерия и функциональных ограничений. Математическая модель и алгоритм оптимизации реализованы в виде программы для обеспечения компьютерного эксперимента. Программа, реализующая математическую модель проектирования ББК, состоит из отдельных программных модулей, что облегчает ее совершенствование в анализе результатов решения задачи. Создан программный комплекс с использованием языка программирования Паскаль в среде Delphi для обеспечения автоматизирования проектирования. Указанные программы могут быть использованы в исследовательском проектировании на начальных стадиях проектирования. The article describes a mathematical models for designing a barge-towing complex, taking into account the peculiarities of operation in the conditions of the Republic of the Union of Myanmar. The article examines the features of the BBK as an object of optimization, describes the mathematical model of the BBK, displays it as a complex technical system. Within the framework of the model, mathematical dependencies and algorithms are given for determining the elements of the theoretical drawing, the power of the main engines, for solving some issues of the general location, taking into account the distance of the main watertight bulkheads of the hull, for calculating the load and stability. The method of comprehensive assessment of the effectiveness of the use of the barge-tow complex at the stage of the feasibility study of the project in the conditions of developing countries, in particular in the conditions of the Republic of the Union of Myanmar. As a result of the work, the parameters of the main types of barge-towing complexes for the prospective inland water transport system of the Republic of the Union of Myanmar were fully determined. On the basis of random search methods, an algorithm for optimizing the BBK elements is created, which solves the problem of mathematical programming with the procedural nature of the criterion function and functional constraints. The mathematical model and the optimization algorithm are implemented as a program to provide a computer experiment. The program that implements the mathematical model of the design of the BBK consists of separate program modules, which facilitates its improvement in the analysis of the results of solving the problem. A software package was created using the Pascal programming language in the Delphi environment to provide design automation. These programs can be used in research design at the initial stages of design.

Development of Protocol-Independent Modular Architecture for Three Axis Force Sensor Data Processing

The protocol-independent architecture for three axis force sensor data processing is considered. The force sensor is based on a MLX90393 triaxial magnetic sensor, capable of transmitting data via SPI protocol or I2C protocol, depending on the force sensor modification. The data generated by the MLX90393 requires additional processing before usage. To address this issue a software library is developed. Such a library shall provide means for protocol selection based on the force sensor modification. Three alternative architectural library implementations are consid­ered: the two independent program modules for both SPI and I2C protocol data transmission and processing, the two dependent program modules for SPI and I2C data transmission and one template-based module for the data processing, the two dependent program modules for SPI and I2C data transmission based on a single abstract class and the data processing module working with a pointer to the abstract class implementation. Three experimental library implementations are developed, nine experiments are performed with varying library usage setups, supplemented with one experiment with no data processing for the reference. Various criteria are considered, both quantitative and qualitative, including, but not limited to the compiled program size and the ease of library integration. The experimental results are analysed with the help of stated criteria, conclusions and practical recommendations are made.

Expanding the Functionality of Optical CAD Using the Python Scripting Language

Nowadays, scripting is becoming a basic functionality in a very large number of different applications. This paper considers the experience of expanding the program capabilities of the optical modeling system using the Python scripting language. A brief overview of existing solutions is discussed. The approach based on the method of using the unified entity interface is proposed, which makes the process of expansion of the system simple and convenient for both its developers and end users. The new program modules like script interpreter,script editor and built-in parametric object libraries have been designed and integrated into the optical modeling system to work with scenarios are considered in detail. Software extension mechanism by means of adding new script-based object classes is provided. Examples of using Python API for a number of simple operations and examples of work with some simulation and automation modules based on scenarios are considered.

IS KOMI-YAZVA SEPARATE LANGUAGE OR KOMI-PERMIAN’S DIALECT?

The question of Komi-Yazva separate language or Komi-Permian dialects is currently open. There are different opinions: linguists of the late XIX - early XX cent. suggested that it is a dialect. In the early XXI cent. opinions of the scientists were divided and some experts supposed that Komi-Yazva can be a separate language. Currently, on the LinguoDoc platform there are special program modules, which reproduce the etymologist's big data analysis results, as well as 16 dictionaries of Komi dialect related languages with etymological connections. These are audio dictionaries, materials for which were collected in 2015-2018, and archival dictionaries of the XVIII-XIXcent. As a result of the dictionaries’ processing with the use of special comparative-historical module for phonetic and etymological criteria, it was found that the distance from the Komi-Yazva to the modern dialects of the Komi-Zyryan and Komi-Permyak languages is significantly greater than between the latter two ones, so in terms of phonetic changes, Komi-Yazva is currently a separate language. In the XVIII. cent. Komi-Yazva was close to the Komi-Permyak dictionaries recorded by P. S. Pallas and Nikita Ovchinnikov. As the analysis shows, 250 years ago, Komi-Yazva and Komi-Permyak languages had only minor dialect differences, but over the next two centuries, the Komi-Permyak dialects had many innovative changes, which brought them closer to the Komi-Zyryan dialects of the Komi Republic, whereas the Komi-Yazva language presents the archaic stage of Komi languages: the features, which were the characteristics of the Komi-Permyak first dictionaries in the XVIII-th. century.