Search

We consider the problem of communicating over a channel that randomly “tears” the message block into small pieces of different sizes and shuffles them. For the binary torn-paper channel with block length $n$ and pieces of length ${\mathrm{ Geometric}}(p_{n})$ , we characterize the capacity as $C = e^{-\alpha }$ , where $\alpha = \lim _{n\to \infty } p_{n} \log n$. Our results show that the case of ${\mathrm{ Geometric}}(p_{n})$ -length fragments and the case of deterministic length- $(1/p_{n})$ fragments are qualitatively different and, surprisingly, the capacity of the former is larger. Intuitively, this is due to the fact that, in the random fragments case, large fragments are sometimes observed, which boosts the capacity. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Language & Law / Revista de Llengua i Dret is the property of Revista de Llengua i Dret 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.)

This report describes The University of Texas Student Cluster Competition team’s effort to reproduce the results of “MemXCT: memory-centric X-ray CT reconstruction with massive parallelization” (Hidayetoğlu et al., 2019). The article details a new memory-centric approach that reconstructs X-ray computed tomography (XCT) from noisy raw data. In our reproduction experiments, we utilized Microsoft Azure’s CycleCloud tool to provision, orchestrate, and manage our computing cluster in the cloud. In particular, we scheduled and benchmarked reconstruction workloads using Azure’s CPU-based HC44rs and GPU-based NC12s v2 virtual machine (VM) types to evaluate the scalability properties of the reconstruction approach and the performance differences between architectures. The HC44rs VMs contained 44 Intel Xeon Platinum cores, while the NC12s v2 VM was equipped with two NVIDIA P100 GPUs. We used a recent version of Intel’s compiler stack with the MKL library for our CPU code along with CUDA 11.1 on GPUs. Overall, our results confirm the findings of the original article, demonstrating similar acceleration on GPUs and scalability properties on CPUs. Digital artifacts from these experiments are available at: 10.5281/zenodo.5598108 [ABSTRACT FROM AUTHOR]

The main aim of this paper is to study a number of American key films from the 1960s and to relate them to the cultural and historical spirit of the age. In its critical approach, this paper depends mainly on Roland Barthes' theories and concepts regarding the visual image and semiotics. The main films that will be studied include "Midnight Cowboy" (1969), directed by John Schlesinger; "Bonnie and Clyde" (1967), directed by Arthur Penn; and "The Wild Bunch" (1969), directed by Sam Peckinpah. The researchers argue that studying the content and various forms of these films in particular is significant because it reveals cultural and ideological messages about the 1960s. The present paper is also an attempt to shed light on Roland Barthes' arguments about film theory. Despite the fact that the sum of his writings on film is relatively small, a closer scrutiny of these writings reveals that he has a vast influence on the field of film studies. His ideas on semiotics and structuralism are influential and can be extensively applied during film analysis. [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]

Thematic analysis is a highly popular technique among qualitative researchers for analyzing qualitative data, which usually comprises thick descriptive data. However, the application and use of thematic analysis has also involved complications due to confusion regarding the final outcome's presentation as a conceptual model. This paper develops a systematic thematic analysis process for creating a conceptual model from qualitative research findings. It explores the adaptability of the proposed process across various research methodologies, including constructivist methodologies, positivist methodologies, grounded theory, and interpretive phenomenology, and justifies their application. The paper distinguishes between inductive and deductive coding approaches and emphasizes the merits of each. It suggests that the derived systematic thematic analysis model is valuable across multiple disciplines, particularly in grounded theory, ethnographic approaches, and narrative approaches, while also being adaptable to more descriptive, positivist-based methodologies. By providing a methodological roadmap, this study enhances the rigor and replicability of thematic analysis and offers a comprehensive strategy for theoretical conceptualization in qualitative research. The contribution of this paper is a systematic six-step thematic analysis process that leads to the development of a conceptual model; each step is described in detail and examples are given. [ABSTRACT FROM AUTHOR]

This report analyzes the reproducibility of the paper “MemXCT: Memory-Centric X-ray CT Reconstruction with Massive Parallelization” by Hidayetoğlu et al. in the cloud as part of the SC20 Virtual Student Cluster Competition (VSCC). To reproduce the results from the original work, the ETH Zürich SC20 VSCC team performed a series of CT reconstructions and performed a scaling study using three provided sinograms. All experimental runs were performed during the SC20 VSCC on an HPC cluster hosted in the Microsoft Azure CycleCloud. In this paper, we describe discrepancies in results as a factor of the differences in experiment environments and insufficient parameter tuning. We successfully reproduce the single device performance and partially reproduce the strong scaling behavior. Digital artifacts from these experiments are available at: 10.5281/zenodo.5598108. [ABSTRACT FROM AUTHOR]

The number-theoretic code is a class of codes defined by single or multiple congruences. These codes are mainly used for correcting insertion and deletion errors, and for correcting asymmetric errors. This paper presents a formula for a generalization of the complete weight enumerator for the number-theoretic codes. This formula allows us to derive the weight enumerators and cardinalities for the number-theoretic codes. As a special case, this paper provides the Hamming weight enumerators and cardinalities of the non-binary Tenengolts’ codes, correcting single insertion or deletion. Moreover, we show that the formula deduces the MacWilliams identity for the linear codes over the ring of integers modulo $r$. [ABSTRACT FROM AUTHOR]

This paper briefly reviews the evolution of composite codes in the USA in the context of important changes for the 2022 edition of the American steel design specification for buildings Major changes include the incorporation of composite walls as a new type of composite member, the addition of new provisions for shear capacity of filled members, and the introduction of a performance‐based procedure for qualifying new types of anchors. An appendix also allows for the use of high strength materials for concrete filled rectangular members. The paper then describes the write's opinion on (1) important issues that need to be addressed on the direction of future codes, (2) areas where more research work is needed to provide more consistent and simpler design rules and (3) the desirability of including additional topics into the main specification. [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]

