Search

This paper proposes a phase unwrapping method based on ternary Gray code in fringe projection profilometry. This method does not require additional projection images or any prior knowledge. It accurately determines the segmentation thresholds of the ternary Gray code using only the average intensity and intensity modulation calculated from phase-shifting fringes, effectively reducing projection costs and achieving lower codeword errors. Additionally, a segment selection strategy suitable for the ternary Gray code is proposed. By employing the complementary method, three sets of candidate orders with certain codeword shifts can be generated. The wrapped phase is then divided into three segments: upper, middle, and lower segments, and correspondingly matched with the central regions of the three sets of candidate orders, thus enabling the solution of the absolute phase. Through the segment selection strategy, error-prone areas at the edges of orders are effectively avoided, further enhancing the accuracy of measurement results. Compared to the binary Gray code, the ternary complementary Gray code can encode up to 3 m − 1 orders when the number of Gray code patterns is m; when the required number of encoding orders is K, only ⌈ log 3 K ⌉ + 1 Gray code patterns are needed. Its additional value capacity precisely enables it to encode more orders, thereby increasing the frequency of phase-shifting fringes and further enhancing measurement efficiency. A series of experiments validates the feasibility, robustness, and superiority of this method. [ABSTRACT FROM AUTHOR]

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]

Our goal of this paper is to find a construction of all ℓ-quasi-cyclic self-dual codes over a finite field $ {\mathbb F}_q $ F q of length $ m\ell $ mℓ for every positive even integer ℓ. In this paper, we study the case where $ x^m-1 $ x m − 1 has an arbitrary number of irreducible factors in $ {\mathbb F}_q [x] $ F q [ x ] ; in the previous studies, only some special cases where $ x^m-1 $ x m − 1 has exactly two or three irreducible factors in $ {\mathbb F}_q [x] $ F q [ x ] , were studied. Firstly, the binary code case is completed: for any even positive integer ℓ, every binary ℓ-quasi-cyclic self-dual code can be obtained by our construction. Secondly, we work on the q-ary code cases for an odd prime power q. We find an explicit method for construction of all ℓ-quasi-cyclic self-dual codes over $ {\mathbb F}_q $ F q of length $ m\ell $ mℓ for any even positive integer ℓ, where we require that $ q \equiv 1 \pmod {4} $ q ≡ 1 (mod 4) if the index $ \ell \ge 6 $ ℓ ≥ 6. By implementation of our method, we obtain a new optimal binary self-dual code $ [172, 86, 24] $ [ 172 , 86 , 24 ] , which is also a quasi-cyclic code of index 4. [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]

With the rapid development of multimedia technology, considerable achievement has been achieved in image retrieval technology. On the one hand, users' demand for cross-modal retrieval is increasing rapidly. On the other hand, deep hashing algorithms as one of the most prominent high-dimensional reduction methods have received extensive attention. Under such background, the cross-modal retrieval method based on deep hashing came into being. Although the cross-modal hashing learning method has moved a long way in recent years, it still has space of promotion. First, existing cross-modal based hashing algorithms can only map the feature vectors into binary codes with a fixed length. The length of hash codes cannot be modified according to the practical situation. Second, the saturation level of the probability function used in existing methods is too high to concentrate relevant samples very well, which results in low retrieval efficiency. To solve the above problem, a novel variable-length hash code based on adaptive weight was proposed in this paper. The length of hash codes could be adjusted according to the importance of each bit. And a novel probability function based on Cauchy distribution was proposed to generate compact binary codes and make hashing retrieval more efficient. The experiment shows that the proposed cross-modal image retrieval algorithm based on deep hashing outperforms existing related algorithms on the accuracy of retrieval. [ABSTRACT FROM AUTHOR]

Binary code similarity detection plays a crucial role in various applications within binary security, including vulnerability detection, malicious software analysis, etc. However, existing methods suffer from limited differentiation in binary embedding representations across different compilation environments, lacking dynamic high-level semantics. Moreover, current approaches often neglect multi-level semantic feature extraction, thereby failing to acquire precise semantic information about the binary code. To address these limitations, this paper introduces a novel detection solution called BinBcla. This method employs an enhanced pre-training model to generate instruction embeddings with dynamic semantics for binary functions. Subsequently, multi-feature fusion technique is utilized to extract local semantic information and long-distance global features from the code, respectively, employing self-attention to comprehend the structure information of the code. Finally, an improved cosine similarity method is employed to learn relationships among all elements of the distance vectors, thereby enhancing the model's robustness to new sample functions. Experiments are conducted across different architectures, compilers, and optimization levels. The results indicate that BinBcla achieves higher accuracy, precision and F1 score compared to existing methods. [ABSTRACT FROM AUTHOR]

CSS-T codes were recently introduced as quantum error-correcting codes that respect a transversal gate. A CSS-T code depends on a CSS-T pair, which is a pair of binary codes (C 1 , C 2) such that C 1 contains C 2 , C 2 is even, and the shortening of the dual of C 1 with respect to the support of each codeword of C 2 is self-dual. In this paper, we give new conditions to guarantee that a pair of binary codes (C 1 , C 2) is a CSS-T pair. We define the poset of CSS-T pairs and determine the minimal and maximal elements of the poset. We provide a propagation rule for nondegenerate CSS-T codes. We apply some main results to Reed–Muller, cyclic and extended cyclic codes. We characterize CSS-T pairs of cyclic codes in terms of the defining cyclotomic cosets. We find cyclic and extended cyclic codes to obtain quantum codes with better parameters than those in the literature. [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]

Pulse compression techniques enable the radar designers to transmit long duration pulse to cater the need of high power at the transmitter and achieve the range resolution of short duration pulse at the radar receiver simultaneously. Due to easy generation and processing, binary codes are widely used as pulse compression codes in radars, sonars and spread-spectrum communication systems. But binary codes have high unwanted pulse compression sidelobes at the output of pulse compression receivers. In this paper, optimum binary codes reported in the literatures are overlaid on Discrete frequency sequences to reduce unwanted peaks sidelobes of optimum binary codes. The proposed approach not only reduced peak sidelobes of optimum binary codes but also increased the pulse compression ratio. In this paper, optimum discrete frequency sequences for overlaying with binary codes are optimized using the Modified Simulated Annealing Algorithm (MSAA). A Discrete Frequency Coded binary signal has a complex signal structure which will be difficult to detect and analyze by enemy Electronics Support Measures (ESM). In this paper, a unified adaptive radar model is also proposed to cater the needs of today's radar signal design requirements. The proposed model will help to improve range resolution, the detection capability of radar, reduce the peak sidelobes significantly, and also improve the ESM capability of radar systems. [ABSTRACT FROM AUTHOR]

