# US 8,151,217 B2 · System and method for dynamically displaying application shortcut icons of an electronic device > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 8,151,217 B2 - Document ID: US8151217B2 - Status: Granted - Kind: B2 - Application number: 12/510,169 - Filed: 2009-07-27 - Published: 2010-07-08 - Granted: 2012-04-03 - Earliest claimed: 2009-01-05 - Assignees: Chi Mei Communication Systems, Inc. - Inventors: Sheng-Feng Lin - Web page: https://patentgrep.com/patent/US8151217B2 ## CPC - G06F 9/451: Execution arrangements for user interfaces - G06F 11/3466: {Performance evaluation by tracing or monitoring} - G06F 2201/88: Monitoring involving counting - Y10S 715/977: Dynamic icon, e.g. animated or live action - G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N) - Y10S: TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS ## Abstract A method for dynamically displaying application shortcut icons of an electronic device constructs a dependency relation graph according to applications whose invoked frequency has reached a predetermined frequency value, and further according to browsing paths whose count has reached a predetermined dependency rule. The method further computes a weight value of each node in the dependency relation graph for ranking the applications to display application shortcut icons of the applications on the electronic device according to the rank. ## Claims ### Claim 1 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, “P1”, “P2”, . . . “Pj” are nodes of the first dependency relation graph that are connected to a node Pi of the first dependency relation graph, PR(Pj) is a weight value of the node “Pj” of the first dependency relation graph, “Outdegree(Pj)” is a count of nodes of the first dependency relation graph that the node “Pj” 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. ### Claim 2 (depends on 1) The method as described in claim 1, wherein the invoked frequency is updated by incrementing a value of the invoked frequency by one. ### Claim 3 (depends on 1) The method as described in claim 1, further comprising: constructing a second dependency relation graph according to the browsing paths which are only from the currently invoked application and whose count are equal to or more than the predetermined frequency value; and computing a weight value of each node in the second dependency relation graph. ### Claim 4 (depends on 1) The method as described in claim 1, wherein in block (h) the applications are ranked in a descending order according to the weight values. ### Claim 5 (depends on 1) The method as described in claim 1, the electronic device is a mobile phone, a computer, or a personal digital assistant. ### Claim 6 A storage device medium having stored thereon instructions that, when executed by a processor, causing the processor to perform a method for dynamically displaying application shortcut icons of an electronic device, the electronic device comprising a storage device storing applications, wherein the method comprises: (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 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 current 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 “P1”, “P2”, . . . “Pj” are nodes of the first dependency relation graph that are connected to a node Pi of the first dependency relation graph, PR(Pj) is a weight value of the node “Pj” of the first dependency relation graph “Outdegree(Pj)” is a count of nodes of the first dependency relation graph that the node “Pj” 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. ### Claim 7 (depends on 6) The storage device medium as described in claim 6, wherein the invoked frequency is updated by incrementing a value of the invoked frequency by one. ### Claim 8 (depends on 6) The storage device medium as described in claim 6, further comprising: constructing a second dependency relation graph according to the browsing paths which are only from the currently invoked application and whose count are equal to or more than the predetermined frequency value; and computing a weight value of each node in the second dependency relation graph. ### Claim 9 (depends on 6) The storage device medium as described in claim 6, wherein in block (h) the applications are ranked in a descending order according to the weight values. ### Claim 10 (depends on 6) The storage device medium as described in claim 6, wherein the electronic device is a mobile phone, a computer, or a personal digital assistant. ### Claim 11 A system for dynamically displaying application shortcut icons of an electronic device, the electronic device being installed with applications, the system comprising: a storage device; a parameter receiving module operable to receive 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; a detecting module operable to detect a currently invoked application, and identify a browsing path to the currently invoked application, and store the browsing path into the storage device; a frequency computing module operable to access an invoked frequency of the currently invoked application from the storage device, update the invoked frequency, and save the updated invoked frequency in the storage device; a storing module operable to store 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 equals or is more than the predetermined frequency value; a dependency relation graph constructing module operable to construct 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 current application is equal to or more than the dependency rule; a weight value computing module operable to compute 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, “P1”, “P2”, . . . “Pj” are nodes of the first dependency relation graph that are connected to a node Pi of the first dependency relation graph, PR(Pj) is a weight value of the node “Pj” of the first dependency relation graph, “Outdegree(Pj)” is a count of nodes of the first dependency relation graph that the node “Pj” is connected to and “n” is a count of nodes in the first dependency relation graph; a ranking module operable to rank the applications of the first dependency relation graph according to the weight values; and a displaying module operable to displays application shortcut icons of the applications according to the rank on a display screen of the electronic device. ### Claim 12 (depends on 11) The system as described in claim 11, wherein the frequency computing module updates the invoked frequency by incrementing a value of the invoked frequency by one. ### Claim 13 (depends on 11) The system as described in claim 11, wherein the dependency relation graph constructing module is further operable to construct a second dependency relation graph according to the browsing paths which are only from the currently invoked application and whose count are equal to or more than the predetermined frequency value. ### Claim 14 (depends on 13) The system as described in claim 13, wherein the weight value computing module is further operable to compute a weight value of each node in the second dependency relation graph. ### Claim 15 (depends on 11) The system as described in claim 11, wherein the ranking module ranks the applications in a descending order according to the weight values. ### Claim 16 (depends on 11) The system as described in claim 11, wherein the electronic device is a mobile phone, a computer, or a personal digital assistant. ### Claim 17 (depends on 11) The system as described in claim 11, wherein the storage device is a hard disk drive, a compact disk drive, or a floppy disk drive.