Linear codes achieving or nearly achieving the Singleton bound are interesting in both theory and practice. The objective of this paper is to construct several infinite families of MDS, near MDS and almost MDS codes from some special cyclic subgroups of ${\mathbb {F}}_{q^{2}}^{*}$. To this end, the augmentation and extension techniques are used. The codes in this paper have flexible parameters and their lengths could be large. The minimum linear locality of the codes constructed in this paper is also studied. Some infinite families of optimal linearly locally recoverable codes are obtained. Besides, some codes in this paper are proved to be proper for error detection. [ABSTRACT FROM AUTHOR]

This paper provides a comprehensive performance comparison between a current robust military waveform; namely, MIL-STD-188-110D, Waveform 0, and a filter bank multicarrier spread-spectrum (FBMC-SS) waveform proposed for communications through ionospheric/skywave HF channels. Waveform 0 is effectively a direct sequence spread spectrum waveform that uses Walsh multi-codes to enhance the information transmission rate. It may thus be referred to as Walsh-DSSS. FBMC-SS, on the other hand, makes use of filter banks to provide excellent performance when the received signal is subject to partial band interference. Successful application of FBMC-SS for communications across skywave HF channels has been previously demonstrated, both theoretically and through experimental work. However, very little has been done to contrast FBMC-SS against Walsh-DSSS. The goal of this paper is to first add new features to FBMC-SS to bring it on par with Walsh-DSSS. These features include: (i), introduction of multi-codes that achieve a comparable (or better) data rate to Walsh-DSSS; and (ii), addition of a scrambling step applied to the multi-codes to make the receiver detection robust against widely spread multipaths. With this established, in the second part of the paper, we examine the performance of the developed FBMC-SS against Walsh-DSSS when both are applied for communications across skywave HF channels. The two waveforms are compared both through a theoretical study and through experimental works across several skywave channels ranging from hundreds to thousands of kilometers. [ABSTRACT FROM AUTHOR]

In general coding theory, we often assume that error is observed in transferring or storing encoded symbols, while the process of encoding itself is error-free. Motivated by recent applications of coding theory, in this paper, we consider the case where the process of encoding is distributed and prone to error. We introduce the problem of distributed encoding, comprised of a set of $K \in \mathbb {N}$ isolated source nodes and $N \in \mathbb {N}$ encoding nodes. Each source node has one symbol from a finite field, which is sent to each of the encoding nodes. Each encoding node stores an encoded symbol from the same field, as a function of the received symbols. However, some of the source nodes are controlled by the adversary and may send different symbols to different encoding nodes. Depending on the number of the adversarial nodes, denoted by $\beta \in \mathbb {N}$ , and the cardinality of the set of symbols that each one generates, denoted by $v \in \mathbb {N}$ , the process of decoding from the encoded symbols could be impossible. Assume that a decoder connects to an arbitrary subset of $t \in \mathbb {N}$ encoding nodes and wants to decode the symbols of the honest nodes correctly, without necessarily identifying the sets of honest and adversarial nodes. An important characteristic of a distributed encoding system is $t^{*} \in \mathbb {N}$ , the minimum of such $t$ , which is a function of $K$ , $N$ , $\beta $ , and $v$. In this paper, we study the distributed linear encoding system, i.e. one in which the encoding nodes use linear coding. We show that $t^{*}_{\textrm {Linear}}=K+2\beta (v-1)$ , if $N\ge K+2\beta (v-1)$ , and $t^{*}_{\textrm {Linear}}=N$ , if $N\le K+2\beta (v-1)$. In order to achieve $t^{*}_{\textrm {Linear}}$ , we use random linear coding and show that in any feasible solution that the decoder finds, the messages of the honest nodes are decoded correctly. In order to prove the converse of the fundamental limit, we show that when the adversary behaves in a particular way, it can always confuse the decoder between two feasible solutions that differ in the message of at least one honest node. [ABSTRACT FROM AUTHOR]

The management of existing structures is raising a number of pertinent questions to the owners and engineers. Many structures built more than 50 years ago (even those built hundreds of years ago) usually no longer comply with safety requirements of current codes, which are typically addressed in new structures. This is not necessarily only caused by a poor original design or degradation with time, but it may be, for example, the consequence of increase in actions, reducing the level of reliability of a structure. This paper focuses on strategies to be adopted for existing structures which do not comply with code requirements for new constructions (e.g., to repair, to demolish, to rebuild, etc.) on the basis of a more holistic approach that includes economic, social, and environmental considerations. To that aim, first, a brief review of the background concepts on the reliability of structures is presented, highlighting the differences for new and existing structures. Following this analysis, suitable values for the reliability index (including sustainability considerations) are proposed, as well as tailored maintenance strategies. Finally, the paper presents a case study based on a real project to emphasize the benefits of adopting such a holistic perspective. [ABSTRACT FROM AUTHOR]

A functional $k$ -batch code of dimension $s$ consists of $n$ servers storing linear combinations of $s$ linearly independent information bits. Any multiset request of size $k$ of linear combinations (or requests) of the information bits can be recovered by $k$ disjoint subsets of the servers. The goal under this paradigm is to find the minimum number of servers for given values of $s$ and $k$. A recent conjecture states that for any $k=2^{s-1}$ requests the optimal solution requires $2^{s}-1$ servers. This conjecture is verified for $s \leqslant 5$ but previous work could only show that codes with $n=2^{s}-1$ servers can support a solution for $k=2^{s-2} + 2^{s-4} + \left \lfloor{ \frac { 2^{s/2}}{\sqrt {24}} }\right \rfloor $ requests. This paper reduces this gap and shows the existence of codes for $k=\lfloor \frac {5}{6}2^{s-1} \rfloor - s$ requests with the same number of servers. Another construction in the paper provides a code with $n=2^{s+1}-2$ servers and $k=2^{s}$ requests, which is an optimal result. These constructions are mainly based on extended Simplex codes and equivalently provide constructions for parallel Random I/O (RIO) codes. [ABSTRACT FROM AUTHOR]

