Search

The chi-square control chart is one of the most popular multivariate charting techniques for monitoring the vector of means of several quality characteristics. During the last decades, runs rules have been supplemented in the design of the chi-square control chart and they have significantly improved its performance. In this article, we introduce and study a chi-square control chart with supplementary weak-run rules, which improves the chart's detection capability in the case of small and moderate process mean vector shifts. Our study also establishes new theoretical results regarding the waiting time for the first occurrence of an r-weak run in a sequence of binary trials. [ABSTRACT FROM AUTHOR]

We call an integer a near-square if its absolute value is a square or a prime times a square. We investigate such near-squares in the binary recurrence sequences defined for integers a ≥ 3 by u 0 (a) = 0 , u 1 (a) = 1 and u n + 2 (a) = a u n + 1 (a) − u n (a) for n ≥ 0. We show that for a given a ≥ 3 , there is at most one n ≥ 5 such that u n (a) is a near-square. With the exceptions of u 6 (3) = 1 2 2 and u 7 (6) = 2 3 9 ⋅ 1 3 2 , any such u n (a) can be a near-square only if a ≡ 2 (mod 4) , n ≡ 3 (mod 4) is prime and n ≥ 1 9. This is a part of a more general phenomenon regarding near-squares in nondegenerate recurrence sequences defined for the integers a and b = − b 1 2 by u 0 (a , b) = 0 , u 1 (a , b) = 1 and u n + 2 (a , b) = a u n + 1 (a , b) + b u n (a , b) for n ≥ 0. This arises from a novel Aurifeuillean-type factorization of u 2 n + 1 (a , b) we have found. [ABSTRACT FROM AUTHOR]

In this paper, we study the relation between the linear subspace of the pseudo-noise (PN)-sequences generated by a primitive polynomial and the simplex code. This family of sequences can be also seen as an Maximum Distance Separable (MDS) 2 -linear code over 2 r . Furthermore, we see how to compute the family of generalized sequences produced by a primitive polynomial by means of a first-order Reed–Muller code. [ABSTRACT FROM AUTHOR]

Zero watermarking constructs the watermark information according to the characteristics of the original data, without changing the data structure and data accuracy. Maintaining high data accuracy is the premise of building information modelling (BIM) usability, so zero watermarking is a hotspot in the research of BIM data security protection. BIM model is a type of 3D model, however, most of the existing zero watermarking algorithms for 3D models are difficult to be better applied to BIM data due to data structure differences. To solve this problem, a zero-watermarking algorithm for BIM data based on distance partitioning and skewness measure is proposed. Firstly, after spatial partitioning based on element paradigm value, the mapping relationship between different partitions and watermarking bits is established. Then, the skewness of elements is calculated, and the skewness measure sign is used as the feature to obtain the binary sequence. Finally, the dissimilarity operation is performed on the binary sequence and the original watermarking sequence which was disordered to construct the zero watermark of the BIM data. The experimental results show that the zero watermarks constructed from different BIM data are unique and robust to translation, rotation, element deletion, element addition, and format conversion attacks. In addition, the superiority of this paper's algorithm over the comparison algorithm in terms of robustness is compared. Therefore, the proposed algorithm can effectively provide technical support for BIM data copyright protection. [ABSTRACT FROM AUTHOR]

Many algorithms for image processing do not require particularly high precision, but they rely on complicated arithmetic operations for every pixel in an image. The Bernsen algorithm is a typical local thresholding algorithm for solving the problem of uneven lighting. However, this algorithm requires a significant computing overhead and is extremely sensitive to noise. In this work, two stochastic computing architectures are proposed for implementing the Bernsen algorithm by using, respectively, uncorrelated and correlated input bitstreams. Experimental results show that both designs, especially the one using correlated bitstreams, present high fault tolerance of soft errors and low hardware cost in comparison with its conventional binary implementation. However, SC logic with uncorrelated inputs is not always superior to its corresponding binary circuit in energy consumption, especially the circuit that needs long input bitstreams. That means that a reasonable use of correlation can further optimize the SC circuit design. [ABSTRACT FROM AUTHOR]

In recent years, there has been a considerable amount of research on visual evoked potential (VEP)-based brain–computer interfaces (BCIs). However, it remains a big challenge to detect VEPs elicited by small visual stimuli. To address this challenge, this study employed a 256-electrode high-density electroencephalogram (EEG) cap with 66 electrodes in the parietal and occipital lobes to record EEG signals. An online BCI system based on code-modulated VEP (C-VEP) was designed and implemented with thirty targets modulated by a time-shifted binary pseudo-random sequence. A task-discriminant component analysis (TDCA) algorithm was employed for feature extraction and classification. The offline and online experiments were designed to assess EEG responses and classification performance for comparison across four different stimulus sizes at visual angles of 0.5°, 1°, 2°, and 3°. By optimizing the data length for each subject in the online experiment, information transfer rates (ITRs) of 126.48 ± 14.14 bits/min, 221.73 ± 15.69 bits/min, 258.39 ± 9.28 bits/min, and 266.40 ± 6.52 bits/min were achieved for 0.5°, 1°, 2°, and 3°, respectively. This study further compared the EEG features and classification performance of the 66-electrode layout from the 256-electrode EEG cap, the 32-electrode layout from the 128-electrode EEG cap, and the 21-electrode layout from the 64-electrode EEG cap, elucidating the pivotal importance of a higher electrode density in enhancing the performance of C-VEP BCI systems using small stimuli. [ABSTRACT FROM AUTHOR]

The quantum approximate optimization algorithm (QAOA) is a leading candidate algorithm for solving optimization problems on quantum computers. However, the potential of QAOA to tackle classically intractable problems remains unclear. Here, we perform an extensive numerical investigation of QAOA on the low autocorrelation binary sequences (LABS) problem, which is classically intractable even for moderately sized instances. We perform noiseless simulations with up to 40 qubits and observe that the runtime of QAOA with fixed parameters scales better than branch-and-bound solvers, which are the state-of-the-art exact solvers for LABS. The combination of QAOA with quantum minimum finding gives the best empirical scaling of any algorithm for the LABS problem. We demonstrate experimental progress in executing QAOA for the LABS problem using an algorithm-specific error detection scheme on Quantinuum trapped-ion processors. Our results provide evidence for the utility of QAOA as an algorithmic component that enables quantum speedups. [ABSTRACT FROM AUTHOR]

