Generic Model for Adaptive Systems Realization

The permanent acquisition of the technical environment state and the ability to react to changes in this environment as well as to adapt to it are nowadays crucial for any information system. In this article, the authors present a well-defined model to guarantee in a simple way the design and the realization of adaptive information systems. This model is based on the Unified Modeling Language (UML) which is a widely known modeling standard. Its coverage is limited to bringing out the graded parties in the design of adaptive information systems. A future definition of a metamodel less related to UML language is therefore possible. The authors also present a code generator based on a model transformation technique. This generator allows you to partially produce domain-specific code as needed. A more complete code generator will come to ensure automatic generation of the code.

Generic Model for Adaptive Systems Realization

The permanent acquisition of the technical environment state and the ability to react to changes in this environment as well as to adapt to it are nowadays crucial for any information system. In this article, the authors present a well-defined model to guarantee in a simple way the design and the realization of adaptive information systems. This model is based on the Unified Modeling Language (UML) which is a widely known modeling standard. Its coverage is limited to bringing out the graded parties in the design of adaptive information systems. A future definition of a metamodel less related to UML language is therefore possible. The authors also present a code generator based on a model transformation technique. This generator allows you to partially produce domain-specific code as needed. A more complete code generator will come to ensure automatic generation of the code.

Fully roll-to-roll gravure printed 4-bit code generator based on p-type SWCNT thin-film transistors

Current Si-based technologies have reached their intrinsic limits in meeting the demands of flexible electronics where free-form factors and low cost are critical for successful applications. For this reason, roll-to-roll (R2R) gravure printing has been considered a way to achieve the free-form factor and the low cost. However, the R2R gravure systems (servomechanism, electronic ink, printing process, and device design) could not integrate a number of thin-film transistors (TFTs) with small threshold voltage (Vth) variations. Therefore, we designed a 4-bit code generator by combining one ring oscillator, 6 NAND gates, and one OR gate based on 37 p-type single-walled carbon nanotube (SWCNT) TFTs as a concept devices to test the R2R gravure system. First, ring oscillators with different physical dimensions were printed on a poly (ethylene terephthalate) (PET) roll using the R2R gravure. Then, we extracted important factors (channel length, channel width, and SWCNT network density) to optimize the Vth variation and demonstrated a 4-bit code generator integrated with 37 p-type TFTs. This work will be further extended in the near future to develop R2R gravure printed Near-Field Communication labels for smart packaging.

Area-Efficient Universal Code Generator for GPS L1C and BDS B1C Signals

Recently, multi-frequency multi-constellation receivers have been actively studied, which are single receivers that process multiple global navigation satellite system (GNSS) signals for high accuracy and reliability. However, in order for a single receiver to process multiple GNSS signals, it requires as many code generators as the number of supported GNSS signals, and this is one of the problems that must be solved in implementing an efficient multi-frequency multi-constellation receiver. This paper proposes an area-efficient universal code generator that can support both GPS L1C signals and BDS B1C signals. The proposed architecture alleviates the area problem by sharing common hardware in a time-multiplex mode without degrading the overall system performance. According to the result of the synthesis using the CMOS 65 nm process, the proposed universal code generator has an area reduced by 98%, 93%, and 60% compared to the previous memory-based universal code generator (MB UCG), the Legendre-generation universal code generator (LG UCG), and the Weil-generation universal code generator (WG UCG), respectively. Furthermore, the proposed generator is applicable to all Legendre sequence-based codes.

QR Code DIGITALISASI MANAJEMEN SISTEM DOKUMEN MENGGUNAKAN QR CODE GENERATOR DAN DIGITAL SIGNATURE

Digitalisasi dokumen merupakan suatu langkah dalam kemampuan serta optimalisasi tempat penyimpanan dan keamanan, pengisian, pencetakan, perekapan data – data sehingga mengurangi penggunaan dokumen hardcopy dan legalitas dokumen tetap utuh. Namun, pada Universitas Singaperbangsa Karawang masih terjadi masalah kehilangan atau perusakan data Mahasiwa yang diakibatkan belum optimalnya sistem digitalisasi dokumen sehingga masih banyak data yang belum tervalidasi. Penelitian ini bertujuan untuk membuat sebuah sistem yang dapat membuktikan validasi digitalisasi dokumen dengan menerapkan QR Code dan Digital Signature. Adapun rancangan penelitian ini menggunakan metode SDLC model Prototype. tahapan yang akan dijalankan pada penelitian ini dibagi menjadi enam, yaitu pemilihan logika kode Hash, pengembangan antarmuka aplikasi berbasis web, pembuatan private key dan public key, pengembangan antarmuka aplikasi berbasis mobile, integrasi fungsi yang dibuat dengan aplikasi web, dan integrasi fungsi yang dibuat dengan aplikasi mobile. Hasil penelitian ini diharapkan bisa digunakan dalam pengelolaan sebuah dokumen dalam bentuk fisik ke dalam bentuk digital dengan menggunakan QR code.

Area-Efficient Universal Code Generator for Multi-GNSS Receivers

Although conventional global navigation satellite systems (GNSS) receivers were originally designed for single signals, studies on multi-signal receiver design have recently been actively conducted to achieve high accuracy, precision, and reliability. However, in order for a multi-signal receiver to support various codes, the receiver should support the generation of individual codes. Therefore, the resulting problem of increased complexity must be solved. This paper proposes a hardware structure for an area-efficient linear feedback shift register (LFSR)-based multi-frequency universal code generator. Whereas the existing universal code generators were configured so that feedback polynomials, output registers, and initial values can be selected by placing read-only memories (ROMs), multiplexers (MUXs), and exclusive ORs (XORs) by register bit, in the case of the proposed universal code generator; the circuit was implemented by applying the hardwiring technique to those register bits that have fixed values. According to the results of field programmable gate array (FPGA) implementation, the proposed LFSR-based universal code generator can improve look up table (LUT) by up to 37% and register by up to 78% when compared to conventional code generators, and LUT by up to 36% when compared to the previous universal code generator. Therefore, the proposed universal code generator is a good candidate for implementing multi-frequency receivers to achieve high precision and high reliability.

SymPKF (v1.0): a symbolic and computational toolbox for the design of parametric Kalman filter dynamics

Recent research in data assimilation has led to the introduction of the parametric Kalman filter (PKF): an implementation of the Kalman filter, whereby the covariance matrices are approximated by a parameterized covariance model. In the PKF, the dynamics of the covariance during the forecast step rely on the prediction of the covariance parameters. Hence, the design of the parameter dynamics is crucial, while it can be tedious to do this by hand. This contribution introduces a Python package, SymPKF, able to compute PKF dynamics for univariate statistics and when the covariance model is parameterized from the variance and the local anisotropy of the correlations. The ability of SymPKF to produce the PKF dynamics is shown on a nonlinear diffusive advection (the Burgers equation) over a 1D domain and the linear advection over a 2D domain. The computation of the PKF dynamics is performed at a symbolic level, but an automatic code generator is also introduced to perform numerical simulations. A final multivariate example illustrates the potential of SymPKF to go beyond the univariate case.