In this paper, δ -dual codes over finite commutative semi-simple rings are defined as a generalization of dual codes over finite commutative semi-simple rings. Some properties of δ -dual codes are given. We present necessary and sufficient conditions for a λ -constacyclic code of length n to be δ -self-dual, δ -self-orthogonal, δ -dual-containing, δ -LCD over finite commutative semi-simple rings. We also study the δ -dual of skew Θ - λ -constacyclic codes over finite commutative semi-simple rings. Among others, we also give necessary and sufficient conditions for a skew Θ - λ -constacyclic code of any length n to be δ -self-dual, δ -self-orthogonal, δ -dual-containing, δ -LCD over finite commutative semi-simple rings. [ABSTRACT FROM AUTHOR]

In quantum key distribution (QKD), two users extract a shared secret key using a quantum communication channel in the presence of an eavesdropper. Among QKD protocols, the ones based on energy-time (ET) entanglement of photons have been studied extensively due to their ability to generate high key rates from the arrival times of entangled photons. For the information reconciliation (IR) stage of ET-QKD protocols (where the users communicate using a classical channel in order to reconcile differences in their data), a scheme called multi-level coding (MLC) was proposed by Zhou et al. in prior work. The MLC scheme splits the raw key symbols into bit layers and utilizes binary low-density parity check (LDPC) codes to encode each layer. Although binary LDPC codes are able to offer low complexity decoding for IR, they have poor error-correcting performance compared to their non-binary counterparts, thus leading to low key rates. Additionally, existing LDPC codes do not fully utilize the properties of the QKD channel to optimize the key rates. In this paper, we mitigate the above issues by proposing a flexible protocol for IR in ET-QKD systems called non-binary multi-level coding NB-MLC(a) which is parameterized by a positive integer a. The NB-MLC(a) protocol is a generalization of the MLC scheme and utilizes NB-LDPC codes from a Galois field of size 2 a . We show that by using a small value of a, the NB-MLC(a) protocol significantly improves the key rate without much increase in complexity. To further improve the key rates of the NB-MLC(a) protocol, we propose (i) a joint rate and degree distribution optimization (JRDO) algorithm to design the NB-LDPC codes for the protocol and (ii) an interleaved decoding and communication (IDC) scheme to decode the different layers of the NB-MLC(a) protocol. The JRDO algorithm is designed to use the QKD channel information, and we show that it results in a higher key rate than codes used in prior work. Additionally, the IDC scheme improves the key rate compared to the decoding and communication methods utilized previously in literature. Overall, the NB-MLC(a) protocol that uses JRDO-LDPC codes and the IDC scheme results in a significant 40–60 % improvement in key rates compared to prior work for ET-QKD systems. [ABSTRACT FROM AUTHOR]

The study of linear codes over local rings, particularly non-chain rings, imposes difficulties that differ from those encountered in codes over chain rings, and this stems from the fact that local non-chain rings are not principal ideal rings. In this paper, we present and successfully establish a new approach for linear codes of any finite length over local rings that are not necessarily chains. The main focus of this study is to produce generating characters, MacWilliams identities and generator matrices for codes over singleton local Frobenius rings of order 32. To do so, we first start by characterizing all singleton local rings of order 32 up to isomorphism. These rings happen to have strong connections to linear binary codes and Z 4 codes, which play a significant role in coding theory. [ABSTRACT FROM AUTHOR]

Global contexts are critical to locating salient objects for salient object detection (SOD). However, the convolution operation in CNNs has a local receptive field, which cannot capture long-distance global information. Recent studies have shown that modernized CNN models with large kernel convolution, such as ConvNeXt, can effectively extend the receptive fields. Based on it, this paper explores the potential of large kernel CNN for SOD task. Inspired by the common information between RGB and depth images in salient objects, we propose a ConvNeXt-based Siamese network with shared weight parameters. This structural design can effectively reduce the number of parameters without sacrificing performance. Furthermore, a depth information preprocessing module is proposed to minimize the impact of low-quality depth images on predicted saliency maps. For cross-modal feature interaction, a dynamic fusion module is designed to enhance cross-modal complementarity dynamically. Extensive experiments and evaluation results on six benchmark datasets demonstrate the outstanding performance of the proposed method against 14 state-of-the-art RGB-D methods. Our code will be released at https://github.com/zyh5119232/CSNet. [ABSTRACT FROM AUTHOR]

Many different aspects of software system development and verification rely on precise function identification in binary code. Recognition of the source Assembly functions in embedded systems is one of the fundamental challenges in binary program analysis. While numerous approaches assume that the functions are given a priori, correct identification of the functions in binaries remains a great issue. This contribution addresses the problem of uncertainty in binary code in identification of functions, which were optimized during compilation. This paper investigates the difference between debug and optimized functions via modeling of these functions. To do so, we introduce an extensible model-centred hands-on approach for examining similarities between binary functions. The main idea is to model each function using a set of predetermined, experimentally discovered features, and then find a suitable weight vector that could give impact factor to each such a feature. After finding the weight vector, the introduced models of such desired functions can be identified in binary software packages. It means that we reduce the similarity identification problem of the models to a classical version of optimization problems with one optimization criterion. Using our implementation, we found that the proposed approach works smoothly for functions, which contain at least ten Assembly instructions. Our tool guarantees success at a very high level. [ABSTRACT FROM AUTHOR]

