Search

Exascale supercomputers are first-of-their-kind instruments with potentially paradigm-shifting capabilities. However, enabling complex applications at scale and high performance can be difficult, requiring hard work and deep technical understanding. Specific programming models are often needed to achieve the desired performance, and, early on, systems are undergoing debugging and rapid development. This makes it challenging to run on new systems quickly following their deployment. The Application Integration (AppInt) area of the Exascale Computing Project was designed to be the integration point between applications, supporting software, system environments, high-performance computing facilities, and vendors. We describe how the AppInt team addressed these challenges while also promoting the use of portable and sustainable programming models and helping harden systems prior to general availability.

The Exascale Computing Project software deployment effort developed and advanced DevOps capabilities. One goal was to enable robust continuous integration (CI) workflows that span the protected high-performance computing environments found within many of the U.S. Department of Energy's (DOE's) national laboratories. This article highlights several challenges encountered with enabling automation, such as charging models for CI jobs and meeting individualized security requirements that revolve around strongly associating running code with a human identity. It also describes how the Jacamar CI tool evolved to meet later requirements and became a key aspect of the solutions currently offered. Derived from this experience, we offer a conceptual framework for understanding current and future CI challenges at DOE facilities and offer suggestions for long-term solutions.

The U.S. Exascale Computing Project (ECP) has succeeded in preparing applications to run efficiently on the first reported exascale supercomputers in the world. To achieve this, it modernized the whole leadership software stack, from libraries to simulation codes. In this article, we contrast selected leadership software before and after the ECP. We discuss how sustainable research software development for leadership computing can embrace the conversation with the hardware vendors, leadership computing facilities, software community, and domain scientists who are the application developers and integrators of software products. We elaborate on how software needs to take portability as a central design principle and to benefit from interdependent teams; we also demonstrate how moving to programming languages with high momentum, like modern C++, can help improve the sustainability, interoperability, and performance of research software. Finally, we showcase how cross-institutional efforts can enable algorithm advances that are beyond incremental performance optimization.

Javascript object notation (JSON) and extensible markup language (XML) are two data serialization methods that have been compared over many applications, including client-server transmission, Internet communication, and large-scale data storage. Due to the smaller file size, JSON is faster for transmitting data. However, XML is better for sending complex data structures. This letter compares the two data formats in the context of an embedded system, considering factors, such as time, memory, and power to identify efficient characteristics of each method. Programs for each format were written, optimized, and compared for the same dataset. The JSON file was found to be 24.7% smaller than the XML file. This led to a shorter program run-time and less power being consumed when reading and processing the file. However, the program to deserialize the XML file took up 16.7% less flash memory than its JSON counterpart. Overall, JSON was found to be a better choice for systems when collecting large amounts of data, requiring high speed communication, or running for an extended period between battery charges. However, XML is proposed for systems that have limited flash memory. [ABSTRACT FROM AUTHOR]

We study the generative power of controlled insertion systems where the control languages are special codes or ideals instead of arbitrary regular languages. [ABSTRACT FROM AUTHOR]

In a previous paper, the second and third named authors introduced the concept of the complete cycle index and discussed a relation with the complete weight enumerator in coding theory. In this paper, we introduce the concept of the complete joint cycle index and the average complete joint cycle index, and discuss a relation with the complete joint weight enumerator and the average complete joint weight enumerator, respectively, in coding theory. Moreover, the notion of the average intersection numbers is given, and we discuss a relation with the average intersection numbers in coding theory. [ABSTRACT FROM AUTHOR]

Recently, Arıkan proposed a polarization‐adjusted convolutional (PAC) codes, demonstrating their superior error correction performance over polar codes at short block lengths. It was confirmed that PAC codes approached the optimal performance achievable with limited code length. This paper proposes a novel low‐complexity list decoding algorithm for PAC codes, incorporating path splitting and pruning strategies based on a set of highly reliable information bits. Simulation results reveal that the proposed algorithm significantly reduces sorting complexity and average list size, all while incurring negligible performance loss. Unlike previous pruning algorithms designed for polar codes, the proposed strategy eliminates the need to individually assess the reliability of decoding paths in each decoding process. Instead, the algorithm minimizes redundant decoding paths through a high‐reliability information bit set, constructed using Monte Carlo experiments. [ABSTRACT FROM AUTHOR]