We show that we can interpret concatenation theories in arithmetical theories without coding sequences by identifying binary strings with 2 × 2 matrices with determinant 1. [ABSTRACT FROM AUTHOR]

The diffused bit generator (DBG) is an entropy generator that generates a stream of random bits. DBG is realized using a linear feedback shift register (LFSR) and cellular automata (CA). LFSR and CA are realized using flip-flops and XOR gates. The flip-flops required are designed using true single-phase clock (TSPC)-based logic to minimize the area and power of the LFSR and CA circuits. The XOR gates used in the circuits are realized either using a 12-transistor (12T) or a 6-transistor (6T). To further reduce power dissipation in the DBG circuit, low-power techniques are incorporated. In the proposed 8-bit DBGs, the adaptive voltage level at source (AVLS) is incorporated to reduce power consumption. The circuits are realized using Cadence Virtuoso in CMOS 180 nm technology, and Specter is used for simulation and power analysis. The DBG functionality is assessed for frequencies ranging up to 1 GHz with a supply voltage of 1.8 V. From the results, it was inferred that at 1 GHz the proposed-1 DBG (using a 12T XOR gate) is 94.05% power efficient; while, the proposed-2 DBG (using a 6T XOR gate) is 90.27% power efficient when compared to the reference circuits. Implementation of the proposed-1 DBG was also carried out in CMOS 45 nm technology, the functionality was verified and the power was analyzed. A similar trend of power reduction was observed. [ABSTRACT FROM AUTHOR]

Phylogenetic Trees are critical in human genome research for investigating human evolution and identifying disease-associated genetic markers. New high-throughput genome sequencing technologies raise an urgent need to develop statistical methods that can construct phylogenetic trees from long genome sequences with quick computation speeds, while considering various biological complexities. Though an ancestral mixture model has been proposed [Chen SC, Lindsay BG. Building mixture trees from binary sequence data. Biometrika. 2006;93(4):843–860. doi: 10.1093/biomet/93.4.843] to this end by allowing genetic mutations over generations, another essential evolution factor, genetic recombination, is missed. Therefore, in this paper, we develop a novel genetic recombination model for tree construction and propose to use Markov chain composite likelihood (MCCL) to make model estimation computationally feasible. To further reduce computation complexity, a hierarchical estimator is constructed to estimate unknown ancestral distributions through MCCL. Simulation studies and real data example show that our proposed methods perform well and fast, so have the potential for implementation in long sequence genome data. [ABSTRACT FROM AUTHOR]

A time-differential (TD) Brillouin optical correlation domain analysis (BOCDA) sensor system was applied to measure the Brillouin gain spectrum of a 1 km long sensing optical fiber. The optical delay line used in all BOCDA measurement systems was eliminated in the TD-BOCDA system by using a bit-delayed modulation relationship between the probe and pump lightwaves. These lightwaves were phase modulated using 216-1 pseudo-random binary sequence codes at 5 Gbps. A 2 cm dispersion-shifted fiber placed at the end of the 1 km optical fiber was distinctly identified by the Brillouin frequency extracted from the Brillouin gain spectrum measurement. To investigate the measurement stability of the TD-BOCDA system, experiments were conducted under two different pumping conditions. A semiconductor optical amplifier (SOA) and an intensity modulator (MOD) were compared for the pump chopper used in the TD-BOCDA system to detect the extinction ratio of the pump and the resulting noise in the Brillouin gain measurement. The stability of the Brillouin frequency measurement from the Brillouin gain spectrum in the TD-BOCDA system was investigated by increasing the average value of the measurement using either the SOA or MOD. The repeated-measurement deviation of the system with the SOA was only half of the deviation observed in the system with the MOD. The performance of TD-BOCDA is equivalent to or better than that of conventional BOCDAs in terms of measurement reliability. Moreover, TD-BOCDA is free from the drawbacks of traditional BOCDA, which uses time-delayed fibers and varies the bit rates. [ABSTRACT FROM AUTHOR]

The Internet of Things (IoT) is an incredibly growing technology. However, due to hardware inadequacy, IoT security is not improving to the same extent. For this reason, lightweight encryption algorithms have begun to be developed. This paper presents a method for assessing the security of Pseudorandom Number Generator (PRNG) generated binary sequences in a reasonable time using a pre-trained deep learning (DL) model. Due to their long execution times, Randomness Test Standards (RTSs) that include statistical tests that examine whether the sequences generated by PRNGs contain any patterns that cause cryptographic vulnerabilities are not suitable for running on edge devices with low processing capacities such as the IoT. We argue that every random sequence, even generated by a PRNGs that are classified as cryptographically secure, utilized in cryptographic applications should be used after successful results obtained from RTSs in every time. Therefore, an alternative method based on machine learning has been proposed to overcome the processing time problem of these test suites. The most utilized RTSs are NIST 800-22 Rev.1a, GB/T 32915-2016 and AIS 20/31. The 800-22 Rev.1a, which NIST has designated as a standard, has been observed to be the most referenced test standard in the literature. With this implementation, we sought to show that 15 statistical tests of the NIST 800-22 rev.1a environment can be modeled using DL. The application findings indicate that this modeling can serve as an alternative to the existing test environments. The average accuracy recorded throughout 15 tests was 98.64 percent. As a result, the trained model can be implemented even in edge computing devices with limited capability including IoTs. [ABSTRACT FROM AUTHOR]

In this letter, a new learnable binary MIMO detection algorithm in massive MIMO systems with one‐bit analog‐to‐digital converters is proposed. A negative penalty is introduced to transform a non‐convex constraint to a convex box constraint and a learnable iterative algorithm is presented based on inexact alternating direction methods of multipliers. The proposed MIMO detection method performs better than the existing binary MIMO detection methods even with lower computational complexity. [ABSTRACT FROM AUTHOR]