Quantum readout provides a general framework for formulating statistical discrimination of quantum channels. Several paths have been taken for such this problem. However, there is much to be done in the avenue of optimizing channel discrimination using classical codes. At least two open questions can be pointed out: how to construct low complexity encoding schemes that are interesting for channel discrimination and, more importantly, how to develop capacity-achieving protocols. This paper aims at presenting a solution to these questions using polar codes. Firstly, we characterize the information rate and reliability parameter of the channels under polar encoding. We also show that the error probability of the scheme proposed decays exponentially with the square root of the code length. Secondly, an analysis of the optimal quantum states to be used as probes is given. [ABSTRACT FROM AUTHOR]

For high-speed quantum key distribution (QKD) post processing, information reconciliation is the most computational step, which usually acts as the system speed bottleneck. Reconciliation efficiency and operation throughput are the two most important performance parameters, but they are often compromised to each other in actual realization due to the available hardware resources. Another characteristic of the information reconciliation is that its channel is time-varying, and in order to guarantee high efficiency, some rate-compatible error correction scheme should be adopted. To cope with the above problems, this paper proposes a rate-compatible high-efficiency reconciliation algorithm based on quasi-cyclic (QC) low-density parity-check (LDPC) codes and puncturing algorithms. On the other hand, in order to obtain high throughput while maintaining low implementation complexity, the normalized min-sum algorithm (NMSA) is realized and optimized by using the fast prototyping tool of high-level synthesis (HLS). The proposed information reconciliation module was implemented on the Xilinx Zynq Ultrascale+ ZCU102 development board. Experimental results show that the maximum throughput rate of the implemented reconciliation module in this paper can reach 136 Mbps, while the efficiency factor is kept lower than 1.32 across the error rate range of 1.7%∼10.6% under the remaining frame error rate level of 10−3. The comprehensive good performance obtained by our design can strongly support the development of modern high-speed QKD systems. [ABSTRACT FROM AUTHOR]

A common method for reading information stored in DNA molecules is shotgun sequencing. This method outputs a histogram of the frequencies of all the molecules’ substrings of a given length $\ell $. To protect against noisy readings, the rank-modulation scheme encodes the information in the relative ranking of the substring frequencies, instead of their absolute values. However, the best rank-modulation codes for shotgun sequencing have low rates which are asymptotically vanishing. In this paper we propose new constructions of rank-modulation codes for shotgun sequencing. The first code construction is systematic, allowing the user to arbitrarily set the frequencies of a large subset of the substrings, which the encoder then completes to a permutation that may be realized by a DNA molecule. The construction is then improved by allowing the user to set the frequencies of additional substrings, at the cost of imposing constraints on the frequencies. The resulting codes have higher, non-vanishing rates, compared with previously known codes. As an example, for histograms of substrings of length $\ell =2$ , and an alphabet of size 4 (as in DNA molecules), we are able to construct a code with rate $\approx 0.909$ , whereas previously, the best construction resulted in a code with rate $\approx 0.654$. Additionally, the encoded information in our construction may be written to shorter DNA molecules than possible before. We also prove that the systematic codes constructed in this paper are the largest possible among all systematic codes. [ABSTRACT FROM AUTHOR]

The Bose-Chaudhuri-Hocquenghem (BCH) codes are a well-studied subclass of cyclic codes that have found numerous applications in error correction and notably in quantum information processing. They are widely used in data storage and communication systems. A subclass of attractive BCH codes is the narrow-sense BCH codes over the Galois field ${\mathrm {GF}}(q)$ with length $q+1$ , which are closely related to the action of the projective general linear group of degree two on the projective line. Despite its interest, not much is known about this class of BCH codes. This paper aims to study some of the codes within this class and specifically narrow-sense antiprimitive BCH codes (these codes are also linear complementary duals (LCD) codes that have interesting practical recent applications in cryptography, among other benefits). We shall use tools and combine arguments from algebraic coding theory, combinatorial designs, and group theory (group actions, representation theory of finite groups, etc.) to investigate narrow-sense antiprimitive BCH Codes and extend results from the recent literature. Notably, the dimension, the minimum distance of some $q$ -ary BCH codes with length $q+1$ , and their duals are determined in this paper. The dual codes of the narrow-sense antiprimitive BCH codes derived in this paper include almost MDS codes. Furthermore, the classification of ${\mathrm {PGL}}(2, p^{m})$ -invariant codes over ${\mathrm {GF}}(p^{h})$ is completed. As an application of this result, the $p$ -ranks of all incidence structures invariant under the projective general linear group ${\mathrm {PGL}}(2, p^{m})$ are determined. Furthermore, infinite families of narrow-sense BCH codes admitting a 3-transitive automorphism group are obtained. Via these BCH codes, a coding-theory approach to constructing the Witt spherical geometry designs is presented. The BCH codes proposed in this paper are good candidates for permutation decoding, as they have a relatively large group of automorphisms. [ABSTRACT FROM AUTHOR]

