Software Implementation Research Articles

Power Usage Monitoring and Overload Protection System for Distribution Transformers

Efficient energy manitoring and overload protection on distribution transformers are very much needed. This study aims to develop a power usage management system and overload protection integrated with Internet of Things (IoT) technology, with a specific target to monitor and manage power usage on distribution transformers in real time, as well as provide automatic protection against overload conditions. The methodology used in this study involves the design and implementation of hardware and software that supports wireless communication and data analysis. This system is also equipped with a power reading and protection mechanism that can automatically cut off the electricity flow when an overload detection occurs, in order to prevent damage to the transformer, it is expected that this system can increase the efficiency of power usage management and provide a quick response to overload conditions. The implementation of this system is expected to reduce operational costs and increase the reliability of electricity supply on the distribution network. Based on the tests that have been carried out, it has been proven that the system has worked well in maintaining important variables in the power usage management system and overload protection on the Internet of Things integrated distribution transformer.

Rancang Bangun Aplikasi Digital Library Berbasis Web Menggunakan Framework Laravel Pada Desa Tugu Utara

This study develops a web-based digital library application in Desa Tugu Utara using the Laravel framework. The main problem is the inability of the Desa Tugu utara library system to efficiently and modernly manage and provide information. This application provides features such as digital books, online book borrowing and returning, book searching and filtering, interactive education in the form of quizzes, and library management that facilitates admin tasks. The development follows the waterfall method, including Requirements Definition, System and Software Design, Implementation, and Integration and System Testing. Requirements Definition analysis identified 22 main functional requirements. System design uses UML diagrams, such as Use Case Diagrams, Activity Diagrams, Class Diagrams, and Entity-Relationship Diagrams (ERD). The UI/UX design was created with Figma for easy layout and navigation. System testing with blackbox, integration testing, and validation testing ensures all components function well and meet user needs. System Usability Scale (SUS) testing shows excellent usability with an average score of 85.20. Overall, this application achieves the research objectives and shows significant potential in digital library management in Desa Tugu Utara.

Validation of the SISRE-P Software for Teaching Reflection in Mathematical Didactics using the DELPHI Method

This research addresses the use of software in the mathematics education process, which has been growing in popularity and has proven to be a valuable tool to improve teaching and learning. The study aimed to validate the SISRE-P software in the teaching of mathematics, with the purpose of reducing the gap between theory and educational practice, and improving pedagogical practice. From the methodological point of view, a qualitative, cross-sectional and descriptive study was carried out, using the Delphi method for the validation of the instrument, which was applied to 36 teachers. For its development, a questionnaire was applied in the form of interviews, which were sent through Google Forms, through the process, they were analyzed to evaluate the effectiveness of SISRE-P. Within the results obtained, it is observed that the implementation of the SISRE-P software demonstrates its effectiveness to improve teaching practice in mathematics teaching. Recurrent participation in weekly reflective sessions, both in pedagogical pairs and with colleagues or individually, has strengthened the reflective process through methods such as class recording, collaborative conversations and records in field diaries. It is concluded that SISRE-P is an effective tool to enhance teaching practice in the teaching of mathematics. Its constant use in reflective sessions strengthens the process of teacher self-reflection and is fundamental within the constructivist pedagogical framework, focused on student autonomy and the active construction of knowledge.

Processing Next-Generation Mass Spectrometry Imaging Data: Principal Component Analysis at Scale.

Mass spectrometry imaging (MSI) is constantly improving in spatial resolving power, throughput and mass resolution. Although beneficial, these improvements increase data set size and content. The larger data requires correspondingly fast computer-based analyses. However, these analyses often do not scale well with increased data size. Principal component analysis (PCA) is an important analytical tool commonly used with MSI data; however, most PCA algorithms load and process the entire data set within random access memory (RAM) which is most often insufficient for large data sets. PCA algorithms that use less RAM than the data set exist but are usually much slower or sacrifice precision and are rarely used for MSI data processing. Incremental PCA (IPCA) is an alternative algorithm that avoids large RAM allocations while also preserving speed and analytical precision. Here, we demonstrate and benchmark the use of differing implementations of IPCA, PCA, and commercial software on large and often complex MSI data sets. We show that using an already-published Python-based IPCA algorithm, IPCA can be successfully applied to MSI data sets too large to fit with RAM. Furthermore, our benchmarks demonstrate that, contrary to expectations, IPCA is faster than all other tested PCA implementations on all large data sets that can be directly compared.