Unpredictable strings are sequences of data with complex and erratic behavior, which makes them an object of interest in various scientific fields. Unpredictable strings related to chaos theory was investigated using a genetic algorithm. This paper presents a new genetic algorithm for converting large binary sequences into their periodic form. The MakePeriod method is also presented, which is aimed at optimizing the search for such periodic sequences, which significantly reduces the number of generations to achieve the result of the problem under consideration. The analysis of the deviation of a nonperiodic sequence from its considered periodic transformation was carried out, and methods of crossover and mutation were investigated. The proposed algorithm and its associated conclusions can be applied to processing large sequences and different values of the period, and also emphasize the importance of choosing the right methods of crossover and mutation when applying genetic algorithms to this task. [ABSTRACT FROM AUTHOR]

Background: The STRUCTURE software has gained popularity as a tool for population structure and genetic analysis. Nevertheless, formatting data to meet STRUCTURE's specific requirements can be daunting and susceptible to errors, especially when handling multilocus data. This article highlights the creation of a graphical user interface (GUI) application tailored to streamline the process of converting multiple sequence alignments into a single, cohesive file that is compatible with the STRUCTURE software. Results: The application has been developed utilizing Tkinter for the GUI and Biopython for handling FASTA files. This program processes the files, pinpoints variable sites, and converts the sequences into a binary format. Subsequently, the sequences are concatenated and presented within the graphical interface's text area, enabling users to review and confirm the results. Furthermore, the program stores the concatenated results in a file, delivering a ready-to-use input for the STRUCTURE software. Conclusion: This application offers an efficient and dependable solution for transforming multiple aligned FASTA files into a concatenated binary format file, which is compatible with the STRUCTURE software. With its user-friendly graphical interface and error-reduction approach, this tool proves invaluable for researchers engaged in population structure and genetic analysis. [ABSTRACT FROM AUTHOR]

Motivation Up to 75% of the human genome encodes RNAs. The function of many non-coding RNAs relies on their ability to fold into 3D structures. Specifically, nucleotides inside secondary structure loops form non-canonical base pairs that help stabilize complex local 3D structures. These RNA 3D motifs can promote specific interactions with other molecules or serve as catalytic sites. Results We introduce PERFUMES, a computational pipeline to identify 3D motifs that can be associated with observable features. Given a set of RNA sequences with associated binary experimental measurements, PERFUMES searches for RNA 3D motifs using BayesPairing2 and extracts those that are over-represented in the set of positive sequences. It also conducts a thermodynamics analysis of the structural context that can support the interpretation of the predictions. We illustrate PERFUMES' usage on the SNRPA protein binding site, for which the tool retrieved both previously known binder motifs and new ones. Availability and implementation PERFUMES is an open-source Python package (https://jwgitlab.cs.mcgill.ca/arnaud_chol/perfumes). [ABSTRACT FROM AUTHOR]

Globally, unconventional hydrocarbons, known for the symbiosis of their hydrocarbon source and reservoir, pose significant seismic exploration challenges due to their confined target regions, extensive burial depth, minimal acoustic impedance variation, marked heterogeneity, and strong anisotropy. Over the past decade, electromagnetic (EM) exploration has evolved markedly, improving resolution and reliability, thus becoming indispensable in unconventional hydrocarbon exploration. Focusing on China's application of the controlled source electromagnetic method (CSEM), this review examines the geological and electrical attributes of these reservoirs, notably the low resistivity, high polarization and strong electrical anisotropy of shale gas reservoirs. Despite the demonstrated positive correlation between induced polarization (IP) parameters and reservoir parameters, current methodologies emphasize the IP effect, inadvertently neglecting electrical anisotropy, which affects data precision. Moreover, single-source CSEM methodologies limit the observational components, acquisition density, and exploration area, impacting the accuracy and efficacy of data interpretation. Recently developed CSEM techniques in China, namely wide-frequency electromagnetic method (WFEM), time–frequency electromagnetic method (TFEM), long offset transient electromagnetic method (LOTEM), and wireless electromagnetic method (WEM), harness high-power pseudo-random binary sequence (PRBS) waveforms, reference observation and processing technology, hybrid inversion, and enhancing operational efficiency and adaptability despite the pressing need for multi-functional software for data acquisition. Case studies detail these methods' applications in shale gas sweet spot detection and continuous hydraulic fracturing monitoring, highlighting the immense potential of EM methods in unconventional hydrocarbon sweet spot detection and total organic content (TOC) predication. However, challenges persist in suppressing EM noise, streamlining 3D inversion processes, and improving the detection and evaluation of sweet spots. [ABSTRACT FROM AUTHOR]

Identification of white dwarfs (WD) with main-sequence (MS) companions and characterization of their properties can put important constraints on our understanding of binary stellar evolution and guide the theoretical predictions for a wide range of interesting transient events relevant for, e.g. Rubin Observatory (LSST), ZTF, and LISA. In this study, we combine ultraviolet (UV) and optical colour–magnitude diagrams (CMDs) to identify unresolved WD–MS binaries. In particular, we combine high-precision astrometric and photometric data in the optical from Gaia -DR3 and UV data from GALEX GR6/7 to identify 93 WD–MS candidates within 100 pc. Of these, 80 are newly identified. Using the Virtual Observatory SED Analyzer (VOSA), we fit the spectral energy distributions (SEDs) of all our candidates and derive stellar parameters, such as effective temperature, bolometric luminosity, and radius for both companions. We find that our identification method helps identify hotter and smaller WD companions (majority with ≥10 000 K and ≤0.02 R⊙) relative to the WDs identified by past surveys. We infer that these WDs are relatively more massive (median ∼ |$0.76\, \mathrm{M}_\odot$|⁠). We find that most of the MS companions in our binaries are of the K and M spectral types. [ABSTRACT FROM AUTHOR]

