Search

In this paper, we consider the challenge of ensuring secure communication in block-fading wiretap channels using encoding techniques. We investigate the coding for block-fading wiretap channels using stacked lattice codes constructed over completely real number fields, which is a well-established technique. In this paper, we consider degree-four complex multiplication field 풦 = ℚ(ς8) over ℚ. We employ binary codes to generate a lattice over ℚ(ς8), which is subsequently used to form an integral lattice. The resulting integral lattice can be effectively applied to enhance the security of communication within block-fading wiretap channels. [ABSTRACT FROM AUTHOR]

High-Efficiency Video Coding (HEVC) has a higher coding efficiency, its encoding performance must be increased to keep up with the expanding number of multimedia applications. Therefore, this paper proposes a novel Rectified Linear Unit-Bidirectional Long Short-Term Memory-based Tree Social Relations Optimization (ReLU-BiLSTM-based TSRO) method to enhance the quality of video transmission. The significant objective of our proposed method aims in enhancing the standards of entropy encoding process in HEVC. Here, context-adaptive binary arithmetic coding (CABAC) framework which is prevalent and an improved form of entropy coding model is utilized in HEVC standards. In addition to this, the performances of the proposed method are determined by evaluating various measures such as mean square error, cumulative distribution factor, compression ratio, peak signal-to-noise ratio (PSNR) and bit error rate. Finally, the proposed method is examined with five different sequences of video from football, tennis, garden, mobile and coastguard. The performances of the proposed method are compared with various approaches, and the result analysis shows that the proposed method attained minimum mean square error (MSE) loss with maximum PSNR rate. [ABSTRACT FROM AUTHOR]

In this paper, we construct a self-dual complete resolution of a module defined by a pair of embedded complete intersection ideals in a local ring. Our construction is based on a gluing construction of Herzog and Martsinkovsky and exploits the structure of Koszul homology in the embedded complete intersection case. As a consequence of our construction, we produce an isomorphism between certain stable homology and cohomology modules. [ABSTRACT FROM AUTHOR]

The ever-increasing need to ensure that code is reliably, efficiently and safely constructed has fueled the evolution of popular static binary code analysis tools. In identifying potential coding flaws in binaries, tools such as IDA Pro are used to disassemble the binaries into an opcode/ assembly language format in support of manual static code analysis. Because of the highly manual and resource-intensive nature involved with analyzing large binaries, the probability of overlooking potential coding irregularities and inefficiencies is quite high. In this paper, a light-weight, unsupervised data flow methodology is described which uses highly correlated data flow graph (CDFGs) to identify coding irregularities such that analysis time and required computing resources are minimized. Such analysis accuracy and efficiency gains are achieved by using a combination of graph analysis and unsupervised machine learning techniques which allows an analyst to focus on the most statistically significant flow patterns while performing binary static code analysis. [ABSTRACT FROM AUTHOR]

Remote sensing (RS) cross-modal text–image retrieval has great application value in many fields such as military and civilian. Existing methods utilize the deep network to project the images and texts into a common space and measure the similarity. However, the majority of those methods only utilize the inter-modality information between different modalities, which ignores the rich semantic information within the specific modality. In addition, due to the complexity of the RS images, there exists a lot of interference relation information within the extracted representation from the original features. In this paper, we propose a jointly guided deep network for fine-grained cross-modal RS text–image retrieval. First, we capture the fine-grained semantic information within the specific modality and then guide the learning of another modality of representation, which can make full use of the intra- and inter-modality information. Second, to filter out the interference information within the representation extracted from the two modalities of data, we propose an interference filtration module based on the gated mechanism. According to our experimental results, significant improvements in terms of retrieval tasks can be achieved compared with state-of-the-art algorithms. The source code is available at https://github.com/CQULab/JGDN. [ABSTRACT FROM AUTHOR]

Let f be a normalized Hecke eigenform of weight k for the full modular group S L 2 (ℤ). In this paper, we obtain the asymptotic of higher moments of general divisor functions associated to the Fourier coefficients of Rankin–Selberg L-functions R (s , f × f) , supported at the integers represented by primitive integral positive-definite binary quadratic forms (reduced forms) of a fixed discriminant D < 0. We improve previous results in the case when the reduced form is given by (x 1 , x 2) = x 1 2 + x 2 2 . [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]