In this paper we construct distance-regular graphs admitting a vertex transitive action of the five sporadic simple groups discovered by E. Mathieu, the Mathieu groups M 11 , M 12 , M 22 , M 23 and M 24 . From the binary code spanned by an adjacency matrix of the strongly regular graph with parameters (176,70,18,34) we obtain block designs having the full automorphism groups isomorphic to the Higman-Sims finite simple group. Moreover, from that code we obtain eight 2-designs having the full automorphism group isomorphic to M 22 , whose existence cannot be explained neither by the Assmus-Mattson theorem nor by a transitivity argument. Further, we discuss a possibility of permutation decoding of the codes spanned by adjacency matrices of the graphs constructed and find small PD-sets for some of the codes. [ABSTRACT FROM AUTHOR]

...-ispotty-byte error correcting codes over Zq [7] are non-binary codes generalizing the binary irregular-spotty-byte codes [3] suitable for semiconductor memories in which a word is divided into irregular bytes not necessarily of the same length. The distance between distinct words is measured in terms of newly defined ... - metric function [7]. In this paper, we present the code construction methods of ...-ispotty-byte error correcting codes in terms of their parity check matrix. [ABSTRACT FROM AUTHOR]

This paper proposes a blind color image watermarking method based on Hadamard transform to deal with the infringement of color images in the complex network environment. First of all, the color watermark image is channeled and each pixel in the channel image is converted into an 8-bit binary code. And then, the color host image is also channeled and expanded into 4 × 4 non-overlapping pixel blocks based on the selected embedding position. Finally, Hadamard transform is put on the pixel block, and 1-bit watermark information is embedded by the coefficient pair of the first line of Hadamard coefficient matrix. When extracting watermark, the watermark can be extracted only by comparing the size relationship of the coefficient pairs without the help of the original image. In this paper, a voting system of the minority obeying the majority is designed and implemented, which actually enhances the robustness of the method. In addition, a high security encryption system is designed by combining symmetric key and public key, and the correlation between RGB color channels is considered. Simulation results show that the proposed method has better robustness, real-time performance and security compared with similar methods, and meets certain requirements in terms of invisibility and capacity. [ABSTRACT FROM AUTHOR]

This paper proposes a novel automotive radar waveform involving the theory behind M-ary frequency shift key (MFSK) radar systems. Along with the MFSK theory, coding schemes are studied to provide a solution to mutual interference. The proposed MFSK waveform consists of frequency increments throughout the range of 76 GHz to 81 GHz with a step value of 1 GHz. Instead of stepping with a fixed frequency, a triangular chirp sequence allows for static and moving objects to be detected. Therefore, automotive radars will improve Doppler estimation and simultaneous range of various targets. In this paper, a binary coding scheme and a combined transform coding scheme used for radar waveform correlation are evaluated in order to provide unique signals. AVs have to perform in an environment with a high number of signals being sent through the automotive radar frequency band. Efficient coding methods are required to increase the number of signals that are generated. An evaluation method and experimental data of modulated frequencies as well as a comparison with other frequency method systems are presented. [ABSTRACT FROM AUTHOR]

The all-optical switching phenomena in the non-linear directional coupler using cross-phase modulation (XPM) effect have been proposed. It is designed to generate an all-optical XOR functionality, considering the XOR logic gates as a basic module the design and analysis of an efficient all-optical 4-bit binary to gray code converter and 4-bit even parity checker circuit is proposed. The design methodology includes the switching of a weak continuous-wave (CW) signal, which is controlled by the combination of two controlled pump signals. In this paper, mathematical analysis of the coupled mode theory associated with optical directional couplers has been discussed. The switching characteristics of XPM effect based All-optical directional couplers have been examined for appropriate values of the controlled pump signals. Appropriate values of extinction ratio and corresponding controlled pump signal levels are investigated for an efficient generation of XOR logic gates. Further, the detailed analysis of layout generation and design aspects of All-optical 4-bit binary to gray code converter and 4-bit even parity checker circuits have been carried out. The proposed methodology is verified by the appropriate simulation results, which include the transmittivity, extinction ratio (Xratio) curve variation and dynamic time domain plot associated with proposed units. [ABSTRACT FROM AUTHOR]

Many families of binary nonlinear codes (e.g., Kerdock, Goethals, Delsarte–Goethals, Preparata) can be very simply constructed from linear codes over the Z 4 ring (ring of integers modulo 4), by applying the Gray map to the quaternary symbols. Generalized Kerdock codes represent an extension of classical Kerdock codes to the Z 2 S ring. In this paper, we develop two novel soft-input decoders, designed to exploit the unique structure of these codes. We introduce a novel soft-input ML decoding algorithm and a soft-input soft-output MAP decoding algorithm of generalized Kerdock codes, with a complexity of O (N S log 2 N) , where N is the length of the Z 2 S code, that is, the number of Z 2 S symbols in a codeword. Simulations show that our novel decoders outperform the classical lifting decoder in terms of error rate by some 5 dB. [ABSTRACT FROM AUTHOR]

How to model the effect of reflection is crucial for single image reflection removal (SIRR) task. Modern SIRR methods usually simplify the reflection formulation with the assumption of linear combination of a transmission layer and a reflection layer. However, the large variations in image content and the real-world picture-taking conditions often result in far more complex reflection. In this paper, we introduce a new screen-blur combination based on two important factors, namely the intensity and the blurriness of reflection, to better characterize the reflection formulation in SIRR. Specifically, we present Screen-blur Reflection Networks (SRNet), which executes the screen-blur formulation in its network design and adapts to the complex reflection on real scenes. Technically, SRNet consists of three components: a blended image generator, a reflection estimator and a reflection removal module. The image generator exploits the screen-blur combination to synthesize the training blended images. The reflection estimator learns the reflection layer and a blur degree that measures the level of blurriness for reflection. The reflection removal module further uses the blended image, blur degree and reflection layer to filter out the transmission layer in a cascaded manner. Superior results on three different SIRR methods are reported when generating the training data on the principle of the screen-blur combination. Moreover, extensive experiments on six datasets quantitatively and qualitatively demonstrate the efficacy of SRNet over the state-of-the-art methods. [ABSTRACT FROM AUTHOR]

