Optimal information organization for web and other displays
Sukhamay Kundu · 2011
We usually look at information and assimilate them in small chunks in a time-wise linear fashion. Processing an information chunk xjhas two parts: (1) looking at xj, and (2) recalling zero or more pre viously seen chunks xithat have direct semantic relationship with xjin order to properly assimilate xj. Since a larger gap between the presentations of xiand xjmeans a larger effort in recalling xiat xj, the total recall effort R(xj) at xjdepends on the order of presentation of xi's, but it does not affect the other effort of looking at xj's. We present an O(n2) algorithm to minimize ΣR(xj) for a given collection of information chunks {xj; 1 ≤ j ≤ n}, where the weights s(xi, xj) ≥ 0 represent the strength of the semantic dependency of xjon xiand the weights w(xi) >; 0 represent the gap due to xi.