Template security and privacy is of utmost significance while designing a biometric system. Several biometric template protection systems have been presented in the past, but none of them have succeeded in striking a compromise between matching performance and security. This paper proposes a hybrid template protection technique for a multibiometric system based on deep binarization and secure hashing. The technique is employed at different stages of multibiometric fusion. In particular, the proposed technique of multibiometric fusion for template protection is tested using face and electrocardiogram (ECG) biometrics. The pre-trained deep CNN model utilizes transfer learning to analyze both the biometrics and prepare multimodal templates at different stages of biometric fusion e.g. sensors, features, and matchers. The templates obtained from different states of fusion are mapped to their corresponding classes, which are represented as binary codes that are unique and randomly generated. The binary codes are further encrypted for noninvertibility using a cryptographic hash, and thus the information of fused templates is hidden. Finally, hash codes are used to perform matching. The evaluation of the proposed technique using database for face (Multi-PIE) and ECG (PTB) biometrics reports high accuracy satisfying the requirements of unlinkability, cancelability, and irreversibility for template protection. [ABSTRACT FROM AUTHOR]

Let A (n , d) be the size of the maximum binary code of length n and minimum Hamming distance d. A (n , d , w) is defined similarly for binary code with constant weight w. Obviously, finding the value of A (n , d) is equivalent to finding the maximum independent set of the d − 1 th-power of n -dimensional hypercube. Based on this, this paper obtains that A (3 m , 2 m) = 4 , A (m (m + 1) 2 , 2 m − 2 , m) = m + 1 , A (2 m + 1 − 2 , 2 m − 1) = 2 m + 1 , and explores the structure of the maximum code of length 2 m + 2 and minimum Hamming distance 2 m + 1 , where m is an integer. [ABSTRACT FROM AUTHOR]

In this paper, we have proposed the optimized BCD to Excess-3 code converter using reversible logic gate. BCD to Excess-3 code can be generated by adding "0011" to BCD number, but in the proposed work, addition is not required. The proposed reversible circuit can be designed using peres gate, Feynman gate and NOT gate optimized quantum cost, garbage output and constant input. The quantum cost (QC), garbage output and constant input of proposed reversible BCD to Excess-3 code converter are respectively 14, 1 and 1 which is better with respect to previously reported results. The improvement is, respectively 0–65%, 66.66–91.66% and 66.66–87.5%. [ABSTRACT FROM AUTHOR]

In this paper, we construct a discrete nonlocal integrable lattice hierarchy related to a reverse space-time nonlocal nonlinear self-dual network equation which may have the potential applications in designing nonlocal electrical circuits and understanding the propagation of electrical signals. By means of nonlocal version of N -fold Darboux transformation (DT) technique, discrete multi-soliton solutions in determinant form are constructed for the reverse space-time nonlocal nonlinear self-dual network equation. Through the asymptotic and graphic analysis, unstable soliton structures of one-, two- and three-soliton solutions are discussed graphically. We observe that the single components in this nonlocal equation display instability while the combined potential terms with nonlocal P T -symmetry show stable soliton structures. It is shown that these nonlocal solutions are clearly different from those of its corresponding local equation. The results given in this paper may explain the soliton propagation in electrical signals. [ABSTRACT FROM AUTHOR]

In this paper, we introduce all Green's relations on the ternary semihypergroup and study some properties of these equivalence relations in view of those obtained in binary and ternary semigroups. We also define crossed hyperproduct of two hypergroups. [ABSTRACT FROM AUTHOR]

As we know, the nearest neighbor search is a good and effective method for good-sized image search. This paper mainly introduced how to learn an outstanding image feature representation form and a series of compact binary Hash coding functions under deep learning framework. Our concept is that binary codes can be obtained using a hidden layer to present some latent concepts dominating the class labels with usable data labels. Our method is effective in obtaining hash codes and image representations, so it is suitable for good-sized dataset. It is demonstrated in our experiment that the performances of the proposed algorithms were then verified on three different databases, MNIST, CIFAR-10 and Caltech-101. The experimental results reveal that two-proposed image Hash retrieval algorithm based on pixel-level automatic feature learning show higher search accuracy than the other algorithms; moreover, these two algorithms were proved to be more favorable in scalability and generality. [ABSTRACT FROM AUTHOR]

