Abstract:
A computer-implemented method is provided for ranking files from an Internet search. In one embodiment, the method comprises sorting search result items based on a first clickthru popularity and a second clickthru popularity. The first clickthru popularity may be derived from clickthrus that occurred during a first time period. The second clickthru popularity may be derived from clickthrus that occurred during a second time period that is different from the first time period.

Description:
CROSS-REFERENCE TO RELATED APPLICATIONS 
     This application is a continuation of U.S. patent application Ser. No. 12/020,983, filed Jan. 28, 2008; which is a continuation of U.S. patent application Ser. No. 11/286,268, filed Nov. 22, 2005, now U.S. Pat. No. 7,370,381; which claims priority to U.S. Provisional Application Ser. No. 60/630,552 filed on Nov. 22, 2004, each of these applications are fully incorporated herein by reference for all purposes. 
    
    
     BACKGROUND 
     1. Technical Field 
     The technical field relates to a scheme for ranking results, and more specifically, to a rating scheme to rank video search results by a number of factors. 
     2. Background Art 
     Standard web crawlers were originally designed for web pages where the bulk of useful information about the page was contained in an HTML text file. In web pages today, it is increasingly common for the useful information about the page to be contained in a variety of different files, which are all assembled in the browser to create the complete application. Because of this, standard web crawlers are unable to find much of the multimedia and video content available on modern web pages. 
     Even for the video content that is found by standard web crawlers, the result of the search often provides video content that may be out-of-date, poor quality, or not relevant to a search query from a user. Traditional search engines lack the ability to efficiently and more accurately organize these search results. There is a need for improved techniques for organizing the results from such searches to provide higher accuracy and greater ease of use for the user. 
     SUMMARY 
     The present invention provides solutions for at least some of the drawbacks discussed above. Specifically, some embodiments of the present invention provide a Ranking Engine that is a rating scheme used in the Truveo Search Engine to rank video search results by factors such as, but not limited to, popularity, timeliness and/or user preferences. It enables the Truveo Search Engine to provide highly targeted search results to users. It is designed to operate effectively in the absence of any user input, however, it uses any provided user input to improve the accuracy of the search results. In one aspect, the present invention provides memory-based reasoning algorithms to ensure highly accurate search results with minimal user input. Extensive metadata enables advanced parametric search when desired. At least some of these and other objectives described herein will be met by embodiments of the present invention. 
     In one embodiment of the present invention, a computer-implemented method is provided for a ranking engine. The method comprises assigning a score to each file or record based on at least the following factors: recency, editorial popularity, and clickthru popularity. The files are organized based on the assigned scores. 
     In another embodiment of the present invention, a computer-implemented method is provided for a ranking engine. The method comprises assigning a score to each file or record based on at least the following factors: recency, editorial popularity, clickthru popularity, favorites metadata, and favorites collaborative filtering. The files are organized based on the assigned scores. 
     In yet another embodiment of the present invention, a computer system is provided that comprises of a ranking engine having programming code for displaying results of a search query based on scores, wherein the scores for files found in the search are based on at least the following factors: recency, editorial popularity, and clickthru popularity. 
     In a still further embodiment of the present invention, a computer system is provided that comprises of a ranking engine having programming code for displaying results of a search query based on scores, wherein the scores for files found in the search are based on at least the following factors: recency, editorial popularity, popularity, favorites metadata, and favorites collaborative filtering. 
     The files may be media files, video files, video streams, or the like. The editorial popularity may be weighted between 1 and 0 and is based on at least one of the following: Neilsen ratings, known brand names, website popularity (e.g. Alexa ranking), or the judgment of a professional or corporation with expertise in online media. In one embodiment, the weighting of favorites metadata is R md =0 if no matches are found or 1 if a keyword field in the metadata of the file matches any favorite titles in a user&#39;s favorite titles file, any favorite people in a user&#39;s favorite people file, or any keyword in a user&#39;s favorite keywords file. 
     In yet another embodiment of the present invention, a computer-implemented method is provided for organizing a collection of files from an Internet search. The method comprises assigning a score to each file based on favorites collaborative filtering W cf R cf  and at least one of the following factors: recency W r R r , editorial popularity W e R e , clickthru popularity W c R c , and favorites metadata W md R md . The files are organized based on the assigned scores. 
     In yet another embodiment of the present invention, a computer system is provided that comprises of a ranking engine having programming code for displaying results of a search query based on scores, wherein the scores for files found in the search are based on favorites collaborative filtering W cf R cf  and at least one of the following factors: recency W f R f , editorial popularity W e R e , clickthru popularity W c R c , and favorites metadata W md R md . 
     For any of the embodiments herein, the files may be media files, video files, video streams, or the like. Optionally, the editorial popularity may be weighted between 1 and 0 and is based on at least one of the following: Neilsen ratings, known brand names, website popularity (e.g. Alexa ranking), or the judgment of a professional or corporation with expertise in online media. In one embodiment, the weighting of favorites metadata is R md =0 if no matches are found or 1 if a keyword field in the metadata of the file matches any favorite titles in a user&#39;s favorite titles file, any favorite people in a user&#39;s favorite people file, or any keyword in a user&#39;s favorite keywords file. 
     A further understanding of the nature and advantages of the invention will become apparent by reference to the remaining portions of the specification and-drawings. 
    
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
         FIG. 1  shows a schematic of one embodiment of the present invention. 
         FIG. 2  is a graph showing variables plotted for recency ranking according to the present invention. 
         FIG. 3  is a graph showing the relationship of similarity and popularity weighting according to the present invention. 
         FIG. 4  shows one embodiment of a display showing results from a search query. 
         FIG. 5  shows one embodiment of a user interface according to the present invention. 
     
    
    
     DETAILED DESCRIPTION 
     It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the invention, as claimed. It may be noted that, as used in the specification and the appended claims, the singular forms “a”, “an” and “the” include plural referents unless the context clearly dictates otherwise. Thus, for example, reference to “a crawler” may include multiple crawlers, and the like. References cited herein are hereby incorporated by reference in their entirety, except to the extent that they conflict with teachings explicitly set forth in this specification. 
     Referring now to  FIG. 1 , a schematic is shown of the Truveo Search Engine which is configured for use with the present ranking scheme. As seen in  FIG. 1 , the search engine may include a recommendation engine  10 . The engine  10  may use reasoning algorithms to provide highly accurate search results with minimal user input. In one embodiment, the recommendation engine may use a ranking scheme as set forth below. 
     Truveo Ranking Scheme: 
                                