Binary codes have a special place in coding theory since they are one of the most commonly used in practice. There are classes of codes specific only to the binary case. One such class is self-complementary codes. Self-complementary linear codes are binary codes that, together with any vector, contain its complement as well. This paper is about binary linear self-complementary codes. A natural goal in coding theory is to find a linear code with a given length n and dimension k such that the minimum distance d is maximal. Codes with these properties are called optimal. Another important issue is classifying the optimal codes, i.e., finding exactly one representative of each equivalence class. In some sense, the classification problem is more general than the minimum distance bounds problem. In this work, we summarize the classification results for self-complementary codes with the maximum possible minimum distance and a length of up to 20. For the classification, we developed a new algorithm that is much more efficient compared to existing ones in some cases. [ABSTRACT FROM AUTHOR]

Cross-modal hashing which embeds data to binary codes is an efficient tool for retrieving heterogeneous but correlated multimedia data. In real applications, the sizes of queries are much larger than that of the training set and the queries may be dissimilar to training data, which lays bare the shortage of generalization of deterministic models, such as cross-encoder and autoencoder. In this paper, we design a variational cross-encoder (VCE), a generative model, to tackle this problem. At the bottleneck layer, the VCE outputs distributions parameterized by means and variances. As VCE can generate diversified data using noises, the proposed model can perform better in testing data. Ideally, each distribution is expected to describe a category of data and samples of this distribution are expected to generate data in the same category. Under this expectation, the means and variances can be used as real codes for input data. However, the generated data generally are not belonging to the same category as the input data. Hence, we add a penalty term on variance output of VCE and use means as real codes for further generating hashing codes. Experiments on three widely used datasets validate the effectiveness of our method. [ABSTRACT FROM AUTHOR]

In visual indoor positioning systems, the method of constructing a visual map by point-by-point sampling is widely used due to its characteristics of clear static images and simple coordinate calculation. However, too small a sampling interval will cause image redundancy, while too large a sampling interval will lead to the absence of any scene images, which will result in worse positioning efficiency and inferior positioning accuracy. As a result, this paper proposed a visual map construction method based on pre-sampled image features matching, according to the epipolar geometry of adjacent position images, to determine the optimal sampling spacing within the constraints and effectively control the database size while ensuring the integrity of the image information. In addition, in order to realize the rapid retrieval of the visual map and reduce the positioning error caused by the time overhead, an image retrieval method based on deep hashing was also designed in this paper. This method used a convolutional neural network to extract image features to construct the semantic similarity structure to guide the generation of hash code. Based on the log-cosh function, this paper proposed a loss function whose function curve was smooth and not affected by outliers, and then integrated it into the deep network to optimize parameters, for fast and accurate image retrieval. Experiments on the FLICKR25K dataset and the visual map proved that the method proposed in this paper could achieve sub-second image retrieval with guaranteed accuracy, thereby demonstrating its promising performance. [ABSTRACT FROM AUTHOR]

In this paper we show that the largest possible size of a subset of F q n avoiding right angles, that is, distinct vectors x , y , z such that x − z and y − z are perpendicular to each other is at most O (n q − 2). This improves on the previously best known bound due to Naslund [13] and refutes a conjecture of Ge and Shangguan [11]. A lower bound of n q / 3 is also presented. It is also shown that a subset of F q n avoiding triangles with all right angles can have size at most O (n 2 q − 2). Furthermore, asymptotically tight bounds are given for the largest possible size of a subset A ⊆ F q n for which x − y is not self-orthogonal for any distinct x , y ∈ A. The exact answer is determined for q = 3 and n ≡ 2 (mod 3). Our methods can also be used to bound the maximum possible size of a binary code where no two codewords have Hamming distance divisible by a fixed prime q. Our lower- and upper bounds are asymptotically tight and both are sharp in infinitely many cases. [ABSTRACT FROM AUTHOR]

In this paper, we prove the conjectured order lower bound for the k-th moment of central values of quadratic twisted self-dual GL(3) L-functions for all k ≥ 1, based on our recent work on the twisted first moment of central values in this family of L-functions. [ABSTRACT FROM AUTHOR]

In a category with a proper ()-factorization system, we study the notions of strict, co-strict, initial and final morphisms with respect to a topogenous order. Besides showing that they allow simultaneous study of four classes of morphisms obtained separately with respect to closure, interior and neighbourhood operators, the initial and final morphisms lead us to the study of topogenous orders induced by pointed and co-pointed endofunctors. We also lift the topogenous orders along an -fibration. This permits one to obtain the lifting of interior and neighbourhood operators along an -fibration and includes the lifting of closure operators found in the literature. A number of examples presented at the end of the paper demonstrates our results. [ABSTRACT FROM AUTHOR]

Univariate data has been the focus of optimal design for generalized linear models. It is common practice to conduct experiments with multiple dependent responses that are modelled using regression techniques. To design the experiment for all these responses, one needs a multivariate distribution supporting a previously chosen data model. The T‐optimal criterion is used to discriminate between two competing models. The designs that are optimal for discrimination between two models may be unsuitable for describe the quality of predictions for test data. G‐optimal criterion overcomes this restriction by minimizing the maximum variance of the predicted values. The design of experiments with dependent bivariate binary data is a topic we discuss in this paper. For dependent bivariate binary data, a technique for deriving TG‐optimal experimental designs using Copula is shown. The new compound TG‐criterion satisfy the dual aim to selecting the true model and minimizing the maximum prediction variance. The equivalence theorem is demonstrated and proved for the new compound criterion. A numerical example is presented to show the properties of the new compound criterion for bivariate binary setting and its value in meeting the dual aims. [ABSTRACT FROM AUTHOR]