A new feature descriptor called local bit plane-based dissimilarities and adder pattern (LBPDAP) is proposed in this paper for content-based computed tomography (CT) image retrieval. To compute the descriptor, the bit planes of the input image are first extracted. For each pixel of an image, these bit planes are then locally encoded using an adder which combines the center-neighbor dissimilarity information and the neighbor–neighbor mutual dissimilarity information in each bit plane. The encoded bit plane values corresponding to each center pixel are finally compared with the intensity of the center pixel to compute the proposed LBPDAP. In order to limit the feature dimensions, we have considered only four most significant bit planes for LBPDAP computations as the higher bit planes contain more significant visual texture information. The proposed descriptor is low dimensional and experimental results on widely accepted NEMA and TCIA-CT image databases demonstrate better retrieval efficiency of LBPDAP over many recent local pattern-based approaches. [ABSTRACT FROM AUTHOR]

As an interesting and significant research domain, reversible logic is massively utilized in technologies, including optical computing, cryptography, quantum computing, nanotechnology, and so on. The realization of quantum computing is not possible without the implementation of reversible logic, and reversible designs are presented mainly to minimize the thermal loss because of the data input bits lost in the irreversible circuit. Digital converters, as the most important logic circuits, are used to connect computing systems with different binary codes. This paper first proposes a new reversible gate called Reversible Noorallahzadeh − Mosleh Gate (RNMG). Then, using the proposed RNMG gate as well as existing NMG1, NMG6, and PG gates, three different designs of reversible Binary-Coded Decimal (BCD) to EX-3 code converter are proposed. Our results indicate that the proposed BCD to EX-3 code converters are superior to previous designs in terms of quantum cost. Moreover, the proposed converters are comparable or better than previous designs in terms of gate count, constant inputs, and garbage outputs. [ABSTRACT FROM AUTHOR]

Self-dual and maximal self-orthogonal codes over GF (q) , where q is even or q ≡ 1 (mod 4), are extensively studied in this paper. We prove that every maximal self-orthogonal code can be extended to a self-dual code as in the case of binary Golay code. Using these results, we show that a self-dual code can also be constructed by gluing theory even if the sum of the lengths of the gluing components is odd. Furthermore, the (Hamming) weight enumerator W C ¯ (x , y) of a self-dual code C ¯ is given in terms of a maximal self-orthogonal code C , where C ¯ is obtained by the extension of C. [ABSTRACT FROM AUTHOR]

Recently, the study of many kinds of weighted networks has received the attention of researchers in the scientific community. In this paper, first, a class of weighted star-composed networks with a weight factor is introduced. We focus on the network consistency in linear dynamical system for a class of weighted star-composed networks. The network consistency can be characterized as network coherence by using the sum of reciprocals of all nonzero Laplacian eigenvalues, which can be obtained by using the relationship of Laplacian eigenvalues at two successive generations. Remarkably, the Laplacian matrix of the class of weighted star-composed networks can be represented by the Kronecker product, then the properties of the Kronecker product can be used to obtain conveniently the corresponding characteristic roots. In the process of finding the sum of reciprocals of all nonzero Laplacian eigenvalues, the key step is to obtain the relationship of Laplacian eigenvalues at two successive generations. Finally, we obtain the main results of the first- and second-order network coherences. The obtained results show that if the weight factor is 1 then the obtained results in this paper coincide with the previous results on binary networks, otherwise the scalings of the first-order network coherence are related to the node number of attaching copy graph, the weight factor and generation number. Surprisingly, the scalings of the first-order network coherence are independent of the node number of initial graph. Consequently, it will open up new perspectives for future research. [ABSTRACT FROM AUTHOR]

Existing super-resolution methods convert high-resolution images into low-resolution images, and use the synthesized images as input to train the model. However, it is difficult for synthetic low-resolution images to reflect the characteristics of real low-resolution images, resulting in poor model performance in practical applications. To address this problem, we propose a recurrent super-resolution framework, which consists of a degradation model and a reconstruction model. The degradation model degenerates the real high-resolution image into a more real low-resolution image, which is used as the input of the super-resolution reconstruction network, and then uses the reconstruction model to reconstruct the low-resolution image, and calculates the error with the original image. The generated high-resolution image is input into the degradation model again for degradation processing, forming a symmetrical and cyclic network structure, so that the super-resolution model has a better effect when reconstructing the real low-scoring image. In addition, the spatial attention mechanism is introduced into the generator network, which expands the receptive field of the convolution kernel, better extracts long-distance image features and improves the texture details of super-resolution images, which is consistent with the global. [ABSTRACT FROM AUTHOR]

The integrity verification of on-chip flash memory data as code memory is becoming important in microcontroller-based applications such as automotive systems. On-the-fly memory fail-detection requires a fast detection method in the seamless background mode without any interruption of CPU operation and low-power flash access hardware to provide safety-conscious execution of the user-programmed firmware during system operations. In this paper, newly-designed read-path architecture based on the binary inversion techniques is proposed for on-chip flash-embedded microcontrollers. The proposed binary inversion method also enables fail-safe, low-power memory access with zero hardware overhead by embedding the scramble flags on the cyclic redundancy check (CRC) protection code. Time-multiplexed CRC calculation for bit-inversion binary code is automatically executed with the silent background mode during CPU idle time without any CPU wait cost. The implementation result shows that the de-inversion procedure could be achieved with just an additional 1,024 bits CRC data in the case of 64 sectors for 4 KB flash memory by reducing 75% of the area of the previous work. The code memory integrity verification time in the seamless background mode is about 30% of the conventional foreground method. The total average current during the code execution for DhrystoneTM benchmark uses just 15% of the basement. [ABSTRACT FROM AUTHOR]

In this paper we use the Gröbner representation of a binary linear code to give efficient algorithms for computing the whole set of coset leaders, denoted by and the set of leader codewords, denoted by . The first algorithm could be adapted to provide not only the Newton and the covering radius of but also to determine the coset leader weight distribution. Moreover, providing the set of leader codewords we have a test-set for decoding by a gradient-like decoding algorithm. Another contribution of this article is the relation established between zero neighbors and leader codewords. [ABSTRACT FROM AUTHOR]

In this paper, we introduce self-dual cyclic codes over the ring ℤ 2 × (ℤ 2 + u ℤ 2) = ℤ 2 ℤ 2 [ u ]. We determine the conditions for any ℤ 2 ℤ 2 [ u ] -cyclic code to be self-dual, that is, 𝒞 = 𝒞 ⊥ . Since the binary image of a self-orthogonal ℤ 2 ℤ 2 [ u ] -linear code is also a self-orthogonal binary linear code, we introduce quantum codes over ℤ 2 ℤ 2 [ u ]. Finally, we present some examples of self-dual cyclic and quantum codes that have good parameters. [ABSTRACT FROM AUTHOR]

Etzion [T. Etzion, Perfect byte correcting codes, IEEE Trans. Inform. Theory44 (1998) 3140–3146.] has classified byte error correcting binary codes into five different categories with respect to the size of the byte. If a code is partitioned into m equal byte of size say β then n = m β or the size of bytes is n m . Alternatively if bytes are of different size say, β 1 , β 2 , ... , β m then n = ∑ i = 1 m β i . The result was further modified by Tyagi and Sethi [V. Tyagi and A. Sethi, b i -Byte correcting perfect codes, Asian-Eur. J. Math.7(1) (2014) 1–8.] and the classification of bytes was given with respect to size of the byte as well as length of the burst. We call such codes as b i -byte correcting perfect codes. Our aim in this paper is to find the possibilities for the existence of b i -byte correcting non-binary perfect codes. [ABSTRACT FROM AUTHOR]

Let G = (V (G) , E (G)) be a simple graph. A hop dominating set S ⊆ V (G) is called a connected hop dominating set of G if the induced subgraph 〈 S 〉 of S is connected. The smallest cardinality of a connected hop dominating set of G , denoted by γ ch (G) , is called the connected hop domination number of G. In this paper, we characterize the connected hop dominating sets in the join, corona and lexicographic product of graphs and determine the corresponding connected hop domination number of these graphs. The study of these concepts is motivated with a social network application. [ABSTRACT FROM AUTHOR]

Due to increasing use of third-party libraries because of the increasing complexity of software development, the lack of management of legacy code and the nature of embedded software, the use of third-party libraries which have no source code is increasing. Without the source code, it is difficult to analyze these libraries for vulnerabilities. Therefore, to analyze weaknesses inherent in binary code, various studies have been conducted to perform static analysis using intermediate code. The conversion from binary code to intermediate language differs depending on the execution environment. In this paper, we propose a deep learning-based analysis method to reconstruct missing data types during the compilation process from binary code to intermediate language, and propose a method to generate supervised learning data for deep learning. [ABSTRACT FROM AUTHOR]