Political action has a long history in the health workforce. There are multiple historical examples, from civil disobedience to marches and even sabotage that can be attributed to health workers. Such actions remain a feature of the healthcare community to this day; their status with professional and regulatory bodies is far less clear, however. This has created uncertainty for those undertaking such action, particularly those who are engaged in what could be termed 'contentious' forms of action. This study explored how advocacy and activism were presented in nursing and medical codes of ethics, comparing disciplinary and temporo‐spatial differences to understand how such action may be promoted or constrained by codes. The data for this study comes from 217 codes of ethics. Because of the size of the corpus and to facilitate analysis, natural language processing was utilised, which allowed for an automated exploration of the data and for comparisons to be drawn between groups. This was complemented by a manual search and contextualisation of the data. While there were noticeable differences between medical and nursing codes, overall, advocacy, activism and even politics were rarely discussed explicitly in most codes. When such action was spoken about, this was often vague and imprecise with codes speaking of 'political action' and 'advocacy' in general terms. While some codes were far more forthright in what they meant about advocacy or broader political action (i.e., Nursing codes in Denmark, Norway, Canada) more forceful language that spoke in specific terms or in terms of oppositional or specific actions (e.g., civil disobedience or marches) was almost completely avoided. These results are discussed in relation to the broader literature on codes and the normative questions they raise, namely whether such action should be included in codes of ethics at all. [ABSTRACT FROM AUTHOR]

Given positive integers k ≤ d and a finite field F , a set S ⊂ F d is (k, c)-subspace evasive if every k-dimensional affine subspace contains at most c elements of S. By a simple averaging argument, the maximum size of a (k, c)-subspace evasive set is at most c | F | d - k . When k and d are fixed, and c is sufficiently large, the matching lower bound Ω (| F | d - k) is proved by Dvir and Lovett. We provide an alternative proof of this result using the random algebraic method. We also prove sharp upper bounds on the size of (k, c)-evasive sets in case d is large, extending results of Ben-Aroya and Shinkar. The existence of optimal evasive sets has several interesting consequences in combinatorial geometry. We show that the minimum number of k-dimensional linear hyperplanes needed to cover the grid [ n ] d ⊂ R d is Ω d (n d (d - k) d - 1 ) , which matches the upper bound proved by Balko et al., and settles a problem proposed by Brass et al. Furthermore, we improve the best known lower bound on the maximum number of incidences between points and hyperplanes in R d assuming their incidence graph avoids the complete bipartite graph K c , c for some large constant c = c (d) . [ABSTRACT FROM AUTHOR]

Copyright of Lesan-on Mobeen-on is the property of Imam Khomeini International University and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

We study the generative power of controlled insertion systems where the control languages are special codes or ideals instead of arbitrary regular languages.

Abstract Recently, Arıkan proposed a polarization‐adjusted convolutional (PAC) codes, demonstrating their superior error correction performance over polar codes at short block lengths. It was confirmed that PAC codes approached the optimal performance achievable with limited code length. This paper proposes a novel low‐complexity list decoding algorithm for PAC codes, incorporating path splitting and pruning strategies based on a set of highly reliable information bits. Simulation results reveal that the proposed algorithm significantly reduces sorting complexity and average list size, all while incurring negligible performance loss. Unlike previous pruning algorithms designed for polar codes, the proposed strategy eliminates the need to individually assess the reliability of decoding paths in each decoding process. Instead, the algorithm minimizes redundant decoding paths through a high‐reliability information bit set, constructed using Monte Carlo experiments.

