Tool Integration for Automated Synthesis of Distributed Embedded Controllers

Controller design and their software implementations are usually done in isolated design spaces using respective COTS design tools. However, this separation of concerns can lead to long debugging and integration phases. This is because assumptions made about the implementation platform during the design phase—e.g., related to timing—might not hold in practice, thereby leading to unacceptable control performance. In order to address this, several control/architecture co-design techniques have been proposed in the literature. However, their adoption in practice has been hampered by the lack of design flows using commercial tools. To the best of our knowledge, this is the first article that implements such a co-design method using commercially available design tools in an automotive setting, with the aim of minimally disrupting existing design flows practiced in the industry. The goal of such co-design is to jointly determine controller and platform parameters in order to avoid any design-implementation gap , thereby minimizing implementation time testing and debugging. Our setting involves distributed implementations of control algorithms on automotive electronic control units ( ECUs ) communicating via a FlexRay bus. The co-design and the associated toolchain Co-Flex jointly determines controller and FlexRay parameters (that impact signal delays) in order to optimize specified design metrics. Co-Flex seamlessly integrates the modeling and analysis of control systems in MATLAB/Simulink with platform modeling and configuration in SIMTOOLS/SIMTARGET that is used for configuring FlexRay bus parameters. It automates the generation of multiple Pareto-optimal design options with respect to the quality of control and the resource usage, that an engineer can choose from. In this article, we outline a step-by-step software development process based on Co-Flex tools for distributed control applications. While our exposition is automotive specific, this design flow can easily be extended to other domains.

CORDIC Hardware Acceleration Using DMA-Based ISA Extension

The use of RISC-based embedded processors aimed at low cost and low power is becoming an increasingly popular ecosystem for both hardware and software development. High-performance yet low-power embedded processors may be attained via the use of hardware acceleration and Instruction Set Architecture (ISA) extension. Recent publications of AI have demonstrated the use of Coordinate Rotation Digital Computer (CORDIC) as a dedicated low-power solution for solving nonlinear equations applied to Neural Networks (NN). This paper proposes ISA extension to support floating-point CORDIC, providing efficient hardware acceleration for mathematical functions. A new DMA-based ISA extension approach integrated with a pipeline CORDIC accelerator is proposed. The CORDIC ISA extension is directly interfaced with a standard processor data path, allowing efficient implementation of new trigonometric ALU-based custom instructions. The proposed DMA-based CORDIC accelerator can also be used to perform repeated array calculations, offering a significant speedup over software implementations. The proposed accelerator is evaluated on Intel Cyclone-IV FPGA as an extension to Nios processor. Experimental results show a significant speedup of over three orders of magnitude compared with software implementation, while applied to trigonometric arrays, and outperforms the existing commercial CORDIC hardware accelerator.

NEW OPPORTUNITIES FOR HIGH-PERFORMANCE SIMULATIONS OF NANOSYSTEM USING METROPOLIS SOFTWARE

Описана архитектура и программное обеспечение Metropolis для проведения компьютерного моделирования методом Монте-Карло, а также его модификации. В качестве потенциала используется потенциал сильной связи, однако это не исключает возможности использования других модификаций апробированных многочастичных потенциалов. В сравнении с предыдущими программными реализациями метода Монте-Карло данная модификация увеличила скорость расчетов в 700 раз для выбранного размера наночастицы. Представлены данные по сходимости результатов моделирования методом Монте-Карло на примере температуры плавления. Разработанный программный комплекс постоянно апробируется для расчетов различных моно- и многокомпонентных наночастиц и наносистем. Полученные результаты показывают достаточно хорошее согласие с другими численными методами, в первую очередь с молекулярной динамикой, и реальным экспериментом. Дальнейшее развитие программного комплекса и улучшение показателей эффективности его работы планируется с использованием параллелизации вычислений и использование технологии вычислений на графических процессорах CUDA. The architecture and software Metropolis for computer simulation by the Monte Carlo method, as well as its modifications, are described. The tight-binding potential that does not exclude the possibility of using other modifications of many-body potentials. In comparison with previous software implementations of the Monte Carlo method, this modification has increased the rate of calculations by 700 times for a selected nanoparticle size. The data on the convergence of the results of modeling by the Monte Carlo method are presented on the example of the melting point. The developed software package is constantly tested for calculations of various mono- and multicomponent nanoparticles and nanosystems. The results obtained show fairly good agreement with other numerical methods, primarily molecular dynamics, and real experiment. Further development of the software package and its performance indicators are planned to be improved using parallelization of computations and the use of computing technology on graphics processors CUDA.