Palmprint has gained popularity as a biometric modality and has recently attracted significant research interest. The competition-based method is the prevailing approach for hand-crafted palmprint recognition, thanks to its powerful discriminative ability to identify distinctive features. However, the competition mechanism possesses vast untapped advantages that have yet to be fully explored. In this paper, we reformulate the traditional competition mechanism and propose a $\boldsymbol {C}$ omprehensive $\boldsymbol {C}$ ompetition Network (CCNet). The traditional competition mechanism focuses solely on selecting the winner of different channels without considering the spatial information of the features. Our approach considers the spatial competition relationships between features while utilizing channel competition features to extract a more comprehensive set of competitive features. Moreover, existing methods for palmprint recognition typically focus on first-order texture features without utilizing the higher-order texture feature information. Our approach integrates the competition process with multi-order texture features to overcome this limitation. CCNet incorporates spatial and channel competition mechanisms into multi-order texture features to enhance recognition accuracy, enabling it to capture and utilize palmprint information in an end-to-end manner efficiently. Extensive experimental results have shown that CCNet can achieve remarkable performance on four public datasets, showing that CCNet is a promising approach for palmprint recognition that can achieve state-of-the-art performance. Related codes will be released at https://github.com/Zi-YuanYang/CCNet. [ABSTRACT FROM AUTHOR]

As the focus on embodied carbon within the built environment has grown in the U.S., local jurisdictional codes have increasingly proposed and implemented code language that requires the use of concrete mixtures that have reduced environmental impacts. This paper provides details about the various ways that localized sustainable concrete provisions have been proposed and implemented in the U.S., including limits on cement content and Global Warming Potential (GWP). These laws and code revisions vary in their measurement of low-carbon concrete and their exemptions and incentives. While the current version of the ACI Building Code, ACI 318-19, does allow for the consideration of sustainability in concrete design, specifics about how the relative sustainability of concrete mixtures and systems are to be measured and compared are not included. This paper addresses how the changing landscape of local jurisdictional codes is driving the development of future ACI 318 provisions to play a part in providing more consistency in the application of sustainable design practices in the United States. [ABSTRACT FROM AUTHOR]

Several sources of total cross sections for e+e− pair production by photon interaction with matter, used by major Monte Carlo codes for particle transport, are quantitatively evaluated with respect to experimental measurements collected from the literature. They include data libraries deriving from theoretical calculations and analytical formulae representing empirical fits to tabulations. Although most of these sources of cross sections are based on one theoretical reference, the statistical data analysis documented in this paper highlights differences in their compatibility with experiment. The cross sections collected in the 1997 version of the Evaluated Photon Data Library (EPDL) exhibit the lowest incompatibility with experiment; the paper details the validation results for all the examined cross section sources. The scarcity of experimental data does not allow the validation process to discern pair production in the field of the nucleus and in the field of atomic electrons; nevertheless, this paper documents relevant clues regarding the contribution of the latter to reproduce experimental measurements. [ABSTRACT FROM AUTHOR]

Smart contracts in Ethereum blockchain network are self-executable scripts used for managing tokenized assets and access rights between different entities on the blockchain network. They are significant addition to blockchain technology for achieving data transparency and reliability in maintaining the digital relationship between two or more entities. However, the smart contract is in its nascent stage and suffers from various limitations, including immutability and code secrecy. In this paper, we address the inability of smart contracts to access the on-chain data. The smart contract currently fetches the on-chain data by taking external oracle assistance, which can be compromised to influence the customers. To address the issue, we propose a decentralized mechanism for accessing the blockchain data directly from the smart contracts by indexing single or multiple parameters of a transaction in each block using the Merkle-Patricia Trie (MPT). The idea is to increase the data transparency of blockchain applications. The paper provides a sequential search methodology that can retrieve transactions from ${N}$ blocks, satisfying specific conditions, in ${O}$ (${N}$). The complexity is further reduced to ${O}$ (N/k) by partitioning the blockchain data into ${k}$ disjoint subsets to achieve parallelism in the search procedure. We experimentally verify the effectiveness of the proposed methodology with a case study on the Ethereum blockchain data. [ABSTRACT FROM AUTHOR]

Consider a massive random access scenario in which a small set of $k$ active users out of a large number of $n$ potential users need to be scheduled in $b\ge k$ slots. What is the minimum common feedback to the users needed to ensure that scheduling is collision-free? Instead of a naive scheme of listing the indices of the $k$ active users in the order in which they should transmit, at a cost of $k\log (n)$ bits, this paper shows that for the case of $b=k$ , the rate of the minimum fixed-length common feedback code scales only as $k \log (e)$ bits, plus an additive term that scales in $n$ as $\Theta (\log \log (n))$ for fixed $k$. If a variable-length code can be used, assuming uniform activity among the users, the minimum average common feedback rate still requires $k \log (e)$ bits, but the dependence on $n$ can be reduced to $O(1)$. When $b>k$ , the number of feedback bits needed for collision-free scheduling can be significantly further reduced. Moreover, a similar scaling on the minimum feedback rate is derived for the case of scheduling $m$ users per slot, when $k \le mb$. The problem of constructing a minimum collision-free feedback scheduling code is connected to that of constructing a perfect hashing family, which allows practical feedback scheduling codes to be constructed from perfect hashing algorithms. [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.)

This research paper presents and comments on analytical models for calculating the widths of cracks formed as a result of imposed deformations generating tensile stresses in reinforced concrete base-restrained members. This issue regarding the mechanics of concrete structures has been presented on the basis of calculation models since 1968. In accordance with the current regulations of the European standard, the mechanics of the cracking of base-restrained members have been presented in a very simplified way, which was justified by a limited number of research studies performed on such members as well as in a few subject publications. The main purpose of this work was to present especially those models that had the greatest practical significance within a specific period of time or formed the basis for further studies of other authors. In addition, future trends in the development of computational tools are presented. The chronologically presented development of design ideas, which takes into account varying degrees of advancement of the mechanics of cracking due to the distinctly different design consequences, is a valuable source of information and an inspiration for subsequent researchers. In the second part of the paper, a few of the most important issues connected with the calculation of the crack width in base-restrained walls are presented. It is shown that currently, on the basis of the up-to-date knowledge, there are possibilities to create more complementary standard guidelines, which is already taking place in the case of European guidelines. [ABSTRACT FROM AUTHOR]