Teaching outdoors is an obligatory part of physical education (PE) in most countries; therefore, PE holds great potential to contribute to learning about nature, the environment and environmental sustainability (ES). This paper reports the investigation of whether Swedish PE teachers perceive ES as part of their subject, and if so, how do they implement it? Drawing on 60 PE teachers’ answers to five opened questions (53 written answers and 7 oral interviews), and using British sociologist Basil Bernstein’s concepts of classification and codes, this study have asked the following research questions: 1. What influences the position and legitimisation of ES in PE? 2. How does the subject culture of Swedish PE influence the introduction of ES? The result from the study shows a complexity regarding the strength of the boundaries that surround ES in PE and what this complexity might offer in terms of enablers and constraints. The result also displays a strong connection between outdoor education and its potential for teaching ES. Various options are discussed with regard to where (in what content areas in PE) and how to implement ES. [ABSTRACT FROM AUTHOR]

Personality determines various human daily and working behaviours. Recently, a large number of automatic personality computing approaches have been developed to predict either the apparent or self-reported personality of the subject based on non-verbal audio-visual behaviours. However, most of them suffer from complex and dataset-specific pre-processing steps and model training tricks. In the absence of a standardized benchmark with consistent experimental settings, it is not only impossible to fairly compare the real performances of these personality computing models but also makes them difficult to be reproduced. This paper presents the first reproducible audio-visual benchmark to provide a fair and consistent evaluation of eight existing personality computing models (e.g., audio, visual and audio-visual) and seven standard deep learning models on both self-reported and apparent personality recognition tasks. Building upon a set of benchmarked models, we also investigate the impact of two previously-used long-term modelling strategies for summarising short-term/frame-level predictions on personality computing results. We comprehensively investigate all benchmarked models on two publicly available datasets, ChaLearn First Impression and UDIVA self-reported personality datasets, and conclude: (i) apparent personality traits, inferred from facial behaviours by most benchmarked deep learning models, show more reliability than self-reported ones; (ii) visual models frequently achieved superior performances than audio models on personality recognition; (iii) non-verbal behaviours contribute differently in predicting different personality traits; and (iv) our reproduced personality computing models generally achieved worse performances than their original reported results. [ABSTRACT FROM AUTHOR]

Environmental deterioration is a significant and multi-dimensional issue that concerns the modern world. During the last decades, research has been conducted to address this argument, intending to provide holistic policies that drive sustainable development. However, the European Union (EU) should further provoke the complementarity between growth and environmental quality. Recognizing that gender equality must be introduced in Agenda (2030), this paper intends to examine the impact of well-established macroeconomic and socioeconomic variables in existing literature alongside the role of women in governance. More specifically, this study uses panel data analysis to investigate the understanding of the effects of economic growth, renewable energy, human capital, female representation in parliaments, and environmental regulation on carbon dioxide (CO2) emissions in 20 European countries from 2004 to 2018. Empirically, the study employs several econometric tests and approaches. Findings partially confirm the Environmental Kuznets Curve (EKC) hypothesis, while renewable energy and tertiary education enhance sustainability. Environmental regulation is significant for policymakers as it decreases pollution. The role of women in parliaments, which has been scarcely examined in existing literature, appears to be beneficial for the prosperity of EU societies. All empirical findings leave ample room for further discussion among European stakeholders and policymakers, emphasizing the importance of female participation in governance.

A finite classical polar space of rank \(n\) consists of the totally isotropic subspaces of a finite vector space equipped with a nondegenerate form such that \(n\) is the maximal dimension of such a subspace. A \(t\)-Steiner system in a finite classical polar space of rank \(n\) is a collection \(Y\) of totally isotropic \(n\)-spaces such that each totally isotropic \(t\)-space is contained in exactly one member of \(Y\). Nontrivial examples are known only for \(t=1\) and \(t=n-1\). We give an almost complete classification of such \(t\)-Steiner systems, showing that such objects can only exist in some corner cases. This classification result arises from a more general result on packings in polar spaces.Mathematics Subject Classifications: 51E23, 05E30, 33C80Keywords: Association schemes, codes, polar spaces, Steiner systems