An optimized millimeter-wave digital controlled oscillator (DCO) in a 40-nm CMOS process is presented in this work. The coarse-tuning modules and medium-tuning modules of the DCO utilize modified binary-weighted digitally controlled transmission lines (DCTLs) to achieve a better compromise among smaller chip size, higher resonant frequency, better tuning resolution and lower phase noise. The tuning precision and die size of the medium tuning bank are improved without changing the binary coding rules by replacing the lowest-weight bit of the DCTLs with switched capacitors. In comparison with traditional DCTLs, the control bits of the coarse and medium tuning modules have been changed from 30 to 8, resulting in a 34.4% reduction in overall length (from 122 μ m to 80 μ m). In addition, the DCO's fine-tuning modules are achieved using a binary-weighted switched capacitors array connected to the secondary winding of a low-coupling transformer, which enhances the DCO's fine-tuning bank for better frequency resolution with less circuit complexity. The measured tuning range of the optimized DCO is 76-81GHz with a smaller die size of 0.12mm 2 . This results in an outstanding figure of merit ( F o M A ) of − 190.52dBc/Hz. [ABSTRACT FROM AUTHOR]

Entropy estimation is a fundamental problem in information theory that has applications in various fields, including physics, biology, and computer science. Estimating the entropy of discrete sequences can be challenging due to limited data and the lack of unbiased estimators. Most existing entropy estimators are designed for sequences of independent events and their performances vary depending on the system being studied and the available data size. In this work, we compare different entropy estimators and their performance when applied to Markovian sequences. Specifically, we analyze both binary Markovian sequences and Markovian systems in the undersampled regime. We calculate the bias, standard deviation, and mean squared error for some of the most widely employed estimators. We discuss the limitations of entropy estimation as a function of the transition probabilities of the Markov processes and the sample size. Overall, this paper provides a comprehensive comparison of entropy estimators and their performance in estimating entropy for systems with memory, which can be useful for researchers and practitioners in various fields. [ABSTRACT FROM AUTHOR]

Colloidal molecules (CMs) are precisely defined assemblies of nanoparticles (NPs) that mimic the structure of real molecules, but externally programming the precise self‐assembly of CMs is still challenging. In this work, we show that the photo‐induced self‐assembly of complementary copolymer‐capped binary NPs can be precisely controlled to form clustered ABx or linear (AB)y CMs at high yield (x is the coordination number of NP‐Bs, and y is the repeating unit number of AB clusters). Under UV light irradiation, photolabile p‐methoxyphenacyl groups of copolymers on NP‐A*s are converted to carboxyl groups (NP‐A), which react with tertiary amines of copolymers on NP‐B to trigger the directional NP bonding. The x value of ABx can be precisely controlled between 1 and 3 by varying the irradiation duration and hence the amount of carboxyl groups generated on NP‐As. Moreover, when NP‐A* and NP‐B are irradiated after mixing, the assembly process generates AB clusters or linear (AB)y structures with alternating sequence of the binary NPs. This assembly approach offers a simple yet non‐invasive way to externally regulate the formation of various CMs on demand without the need of redesigning the surface chemistry of NPs for use in drug delivery, diagnostics, optoelectronics, and plasmonic devices. [ABSTRACT FROM AUTHOR]

A binary stream cipher cryptosystem can be used to encrypt/decrypt many types of digital files, especially those can be considered huge data files like images. To guarantee that the encryption or decryption processes need a reasonable time to encrypt/decrypt the images, so we have to make the stream cipher key generator that acts quickly without effect in the complexity or randomness of the output key binary sequences. In this paper, we increase the size of the output sequence from binary to digital sequence in the field GF(2 8 ) to obtain byte sequence, then we test this new sequence not only as binary but also 2 8 -sequence. So we have to test the new output sequence in the new mathematical field. This is done by changing the base of the randomness tests and extending Golomb’s postulates from binary to 256. Some theorems and lemmas are proved to find the new testing laws that are suitable to the new sequences field. The results of using the extended randomness tests are compared to the results of binary randomness tests to guarantee that the decision of pass or fail is identical, the results also prove the precision of identicalness. [ABSTRACT FROM AUTHOR]

Colloidal molecules (CMs) are precisely defined assemblies of nanoparticles (NPs) that mimic the structure of real molecules, but externally programming the precise self‐assembly of CMs is still challenging. In this work, we show that the photo‐induced self‐assembly of complementary copolymer‐capped binary NPs can be precisely controlled to form clustered ABx or linear (AB)y CMs at high yield (x is the coordination number of NP‐Bs, and y is the repeating unit number of AB clusters). Under UV light irradiation, photolabile p‐methoxyphenacyl groups of copolymers on NP‐A*s are converted to carboxyl groups (NP‐A), which react with tertiary amines of copolymers on NP‐B to trigger the directional NP bonding. The x value of ABx can be precisely controlled between 1 and 3 by varying the irradiation duration and hence the amount of carboxyl groups generated on NP‐As. Moreover, when NP‐A* and NP‐B are irradiated after mixing, the assembly process generates AB clusters or linear (AB)y structures with alternating sequence of the binary NPs. This assembly approach offers a simple yet non‐invasive way to externally regulate the formation of various CMs on demand without the need of redesigning the surface chemistry of NPs for use in drug delivery, diagnostics, optoelectronics, and plasmonic devices. [ABSTRACT FROM AUTHOR]

The study proposes a highly credible true random number generator based on the structural frustration of nematic liquid crystals, which refers to the appearance of two energetically equivalent structures in a nematic system. Frustration is induced in a simple liquid crystal cell by applying an electric field and observing optical textures under crossed polarizers. A clockwise or counterclockwise spiral image appears on 630 separate circular electrodes under the electric field, and random binary sequences are obtained by assigning a digit of 0 or 1 to each image. These sequences pass the strict statistical randomness tests of the National Institute of Standards and Technology with a pass rate of 0.992 or higher for the ten applicable tests and exhibit excellent uniformity. Furthermore, a simple method is introduced to convert the binary results to random decimal numbers with only a minimal amount of data processing. [ABSTRACT FROM AUTHOR]