The growing number of Internet of Thing (IoT) and Ultra-Reliable Low Latency Communications (URLCC) use cases in next generation communication networks calls for the development of efficient Forward Error Correction (FEC) mechanisms. These use cases usually imply using short to mid-sized information blocks and requires low-complexity and/or fast decoding procedures. This paper investigates the joint learning of short to mid block-length coding schemes and associated Belief-Propagation (BP) like decoders using Machine Learning (ML) techniques. An interpretable auto-encoder (AE) architecture is proposed, ensuring scalability to block sizes currently challenging for ML-based linear block code design approaches. By optimizing a coding scheme w.r.t. the targeted decoder, the proposed system offers a good complexity/performance trade-off compared to various codes from literature with length up to 128 bits. [ABSTRACT FROM AUTHOR]

This paper studies low-latency streaming codes for the multi-hop network. The source transmits a sequence of messages to a destination through a chain of relays, and requires the destination to reconstruct each message by its deadline. We assume that each communication link is subjected to a certain maximum number of packet erasures. The case of a single relay (a three-node network) was considered in Fong et al. (2020). A coding scheme known as symbol-wise decode and forward was proposed. In the present work, we propose an alternative scheme that is different from Fong et al. (2020) and still achieves the same rate as in Fong et al. (2020) for the one hop case as the field-size goes to infinity. Furthermore, our proposed scheme naturally generalizes to the case of multiple-relay nodes yielding new achievable rates for this setting. The main difference with Fong et al. (2020) is that our proposed scheme exploits the ability of the relay nodes to adapt the transmission based on the erasures on the previous link. Hence, we refer to our scheme as “state-dependent” and contrast it with the scheme in Fong et al. (2020) that is state-independent. Our scheme requires the relay nodes to append a header to the transmitted packets, and we show that the size of the header does not depend on the field-size of the code. We also derive an upper bound on the maximal streaming rate achievable over a network with an arbitrary number of relays. We show that this upper bound matches our achievable rate in the special case when the maximal number of erasures on the first link is greater than or equal to the maximal number of erasures on each of the following links, and the field size goes to infinity. [ABSTRACT FROM AUTHOR]

In this paper, we consider variable-length coding over the memoryless binary asymmetric channel (BAC) with full noiseless feedback, including the binary symmetric channel (BSC) as a special case. In 2012, Naghshvar et al. introduced a coding scheme, which we refer to as the small-enough-difference (SED) coding scheme. For symmetric binary-input channels, the deterministic variable-length feedback (VLF) code constructed with the SED coding scheme asymptotically achieves both capacity and Burnashev’s optimal error exponent. Building on the work of Naghshvar et al., this paper extends the SED coding scheme to the BAC and develops a non-asymptotic VLF achievability bound that is shown to achieve both capacity and the optimal error exponent. For the specific case of the BSC, we develop an additional non-asymptotic VLF achievability bound using a two-phase analysis that leverages both a submartingale synthesis and a Markov chain time of first passage analysis. Numerical evaluations show that both new VLF achievability bounds outperform Polyanskiy’s achievability bound for variable-length stop-feedback codes. [ABSTRACT FROM AUTHOR]

Timing-based side and covert channels in processor caches continue to be a threat to modern computers. This work shows for the first time, a systematic, large-scale analysis of Arm devices and the detailed results of attacks the processors are vulnerable to. Compared to x86, Arm uses different architectures, microarchitectural implementations, cache replacement policies, etc., which affects how attacks can be launched, and how security testing for the vulnerabilities should be done. To evaluate security, this paper presents security benchmarks specifically developed for testing Arm processors and their caches. The benchmarks are evaluated with sensitivity tests, which examine how sensitive the benchmarks are to having a correct configuration in the testing phase. Further, to evaluate a large number of devices, this work leverages a novel approach of using a cloud-based Arm device testbed for architectural and security research on timing channels and runs the benchmarks on 34 different physical devices. In parallel, there has been much interest in secure caches to defend the various attacks. Consequently, this paper also investigates secure cache architectures using proposed benchmarks. Especially, this paper implements and evaluates secure PL and RF caches, showing the security of PL and RF caches, but also uncovers new weaknesses. [ABSTRACT FROM AUTHOR]

BPSK modulated GPS L1 CA signal is the most widely used GNSS signal to date, and the first path detection (FPD) of the conventional GPS L1 CA signals is the most challenging problem to ensure reliable GPS positioning in multipath environments. In this paper, we propose an FPD network (FPDN) based on multi-layer perceptron (MLP)-Mixer to extract the first path from the discrete autocorrelation function (ACF) output accurately with low computational cost. In addition, the proposed FPDN is useful in practice because it is robust to noise and achieves a high FPD performance without any prior assumption on the number of total incoming multipath, which is required for conventional signal processing-based FPD techniques. We compare the performance of the proposed FPDN to that of diverse conventional techniques, such as techniques based on narrow correlator, super-resolution, and some widely used CNNs such as VGGNet, ResNet, and U-Net, through simulations and field tests. As demonstrated, the proposed FPDN outperforms all of the compared FPD techniques in terms of the computational cost and accuracy for wide range of carrier-to-noise (C/N0) ratios. [ABSTRACT FROM AUTHOR]