Detecting vulnerable code blocks has become a highly popular topic in computer-aided design, especially with the advancement of natural language processing (NLP). Analyzing hardware description languages (HDLs), such as Verilog, involves dealing with lengthy code. This letter introduces an innovative identification of attack-vulnerable hardware by the use of opcode processing. Leveraging the advantage of architecturally defined opcodes and expressing all operations at the beginning of each code line, the word processing problem is efficiently transformed into opcode processing. This research converts a benchmark dataset into an intermediary code stack, subsequently classifying secure and fragile codes using NLP techniques. The results reveal a framework that achieves up to 94% accuracy when employing sophisticated convolutional neural networks (CNNs) architecture with extra embedding layers. Thus, it provides a means for users to quickly verify the vulnerability of their HDL code by inspecting a supervised learning model trained on the predefined vulnerabilities. It also supports the superior efficacy of opcode-based processing in Trojan detection by analyzing the outcomes derived from a model trained using the HDL dataset. [ABSTRACT FROM AUTHOR]

Existing miniature DNA sequencing devices hold significant promise to serve as mobile/personal genomic analysis systems in the future. But a key challenge to this vision is the absence of adequate low-power bioinformatic computing ability within the sequencing device itself. In this letter, we discuss the design and demonstrate a system-on-chip (SoC) based on an accelerated RISC-V core for such a task. The chip was fabricated in 22-nm CMOS and executes almost $10\times $ faster than a commercial mobile processor on a DNA sequence detection task while achieving $200\times $ better energy efficiency. [ABSTRACT FROM AUTHOR]

Due to the increasing complexity of modern integrated circuits, high-level synthesis (HLS) is becoming a key technology in hardware design. HLS uses optimizations to assist during design space exploration. However, some of them can introduce security weaknesses. We propose an approach that leverages static analysis to identify a class of weaknesses in HLS-generated code. We show that some of these weaknesses can be corrected through the automatic generation of HLS directives. We evaluate our approach by comparing the static analysis results with formal verification. Our results show that the static approach has the same accuracy as formal methods while being $3\times $ to $200\times $ faster. [ABSTRACT FROM AUTHOR]

Congenital diarrhea and enteropathies (CODEs) constitute a group of rare genetic disorders characterized by severe diarrhea and malabsorption in the neonatal period or early infancy. Timely diagnosis and treatment is essential to prevent life-threatening complications, including dehydration, electrolyte imbalance, and malnutrition. This review offers a simplified approach to the diagnosis of CODEs, with a specific focus on microvillus inclusion disease (MVID), congenital tufting enteropathy (CTE), congenital chloride diarrhea (CLD), and congenital sodium diarrhea (CSD). Patients with CODEs typically present with severe watery or occasionally bloody diarrhea, steatorrhea, dehydration, poor growth, and developmental delay. Therefore, it is crucial to thoroughly evaluate infants with diarrhea to rule out infectious, allergic, or anatomical causes before considering CODEs as the underlying etiology. Diagnostic investigations for CODEs encompass various modalities, including stool tests, blood tests, immunological studies, endoscopy and biopsies for histology and electron microscopy, and next-generation sequencing (NGS). NGS plays a pivotal role in identifying the genetic mutations responsible for CODEs. Treatment options for CODEs are limited, often relying on total parenteral nutrition for hydration and nutritional support. In severe cases, intestinal transplantation may be considered. The long-term prognosis varies among specific CODEs, with some patients experiencing ongoing intestinal failure and associated complications. In conclusion, the early recognition and accurate diagnosis of CODEs are of paramount importance for implementing appropriate management strategies. Further research and advancements in genetic testing hold promise for enhancing diagnostic accuracy and exploring potential targeted therapies for these rare genetic disorders. [ABSTRACT FROM AUTHOR]

