Constructions of Optimal Optical Orthogonal Codes with Weights Set 5,7 via Cyclic Packing

Double-weight optical orthogonal codes are variable-weight optical orthogonal codes (OOCs), which have been widely applied in optical networks and systems. Some works have been devoted to optimal n , W , 1 , Q -OOCs with max w : w ∈ W ≤ 6 . So far, there is no explicit construction of optimal n , W , 1 , Q -OOCs with W = 5,7 . It is known that heavier-weight codewords have better code performance than lighter-weight codewords. So, in this paper, we use cyclic packing to construct two infinite classes of optimal OOCs with weights set 5,7 explicitly, for any prime p ≡ 3 mod 4 and p ≥ 7 . In addition, for 1 ≤ t < p − 1 / 2 , by breaking t blocks of size 7 into 3 of 31 p , 5,7 , 1 , 1 / 2 , 1 / 2 -OOCs and 41 p , 5,7 , 1 , 2 / 3 , 1 / 3 -OOCs, we obtain new infinite classes of optimal 31 p , 3,5,7 , 1 , 7 t / p − 1 + 6 t , p − 1 / 2 p − 1 + 6 t , p − 1 − 2 t / 2 p − 1 + 6 t -OOCs and 41 p , 3,5,7 , 1 , 14 t / 3 p − 1 + 4 t , 2 p − 1 / 3 p − 1 + 4 t , p − 1 − 2 t / 3 p − 1 + 4 t -OOCs, respectively.

IMPROVED MIN-SUM DECODING ALGORITHM FOR IRREGULAR LDPC CODES

Aналитический подход к определению оптимальной функции постобработки для минимальной операции в алгоритме MIN-SUM, ранее полученный для обычных кодов проверки на четность с низкой плотностью (LDPC-коды), распространяется на нерегулярные коды LDPC. Оптимальное выражение постобработки для нестандартного случая варьируется от одного контрольного узла к другому, а также от одной итерации к следующей. Для практического использования необходимо аппроксимировать эту оптимальную функцию. В отличие от обычного случая, когда можно было бы использовать уникальную функцию постобработки на протяжении всего процесса декодирования без потери производительности битовых ошибок, для нерегулярных кодов критически важно варьировать постобработку от одной итерации к следующей, чтобы добиться хорошей производительности. С использованием этого подхода было выявлено, что качество битовых ошибок от алгоритма распространения доверия соответствует улучшению на 1 дБ по сравнению с MIN-SUM алгоритмом без постобработки. Сначала будет представлен обзор подхода и представлена аналитическая основа для оптимальной постобработки. Далее будет представлена оптимальная функция постобработки для нерегулярных кодов и обсуждены возможные упрощения. И наконец, показаны результаты моделирования и преимущества аппроксимации We extended an analytical approach to determining the optimal post-processing function for the minimum operation in the MIN-SUM algorithm, previously obtained for conventional low density parity check codes (LDPC codes), to irregular LDPC codes. The optimal post-processing expression for the non-standard case varies from one control node to another, as well as from one iteration to the next. For practical use, it is necessary to approximate this optimal function. Unlike the usual case where one could use a unique post-processing function throughout the entire decoding process without sacrificing bit code performance, it is critical for irregular codes to distinguish post-processing from one iteration to the next in order to achieve good performance. Using this approach, we found that the quality of bit errors from the trust algorithm corresponds to an improvement of 1 level compared to the MIN-SUM algorithm without post-processing. First, we provide an overview and analytical framework for optimal post-processing. Then, we present the optimal post-processing function for irregular codes and discuss possible simplifications. Finally, we show the simulation results and the benefits of the approximation

Parallel Tiled Code for Computing General Linear Recurrence Equations

In this article, we present a technique that allows us to generate parallel tiled code to calculate general linear recursion equations (GLRE). That code deals with multidimensional data and it is computing-intensive. We demonstrate that data dependencies available in an original code computing GLREs do not allow us to generate any parallel code because there is only one solution to the time partition constraints built for that program. We show how to transform the original code to another one that exposes dependencies such that there are two linear distinct solutions to the time partition restrictions derived from these dependencies. This allows us to generate parallel 2D tiled code computing GLREs. The wavefront technique is used to achieve parallelism, and the generated code conforms to the OpenMP C/C++ standard. The experiments that we conducted with the resulting parallel 2D tiled code show that this code is much more efficient than the original serial code computing GLREs. Code performance improvement is achieved by allowing parallelism and better locality of the target code.

