1. A group-based search engine for locating web pages, comprising:
a system for associating a user group with a web search; and
a search system for generating a list of search results ordered by a ranking in response to the web search, wherein the ranking is based on at least one nomination previously made by a member of the user group.
2. The group-based search engine of claim 1, further comprising a system for logging in as a member of the user group.
3. The group-based search engine of claim 2, further comprising a system for nominating a selected web page.
4. The group-based search engine of claim 3, wherein the nominating system causes the selected web page to have an increased priority in the ranking of future search results.
5. The group-based search engine of claim 3, wherein the nominating system causes the selected web page to be excluded from future search results.
6. The group-based search engine of claim 3, wherein the nominating system causes the selected web page to be listed in future search results for logged-in user group members only.
7. The group-based search engine of claim 1, further comprising a system for highlighting search results in the list that point to web pages recently visited by other user group members.
8. The group-based search engine of claim 2, further comprising a system for un-nominating a selected web page.
9. The group-based search engine of claim 1, further comprising a system for creating a new user group.
10. The group-based search engine of claim 1, further comprising a system for adding new members to the user group.
11. A program product stored on a recordable medium for interfacing with a search engine to return a list of search results, comprising:
means for registering with a group;
means for submitting a search string to the search engine;
means for viewing the list of search results based on a ranking, wherein any search result previously nominated by a group member as a high priority is ranked above un-nominated search results; and
means for nominating a current search result from the list of search results.
12. The program product of claim 11, wherein said means for nominating a current search result includes means for nominating the search result as a high priority.
13. The program product of claim 11, wherein said means for nominating a current search result includes means for excluding the current search result from a future list of search results.
14. The program product of claim 11, wherein said means for nominating a current search result includes means for identifying the current search result as available only to members of the group.
15. The program product of claim 11, further comprising means for interfacing with a plurality of search engines using a common set of group data, wherein the common set of group data includes registration and nomination information for the group.
16. The program product of claim 11, wherein the means for submitting a search string includes means for associating the search string with the group.
17. The program product of claim 11, wherein the means for viewing the list of search results includes means for viewing a highlighted search result, wherein the highlighted search result identifies a web page previously visited by a member of the group.
18. A search system for performing group-based searches, comprising:
a client system having a browser and a search engine plug-in, wherein the search engine plug-in allows group members to generate nomination data by nominating web pages; and
a server having a control program and a group structure for storing nomination data, wherein the control program generates a primary search result list based on a search index, and further refines the search result list based on the stored nomination data.
19. The search system of claim 18, wherein the plug-in causes a nominate button to be displayed with each web page displayed by the browser.
20. The search system of claim 18, wherein the nomination data includes selected web pages nominated as having a higher priority, and the control program refines the search result list by listing the selected web pages first.
21. The search system of claim 18, wherein the nomination data includes selected web pages nominated as excluded, and the control program refines the search result list by not listing the selected web pages.
22. The search system of claim 18, wherein the nomination data includes selected web pages nominated as private, and the control program refines the search result list by not listing the selected web pages for non-members.
23. The search system of claim 18, wherein the group structure further includes visitation data regarding which web pages group members visited.
24. The search system of claim 23, wherein the control program causes a result in the primary search result list to be highlighted based on the visitation data.
25. A method for performing a group-based search, comprising:
providing a browser and a search engine plug-in on a client system;
logging in as a member of a group using the browser;
submitting a search request to a search engine server;
searching a search index and returning a primary search result list; and
refining the primary search result list based on nomination data collected from members of the group.
26. The method of claim 25, further comprising:
nominating a web page at the client system;
transmitting nomination data to the search engine server; and
storing the nomination data in a group structure.
27. The method of claim 26, wherein nominating the web page includes indicating a higher priority for the web page and wherein refining the primary search result list includes listing the nominated web page with a higher priority.
28. The method of claim 26, wherein nominating the web page includes indicating the web page as excluded, and wherein refining the primary search result list includes excluding the web page from the primary search result list.
29. The method of claim 26, wherein nominating the web page includes indicating the web page as private, and wherein refining the primary search result list includes excluding the web page from the primary search result list for non-members.
30. The method of claim 25, further comprising the further steps of:
tracking web pages visited by group members; and
wherein the step of refining the primary search result list includes highlighting visited web pages.
The claims below are in addition to those above.
All refrences to claim(s) which appear below refer to the numbering after this setence.
1. A parallel residue operator to which input data divided into a plurality of subblocks is inputted in parallel, the parallel residue operator comprising:
a initial value generating section that generates partial residues matching head portions of the subblocks as initial values;
a partial residue generating section that receives the partial residues matching the heads of the subblocks from the initial value generating section as the initial values and sequentially generates a rest of partial residues according to a predetermined recurrence equation;
a logic section that calculates logical operations of the input data and values of partial residues outputted from the partial residue generating section; and
a cumulative adding section that cumulatively adds the values outputted from the logic section.
2. A parallel residue operator to which input data divided into a plurality of subblocks is inputted in parallel, the parallel residue operator comprising:
a initial value generating section that generates partial residues matching tail portions of the subblocks as initial values;
a reverse order partial residue generating section that receives the partial residues matching the tail portions of the subblocks from the initial value generating section as the initial values and sequentially generates a rest of partial residues according to a predetermined recurrence equation;
a logic section that calculates logical operations of the input data and values of reverse order partial residues outputted from the reverse order partial residue generating section; and
a cumulative adding section that cumulatively adds the values outputted from the logic section.
3. The parallel residue operator according to claim 1, wherein, when input data of a length n is divided into data sequences of lengths n-m and m and the individual divided data sequences are made the subblocks, the initial value generating section generates as the initial values Dn\u22121+c mod G(D) and Dn\u2212l+c\u2212m mod G(D), which are partial residues at head portions of subblocks of i=0 and m, according to a value of a polynomial G(D) determined by a maximum order c.
4. The parallel residue operator according to claim 2, wherein, when input data of a length n is divided into data sequences of lengths n-m and m and the individual divided data sequences are made the subblocks, the initial value generating section generates as the initial values Dn\u22121+c\u2212(m\u22121) mod G(D) and Dn\u22121+c\u2212(n\u22121) mod G(D), which are partial residues at tail portions of subblocks of i=m\u22121 and n\u22121, according to a value of a polynomial G(D) determined by a maximum order c.
5. The parallel residue operator according to claim 1, wherein the partial residue generating section receives as input data according to an original data order, and calculates partial residues matching i=1 to m\u22121 and i=m+1 to n\u22121 according to a predetermined recurrence equation using Dn\u22121+c mod G(D) and Dn\u22121+c\u2212m mod G(D) as the initial values.
6. The parallel residue operator according to claim 2, wherein the reverse order partial residue generating section receives as input data in a reverse order of an original data order, and calculates reverse order partial residues matching i=m\u22122 to 0 and i=n\u22122 to m according to a predetermined recurrence equation using Dn\u22121+c\u2212(m\u22121) mod G(D) and Dn\u22121+c\u2212(n\u22121) mod G(D) as the initial values.
7. The parallel residue operator according to claim 1, wherein the cumulative adding section adds a bitwise exclusive disjunction.
8. A parallel residue operation method comprising steps of:
when input data of a length n is divided into data sequences of lengths n-m and m and the individual divided data sequences are made subblocks, calculating in advance as initial values Dn\u22121+c mod G(D) and Dn\u22121+c\u2212m mod G(D), which are partial residues at head portions of subblocks of i=0 and m, according to a value of a polynomial G(D) determined by a maximum order c; and
sequentially calculating partial residues matching i=1 to m\u22121 and i=m+1 to n\u22121 using Dn\u22121+c mod G(D) and Dn\u22121+c\u2212m mod G(D) as the initial values.
9. The parallel residue operation method comprising steps of:
when input data of a length n is divided into data sequences of lengths n-m and m and the individual divided data sequences are made the subblocks, calculating in advance as initial values Dn\u22121+c\u2212(m\u22121) mod G(D) and Dn\u22121+c\u2212(n\u22121) mod G(D), which are partial residues at tail portions of subblocks of i=m\u22121 and n\u22121, according to a value of a polynomial G(D) determined by a maximum order c; and
sequentially calculating reverse order partial residues matching i=m\u22122 to 0 and i=n\u22122 to m using Dn\u22121+c\u2212(m\u22121) mod G(D) and Dn\u22121+c\u2212(n\u22121) mod G(D) as the initial values.
10. The parallel residue operation method according to claim 8, wherein, in the step of calculating the partial residues:
data is inputted according to an original data order; and
the partial residues matching i=1 to m\u22121 and i=m+1 to n\u22121 are calculated according to a predetermined recurrence equation using Dn\u22121+c mod G(D) and Dn\u22121+c\u2212m mod G(D) as the initial values.
11. The parallel residue operation method according to claim 9, wherein, in the step of calculating the reverse order partial residues:
data is inputted in a reverse order of an original data order; and
the partial residues matching i=m\u22122 to 0 and i=n\u22122 to m are calculated according to a predetermined recurrence equation using Dn\u22121+c\u2212(m\u22121)(D) and Dn\u22121+c\u2212(n\u22121) mod G(D) as the initial values.
12. The parallel residue operation method according to claim 8, further comprising steps of:
calculating a logic of input data and values of the partial residues; and
cumulatively adding the values for which the logic is calculated.
13. The parallel residue operation method according to claim 9, further comprising steps of:
calculating a logic of input data and values of the reverse order partial residues; and
cumulatively adding the values for which the logic is calculated.