ℤ 2 ℤ 2 s -additive codes for any integer s > 1 are considered as codes over mixed alphabets. They are a generalization of binary linear codes and linear codes over ℤ 2 s . In this paper, we are interested in studying ℤ 2 ℤ 2 s -additive cyclic codes. We will give the generator polynomials of these codes. We will also give the minimal spanning sets for these codes. We will define separable ℤ 2 ℤ 2 s -additive codes and provide conditions on the generator polynomials for a ℤ 2 ℤ 2 s -additive cyclic code to be separable. Finally, we present some examples of optimal parameter binary codes obtained as images of ℤ 2 ℤ 8 -additive cyclic codes. [ABSTRACT FROM AUTHOR]

Let , where , , is a prime and is a positive integer. We define a gray map from a linear code of length over the ring to a linear code of length over the field . In this paper, we characterize the gray images of -constacyclic codes of an arbitrary length over the ring in terms of quasicyclic codes over . We obtain some optimal linear codes over as gray images. [ABSTRACT FROM AUTHOR]

Image retrieval is a significant and hot research topic among researchers that drives the focus of researchers from keyword toward semantic-based image reconstruction. Nevertheless, existing image retrieval investigations still have a shortage of significant semantic image definition and user behavior consideration. Hence, there is a necessity to offer a high level of assistance towards regulating the semantic gap between low-level visual patterns and high-level ideas for a better understanding between humans and machines. Hence, this research devises an effective medical image retrieval strategy using convoluted neighborhood-based Ordered-dither block truncation coding (ODBTC). The developed approach is devised by modifying the ODBTC concept using a convoluted neighborhood mechanism. Here, the convoluted neighborhood-based color co-occurrence feature (CCF) and convoluted neighborhood-based bit pattern feature (BBF) are extracted. Finally, cross-indexing is performed to convert the feature points into binary codes for effective image retrieval. Meanwhile, the proposed convoluted neighborhood-based ODBTC has achieved maximum precision, recall, and f-measure with values of 0.740, 0.680, and 0.709. [ABSTRACT FROM AUTHOR]

The purpose of this paper is to propose a simple method of constructing a parity-check matrix for any binary linear code capable of correcting a new kind of burst error called 'm-repeated burst error of length b or less' recently introduced by the authors. Some binary codes based on the proposed technique have been illustrated. This technique for m = 1 helps in resolving a long standing problem of devising a systematic algorithm for the construction of a burst error correcting code. [ABSTRACT FROM AUTHOR]

Boosting, one of the best off-the-shelf classification methods, has evoked widespread interest in machine learning and statistics. However, the original algorithm was developed for binary classification problems. In this paper, we study multi-class boosting algorithms under the -loss framework, and devise two multi-class -Boost algorithms. These are based on coordinate descent and gradient descent to minimize the multi-class -loss function. We derive a scoring coding scheme using optimal scoring constraints to encode class labels and a simple decoder to recover the true class labels. Our boosting algorithms are easily implemented and their results converge to the global optimum. Experiments with synthetic and real-world datasets show that, compared with several state-of-art methods, our algorithms provide more accurate results. [ABSTRACT FROM AUTHOR]

Permutation decoding method developed by MacWilliams and described in [Permutation decoding of systematic codes, Bell Syst. Tech. J. 43 (1964) 485-505] is a decoding technique that uses a subset of the automorphism group of the code called a PD-set. The complexity of the permutation decoding algorithm depends on the size of the PD-set and finding a minimal PD-set for an error correcting code is a hard problem. In this paper we examine binary codes from the complete-multipartite graph and find PD-sets for all values of and . Further we show that these PD-sets are minimal when is odd and . [ABSTRACT FROM AUTHOR]

This paper proposes two high performance binary-to-binary coded decimal (BCD) conversion algorithms for use in BCD multiplication. These algorithms are based on splitting the 7-bit binary partial product of two BCD digits into two groups, computing the contribution of each group to the equivalent BCD partial product, and adding these contributions to compute the final BCD partial product. Designs for the proposed architectures and their implementations targeting both ASIC and FPGA are compared with others. Implementations of BCD array multipliers using both our conversion circuits and existing conversion circuits have been performed. The synthesis results for both ASIC and FPGA show that the proposed designs are faster and occupying less area than the state-of-the-art conversion circuits. Furthermore, the results obtained from comparing BCD multipliers of various sizes show that the enhancement in the area of the conversion circuit grows into a sizable area improvement in the multiplier circuit. [ABSTRACT FROM AUTHOR]