Concatenating the state-of-the-art codes at moderate rates with repetition codes has emerged as a practical solution deployed in various standards for ultra-low-power devices such as in Internet-of-Things (IoT) networks. In this paper, we propose a novel concatenation mechanism for such applications which need to operate at very low signal-to-noise ratio (SNR) regime. In the proposed scheme, the outer code is a hybrid polar code constructed in two stages, one with a binary kernel and another also with a binary kernel but applied over a binary extension field. The inner code is a non-binary multiplicative repetition code. This particular structure inherits low-complexity decoding structures of polar codes while enabling concatenation with an inner non-binary multiplicative repetition scheme. The decoding for the proposed scheme is done using cyclic redundancy check (CRC) aided successive cancellation list (SCL) decoder over additive white Gaussian noise (AWGN) and Rayleigh fading channels. Simulation results demonstrate that the proposed hybrid non-binary repeated polar code provides performance gain compared to a polar-repetition scheme with comparable decoding complexity. [ABSTRACT FROM AUTHOR]

In this paper, we present a frame structure that can be viewed as a preamble for the detection and synchronization process (leading to low cost receiver) and as an encoded codeword carrying the transmitted message (leading to reliable transmission). This duality facilitates an ALOHA protocol avoiding preamble overhead. The frame structure, named Quasi-Cyclic Short Packet (QCSP), is based on the association of a Cyclic Code Shift Keying (CCSK) modulation and a non-binary error control code. The detection/correction algorithm of the QCSP system is presented, its performance is theoretically derived and discussed for different parameters. A QCSP frame can be transmitted and received correctly with an error probability of $\mathbf {10^{-4}}$ , distanced by 1.2 dB from Polyanskiy’s bound (an estimated Shannon’s limit for small packet size) at −11 dB of SNR for a payload of 360 bits. Compared to a classical preamble-based frame using a modern binary error control code, the size of a QCSP frame is reduced by 23%. Moreover, detecting a QCSP frame requires a lower complexity than detecting a longer classical preamble. [ABSTRACT FROM AUTHOR]

To further mitigate the BER error floor of $M$ -ary differential chaos shift keying (MDCSK) modulation for impulsive noise, a low-cost high-reliability coded modulation scheme without equalizations is desirable for impulsive noise. In this paper, a protograph-based low-density parity-check coded MDCSK-based bit-interleaved coded modulation (MDCSK-BICM) scheme is proposed for the scenario with impulsive noise obeying Bernoulli-Laplace distribution. Considering the Gaussian distribution of protograph extrinsic information transfer (PEXIT) and the benchmark of coding design, the U-shaped non-coherent capacity is derived with optimal code rate for square MDCSK, showing that the code rates are stable with $E_b/N_0$ increasing but still much lower than that of DS-16DQAM at code rate $>\!0.145$. The derived joint probability density function can be considered as approximately a Gaussian distribution, which is used to improve the impulsive noise fitted PEXIT. Finally, a new code under a novel principle is designed for better bit error rate performance based on the improved PEXIT analysis. Both PEXIT analysis and simulation results demonstrate that the proposed scheme achieves a better BER than that with a traditional scheme, and suggesting a research approach based on simple methods. This basic research work provides a guide to establish a framework and optimize the performance of transmission systems over practical power line communication. [ABSTRACT FROM AUTHOR]

Electromagnetic Transient (EMT) simulation tools are typically developed using conventional procedural programming languages. On the other hand, modern high-level and equation-based programming languages, such as Modelica, are currently available. Modelica allows formulating models that are easy to develop, maintain and understand by expressing what needs to be computed without stating how it should be computed. This paper presents a Modelica-based simulator for electromagnetic transients. It is demonstrated that this approach offers significant advantages for developing sophisticated models. Computational performance and accuracy are compared to a conventional EMT-type simulation tool. [ABSTRACT FROM AUTHOR]

In 1991, Wei proved a duality theorem that established an interesting connection between the generalized Hamming weights of a linear code and those of its dual code. Wei’s duality theorem has since been extensively studied from different perspectives and extended to other settings. In this paper, we re-examine Wei’s duality theorem and its various extensions, henceforth referred to as Wei-type duality theorems, from a new Galois connection perspective. Our approach is based on the observation that the generalized Hamming weights and the dimension/length profiles of a linear code form a Galois connection. The central result of this paper is a general Wei-type duality theorem for two Galois connections between finite subsets of $\mathbb {Z}$ , from which all the known Wei-type duality theorems can be recovered. As corollaries of our central result, we prove new Wei-type duality theorems for $w$ -demi-matroids defined over finite sets and $w$ -demi-polymatroids defined over modules with a composition series, which further allows us to unify and generalize all the known Wei-type duality theorems established for codes endowed with various metrics. [ABSTRACT FROM AUTHOR]

For fixed integers $n$ and $b\geq k$ , let $A(b,k,n)$ the largest size of a subset of $\{1,2,\ldots,b\}^{n}$ such that, for any $k$ distinct elements in the set, there is a coordinate where they all differ. Bounding $A(b,k,n)$ is a problem of relevant interest in information theory and computer science, relating to the zero-error capacity with list decoding and to the study of $(b, k)$ -hash families of functions. It is known that, for fixed $b$ and $k$ , $A(b,k,n)$ grows exponentially in $n$. In this paper, we determine new exponential upper bounds for different values of $b$ and $k$. A first bound on $A(b,k,n)$ for general $b$ and $k$ was derived by Fredman and Komlós in the ’80s and improved for certain $b\neq k$ by Körner and Marton and by Arikan. Only very recently better bounds were derived for general $b$ and $k$ by Guruswami and Riazanov, while stronger results for small values of $b=k$ were obtained by Arikan, by Dalai, Guruswami and Radhakrishnan, and by Costa and Dalai. In this paper, we strengthen the bounds for some specific values of $b$ and $k$. Our contribution is a new computational method for obtaining upper bounds on the values of a quadratic form defined over discrete probability distributions in arbitrary dimensions, which emerged as a central ingredient in recent works. The proposed method reduces an infinite-dimensional problem to a finite one, which we manage to further simplify by means of a series of optimality conditions. [ABSTRACT FROM AUTHOR]