The fate of stars in the zero-age main-sequence (ZAMS) range ≈8–12 M ⊙ is unclear. They could evolve to form white dwarfs or explode as electron-capture supernovae (SNe) or iron core-collapse SNe (CCSNe). Even though the initial mass function indicates that this mass range should account for over 40% of all CCSN progenitors, few have been observationally confirmed, likely due to the faintness and rapid evolution of some of these transients. In this paper, we present a sample of nine Ca-rich/O-poor Type IIb SNe detected by the Zwicky Transient Facility with progenitors likely in this mass range. These sources have a [Ca ii ] λ λ 7291, 7324/[O i ] λ λ 6300, 6364 flux ratio of ≳2 in their nebular spectra. Comparing the measured [O i ] luminosity (≲1039 erg s−1) and derived oxygen mass (≈0.01 M ⊙) with theoretical models, we infer that the progenitor ZAMS mass for these explosions is less than 12 M ⊙. The ejecta properties (M ej ≲ 1 M ⊙ and E kin ∼ 1050 erg) are also consistent. The low ejecta mass of these sources indicates a class of strongly-stripped SNe that is a transition between the regular stripped-envelope SNe and ultra-stripped SNe. The progenitor could be stripped by a main-sequence companion and result in the formation of a neutron star−main sequence binary. Such binaries have been suggested to be progenitors of neutron star−white dwarf systems that could merge within a Hubble time and be detectable with LISA. [ABSTRACT FROM AUTHOR]

The advent of the information age and the continuous development of spectrum imaging technologies have both triggered an explosion of multispectral image information data. Hence, image data need to be compressed first no matter transmitting or storing information. This paper designs an end-to-end compression algorithm based on spectral–spatial domain feature leaning (SSDFL). SSDFL consists of dual branches: one to obtain spectral features by Bi-ConvLSTM, and the other for spatial feature extraction via residual multiscale depth-wise convolutions (RMDCs). The attention mechanism is conductive to ulteriorly fuse features. The encoder with SSDFL serves to extract important features from multispectral images and decrease their size to 1/8 of its original size. After decreasing dimensions of images, the quantizer turns the latent floating-point characteristics into integer data. The following phase utilizes lossless entropy coding to execute coding on the integer input and estimate the bitstream. The rate-distortion is added to the training process in order to jointly optimize the image bitstream and loss. The decoder is nearly symmetrical to the encoder to restore high-quality images. Two datasets from the WorldView-3 and Setinel-2 satellites are adopted in experiment with PSNR, MS-SSIM, SS, and MSA as evaluation indexes. Corresponding results prove that the performance of the proposed approach is superior to that of traditional compression algorithms 3D-SPIHT and JPEG2000. In addition, compared with deep learning compression methods CNN-based, ConvGRU-based and Partitioned, the suggested method still outperforms at various bitrates. [ABSTRACT FROM AUTHOR]

In this letter, a novel true random number generator (TRNG) with high energy‐efficient and throughput is proposed for cryptographic systems. The current starve based ring oscillator (CSRO) is biased in the subthrehold region as an entropy source. An individual ring oscillator (RO) is sampled using multiple sampling points of the CSRO working in the sub‐threshold region to obtain a multi‐channel sequence output, thereby fully exploiting the randomness of the entropy source. The proposed TRNG is implemented using a standard 40nm CMOS technology and the simulation results show that it provides high‐quality and 20.66 Mbps random sequences while only consuming 11.46 μW at 1.1 V, 25°C. In addition, the proposed TRNG passes the NIST SP 800‐22 and the NIST SP 800‐90B tests without post‐processing and outperforms the state‐of‐the‐art in terms of energy consumption per bit of the output bitstream, reaching 0.555pJ/bit. [ABSTRACT FROM AUTHOR]

According to the language-of-thought hypothesis, regular sequences are compressed in human memory using recursive loops akin to a mental program that predicts future items. We tested this theory by probing memory for 16-item sequences made of two sounds. We recorded brain activity with functional MRI and magneto-encephalography (MEG) while participants listened to a hierarchy of sequences of variable complexity, whose minimal description required transition probabilities, chunking, or nested structures. Occasional deviant sounds probed the participants' knowledge of the sequence. We predicted that task difficulty and brain activity would be proportional to the complexity derived from the minimal description length in our formal language. Furthermore, activity should increase with complexity for learned sequences, and decrease with complexity for deviants. These predictions were upheld in both fMRI and MEG, indicating that sequence predictions are highly dependent on sequence structure and become weaker and delayed as complexity increases. The proposed language recruited bilateral superior temporal, precentral, anterior intraparietal, and cerebellar cortices. These regions overlapped extensively with a localizer for mathematical calculation, and much less with spoken or written language processing. We propose that these areas collectively encode regular sequences as repetitions with variations and their recursive composition into nested structures. [ABSTRACT FROM AUTHOR]

The authors have analyzed the features of various distances (metrics) in solving problems of comparing bitstreams. They have considered the application of the proposed methodology using the example of solving the problem of identifying bitstreams of digital speech encoding. The authors have shown that, in this case, the Damerau–Levenshtein metric is the most effective one. [ABSTRACT FROM AUTHOR]

This paper presents a pseudo-random binary sequence (PRBS) generator using merged XOR-D flip-flop as building blocks. The proposed architecture uses differential cascode voltage switch logic (DCVSL)-based dynamic XOR gate. The cross-coupled architecture of the pull-up network creating positive feedback in the DCVSL XOR gate is used as a latch by adding a transistor to apply a clock signal. This arrangement reduces the requirement of one latch in a master–slave D flip-flop (MS-DFF) from each lane. It reduces the area occupied in the layout and power requirements for the PRBS generator. The post-layout simulation for the PRBS generator operating at 5 Gb/s is performed in the 65 nm CMOS technology with a 1 V supply voltage. The proposed PRBS generator requires 2.4 mW of power. The jitter is 5.6 ps for the worst-case output of the proposed PRBS generator. In the proposed merged XOR-D flip-flop, there is an improvement of 33.3%, 27.4%, 29.1%, and 31.2% in power, area, maximum operating frequency, and the number of transistors, respectively, compared to when both XOR gate and D flip-flop are used separately. The figure of merit is improved by 14.8% for the proposed PRBS generator. [ABSTRACT FROM AUTHOR]