A q -ary linear code 𝒞 is called a linear complementary dual (LCD) code if it meets its dual trivially. Binary LCD codes play a significant role for their advantage of low complexity for implementations against side-channel attacks and fault injection attacks. In this paper, the problem of finding LCD codes over the binary field is discussed. Many new codes and new bounds are presented, as well as a table of optimal LCD codes (or upper and lower bounds on such codes) of length up to 30 bits. [ABSTRACT FROM AUTHOR]

In this paper, we discuss two problems on asymmetric quantum error-correcting codes (AQECCs). The first one is on the construction of a [[12, 1, 5/3]]2 asymmetric quantum code, we show an impure [[12, 1, 5/3 ]]2 exists. The second one is on the construction of AQECCs from binary cyclic codes, we construct many families of new asymmetric quantum codes with dz> δmax+1 from binary primitive cyclic codes of length n = 2m-1, where δmax = 2⌈m/2⌉-1 is the maximal designed distance of dual containing narrow sense BCH code of length n = 2m-1. A number of known codes are special cases of the codes given here. Some of these AQECCs have parameters better than the ones available in the literature. [ABSTRACT FROM AUTHOR]

In this paper, gray ROM-based encoder is proposed for the implementation of flash ADCs encoder block based on converting the conventional 1-of- N thermometer codes to 2-of- M codes (M = 3 4 N). The proposed gray ROM-based encoder is composed of three stages. In the first stage, the thermometer codes are converted to 2-of- M codes by the use of two-input AND and four-input merged AND–OR gates. In the second stage, 2-of- M codes are turned to n − 1 gray codes and a binary code by a quasi-gray ROM encoder and a binary ROM encoder, respectively. Finally, in the third stage, n − 1 MSB bits and LSB bit are determined by a quasi-gray-to-binary converter and a CMOS inverter, respectively. The advantages of the proposed encoder over the conventional encoder are higher speed of second stage, low power, low area and low latency with the same bubble and meta-stability errors removing capability. To demonstrate the mentioned specifications, two 5-bit flash ADCs with the conventional and proposed encoders in their encoder blocks are analyzed and simulated at 2-GS/s and 3.2-GS/s sampling rates in 0.18- μ m CMOS process. Simulation results show that the ENOBs of flash ADCs with the conventional and proposed encoders are equal. In this case, the proposed encoder outputs are determined to be approximately 30 ps faster than the conventional encoder at 2 GS/s. The power dissipations of the conventional and proposed encoders were 19.50 mW and 13.90 mW at 3.2-GS/s sampling rate from a 1.8-V supply and also the latencies of the encoders were 4 ADC clocks and 3 ADC clocks, respectively. In this case, the number of D-FFs and logic gates of the proposed encoder is decreased approximately by 37% when compared to the conventional encoder. [ABSTRACT FROM AUTHOR]

Binary code analysis is vital in source code unavailable cases, such as malware analysis and software vulnerability mining. Its first step could be function identification. Most function identification methods are based on function prologs/epilogs. However, functions may not have standard prologs/epilogs. To identify these functions, we need to use other methods. One approach is to identify return instructions first and then identify the start of a function. Currently, the multi-layer perceptron model is exploited to identify and validate a return instruction at a specific location. On this basis, a new approach is proposed to improve accuracy and provide more details. Specifically, a return instruction is classified into three classes: (1) false return instruction, (2) true return instruction inner a function but not the last instruction, and (3) true return instruction at the end of a function. The evaluation is performed on 5782 real-world binaries. Meanwhile, common classifiers including fully connected neural network, Two-layer Bidirectional Recurrent Neural Network (TBRNN), Two-layer Bidirectional Gate Recurrent Unit (TBGRU), Two-layer Bidirectional Long Short-term Memory Network (TBLSTM), Decision Tree, Random Forest, XGBoost, and Support Vector Machine (SVM) are evaluated on the same data set. The result shows that TBLSTM achieves an accuracy of 99.78%, which is higher than that of other classifiers in the evaluation, including the state-of-the-art tool IDA Pro 7.7. [ABSTRACT FROM AUTHOR]

