SEARCH ENGINE UTILIZING FLOW NETWORKS

• US 20110040740A1
• Filed: 08/02/2010
• Published: 02/17/2011
• Est. Priority Date: 08/15/2009
• Status: Abandoned Application

• Current Assignee: Knowm Tech LLC
• Original Assignee: Knowm Tech LLC
• Inventors: Nugent, Alex
• Application Number:
  US12/848,613
• Publication Number:
  US 20110040740A1
• Time in Patent Office: Days
• US Class Current: 707/706
• CPC Class Codes: G06F 16/338 Presentation of query results
• CPC Class Codes: G06F 16/951 Indexing; Web crawling techniques
• CPC Class Codes: G06F 16/9538 Presentation of query results

Abstract

A system and method for searching resources is disclosed. Each resource is associated with one or more pictograms. The pictorial questions (pictions) are created by searching a network of pictions and displaying associated pictograms. The selections of pictograms define a path of linked resources. The resource paths are computed as flows and used to update resource network connections. A user'"'"'s prior selection(s) of resources are used as flow sources for result ordering. The ratio of the number of times the pictogram was displayed versus the number of times it was clicked rates can be utilized as selection criteria in an evolutionary algorithm to optimize pictograms. The disclosed system and method can also display local goods and services through a kiosk.

Claims

1. A method of searching a network comprising a plurality of nodes interconnected via a link structure, said method comprising:

associating at least one pictogram with at least one node of said plurality of nodes;

searching said network such that a positive flow quantity and/or a negative flow quantity is propagated through at least one link of said link structure based upon a prior selection of said at least one pictograms; and

ordering said plurality of nodes based on a computed flow value resulting from propagation resulting from said positive flow quantity and/or said negative flow quantity.

2. The method of claim 1 further comprising decaying said positive flow quantity and/or said negative flow quantity as said positive flow quantity and/or said negative flow quantity propagates through said plurality of nodes.

3. The method of claim 1 further comprising utilizing a gaze tracking device to register selections of said at least one pictogram.

4. The method of claim 1 further comprising displaying said least one pictogram of said at least one node with a frequency based on a measured selection rate of said at least one pictogram.

5. A method of updating a link structure of a network, said method comprising:

recording a history of node selections to form a node path having nodes and links;

assigning a positive source flow and/or a negative source flow to target selected nodes of said node path;

computing steady state flow values through each link of said node path based on said positive source flow and/or said negative source flow; and

updating network links of said link structure of said network via said steady state flow values.

6. The method of claim 5 wherein each node of said node path leaks flow.

7. The method of claim 5 further comprising decaying each link of said link structure of said network.

8. The method of claim 5 further comprising utilizing a time interval to determine a value of said positive source flow and/or said negative source flow of said target selected nodes.

9. A system for searching a network comprising a plurality of nodes interconnected via a link structure, said system comprising:

a processor;

a data bus coupled to said processor; and

a computer-usable medium embodying computer code, said computer-usable medium being coupled to said data bus, said computer program code comprising instructions executable by said processor and configured for;

associating at least one pictogram with at least one node of said plurality of nodes;

searching said network such that a positive flow quantity and/or a negative flow quantity is propagated through at least one link of said link structure based upon a prior selection of said at least one pictograms; and

ordering said plurality of nodes based on a computed flow value resulting from propagation resulting from said positive flow quantity and/or said negative flow quantity.

10. The system of claim 9 wherein said instructions are further configured for decaying said positive flow quantity and/or said negative flow quantity as said positive flow quantity and/or said negative flow quantity propagates through said plurality of nodes.

11. The system of claim 9 wherein said instructions are further configured for utilizing a gaze tracking device to register selections of said at least one pictogram.

12. The system of claim 9 wherein said instructions are further configured for displaying said least one pictogram of said at least one node with a frequency based on a measured selection rate of said at least one pictogram.

13. The system of claim 9 wherein said instructions are further configured for:

decaying said positive flow quantity and/or said negative flow quantity as said positive flow quantity and/or said negative flow quantity propagates through said plurality of nodes; and

displaying said least one pictogram of said at least one node with a frequency based on a measured selection rate of said at least one pictogram.

14. The system of claim 9 wherein said instructions are further configured for:

utilizing a gaze tracking device to register selections of said at least one pictogram; and

displaying said least one pictogram of said at least one node with a frequency based on a measured selection rate of said at least one pictogram

15. The system of claim 9 wherein said instructions are further configured for:

utilizing a gaze tracking device to register selections of said at least one pictogram; and

decaying said positive flow quantity and/or said negative flow quantity as said positive flow quantity and/or said negative flow quantity propagates through said plurality of nodes.

16. A system for updating a link structure of a network, said system comprising:

a processor;

a data bus coupled to said processor; and

a computer-usable medium embodying computer code, said computer-usable medium being coupled to said data bus, said computer program code comprising instructions executable by said processor and configured for;

recording a history of node selections to form a node path having nodes and links;

assigning a positive source flow and/or a negative source flow to target selected nodes of said node path;

computing steady state flow values through each link of said node path based on said positive source flow and/or said negative source flow; and

updating network links of said link structure of said network via said steady state flow values.

17. The system of claim 16 wherein each node of said node path leaks flow.

18. The system of claim 16 wherein said instructions are further configured for decaying each link of said link structure of said network.

19. The system of claim 16 wherein said instructions are further configured for:

employing a time interval to determine a value of said positive source flow and/or said negative source flow of said target selected nodes.

20. The system of claim 16 wherein said instructions are further configured for:

decaying each link of said link structure of said network; and

employing a time interval to determine a value of said positive source flow and/or said negative source flow of said target selected nodes.