Multi-view subspace clustering, which partitions multi-view data into their respective underlying subspaces, has achieved the remarkable clustering performance by extracting abundant complementary information from data of different views. However, existing subspace clustering methods almost suffer from very heavy computational burden that restricts their capacity on computational efficiency for large-scale datasets. Recently, hashing/binary code learning has attracted intensive attentions due to fast Hamming distance computation and much less storage requirement, but existing related research does not explore underlying subspace clustering structure well that widely exists in real-world data. In order to handle the both issues, in this paper, we propose a multi-view subspace clustering method named Hashing Multi-view Sparse Subspace Learning (HMSSL). HMSSL incorporates multi-view binary code learning and binary sparse subspace learning with a "thin" dictionary into a unified framework. HMSSL encodes multi-view real-valued features in the original space into compact common binary codes in the Hamming space for fast Hamming distance computation by multi-view binary code learning and learns the binary sparse subspace representation matrix for exploring the underlying subspace clustering structure efficiently and effectively by binary sparse subspace learning with a "thin" dictionary matrix. All the columns of the dictionary matrix are randomly and uniformly sampled from all the columns of the compact common binary code matrix. We design an effective binary optimization algorithm based on alternating direction multiplier method and analyze its time complexity. Extensive experiments performed on six benchmark multi-view datasets demonstrate the effectiveness of HMSSL in comparison with ten state-of-the-art baselines in this field. [ABSTRACT FROM AUTHOR]

Nested linear coding is a widely used technique in wireless communication systems for improving both security and reliability. Some parameters, such as the relative generalized Hamming weight and the relative dimension/length profile, can be used to characterize the performance of nested linear codes. In addition, the rank properties of generator and parity-check matrices can also precisely characterize their security performance. Despite this, finding optimal nested linear secrecy codes remains a challenge in the finite-blocklength regime, often requiring brute-force search methods. This paper investigates the properties of nested linear codes, introduces a new representation of the relative generalized Hamming weight, and proposes a novel method for finding the best nested linear secrecy code for the binary erasure wiretap channel by working from the worst nested linear secrecy code in the dual space. We demonstrate that our algorithm significantly outperforms the brute-force technique in terms of speed and efficiency. [ABSTRACT FROM AUTHOR]

The feature graph (Q-H graph) is the best way to intuitively and quantitatively reflect all features of the ventilation network. In this paper, an optimized adaptive genetic algorithm is proposed to solve the problem that rectangular blocks are cut in the process of drawing a Q-H diagram of a three-dimensional ventilation network. The algorithm adopts binary coding based on node sorting and mixed genetic coding based on integer coding. The formulas for calculating the adaptive crossover rate and mutation rate are designed, which can effectively generate new individuals and get rid of the search for local optimal values, ensuring the global optimal solution. Matlab was used to test the optimization effect of the Q-H graph; the results show that, for a complex ventilation network, the improved adaptive genetic algorithm can make the Q-H graph significantly reduce the number of rectangular pieces, which is divided, and make the Q-H graph have better effect to draw clearly and intuitively. [ABSTRACT FROM AUTHOR]

The new type of multi-temporal global land use data with multiple classes is able to provide information on both the different land covers and their temporal changes; furthermore, it is able to contribute to many applications, such as those involving global climate and Earth ecosystem analyses. However, the current accuracy assessment methods have two limitations regarding multi-temporal land cover data that have multiple classes. First, multi-temporal land cover uses data from multiple phases, which is time-consuming and inefficient if evaluated one by one. Secondly, the conversion between different land cover classes increases the complexity of the sample stratification, and the assessments with different types of land cover suffer from inefficient sample stratification. In this paper, we propose a spatiotemporal stratified sampling method for stratifying the multi-temporal GlobeLand30 products for China. The changed and unchanged types of each class of data in the three periods are used to obtain a reasonable stratification. Then, the strata labels are simplified by using binary coding, i.e., a 1 or 0 representing a specified class or a nonspecified class, to improve the efficiency of the stratification. Additionally, the stratified sample size is determined by the combination of proportional allocation and empirical evaluation. The experimental results show that spatiotemporal stratified sampling is beneficial for increasing the sample size of the "change" strata for multi-temporal data and can evaluate not only the accuracy and area of the data in a single data but also the accuracy and area of the data in a multi-period change type and an unchanged type. This work also provides a good reference for the assessment of multi-temporal data with multiple classes. [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]

We study the probability of an undetected error for general q-ary codes. We give upper and lower bounds on this quantity, by the Linear Programming and the Polynomial methods, as a function of the length, size, and minimum distance. Sharper bounds are obtained in the important special case of binary Hamming codes. Finally, several examples are given to illustrate the results of this paper. [ABSTRACT FROM AUTHOR]

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

Because Gray code has good spatial traversal and easy to generate binary conversion, this paper proposes an image encryption algorithm based on Gray code scrambling. Firstly, the Lorenz system is used to generate chaotic sequences for binary and Gray code transformation to achieve global scrambling. Different from the traditional row (column) XOR method, this paper uses the snake shape to diffuse the row (column) XOR. The lines of the scrambled image are first XORed from left to right in a serpentine order, and the row elements are cyclically shifted. Then, the columns of the image are XORed from right to left in a serpentine order, and the column elements are cyclically shifted. Finally, the scrambled image is further diffused. The comparative experiment shows that the algorithm has good encryption effect. Not only is it well resistant to differential cryptanalysis and exhaustive attack, but it also improves key sensitivity. [ABSTRACT FROM AUTHOR]

The traditional pointer instrument recognition scheme is implemented in three steps, which is cumbersome and inefficient. So it is difficult to apply to the industrial production of real-time monitoring. Based on the improvement of the CSL coding method and the setting of the pre-cache mechanism, an intelligent reading recognition technology of the YOLOv5 pointer instrument is proposed in this paper, which realizes the rapid positioning and reading recognition of the pointer instrument. The problem of angle interaction in rotating target detection is eliminated, the complexity of image preprocessing is avoided, and the problems of poor adaptability of Hough detection are solved in this strategy. The experimental results show that compared with the traditional algorithm, the algorithm in this paper can effectively identify the angle of the pointer instrument, has high detection efficiency and strong adaptability, and has broad application prospects. [ABSTRACT FROM AUTHOR]