In this work, several new aspects of the dynamics of the well-known TNC hyperchaotic oscillator are investigated. Numerous novelties appear in this work, namely particular structures of space magnetization, the coexistence of bursting patterns, the coexistence of up to four asymmetric different attractors, offset-boosting, and antimonotonicity. In addition to this interesting and particular combination of features in the TNC oscillator, the control of multistability phenomenon is carried out using linear augmentation control scheme. Finally, knowing that the protection of digital images is of particularly great interest, the complexity of pseudo-random hyperchaotic sequences of the TNC oscillator is combined with the similarity that the DNA coding shares with the binary code to build a new image encryption algorithm with strong robustness and high speed. This algorithm is successfully evaluated using cropping attack, noise attack and differential attack. The results obtained demonstrate that the proposed algorithm is efficient and of good quality. [ABSTRACT FROM AUTHOR]

The demand for visual quality has been advanced by high display resolutions and frame rates. Nevertheless, these two issues have caused tremendous memory bandwidth in a video coding system. In this study, an efficient lossless embedded compression (EC) algorithm is proposed to save memory bandwidth, while keeping visual quality. The proposed lossless EC algorithm incorporates three core techniques: tree partition, half-pixel prediction and group-based binary coding. Tree partition classifies a 1 6 × 8 block into Trunk, Branch and Leaf. With tree partition, half-pixel prediction produces individual residues for Trunk, Branch and Leaf. Group-based binary coding converts theses residues to efficient codewords. The lossless compression ratio (CR) of the proposed EC is as high as 2.24 on average, saving memory bandwidth by 55.4%. This EC algorithm is implemented using CMOS 0.18 μ m technology. The maximum throughput can reach 6.4 Gpixels/s, which can accommodate 3840 × 2160@60fps. The experiment results demonstrate that this study presents better hardware efficiency of 337 Gpixels/J and 83.5 Kpixels/s/gate. [ABSTRACT FROM AUTHOR]

Let p be an odd prime, and k be an integer such that gcd (k , p) = 1. Using pairwise orthogonal idempotents γ 1 , γ 2 , γ 3 of the ring ℛ = 𝔽 p [ u ] / 〈 u k + 1 − u 〉 , with γ 1 + γ 2 + γ 3 = 1 , ℛ is decomposed as ℛ = γ 1 ℛ ⊕ γ 2 ℛ ⊕ γ 3 ℛ , which contains the ring R = γ 1 𝔽 p ⊕ γ 2 𝔽 p ⊕ γ 3 𝔽 p as a subring. It is shown that, for λ 0 , λ k ∈ 𝔽 p , λ 0 + u k λ k ∈ R , and it is invertible if and only if λ 0 and λ 0 + λ k are units of 𝔽 p . In such cases, we study (λ 0 + u k λ k) -constacyclic codes over R. We present a direct sum decomposition of (λ 0 + u k λ k) -constacyclic codes and their duals, which provides their corresponding generators. Necessary and sufficient conditions for a (λ 0 + u k λ k) -constacyclic code to contain its dual are obtained. As an application, many new quantum codes over 𝔽 p , with better parameters than existing ones, are constructed from cyclic and negacyclic codes over R. [ABSTRACT FROM AUTHOR]

For every Hadamard design with parameters 2 - (n − 1 , n 2 − 1 , n 4 − 1) having a skew-symmetric incidence matrix we give a construction of 54 Hadamard designs with parameters 2 - (4 n − 1 , 2 n − 1 , n − 1). Moreover, for the case n = 8 we construct doubly-even self-orthogonal binary linear codes from the corresponding Hadamard matrices of order 32. From these binary codes we construct five new extremal Type II ℤ 4 -codes of length 32. The constructed codes are the first examples of extremal Type II ℤ 4 -codes of length 32 and type 4 k 1 2 k 2 , k 1 ∈ { 7 , 8 , 9 , 1 0 } , whose residue codes have minimum weight 8. Further, correcting the results from the literature we construct 5147 extremal Type II ℤ 4 -codes of length 32 and type 4 1 4 2 4 . [ABSTRACT FROM AUTHOR]