In spite of the massive body of work reconceptualizing school mathematics in keeping with progressive approaches, research has shown that many school mathematics teachers still opt for more traditional methods. The present study sheds light on the mechanisms that shape mathematics teachers' knowledge, beliefs, and instructional practices and thereby sheds light on those factors that support or impede the adoption of more reform-based teaching methods in mathematics. By adopting a sociological perspective, the study explores the school mathematics culture based on reflective blogs published by high-school mathematics interns during the year of their professional and cultural socialization. A qualitative analysis of the blogs yielded 10 cultural codes, suggesting that these could be hegemonically reproduced and preserved by the schools' more experienced mathematics teachers, who also emerged as primary socialization agents during the interns' induction into the teaching profession. The findings are salient for teacher educators and mentors who aim to promote changes in the pedagogical practices in teaching mathematics in school. [ABSTRACT FROM AUTHOR]

Objectives: To identify the causes of delayed diagnosis of urogenital tuberculosis (UGT) through a qualitative study of patients with contracted bladder due to UGT. Materials and Methods: Eight patients diagnosed with contracted bladder due to UGT were evaluated. Data were obtained using face-to-face in-depth interviews and supplemented with medical records analysis and personal medical files. The identification of situations of diagnosis delay was coded by 2 urologists after data analyses. Codes were divided into 3 categories related to its causes: (1) health system; (2) disease factors; and (3) medical factors. Results: The 8 interviews produced 220 minutes of audio and 1.3 GB of scanned documents. The most frequent categories were "Medical factors," followed by "Disease factors" and "Health system." The codes "No clinical-laboratory-radiological suspicion" and "No clinical suspicion" were the most frequent, both belonging to "Medical factors." Clinically, tuberculosis simulates other pathologies and lacks specific tests with adequate sensitivity. The low representation of "Health system" codes indicates that access to public and private health services does not influence delayed diagnosis. The lack of clinical and radiological suspicion and the lack of knowledge of UGT features are the main reasons for diagnosis delay. Conclusions: The causes of delayed diagnosis in our sample were related to "Medical factors," followed by "Disease factors." Better understanding UGT features is an important topic in continuous medical education. [ABSTRACT FROM AUTHOR]

Let I be the commutative non-unital ring of order 4 defined by generators and relations. I = a , b ∣ 2 a = 2 b = 0 , a 2 = b , a b = 0. Alahmadi et al. have classified QSD codes, Type IV codes (QSD codes with even weights) and quasi-Type IV codes (QSD codes with even torsion code) over I up to lengths n = 6 , and suggested two building-up methods for constructing QSD codes. In this paper, we construct more QSD codes, Type IV codes and quasi-Type IV codes for lengths n = 7 and 8, and describe five new variants of the two building-up construction methods. We find that when n = 8 there is at least one QSD code with minimun distance 4, which attains the highest minimum distance so far, and we give a generator matrix for the code. We also describe some QSD codes, Type IV codes and quasi-Type IV codes with new weight distributions. [ABSTRACT FROM AUTHOR]

We consider the problem of constructing prefix-free codes in which a designated symbol, a space, can only appear at the end of codewords. We provide a linear-time algorithm to construct almost-optimal codes with this property, meaning that their average length differs from the minimum possible by at most one. We obtain our results by uncovering a relation between our class of codes and the class of one-to-one codes. Additionally, we derive upper and lower bounds to the average length of optimal prefix-free codes with a space in terms of the source entropy. [ABSTRACT FROM AUTHOR]

Co-design across the Exascale Computing Project has been critical for both enabling science applications and bringing disparate communities together. Developing and porting applications to the various high-performance computing architectures on pre-exascale and exascale computers has been quite challenging due to the diversity of hardware features and software stacks. The Co-design Center for Particle Applications (CoPA) has developed and enhanced the Cabana and Parallel, Rapid O(N), and Graph-Based Recursive Electronic Structure Solver (PROGRESS)/Basic Matrix Library (BML) libraries to facilitate the creation of new particle applications, make existing particle applications exascale capable, and allow teams to explore new capabilities. Particle methods from the atomistic, mesoscale, and continuum through cosmological scales have been built with Cabana, along with new possibilities for application coupling. Similarly, the PROGRESS/BML library has enabled quantum particle applications with linear algebra solvers to use advanced hardware. Across these CoPA-developed libraries, the co-design abstraction layer combines performance portability with math library support to facilitate the separation of concerns and directly support science runs. [ABSTRACT FROM AUTHOR]