Implementation of Hardware-Based Expert Systems and Comparison of Their Performance to Software-Based Expert Systems

Expert systems are a form of highly understandable artificial intelligence that allow humans to trace the decision-making processes that are used. While they are typically software implemented and use an iterative algorithm for rule-fact network processing, this is not the only possible implementation approach. This paper implements and evaluates the use of hardware-based expert systems. It shows that they work accurately and can be developed to parallel software implementations. It also compares the processing speed of software and hardware-based expert systems, showing that hardware-based systems typically operate two orders of magnitude faster than the software ones. The potential applications that hardware-based expert systems can be used for and the capabilities that they can provide are discussed.

An Efficient Algorithm for Solving the Applied Problem Scheduling Optimization of a Parallel-Sequential System

The problem of optimal regulation of airline fleet schedules by reassigning aircraft to flights is considered. The optimal regulation of schedules is to create or change them in such a way that minimizes system losses due to current violations. As an estimate of losses, the total deviation of the adjusted schedule from the spetified departure schedules of aircraft is used. It is shown that the described technological system belongs to the category of parallel-sequential systems. Accordingly, the considered system control problem is NP-hard and does not have effective algorithms for exact solution. A brief overview of approaches to solving its modifications and related fleet management tasks is given. The original formal formulation is given, the decomposition of the problem is justified, and an algorithm for its approximate solution is presented. An illustrative example is given and comparative statistics of testing software implementations of the decomposition algorithm of the schedule control problem on real data are reflected, proving the actual effectiveness of the developed tools.

Algorithms for forming the coefficient matrix of a system of differential equations Chapman-Kolmogorov models of non-stationary service systems

The paper considers a new approach to building models of nonstationary service systems based on: the formation of all possible states of a nonstationary service system with a finite number of applications and rules of transition between them; the formation of the coefficient matrix of Chapman-Kolmogorov differential equation system; the numbering procedure for all states. A critical analysis is made of the algorithms for the formation of the coefficient matrix and the numbering procedure for all states: sequential, recursive and recursive with grouping. Its comparison with the recursive algorithm is given, as well as the optimal structure for storing the list of states for the sequential algorithm. Recommendations for the practical application of software implementations of the considered algorithms are discussed. Theoretical foundations for building and calculating models of nonstationary service systems have been developed. It is compared to the recursive algorithm. The optimal structure for storing the list of states for a sequential algorithm is given.

Analysis and software implementation of the modified cryptographic Vernam cipher and the Caesar cipher

Problem. Modern cryptography is a very important part of cybersecurity and confidentiality of many operations. It covers almost all parts of our lives, from e-commerce to specialized education of students. Goal. The advantage of symmetric key cryptography is that working with this method is very easy for users, as one key is used for encryption, as well as for decryption purposes, and this key must be secret and should be known only to the sender and recipient and no one else. On the other hand, public key cryptography has two keys. Unfortunately, this exposes the inherent security flaws, as the integrity of the encryption depends entirely on the password. It was decided to consider the implementation of a modified symmetric Vernam cipher that avoids these problems, and its modification and experimental studies should further strengthen data protection. Methodology. Higher mathematics, linear algebra are very important subjects. But if we want to encourage students with cryptography, we need to use all aspects of the IT cluster more effectively. Ideal for this is the implementation of algorithms and programs using programming languages. It is very important and useful for students studying Cybersecurity to illustrate where and how it is possible to create software implementations of encryption / decryption methods. Results. The article presents the analysis and implementation of the modified cryptographic Vernam cipher and Caesar cipher using a concept that combines modern programming languages and the principles of cryptography, which students study in subject-oriented specialties. Originality. An original approach to teaching Cybersecurity students by implementing ciphers using applied programming is described. Practical value. Using cryptography as a learning tool will help students develop their programming skills and effectively understand the concept of cybersecurity in real-world examples.