The family of Goppa codes is one of the most interesting subclasses of linear codes. As the McEliece cryptosystem often chooses a random Goppa code as its key, knowledge of the number of inequivalent Goppa codes for fixed parameters may facilitate in the evaluation of the security of such a cryptosystem. In this paper we present a new approach to give an upper bound on the number of inequivalent extended irreducible binary Goppa codes. To be more specific, let $n>3$ be an odd prime number and $q=2^{n}$ ; let $r\geq 3$ be a positive integer satisfying $\gcd (r,n)=1$ and $\gcd \big (r,q(q^{2}-1)\big)=1$. We obtain an upper bound for the number of inequivalent extended irreducible binary Goppa codes of length $q+1$ and degree $r$. [ABSTRACT FROM AUTHOR]

With increasing the use of ultra-high performance fiber reinforced concrete (UHPFRC) in recent years, torsional design of UHPFRC beams has become of great importance. This paper presents an experimental and numerical study to investigate the torsional behavior of UHPFRC shallow and deep beams with fcu equal to 190.2 MPa. Ten UHPFRC beams with steel fibers volume fraction of 1.5% subjected to pure torsion were investigated. The provided torsional web reinforcement ratio, the area of longitudinal bars and the tested span to total height ratio (L/h = 6.0, 4.0, 2.0 and 1.0) were the studied parameters. A numerical model has been proposed to predict the torsional response of tested beams. Experimental results showed that increasing stirrups' spacing for the beams of the same L/h ratio (to be 235% of the maximum given by ACI 318-2019 code), reduced the experimental ultimate torsional strength by only 6.7%. The torsional web reinforcement ratio of UHPFRC shallow and deep beams can be safely taken to be 40% of the minimum required by ACI 318-2019. The maximum stirrups spacing can be safely taken the lesser of twice the beam width or 300 mm. The equation used by ACI 318-2019 and ECP-203-2020 for calculating the cracking strength in torsion has been modified to be suitable for UHPFRC beams by taking into consideration the L/h ratio and steel fibers percent. The proposed 3-D numerical model showed good predictions for the torsional strength of tested UHPFRC shallow and deep beams. [ABSTRACT FROM AUTHOR]

Coding-based distributed storage systems (DSS) are employed in many diverse heterogeneous settings, e.g., cloud storage data centers, peer-to-peer systems, wireless sensor networks, fog/edge computing system, to provide better throughput, latency, reliability, scalability, load adaptation, geographical migration and fault tolerance with respect to traditional monolithic enterprise storage systems. Despite the undoubted advantages offered by coding, reliability and security are jeopardized by a pollution attack that can easily disrupt the entire system and degrade performance. In this paper we take an abstract view of a DSS and we investigate by means of mathematical modeling what are the availability, robustness, and timeliness of heterogeneous, coding-based DSS when storage nodes (SN) are unreliable and can be malicious. To this end, we focus on a class of allocations of coded fragments to SNs that we call feasible allocations; the model takes into account both reliability and reactivity of SNs. We define robust availability and timeliness of feasible allocations that we use to characterize the overall performance and robustness of the DSS in a reference scenario. Our analysis reveals that code redundancy is a double-edged sword in a DSS where malicious SNs come into play and that there exists an optimal value of code redundancy regardless all system parameters that maximizes the number of malicious SNs that can be tolerated to achieve maximum DSS performance. We also found that larger codes are preferred over short ones as they yield superior DSS performance in the presence of malicious SNs. Furthermore, when multiple feasible allocations yield the highest DSS performance timeliness can be used as a guide for the choice. Finally, heterogeneity plays a role in determining the timeliness of the maximally spread allocations in the case of targeted attacks. [ABSTRACT FROM AUTHOR]

Point cloud is a set of three-dimensional points in arbitrary order, which is a popular representation of 3D scene in autonomous navigation and immersive applications in recent years. Compression becomes an inevitable issue due to the huge data volume of point cloud. In order to effectively compress attributes of those points, proper reordering is important. The existing voxel-based point cloud attributes compression scheme uses a naive scan for points reordering. In this paper, we theoretically analyzed 3C properties of point cloud, i.e., Compactness, Clustering and Correlation, of different scan-orders defined by different space filling curves and disclosed that the Hilbert curve can provide the best spatial correlation preservation compared with Z-order and Gray-coded curves. It is also statistically verified that the Hilbert curve always has the best ability of attributes correlation preservation for point clouds with different sparsity. We also proposed a fast and iterative Hilbert address code generation method to implement points reordering. The Hilbert scan-order could be combined with various point cloud attribute coding methods. Experiments show that the correlation preservation feature of the proposed scan-order can bring us 6.1% and 6.5% coding gain for prediction and transform coding, respectively. [ABSTRACT FROM AUTHOR]