Adverse life events have short- and long-term effects on the livelihood of victims. This paper studies the effect of early life idiosyncratic shocks on labour market outcomes using five rounds of panel data from the National Income Dynamics Study (NIDS) of South Africa. Regression results from alternative panel data estimators suggest that the loss of biological parents early in life is negatively associated with the likelihood of employment and wage earnings. The association is stronger when one loses one's biological mother than one's biological father. Heterogeneity analysis reveals that the loss of a biological father among Black South Africans leads to higher wage earnings compared to other race groups who have experienced the same shock. Education level, perceived health, cognitive ability, and occupation type are strongly associated with the loss of a biological mother, while only education is associated with the loss of a father. These could be the main channels that mediate the link between early life loss of biological parents and labour market outcomes. Therefore, strengthening and aligning child support programmes to reach the victims are required.

This letter proposes an augmented scheme of LT codes to improve the decoding success rate. The method involves substituting the 1‐s in full‐degree columns of the generator matrix of conventional LT codes with binary extension field elements and simultaneously increasing the ratio of full‐degree columns in the ideal soliton distribution. For non‐full‐degree columns, we retain the nonzero elements as 1‐s in the conventional LT codes generator matrix to preserve computational efficiency. Compared to conventional LT codes, the proposed method enhances the linear independence of the generator matrix, leading to a higher decoding success rate with minimal data packets. Experimental results demonstrate the effectiveness of the method at improving the performance of LT codes, with close to 100% decoding success rate achieved with around 5% data redundancy. [ABSTRACT FROM AUTHOR]

Currently, the study of energy balancing in cascaded multilevel inverter cells is desirable due to the growing interest in implementing systems that minimize losses, ensure delivery of the maximum amount of power to the load, contribute to system reliability, and at the same time minimize the use of resources for its implementation. One of the ways to carry out energy balancing without resorting to additional topology is by modifying conventional modulation techniques. In this letter, the FPGA implementation of modulation strategies for energy balancing purposes is carried out. First, three conventional techniques are addressed: 1) phase-shifted carrier disposition; 2) level shift per carrier cycle; and 3) level shift per modulator cycle. Subsequently, the implementation of an alternative modulation strategy that performs energy balancing in the cascaded multilevel inverter, minimizing the use of digital resources, is presented. [ABSTRACT FROM AUTHOR]

A lower bound is presented for the minimal number of filled cells in a maximal partial Latin hypercube of dimension d and order n. The result generalises and extends previous results for d = 2 (Latin squares) and d = 3 (Latin cubes). Explicit constructions show that this bound is near-optimal for large n > d . For d > n , a connection with Hamming codes shows that this lower bound gives a related upper bound for the same quantity. The results can be interpreted in terms of independent dominating sets in certain graphs, and in terms of codes that have covering radius 1 and minimum distance at least 2. [ABSTRACT FROM AUTHOR]

Background and basics for the application of fire protective coverings in timber construction This article summarises the current knowledge in the application of fire protective coverings for timber constructions. The different types of fire protective coverings, their definitions in standards and building codes and their performance requirements are discussed and the associated differences are compared. From the discussion of the backgrounds, an expanded view of the criteria to be verified for fire protective coverings for timber members is developed, which enables an optimised and resource‐saving application while maintaining the requested safety level in fire protection. [ABSTRACT FROM AUTHOR]