Semi-Automatic Locating of Cryptographic Operations in Side-Channel Traces

Locating a cryptographic operation in a side-channel trace, i.e. finding out where it is in the time domain, without having a template, can be a tedious task even for unprotected implementations. The sheer amount of data can be overwhelming. In a simple call to OpenSSL for AES-128 ECB encryption of a single data block, only 0.00028% of the trace relate to the actual AES-128 encryption. The rest is overhead. We introduce the (to our best knowledge) first method to locate a cryptographic operation in a side-channel trace in a largely automated fashion. The method exploits meta information about the cryptographic operation and requires an estimate of its implementation’s execution time.The method lends itself to parallelization and our implementation in a tool greatly benefits from GPU acceleration. The tool can be used offline for trace segmentation and for generating a template which can then be used online in real-time waveformmatching based triggering systems for trace acquisition or fault injection. We evaluate it in six scenarios involving hardware and software implementations of different cryptographic operations executed on diverse platforms. Two of these scenarios cover realistic protocol level use-cases and demonstrate the real-world applicability of our tool in scenarios where classical leakage-detection techniques would not work. The results highlight the usefulness of the tool because it reliably and efficiently automates the task and therefore frees up time of the analyst.The method does not work on traces of implementations protected by effective time randomization countermeasures, e.g. random delays and unstable clock frequency, but is not affected by masking, shuffling and similar countermeasures.

Best Practices for Information Architecture, Organization, and Retrieval in Digital Language Archives within University Institutional Repositories

This report presents a case study about building a working digital language archive in a hosted university institutional repository. Best practices in language documentation regarding information architecture, organization, and retrieval are considered in relation to university library commitments to resource acquisition/preservation and online cataloging/delivery systems. Despite challenges, findings suggest that constructing digital language archives in university institutional repositories may offer viable collaborative solutions for researchers unable to find suitable, pre-existing archives in which to deposit their language documentary materials. The report concludes that, in such situations, the ability to satisfy best practices may respond to the strengths/weaknesses of particular software implementations as much as it reflects the design team’s vision, as theory and method in language documentation increasingly become matters of library and information science.

DIVERSITY AES IN MIXCOLUMNS STEP WITH 8X8 CIRCULANT MATRIX

In AES MixColumns operation, the branch number of circulant matrix is raised from 5 to 9 with 8´8 circulant matrices that can be enhancing the diffusion power. An efficient method to compute the circulant matrices in AES MixColumns transformation for speeding encryption is presented. Utilizing 8´8 involutory matrix multiplication is required 64 multiplications and 56 additions in in AES Mix-Columns transformation. We proposed the method with diversity 8´8 circulant matrices is only needed 19 multiplications and 57 additions. It is not only to encryption operations but also to decryption operations. Therefore, 8´8 circlant matrix operation with AES key sizes of 128bits, 192bits, and 256 bits are above 29.1%, 29.3%, and 29.8% faster than using 4´4 involutory matrix operation (16 multiplications, 12 additions), respectively. 8´8 circulant matrix encryption/decryption speed is above 78% faster than 8´8 involutory matrix operation. Ultimately, the proposed method for evaluating matrix multiplication can be made regular, simple and suitable for software implementations on embedded systems.