Due to the wide application of image information transmission technology, people have higher requirement for the security of image transmission. Aiming at the problem that the previous encryption scheme uses a single key to encrypt the image information, and the key leakage will directly lead to the theft of the image information, an image encryption scheme combining optical chaos and elliptic curve encryption algorithm is proposed. The external key input by the user and the hash function of the plaintext image jointly generate the control parameters required for image encryption and encrypt the plaintext image together with the optical chaotic sequence. The control parameters are encrypted by the public key of the elliptic curve encryption algorithm and transmitted to the receiver. Only by combining the decrypted control parameters with the optical chaotic sequence synchronized at the receiver to generate the decryption sequence of each stage, the image can be restored. When the optical chaotic sequence is generated, the binary sequence generated by the control parameters will be used to encrypt the optical chaotic sequence, so that the optical chaotic sequence can be double encrypted at the physical layer and the application layer, and it is difficult to decipher the physical parameters of the laser and improve the security of encryption. The experimental simulation results show that the key space of the encryption scheme is greater than 2100, the information entropy is close to the theoretical maximum value of 8, the Number of Pixels Change Rate, and the Unified Average Changing Intensity are close to the theoretical value of 99.6094% and 33.4635%, respectively. And it has good robustness to various typical attacks. [ABSTRACT FROM AUTHOR]

The paper presents the results of the study of the influence of symmetry in the design of bit-stream digital converters. We have shown realizations of the symmetry-based approach at different levels: at the level of basic elements, functional converters, and at the level of processes occurring in bit-streaming devices. Using symmetry in design, we have developed basic bit-stream elements that realize frequently used transformations with good technical performance. As a research result, we present descriptions and implementation results of the designed symmetric bit-stream devices in FPGA chips. Using the proposed elements and the concept of symmetric bit-stream device design, we designed and presented a specialized computing module for a temperature sensor controller. [ABSTRACT FROM AUTHOR]

Let l be an odd prime with l ≡ 1 (mod 4) , N = l m a positive integer, ord N (2) = f , and q = 2 f , where f = ϕ (N) / t and ϕ (·) is the Euler's function. Let { u i } = (Tr q / 2 (ω i)) i = 0 q - 2 be a binary sequence of period q - 1 , where ω is a primitive element of a finite field F q . In this paper, we obtain two-valued cross correlation distributions between two sequences { u i } and their q - 1 N -decimation sequences in two cases: t = 2 and t = 4 . [ABSTRACT FROM AUTHOR]

Digital watermarking technology is an important means to effectively protect three-dimensional (3D) model data. Among them, "blind detection" and "robustness" are key and difficult points in the current research of digital watermarking technology based on 3D models. In order to realize the blind detection of a watermark and improve its robustness against various common attacks at the same time, this paper proposes a dual blind watermarking method based on the normal feature of the centroid of first-ring neighboring points. The local spherical coordinate system is constructed by calculating two different normal vectors, and the first pattern watermark and the second random binary sequence watermark are embedded, respectively. The experimental results show that this method can not only realize the blind detection of dual watermarks, but also have the ability to resist common attacks such as translation, rotation, scaling, cropping, simplification, smoothing, noise, and vertex reordering to a certain extent. [ABSTRACT FROM AUTHOR]

A new substitution and permutation method for the encryption/decryption of two-channel audio files based on chaotic maps is presented. The proposed scheme's structure depends on encoding the original audio data into a new data range. Each value in the resulted range was translated to a binary sequence and both substitution and permutation operations are accomplished using the chaotic state and chaotic parameters. The substitution was attained using the XORing operation and Bernoulli substitution while the permutation method was based on the numbers sequence generated using a hyper chaotic system. A new key generation algorithm is proposed based on the properties of the square root of large prime numbers and a hyper chaotic system to produce the keys. The proposed cipher system was tested by various audio file sizes of (.WAV) extension. Performance evaluation and security measures to assess the algorithm's security against various attacks. The results of the key space analysis, statistical analysis, mean square error analyses, Peak signal to noise ratio (PSNR) analyses, entropy analyses, homogeneity, contrast, SNR, etc. showed that the proposed cipher is notably secured in opposition to the attackers and possesses an effective diffusion and confusion mechanism for better audio communication with inside the area of telecommunication. [ABSTRACT FROM AUTHOR]

We consider the problem of testing the hypothesis that the tested sequence is a sequence of independent random variables that take values 1 and –1 with equal probability. To solve this problem, the Discrete Fourier Transform (spectral) test of the NIST package uses the statistic TFourier, the exact limiting distribution of which is unknown. In this paper a new statistic is proposed and its limiting distribution is established. This new statistic is a slight modification of TFourier. A hypothesis about the limit distribution of TFourier is formulated, which is confirmed by numerical experiments presented by Pareschi F., Rovatti R. and Setti G. [ABSTRACT FROM AUTHOR]

Primary User Emulation Attack (PUEA) is the most serious concern in Cognitive Radio (CR). The PUEA are malevolent users attempt to imitate primary signals and confuse CR users to prevent them from accessing vacant frequency bands. The proposed technique detects energy and assigns an appropriate threshold value for identifying attackers in the network using unique Smart Threshold detection (STD). The free space propagation model and two ray ground models are considered for finding the attacks. The authentication confirmation process (ACP) is carried out for detecting multiple PUEAs; ACP uses DNA sequencing using Binary to Excess One (BEO). The objective of this paper is to identify the PUEAs from the network and not providing the vacant frequency bands to the PUEAs and the frequent bands should be used by the primary and the secondary user efficiently. Here the secondary user will find out whether the PUEA or primary user is accessing the vacant bands using the STD-ACP technique. The simulation process is executed in the MATLAB platform. The Proposed STD-ACP finds out the attack strength, probability of detection, probability of error, probability of false alarms, and identifies the number of PUEAs. By simulating the performance of the primary user will be increased while the PUEAs can be detached from the network. The proposed STD-ACP approach is compared with attack-aware threshold selection (AATS), optimal voting rule, and K-out-of-N rule methods respectively. [ABSTRACT FROM AUTHOR]