This paper reveals the hidden dangers of reverse data modifications on distributed software with network synchronization, during the era of 5G, which may occur in more important domains, such as telemedicine and automatic driving. We used pseudo-codes to formally elaborate the distributed software architectures and design patterns. It is necessary to deal with three challenges for the modification of binary code and data in the distributed software architectures: (1) the base virtual addresses of software objects are changed frequently for safety; (2) prior knowledge of the reverse is not considered; (3) system memory values of some target objects are changed with extreme speed. For this purpose, a novel reverse modification method for binary code and data is proposed. According to the knowledge-based rules, our method can manipulate physical data, sight data, animation data, etc., while the game synchronization mechanism cannot detect the changes. The implementation details of our method are presented using high-level programming languages (C++) and low-level programming languages (assembly), based on multiple snippets, so that readers can understand both the overall distributed software developments and the corresponding reverse processes. In particular, two network games are used for the demonstrations in this paper. The demonstration results show that our proposed methodology is efficient (as proved by formulas and practices) to manipulate the codes and data of distributed software using a synchronization mechanism. [ABSTRACT FROM AUTHOR]

The primary goal of this paper is to study Spanier–Whitehead duality in the K(n)-local category. One of the key players in the K(n)-local category is the Lubin–Tate spectrum E n , whose homotopy groups classify deformations of a formal group law of height n, in the implicit characteristic p. It is known that E n is self-dual up to a shift; however, that does not fully take into account the action of the automorphism group G n of the formal group in question. In this paper we find that the G n -equivariant dual of E n is in fact E n twisted by a sphere with a non-trivial (when n > 1 ) action by G n . This sphere is a dualizing module for the group G n , and we construct and study such an object I G for any compact p-adic analytic group G . If we restrict the action of G on I G to certain type of small subgroups, we identify I G with a specific representation sphere coming from the Lie algebra of G . This is done by a classification of p-complete sphere spectra with an action by an elementary abelian p-group in terms of characteristic classes, and then a specific comparison of the characteristic classes in question. The setup makes the theory quite accessible for computations, as we demonstrate in the later sections of this paper, determining the K(n)-local Spanier–Whitehead duals of E n hH for select choices of p and n and finite subgroups H of G n . [ABSTRACT FROM AUTHOR]

Nonlinear optical switching is a prominent technology for high-speed data processing. All-optical switching based on phase-shifted fiber Bragg Grating provides a tremendous opportunity with advantages such as improved efficiency, sensitivity, lightweight, and cost-effective parameters as compared to traditional optical switching for designing different types of optical combinational digital circuits. The paper describes the concepts of phase-shifted FBG structure, which actually, performs the switching on the basis of cross-phase modulation (XPM) scheme and non-linear optics. The paper describes the details of the coupled-mode theory associated with the FBG technology and its effectiveness as a powerful optical switch using the concept of non-linear optics. The non-linear FBG-based switch is analyzed to implement the all-optical 4-bit binary to gray code converter that has been designed. The proposed architecture leads to Very large-scale integration optics (VLSIO), which involves perfect and high-speed switching, switch in fiber(SIF) in the field of all-optical communication systems and switching technology. The proposed scheme can be a stepping stone in the field of fast switching and signal processing and it may provide a new horizon to the switching phenomena. [ABSTRACT FROM AUTHOR]