The article examines the problems of cybersecurity of the state. As you know, the number and scale of international conflicts have increased recently. The methods of conducting armed conflicts have also changed. More and more people began to move from conventional military clashes to information wars and cyber wars. Over time, technological progress has led to the emergence of new arenas for conflicts between countries and factions. Cyberwar has become one of these arenas, where the main weapons are not missiles and submachine guns, but computer codes and supercomputers. This article reveals the role of cyber technologies in modern international conflicts and presents what threats and opportunities they provide on the battlefield. [ABSTRACT FROM AUTHOR]

Semiotics is studies the sign systems, the process of interpretation, the meaning and the truth hidden behind the codes, signs and symbols. This knowledge has considerable applications and functions in various areas of human relations. Literature, including children's literature is one of the most important of these areas. Using Roland Barrett's views, this study tried to analyze the children's poems of Salman Harati with an analytical-descriptive method. The results showed that Harati's poems, due to such issues as reference to various fields of natural and ideological elements, pristine, simple and intimate nature, outstanding temporal and spatial coordinates, and social themes and idealistic discourse, is able to produce various codes, and consequently various meanings and interpretations. Although these characteristics are directly related to the readers' abilities, they show that when assessed by the interpretation mechanisms of codes and analysis of other semiotic elements, his poems have a structured and thoughtful semantic structure. The action and effect of the logic of conversationalism in his poetry is another factor that provides the reader with space and the possibility of reproducing content in the process of innertext and outertext interpretations. The narrative in Harati's poetry, as an integration factor of vertical axis, has produced a variety of codes. This process, with regard to the remarkable manifestation of the codes of narrative, hermeneutic and symbolic action, demonstrates the narrative capacity and the signifier nature of his poetry. Meta-examplar implications in Harati's poems cause objective and clear associations and effectively involve metatext in the interpretation and analysis of signs. [ABSTRACT FROM AUTHOR]

Copyright of Letonica is the property of University of Latvia, Institute of Literature, Folklore & Art and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Quantum computers have the potential to provide exponential speedups over their classical counterparts. Quantum principles are being applied to fields such as communications, information processing, and artificial intelligence to achieve quantum advantage. However, quantum bits are extremely noisy and prone to decoherence. Thus, keeping the qubits error free is extremely important toward reliable quantum computing. Quantum error correcting codes have been studied for several decades and methods have been proposed to import classical error correcting codes to the quantum domain. Along with the exploration into novel and more efficient quantum error correction codes, it is also essential to design circuits for practical realization of these codes. This article serves as a tutorial on designing and simulating quantum encoder and decoder circuits for stabilizer codes. We first describe Shor’s 9-qubit code which was the first quantum error correcting code. We discuss the stabilizer formalism along with the design of encoding and decoding circuits for stabilizer codes such as the five-qubit code and Steane code. We also design nearest neighbor compliant circuits for the above codes. The circuits were simulated and verified using IBM Qiskit. [ABSTRACT FROM AUTHOR]

The arrival of direct electron detectors (DEDs) with high frame rates in the field of scanning transmission electron microscopy (TEM) has enabled many experimental techniques that require collection of a full diffraction pattern at each scan position, a field which is subsumed under the name four-dimensional scanning transmission electron microscopy (4D-STEM). DED frame rates approaching 100 kHz require data transmission rates and data storage capabilities that exceed those of the commonly available computing infrastructures. Current commercial DEDs allow the user to make compromises in pixel bit depth, detector binning, or windowing to reduce the per-frame file size and allow higher frame rates. This change in detector specifications requires decisions to be made before data acquisition that may reduce or lose information that could have been advantageous during data analysis.

The recent arrival of the Frontier Supercomputer at Oak Ridge National Laboratory officially marked the dawn of the exascale computing era. Its successful deployment coincided with the culmination of the U.S. Department of Energy Exascale Computing Project (ECP), an ambitious, complex, and risky research and development effort that integrated contributions from a broad and diverse subset of the high-performance computing community. The success of ECP will ultimately be judged by the scientific and engineering advances that it enabled. This Special Issue is focused on showcasing early successes in the use of exascale resources to enable breakthroughs in key areas of science in engineering. [ABSTRACT FROM AUTHOR]