Novel hardware architectures for dynamic reconfigurable implementation of 64-bit MISTY1 and KASUMI block ciphers are proposed to enhance the performance of cryptographic chips for secure IoT applications. The SRL32 primitive (Reconfigurable Look up Tables—RLUTs) and DPR (Dynamic Partial Reconfiguration) are employed to reconfigure single round MISTY1 / KASUMI algorithms on the run-time. The RLUT based architecture attains dynamic logic functionality without extra hardware resources by internally modifying the LUT contents. The proposed adaptive reconfiguration can be adopted as a productive countermeasure against malicious attacks with the added advantage of less reconfiguration time (RT). On the other hand, the block architecture reconfigures the core hardware by externally uploading the partial bit stream and has significant advantages in terms of low area implementation and power reduction. Implementation was carried out on FPGA, Xilinx Virtex 7. The results showed remarkable results with very low area of 668 / 514 CLB slices consuming 460 / 354 mW for RLUT and DPR architectures respectively. Moreover, the throughput obtained for RLUT architecture was found as 364 Mbps with very less RT of 445 nsec while DPR architecture achieved speed of 176 Mbps with RT of 1.1 msec. The novel architectures outperform the stand-alone existing hardware designs of MISTY1 and KASUMI implementations by adding the dynamic reconfigurability while at the same achieving high performance in terms of area and throughput. Design details of proposed unified architectures and comprehensive analysis is described. [ABSTRACT FROM AUTHOR]

An integrated patterned wettability surface was simply prepared for real-time detection of conductive/non-conductive liquids based on anisotropic wettability, while the signal from conductive liquids could be selectively output as a binary sequence signal. In addition, the p–n heterojunction formed by the hybridized photocatalytic particles significantly improved the photodegradation ability, and efficient degradation of a variety of water-soluble dyes (10 mg L−1) could be achieved after 3 h of UV irradiation (MB, 93.8%; R6G, 89.6%). [ABSTRACT FROM AUTHOR]

Using the Hubble Ultraviolet Globular Cluster Survey (HUGS) and additional HST archival data, we have carried out a search for optical counterparts to the low-luminosity Chandra X-ray sources in the globular cluster M4 (NGC 6121). We have also searched for optical or X-ray counterparts to radio sources detected by the VLA. We find 24 new confident optical counterparts to Chandra sources for a total of 40, including the 16 previously identified. Of the 24 new identifications, 18 are stellar coronal X-ray sources (active binaries, ABs), the majority located along the binary sequence in a V 606– I 814 colour–magnitude diagram and generally showing an H α excess. In addition to confirming the previously detected cataclysmic variable (CV, CX4), we identify one confident new CV (CX76), and two candidates (CX81 and CX101). One MSP is known in M4 (CX12), and another strong candidate has been suggested (CX1); we identify some possible MSP candidates among optical and radio sources, such as VLA20, which appears to have a white dwarf counterpart. One X-ray source with a sub-subgiant optical counterpart and a flat radio spectrum (CX8, VLA31) is particularly mysterious. The radial distribution of X-ray sources suggests a relaxed population of average mass |$\sim 1.2\!-\! 1.5\, \mbox{$\mathrm{ M_\odot} $}$|⁠. Comparing the numbers of ABs, MSPs, and CVs in M4 with other clusters indicates that AB numbers are proportional to cluster mass (primordial population), MSPs to stellar encounter rate (dynamically formed population), while CVs seem to be produced both primordially and dynamically. [ABSTRACT FROM AUTHOR]

The incorporation of digital modulation into radar systems poses various challenges in the field of radar design, but it also offers a potential solution to the shrinking availability of low-noise operating environments as the number of radar applications increases. Additionally, digital systems have reached a point where available components and technology can support higher speeds than ever before. These advancements present new avenues for radar design, in which digitally controlled phase-modulated continuous wave (PMCW) radar systems can look to support multiple collocated radar systems with low radar-radar interference. This paper proposes a reconfigurable PMCW radar for use in vital sign detection and gesture recognition while utilizing digital carrier modulation and compares the radar responses of various modulation schemes. Binary sequences are used to introduce phase modulation to the carrier wave by use of a field programable gate array (FPGA), allowing for flexibility in the modulation speed and binary sequence. Experimental results from the radar demonstrate the differences between CW and PMCW modes when measuring the respiration rate of a human subject and in gesture detection. [ABSTRACT FROM AUTHOR]

Steganography is a vast arena to provide security in digital media at the time of network-level transmission. This research is based on a pioneer steganographic approach introducing Image Authentication using Boustrophedon Transformation (IABT) to ensure secured communication. The research experiment is performed using ten benchmark images of 512 × 512 dimensions and the performance result of each of the images has been analyzed thoroughly. In order to implement this transformation technique to the cover images, each of the cover media is decomposed into 1 × 3 blocks. These decomposed spatial components are transformed into frequency components by implementing the Boustrophedon transformation. Confidential data in a bit stream format is embedded into each of the transformed coefficients. Furthermore, the Inverse Boustrophedon transformation is used for converting the transformed embedded coefficients back to the pixel components. This process is kept on repeating until the entire bit stream of the hidden information is inserted into the carrier media to produce a steganography image. Moreover, the performance factor of the proposed method is examined in terms of PSNR, MSE, IF, and Payload, which shows overall better performances of the IABT. [ABSTRACT FROM AUTHOR]

Knuth's 0–1 principle argues that the correctness of any swap-based sorting network can be verified by testing arbitrary sequences over Boolean values (i.e., 0 and 1). Voigtländer (Proceedings of the 35th ACM SIGPLAN-SIGACT symposium on principles of programming languages, POPL 2008, San Francisco, California, USA, January 7–12, 2008. ACM, New York, NY, pp 29–35, 2008. https://doi.org/10.1145/1328438.1328445) proved a similar result for prefix-sum networks that consist of associative binary operators: the correctness can be verified by testing arbitrary sequences and associative binary operators over three values, namely 0, 1, and 2. He raised the question of whether testing over Boolean values is sufficient if the binary operator is idempotent in addition to associative. This paper answers his question. First, there is an incorrect prefix-sum network for associative idempotent operators, the flaw of which cannot be detected by testing over Boolean values. Second, testing over Boolean values is sufficient if the binary operators are restricted to commutative in addition to associative and idempotent. [ABSTRACT FROM AUTHOR]