Background: Bone age assessment assists physicians in evaluating the growth and development of children. However, deep learning methods for bone age estimation do not currently incorporate differential features obtained through comparisons with other bone atlases.To propose a more accurate method, Delta-Age-Sex-AdaIn (DASA-net), for bone age assessment, this paper combines age and sex distribution through adaptive instance normalization (AdaIN) and style transfer, simulating the process of visually comparing hand images with a standard bone atlas to determine bone age.The proposed Delta-Age-Sex-AdaIn (DASA-net) consists of four modules: BoneEncoder, Binary code distribution, Delta-Age-Sex-AdaIn, and AgeDecoder. It is compared with state-of-the-art methods on both a public Radiological Society of North America (RSNA) pediatric bone age prediction dataset (14,236 hand radiographs, ranging from 1 to 228 months) and a private bone age prediction dataset from Zigong Fourth People's Hospital (474 hand radiographs, ranging from 12 to 218 months, 268 male). Ablation experiments were designed to demonstrate the necessity of incorporating age distribution and sex distribution.The DASA-net model achieved a lower mean absolute deviation (MAD) of 3.52 months on the RSNA dataset, outperforming other methods such as BoneXpert, Deeplasia, BoNet, and other deep learning based methods. On the private dataset, the DASA-net model obtained a MAD of 3.82 months, which is also superior to other methods.The proposed DASA-net model aided the model’s learning of the distinctive characteristics of hand bones of various ages and both sexes by integrating age and sex distribution into style transfer.Objective: Bone age assessment assists physicians in evaluating the growth and development of children. However, deep learning methods for bone age estimation do not currently incorporate differential features obtained through comparisons with other bone atlases.To propose a more accurate method, Delta-Age-Sex-AdaIn (DASA-net), for bone age assessment, this paper combines age and sex distribution through adaptive instance normalization (AdaIN) and style transfer, simulating the process of visually comparing hand images with a standard bone atlas to determine bone age.The proposed Delta-Age-Sex-AdaIn (DASA-net) consists of four modules: BoneEncoder, Binary code distribution, Delta-Age-Sex-AdaIn, and AgeDecoder. It is compared with state-of-the-art methods on both a public Radiological Society of North America (RSNA) pediatric bone age prediction dataset (14,236 hand radiographs, ranging from 1 to 228 months) and a private bone age prediction dataset from Zigong Fourth People's Hospital (474 hand radiographs, ranging from 12 to 218 months, 268 male). Ablation experiments were designed to demonstrate the necessity of incorporating age distribution and sex distribution.The DASA-net model achieved a lower mean absolute deviation (MAD) of 3.52 months on the RSNA dataset, outperforming other methods such as BoneXpert, Deeplasia, BoNet, and other deep learning based methods. On the private dataset, the DASA-net model obtained a MAD of 3.82 months, which is also superior to other methods.The proposed DASA-net model aided the model’s learning of the distinctive characteristics of hand bones of various ages and both sexes by integrating age and sex distribution into style transfer.Materials and methods: Bone age assessment assists physicians in evaluating the growth and development of children. However, deep learning methods for bone age estimation do not currently incorporate differential features obtained through comparisons with other bone atlases.To propose a more accurate method, Delta-Age-Sex-AdaIn (DASA-net), for bone age assessment, this paper combines age and sex distribution through adaptive instance normalization (AdaIN) and style transfer, simulating the process of visually comparing hand images with a standard bone atlas to determine bone age.The proposed Delta-Age-Sex-AdaIn (DASA-net) consists of four modules: BoneEncoder, Binary code distribution, Delta-Age-Sex-AdaIn, and AgeDecoder. It is compared with state-of-the-art methods on both a public Radiological Society of North America (RSNA) pediatric bone age prediction dataset (14,236 hand radiographs, ranging from 1 to 228 months) and a private bone age prediction dataset from Zigong Fourth People's Hospital (474 hand radiographs, ranging from 12 to 218 months, 268 male). Ablation experiments were designed to demonstrate the necessity of incorporating age distribution and sex distribution.The DASA-net model achieved a lower mean absolute deviation (MAD) of 3.52 months on the RSNA dataset, outperforming other methods such as BoneXpert, Deeplasia, BoNet, and other deep learning based methods. On the private dataset, the DASA-net model obtained a MAD of 3.82 months, which is also superior to other methods.The proposed DASA-net model aided the model’s learning of the distinctive characteristics of hand bones of various ages and both sexes by integrating age and sex distribution into style transfer.Results: Bone age assessment assists physicians in evaluating the growth and development of children. However, deep learning methods for bone age estimation do not currently incorporate differential features obtained through comparisons with other bone atlases.To propose a more accurate method, Delta-Age-Sex-AdaIn (DASA-net), for bone age assessment, this paper combines age and sex distribution through adaptive instance normalization (AdaIN) and style transfer, simulating the process of visually comparing hand images with a standard bone atlas to determine bone age.The proposed Delta-Age-Sex-AdaIn (DASA-net) consists of four modules: BoneEncoder, Binary code distribution, Delta-Age-Sex-AdaIn, and AgeDecoder. It is compared with state-of-the-art methods on both a public Radiological Society of North America (RSNA) pediatric bone age prediction dataset (14,236 hand radiographs, ranging from 1 to 228 months) and a private bone age prediction dataset from Zigong Fourth People's Hospital (474 hand radiographs, ranging from 12 to 218 months, 268 male). Ablation experiments were designed to demonstrate the necessity of incorporating age distribution and sex distribution.The DASA-net model achieved a lower mean absolute deviation (MAD) of 3.52 months on the RSNA dataset, outperforming other methods such as BoneXpert, Deeplasia, BoNet, and other deep learning based methods. On the private dataset, the DASA-net model obtained a MAD of 3.82 months, which is also superior to other methods.The proposed DASA-net model aided the model’s learning of the distinctive characteristics of hand bones of various ages and both sexes by integrating age and sex distribution into style transfer.Conclusion: Bone age assessment assists physicians in evaluating the growth and development of children. However, deep learning methods for bone age estimation do not currently incorporate differential features obtained through comparisons with other bone atlases.To propose a more accurate method, Delta-Age-Sex-AdaIn (DASA-net), for bone age assessment, this paper combines age and sex distribution through adaptive instance normalization (AdaIN) and style transfer, simulating the process of visually comparing hand images with a standard bone atlas to determine bone age.The proposed Delta-Age-Sex-AdaIn (DASA-net) consists of four modules: BoneEncoder, Binary code distribution, Delta-Age-Sex-AdaIn, and AgeDecoder. It is compared with state-of-the-art methods on both a public Radiological Society of North America (RSNA) pediatric bone age prediction dataset (14,236 hand radiographs, ranging from 1 to 228 months) and a private bone age prediction dataset from Zigong Fourth People's Hospital (474 hand radiographs, ranging from 12 to 218 months, 268 male). Ablation experiments were designed to demonstrate the necessity of incorporating age distribution and sex distribution.The DASA-net model achieved a lower mean absolute deviation (MAD) of 3.52 months on the RSNA dataset, outperforming other methods such as BoneXpert, Deeplasia, BoNet, and other deep learning based methods. On the private dataset, the DASA-net model obtained a MAD of 3.82 months, which is also superior to other methods.The proposed DASA-net model aided the model’s learning of the distinctive characteristics of hand bones of various ages and both sexes by integrating age and sex distribution into style transfer.Graphical Abstract: Bone age assessment assists physicians in evaluating the growth and development of children. However, deep learning methods for bone age estimation do not currently incorporate differential features obtained through comparisons with other bone atlases.To propose a more accurate method, Delta-Age-Sex-AdaIn (DASA-net), for bone age assessment, this paper combines age and sex distribution through adaptive instance normalization (AdaIN) and style transfer, simulating the process of visually comparing hand images with a standard bone atlas to determine bone age.The proposed Delta-Age-Sex-AdaIn (DASA-net) consists of four modules: BoneEncoder, Binary code distribution, Delta-Age-Sex-AdaIn, and AgeDecoder. It is compared with state-of-the-art methods on both a public Radiological Society of North America (RSNA) pediatric bone age prediction dataset (14,236 hand radiographs, ranging from 1 to 228 months) and a private bone age prediction dataset from Zigong Fourth People's Hospital (474 hand radiographs, ranging from 12 to 218 months, 268 male). Ablation experiments were designed to demonstrate the necessity of incorporating age distribution and sex distribution.The DASA-net model achieved a lower mean absolute deviation (MAD) of 3.52 months on the RSNA dataset, outperforming other methods such as BoneXpert, Deeplasia, BoNet, and other deep learning based methods. On the private dataset, the DASA-net model obtained a MAD of 3.82 months, which is also superior to other methods.The proposed DASA-net model aided the model’s learning of the distinctive characteristics of hand bones of various ages and both sexes by integrating age and sex distribution into style transfer. [ABSTRACT FROM AUTHOR]

The classical way of extending an [ n , k , d ] linear code C is to add an overall parity-check coordinate to each codeword of the linear code C. This extended code, denoted by C ‾ (− 1) and called the standardly extended code of C , is a linear code with parameters [ n + 1 , k , d ¯ ] , where d ¯ = d or d ¯ = d + 1. This is one of the two extending techniques for linear codes in the literature. The standardly extended codes of some families of binary linear codes have been studied to some extent. However, not much is known about the standardly extended codes of nonbinary codes. For example, the minimum distances of the standardly extended codes of the nonbinary Hamming codes remain open for over 70 years. The first objective of this paper is to introduce the nonstandardly extended codes of a linear code and develop some general theory for this type of extended linear codes. The second objective is to study this type of extended codes of a number of families of linear codes, including cyclic codes and nonbinary Hamming codes. Four families of distance-optimal or dimension-optimal linear codes are obtained with this extending technique. The parameters of certain extended codes of many families of linear codes are settled in this paper. [ABSTRACT FROM AUTHOR]

In the age of the artificial intelligence of things (AIoT), wearable devices have been extensively developed for smart healthcare. This paper proposes a self‐powered and self‐sensing lower‐limb system (SS‐LS) with negative energy harvesting and motion capture for smart healthcare. The SS‐LS achieves self‐sustainability via a half‐wave electromagnetic generator (HW‐EMG) that recovers negative work from walking with a low cost of harvesting. Additionally, the motion capture function of the system is achieved by the three‐channel triboelectric nanogenerator (TC‐TENG) based on binary code, which can accurately detect the angle and direction of the knee joint rotation. The bench test experiment indicates that the HW‐EMG has an average output power of 11.2 mW, sufficient to power a wireless sensor. The three‐channel voltage signal of TC‐TENG fits well with the binary signal, which can precisely detect the angle and direction of rotation. Furthermore, the SS‐LS demonstrates an identification accuracy of 99.68% and a motion detection accuracy of 99.96% based on an LSTM deep learning model. Demonstrations of Parkinson's disease and fall detection and monitoring of three training modes (sit‐and‐stand, balance, and walking training) are also performed, which exhibit outstanding sensing capabilities. The SS‐LS is highly promising in sports rehabilitation medicine and can contribute to the development of smart healthcare. [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 prove strong subconvexity bounds for self-dual |$\textrm {GL}(3)\ L$| -functions in the |$t$| -aspect and for |$\textrm {GL}(3)\times \textrm {GL}(2)$| |$L$| -functions in the |$\textrm {GL}(2)$| -spectral aspect. The bounds are strong in the sense that they are the natural limit of the moment method pioneered by Xiaoqing Li, modulo current knowledge on estimate for the second moment of |$\textrm {GL}(3)$| |$L$| -functions on the critical line. [ABSTRACT FROM AUTHOR]

Many metrics exist for the evaluation of binary classifiers, all with their particular advantages and shortcomings. Recently, an "Efficiency Index" (EI) for the evaluation of classifiers has been proposed, based on the consistency (or matching) and contradiction (or mismatching) of outcomes. This metric and its confidence intervals are easy to calculate from the base data in a 2 × 2 contingency table, and their values can be qualitatively and semi-quantitatively categorised. For medical tests, in which context the Efficiency Index was originally proposed, it facilitates the communication of risk (of the correct diagnosis versus misdiagnosis) to both clinicians and patients. Variants of the Efficiency Index (balanced, unbiased) which take into account disease prevalence and test cut-offs have also been described. The objectives of the current paper were firstly to extend the EI construct to other formulations (balanced level, quality), and secondly to explore the utility of the EI and all four of its variants when applied to the dataset of a large prospective test accuracy study of a cognitive screening instrument. This showed that the balanced level, quality, and unbiased formulations of the EI are more stringent measures. [ABSTRACT FROM AUTHOR]

This paper analyses the design of a healthy interior environment using big data intelligence. The application of big data intelligence in the design of healthy interior environments is necessary because the traditional interior design approaches consume a lot of energy and other problems. Benefited by its strong ability of computation and analytics, artificial intelligence can well improve a series of problems in the field of interior design. The proposal summarizes the sources, classifications, and expressions of behavioral data in interior spaces, carries out analysis and research on behavioral data from two aspects: display space and supermarket space, summarizes the interior methods based on behavioral data, and analyses the visualization application of behavioral data in different interior scenes, to explore the application value of behavioral data in interior design. In contrast to it is the unconscious behavioral response, the biggest characteristic of which is that it is regulated by the behavioral subject's physiological factors or habits of the behavior issuer. In this paper, we convert the layout recommendation problem of a space into a functional classification problem of segmented segments and household segments on a plane. The scene layout features are extracted by binary coding, the abstraction of the cross features between the vector segments is achieved by using a word embedding algorithm, the feature matrix is reduced in dimensionality, and finally, the segmentation network model and the layout network model are constructed, respectively, by using a bidirectional LSTM. The experiments show that the accuracy of the layout recommendation model in this paper is 98%, which can meet the demand for real-time online layouts. [ABSTRACT FROM AUTHOR]

The purpose of this paper is to introduce a novel notion of hypergraph-based codes, L.C-hypergraphs and codeable hypergraphs with respect to binary (linear) codes. In order to realize the article's goals, we define the concepts of code-based graphs, consider them as complex networks and construct them from binary (linear) codes via an equivalence relation on (L.C-hypergraphs) codeable hypergraphs. The paper includes implications for the development of fuzzy graph and for modeling the security problems by codeable hypergraphs and applications in complex hypernetworks. The new conception of codeable hypergraphs was given for the first time in this paper. Finally (L.C-hypergraphs), codeable hypergraphs, as complex hypernetworks, are applied as a tool in wireless sensor hypernetworks, code-based graphs, in wireless sensor networks and the bilateral relations between them. [ABSTRACT FROM AUTHOR]

Linear codes generated by component functions of perfect nonlinear (PN for short) and almost perfect nonlinear (APN for short) functions and the first-order Reed-Muller codes have been an object of intensive study in coding theory. The objective of this paper is to investigate some binary shortened codes of two families of linear codes from APN functions and some $p$ -ary shortened codes associated with PN functions. The weight distributions of these shortened codes and the parameters of their duals are determined. The parameters of these binary codes and $p$ -ary codes are flexible. Many of the codes presented in this paper are optimal or almost optimal. The results of this paper show that the shortening technique is very promising for constructing good codes. [ABSTRACT FROM AUTHOR]