Predictive Maintenance technologies are particularly appealing for Industrial Equipment producers, as they pave the way to the selling of high added-value services and customized maintenance plans. However, standard Predictive Maintenance approaches assume the availability of sensor measurements, and the costs associated with adding sensors or remotely accessing sensor readings may discourage the development of such technologies. In this context, Alarm Forecasting can be very useful as it represents a low-cost alternative or helpful support to sensor-based Predictive Maintenance. In this work, we propose a new formulation for the Alarm Forecasting problem, framed as a multi-label classification task. We present a novel deep learning-based approach called FORMULA (alarm FORecasting in MUlti-LAbel setting). FORMULA leverages Transformer, a popular Neural Network architecture in the field of Natural Language Processing. To cope with alarm imbalance, we draw inspiration from Segmentation and Object Detection. Thus, FORMULA is trained by minimizing the Weighted Focal Loss, which turns out to be very effective in predicting rare alarms. These alarms, even if they are difficult to predict by nature, often are business-critical. We assess the proposed approach on a representative real-world problem from the packaging industry. In particular, we show that it outperforms not only classic multilabel techniques but also models based on recurrent neural networks. As regards the latter, the proposed approach also exhibits a lower computational burden, both in terms of training time and model size. To foster research in the field and reproducibility, we also publicly share the alarm logs dataset and the code used to perform the experiments. Note to Practitioners—This paper was motivated by the problem of monitoring equipment in the scenario of dairy products packaging, under the mild assumption that logs of the alarm generated by the packaging machines are available. This paper proposes an alarm forecasting algorithm. Its goal is to predict if any alarm will occur in the future, based only on past alarm logs. The limits of the considered future window can be defined arbitrarily, so there is enough time to perform corrective actions. Thus, the proposed approach aims to prevent unexpected downtime that would not only hinder productivity but also imply significant material waste. The proposed approach leverages methodologies from Natural Language Processing and Object Detection to deal with rare alarms that are often very informative in the industrial scenario. Besides, both the code and the real-world industrial datasets used to evaluate the methodology are available publicly. Currently, the proposed approach only uses alarm logs. Especially in the context of Industry 4.0, where many sensory data may be available, this is a limitation. Thus, the described approach might be extended by integrating alarm logs with sensory data. This integration is expected to improve the estimation of equipment health state. The results described in this paper may find application not only in the manufacturing sector but also in different areas such as Cyber Security, where log files keep activity records of each process performed. [ABSTRACT FROM AUTHOR]

In this paper, we present a class of hybrid coupled serially concatenated codes (HC-SCC), in which coupling is achieved by re-encoding partial outputs from both the outer and the inner encoders. Firstly, we derive the exact density evolution (DE) equations over the binary erasure channels (BECs) for the HC-SCCs, which can be used to analyze the impact of the coupling ratios and the coupling memories on the performances of the HC-SCCs. Secondly, we present a genie-aided lower bound for the proposed HC-SCCs to estimate their error-floors. Thirdly, we use the DE equations to design randomly punctured HC-SCCs, including rate-compatible HC-SCCs. The analytical and the numerical results show that: 1) for comparable coupling memories, the iterative decoding thresholds of the proposed HC-SCC ensembles are better than those of the recently introduced spatially coupled serially concatenated code (SC-SCC) ensembles and the partially parity-coupled turbo code (PPC-TC) ensembles; 2) with outer coupling memory five and inner coupling memory five, the iterative decoding thresholds of the rate-compatible HC-SCCs over the BECs are 0.0003 away from the corresponding channel capacities for a wide range of coding rates; 3) simulation results over the additive white Gaussian noise (AWGN) channels and the BECs are provided to confirm the performance advantages of the HC-SCCs. Particularly, the simulation results show that the HC-SCCs admit lower error-floor than the SC-SCCs and the rate-compatible HC-SCCs perform better than the PPC-TCs, which are consistent with the results of DE analysis. [ABSTRACT FROM AUTHOR]

The strong secrecy transmission problem of the arbitrarily varying wiretap channel (AVWC) with input and state constraints is investigated in this paper. First, a stochastic-encoder code lower bound of the strong secrecy capacity is established by applying the type argument and Csiszár’s almost independent coloring lemma. Then, a superposition stochastic-encoder code lower bound of the secrecy capacity is provided. The superposition stochastic-encoder code lower bound can be larger than the ordinary stochastic-encoder code lower bound. Random code lower and upper bounds of the secrecy capacity of the AVWC with constraints are further provided. Based on these results, we further consider a special case of the model, namely severely less noisy AVWC, and give the stochastic-encoder code and random code capacities. It is proved that the stochastic-encoder code capacity of the AVWC with constraints is either equal to or strictly smaller than the corresponding random code capacity, which is consistent with the property of the ordinary AVC. Finally, some numerical examples are presented to better illustrate our capacity results. Compared to the soft covering lemma that requires the codewords to be generated i.i.d., our method has more relaxed requirements regarding codebooks. It is proved that the good codebooks for secure transmission can be generated by choosing codewords randomly from a given type set, which is critical when considering the AVWC with constraints. [ABSTRACT FROM AUTHOR]

A block code is called a locally recoverable code (LRC for short) with $(r,\delta)$ -locality, if subject to any $\delta -1$ erasure failures, every symbol in the encoding can still be recovered by accessing at most $r$ other symbols. Recently, it was discovered by several authors that a $q$ -ary optimal $(r,\delta)$ -LRC, i.e., an LRC achieving the generalized Singleton-type bound, can have length much bigger than $q+1$. This is quite different from the classical $q$ -ary MDS codes where it is conjectured that the code length is upper bounded by $q+1$ (or $q+2$ for some special cases). In this paper, we further investigate constructions of optimal $(r,\delta)$ -LRCs along the line of using parity-check matrices. Inspired by classical Reed-Solomon codes and the work in Jin (2019), we equip parity-check matrices with the Vandermonde structure. It turns out that a parity-check matrix with the Vandermonde structure that produces an optimal LRC must obey certain disjoint property for subsets of $\mathbb {F}_{q}$. We manage to show the existence of these disjoint subsets. Thus, this yields an optimal $(r,\delta)$ -LRC with code length $\Omega \left({q^{\frac {\delta }{2}\left({1+\frac {1}{\lfloor \frac {d-1}{\delta }\rfloor -1}}\right)}}\right)\vphantom {\bigg)_{j}}$ , where $d$ is the minimum distance. In particular, to our surprise, for $\delta =2$ this disjoint condition is equivalent to a well-studied problem in extremal graph theory. With the help of extremal graph theory, we succeed to improve all of the best known results in Guruswami et al. (2018) for $d\geq 7$. In addition, for $d=6$ , we are able to remove the constraint required in Jin (2019) that $q$ is even. [ABSTRACT FROM AUTHOR]