Patent ID: 8151217

Claim:
A method for dynamically displaying application shortcut icons of an electronic device, the electronic device comprising a storage device storing applications, the method comprising: (a) receiving a predetermined frequency value and a dependency rule, wherein the frequency value is a count that how many times an application has been invoked within a predetermined time interval and the dependency rule is a count of a taken browsing path to the application; (b) detecting a currently invoked application, and identifying a browsing path to the currently invoked application, and storing the browsing path into the storage device; (c) accessing an invoked frequency of the currently invoked application from the storage device; (d) updating the invoked frequency, and saving the updated invoked frequency in the storage device; (e) storing an identifier of the currently invoked application into a queue of the storage device upon the condition that the updated invoked frequency of the currently invoked application is equal to or more than the predetermined frequency value; (f) constructing a first dependency relation graph for the applications whose identifiers are in the queue upon the condition that the count of the browsing path to the currently invoked application is equal to or more than the dependency rule; (g) computing a weight value of each node in the first dependency relation graph using the algorithm: PR ⁡ ( P i ) = ⁢ ( d ) n + ( 1 - d ) × ∑ I j , i ∈ E ⁢ ⁢ PR ⁡ ( P j ) / Out ⁢ ⁢ degree ⁡ ( P j ) = ⁢ ( d ) n + ( 1 - d ) × { PR ⁡ ( P 1 ) Out ⁢ ⁢ degree ⁡ ( P 1 ) + PR ⁡ ( P 2 ) Out ⁢ ⁢ degree ⁡ ( P 2 ) + … + ⁢ PR ⁡ ( P j ) Out ⁢ ⁢ degree ⁡ ( P j ) } , wherein, “P 1 ”, “P 2 ”, . . . “P j ” are nodes of the first dependency relation graph that are connected to a node P i of the first dependency relation graph, PR(P j ) is a weight value of the node “P j ” of the first dependency relation graph, “Outdegree(P j )” is a count of nodes of the first dependency relation graph that the node “P j ” is connected to, and “n” is a count of nodes in the first dependency relation graph; (h) ranking the applications of the first dependency relation graph according to the weight values; and (i) displaying application shortcut icons of the applications according to the rank on a display screen of the electronic device.