where: 0&lt;R i &lt;1
     and: 1=W r +W e +W c +W md +W cf                 0&lt;R T &lt;1   Term 1: Recency Ranking:   

               R   r     ⁢     {             1   -       1     t   e       ⁢     (       d   c     -     d   F       )         ,             For   ⁢           ⁢     (       d   c     -     d   F       )       &lt;     t   e                 0   ,             For   ⁢           ⁢     (       d   c     -     d   F       )       &gt;     t   e                     
where:
     t e =expiration time (perhaps ˜30 days)   d c =current date   d F =date found   This yields the relationship as shown in  FIG. 2 .
 
Term 2: Editorial Popularity Ranking:
   

     Each database entry (e.g., item) is assigned a value for ‘EDITORIAL_RANK’, based on how popular the content is expected to be. This could be based on expected viewership for known brand names, previous Neilsen ratings, etc. The most popular content should approach R e =1. Unknown or unpopular content should approach R e =0. Optionally, the editorial popularity rank may also have a time decay component to give weight or more weight to more recent popularity information. 
     Term 3: Clickthru Popularity Ranking: 
     
       
         
           
             
               R 
               c 
             
             = 
             
               
                 
                   W 
                   cpm 
                 
                 ⁢ 
                 
                   R 
                   cpm 
                 
               
               + 
               
                 
                   W 
                   cph 
                 
                 ⁢ 
                 
                   R 
                   cph 
                 
               
               + 
               
                 
                   W 
                   cpd 
                 
                 ⁢ 
                 
                   R 
                   cpd 
                 
                 ⁢ 
                 
                     
                 
                 ⁢ 
                 where 
                 ⁢ 
                 
                   : 
                 
               
             
           
         
       
       
         
           
             
               R 
               cpm 
             
             = 
             
               
                 clicks 
                 ⁢ 
                 
                     
                 
                 ⁢ 
                 per 
                 ⁢ 
                 
                     
                 
                 ⁢ 
                 minutes 
                 ⁢ 
                 
                     
                 
                 ⁢ 
                 ranking 
               
               = 
               
                 
                   
                     
                       C 
                       ⁢ 
                       
                           
                       
                       ⁢ 
                       P 
                       ⁢ 
                       
                           
                       
                       ⁢ 
                       M 
                     
                     
                       Max 
                       ⁡ 
                       
                         ( 
                         cpm 
                         ) 
                       
                     
                   
                   , 
                   
                     ( 
                     
                       0 
                       &lt; 
                       
                         R 
                         cpm 
                       
                       &lt; 
                       1 
                     
                     ) 
                   
                 
                 
                   over 
                   ⁢ 
                   
                       
                   
                   ⁢ 
                   all 
                   ⁢ 
                   
                       
                   
                   ⁢ 
                   items 
                 
               
             
           
         
       
       
         
           
             
               
                 R 
                 cph 
               
               = 
               
                 
                   clicks 
                   ⁢ 
                   
                       
                   
                   ⁢ 
                   per 
                   ⁢ 
                   
                       
                   
                   ⁢ 
                   hour 
                   ⁢ 
                   
                       
                   
                   ⁢ 
                   ranking 
                 
                 = 
                 
                   
                     
                       C 
                       ⁢ 
                       
                           
                       
                       ⁢ 
                       P 
                       ⁢ 
                       
                           
                       
                       ⁢ 
                       H 
                     
                     
                       Max 
                       ⁡ 
                       
                         ( 
                         cph 
                         ) 
                       
                     
                   
                   
                     over 
                     ⁢ 
                     
                         
                     
                     ⁢ 
                     all 
                     ⁢ 
                     
                         
                     
                     ⁢ 
                     items 
                   
                 
               
             
             , 
             
               ( 
               
                 0 
                 &lt; 
                 
                   R 
                   cph 
                 
                 &lt; 
                 1 
               
               ) 
             
           
         
       
       
         
           
             
               R 
               cpd 
             
             = 
             
               
                 clicks 
                 ⁢ 
                 
                     
                 
                 ⁢ 
                 per 
                 ⁢ 
                 
                     
                 
                 ⁢ 
                 day 
                 ⁢ 
                 
                     
                 
                 ⁢ 
                 ranking 
               
               = 
               
                 
                   
                     
                       
                         C 
                         ⁢ 
                         
                             
                         
                         ⁢ 
                         P 
                         ⁢ 
                         
                             
                         
                         ⁢ 
                         D 
                       
                       
                         Max 
                         ⁡ 
                         
                           ( 
                           cpd 
                           ) 
                         
                       
                     
                     , 
                     
                       ( 
                       
                         0 
                         &lt; 
                         
                           R 
                           cpd 
                         
                         &lt; 
                         1 
                       
                       ) 
                     
                   
                   
                     over 
                     ⁢ 
                     
                         
                     
                     ⁢ 
                     all 
                     ⁢ 
                     
                         
                     
                     ⁢ 
                     items 
                   
                 
                 ⁢ 
                 
                     
                 
                 ⁢ 
                 and 
               
             
           
         
       
       
         
           
             1 
             = 
             
               
                 W 
                 cpm 
               
               + 
               
                 W 
                 cph 
               
               + 
               
                 
                   W 
                   cpd 
                 
                 . 
               
             
           
         
       
     
     To implement the clickthru popularity rating, the following fields need to be added to the video data table: 
     
       
         
               
               
             
           
               
                   
               
             
             
               
                 TOTAL_CLICKS = 
                 the running tally of clicks that this 
               
               
                   
                 item has seen since DATE_FOUND 
               
               
                 CPM = 
                 clicks per minute 
               
               
                 CPM_COUNTER_BUFFER = 
                 running tally of clicks on this item since 
               
               
                   
                 CPM_LAST_CALC 
               
               
                 CPM_LAST_CALC = 
                 the time when CPM was last calculated 
               
               
                   
                 and CPM_COUNT_BUFFER was 
               
               
                   
                 flushed 
               
               
                   
               
             
          
         
       
     
     Similarly: CPH, CPH_COUNT_BUFFER, CPH_LAST_CALL for clicks-per-hour, and CPD, CPD_COUNT_BUFFER, CPD_LAST_CALC for clicks-per-day. 
     These fields can be calculated and update as follows: 
     For every user with cookies enabled, each clicked item is stored anonymously in a cookie. Upon a subsequent request to the Truveo search engine (during that same session), the clickthru data in the cookie is processed as follows: 
     For every item clicked, increment TOTAL_CLICKS, CPM_COUNT_BUFFER, CPH_COUNT_BUFFER, and CPD_COUNT_BUFFER by 1. 
     
         
         For CPM, if CURRENT_TIME−CPM_LAST_CALL&gt;1 minute, 
         CPM=CPM_COUNT_BUFFER/(CURRENT_TIME−CPM_LAST_CALC) 
         reset CPM_COUNT_BUFFER to 0 
         set CPM_LAST_CALC to CURRENT_TIME 
         Similarly for CPD and CPH 
       
    
     Once this is complete, the user&#39;s browser cookie may be flushed to eliminate all cached clickthrus. 
     Term 4: Favorites Metadata Ranking: 
     Note that if the user has not registered for an account, this Ranking, R md , is zero. 
     If the user does have a valid account, R md  will be determined as follows: User FAVORITES METADATA is stored in 3 database tables: FAVORITE_TITLES, FAVORITE_PEOPLE, FAVORITE_KEYWORDS. 
     For a Given Video Data Item: 
     If any entry in FAVORITE_TITLES matches any part of the TITLE field or the KEYWORDS Field, R md =1. 
     —OR— 
     If any entry in the FAVORITE_PEOPLE table matches any part of any of the fields: ACTOR, DIRECTOR, KEYWORDS, PRODUCER, WRITER, LONG_DESCRIPTION, SHORT_DESCRIPTION, R md =1 
     —OR— 
     If any entry in the FAVORITE_KEYWORDS table matches any part of any of the fields: ACTOR, CATEGORY, DIRECTOR, GENRE, HOST_SITE_NAME, HOST_SITE_URL, KEYWORDS, LONG_DESCRIPTION, SHORT_DESCRIPTION, PRODUCER, TITLE, WRITER, R md =1. 
     
       
         
           
             Otherwise 
             , 
             
               
                 R 
                 md 
               
               = 
               0 
             
           
         
       
       
         
           
             
               Therefore 
               ⁢ 
               
                 : 
               
               ⁢ 
               
                   
               
               ⁢ 
               
                 R 
                 md 
               
             
             = 
             
               { 
               
                 
                   
                     
                       0 
                       , 
                     
                   
                   
                     
                       if 
                       ⁢ 
                       
                           
                       
                       ⁢ 
                       no 
                       ⁢ 
                       
                           
                       
                       ⁢ 
                       metadata 
                       ⁢ 
                       
                           
                       
                       ⁢ 
                       match 
                     
                   
                 
                 
                   
                     
                       1 
                       , 
                     
                   
                   
                     
                       if 
                       ⁢ 
                       
                           
                       
                       ⁢ 
                       metadata 
                       ⁢ 
                       
                           
                       
                       ⁢ 
                       match 
                     
                   
                 
               
             
           
         
       
     
     Note: Be sure to Filter matches on trivial metadata entries like single characters, articles or whitespace characters. 
     A user&#39;s favorites may be determined by, but not limited to, providing a mechanism for the user to indicate their favorite videos, recording the video items they select to view (e.g. through the use of cookies), or by recording the video items they choose to forward via e-mail to other people. The FAVORITE_TITLE, FAVORITE_PEOPLE, and FAVORITE_KEYWORDS tables are populated for the user by extracting the appropriate meta data from the video record of the indicated favorite video. 
     Optionally, embodiments of the present application may also include the use of a unique cookie to identify an anonymous user as a substitute for a user account. 
     Term 5: Favorites Collaborative Filtering Ranking: 
     A listing of the Favorite Items (video data records) for each user is stored in the database table FAVORITE_ITEMS. 
     Note that, if the user has not registered for an account, this ranking, R cf , is zero. 
     If the user does have a valid account, R cf  is determined as follows: 
     First, calculate the distance between user i and all other users, j: 
               D     i   ,   j       =         distance   ⁢           ⁢   between   ⁢           ⁢   user   ⁢           ⁢   i     +   j     =           n   i     -     n     i   ,   j           n   i       =     1   -       n     i   ,   j         n   i                   
where n i  is the number of Favorite items user i has stored, and n i,j  is the number of user i&#39;s Favorites that match Favorites of user j.
 
     Note that if all of user i&#39;s Favorites match a Favorite of user j, then D i,j =0. If none match, D i,j =1. 
     Similarly, a measure of the similarity between user i and j can be calculated as follows:
 
 S   i,j =similarity between users  i  and  j =(1 −D   i,j =
 
     Note: S i,j =1 when the users are completely similar, and 0 when there are no similar Favorites between users. 
     We can now select the K-Nearest Neighbors to user i based on the similarity ranking. For example, assuming user i has three Favorite items: 
     For: User i 
     Favorites: ITEMID=103 ITEMID=107 ITEMID=112             n i =3
     K-Nearest Neighbors can be selected as follows: 
                                                                               User ID                           (j)   n i,j     D i,j     S i,j     Favorite Items ID                                    1   1   0.66   0.33   101, 102, 103, 110           2   2   0.33   0.66   103, 104, 105, 106, 107           3   0   1   0   101           4   3   0   1   103, 104, 107, 112           5   2   0.33   0.66   106, 107, 109, 110, 111,                           112           6   1   0.66   0.33   103, 104                    
Reranking the Users by Decreasing Similarity:
 
     
       
         
               
               
               
               
             
               
               
               
               
               
             
           
               
                   
               
               
                   
                   
                   
                 Favorite Items Not Already 
               
               
                   
                 User ID 
                 S i,j   
                 Stored by User i 
               
               
                   
               
             
             
               
                   
               
             
          
           
               
                   
                   
                 4 
                 1 
                 104 
               
               
                 K-Nearest Neighbors, 
                   
                 2 
                 0.66 
                 104, 105, 106 
               
               
                 where K = 4 
                  {open oversize brace}  
                 5 
                 0.66 
                 106, 109, 110, 111 
               
               
                   
                   
                 1 
                 0.33 
                 101, 102, 110 
               
               
                   
                   
                 6 
                 0.33 
                 104 
               
               
                   
                   
                 3 
                 0 
                 101 
               
               
                   
               
             
          
         
       
     
     From this ordered list, the K-Nearest Neighbors are the first K items. 
     From the K-Nearest Neighbors, we can also determine a popularity rating for each new Favorite item. This can be calculated from the fraction of the K neighbors that have item l in their Favorites list. 
     Specifically: 
     
       
         
               
             
           
               
                   
               
             
             
               
                 
                   
                             
                     
                         
                         
                     
                   
                 
               
               
                   
               
             
          
         
       
     
     Therefore, 
     
       
         
               
               
               
               
               
             
               
               
               
               
               
             
           
               
                   
               
               
                   
                   
                 Users with 
                   
                   
               
               
                   
                 Item ID 
                 This Item 
                 P 1   
                 S max, l   
               
               
                   
               
             
             
               
                   
               
             
          
           
               
                   
                 104 
                 4, 2, 1 
                 0.75 
                 1 
               
               
                   
                 106 
                 2, 5 
                 0.5 
                 0.66 
               
               
                   
                 110 
                 5, 1 
                 0.5 
                 0.66 
               
               
                   
                 105 
                 2 
                 0.25 
                 0.66 
               
               
                   
                 109 
                 5 
                 0.25 
                 0.66 
               
               
                   
                 111 
                 5 
                 0.25 
                 0.66 
               
               
                   
                 101 
                 1 
                 0.25 
                 0.33 
               
               
                   
                 102 
                 1 
                 0.25 
                 0.33 
               
               
                   
               
             
          
         
       
     
     Where: S max,l =Maximum similarity across all users with item l in their Favorites list 
     Note: Popularity=1 when all KNN contain item l, and P 1 =0 when no KNN contain item l. 
     Now, we can determine a ranking for every new item in the K-Nearest Neighbors list: 
     For a Given Item l:
 
 R   cf,l   =W   sim ( S   max,l )+(1 −W   sim ) P   l ,
 
where:
     W sim =similarity weighting factor   

               =       C     max   ⁢           ⁢   sim       ⁡     (     1   -     1     1   +     n   i           )         ,         
where:
     0≦C max sim ≦1   

     In other words, R cf  is a weighted sum of the maximum user similarity for item l and the popularity of item l among KNN such that 0≦R cf ≦1. 
     The weighting factor is calculated as a function of n, since the relative importance of user similarity, as compared to popularity, increases with the number of specified Favorite items. In other words, if a user has only specified one Favorite item, n i =1, then the similarity will be either 0 or 1, and therefore it does not have much meaning. Therefore, when n i  is small, similarity should be weighed less than popularity. 
     C max sim  should be set to the value that the similarity weighting factor should approach as n i  becomes large. A good range is probably 0.3≦C max sim ≦0.8. 
     More specifically, the relationship of the similarity and popularity weighting coefficients can be plotted as shown in  FIG. 3 . 
     Now, for each new item in KNN, we can calculate the Rank R cf : 
     
       
         
               
               
               
               
               
               
             
               
               
               
               
               
               
             
           
               
                   
               
               
                   
                 Item ID 
                 P 1   
                 S max, l   
                 R cf, 1   
                   
               
               
                   
               
             
             
               
                   
               
             
          
           
               
                   
                 104 
                 0.75 
                 1 
                 0.86 
                 Assume C max sim  = 0.6. 
               
               
                   
                 106 
                 0.5 
                 0.66 
                 0.57 
                 For n i  = 3: 
               
               
                   
                 110 
                 0.5 
                 0.66 
                 0.57 
                             W sim  = 0.45 
               
               
                   
                 105 
                 0.25 
                 0.66 
                 0.43 
                   
               
               
                   
                 109 
                 0.25 
                 0.66 
                 0.43 
                   
               
               
                   
                 111 
                 0.25 
                 0.66 
                 0.43 
                   
               
               
                   
                 101 
                 0.25 
                 0.33 
                 0.29 
                   
               
               
                   
                 102 
                 0.25 
                 0.33 
                 0.29 
               
               
                   
               
               
                 Note: 
               
               
                 R cf  is always between 0 and 1 
               
               
                 If the maximum similarity to user i for item l is 1, and item l is a Favorite of all 
               
               
                 KNN users, R cf  = 1 
               
             
          
         
       
     
     The popularity will never be below 1/KNN, but the similarity can be zero. As a result, R cf  will never be 0 unless C max sim =1 and n i             ∞.
     Optionally, embodiments of the present invention may also include a factor for crawl quality in the ranking of search results. By way of non limiting example, Application Crawler results are ranked higher than RSS feed results and RSS feed results higher than results from a generic web crawler. 
     Referring now to  FIG. 4 , one embodiment of a user interface for presenting the search results is shown. As seen in  FIG. 4 , the results may display description of the video content, length of video, time the video was posted, title, website origin, video type, and/or video quality. 
     Referring now to  FIG. 5 , another embodiment of a user interface is shown. This intuitive Media Center user interface may be used to bring web video to a television and other non-PC video devices. In one embodiment, the present invention provides TiVo style recommendations as well as keyword queries. As seen in  FIG. 1 , the television interface (or Media Center interface) shown in  FIG. 5  may access the results from the ranking engine and application crawler. Again, video quality, bit rate, description, and other information may be displayed. Videos may also be categorized based on categories such as, but not limited to, news, sports, movies, and other subjects. 
     While the invention has been described and illustrated with reference to certain particular embodiments thereof, those skilled in the art will appreciate that various adaptations, changes, modifications, substitutions, deletions, or additions of procedures and protocols may be made without departing from the spirit and scope of the invention. For example, with any of the above embodiments, the recommendation may use a ranking scheme having only a subset of the ranking terms set forth in the formula. By way of example and not limitation, some embodiments may not include Term 5, the Favorites Collaborative Filtering Ranking. In other embodiments, variations may be made to the present embodiment such as but not limited to computing the ranking terms in a different order or the like. It should be understood that the present ranking scheme is not limited to video files and may be used to rank or organize other types of files. It should be understood that the term “files” as in “video files” may include the delivery of the content of the file in the form of a stream from a server (i.e. a media server). 
     The publications discussed or cited herein are provided solely for their disclosure prior to the filing date of the present application. Nothing herein is to be construed as an admission that the present invention is not entitled to antedate such publication by virtue of prior invention. Further, the dates of publication provided may be different from the actual publication dates which may need to be independently confirmed. U.S. Provisional Application Ser. No. 60/630,552 filed Nov. 22, 2004 and U.S. Provisional Application Ser. No. 60/630,423 filed Nov. 22, 2004, are fully incorporated herein by reference for all purposes. All publications mentioned herein are incorporated herein by reference to disclose and describe the structures and/or methods in connection with which the publications are cited. 
     Expected variations or differences in the results are contemplated in accordance with the objects and practices of the present invention. It is intended, therefore, that the invention be defined by the scope of the claims which follow and that such claims be interpreted as broadly as is reasonable.