We study the problem of prediction of binary sequences with expert advice in the online setting, which is a classic example of online machine learning. We interpret the binary sequence as the price history of a stock, and view the predictor as an investor, which converts the problem into a stock prediction problem. In this framework, an investor, who predicts the daily movements of a stock, and an adversarial market, who controls the stock, play against each other over N turns. The investor combines the predictions of n≥2 experts in order to make a decision about how much to invest at each turn, and aims to minimize their regret with respect to the best‐performing expert at the end of the game. We consider the problem with history‐dependent experts, in which each expert uses the previous d days of history of the market in making their predictions. We prove that the value function for this game, rescaled appropriately, converges as N→∞ at a rate of ON−1/6 to the viscosity solution of a nonlinear degenerate elliptic PDE, which can be understood as the Hamilton‐Jacobi‐Issacs equation for the two‐person game. As a result, we are able to deduce asymptotically optimal strategies for the investor. Our results extend those established by the first author and R.V. Kohn [14] for n=2 experts and d≤4 days of history. © 2022 The Authors. Communications on Pure and Applied Mathematics published by Wiley Periodicals LLC. [ABSTRACT FROM AUTHOR]

In this paper, we propose a novel image coding framework with semantic-aware visual decomposition towards extremely low bitrate compression. In particular, an input image is analyzed into a semantic map as structural representation and semantic-wise texture representation and further compressed into bitstreams at the encoder side. On the decoder side, the received bitstreams of dual-layer representations are decoded and reconstructed for target image synthesis with generative models. Moreover, the attention mechanism is introduced into the model architecture for texture representation modeling and a coherency regularization is proposed to further optimize the texture representation space by aligning the representation space with the source pixel space for higher synthesis quality. Besides, we also propose a cross-channel entropy module and control the quantization scale to facilitate rate-distortion optimization. Upon compressing the decomposed components into the bitstream, the simple yet effective representation philosophy benefits image compression in many aspects. First, in terms of compression performance, compact representations, and high visual synthesis quality can bring remarkable advantages. Second, the proposed framework yields a physically explainable bitstream composed of the structural segment and semantic-wise texture segments. Third and most importantly, subsequent vision tasks (e.g., content manipulation) can receive fundamental support from the semantic-aware visual decomposition and synthesis mechanism. Extensive experimental results demonstrate the superiority of the proposed framework towards efficient visual representation learning, high efficiency image compression ( < 0.1 bpp), and intelligent visual applications (e.g., manipulation and analysis). [ABSTRACT FROM AUTHOR]

An algorithm for recovering transmitted static identifiers (IDs) in rolling shutter based Optical Camera Communication systems is proposed by the authors, considering a system comprised of a camera and a circular light source. The goal is to allow the correct decoding when the ID frame is only partially detected in the image. A baseline algorithm as reference for the frame recovery success rate (FRSR) and a reconstruction algorithm based on the idea of capturing multiple frame fragments and reassembling them is proposed in order to recover the transmitted ID not entirely seen on a single image. It was proven, by simulation, that the maximum distance at which the IDs recovery can be guaranteed is increased by 2.5 fold with the proposed algorithm, for 6‐bit, 8‐bit and 10‐bit codewords. An experimental validation algorithm was also proposed, using image processing techniques to extract the bitstreams and test the ID recovery process. The proposed algorithm improves the FRSR for a given distance, even in the presence of considerable bit errors in the bitstreams extracted from the images. [ABSTRACT FROM AUTHOR]

Several reasonably cyclotomic sequences are constructed by cyclotomic classes having good pseudo-randomness property. In this paper, we derive the linear complexity of an extended binary cyclotomic sequences of order 2 l t over finite field having period p q. Our result shows that these sequences have higher linear complexity, which can resist linear attack. [ABSTRACT FROM AUTHOR]

Difference sets have wide applications in constructing sequences and codes in engineering and cryptography, and in imaging with coded masks in astronomical events and in medical events. In this paper, the relation between difference sets and binary sequences is presented and a coded mask as an application of difference sets is given. First of all, an algorithm for an appropriate difference set is written in C++ by using twin primes and then a coded mask for imaging astronomical events is designed with the aid of this algorithm. [ABSTRACT FROM AUTHOR]

Let U = (U n) n ∈ ℕ be a fixed binary recurrence with real characteristic roots α , β satisfying | α | > | β | and let p 1 , ... , p s be fixed distinct prime numbers. In this paper, we show that there exist effectively computable, positive constants C + and C − such that the Diophantine equation U n − p 1 x 1 ⋯ p s x s = c has at most s solutions (n , x 1 , ... , x s) ∈ ℕ s + 1 if c > C + and at most s + 1 solutions (n , x 1 , ... , x s) ∈ ℕ s + 1 if c < − C − . In order to demonstrate the strength of our method we show that for the binary recurrence sequence A = (A n) n ∈ ℕ , with A n + 2 = 3 A n + 1 + A n for n ≥ 2 , A 0 = 0 and A 1 = 1 , the Diophantine equation A n − 2 x 1 3 x 2 5 x 3 1 7 x 4 1 9 x 5 = c has at most six solutions (n , x 1 , ... , x 5) unless c = − 3 5 in which case it has exactly seven solutions. [ABSTRACT FROM AUTHOR]

The photonic firewall that can directly detect intrusion in the optical layer is an important network security tool for optical networks. The all-optical matching system is the core part of the photonic firewall, which can recognize the designated target sequence, such as an IP address and port number in the input data sequence. In optical networks, the diversity of modulation formats and the uncertainty of attack sources require the flexibility of matching systems. Flexible matching means the matching system can identify various signal fields with multiple modulation formats, avoiding to place separate matching systems to handle signals with different modulation formats separately and reduces the system complexity. And the recognition of various fields makes the matching system can promote the attack masking from a single user to the subnet according to the field of the subnet mask before determining the attacking IP address. Moreover, the all-optical matching system should be phase-locking free to avoid photoelectric conversion. In this paper, we designed the phase-locking-free all-optical flexible matching system to recognize the different sequence fields in OOK, BPSK, and Polsk signals. The proposed system is verified through VPI Transmission Maker 8.5. Simulation results show that the proposed system can achieve sequence recognition in optical OOK, BPSK, and Polsk signals at the data rate of 80 Gbps. [ABSTRACT FROM AUTHOR]