Magnetorheological elastomer (MRE) isolator has been proved as a promising semi-active control device for structural vibration control. For its engineering application, developing an accurate and robust model is definitely necessary and also a challenging task. Most of the present models, belonging to parametric models, need to identify various model parameters and sometimes are not capable of perfectly capturing the unique characteristics of the device. In this work, a novel nonparametric model is proposed to characterize the inherent dynamics of the MRE isolator with the features of hysteresis and nonlinearity. Initially, dynamic tests are conducted to evaluate the performance of the isolator under various loading conditions, including harmonic, random, and seismic excitations. Then, on the basis of the captured experimental results, a hybrid learning method is designed to forecast the nonlinear responses of the device with known external inputs. In this method, a type of single hidden layer feed-forward network, called extreme learning machine (ELM), is developed to forecast the nonlinear responses (shear force) of the device with captured velocity, displacement, and current level. To obtain optimal performance of the developed model, an improved binary-coded discrete cat swarm optimization (BCDCSO) method is adopted to select optimal inputs and neuron number in the hidden layer for the network development. The performance of the proposed method is verified through the comparison between experimental results and model predictions. Due to the noise influence in the practical condition, the robustness of the proposed method is also validated via adding noise disturbance into the supplying currents. The results show that the proposed method outperforms the standard ELM in terms of characterization of the MRE isolator, even though the captured responses are polluted with external measurement noises. [ABSTRACT FROM AUTHOR]

Parallel prefix addition offers a highly efficient solution to most of the applications which requires fast addition of two binary numbers. An efficient adder design demands proper selection of recurrence equations and its realization. There are different recursion equations like Weinberger recursion, Ling recursion, Jackson recursion, to name a few, available to suit a variety of design requirements. In this work, we have proposed adders based on Jackson recursion. In these adders, the complexity found in generate term is reduced at all the levels of the carry graph to optimize the adder performance parameters. The proposed adder structures are implemented for a word size of 32-bit based on the Jackson recursion equations for valency-4 and valency-5. The synthesis results reveal that the high-valency Jackson adder structures are superior in terms of power and area over the Ling adders for comparable delay values. Experimental results obtained reveals that an average of and savings in area and power, respectively, are achieved by the proposed adders, as compared to Ling adders for the same word size. Furthermore, the proposed adders demonstrate enhanced area-delay and the power-delay values compared to the adders based on the Weinberger's recursion. [ABSTRACT FROM AUTHOR]

In the present era, reversible logic designs play a very critical role in nanotechnology, low power complementary metal-oxide semiconductor (CMOS) designs, optical computing and, especially, in quantum computing. High power dissipation and leakage current in deep submicron technologies is a severe threat in applications created today. As a consequence, design of datapath elements in reversible logic has gained much importance. In this study, a novel design of binary coded decimal (BCD) adder/subtractor in reversible logic has been proposed. As a further optimization of the proposed reversible decimal design, carry skip (CSK) logic is used for reversible ripple carry adder stages. This reduces delay but at the expense of little hardware. The proposed BCD adder/subtractor and its optimized version are designed using structural VHDL and simulated using ModelSim 6.3f. Performance analysis reveals that the proposed BCD design demonstrates reductions in gate count, garbage outputs and constant inputs of 30.5%, 46% and 28%, respectively, and its optimized version exhibits 19.4%, 32.4% and 16% reductions in gate count, garbage outputs and constant inputs compared to the design in Ref. 14 [V. Rajmohan, V. Renganathan and M. Rajmohan, A novel reversible design of unified single digit BCD adder-subtractor, Int. J. Comput. Theor. Eng. 3 (2011) 697-700]. [ABSTRACT FROM AUTHOR]

We investigate the relationship between the numbers of representations of certain integers by a primitive integral binary quadratic form of discriminant and the order of the class of in the form class group of discriminant , in the case when this order is even. The explicit form of the solutions obtained is used to give a partial answer to a question regarding which multiples of can be parameterized in a particular way. [ABSTRACT FROM AUTHOR]

Rather than tiling the black hole horizon by Planck area patches, we suggest that bits of information inhabit, universally and holographically, the entire black core interior, a bit per a light sheet unit interval of order Planck area difference. The number of distinguishable (tagged by a binary code) configurations, counted within the context of a discrete holographic shell model, is given by the Catalan series. The area entropy formula is recovered, including Cardy's universal logarithmic correction, and the equipartition of mass per degree of freedom is proven. The black hole information storage resembles, in the count procedure, the so-called stack data structure. [ABSTRACT FROM AUTHOR]