Introducing CHiDO-A No Code Genomic Prediction software implementation for the characterization and integration of driven omics.

Climate change represents a significant challenge to global food security by altering environmental conditions critical to crop growth. Plant breeders can play a key role in mitigating these challenges by developing more resilient crop varieties; however, these efforts require significant investments in resources and time. In response, it is imperative to use current technologies that assimilate large biological and environmental datasets into predictive models to accelerate the research, development, and release of new improved varieties that can be more resilient to the increasingly variable climatic conditions. Leveraging large and diverse datasets can improve the characterization of phenotypic responses due to environmental stimuli and genomic pulses. A better characterization of these signals holds the potential to enhance our ability to predict trait performance under changes in weather and/or soil conditions with high precision. This paper introduces characterization and integration of driven omics (CHiDO), an easy-to-use, no-code platform designed to integrate diverse omics datasets and effectively model their interactions. With its flexibility to integrate and process datasets, CHiDO's intuitive interface allows users to explore historical data, formulate hypotheses, and optimize data collection strategies for future scenarios. The platform's mission emphasizes global accessibility, democratizing statistical solutions for situations where professional ability in data processing and data analysis is not available.

A Fortiori Case-Based Reasoning: From Theory to Data

The widespread application of uninterpretable machine learning systems for sensitive purposes has spurred research into elucidating the decision-making process of these systems. These efforts have their background in many different disciplines, one of which is the field of AI & law. In particular, recent works have observed that machine learning training data can be interpreted as legal cases. Under this interpretation, the formalism developed to study case law, called the theory of precedential constraint, can be used to analyze the way in which machine learning systems draw on training data—or should draw on them—to make decisions. In the present work, we advance the theory underlying these explanation methods, by relating it to order theory and logic. This allows us to write a software implementation of the theory that can be used to compute with the definitions and give automatic proofs of the properties of the model. We use this implementation to evaluate the model on a series of datasets. Through this analysis, we characterize the types of datasets that are more, or less, suitable to be described by the theory.

Functional Principal Component Analysis for Continuous Non-Gaussian, Truncated, and Discrete Functional Data.

Mobile health studies often collect multiple within-day self-reported assessments of participants' behavior and well-being on different scales such as physical activity (continuous scale), pain levels (truncated scale), mood states (ordinal scale), and the occurrence of daily life events (binary scale). These assessments, when indexed by time of day, can be treated and analyzed as functional data corresponding to their respective types: continuous, truncated, ordinal, and binary. Motivated by these examples, we develop a functional principal component analysis that deals with all four types of functional data in a unified manner. It employs a semiparametric Gaussian copula model, assuming a generalized latent non-paranormal process as the underlying generating mechanism for these four types of functional data. We specify latent temporal dependence using a covariance estimated through Kendall's bridging method, incorporating smoothness in the bridging process. The approach is then extended with methods for handling both dense and sparse sampling designs, calculating subject-specific latent representations of observed data, latent principal components and principal component scores. Simulation studies demonstrate the method's competitive performance under both dense and sparse sampling designs. The method is applied to data from 497 participants in the National Institute of Mental Health Family Study of Mood Spectrum Disorders to characterize differences in within-day temporal patterns of mood in individuals with the major mood disorder subtypes, including Major Depressive Disorder and Type 1 and 2 Bipolar Disorder. Software implementation of the proposed method is provided in an R-package.

Simplified methods for variance estimation in microbiome abundance count data analysis.