Modeling cesium migration through Opalinus clay: a benchmark for single- and multi-species sorption-diffusion models

Sophisticated modeling of the migration of sorbing radionuclides in compacted claystones is needed for supporting the safety analysis of deep geological repositories for radioactive waste, which requires robust modeling tools/codes. Here, a benchmark related to a long term laboratory scale diffusion experiment of cesium, a moderately sorbing radionuclide, through Opalinus clay is presented. The benchmark was performed with the following codes: CORE2DV5, Flotran, COMSOL Multiphysics, OpenGeoSys-GEM, MCOTAC and PHREEQC v.3. The migration setup was solved with two different conceptual models, i) a single-species model by using a look-up table for a cesium sorption isotherm and ii) a multi-species diffusion model including a complex mechanistic cesium sorption model. The calculations were performed for three different cesium boundary concentrations (10−3, 10−5, 10−7 mol / L) to investigate the models/codes capabilities taking into account the nonlinear sorption behavior of cesium. Generally, good agreement for both single- and multi-species benchmark concepts could be achieved, however, some discrepancies have been identified, especially near the boundaries, where code specific spatial (and time) discretization had to be improved to achieve better agreement at the expense of longer computation times. In addition, the benchmark exercise yielded useful information on code performance, setup options, input and output data management, and post processing options. Finally, the comparison of single-species and multi-species model concepts showed that the single-species approach yielded generally earlier breakthrough, because this approach accounts neither for cation exchange of Cs+ with K+ and Na+, nor K+ and Na+ diffusion in the pore water.

Evaluation of sodium boiling models using KNS-37 LOF experiments

The computational codes used in the evaluation of the ESFR-SMART reactor performance and specifically their sodium boiling models are assessed using two KNS-37 LOF experiments, i.e. L22 and L29 tests, where boiling onset and two-phase flow regime up to dry-out occurred. The well-equipped KNS-37 experimental facility provided very valuable information for understanding the physical phenomena occurring in a 37-pin subassembly under LOF conditions, as well as experimental data to be used for computational tools validation. NATOF-2D, SAS-SFR, TRACE, ASTEC-Na, CATHARE-2 & CATHARE-3 and NEPTUNE_CFD codes have been used in this exercise in order to compare the various boiling models and conclude on the advantages and limitations of them based on the comparison against the experimental data. Beyond boiling onset, the various sodium two-phase flow approaches determine the ability of the code to correctly represent the rewetting and voiding phases as well as cladding dry-out onset. A simulation performed by a CFD approach (NEPTUNE_CFD code) considering liquid-vapor interfaces by an interface-tracking method is also shown and compared with the others approaches. Conclusions on each code performance are presented where the improvements needed to solve the issues encountered are included. This paper provides a first step in the process to investigate the required evaluation of the sodium two-phase flow models able to assess the safety of new SFR core designs (e.g. low void cores) under accidental conditions such as ULOF transients.

High Performance Computing in Parallel Electromagnetics Simulation Code suite ACE3P

A comprehensive set of parallel finite-element codes suite ACE3P (Advanced Computational Electromagnetics 3D Parallel) is developed by SLAC for multi-physics modeling of particle accelerators running on massively parallel computer platforms for high fidelity and high accuracy simulation. ACE3P enables rapid virtual prototyping of accelerator and RF component design, optimization and analysis. Advanced modeling capabilities have been facilitated by implementations of novel algorithms for numerical solvers. Code performance on state-of-the-art high performance computing (HPC) platforms for large-scale RF modeling in accelerator applications will be presented in this paper. All the simulations have been performed on the supercomputers at National Energy Research Computer Center (NERSC).

Java and Kotlin code performance in selected web frameworks

This paper discusses the issue of comparing Java and Kotlin technologies based on the web application framework. The criteria taken into account for testing purposes are: execution time, memory usage, CPU load, database response in set time. A series of tests and their in-depth comparative analysis are carried out. For this case, tests and code analysis were carried out to draw comparative conclusions. The performance in terms of web frameworks, database response speed and tests implementation in different languages - in all these Kotlin proved to be less efficient. There is no significant difference between CPU load between individual easurements, the difference does not exceed 2%. Implementation in the Kotlin language has never achieved the best result in any group of measurements.

Analysis of the Blazor framework in client-hosted mode

The purpose of the article is to analyze the Blazor framework in client mode with the hosting option. A test application has been created for the purposes of testing. The application loading efficiency and the size of downloaded data were examined for the completed application. The performance in calculation tests, operations on collections and the efficiency of generating DOM elements were determined. JavaScript code performance has been compared.