Neha W
2016년부터 활동
Followers: 0 Following: 0
Feeds
질문
Permuting elements of matrix with a polynomial (3x^3 + 6x^2 + 7x) mod 9
A = [1 2 3; 4 5 6; 7 8 9] %original position of matrix elements [r c] = size(A); N = 9; B = reshape(A,1,r*c); % B = [1 ...
7년 초과 전 | 답변 수: 1 | 0
1
답변질문
For every iteration, I want to plot two parameters NPCR and UACI in the same graph
On x axis: n= 1:5 On y axis: (Npcr & Uaci both are in %) Npcr = [98.95 99.45 98.60 97.60 98.85] Uaci = [26.92 23.64 24.8...
거의 8년 전 | 답변 수: 1 | 0
1
답변질문
I have implemented 'An Image Encryption Technique Based on Rubik Cube Principle'. I complied till %encryption(CODE attached) but not getting decrypted image.
<</matlabcentral/answers/uploaded_files/60759/encrypted%20image.jpg>>
거의 8년 전 | 답변 수: 0 | 0
0
답변질문
Using for loop to evaluate polynomial for different values
% Here N = 10 ; poly =[5 8 0] for i = 1:N-1; A = sum(poly); B = mod(A,N); end i = i + 1; But the end resul...
거의 8년 전 | 답변 수: 1 | 0
1
답변질문
How do I get the sum for every i = 1: N-1?
For N = 600 and degree = 5 After applying certain conditions, I have a polynomial which is of the form: A = [first middl...
거의 8년 전 | 답변 수: 2 | 0
2
답변질문
I have a code that is used for generating multiples of odd prime number dividing N
N = 600; Therefore I get oddprimes = [3 5] product = 15 Now the multiples are in the range m = 0:product:N-product , i...
거의 8년 전 | 답변 수: 0 | 0
0
답변질문
I have the code which generates an array for a1. For N = 10, what does a1 = [a1 a1+N/2] stores.? Is there any need?
if mod(N,2)==0 && mod(N,4)~= 0 a1 = 1: (N/2-1); a1 = a1(gcd(a1,N/2)==1); a1 = [a1 a1+N/2]; end
거의 8년 전 | 답변 수: 1 | 0
1
답변질문
I am trying to store the (non-repetitive) numbers in B = [3,5] after factorizing 225 = 3 x 3 x 5 x 5, but executing the code it stores only one, i.e. B = [3].
% A = factor(225); B(1) = A(1); flag = 0; for i = 1:length(A)-1; for j = i + 1; if A(i) == A(j) ...
8년 초과 전 | 답변 수: 1 | 0
1
답변질문
How could find multiples of a given number N ?
The input is taken from the user.
8년 초과 전 | 답변 수: 3 | 0
3
답변질문
I have to calculate the sum of multiple coefficients which depends upon the value 'm'.
Could you please tell me how should I approach to this? <</matlabcentral/answers/uploaded_files/48703/123.jpg>>
8년 초과 전 | 답변 수: 1 | 0
1
답변질문
If N is given and I need to make a choice for a1, then using if else statements how should I apply the following condition:
(a1,N) = 1, if 2 does not divide N or 4 divides N
8년 초과 전 | 답변 수: 1 | 0
1
답변질문
I have executed a code and it seem to give errors. Is there any invalid statements? The image is of [r x c] = 256 X 256 and I tried to store each co-ordinate {(1,1),(1,2),...,(256,256)} corresponding to each pixel value in an array 'C'.
I = imread('Cameraman.tif'); [r,c] = size(I); k = 1; loop to store the pixel co-ordinates for i = 1:r; for ...
8년 초과 전 | 답변 수: 0 | 0
0
답변질문
I have an polynomial f(x) = 4x^5 + 5x^4 + 2x^3 +2x^2 +3x. And x ranges from {0 to 63}. How do I code this so I can display answer corresponding to every value of x.?
Could you help me?
8년 초과 전 | 답변 수: 2 | 0
2
답변질문
I have written a code to assign each co-ordinate of matrix A(5 x 5) as A(1,1) = 1; A(1,2) = 2; and so on till A(5,5) = 25. But the code is giving errors.
I need to store it in an array using loops like [1 2 ....25]. The below code is giving me, "Expression is incorrect--possibly ...
8년 초과 전 | 답변 수: 1 | 0
1
답변질문
I need to create an array (256 x 256) in which elements increments using loops.
An array in which I(1,1) = 0 I(1,2) = 1 and so on till I(256,256) = 65535 using loops
8년 초과 전 | 답변 수: 1 | 0
1
답변질문
I have an image (256 x 256) where its pixels ranging from 0 to 255. I need to built a look up table to map its values with image pixels.
Since I am a beginner, I cant find a way as how to start with coding for lookuptable. It would really helpful if you would help....
8년 초과 전 | 답변 수: 2 | 0
2
답변질문
I have an image of 256 X 256 size. And I want to get a permutation polynomial from it.
I have an image. I have a matrix containing values of the pixels in that image. I want to generate a permutation polynomial an...
8년 초과 전 | 답변 수: 0 | 0