The complex nature of microbiome data has made the differential abundance analysis challenging. Microbiome abundance counts are often skewed to the right and heteroscedastic (also known as overdispersion), potentially leading to incorrect inferences if not properly addressed. In this paper, we propose a simple yet effective framework to tackle the challenges by integrating Poisson (log-linear) regression with standard error estimation through the Bootstrap method and Sandwich robust estimation. Such standard error estimates are accurate and yield satisfactory inference even if the distributional assumption or the variance structure is incorrect. Our approach is validated through extensive simulation studies, demonstrating its effectiveness in addressing overdispersion and improving inference accuracy. Additionally, we apply our approach to two real datasets collected from the human gut and vagina, respectively, demonstrating the wide applicability of our methods. The results highlight the efficacy of our covariance estimators in addressing the challenges of microbiome data analysis. The corresponding software implementation is publicly available at https://github.com/yimshi/robustestimates.

Методологическое обоснование содержания, структуры и программной реализации базы геопространственных знаний территориальных образований

The article deals with substantiating the contents, structure and software implementation of the geospatial knowledge base. The importance and relevance of forming its infrastructure and the corresponding informational base on the territory in modern geoinformatics and cartography are noted. The requirements for the contents, formal and logical representation of the mentioned base, its structure and connections of the elements at the logical level are given. The authors consider the software implementation of the processes of searching and issuing geospatial knowledge in a visualized form at the request of untrained users in the field of geoinformatics and cartography. The requisitions and information on the special original software, which allows observing the contents of the geospatial knowledge base, are shown. The effectiveness of visualizing the geospatial knowledge base through interactive configuration of software elements is substantiated, based on the metadata principle proposed by the authors, two formalisms and an algorithm for creating corresponding services for geospatial knowledge and other related data. These formalisms of the client’s parameters and server software applications are described, a variant of the geospatial knowledge base structure is given, and the requirements for the necessary software for the effective solution of the task are formulated. The authors` solution is considered in the form of a complex of multicomponent software, used at working with geodata and creating their own interactive maps by poorly trained non-professional users

HClass: Fast hybrid network traffic classification with bit and keyword level signatures

Deep Packet Inspection (DPI) methods are extensively used in traffic classification. These methods extract unique application content either at byte or bit level granularity and represent them as signatures. DPI involves string or regular expression matching, which is computationally expensive, and evaluating signatures at bit-level granularity makes it even more inefficient. With the ever-increasing bandwidth and the high-speed internet traffic, the software implementations of DPI have become a performance bottleneck. In this paper, we propose HClass, a DPI-based network traffic classifier completely implemented in software to speed up signature matching. Our contributions with HClass are three-fold. First, we propose a hybrid signature matching technique with a combination of bit and byte-level signatures. Second, we propose methods to perform bit-level signature matching with byte/word level operations to cope with software implementations and be compatible with general-purpose CPU operations. Third, it uses a two-phase signature matching where first-phase signatures are short and quickly identify the potential application(s), and the second-phase signatures verify the potential application(s) to reduce false positives. We perform experiments with HClass on three datasets and report classification performance and execution time improvement of HClass with our implementations in C language.

Design of Gas Leakage Monitoring System Based on Android Application and NodeMCU ESP8266

Gas leakage is a serious problem that can threaten public safety and health and cause significant material losses. This research aims to design and implement a gas leak monitoring system that can be accessed remotely based on Android applications and NodeMCU ESP8266. NodeMCU ESP8266 is chosen as the main microcontroller equipped with an MQ-2 gas sensor to detect the presence of hazardous gas. This research incorporates Internet of Things (IoT) technology to allow users to remotely monitor the condition of gas leaks, thereby increasing the level of safety in the use of gas in households or small industries. The hardware design includes the use of an MQ-2 gas sensor that is sensitive to certain gas concentrations, as well as setting up an ESP8266 NodeMCU to transmit detection data to a Firebase server for later access through an Android application. The Android application was developed using Android Studio with a focus on an intuitive user interface to monitor the status of gas leaks in real-time. he research methods used include system design, hardware and software implementation, and thorough system testing by simulating gas leak scenarios to test the reliability and response of the system. The results show that the system can detect gas leaks with high accuracy. It is expected that the system developed in this research can be a practical and effective solution in reducing the risk of accidents caused by gas leaks, as well as making a positive contribution in increasing awareness of the safety of gas use in the community.

Nonlinear control of the permanent magnet synchronous motor PMSM using input-output linearization control and sliding mode control

Today, electric machines are becoming increasingly important in all sectors (industrial drives, the automotive industry, aviation, traction systems, and agriculture, etc.). Among these machines, permanent magnet synchronous machines (PMSMs) hold a significant place in the control of industrial mechanisms, automated systems, and in the fields of renewable energy like (wind energy, solar energy, and hybrid systems, etc ). Currently, in variable speed drives, the use of PMSM, especially for low power and certain special industrial applications, is replacing DC motors and asynchronous motors because they offer higher efficiency, power factor, and torque density. Moreover, PMSM do not have an excitation circuit in the rotor, which leads to reduced maintenance demands. The control of permanent magnet synchronous machines (PMSM) presents significant challenges due to their nonlinear behavior. Classical linear controllers, such as PI, perform well with linear systems that have constant parameters. However, for nonlinear systems with varying parameters, the conventional control methods may prove insufficient and exhibit a lack of robustness. To address the issues and achieve decoupled machine control, various methods have been proposed. Nonlinear robust control techniques have been extensively explored within the domain of power electronics and drive systems. Included in these, sliding mode control and nonlinear input-output feedback linearization (IOFL). Sliding mode control (SMC) is a control technique known for its excellent dynamic performance in PMSM drives. It offers high robustness and straightforward implementation in both software and hardware. However, a significant drawback of this method is the chattering phenomenon. By the way the input/output linearization control can provide good behavior in steady and dynamic regimes and also provides good decoupling between system variables. This article presents a design of tow control laws based on sliding mode and feedback linearization controller based on input-output feedback linearization to adjust the speed of a permanent magnet synchronous motor (PMSM). To highlight the effectiveness of the designed controllers, a comparison was carried out Matlab Simulink, revealing that the feedback linearization controller outperforms the SMC.

Research on Medical Device Software Based on Artificial Intelligence and Machine Learning Technologies

With the rapid development of Artificial Intelligence (AI) and Machine Learning (ML) technologies, new opportunities for innovation and application in medical device software have emerged. This paper explores the current research on medical device software based on AI and ML, analyzing the practical applications and outcomes of these technologies in the medical field. First, the basic concepts of AI and ML and their significance in medical devices are introduced. Then, an in-depth analysis of the functional requirements of medical device software, user experience, and relevant regulations is provided. Next, the paper discusses the specific applications of AI and ML in data processing, model training, and software implementation, showcasing their practical effects through case studies. Finally, the paper summarizes the current technical challenges and future opportunities, hoping to provide insights for further development in the medical device industry.

Improved Execution Efficiency of FPE Scheme Algorithm Based on Structural Optimization

The model of preserving a format encryption scheme based on a Feistel structure has developed rapidly and has been widely used in recent years. In this paper, the software implementation of the FF1 algorithm for the model was presented, and its execution efficiency was evaluated. Then, the efficiency bottleneck problem and its causes were identified. Based on the above analysis results, optimization methods were given from the perspectives of prepossessing, algorithm structure, and format conversion function, and implementation plans were provided. Finally, the simulation results show that the optimized performance improvement is significant, and the degree of performance improvement increases with the increase in plain text length.

Disinformation, Fakes and Propaganda Identifying Methods in Online Messages Based on NLP and Machine Learning Methods

A new method of propaganda analysis is proposed to identify signs and change the dynamics of the behaviour of coordinated groups based on machine learning at the processing disinformation stages. In the course of the work, two models were implemented to recognise propaganda in textual data - at the message level and the phrase level. Within the framework of solving the problem of analysis and recognition of text data, in particular, fake news on the Internet, an important component of NLP technology (natural language processing) is the classification of words in text data. In this context, classification is the assignment or assignment of textual data to one or more predefined categories or classes. For this purpose, the task of binary text classification was solved. Both models are built based on logistic regression, and in the process of data preparation and feature extraction, such methods as vectorisation using TF-IDF vectorisation (Term Frequency – Inverse Document Frequency), the BOW model (Bag-of-Words), POS marking (Part-Of-Speech), word embedding using the Word2Vec two-layer neural network, as well as manual feature extraction methods aimed at identifying specific methods of political propaganda in texts are used. The analogues of the project under development are analysed the subject area (the propaganda used in the media and the basis of its production methods) is studied. The software implementation is carried out in Python, using the seaborn, matplotlib, genism, spacy, NLTK (Natural Language Toolkit), NumPy, pandas, scikit-learn libraries. The model's score for propaganda recognition at the phrase level was obtained: 0.74, and at the message level: 0.99. The implementation of the results will significantly reduce the time required to make the most appropriate decision on the implementation of counter-disinformation measures concerning the identified coordinated groups of disinformation generation, fake news and propaganda. Different classification algorithms for detecting fake news and non-fakes or fakes identification accuracy from Internet resources ana social mass media are used as the decision tree (for non-fakes identification accuracy 0.98 and fakes identification accuracy 0.9903), the k-nearest neighbours (0.83/0.999), the random forest (0.991/0.933), the multilayer perceptron (0.9979/0.9945), the logistic regression (0.9965/0.9988), and the Bayes classifier (0.998/0.913). The logistic regression (0.9965) the multilayer perceptron (0.9979) and the Bayesian classifier (0.998) are more optimal for non-fakes news identification. The logistic regression (0.9988), the multilayer perceptron (0.9945), and k-nearest neighbours (0.999) are more optimal for identifying fake news identification.

Implementation of Software for Learning Message Transmission Using Morse Code

The article presents the implementation of software for training message transmission using Morse code. This is a method of sign coding when letters of the alphabet, numbers, punctuation marks and other symbols are represented as sequences of short and long signals called dots and dashes. It is intended for transmission over serial communication channels. A unique feature of Morse code is the ability to be encoded and decoded by humans without the use of special terminal devices. The paper shows a software implementation of processing input characters using a telegraphic key, it includes: various mathematical requirements and conditions that allow you adjusting to each user, provided that his input speed will either fall or remain unchanged. However, it is possible to adjust the minimum duration threshold in such a way that the system will slowly adapt to a slow increase in input speed. At the same time, the higher the value of the minimum threshold, the faster the adaptation is; however, it will fall within the limit of the maximum input speed that the device can recognize. During the implementation of the program, a flow chart of message transliteration, signal reception and transmission was developed. The whole program implements the following functions: a simple and intuitive translator, with audio output, a simulator for consolidating the skill of entering Morse code using a key; consolidating the skills of recognition and decoding by ear. To create the final application for training, the Processing toolkit was chosen, since its key parameter when choosing a development tool has a simple writing syntax to increase the speed of writing code, as well as the ability of the environment to work with the communication channel of the microcontroller.

Efficiently Detecting Masking Flaws in Software Implementations

Software implementations of cryptographic algorithms often use masking schemes as a countermeasure against side channel attacks. A number of recent results show clearly the challenge of implementing masking schemes in such a way, that (unforeseen) micro-architectural effects do not cause masking flaws that undermine the intended security goal of an implementation. So far, utilising a higher-order version of the non-specific (fixed-vs-random) input test of the Test Vector Leakage Assessment (TVLA) framework has been the best option to identify such flaws. The drawbacks of this method are both its significant computation cost, as well as its inability to pinpoint which interaction of masking shares leads to the flaw. In this paper we propose a novel version, the fixed-vs-random shares test, to tackle both drawbacks. We explain our method and show its application to three case studies, where each time it outperforms its conventional TVLA counterpart. The drawback of our method is that it requires control over the shares, which, we argue, is practically feasible in the context of in-house evaluation and testing for software implementations.

Truncated multiplication and batch software SIMD AVX512 implementation for faster Montgomery multiplications and modular exponentiation

This paper presents software implementations of batch computations, dealing with multi-precision integer operations. In this work, we use the Single Instruction Multiple Data (SIMD) AVX512 instruction set of the x86-64 processors, in particular the vectorized fused multiplier-adder VPMADD52. We focus on batch multiplications, squarings, modular multiplications, modular squarings and constant time modular exponentiations of 8 values using a word-slicing storage. We explore the use of Schoolbook and Karatsuba approaches with operands up to 4108 and 4154 bits respectively. We also introduce a truncated multiplication that speeds up the computation of the Montgomery modular reduction in the context of software implementation. Our Truncated Montgomery modular multiplication improvement offers speed gains of almost 20 % over the conventional non-truncated versions. Compared to the state-of-the-art GMP and OpenSSL libraries, our speedup modular operations are more than 4 times faster. Compared to OpenSSL BN_mod_exp_mont_consttimex2 using AVX512 and madd52* (madd52hi or madd52lo) in 256-bit registers, in fixed-window exponentiations of sizes 1024 and 2048 , our 512-bit implementation provides speedups of respectively 1.75 and 1.38, while the 256-bit version speedups are 1.51 and 1.05 for 1024 and 2048 -bit sizes (batch of 4 values in this case).

Analysis of NR and LTE Target Signal Structure Based on Neural Network Approach and Deep Learning Methods

Purpose: the rapid development and consolidation of broadband wireless access networks of the fourth 4G LTE and fifth 5G NR generations determine the need to find ways to reuse frequencies. A well-known solution to this problem is the concept of cognitive radio. The use of artificial intelligence in radio networks in general and the use of a neural network approach with deep learning for recognizing signals of LTE and NR standards in particular have serious potential for the practical implementation of frequency resource reuse according to the concept of cognitive development. The aim of the work: is to analyze models, methods and algorithms that allow recognizing signals of the NR and LTE standards based on recording samples of radio signals obtained using pre-recorded NR and LTE signals in MatLab software. In this paper, the procedures for scanning and recognizing sections of the spectrum are considered. The operations of training a semantic segmentation network for the identification of these signals in a broadband spectrogram and the use of a trained network for subsequent spectrum sensing and recognition of signals of the NR and LTE standards are investigated. Methods: the method used to test the concept of cognitive radio is spectrum sensing, which results in information about the occupancy of frequency bands in a given location by primary users, and the identification of spectrum sections available for use by secondary users without interfering with the work of primary users in real time. The novelty of the work is the use of a neural network approach in the analysis of the target NR and LTE signal. Results: the model, trained on the basis of a neural network approach and deep learning methods, is able to distinguish between signals of the NR and LTE standards. Theoretical / Practical relevance: the software implementation of spectral sensing is implemented using an extension package in the MatLab environment and allows for experimental testing of a cognitive radio receiver when performing procedures for analyzing the structure of the target signal of the NR and LTE standards based on a neural network approach and deep learning methods.

Efficient Boolean-to-Arithmetic Mask Conversion in Hardware

Masking schemes are key in thwarting side-channel attacks due to their robust theoretical foundation. Transitioning from Boolean to arithmetic (B2A) masking is a necessary step in various cryptography schemes, including hash functions, ARX-based ciphers, and lattice-based cryptography. While there exists a significant body of research focusing on B2A software implementations, studies pertaining to hardware implementations are quite limited, with the majority dedicated solely to creating efficient Boolean masked adders. In this paper, we present first- and second-order secure hardware implementations to perform B2A mask conversion efficiently without using masked adder structures. We first introduce a first-order secure low-latency gadget that executes a B2A2k in a single cycle. Furthermore, we propose a second-order secure B2A2k gadget that has a latency of only 4 clock cycles. Both gadgets are independent of the input word size k. We then show how these new primitives lead to improved B2Aq hardware implementations that perform a B2A mask conversion of integers modulo an arbitrary number. Our results show that our new gadgets outperform comparable solutions by more than a magnitude in terms of resource requirements and are at least 3 times faster in terms of latency and throughput. All gadgets have been formally verified and proven secure in the glitch-robust PINI security model. We additionally confirm the security of our gadgets on an FPGA platform using practical TVLA tests.