- #1
wvguy8258
- 50
- 0
Preface note: the R and Z in the {}s below should be double-struck, but I couldn't figure out how to do that here. I tried the usual shortcuts to no avail.
I am writing pseudo-code for a publication, and am asked to use rigorous math notation, which is new to me.
I am trying to express the following: I have a vector of values called SIMCOMP it is composed of n elements that are real numbers and can be between 0 and +infinity. Does the following accomplish this? Any constructive criticism?
Let SIMCOMP=(SIMCOMP1,SIMCOMP2,…,SIMCOMPn ) be the values in the existing SIMCOMP map for each cell i where {SIMCOMP ∈ R | SIMCOMP ≥ 0}.
I am using boldface to indicate the entire vector. I am unsure whether the entire vector (bolded) belongs in the set builder notation {} or something like SIMCOMPi. More background, the vector is from an existing pixellated map (composed of cells) called SIMCOMP map which has a number of cells equal to n. So, I am representing a 2xmatrix (row,col) by a 1xvector here, that is what some of the verbage means and is apparent in the context of the pub.ONE MORE QUESTION:
I have separate Initialization and Algorithm sections in the overall pseudo-code. The end product of the algorithm is a vector of integer values 0 or 1. Before I describe how the vector is filled in the Algorithm section, is it best practice to let the reader know that the vector "exists" in a sense, meaning it is there and ready to be filled but no values are currently assigned that have meaning? This is similar to just allocation in computer programming.
If so, does the following accomplish this well? Again, please be brutal. I am outside my field here.
Let SIMCAL= (SIMCAL1,SIMCAL2,…,SIMCALn ) indicate the state of cells in the SIMCAL map to be created where 0 or 1 indicates the absence or presence of transition to developed LULC, respectively, and {SIMCAL ∈ Z | 0 ≤ SIMCAL ≤ 1}.
I am writing pseudo-code for a publication, and am asked to use rigorous math notation, which is new to me.
I am trying to express the following: I have a vector of values called SIMCOMP it is composed of n elements that are real numbers and can be between 0 and +infinity. Does the following accomplish this? Any constructive criticism?
Let SIMCOMP=(SIMCOMP1,SIMCOMP2,…,SIMCOMPn ) be the values in the existing SIMCOMP map for each cell i where {SIMCOMP ∈ R | SIMCOMP ≥ 0}.
I am using boldface to indicate the entire vector. I am unsure whether the entire vector (bolded) belongs in the set builder notation {} or something like SIMCOMPi. More background, the vector is from an existing pixellated map (composed of cells) called SIMCOMP map which has a number of cells equal to n. So, I am representing a 2xmatrix (row,col) by a 1xvector here, that is what some of the verbage means and is apparent in the context of the pub.ONE MORE QUESTION:
I have separate Initialization and Algorithm sections in the overall pseudo-code. The end product of the algorithm is a vector of integer values 0 or 1. Before I describe how the vector is filled in the Algorithm section, is it best practice to let the reader know that the vector "exists" in a sense, meaning it is there and ready to be filled but no values are currently assigned that have meaning? This is similar to just allocation in computer programming.
If so, does the following accomplish this well? Again, please be brutal. I am outside my field here.
Let SIMCAL= (SIMCAL1,SIMCAL2,…,SIMCALn ) indicate the state of cells in the SIMCAL map to be created where 0 or 1 indicates the absence or presence of transition to developed LULC, respectively, and {SIMCAL ∈ Z | 0 ≤ SIMCAL ≤ 1}.
Last edited: