By Topic

Optimal information organization for web and other displays

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Kundu, S. ; Comput. Sci. Dept., Louisiana State Univ., Baton Rouge, LA, USA

We usually look at information and assimilate them in small chunks in a time-wise linear fashion. Processing an information chunk xj has two parts: (1) looking at xj, and (2) recalling zero or more pre viously seen chunks xi that have direct semantic relationship with xj in order to properly assimilate xj. Since a larger gap between the presentations of xi and xj means a larger effort in recalling xi at xj, the total recall effort R(xj) at xj depends 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 xj on xi and the weights w(xi) >; 0 represent the gap due to xi.

Published in:

Information and Communication Technologies (WICT), 2011 World Congress on

Date of Conference:

11-14 Dec. 2011