Binary matrices
Minimising the number of gap-zeros in binary matrices
... Our problem extends the class of problems concerned with the consecutive ones prop- erty for binary matrices. A given (0,1)-matrix satisfies the Consecutive Ones Property (for columns) (C1P) if there exists ...
27
Parameter Settings for Reconstructing Binary Matrices from Fan-Beam Projections
... This paper deals with the reconstruction of bi- nary matrices, i.e., the matrix elements can be either 0 or 1. The reconstruction methods of binary matrices from parallel projections are available, ...
10
Compose Binary Matrices
... Hadamard Matrices and M-Sequences (which formed a closed sets under the addition and with the corresponding null se- quence formed additive groups and generated by feedback registers) are used widely at the ...
17
On the Size and Recovery of Submatrices of Ones in a Random Binary Matrix
... Binary matrices, and their associated submatrices of 1s, play a central role in the study of random bipartite graphs and in core data mining problems such as frequent itemset mining ...random binary ...
23
Arikan and Alamouti matrices based on fast block-wise inverse Jacket transform
... Jacket matrices and the basis matrix, the fast algorithms for realizing these transforms are ...polar binary and Alamouti multiple-input multiple-output (MIMO) non-binary matrices, which are ...
14
Shorter Linear Straight-Line Programs for MDS Matrices
... Interestingly, the task to optimize the cost of implementing the multiplication with a relatively large, e. g., 32 × 32 binary matrix, is another extensively studied line of research. It is known that the problem ...
25
Lightweight Iterative MDS Matrices: How Small Can We Go?
... 4 binary matrices) with minimal nonzero blocks costs at least 3 XOR gates, and a concrete example achieving the 3-XOR bound is ...MDS matrices with other dimensions and report on improved ...
24
Significance and recovery of blocks structures in binary and real-valued matrices with noise
... In Chapter 2, we focused on frequent itemset mining. Frequent itemset mining has an equivalent matrix form, where frequent itemsets correspond to maximal submatrices of 1’s in binary matrices. The objective ...
106
Spatial and Textural Aspects for Arabic Handwritten Characters Recognition
... a binary Matrix and then constructs a Mask for each ...input binary matrix and the masks to determinate the corresponding ...the binary matrices as features and then the histograms of Local ...
6
On the Linear Transformation in White-box Cryptography
... Abstract. Linear transformations are applied to the white-box crypto- graphic implementation for the diffusion effect to prevent key-dependent intermediate values from being analyzed. However, it has been shown that ...
16
Generalization of Hadamard Matrices
... Sylvester’s construction are usually referred to as Sylvester-Hadamard matrices. The Sylvester-Hadamard matrices are associated with discrete orthogonal functions called Walsh functions. Hadamard (1893) ...
18
Similarity coefficients for binary data : properties of coefficients, coefficient matrices, multi-way metrics and multivariate coefficients
... similarity matrices corresponding to coefficients for binary ...coefficient matrices are ...similarity matrices, especially matrices corresponding to asymmetric coefficients, are more ...
253
An Optimized Area Efficient High Speed CSD Multiplier for Image Processing Applications
... The above circuit represented in Fig 2 is used for n number of required bits. Thus we can convert a number from its binary form to CSD representation. Mainly converting a number from binary to CSD will ...
5
Predicting the naturalistic course of depression from a wide range of clinical, psychological, and biological data: a machine learning approach
... Confusion matrices for classi fi ers are depicted in panel a for binary prediction, i.e., presence or absence of a unipolar depression diagnosis at follow-up (major depressive disorder or[r] ...
11
On improvements of Fischer’s inequality and Hadamard’s inequality for K0 matrices
... inequality, we know that A is a P-matrix, therefore A is a K-matrix. Now we prove (.) for the K-matrix by induction on n. When n = , it is very easy to see that the result is valid. We suppose that the result is valid ...
8
A Real Time Secure Image Transmission Using Data Scrambling and Binary Key Matrices Dr P V Naganjaneyulu
... This approach shows the better performance than the previously existed 2D maps, in which only permutation was used. Another approach for image encryption in [4], which is proposed by kuang tsan lin, this approach ...
5
Labelling matrices and index matrices of a graph structure
... labellings there and proved some results. Here we are introducing labelling matrices and index matrices of a graph structure. We are also proving that the collection of all admissible index matrices ...
19
Transpose of Nörlund matrices on the domain of summability matrices
... the columns and the rows of the summability matrix E. In particular, we apply our results to domains of some summability matrices such as Fibonacci, Karamata, Euler, and Taylor matrices. Our result is an ...
5
Stable matrices, the Cayley transform, and convergent matrices
... STABLE MATRICES, THE CAYLEY TRANSFORM, AND CONVERGENT MATRICES TYLER HAYNES Mathematics Department Saginaw Valley State University University Center, Michigan 48710 Received January 17, [r] ...
5
Matrices
... Remark If AB is defined, then BA need not be defined. In the above example, AB is defined but BA is not defined because B has 3 column while A has only 2 (and not 3) rows. If A, B are, respectively m × n, k × l ...
47