Aggregation of highlights

Information

  • Patent Grant
  • 9087032
  • Patent Number
    9,087,032
  • Date Filed
    Monday, January 26, 2009
    15 years ago
  • Date Issued
    Tuesday, July 21, 2015
    9 years ago
Abstract
Highlights from a community of users highlighting portions of an electronic digital work may produce aggregated highlights. Users may have access to public and purchase versions of the aggregated highlights. Reconciliation of highlights across multiple versions of the same digital work may also take place, with the reconciled highlights incorporated into the aggregated highlights.
Description
BACKGROUND

Electronic devices such as electronic book readers (“e-book readers”), cellular telephones, personal digital assistant (PDA), portable media players, tablet computers, netbooks, and the like, may display digital works such as electronic books or other electronic media content to a user. Users may include purchasers of the electronic media, prospective purchasers of the electronic media, or other consumers, for example, library patrons. As the quantity of available electronic media content continues grow, filtering of and providing access to portions of electronic media content considered relevant to users and communities of users has become more desirable. Such access may function as a community-driven reputation system for passages in the work, and may render information more easily accessible and further encourage sales of electronic media content.





BRIEF DESCRIPTION OF THE DRAWINGS

The detailed description is set forth with reference to the accompanying figures. In the figures, the left-most digit(s) of a reference number identifies the figure in which the reference number first appears. The use of the same reference numbers in different figures indicates similar or identical items.



FIG. 1 is a schematic diagram of an illustrative network incorporating aggregated highlighting to provide public and purchased versions of highlights to users.



FIG. 2 is a schematic diagram of an illustrative aggregated highlighting environment.



FIG. 3 is a schematic diagram of users contributing highlights from different versions or editions of the same digital work to a highlight database.



FIG. 4 is a flow diagram of an illustrative process of selecting highlights from a highlight database.



FIG. 5 is a schematic diagram depicting illustrative highlight selection rules.



FIG. 6 is a chart depicting initial portions of selection of highlight intervals using a simple elimination process.



FIG. 7 is a chart depicting a remaining portion of selection of highlight intervals using the simple elimination process of FIG. 6



FIG. 8 is a chart depicting initial portions of selection of highlight intervals using a truncation elimination process.



FIG. 9 is a chart depicting a remaining portion of selection of highlight intervals using the truncation elimination process of FIG. 8.



FIG. 10 is a chart depicting selection of highlight intervals using an elementary interval accretion.



FIG. 11 is a chart depicting initial portions of selection of highlight intervals using an elimination/elementary interval hybrid.



FIG. 12 is a chart depicting additional portions of the selection of highlight intervals using the elimination/elementary interval hybrid of FIG. 11.



FIG. 13 is a chart depicting a remaining portion of selection of highlight intervals using the elimination/elementary interval hybrid of FIG. 11.



FIG. 14 is a flow diagram of an illustrative process of creating a public version of highlights from a highlight database.



FIG. 15 is a flow diagram of an illustrative process of creating a purchase version of highlights from a highlight database.



FIG. 16 depicts an illustrative browser interface showing highlights in an electronic book.



FIG. 17 depicts an illustrative highlight user interface while viewing text in an electronic book.



FIG. 18 depicts the illustrative highlight user interface of FIG. 17, while viewing another highlighted passage.





DETAILED DESCRIPTION

As described above, as the quantity of digital works has grown, providing access to portions of electronic media content considered relevant to users has become more difficult. Facilitating such access for users may render information more easily accessible and further encourage sales of and use of a digital work.


This disclosure describes aggregation of highlights, in which commonly highlighted sections of digital works are identified and may be made available to the public and/or purchasers of the digital work. Users comprising a “community” may highlight a digital work. The community may also comprise those who view but do not create highlights. “Highlighting,” as used herein, is the selection of a portion of a digital work, considered to be of interest or relevance by a user. Highlights may either be made by a user selected portion, automatically by monitoring usage characteristics such as dwell time on a portion, physical highlights taken from a scanned physical document, etc. Highlights taken from scanned physical documents may be characterized by the nature of the highlight, i.e., different color highlights or underlining of a passage. These different characteristics of highlights in physical documents may be determined to represent different levels of importance, different individual highlighters, or a combination of these. Highlights from multiple users may be aggregated, leading to a “Wisdom of Crowds” effect where a selection of highlights by many may be more relevant or useful than highlights selected by a small number of users.


In one example, a server receives and consolidates these highlights. Minimum and/or maximum lengths for individual highlights or other thresholds may be pre-determined or dynamically adjusted. For example, non-fiction programming books might have a minimum highlight length greater than that of a fiction work. Thresholds may also be determined on the fly, taking into account some book-specific heuristics. For example, a book with a low Flesch-Kincaid readability score may have a minimum highlight length set lower than one a work with a high Flesch-Kincaid readability score. Where multiple versions or editions of a book are highlighted, highlights may be synchronized across versions. The server then determines the most commonly highlighted sections of the digital work and selects aggregated highlights corresponding to those sections according to one or more selection rules. The server may create a public version of aggregated highlights for a digital work and/or a purchase version. For example, the purchase version may be available for some remuneration, and provide more extensive or lengthy highlights than the public version. For instance, prospective customers or current licensees of a digital work may view the public version of the aggregated highlights to determine if a digital work is indeed what they wish to purchase. Likewise, a user with a license to consume a digital work may purchase the aggregated highlights. To protect rights of a digital work's owner, a maximum threshold for the quantity of a digital work displayed as aggregated highlights may be limited.


Once collected, a highlight user interface (HUI) may visually present aggregated highlights to a user on an electronic device. The HUI may indicate aggregated highlights and their relative ranking, for example, using different colors and/or intensities of color. Highlights may be displayed as a graph, with the relative height of each bar indicating a frequency for each elementary interval in the digital work. For example, the graph may be bar, line, or histogram style. A user may navigate through the digital work by selecting aggregated highlights presented in the HUI. In addition to the aggregated highlights, the HUI may present highlights entered by the user of the electronic device. The HUI could also present highlights entered by other users who have either have a particular role or significance (e.g., the author) or who have a particular relationship to the user. Statistics comparing the user's highlights with those of other users or communities may also be presented. For example, a user may see that a portion they have highlighted was also highlighted by 80% of the members of a community.


While aggregated highlighting is described in the context of highlighting textual content, the concepts described herein are also applicable to highlighting of sections of other digital works, such as audio recordings, video recordings, or the like. Also, while processes are described as being implemented using eBook reader devices, digital works may be highlighted and/or displayed by electronic devices of an eBook other than eBook reader devices, such as cellular telephones, PDAs, portable media players, tablet computers, netbooks, notebooks, desktop computers, and the like.


Aggregated Highlighting



FIG. 1 is an illustrative network 100 incorporating aggregated highlighting to provide public and purchased versions of highlights to users. A user who adds highlights to a digital work is a “highlighter.” Illustrated are several highlighters, 102(A) through 102(N). Each highlighter 102 may highlight their respective copies of a digital work, or a commonly accessible single copy, via a device such as an eBook reader 104. Each user may have a device 104, indicated 104(A) through 104(N). The eBook reader 104 may communicate via a network 106 to a server 108. Network 106 may comprise the Internet, a cable television network, wireless network, wired network, wireless wide area network, etc. Server 108 may comprise a single server, cluster of servers, data center, etc.


Additionally or alternatively, a highlighter 110 may use a client 112 to highlight a digital work. The client 112 may comprise a personal computer, laptop, netbook, PDA, or other device capable of displaying a digital work, highlighting the digital work, and communicating those highlights to server 108 via network 106. Highlighter 110 has access rights to the digital work being highlighted, but may or may not have possessory rights. For example, a patron in a library may be permitted to highlight a digital work, but not access the digital work from their home.


A prospective customer 114 may use a client 116 to view a public version of aggregated highlights 118 for a digital work. The transfer of highlights may be initiated by device 104 (as a “pull” of data), by the server 108 (as a “push” of data), or a combination. The public version of aggregated highlights 118 may comprise a selected subset of highlights available for the digital work. This subset may have maximum size limitations, or content limitations. For example, a public version of the aggregated highlights may provide no more than a predetermined percentage (e.g., two percent) of a body of the digital work to comply with conditions set forth by the owner of intellectual property rights in the digital work. Alternatively, the owner of the digital work may choose to opt out of aggregated highlighting altogether.


In another example, aggregated highlights from a portion of a digital work may not be made public. For example, highlights in a last chapter of a mystery novel where a solution is presented may not be displayed, or be hidden until clicking to view a “spoiler” highlight. Prospective customer 114 may view the public version of the aggregated highlights 118 and decide that the digital work is of sufficient interest to warrant purchase or otherwise gain access to the digital work.


A purchaser 120 of a digital work, for example an electronic book, may acquire a purchase version of aggregated highlights 122 to view on their device 124. As above, the transfer of highlights may be initiated by device 104 (as a “pull” of data), by the server 108 (as a “push” of data), or a combination. This purchase version may contain the entire repertoire of aggregated highlights available, which have been selected as described below. For example, the purchaser 110 of the purchase version of aggregated highlights 122 would have access to view the highlights in the last chapter of the mystery novel described above. Additionally, the purchase version of the aggregated highlights 122 may not be subject to the same predetermined highlighting limit (e.g., two percent) as the public version. As above, a user may choose to not display hidden highlights, such as “spoilers,” unless selected.



FIG. 2 is a schematic diagram of an illustrative aggregated highlighting environment 200. The highlighting environment 200 includes one or more servers 108, comprising a processor 202 and memory 204. Memory 204 may include computer-readable storage media as described below. Stored in memory 204 is a digital work collection module 206. The digital work collection module 206 may comprise a customer database 208, a digital items database 210, and a highlight database 212, coupled to one another.


The customer database 208 comprises information about users participating in the community. The digital items database 210 comprises digital works themselves, for example music, books, movies, etc. Digital works may be accessed in common. That is, each user with access to a particular work may access a common copy of that item, or each user may access their own discrete copy of an item stored in a digital locker. The highlight database 212 may comprise highlighted intervals of a digital work, a version or edition number of the digital work which the highlights are for, etc.


A highlight processing module 214 is also present within memory 204 and coupled to digital work collection module 206. The highlight processing module 214 comprises a highlight selection module 216 and a version creation module 218. The highlight processing module 214 processes highlights from highlighters to create versions of aggregated highlights for use by the community. The version creation module 218 may create different versions of aggregated highlights for distribution or use, such as a public version 220 and a purchase version 222. As described above, a public version 220 may comprise a subset of highlights available in the purchase version 222.


The highlight processing module 214 is in communication with a client 224. Client 224 may comprise a processor 226 and memory 228. Memory may include computer-readable storage media as described below. Stored in memory 228 is a highlight user interface (HUI) module 230. The HUI module 230 may present a public version 232 of aggregated highlights or a purchase version 234 of aggregated highlights stored in memory 228, as retrieved from server 108, depending on highlight viewing rights the user may have. Additionally, a user of the client 224 may have highlight submission rights, allowing the user to submit highlights to the server 108 for inclusion in the highlight database 212. When a user has highlighting rights, a highlight file 236 may be created when highlights are made of the digital work on the client 224. The highlight file 236 stored in memory 228 may be provided to server 108 for incorporation into highlight database 212.


Selecting Highlights



FIG. 3 is a schematic diagram of users contributing 300 highlights from different versions or editions of the same digital work to a highlight database. A highlighter 110 using client 112 may provide highlights for a first edition 302 of a digital work to highlight database 212. Highlighter 110 may be a patron accessing the digital work from a library. A purchaser 120 using device 122 may provide highlights for a second edition 304 of the digital work to the highlight database 212. Highlighter 102(N) using device 104(N) may provide highlights for a first edition 306 to the highlight database 212. Client 112 and devices 122 and 104(N) may provide the highlights to server 108 using network 106 and highlight file 236, as described above.


Highlights for the various editions are stored in highlight database 212. As described below, these highlights may be reconciled across the various editions.



FIG. 4 is a flow diagram of an illustrative process 400 of selecting aggregated highlights from a highlight database including highlights of different versions of a digital work, using highlight selection module 216.


At 402, highlights across multiple versions of a digital work are reconciled, when they are present. Reconciliation may comprise synchronization of versions 404 and consolidating the synchronized highlights 406. To aid synchronization of versions 404, a reference database (not shown) is provided that includes the multiple versions of the digital work, including a reference version of a digital work, for example, a first edition of a book. Internal reference points, for example chapter headings or individual words in an electronic book, may be used to align the multiple versions. Reconciliation may take place on a per-highlight basis. For example, if the contents of one highlight matches another highlight, the two may be reconciled as equivalent. Highlights may also be reconciled using statistically improbable phrases.


At 408, highlight selection rules, described below, are applied to the available highlights to create selected highlights. However, highlights may encompass more than the portion of the digital work of interest to the user. In an electronic book, for example, the e-book reader or other display device may constrain the user to highlight only entire lines of displayed text, rather than individual characters or words. Thus, a user may select more than the desired text when highlighting a phrase beginning in the middle of one highlighted line and ending in the middle of the next highlighted line. In this example, the resulting highlight incorporates the end of an earlier phrase and the beginning of the following phrase, which may not be relevant to the user. Where desired, a phrase breaking or detection process may be used to provide context comprising adjacent text preceding and/or following highlighted text. Thus a phrase breaking or detection process may strip out the incomplete phrases, leaving the modified highlight for further processing. Alternatively, the processing could provide the remainder of the phrase before and of the phrase after, and could optionally indicate for example through display mechanisms which part was included in the highlight and which was in the preceding phrase. The mechanisms for such a display could include but are not limited to hyperlinked ellipses, arrows, or text of different color or different background.


A phrase breaking or detection process may look to punctuation, spacing, capitalization, or a dictionary of words, etc. to determine when a phrase ends in an electronic book. Digital works comprising other formats, such as audio or video may incorporate a portion breaking or detection process using silence in an audio track, changes between video frames, metadata markers in the digital work, etc. to determine when a particular portion ends.


At 410, the selected highlights are produced and may be stored, displayed to a user, etc. In some implementations, these highlight selection rules may incorporate filters to remove attribution information of a particular highlight to a particular user, remove highlights which are not made by a minimum threshold of users, and so forth. However, highlights from a specially defined user, for example an author of a digital work, a professor or other educator, celebrity, etc, may be incorporated into highlights ultimately presented to the community, or viewed as separate highlights. A user may then toggle or otherwise select to view their own personal highlights, community highlights, highlights from the specially defined user, from other users who have read similar books, from others in the same geographic area, etc., or combinations thereof.


Highlights may then have contextual information, or context. Context may comprise portions of a work before and/or after selected highlights. At 412, context is added to the highlights. For example, where the digital work is an electronic book, context may be sentences immediately before and after the highlight. These sentences are added to the highlighted portion to create highlights with context.



FIG. 5 depicts illustrative highlight selection rules 500. These comprise simple elimination process 504, truncation elimination process 506, elementary interval accretion process 508, or elimination/elementary interval hybrid process 510. These highlight selection rules may be used separately or combined, and are discussed in more detail next.



FIG. 6 depicts initial portions 600 of selection of highlight intervals using a simple elimination process 504, in which aggregated highlights are selected and intervals overlapping with the aggregated highlights are eliminated. A highlight comprises an interval across elements. In the case of textual works, elements may comprise characters, words, sentences, paragraphs, etc. In the case of audio, video, or other works, elements may additionally or alternatively include units of time, tracks, frames, area on a graphic (e.g., progress indicator), etc. Initial highlight data 602 input by individual users, or raw highlight data, are depicted for four users A, B, C, and D across 18 elements. In these illustrations, an interval is designated by the user, and spans across one or more elements. For example, highlight interval 604 is designated C(6-9) as it highlights elements 6, 7, 8 up to but not including element 9. Another example is highlight interval 606 designated B(10-11) as it highlights element 10 up to but not including element 11.


Depicted in this initial raw highlight interval data 602 are the following intervals:

    • A(1-3), A(4-7), A(10-11), A(12-15), A(16-17)
    • B(1-3), B(4-6), B(8-9), B(10-11), B(13-15)
    • C(1-5), C(6-9)
    • D(1-18)


As illustrated in FIG. 6, these highlight intervals have overlapping interval values computed, which are displayed here at 608. In these illustrations, the overlapping interval value is indicated 610 within each highlight interval. In this example, an overlapping interval value is computed by counting the intersections of overlapping highlights. For example, C(1-5) intersects 6 distinct intervals: A(1-3), B(1-3), itself C(1-5), D1-18, A(4-7), and B(4-6). A(4-7) intersects 5 intervals, the intervals comprising: itself A(4-7), B(4-6), C(1-5), and C(6-9). D(1-18) spans the entire set of elements, and so intersects 13 intervals including itself. One implementation uses an interval tree data structure.


The overlapping interval value may also be computed to include a source weight. The source weight may be tied to a particular highlighter or community of highlighters. For example, highlights from a digital work's author may be assigned a large source weight, giving each highlight by the author higher priority over highlights by others or even from an entire community of users.


Undesired highlight intervals may be removed next, leaving only desired highlight intervals. Undesired highlight intervals may include highlight intervals which are too long, for example those having a length greater than a pre-determined maximum length. Undesired highlight intervals may also include highlight intervals which are too short, for example those having a length less than a pre-determined minimum length. As described above, pre-determined minimum and maxima may be static or dynamic in response to highlight activity. In this example, the pre-determined maximum length is 16 and the pre-determined minimum length is 2. Thus, D(1-18) is removed as being too long (greater than 16) while A(10-11), B(10-11), and B(8-9) are removed for being too short (less than 2). While this example illustrates computing the overlapping interval value then removing undesired intervals, this order may be changed with the removing occurring before computing taking place.



FIG. 7 depicts the remaining portion 700 of selection of the highlight intervals using the simple elimination process of FIG. 6. After removing the undesired intervals, the desired intervals 702 remain having these intervals:

    • A(1-3), A(4-7), A(12-15)
    • B(1-3), B(4-6), B(13-15)
    • C(1-5), C(6-9)
    • D, none


The desired intervals are sorted in descending order by the overlapping interval value. Once sorted, a desired interval having the greatest number of overlapping intervals is selected, and desired intervals which overlap with the selected interval are eliminated. For example, C(1-5) is chosen first as it has the greatest overlapping interval value of 6. Intervals A(1-3), A(4-7), B(1-3) and B(4-6) are eliminated because they overlap with C(1-5). Interval C(6-9) is chosen next as it has the next highest overlapping interval value of 4. Note that A(4-7) having an overlapping interval value of 5 has previously been eliminated and is no longer in a set of desired intervals. A tie between A(12-15) and B(13-15) is present. In the case of a tie, an interval closer to a predetermined desired length may be selected. In this illustration, the predetermined desired length is 3. However, other predetermined desired lengths could alternatively be used. Thus, A(12-15) would be chosen and B(13-15) would be eliminated.


The intervals selected in the simple elimination method 600 of FIG. 6 are illustrated at 704 and are A(12-15), C(1-5), C(6-9).



FIG. 8 depicts initial portions of selection of highlight intervals using a truncation elimination 800 process, in which aggregated highlights are selected and intervals overlapping with the aggregated highlights are truncated to remove the overlap. As in FIG. 6, initial highlight data 802 input by individual users, or raw highlight data, are depicted for four users A, B, C, and D across 18 elements. Depicted in this initial highlight data 802 are the following intervals:

    • A(1-3), A(4-7), A(10-11), A(12-15), A(16-17)
    • B(1-3), B(4-6), B(8-9), B(10-11), B(13-15)
    • C(1-5), C(6-9)
    • D(1-18)


As above, initial highlight intervals have overlapping interval values computed and displayed here at 804. An overlapping interval value is computed by counting the intersections of overlapping highlights. For example, C(1-5) intersects 6 distinct intervals: A(1-3), B(1-3), itself C(1-5), D1-18, A(4-7), and B(4-6). A(4-7) intersects 5 intervals, the intervals comprising: itself A(4-7), B(4-6), C(1-5), and C(6-9). D(1-18) spans the entire set of elements, and so intersects 13 intervals including itself.


Undesired highlight intervals may be removed next, leaving only desired highlight intervals. Undesired highlight intervals may include highlight intervals which are too long, for example those having a length greater than a pre-determined maximum length. Undesired highlight intervals may also include highlight intervals which are too short, for example those having a length less than a pre-determined minimum length. In this example, assume the pre-determined maximum length is 16 and the pre-determined minimum length is 2. Thus, D(1-18) is removed as being too long (greater than 16) while A(10-11), B(10-11), and B(8-9) are removed for being too short (less than 2). While this example illustrates computing the overlapping interval value then removing undesired intervals, this order may be changed with the removing occurring before computing taking place.



FIG. 9 depicts the remaining portion 900 of selection of highlight intervals using the truncation elimination process of FIG. 8. After removing the undesired intervals, the desired intervals 902 remain having these intervals:

    • A(1-3), A(4-7), A(12-15)
    • B(1-3), B(4-6), B(13-15)
    • C(1-5), C(6-9)
    • D, none


Next, desired highlight intervals are sorted in descending order by the overlapping interval value. An overlap is detected between a first desired highlight interval and a subsequent desired highlight interval. When detected, the overlapping subsequent desired highlight interval is truncated to the nearest non-overlapping interval. Minimum length requirements may then be reapplied to filter out any intervals not meeting the length requirements.


For example, continuing with the intervals after filtering 902, the following occurs: C(1-5) is chosen first as it has an overlapping interval value of 6. A(1-3) and B(1-3) are contained within C(1-5) and thus eliminated. B(4-6) intersects C(1-5) and is, therefore, truncated and replaced with B(5-6). B(5-6) is below the pre-determined minimum length of 2, and is eliminated. A(4-7) intersects C(1-5) and is, therefore, truncated and replaced with A(5-7).


Chosen next is interval A(5-7). Interval A(5-7) has an overlapping interval value of 5. C(6-9) intersects A(5-7), thus C(6-9) is truncated and replaced with C(7-9).


Chosen next is interval C(7-9) with an overlapping interval value of 4. A two way tie between A(12-15) and B(13-15) occurs. In this example, there is a predetermined preference for highlights closer to a desired length. In this example, the desired length is 1. However, other predetermined preferences could alternatively be used. Thus, in this example, B(13-15) is chosen as it is smaller. A(12-15) is truncated and replaced with A(12-13), and A(12-13) is then eliminated as it is below the pre-determined minimum length of 2.


The intervals selected in the truncation elimination method 800 of FIG. 8 are illustrated at 904 and are A(5-7), B(13-15), C(1-5), and C(7-9).



FIG. 10 depicts selection of highlight intervals 1000 using an elementary interval accretion, in which elementary intervals are generated, overlaps computed, the elementary intervals are sorted and chosen until a minimum threshold is reached, the resulting elementary intervals are merged with adjacent intervals until they meet or exceed a minimum size, and elementary intervals below a minimum threshold are removed. As in FIGS. 6 and 8, initial raw highlight interval data 1002 input by individual users, or raw highlight data, are depicted for four users A, B, C, and D across 18 elements. Depicted in this initial highlight interval 1002 are the following intervals:

    • A(1-3), A(4-7), A(10-11), A(12-15), A(16-17)
    • B(1-3), B(4-6), B(8-9), B(10-11), B(13-15)
    • C(1-5), C(6-9)
    • D(1-18)


Elementary highlight intervals comprising a start and an end point of all raw highlight intervals are generated. Elementary intervals may be generated by adding start and end values of all intervals to a list. The list is then sorted, and intervals are formed from the intervals in the list. For example, the sorted list of start and end values shown in 1002 would be 1, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 15, and 16. The following elementary intervals are then formed from pairs of start and end values: (1,3), (3-4), (4-5), (5-6), (6-7), (7-8), (8-9), (9-10), (10-11), (11-12), (12-13), (13-15), (15-16), and (16-18) (not shown) which has a value of 0, indicating no overlaps. As above, an overlapping interval value for the elementary highlight intervals is computed, and is shown at 1004. One implementation of computation includes inserting the original intervals into a data structure such as a segment tree.


Elementary highlight intervals are sorted in descending order by the overlapping interval value. Sorted elementary highlight intervals are then chosen. Choosing of elementary highlight intervals continues until reaching a predetermined highlight threshold. Chosen elementary highlight intervals are merged with adjacent intervals until the merged intervals meet or exceed a pre-determined minimum length, in this example 2.


In this illustration interval (1-3) is greater than the minimum length of 2 and retained. Interval (4-5) grows to (4-6). Interval (6-7) grows to (6-8). Interval (8-9) grows to (8-10) and interval (10-11) grows to (10-12). The resulting elementary intervals are shown at 1006. These intervals are (1-3), (3-4), (4-6), (6-8), (8-10), (10-12), (12-13), (13-15), and (16-17). Intervals (15-16) and (16-17) are not grown to meet the minimum size threshold as their overlapping interval values do not meet a minimum overlapping interval value threshold (OIVT), in this example the OIVT three. In another implementation, these intervals could be grown and then discarded in the next step.


Next, all un-chosen highlight intervals are discarded, such as those which are below the pre-determined minimum length of 2. Thus, (3-4) and (12-13), (15-16) and (16-17) are discarded in this example.


The intervals selected in the elementary interval accretion method 1000 are illustrated at 1008 and are (1-3), (4-6), (6-8), (8-10), and (13-15).



FIG. 11 depicts initial portions of selection of highlight intervals using an elimination/elementary interval hybrid 1100 process, which combines aspects of the processes shown in FIGS. 6, 7, and 10. As in FIGS. 6, 8, and 10, initial raw highlight interval data 1102 input by individual users, or raw highlight data, are depicted for four users A, B, C, and D across 18 elements. Depicted in this initial highlight interval 1102 are the following intervals:

    • A(1-3), A(4-7), A(10-11), A(12-15), A(16-17)
    • B(1-3), B(4-6), B(8-9), B(10-11), B(13-15)
    • C(1-5), C(6-9)
    • D(1-18)


As described above relative to FIG. 10, elementary highlight intervals from original discrete highlight intervals are generated. The initial highlight intervals of 1102 have overlapping interval values computed and displayed here at 1104. The intervals depicted in 1104 are: (1-3), (3-4), (4-5), (5-6), (6-7), (7-8), (8-9), (9-10), (10-11), (11-12), (12-13), (13-15), (15-16), and (16-17).


Next, as described previously, all elementary highlight intervals are removed that meet or exceed a minimum OIVT. In this example the minimum overlapping interval value is 3, thus (3-4), (7-8), (9-10), (11-12), (12-13), (15-16), and (17-18) are removed, with results displayed at 1106. These results are thus the intervals to be truncated, and comprise the following intervals: (3-4), (7-8), (9-10), (11-12), (12-13), (15-16), (16-17), and (17-18) with a value of zero indicating no overlaps. While this example illustrates computing the overlapping interval value then removing undesired intervals, this order may be changed with the removing occurring before computing taking place.



FIG. 12 depicts additional portions 1200 of selection of highlight intervals using the elimination/elementary interval hybrid of FIG. 11. Elementary highlight intervals are compared against original discrete highlight intervals. Any intervals overlapping an elementary interval which does not match certain criteria are truncated or eliminated. These criteria may include number of highlights, weight of highlights, etc.


In this illustration the following takes place with the intervals: C(1-5) is broken into C(1-3) and C(4-5). D(1-18) is broken into D(1-3) and D(4-18). C(6-9) is broken into C(6-7) and C(8-9). D(4-18) is broken into D(4-7) and D(8-18). D(8-18) is broken into D(8-9) and D(10-18). A(12-14) is truncated to A(13-14). D(10-18) is broken into D(10-11) and D(13-18). D(13-18) is broken into D(13-15) and D(16-18). A(16-17) and D(16-18) are discarded due to the truncation, as is (17-18) (not shown) which has a value of 0. This leaves the intervals depicted in 1202, which are:

    • A(1-3), A(4-7), A(10-11), A(13-15)
    • B(1-3), B(4-6), B(8-9), B(10-11), B(13-15)
    • C(1-3), C(4-5), C(6-7), C(8-9)
    • D(1-3), D(4-7), D(8-9), D(10-11), D(13-15).


An overlapping interval value for the elementary highlight intervals is computed and displayed at 1204.



FIG. 13 depicts the remaining portion of selection of highlight intervals 1300 using the elimination/elementary interval hybrid of FIG. 11. Intervals not meeting the pre-determined minimum length or pre-determined maximum length requirements are dropped. In this example, C(4-5), C(6-7), B(8-9), C(8-9), D(8-9), D(10-11), A(10-11), and B(10-11) are dropped. The resulting intervals are shown at 1302. These intervals are: A(1-3), A(4-7), A(13-15), B(1-3), B(4-6), B(13-15), C(1-3), D(1-3), D(4-7), D(13-15).


Next, a process similar to that of the simple elimination described above takes place. Desired highlight intervals result after removing undesired highlight intervals. As described above, undesired highlight intervals may be removed next, leaving only desired highlight intervals. Undesired highlight intervals may include highlight intervals which are too long, for example those having a length greater than a pre-determined maximum length. Undesired highlight intervals may also include highlight intervals which are too short, for example those having a length less than a pre-determined minimum length. In this example, the pre-determined maximum length is 16 and the pre-determined minimum length is 2.


The desired highlight intervals are sorted in descending order by the overlapping interval value, and highlight intervals which duplicate an existing desired highlight interval are eliminated. In this illustration the following occurs: A(4-7) and D(4-7) is in a tie, and A (4-7) may be chosen. The choice in the case of a tie may be randomly, or by pre-determined method, such as retaining the first value. Intervals D(4-7) B(4-6), C(4-5) (previously dropped), and C(6-7) (also previously dropped), are eliminated. A(1-3) is chosen next, eliminating B(1-3), C(1-3) and D(1-3). A(13-15), B(13-15), and D(13-15) are in a tie. In this tie, D(13-15) is randomly chosen. This eliminated A(13-15) and B(13-15).


The intervals selected in the elimination/elementary interval hybrid 1100 are illustrated at 1304, and are A(1-3), A(4-7), and D(13-15).


Creating Public and Purchase Highlights



FIG. 14 is a flow diagram of an illustrative process 1400 of creating a public version of aggregated highlights 220 from a highlight database. At 1402, selected highlights are accessed. At 1404, a public presentation threshold may be set. As described above, the public presentation threshold may comprise maximum size limitations such as a percentage of a body of the digital work, or content limitations such as excluding a particular section of a digital work. At 1406, selected highlights are sorted in descending order of ranking. At 1408, a public version is generated, the public version comprising selected highlights up to the public presentation threshold.



FIG. 15 is a flow diagram of an illustrative process 1500 of creating a purchase version of aggregated highlights 222 from a highlight database. At 1502, selected highlights are accessed. At 1504, a purchase presentation threshold may be set. As described above, the purchase presentation threshold may comprise maximum size limitations such as a percentage of a body of the digital work, or content limitations such as excluding a particular section of a digital work. The purchase presentation threshold may be the same or different than the public presentation threshold. At 1506, selected highlights are sorted in descending order of ranking. At 1508, a purchase version is generated, the purchase version comprising selected highlights up to the purchase presentation threshold.


Displaying a Highlight User Interface (HUI)



FIG. 16 depicts an illustrative browser interface 1600 showing highlights in an electronic book. A web address 1602 is shown in the browser interface to access an online merchant store selling books or aggregated highlights or both. Details about an illustrative book are presented to the user, including title, author, and price 1604. A thumbnail picture of the book's cover 1606 is also shown. An indication of user reviews of the book 1608 may also be presented.


A highlight viewing interface 1610 may present highlighted passages in a selected digital work. An indication of the highlighted passages 1612 and a highlight count may also be presented to the user. Instead of the highlight count, the HUI may display a metric pertaining to the highlight. For example, the metric may be order of appearance in the digital work, a page on which the passage appears, a count of the number of people who highlighted the particular passage displayed, or location within a work such as chapter, page, section, etc.


Displayed aggregated highlights may be sorted by the metrics pertaining to the aggregated highlights. In this illustration, highlighted passages are sorted in descending order of highlight count or frequency. For example, Passage 1614 “it is the east, and Juliet is the sun!” has been highlighted 45 times, and is listed at the top. Passage 1616 “and thou art wedded to calamity” has been highlighted 27 times and is listed next. Passage 1618 “in fair Verona, where we lay our scene” has been highlighted 15 times and is below passage 1616. Passage 1620 “myself condemned and myself excused” has been highlighted 12 times and is at the bottom of the list presented here.


Buttons to see more highlights 1622, purchase the book 1624, to purchase highlights 1626, to purchase the book and highlights 1628, purchase an e-book reader 1630, toggle highlights 1632, or show highlight context 1634 may also be presented to a user. Presentation of these buttons may be conditional based on the device used to access the digital work. For example, if a user is accessing this interface from an electronic book, they may be presented with the buttons to see more highlights 1622, purchase book 1624 with a single click, or purchase book and highlights 1628 with a single click. When a user has been determined to not have an e-book reader, the user may be presented with an option to purchase an e-book reader 1630. An additional option is a button to purchase the e-book reader, the digital work being displayed, and/or highlights with a single click.


The toggle highlights 1632 button allows a user to select displayed highlights. For example, a user may toggle to view only their personal highlights, highlights from others in their community, highlights from a community of all users, highlights from a person having a particular role or significance (e.g., the author), to show or hide highlights which contains spoilers, etc. Alternately, the user may be presented with a list, set of checkboxes, or other element presenting which highlights to display.


The show highlight context 1634 button allows presentation to the user of additional context comprising portions of the work surrounding the highlight. This additional context may be displayed as a highlight context 1636 pop-up, in this case illustrating the sentences before and after highlight 1614.


Where a user views a digital work in the interface which is not available in electronic form, highlighted passages may not be available. In this case, a message displaying that highlights are not available or a link to connect to a publisher of the digital work and requesting an electronic version may be presented.


This illustrative browser interface may also incorporate a graphic display showing the relative location of highlights within a representation of the work. This graphic display may be incorporate elements of the highlight user interface described next.



FIG. 17 depicts an illustrative HUI 1700. The HUI may be presented on a personal computer, e-book, media player, or other device. In this example, the HUI is shown while viewing text in an electronic book. A viewing window 1702 displays the portion of a digital work being viewed. In this case, the viewing window 1702 presents text from the electronic book being read. Also shown is a highlight display indicator (HDI) 1704 which depicts the digital work and the relative placement and importance of selected highlights within the digital work.


In this illustration of the HDI 1704, a beginning of the book is indicated by a left boundary 1706, while an end of the book is indicated by right boundary 1708, with the book being presented in a linear representation. Bands representing passages 1618, 1614, 1616, and 1620 may be distributed along the linear representation in the HDI 1704 according to their approximate location within a body of the book. Color of the bands and/or intensity of the color of the bands may be varied to indicate a correspondence to the metric pertaining to the highlight. For example, highlights with a high frequency of selection may be brilliant crimson, while highlights with a smaller number of highlights may be a dull green. A shape or icon associated with the highlight, for example, the bands in this illustration, may also be displayed with a size proportionate to the metric pertaining to the highlight. For example, highlights with a high frequency of selection may be presented as larger icons than highlights with a lower frequency. In this illustration, passage 1614 has the greatest number of highlights, and is indicated with a solid black band. Passage 1616 has fewer highlights, and is indicated with a medium gray band. Passage 1618 has still fewer highlights, and is indicated with a light gray band.


When the text viewing window 1702 displays text which is the subject of an aggregated highlight, the displayed text may be highlighted visually, such as with reverse video. Furthermore, the highlight which is currently being displayed such as passage 1614 in this illustration may be indicated in the HDI 1704. This indication may comprise an arrow 1710, changing the color of the band corresponding to the passage, blinking the band corresponding to the passage, etc.


A user may also navigate throughout the digital work using the HDI 1704. For example, a user may select a highlight from the HDI 1704, and the display window may be updated to show that portion of the digital work. The user may also use a movement scroll bar 1712 to move forward or backward through a digital work, and a zoom control scroll bar 1714 to increase or decrease the zoom of the HDI 1704 being presented, as described next in FIG. 18. A toggle highlights 1632 button may also be presented and operate as described previously.


Selection of which highlights to display in the HDI 1704 may proportional to a zoom level. For example, at a low zoom level only highlights having higher ranking metrics may be displayed. In this illustration, the HDI 1704 depicts the entire work, but only highlights having a highlight count greater than ten are shown at this zoom level.



FIG. 18 depicts the illustrative HUI of FIG. 17 of an electronic book while viewing another highlighted passage 1800. In this illustration, passage 1616 has been selected. The passage containing the highlighted text of passage 1616 is displayed in the display window 1702, with the highlighted text shown in reverse video. Indicator 1802 in the HDI 1704 shows that this is the current highlight being displayed.


As illustrated, a user has increased the setting of the zoom control scroll bar 1714. As a result of the zoom, the HDI 1704 now displays a beginning of the zoomed section indicated by a left boundary 1804, while an end of the zoomed section is indicated by right boundary 1806, while highlight 1802 showing the current highlight has increased in width to represent the same relative proportion of the zoom increase. As the zoom level is increased, highlights with ranking metrics pertaining to the highlight may be displayed which are lower than those displayed at lesser zoom levels. For example, the zoomed section showed here now displays additional highlights 1808. As the zoom level is decreased, display of a highlight in the HDI 1704 may be limited to highlights having higher ranking metrics pertaining to the highlight. As described above, the gray color of band 1616 on the HDI 1704, which is less intensive then the black band 1614 on the HDI 1704, may indicate that passage 1616 has been highlighted less frequently than passage 1614.


Although specific details of illustrative methods are described with regard to the figures and other flow diagrams presented herein, it should be understood that certain acts shown in the figures need not be performed in the order described, and may be modified, and/or may be omitted entirely, depending on the circumstances. As described in this application, modules and engines may be implemented using software, hardware, firmware, or a combination of these. Moreover, the acts and methods described may be implemented by a computer, processor or other computing device based on instructions stored on one or more computer-readable storage media.


The computer-readable storage media (CRSM) may be any available physical media that can be accessed by a computing device to implement the instructions stored thereon. CRSM may include, but is not limited to, random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technology, compact disk read-only memory (CD-ROM), digital versatile disks (DVD) or other optical disk storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store the desired information and which can be accessed by a computing device.

Claims
  • 1. A method of generating aggregated highlights of a digital book from a plurality of highlights, the method comprising: obtaining raw highlight intervals of a digital book from a plurality of users; reconciling the raw highlight intervals across a plurality of versions of the digital book, the reconciling comprising synchronizing the versions of the digital book and consolidating the raw highlight intervals of the synchronized versions of the digital book, at least two of the plurality of versions of the digital book differing at least without regard to the raw highlight intervals;selecting aggregated highlight intervals based on the reconciled highlight intervals using a highlight selection rule, wherein the highlight selection rule comprises: computing an overlapping interval value for the reconciled highlight intervals by counting the intersections of at least partially overlapping highlights, orgenerating elementary highlight intervals from reconciled highlight intervals by placing start and end values of intervals on an interval list, sorting the interval list, removing duplicates from the interval list, and building elementary highlight intervals from the resulting sorted list;creating a public version of the selected aggregated highlight intervals;creating a purchase version of the selected aggregated highlight intervals, the purchase version differing from the public version and made available based at least in part on additional compensation with respect to the public version; anddisplaying the public version or the purchase version of selected aggregated highlight intervals to users.
  • 2. The method of claim 1, further comprising an electronic book reader configured to display the public version or the purchase version of the selected aggregated highlight intervals.
  • 3. The method of claim 1, wherein the highlight selection rule comprises: computing the overlapping interval value for the reconciled highlight intervals by counting the intersections of at least partially overlapping highlights;removing undesired highlight intervals from the reconciled highlight intervals to leave only desired highlight intervals, the removing comprising: removing overlapping highlight intervals having a length greater than a pre-determined maximum length;removing overlapping highlight intervals having a length less than a pre-determined minimum length;removing overlapping highlight intervals having an overlapping interval value less than a pre-determined minimum overlapping interval value; andsorting the desired highlight intervals in descending order by the overlapping interval value by counting the intersections of overlapping highlights.
  • 4. The method of claim 1, wherein the highlight selection rule comprises: computing the overlapping interval value for the reconciled highlight intervals by counting the intersections of at least partially overlapping highlights;removing undesired highlight intervals from the reconciled highlight intervals to leave only desired highlight intervals, the removing comprising: removing overlapping highlight intervals having a length greater than a pre-determined maximum length;removing overlapping highlight intervals having a length less than a pre-determined minimum length;removing overlapping highlight intervals having an overlapping interval value less than a pre-determined minimum overlapping interval value;sorting the desired highlight intervals in descending order by the overlapping interval value;detecting an overlap between a first desired highlight interval and subsequent desired highlight intervals; andtruncating overlapping subsequent desired highlight intervals to a nearest non-overlapping interval.
  • 5. The method of claim 1, wherein the highlight selection rule comprises: generating the elementary highlight intervals from the reconciled highlight intervals by placing start and end values of intervals on an interval list, sorting the interval list, removing duplicates from the interval list, and building the elementary highlight intervals from the resulting sorted list;computing the overlapping interval value for the elementary highlight intervals by counting the intersections of at least partially overlapping highlights;sorting the elementary highlight intervals in descending order by the overlapping interval value;choosing elementary highlight intervals until a pre-determined highlight threshold is reached;merging chosen elementary highlight intervals with adjacent intervals until the merged intervals meet or exceed a pre-determined minimum threshold; anddiscarding all unchosen highlight intervals.
  • 6. The method of claim 1, wherein the highlight selection rule comprises: generating the elementary highlight intervals from reconciled highlight intervals by placing start and end values of intervals on an interval list, sorting the interval list, removing duplicates from the interval list, and building elementary highlight intervals from the resulting sorted list;computing the overlapping interval value for the elementary highlight intervals by counting the intersections of at least partially overlapping highlights;comparing elementary highlight intervals against the reconciled highlight intervals and truncating reconciled highlight intervals overlapping the elementary highlight intervals, the truncating comprising: selecting elementary highlight intervals with overlapping interval values less than a minimum overlapping interval value threshold;truncating the reconciled highlight intervals by removing the overlapping selected elementary highlight intervals;removing undesired highlight intervals to leave only desired highlight intervals, the removing comprising: removing elementary highlight intervals that meet or exceed a minimum overlapping interval value threshold;removing overlapping highlight intervals having a length greater than a pre-determined maximum length;removing overlapping highlight intervals having a length less than a pre-determined minimum length; andsorting the desired highlight intervals in descending order by the overlapping interval value.
  • 7. A method of generating highlight intervals of a digital work, the method comprising: obtaining a plurality of highlight intervals in a digital work from a plurality of user devices;selecting highlight intervals from the obtained plurality of highlight intervals using a highlight selection rule, wherein the highlight selection rule comprises: computing an overlapping interval value for the raw highlight intervals by counting the intersections of at least partially overlapping highlights: orgenerating elementary highlight intervals from the raw highlight intervals by placing start and end values of all intervals on an interval list, sorting the interval list, removing duplicates from the interval list, andbuilding elementary highlight intervals from the resulting sorted list;creating a public version of the selected highlight intervals;creating a purchase version of the selected highlight intervals to be offered for purchase, the purchase version differing from the public version and made available based at least in part on additional compensation with respect to the public version; andproviding for display the public version or the purchase version of selected highlight intervals.
  • 8. The method of claim 7, wherein the digital work comprises an electronic book.
  • 9. The method of claim 7, wherein the selecting further comprises: reconciling highlight intervals across a plurality of versions of the digital work, the reconciling comprising synchronizing the versions and consolidating the highlight intervals of the synchronized versions, at least two of the plurality of versions differing at least without regard to the highlights; andthe selecting highlight intervals using the highlight selection rule selecting from the reconciled highlight intervals.
  • 10. The method of claim 7, wherein the highlight selection rule comprises: computing the overlapping interval value for the raw highlight intervals by counting the intersections of at least partially overlapping highlights;removing undesired highlight intervals from the raw highlight intervals to leave only desired highlight intervals, the removing comprising: removing overlapping highlight intervals having a length greater than a pre-determined maximum length;removing overlapping highlight intervals having a length less than a pre-determined minimum length;removing overlapping highlight intervals having an overlapping interval value less than a pre-determined minimum overlapping interval value; andsorting the desired highlight intervals in descending order by the overlapping interval value.
  • 11. The method of claim 7, wherein the highlight selection rule comprises: computing the overlapping interval value for the raw highlight intervals by counting the intersections of at least partially overlapping highlights;removing undesired highlight intervals from the raw highlight intervals to leave only desired highlight intervals, the removing comprising: removing overlapping highlight intervals having a length greater than a pre-determined maximum length;removing overlapping highlight intervals having a length less than a pre-determined minimum length;removing overlapping highlight intervals having an overlapping interval value less than a pre-determined minimum overlapping interval value,sorting the desired highlight intervals in descending order by the overlapping interval value;detecting an overlap between a first desired highlight interval and subsequent desired highlight intervals; andtruncating overlapping subsequent desired highlight intervals to a nearest non-overlapping interval.
  • 12. The method of claim 7, wherein the highlight selection rule comprises: generating the elementary highlight intervals from the raw highlight intervals by placing start and end values of all intervals on an interval list, sorting the interval list, removing duplicates from the interval list, and building the elementary highlight intervals from the resulting sorted list;computing the overlapping interval value for the elementary highlight intervals by counting the intersections of at least partially overlapping highlights;sorting the elementary highlight intervals in descending order by the overlapping interval value;choosing elementary highlight intervals until a pre-determined highlight threshold is reached;merging chosen elementary highlight intervals with adjacent intervals until the merged intervals meet or exceed a pre-determined minimum threshold; anddiscarding all unchosen highlight intervals.
  • 13. The method of claim 7, wherein the highlight selection rule comprises: generating the elementary highlight intervals from raw highlight intervals by placing start and end values of all intervals on an interval list, sorting the interval list, removing duplicates from the interval list, and building the elementary highlight intervals from the resulting sorted list;computing the overlapping interval value for the elementary highlight intervals by counting the intersections of at least partially overlapping highlights;comparing elementary highlight intervals against the raw highlight intervals and breaking or truncating raw highlight intervals overlapping the elementary highlight intervals, wherein the truncating comprises: selecting elementary highlight intervals with overlapping interval values less than a minimum overlapping interval value threshold;truncating the raw highlight intervals by removing the overlapping selected elementary highlight intervals;removing undesired highlight intervals to leave only desired highlight intervals, the removing comprising: removing overlapping highlight intervals having a length greater than a pre-determined maximum length;removing overlapping highlight intervals having a length less than a pre-determined minimum length; andsorting the desired highlight intervals in descending order by the overlapping interval value.
  • 14. The method of claim 7, wherein the digital work is stored in a digital locker.
  • 15. The method of claim 7, wherein creating the public version of selected highlights comprises: accessing the selected highlight intervals;setting a public presentation threshold defining a maximum amount of the body of the work is displayable as public highlight intervals;sorting selected highlight intervals by ranking, the ranking comprising highest ranked highlight intervals being most commonly highlighted of the selected highlight intervals to lowest ranked highlight intervals being least commonly highlighted of the selected highlight intervals; andgenerating the public version, the public version comprising highlight intervals up to the public presentation threshold.
  • 16. The method of claim 15, wherein the public presentation threshold is less than or equal to two percent of a body of the digital work.
  • 17. The method of claim 7, wherein creating the purchase version of selected highlights comprises: accessing the selected highlight intervals;setting a purchase presentation threshold defining a maximum amount of the body of the work is displayable as purchase highlight intervals;sorting selected highlight intervals by ranking, the ranking comprising highest ranked highlight intervals being most commonly highlighted of the selected highlight intervals to lowest ranked highlight intervals being least commonly highlighted of the selected highlight intervals; andgenerating the purchase version, the purchase version comprising highlight intervals up to the purchase presentation threshold.
  • 18. The method of claim 17, wherein the private presentation threshold is less than or equal to a percentage of a body of the digital work, the percentage being defined by a user.
  • 19. One or more non-transitory computer-readable storage media storing instructions that when executed instruct a processor to perform acts comprising: obtaining one or more highlights of a digital work from a plurality of user devices;reconciling the obtained highlights across a plurality of versions of the digital work, at least two of the plurality of versions differing at least without regard to the highlights;determining, from the reconciled highlights, commonly highlighted passages in the digital work;generating selected highlights from the highlights, based on the determined commonly highlighted passages, wherein generating selected highlights comprises: computing an overlapping interval value for the reconciled highlight intervals by counting the intersections of at least partially overlapping highlights; orgenerating elementary highlight intervals by placing start and end values of intervals on an interval list, sorting the interval list, removing duplicates from the interval list, and building elementary highlight intervals from the resulting sorted listcreating a public version of the selected highlights;creating a purchase version of the selected highlights, the purchase version differing from the public version and made available based at least in part on additional compensation with respect to the public version; andproviding for display the public version or the purchase version of selected highlights.
  • 20. The one or more non-transitory computer-readable storage media of claim 19, wherein the providing for display includes providing the selected highlights for display in a highlight user interface.
  • 21. The one or more non-transitory computer-readable storage media of claim 19, wherein generating selected highlights comprises: computing the overlapping interval value for the reconciled highlight intervals by counting the intersections of at least partially overlapping highlights;removing undesired highlight intervals from the reconciled highlight intervals to leave only desired highlight intervals, the removing comprising: removing overlapping highlight intervals having a length greater than a pre-determined maximum length;removing overlapping highlight intervals having a length less than a pre-determined minimum length;removing overlapping highlight intervals having an overlapping interval value less than a pre-determined minimum overlapping interval value; andsorting the desired highlight intervals in descending order by the overlapping interval value.
  • 22. The one or more non-transitory computer-readable storage media of claim 19, wherein generating selected highlights comprises: computing the overlapping interval value for the reconciled highlight intervals by counting the intersections of at least partially overlapping highlights;removing undesired highlight intervals from the reconciled highlight intervals to leave only desired highlight intervals, the removing comprising: removing overlapping highlight intervals having a length greater than a pre-determined maximum length;removing overlapping highlight intervals having a length less than a pre-determined minimum length;removing overlapping highlight intervals having an overlapping interval value less than a pre-determined minimum overlapping interval value;sorting the desired highlight intervals in descending order by the overlapping interval value;detecting an overlap between a first desired highlight interval and subsequent desired highlight intervals; andtruncating overlapping subsequent desired highlight intervals to a nearest non-overlapping interval.
  • 23. The one or more non-transitory computer-readable storage media of claim 19, wherein generating selected highlights comprises: generating the elementary highlight intervals by placing start and end values of intervals on an interval list, sorting the interval list, removing duplicates from the interval list, and building elementary highlight intervals from the resulting sorted list;computing the overlapping interval value for the elementary highlight intervals by counting the intersections of at least partially overlapping highlights;sorting the elementary highlight intervals in descending order by the overlapping interval value;choosing elementary highlight intervals until a pre-determined highlight threshold is reached;merging chosen elementary highlight intervals with adjacent intervals until the merged intervals meet or exceed a pre-determined minimum threshold; anddiscarding all unchosen highlight intervals.
  • 24. The one or more non-transitory computer-readable storage media of claim 19, wherein generating selected highlights comprises: generating the elementary highlight intervals from reconciled highlight intervals by placing start and end values of intervals on an interval list, sorting the interval list, removing duplicates from the interval list, and building the elementary highlight intervals from the resulting sorted list;computing the overlapping interval value for the elementary highlight intervals by counting the intersections of at least partially overlapping highlights;comparing elementary highlight intervals against the reconciled highlight intervals and truncating reconciled highlight intervals overlapping the elementary highlight intervals, the truncating comprising: selecting elementary highlight intervals with overlapping interval values less than a minimum overlapping interval value threshold;truncating the reconciled highlight intervals by removing the overlapping selected elementary highlight intervals;removing undesired highlight intervals to leave only desired highlight intervals, the removing comprising: removing elementary highlight intervals that meet or exceed a minimum overlapping interval value threshold;removing overlapping highlight intervals having a length greater than a pre-determined maximum length;removing overlapping highlight intervals having a length less than a pre-determined minimum length; andsorting the desired highlight intervals in descending order by the overlapping interval value.
  • 25. The one or more non-transitory computer-readable storage media of claim 19, wherein the reconciling highlights across the plurality of versions of the digital work comprises synchronizing the plurality of versions of the digital work with one another and tagging each highlight with the version or versions the highlight appears in.
  • 26. A method of generating aggregated highlights of a book from a plurality of highlights, the method comprising: obtaining raw highlight intervals of a book from a plurality of users from highlights in an digital work, or highlights scanned from a physical document, or both;reconciling the raw highlight intervals across a plurality of versions of the book, the reconciling comprising synchronizing the versions of the book and consolidating the raw highlight intervals of the synchronized versions of the digital book, at least two of the plurality of versions differing at least without regard to the highlight intervals;selecting aggregated highlight intervals based on the reconciled highlight intervals using a highlight selection rule, wherein the highlight selection rule comprises: computing an overlapping interval value for the raw highlight intervals by counting the intersections of at least partially overlapping highlights: orgenerating elementary highlight intervals from the raw highlight intervals by placing start and end values of all intervals on an interval list, sorting the interval list, removing duplicates from the interval list, and building elementary highlight intervals from the resulting sorted list;creating a public version of the selected aggregated highlight intervals;creating a purchase version of the selected aggregated highlight intervals, the purchase version differing from the public version and made available based at least in part on additional compensation with respect to the public version; anddisplaying the public version or the purchase version of selected aggregated highlight intervals to users.
  • 27. The method of claim 26, further comprising characterizing highlights scanned from a physical document by color of highlight, or underline, or both.
US Referenced Citations (500)
Number Name Date Kind
2684955 Knowles Sep 1954 A
4622627 Rodriguez et al. Nov 1986 A
4985697 Boulton Jan 1991 A
5418549 Anderson et al. May 1995 A
5495268 Pearson et al. Feb 1996 A
5499359 Vijaykumar Mar 1996 A
5517407 Weiner May 1996 A
5544305 Ohmaye et al. Aug 1996 A
5566098 Lucente et al. Oct 1996 A
5600775 King et al. Feb 1997 A
5623260 Jones Apr 1997 A
5630159 Zancho May 1997 A
5640553 Schultz Jun 1997 A
5659742 Beattie et al. Aug 1997 A
5661635 Huffman et al. Aug 1997 A
5663748 Huffman et al. Sep 1997 A
5696982 Tanigawa et al. Dec 1997 A
5710922 Alley et al. Jan 1998 A
5711922 O'Brien et al. Jan 1998 A
5742905 Pepe et al. Apr 1998 A
5761485 Munyan Jun 1998 A
5765168 Burrows Jun 1998 A
5774109 Winksy et al. Jun 1998 A
5813017 Morris Sep 1998 A
5845278 Kirsch et al. Dec 1998 A
5845301 Rivette et al. Dec 1998 A
5847698 Reavey et al. Dec 1998 A
5892900 Ginter et al. Apr 1999 A
5923861 Bertram et al. Jul 1999 A
5930026 Jacobson et al. Jul 1999 A
5940846 Akiyama Aug 1999 A
5956048 Gaston Sep 1999 A
5960411 Hartman et al. Sep 1999 A
5973681 Tanigawa et al. Oct 1999 A
5991439 Tanaka et al. Nov 1999 A
6018575 Gross et al. Jan 2000 A
6034839 Hamming Mar 2000 A
6037954 McMahon Mar 2000 A
6041335 Merritt et al. Mar 2000 A
6047189 Yun et al. Apr 2000 A
6049334 Bates et al. Apr 2000 A
6049796 Siitonen et al. Apr 2000 A
6064980 Jacobi et al. May 2000 A
6073148 Rowe et al. Jun 2000 A
6113394 Edgar Sep 2000 A
6148340 Bittinger et al. Nov 2000 A
6154757 Krause et al. Nov 2000 A
6164974 Carlile et al. Dec 2000 A
6195698 Lillibridge et al. Feb 2001 B1
6201771 Otsuka et al. Mar 2001 B1
6226642 Beranek et al. May 2001 B1
6233318 Picard et al. May 2001 B1
6272461 Meredith et al. Aug 2001 B1
6300947 Kanevsky Oct 2001 B1
6308320 Burch Oct 2001 B1
6313828 Chombo Nov 2001 B1
6331866 Eisenberg Dec 2001 B1
6331867 Eberhard et al. Dec 2001 B1
6335678 Heutschi Jan 2002 B1
6351750 Duga et al. Feb 2002 B1
6385596 Wiser et al. May 2002 B1
6401086 Bruckner Jun 2002 B1
6401239 Miron Jun 2002 B1
6442651 Crow et al. Aug 2002 B2
6449627 Baer et al. Sep 2002 B1
6457030 Adams et al. Sep 2002 B1
6466951 Birkler et al. Oct 2002 B1
6484212 Markowitz et al. Nov 2002 B1
6487669 Waring Nov 2002 B1
6493734 Sachs et al. Dec 2002 B1
6496803 Ho et al. Dec 2002 B1
6529920 Arons et al. Mar 2003 B1
6535857 Clarke, III et al. Mar 2003 B1
6542874 Walker et al. Apr 2003 B1
6559882 Kerchner May 2003 B1
6560699 Konkle May 2003 B1
6574658 Gabber et al. Jun 2003 B1
6629138 Lambert et al. Sep 2003 B1
6631495 Kato et al. Oct 2003 B2
6642947 Feierbach Nov 2003 B2
6658623 Schilit et al. Dec 2003 B1
6685482 Hopp et al. Feb 2004 B2
6687878 Eintracht et al. Feb 2004 B1
6704733 Clark et al. Mar 2004 B2
6721869 Senthil Apr 2004 B1
6724403 Santoro et al. Apr 2004 B1
6725227 Li Apr 2004 B1
6726487 Dalstrom Apr 2004 B1
6735583 Bjarnestam et al. May 2004 B1
6744891 Allen Jun 2004 B1
6744967 Kaminski et al. Jun 2004 B2
6801751 Wood et al. Oct 2004 B1
6803930 Simonson Oct 2004 B1
6804489 Stuppy et al. Oct 2004 B2
6829594 Kitamura Dec 2004 B1
6847966 Sommer et al. Jan 2005 B1
6904449 Quinones Jun 2005 B1
6912398 Domnitz Jun 2005 B1
6933928 Lilienthal Aug 2005 B1
6938076 Meyer et al. Aug 2005 B2
6947922 Glance Sep 2005 B1
6948135 Ruthfield et al. Sep 2005 B1
6953343 Townshend Oct 2005 B2
6966029 Ahern Nov 2005 B1
6980652 Braitberg et al. Dec 2005 B1
6985932 Glaser et al. Jan 2006 B1
6992687 Baird et al. Jan 2006 B1
6999565 Delaney et al. Feb 2006 B1
7007015 Nayak Feb 2006 B1
7009596 Seet et al. Mar 2006 B2
7010500 Aarnio Mar 2006 B2
7010751 Shneiderman Mar 2006 B2
7020654 Najmi Mar 2006 B1
7020663 Hay et al. Mar 2006 B2
7054914 Suzuki et al. May 2006 B2
7057591 Hautanen et al. Jun 2006 B1
7062707 Knauft et al. Jun 2006 B1
7071930 Kondo et al. Jul 2006 B2
7089292 Roderick et al. Aug 2006 B1
7092116 Calaway Aug 2006 B2
7103848 Barsness et al. Sep 2006 B2
7107533 Duncan et al. Sep 2006 B2
7111250 Hayward et al. Sep 2006 B1
7130841 Goel et al. Oct 2006 B1
7133506 Smith Nov 2006 B1
7135932 Quadir et al. Nov 2006 B2
7149776 Roy et al. Dec 2006 B1
7165217 Kondo Jan 2007 B1
7181502 Incertis Feb 2007 B2
7188085 Pelletier Mar 2007 B2
7191346 Abe et al. Mar 2007 B2
7209888 Frid-Nielsen et al. Apr 2007 B2
7216116 Nilsson et al. May 2007 B1
7237123 LeVine et al. Jun 2007 B2
7246118 Chastain et al. Jul 2007 B2
7249046 Katsurabayashi et al. Jul 2007 B1
7249060 Ling Jul 2007 B2
7249324 Nakamura et al. Jul 2007 B2
7257577 Fagin et al. Aug 2007 B2
7287068 Eriksson et al. Oct 2007 B1
7290285 McCurdy et al. Oct 2007 B2
7298851 Hendricks et al. Nov 2007 B1
7304635 Seet et al. Dec 2007 B2
7310629 Mendelson et al. Dec 2007 B1
7313759 Sinisi Dec 2007 B2
7350704 Barsness et al. Apr 2008 B2
7355591 Sugimoto Apr 2008 B2
7375649 Gueziec May 2008 B2
7383505 Shimizu et al. Jun 2008 B2
7386480 Sarig Jun 2008 B2
7386804 Ho et al. Jun 2008 B2
7398244 Keith Jul 2008 B1
7401286 Hendricks et al. Jul 2008 B1
7454238 Vinayak et al. Nov 2008 B2
7461406 Pelly et al. Dec 2008 B2
7496767 Evans Feb 2009 B2
7506246 Hollander et al. Mar 2009 B2
7506356 Gupta et al. Mar 2009 B2
7509270 Hendricks et al. Mar 2009 B1
7519278 Ikeda et al. Apr 2009 B2
7533152 Stark et al. May 2009 B2
7539478 Herley et al. May 2009 B2
7562032 Abbosh et al. Jul 2009 B2
7562038 Brumfield et al. Jul 2009 B1
7574653 Croney et al. Aug 2009 B2
7631013 Parsons et al. Dec 2009 B2
7634429 Narin et al. Dec 2009 B2
7656127 Shutt et al. Feb 2010 B1
7657459 Anderson et al. Feb 2010 B2
7657831 Donahue Feb 2010 B2
7680849 Heller et al. Mar 2010 B2
7716224 Reztlaff, II et al. May 2010 B2
7720892 Healey, Jr. et al. May 2010 B1
7747949 Incertis Carro Jun 2010 B2
7760986 Beuque Jul 2010 B2
7788369 McAllen et al. Aug 2010 B2
7792756 Plastina et al. Sep 2010 B2
7835989 Hendricks et al. Nov 2010 B1
7849393 Hendricks et al. Dec 2010 B1
7865405 Hendricks et al. Jan 2011 B2
7865567 Hendricks et al. Jan 2011 B1
7865817 Ryan et al. Jan 2011 B2
7870022 Bous et al. Jan 2011 B2
7890848 Bodin et al. Feb 2011 B2
7900133 Cragun et al. Mar 2011 B2
7908628 Swart et al. Mar 2011 B2
7920112 Kurihara et al. Apr 2011 B2
7920320 Watson et al. Apr 2011 B2
8018431 Zehr et al. Sep 2011 B1
8117128 Ishibashi Feb 2012 B2
8131647 Siegel et al. Mar 2012 B2
8161198 Kikuchi Apr 2012 B2
8165998 Semerdzhiev Apr 2012 B2
8175925 Rouaix May 2012 B1
8209623 Barletta et al. Jun 2012 B2
8260915 Ashear Sep 2012 B1
8312096 Cohen et al. Nov 2012 B2
8341210 Lattyak et al. Dec 2012 B1
8370196 Choi et al. Feb 2013 B2
8417772 Lin et al. Apr 2013 B2
8429028 Hendricks et al. Apr 2013 B2
8452797 Paleja et al. May 2013 B1
8510247 Kane, Jr. et al. Aug 2013 B1
8601084 Carlander Dec 2013 B2
8725565 Ryan May 2014 B1
8793575 Lattyak et al. Jul 2014 B1
20010007980 Ishibashi et al. Jul 2001 A1
20010025302 Suzuki et al. Sep 2001 A1
20010026287 Watanabe Oct 2001 A1
20010027450 Shinoda et al. Oct 2001 A1
20010027478 Meier et al. Oct 2001 A1
20010036822 Mead et al. Nov 2001 A1
20010037328 Pustejovsky et al. Nov 2001 A1
20010039493 Pustejovsky et al. Nov 2001 A1
20010049623 Aggarwal et al. Dec 2001 A1
20010050658 Adams Dec 2001 A1
20010053975 Kurihara Dec 2001 A1
20020002540 DeMello et al. Jan 2002 A1
20020010707 Chang et al. Jan 2002 A1
20020010759 Hitson et al. Jan 2002 A1
20020012134 Calaway Jan 2002 A1
20020026443 Chang et al. Feb 2002 A1
20020035697 McCurdy et al. Mar 2002 A1
20020046261 Iwata et al. Apr 2002 A1
20020049717 Routtenberg et al. Apr 2002 A1
20020054059 Schneiderman May 2002 A1
20020057286 Markel et al. May 2002 A1
20020059415 Chang et al. May 2002 A1
20020069222 McNeely Jun 2002 A1
20020069312 Jones Jun 2002 A1
20020087532 Barritz et al. Jul 2002 A1
20020090934 Mitchelmore Jul 2002 A1
20020091584 Clark et al. Jul 2002 A1
20020092031 Dudkiewicz et al. Jul 2002 A1
20020095468 Sakata Jul 2002 A1
20020101447 Carro Aug 2002 A1
20020103809 Starzl et al. Aug 2002 A1
20020120635 Joao Aug 2002 A1
20020123336 Kamada Sep 2002 A1
20020126140 Gorbet et al. Sep 2002 A1
20020129012 Green Sep 2002 A1
20020138291 Vaidyanathan et al. Sep 2002 A1
20020138649 Cartmell et al. Sep 2002 A1
20020143822 Brid et al. Oct 2002 A1
20020147724 Fries et al. Oct 2002 A1
20020165707 Call Nov 2002 A1
20020184319 Willner et al. Dec 2002 A1
20020194474 Natsuno et al. Dec 2002 A1
20030005002 Chen et al. Jan 2003 A1
20030009459 Chastain et al. Jan 2003 A1
20030012216 Novaes Jan 2003 A1
20030018720 Chang et al. Jan 2003 A1
20030025731 Chastain et al. Feb 2003 A1
20030028395 Rodgers et al. Feb 2003 A1
20030040970 Miller Feb 2003 A1
20030046233 Ara et al. Mar 2003 A1
20030052928 Williams Mar 2003 A1
20030058265 Robinson et al. Mar 2003 A1
20030065642 Zee Apr 2003 A1
20030069812 Yuen et al. Apr 2003 A1
20030076513 Sugimoto et al. Apr 2003 A1
20030090572 Belz et al. May 2003 A1
20030093312 Ukita et al. May 2003 A1
20030093382 Himeno et al. May 2003 A1
20030097354 Finlay et al. May 2003 A1
20030097361 Huang et al. May 2003 A1
20030105679 Krishnan et al. Jun 2003 A1
20030110503 Perkes Jun 2003 A1
20030126123 Kodama Jul 2003 A1
20030129963 Nurcahya Jul 2003 A1
20030135495 Vagnozzi Jul 2003 A1
20030152894 Townshend Aug 2003 A1
20030163399 Harper et al. Aug 2003 A1
20030164844 Kravitz et al. Sep 2003 A1
20030182551 Frantz et al. Sep 2003 A1
20030190145 Copperman et al. Oct 2003 A1
20030191737 Steele et al. Oct 2003 A1
20030204496 Ray et al. Oct 2003 A1
20030212613 Sarig Nov 2003 A1
20040002943 Merrill et al. Jan 2004 A1
20040003344 Lai et al. Jan 2004 A1
20040003398 Donian et al. Jan 2004 A1
20040015467 Fano Jan 2004 A1
20040023191 Brown et al. Feb 2004 A1
20040030686 Cardno et al. Feb 2004 A1
20040044723 Bell et al. Mar 2004 A1
20040049743 Bogward Mar 2004 A1
20040054499 Starzyk et al. Mar 2004 A1
20040068471 Kato Apr 2004 A1
20040078273 Loeb et al. Apr 2004 A1
20040078757 Golovchinsky et al. Apr 2004 A1
20040098350 Labrou et al. May 2004 A1
20040117189 Bennett Jun 2004 A1
20040128359 Horvitz et al. Jul 2004 A1
20040139400 Allam et al. Jul 2004 A1
20040167822 Chasen et al. Aug 2004 A1
20040201633 Barsness et al. Oct 2004 A1
20040205457 Bent et al. Oct 2004 A1
20040210561 Shen Oct 2004 A1
20040212941 Haas et al. Oct 2004 A1
20040229194 Yang Nov 2004 A1
20040237033 Woolf et al. Nov 2004 A1
20040239703 Angelica Dec 2004 A1
20040243613 Pourheidari Dec 2004 A1
20040252692 Shim et al. Dec 2004 A1
20040254013 Quraishi et al. Dec 2004 A1
20040254917 Brill et al. Dec 2004 A1
20040267552 Gilliam et al. Dec 2004 A1
20040268253 DeMello et al. Dec 2004 A1
20050021464 Lindauer et al. Jan 2005 A1
20050022113 Hanlon Jan 2005 A1
20050044148 Son et al. Feb 2005 A1
20050044224 Jun et al. Feb 2005 A1
20050066219 Hoffman et al. Mar 2005 A1
20050069225 Schneider et al. Mar 2005 A1
20050069849 McKinney et al. Mar 2005 A1
20050076012 Manber et al. Apr 2005 A1
20050088410 Chaudhri Apr 2005 A1
20050091604 Davis Apr 2005 A1
20050097007 Alger et al. May 2005 A1
20050102618 Naito May 2005 A1
20050125222 Brown et al. Jun 2005 A1
20050132281 Pan et al. Jun 2005 A1
20050138007 Amitay Jun 2005 A1
20050138428 McAllen et al. Jun 2005 A1
20050144221 Shin et al. Jun 2005 A1
20050144895 Grimes et al. Jul 2005 A1
20050154601 Halpern et al. Jul 2005 A1
20050176438 Li Aug 2005 A1
20050177562 Raciborski Aug 2005 A1
20050177567 Hughes et al. Aug 2005 A1
20050193330 Peters Sep 2005 A1
20050195975 Kawakita Sep 2005 A1
20050198070 Lowry Sep 2005 A1
20050222977 Zhou et al. Oct 2005 A1
20050223315 Shimizu et al. Oct 2005 A1
20050228836 Bacastow et al. Oct 2005 A1
20050250439 Leslie Nov 2005 A1
20050256822 Hollingsworth Nov 2005 A1
20050257261 Shraim et al. Nov 2005 A1
20050262258 Kohno et al. Nov 2005 A1
20050289394 Arrouye et al. Dec 2005 A1
20060004840 Senda Jan 2006 A1
20060020469 Rast Jan 2006 A1
20060031316 Forstadius Feb 2006 A1
20060045470 Poslinski et al. Mar 2006 A1
20060047830 Nair et al. Mar 2006 A1
20060047844 Deng Mar 2006 A1
20060048184 Poslinski et al. Mar 2006 A1
20060053045 Danielson et al. Mar 2006 A1
20060057960 Tran Mar 2006 A1
20060061595 Goede et al. Mar 2006 A1
20060069697 Shraim et al. Mar 2006 A1
20060071754 Tofts et al. Apr 2006 A1
20060075205 Martin et al. Apr 2006 A1
20060075444 Dillen Apr 2006 A1
20060077897 Kotzin Apr 2006 A1
20060080261 Christal Apr 2006 A1
20060095404 Adelman et al. May 2006 A1
20060098900 King et al. May 2006 A1
20060101328 Albornoz et al. May 2006 A1
20060109242 Simpkins May 2006 A1
20060123053 Scannell, Jr. Jun 2006 A1
20060129618 Maier Jun 2006 A1
20060129924 Nelson et al. Jun 2006 A1
20060143558 Albornoz et al. Jun 2006 A1
20060145950 Tanaka Jul 2006 A1
20060156222 Chi et al. Jul 2006 A1
20060161635 Lamkin et al. Jul 2006 A1
20060175983 Crouse et al. Aug 2006 A1
20060179137 Jennings, III et al. Aug 2006 A1
20060190489 Vohariwatt et al. Aug 2006 A1
20060190568 Patterson Aug 2006 A1
20060195431 Holzgrafe et al. Aug 2006 A1
20060209175 Cohen et al. Sep 2006 A1
20060236240 Lebow Oct 2006 A1
20060240799 Kim et al. Oct 2006 A1
20060250994 Sasaki et al. Nov 2006 A1
20060253441 Nelson Nov 2006 A1
20060253458 Dixon et al. Nov 2006 A1
20060253461 de Bonet Nov 2006 A1
20060256083 Rosenberg Nov 2006 A1
20060265518 Owens et al. Nov 2006 A1
20060271629 MacDowell Nov 2006 A1
20060281058 Mangoaela Dec 2006 A1
20060282797 Barsness et al. Dec 2006 A1
20070005616 Hay et al. Jan 2007 A1
20070005757 Finger et al. Jan 2007 A1
20070014404 Cha Jan 2007 A1
20070016555 Ito et al. Jan 2007 A1
20070025704 Tsukazaki et al. Feb 2007 A1
20070039023 Kataoka Feb 2007 A1
20070050346 Goel et al. Mar 2007 A1
20070055926 Christiansen et al. Mar 2007 A1
20070061335 Ramer et al. Mar 2007 A1
20070061337 Saito et al. Mar 2007 A1
20070061803 Barrett Mar 2007 A1
20070073596 Alexander et al. Mar 2007 A1
20070078273 Hirota Apr 2007 A1
20070079236 Schrier et al. Apr 2007 A1
20070079383 Gopalakrishnan Apr 2007 A1
20070094285 Agichtein et al. Apr 2007 A1
20070094351 Kalish et al. Apr 2007 A1
20070105536 Tingo, Jr. May 2007 A1
20070112817 Danninger May 2007 A1
20070118533 Ramer et al. May 2007 A1
20070130109 King et al. Jun 2007 A1
20070136660 Gurcan et al. Jun 2007 A1
20070136679 Yang Jun 2007 A1
20070142934 Boercsoek et al. Jun 2007 A1
20070150456 Lian et al. Jun 2007 A1
20070162961 Tarrance et al. Jul 2007 A1
20070174545 Okada et al. Jul 2007 A1
20070185865 Budzik et al. Aug 2007 A1
20070189719 Furumachi et al. Aug 2007 A1
20070219983 Fish Sep 2007 A1
20070233562 Lidwell et al. Oct 2007 A1
20070233692 Lisa et al. Oct 2007 A1
20070234209 Williams Oct 2007 A1
20070238077 Strachar Oct 2007 A1
20070240187 Beach et al. Oct 2007 A1
20070242225 Bragg et al. Oct 2007 A1
20070250573 Rothschild Oct 2007 A1
20070282809 Hoeber et al. Dec 2007 A1
20070283173 Webb et al. Dec 2007 A1
20070288853 Neil Dec 2007 A1
20080005097 Kleewein et al. Jan 2008 A1
20080005203 Bots et al. Jan 2008 A1
20080005664 Chandra Jan 2008 A1
20080016064 Sareday et al. Jan 2008 A1
20080016164 Chandra Jan 2008 A1
20080027933 Hussam Jan 2008 A1
20080031595 Cho Feb 2008 A1
20080040233 Wildman et al. Feb 2008 A1
20080059702 Lu et al. Mar 2008 A1
20080066155 Abraham Mar 2008 A1
20080082518 Loftesness Apr 2008 A1
20080082911 Sorotokin et al. Apr 2008 A1
20080089665 Thambiratnam et al. Apr 2008 A1
20080113614 Rosenblatt May 2008 A1
20080115224 Jogand-Coulomb et al. May 2008 A1
20080120101 Johnson et al. May 2008 A1
20080120280 Iijima et al. May 2008 A1
20080133479 Zelevinsky et al. Jun 2008 A1
20080154908 Datar et al. Jun 2008 A1
20080163039 Ryan et al. Jul 2008 A1
20080164304 Narasimhan et al. Jul 2008 A1
20080165141 Christie Jul 2008 A1
20080168073 Siegel et al. Jul 2008 A1
20080208833 Basmov Aug 2008 A1
20080222552 Batarseh et al. Sep 2008 A1
20080235351 Banga et al. Sep 2008 A1
20080243788 Reztlaff, II et al. Oct 2008 A1
20080243814 Gurcan et al. Oct 2008 A1
20080243828 Reztlaff, II et al. Oct 2008 A1
20080259057 Brons Oct 2008 A1
20080270930 Slosar Oct 2008 A1
20080281058 Araki Nov 2008 A1
20080293450 Ryan et al. Nov 2008 A1
20080294674 Reztlaff, II et al. Nov 2008 A1
20080295039 Nguyen et al. Nov 2008 A1
20080298083 Watson et al. Dec 2008 A1
20080301820 Stevens Dec 2008 A1
20090094528 Gray et al. Apr 2009 A1
20090094540 Gray et al. Apr 2009 A1
20090181649 Bull et al. Jul 2009 A1
20090228774 Matheny et al. Sep 2009 A1
20090231233 Liberatore Sep 2009 A1
20090241054 Hendricks Sep 2009 A1
20090263777 Kohn Oct 2009 A1
20090267909 Chen et al. Oct 2009 A1
20090296331 Choy Dec 2009 A1
20090319482 Norlander et al. Dec 2009 A1
20100023259 Krumm et al. Jan 2010 A1
20100081120 Nanjiani et al. Apr 2010 A1
20100095340 Ei et al. Apr 2010 A1
20100125876 Craner et al. May 2010 A1
20100131385 Harrang et al. May 2010 A1
20100164888 Okumura et al. Jul 2010 A1
20100188327 Frid et al. Jul 2010 A1
20100284036 Ahn et al. Nov 2010 A1
20100328223 Mockarram-Dorri et al. Dec 2010 A1
20110050591 Kim et al. Mar 2011 A1
20110050594 Kim et al. Mar 2011 A1
20110057884 Gormish et al. Mar 2011 A1
20110069073 Unger Mar 2011 A1
20110112671 Weinstein May 2011 A1
20110191710 Jang et al. Aug 2011 A1
20110267333 Sakamoto et al. Nov 2011 A1
20110295926 Battiston et al. Dec 2011 A1
20120001923 Weinzimmer et al. Jan 2012 A1
20120016774 Dicke et al. Jan 2012 A1
20120036431 Ito et al. Feb 2012 A1
20120041941 King et al. Feb 2012 A1
20120079372 Kandekar et al. Mar 2012 A1
20120197998 Kessel et al. Aug 2012 A1
20120227001 Gupta et al. Sep 2012 A1
20130219320 SEET; Chern Hway; et al. Aug 2013 A1
20130246157 Puppin et al. Sep 2013 A1
20140218286 Kim; John T. Aug 2014 A1
Foreign Referenced Citations (45)
Number Date Country
1362682 Aug 2002 CN
1841373 Oct 2006 CN
101120358 Feb 2008 CN
1197902 Apr 2002 EP
1842150 Oct 2007 EP
6274493 Sep 1994 JP
07078139 Mar 1995 JP
09179870 Jul 1997 JP
10091640 Apr 1998 JP
11074882 Mar 1999 JP
2000501214 Feb 2000 JP
2001052016 Feb 2001 JP
2001052025 Feb 2001 JP
2001195412 Jul 2001 JP
2001236358 Aug 2001 JP
2002099739 Apr 2002 JP
2002197079 Jul 2002 JP
2002259718 Sep 2002 JP
2002536736 Oct 2002 JP
2003016104 Jan 2003 JP
2003122969 Apr 2003 JP
2003513384 Apr 2003 JP
2003516585 May 2003 JP
2003517158 May 2003 JP
2003186910 Jul 2003 JP
2005056041 Mar 2005 JP
2006011694 Jan 2006 JP
2006107496 Apr 2006 JP
2006129323 May 2006 JP
2006190114 Jul 2006 JP
2008071334 Mar 2008 JP
2008516297 May 2008 JP
2008527580 Jul 2008 JP
2008197634 Aug 2008 JP
1020020020262 Mar 2002 KR
WO9720274 Jun 1997 WO
WO9720274 Jun 1997 WO
WO0045588 Aug 2000 WO
WO0045588 Aug 2000 WO
WO0056055 Sep 2000 WO
WO0075840 Dec 2000 WO
WO0142978 Jun 2001 WO
WO0239206 May 2002 WO
WO2004055647 Jul 2004 WO
WO2006078728 Jul 2006 WO
Non-Patent Literature Citations (246)
Entry
Cafesoft.com, “Security Glossary”, dated Oct. 13, 2003, retrieved from the Wayback Machine on Jul. 2, 2009 at <<http://web.archive.org/web/20031013022218/http://cafesoft.com/support/security-glossary.html>>.
European Office Action mailed Mar. 26, 20010 for European Patent Application No. 06718773.2, a counterpart foreign application of U.S. Appl. No. 11/039,645.
Office action for U.S. Appl. No. 11/763,357, mailed on May 26, 2011, Reztlaff, “Obtaining and Verifying Search Indices”.
Final Office Action for U.S. Appl. No. 11/763,314, mailed on Jun. 13, 2011, Craig S. Griffin, “Display Dependent Markup Language”.
Non-Final Office Action for U.S. Appl. No. 11/693,682, mailed on Jun. 9, 2011, Hilliard B. Siegel, “Providing Annotations of a Digital Work”.
Office action for U.S. Appl. No. 12/333,215, mailed on Jul. 18, 2011, Zagorie et al., “Device-Specific Presentation Control for Electronic Book Reader Devices”, 22 pages.
Non-Final Office Action for U.S. Appl. No. 11/693,685, John Lattyak, “Relative Progress and Event Indicators”.
U.S. Appl. No. 11/537,484, filed Sep. 29, 2006, Thomas Ryan, “Expedited Acquisition of a Digital Item Following a Sample Presentation of the Item.”
U.S. Appl. No. 11/537,518, filed Sep. 29, 2006, John Lattyak, “Acquisition of an Item based on a Catalog Presentation of Items.”
U.S. Appl. No. 11/693,685, filed Mar. 29, 2007, John Lattyak; John Kim; Steven Moy; Laurent An Minh Nguyen, “Relative Progress and Event Indicators.”
U.S. Appl. No. 11/763,314, filed Jun. 14, 2007, John Lattyak; Craig Griffin; Steven Weiss, “Display Dependent Markup Language.”
U.S. Appl. No. 11/763,339, filed Jun. 14, 2007, David Isbister; Marshall Willilams; Nicholas Vaccaro, “Power Management Techniques for a User Device.”
U.S. Appl. No. 11/763,357, filed Jun. 14, 2007, James Reztlaff II; John Lattyak, “Obtaining and Verifying Search Indices.”
U.S. Appl. No. 11/763,363, filed Jun. 14, 2007, James Reztlaff II; Thomas Ryan, “Search Results Generation and Sorting.”
U.S. Appl. No. 11/763,375, filed Jun. 14, 2007, John Lattyak, Girish Bansil Bajaj, Kevin R. Cheung, Thomas Fruchterman, Robert L. Goodwin, Kenneth P. Kiraly, Richard Moore, Subram Narasimhan, Thomas A. Ryan, Michael V. Rykov, Jon Saxton, James C. Slezak, Beryl Tomay, Aviram Zagorie, Gregg Elliott Zehr, “Delivery of Items for Consumption by a User Device.”
U.S. Appl. No. 11/763,376, filed Jun. 14, 2007, Kenneth Kiraly; Thomas Ryan; Gregg Zehr; John Lattyak; Michael Rykov; Girish Bansilal Bajaj; James Slezak; Aviram Zagorie; Richard Moore; Kevin Cheung; Thomas Fruchterman; Robert Goodwin, “Notification of a User Device to Perform an Action.”
U.S. Appl. No. 11/763,378, filed Jun. 14, 2007, John Lattyak; Thomas Ryan; Gregg Zehr; Kenneth Kiraly; Michael Rykov; Girish Bansilal Bajaj; James Slezak; Aviram Zagorie; Richard Moore; Kevin Cheung; Thomas Fruchterman; Robert Goodwin; Xiaotian Guo, “Transfer of Instructions to a User Device.”
U.S. Appl. No. 11/763,381, filed Jun. 14, 2007, Michael Rykov; Girish Bansilal Bajaj; James Slezak; Aviram Zagorie; Richard Moore; Kevin Cheung; Thomas Fruchterman; Robert Goodwin, “Selecting and Providing Items in a Media Consumption System.”
U.S. Appl. No. 11/763,386, filed Jun. 14, 2007, Thomas Ryan; Gregg Zehr; Kenneth Kiraly; John Lattyak; Michael Rykov; Girish Bansilal Bajaj; James Slezak; Aviram Zagorie; Richard Moore; Kevin Cheung; Thomas Fruchterman; Robert Goodwin, “Handling of Subscription-Related Issues in a Media Consumption System.”
U.S. Appl. No. 11/763,390, filed Jun. 14, 2007, Girish Bansilal Bajaj; Michael Rykov; James Slezak; Aviram Zagorie; Richard Moore; Kevin Cheung; Thomas Fruchterman; Robert Goodwin,, “Providing User-Supplied Items to a User Device.”
U.S. Appl. No. 11/763,392, filed Jun. 14, 2007, Thomas Ryan; Gregg Zehr; Kenneth Kiraly; John Lattyak; Subram Narasimhan; Michael Rykov; Girish Bansilal Bajaj; James Slezak; Aviram Zagorie; Richard Moore; Kevin Cheung; Thomas Fruchterman; Robert Goodwin, “Administrative Tasks in a Media Consumption System .”
U.S. Appl. No. 11/763,393, filed Jun. 14, 2007, John Lattyak; Michael Rykov; Girish Bansilal Bajaj; James Slezak; Aviram Zagorie; Richard Moore; Kevin Cheung; Thomas Fruchterman; Robert Goodwin,, “Incremental Updates of Items .”
U.S. Appl. No. 11/763,395, filed Jun. 14, 2007, Thomas Ryan; Gregg Zehr; Kenneth Kiraly; John Lattyak; Michael Rykov; Girish Bansilal Bajaj; James Slezak; Aviram Zagorie; Richard Moore; Kevin Cheung; Thomas Fruchterman; Robert Goodwin; James Reztlaff II, “Providing Supplemental Information Based on Hints in a Media Consumption System .”
U.S. Appl. No. 11/963,618, filed Dec. 21, 2007, Michael Rykov; Laurent An Minh Nguyen; Steven Moy, “Dissemination of Periodical Samples.”
U.S. Appl. No. 12/333,215, filed Dec. 11, 2008, Aviram Zagorie; Craig Griffin; John Lattyak; Michael Rykov, “Device-Specific Presentation Control for Electronic Book Reader Devices.”
U.S. Appl. No. 12/351,629, filed Jan. 9, 2009, John Johnston; Weiping Dou; Steven Chase, “Antenna Placement on Portable Device .”
U.S. Appl. No. 12/351,663, filed Jan. 9, 2009, Chris Li; Steven Chase, “Surface Mount Clip for Routing and Grounding Cables.”
Cleveland, Jr. et al., “Questions and Answers about Biological Effects and Potential Hazards of Radiofrequency Electromagnetic Fields” OET Bulletin 56, Fourth Edition, Aug. 1999, 38 pages.
Cleveland, Jr., et al, “Evaluating Compliance with FCC Guidelines for Human Exposure to Radiofrequency Electromagnetic Fields” OET Bulletin 65, Edition 97-01, Aug. 1997, 84 pages.
Means, et al., “Evaluating Compliance with FCC Guidelines for Human Exposure to Radiofrequency Electromagnetic Fields”, OET Bulletin 65 Edition 97-01, Jun. 2001, 57 pages.
OQO “A Full PC That Fits in Your Pocket” Retrieved on Sep. 22, 2008 at <<http://www.oqo.com/support/documentation.html>>.
PCT Search Report for International Application No. PCT/US 08/57848, mailed Jul. 7, 2008 (9 pages).
PCT Search Report for International Application No. PCT/US 08/64387, mailed Sep. 9, 2008 (2 pages).
Navarro, et al., “Modern Information Retrieval, Chapter 8: Indexing and Searching”, Jan. 1, 1999, Modern Information Retrieval, ACM Press, New York, pp. 191-228.
BarnesandNoble.com, “Barnes and Noble Homepage”, retrieved on Aug. 2, 2001 http://web.archive.org/web/19981202183957/http://www.barnesandnoble.com/, Dec. 2, 1998.
Cavanaugh, “EBooks and Accommodations”, Teaching Exceptional Children, vol. 35, No. 2, Copyright 2002 CEC, 6 pages.
Translated Chinese Office Action mailed Jul. 14, 2011 for Japanese patent application No. 20078004873.9, a counterpart foreign application of US patent No. 7,865,817, 6 pages.
Office action for U.S. Appl. No. 12/414,914, mailed on Aug. 4, 2011, Agarwal et al., “Questions on Highlighted Passages”, 39 pages.
Non-final Office Action for U.S. Appl. No. 11/537,484, mailed on Aug. 19, 2011, Thomas A. Ryan, “Expedited Acquisition of a Digital Item Following a Sample Presentation of the Item”, 13 pages.
Non-final Office Action for U.S. Appl. No. 11/763,363, mailed on Aug. 26, 2011, James R. Rezlaff II, “Search Results Generation and Sorting”, 10 pages.
Beigbeder et al., “An Information Retrieval Model Using the Fuzzy Proximity Degree of Term Occurences”, 2005 ACM Symposium on Applied Computing, pp. 1018-1022.
Biskup, J., et al, “Towards a Credential-Based Implementation of Compound Access Control Policies” SACMAT '04, Proceedings of the ninth ACM symposium on Access control models and technologies, Jun. 4, 2004, NY, retrieved from the internet: http://portal.acm.org/citation.cfm?id=990036.990042 (retrieved Nov. 9, 2010.
Breu, M. et al., “The Medoc Distrubuted Electronic Library: Accounting and Security Aspects”, Electronic Publishing, New Models and Opportunities, Proceedings of an ICCC/IFIP Conference, Apr. 14, 1997, pp. 237-249.
Gladney, H. M.: “Access Control for Large Collections”, NY, vol. 15, No. 2, Apr. 1, 1997, pp. 154-194.
Henke, H. “Survey on Electronic Book Features”, Open eBook Forum, online, Mar. 20, 2002, pp. 1-14, retrieved from the internet: <http://www.openebook.org/doc—library/surveys/IDPF—eBook—Features—2002.pdf> retrieved Nov. 8, 2010.
Ziviani, N ED, Baeza-Yates R. et at: “Modern Information Retrieval, Text Operations”, Jan. 1, 1999, Modern Information Retrieval, ACM Press, NY, pp. 163-190.
Zobel, J. et al., “Inverted Files for Text Search Engines” ACM Computing Surveys, vol. 38, No. 2, Jul. 1, 2006, pp. 1-56, NY, NY.
“A Universally Unique IDentifier (UUID) URN Namespace”, Jul. 2005, IETF, all pages. Retrieved on Apr. 21, 2010 at http://tools.ietf.org/pdf/rfc4122.pdf.
Bellwood, et al., “UDDI Version 2.04 API Specification UDDI Committee Specification, Jul. 19, 2002”, Oasis, all pages. Retrieved on Apr. 21, 2010 via Wayback Machine at http://web.archive.org/web/20050314033213/www.oasis-open.org/committees/uddi-spec/doc/tcspecs.htm.
PCT Search Report for PCT Application No. PCT/US10/22060, mailed Mar. 8, 2010 (7 pages).
“Universal Unique Identifier”, dated Dec. 16, 2002. The Open Group, all pages. Retrieved on Apr. 21, 2010 via Wayback Machine at http://web.archive.org/web/20021216070918/http://www.opengroup.org/onlinepubs/9629399/apdxa.htm.
“Web Services Architecture: W3C Working Group Note Feb. 11, 2004”, Feb. 11, 2004, W3C, all pages. Retrieved on Apr. 21, 2010 via Wayback Machine at http://web.archive.org/web/2004040205185/http://www.w3.org/TR/ws-arch/.
U.S. Appl. No. 11/277,894, filed Mar. 29, 2006, Jateen P. Parekh, Gregg E. Zehr, and Subram Narasimhan,“Reader Device Content Indexing”.
U.S. Appl. No. 12/360,744, filed Jan. 27, 2009, Rajiv Kotesh Ghanta; Marcos Frid; Joseph J. Hebenstreit; John T. Kim, “Electronic Device With Haptic Feedback.”
U.S. Appl. No. 12/366,941, filed Feb. 6, 2009, Scott Dixon; Eriel Thomas, “Bundled Digital Content.”
U.S. Appl. No. 12/414,914, filed Mar. 31, 2009, Amit Agarwal; Zaur Kambarov; Tom Killalea, “Questions on Highlighted Passages.”
U.S. Appl. No. 29/331,528, filed Jan. 27, 2009, Chris Green, “User Interface Cluster.”
Bradley, “Plastic Shape Shifter”, retreived on May 7, 2009 at <<http://www.reactivereports.com/61/61—3.html>>, Chemistry WebMagazine, Issue No. 61, Dec. 2006, 2 pgs.
Cavanaugh “EBooks and Accommodations”, Teaching Expectional Children vol. 35 No. 2 p. 56-61 Copyright 2002 CEC, pp. 56-61.
Chi et al. “eBooks with Indexes that Reorganize Conceptually”, CHI2004, Apr. 24-29, 2004, Vienna, Austria ACM 1-58113-703-6/04/0004, pp. 1223-1226.
Davison et al. “The Use of eBooks and Interactive Multimedia, as Alternative Forms of Technical Documentation” SIGDOC'05, Sep. 21-23, 2005, Conventry, United Kingdom, Copyright 2005 ACM 1-59593-175-9/05/0009, pp. 108-115.
Elspass, et al., “Portable Haptic Interface with Active Functional Design”, In Proceedings SPIE Conference on Smart Structures and Integrated Systems, Newport Beach, California, vol. 3668, Mar. 1999, 926-932.
“Haptic History—Machine Haptics (Expansion)” retrieved on May 7, 2009 at <<http://hapticshistory.chc61.uci.cu/haptic/site/pages/Machine-Haptics-Became—5.php.>> from Google's cache, text-only version as webpage appeared on Apr. 16, 2009, 8 pgs.
Jones, et al., “Development of a Tactile Vest”, IEEE Computer Society, In the Proceedings of the 12th International Symposium on Haptic Inerfaces for Virtual Environment and Teleoperator Systems, Mar. 27-28, 2004, pp. 82-89.
Leutwyler, “Shape-shifting Polymer Gels”, retrieved on May 7, 2009 at <<http://www.scientificamerican.com/article.cfm?id=shape-shifting-polymer-ge&print=true>>, Scientific American, Nov. 9, 2000, 1 pg.
Nakatani, et al., “3D Form Display with Shape Memory Alloy”, In Proceedings of 13th International Conference on Artificial Reality and Teleexistence (ICAT), 2003, pp. 179-184.
“Shape Memory Polymer”, retrieved on May 7, 2009 at <<http://en.wikipedia.org/wiki/Shape—Memory—Polymer>>, Wikipedia, 8 pgs.
Sohn et al. “Development of a Standard Format for eBooks”, SAC2002, Madrid, Spain, 2002 ACM 1-58113-445-2/02/0, pp. 535-540.
Wellman, et al., “Mechanical Design and Control of a High-Bandwidth Shape Memory Alloy Tactile Display”, Springer-Verlag, In the Proceedings of the International Symposium on Experimental Robotics, Barcelona, Spain, Jun. 1997, pp. 56-66, 12 pgs.
Yoshikawa, et al., “Vertical Drive Micro Actuator for Haptic Display Using Shape Memory Alloy Thin Film”, IEE Japan, Papers of Technical Meeting on Micromachine and Sensor System, Journal Code L2898B, vol. MSS-05, No. 21-44, 2005, pp. 103-108.
“Annotation Engine,” Berkman Center for Internet & Society at Harvard Law School <http://cyber.law .harvard. edulproj ectsl annotate.html> [Retrieved Jan. 30, 2004].
“Annotator Instructions,” Berkman Center for Internet & Society at Harvard Law School <<http://cyber.law.harvard.edu/annotate/instructions.html>>, also found at <<http://cyber.law.harvard.edu/cite/instructions.html>>, [Retrieved Jan. 30, 2004].
“Annotator Wishlist,” Berkman Center for Internet & Society at Harvard Law School r <http://cyber.law.harvard.edulcite/annotate.cgi ?action=print&markup ;center=; view=http%3A%2F%2Fcy . . . > [Retrieved Jan. 30, 2004].
Roscheisen, M., et al., “Beyond Browsing: Shared Comments, SOAPs, Trails, and On-Line Communities,” Computer Networks and ISDN Systems 27:739-749, 1995.
Canadian Office Action mailed Apr. 14, 2009 for Canadian Patent Application No. 2594573, a counterpart foreign application of U.S. Appl. No. 11/039,645.
Translated Chinese Office Action mailed May 9, 2008 for Chinese Patent Application No. 200680002606.2, a counterpart foreign application of U.S. Appl. No. 11/039,645.
Translated Chinese Second Office Action mailed Jun. 5, 2009 for Chinese Patent Application No. 200680002606.2, a counterpart foreign application of U.S. Appl. No. 11/039,645.
Translated Chinese Third Office Action mailed Nov. 27, 2009 for Chinese Patent Application No. 200680002606.2, a counterpart foreign application of U.S. Appl. No. 11/039,645.
Carter, S., et al., “Digital Graffiti: Public Annotation of Multimedia Content,” Proceedings o/the CHI2004, Vienna, Austria, Apr. 24-29, 2004, pp. 1207-1210.
Extended European Search Report mailed Dec. 22, 2009, issued in corresponding European Patent Application No. EP 06 71 8773.2, filed Jan. 18, 2006.
European Office Action mailed Dec. 12, 2009 for European Patent Application No. 06718773.2, a counterpart foreign application of U.S. Appl. No. 11/039,645.
European Search report mailed Dec. 22, 2009 for European Patent Application No. 06718773.2, a counterpart foreign application of U.S. Appl. No. 11/039,645.
Office Action for U.S. Appl. No. 11/763,375, mailed Feb. 23, 2010, 15 pages.
Translated Japanese Office Action mailed Jan. 25, 2011 for Japanese Patent Application No. 2007-552235, a counterpart foreign application of U.S. Appl. No. 11/039,645.
Non-Final Office Action for U.S. Appl. No. 11/537,518, mailed on Apr. 28, 2011, John Lattyak, “Acquisition of an Item Based on a Catalog Presentation of Items”.
International Search Report mailed Sep. 9, 2008, in International Application No. PCT/US/08/64387, filed May 21, 2008, 1 page.
International Search Report mailed Aug. 15, 2008, in International Application No. PCT/US07/89105, filed Dec. 28, 2007, 2 pages.
International Search Report mailed Aug. 15, 2008, in corresponding International Application No. PCT/US08/57829, filed Mar. 21, 2008, 1 page.
International Search Report mailed Jul. 7, 2008, in International Application No. PCT/US08/57848, filed Mar. 31, 2008, 2 pages.
PCT International Search Report and the Written Opinion for Application No. PCT/US 08/64389, mailed on Jan. 28, 2009, 7 pgs.
PCT International Search Report and the Written Opinion for Application No. PCT/US2006/001752, mailed on Jul. 27, 2006, 8 pgs.
“Say NO To Third Voice,” Worldzone.net, 1999-2004, <http://worldzone.netiinternetipixelsnttv/index.html> [retrieved Jan. 30, 2004].
“The Berkman Center for Internet & Society at Harvard Law School: Annotation Engine,” Harvard.Edu, 1999-2004, <http://cyber.iaw.harvard.eduJprojects/annotate.html> [Retrieved Jan. 30, 2004].
Marshall, C.C., “The Future of Annotation in a Digital (Paper) World,” Proceedings o/the 35th Annual GSLIS Clinic, University of Illinois at UrbanaChampaign, Urbana, 11, Mar. 22-24, 1998, pp. 1-19.
Kumar, A., “Third Voice Trails off . . . ,” Wired News, 2004, <http://www.wired.comlnews/printIO. 1294,42803 ,00.html> [retrieved Jan. 30, 2004].
Desmoulins et al., “Pattern-Based Annotations on E-books: From Personal to Shared Didactic Content”, Proceedings of the IEEE International Workshop on Wireless adn Mobile Techniques in Education, 2002, 4 pages.
Leach et al, “A Universally Unique IDentifier (UUID) URN Namespace”, Jul. 2005, IETF, retrieved on Apr. 21, 2010 at http://tools.ietf.org/pdf/rfc4122.pdf, 32 pgs.
Card et al., “3Book: A 3D Electronic Smart Book”, AVI'04 May 25-28, 2004, Hallipoli, Italy, ACM 2004, pp. 303-307.
Translated Chinese Office Action mailed Oct. 10, 2011 for Chinese patent application No. 200880017259.X, a counterpart foreign application of U.S. Appl. No. 11/693,682, 7 pages.
Translated Chinese Office Action mailed Aug. 25, 2011 for Chinese patent application No. 200880024964.2, a counterpart foreign application of U.S. Appl. No. 11/763,358, 6 pages.
Translated Chinese Office Action mailed Sep. 26, 2011 for Chinese patent application No. 200880017589.9, a counterpart foreign application of U.S. Appl. No. 11/763,369, 9 pages.
Translated Chinese Office Action mailed Sep. 30, 2011 for Chinese patent application No. 200880025056.5, a counterpart foreign application of U.S. Appl. No. 11/763,374, 9 pages.
Translated Japanese Office Action mailed Oct. 25, 2011 for Japanese patent application No. 2007-552235, a counterpart foreign application of U.S. Appl. No. 11/039,645, 3 pages.
Mercier et al., “Sphere of influence Model in Information retrieval”, IEEE 2005 International Conference on Fuzzy Systems, pp. 120-125.
Final Office Action for U.S. Appl. No. 11/537,484, mailed on Jan. 24, 2012, Thomas A. Ryan, “Expedited Acquisition of a Digital Item Following a Sample Presentation of the Item”, 22 pages.
Final Office Action for U.S. Appl. No 12/414,914, mailed on Jan. 4, 2012, Agarwal et al., “Questions on Highlighted Passages”, 41 pages.
Final Office Action for U.S. Appl. No. 11/763,392, mailed on Oct. 14, 2011, Thomas Ryan, “Administrative Tasks in a Media Consumption System”, 38 pages.
Office action for U.S. Appl. No. 11/763,390, mailed on Oct. 24, 2011, Bajaj et al., “Providing User-Supplied Items to a User Device”, 11 pages.
Final Office Action for U.S. Appl. No. 12/759,828, mailed on Nov. 10, 2011, James R. Retzalff II, “Search and Indexing on a User Device”, 16 pages.
Final Office Action for U.S. Appl. No. 11/537,518, mailed on Nov. 25, 2011, John Lattyak, “Acquisition of an Item Based on a Catalog Presentation of Items,” 8 pages.
Non-Final Office Action for U.S. Appl. No. 11/763,386, mailed on Nov. 8, 2011, Thomas Ryan, “Handling of Subscription-Related Issues in a Media Consumption System”, 10 pages.
Non-Final Office Action for U.S. Appl. No. 11/763,395, Thomas Ryan, “Providing Supplemental Information Based on Hints in a Media Consumption System”, 10 pages.
Office action for U.S. Appl. No. 11/763,357 , mailed on Dec. 21, 2011, Reztlaff et al., “Obtaining and Verifying Search Indices”, 14 pages.
Final Office Action for U.S. Appl. No. 11/763,363, mailed on Dec. 23, 2011, James R. Rezlaff II et al., “Search Results Generation and Sorting”, 10 pages.
Non-Final Office Action for U.S. Appl. No. 11/763,369, mailed on Dec. 29, 2011, James R. Reztlaff II et al., “Search of Multiple Content Sources on a User Device”, 21 pages.
Final Office Action for U.S. Appl. No. 11/693,685, dated Dec. 8, 2011, John Lattyak et al., “Relative Progress and Event Indicators”, 23 pages.
Non-Final Office Action for U.S. Appl. No. 11/763,358, mailed on Sep. 12, 2011, James R. Retzlaff II, “Managing Status of Search Index Generation”, 11 pages.
Final Office Action for U.S. Appl. No. 11/963,618, mailed on Sep. 26, 2011, Michael Rykov, “Dissemination of Periodical Samples”, 15 pages.
Non-Final Office Action for U.S. Appl. No. 11/763,374, mailed on Sep. 27,2011, Thomas Ryan, “Consumption of Items via a User Device”, 17 pages.
Translated Chinese Office Action mailed Aug. 3, 2012 for Chinese patent application No. 200880025056.5, a counterpart foreign application of U.S. Appl. No. 11/763,374, 17 pages.
Translated Chinese Office Action mailed Sep. 24, 2012 for Chinese patent application No. 200880017259.X, a counterpart foreign application of U.S. Appl. No. 11/693,682, 5 pages.
Final Office Action for U.S. Appl. No. 12/414,914, mailed on Jan. 4, 2012, 16 pgs.
Office action for U.S. Appl. No. 11/763,374 mailed on Oct. 16, 2012, Ryan et al, “Consumption of Items via a User Device”, 13 pages.
Office action for U.S. Appl. No. 13/083,445, mailed on Oct. 5, 2012, Siegel et al., “Method and System for Providing Annotations of a Digital Work”, 29 pages.
Final Office Action for U.S. Appl. No 11/763,374, mailed on Feb. 13, 2012, Thomas Ryan et al., “Consumption of Items via a User Device”, 14 pages.
Non-Final Office Action for U.S. Appl. No. 11/763,393, mailed on Feb. 16, 2012, John Lattyak et al., “Incremental Updates of Items”, 24 pages.
Final Office Action for U.S. Appl. No. 12/360,089, mailed on Mar. 28, 2012, Tom Killalea et al., “Aggregation of Highlights”, 17 pages.
Non-Final Office Action for U.S. Appl. No. 12/366,941, mailed on Mar. 30, 2012, Scott Dixon et al., “Bundled Digital Content”, 12 pages.
Translated Chinese Office Action mailed May 17, 2012 for Chinese patent application No. 20078004873.9 a counterpart foreign application of US patent No. 7,865,817, 5 pages.
Translated Chinese Office Action mailed May 21, 2012 for Chinese patent application No. 20078004873.9, a counterpart foreign application of U.S. Appl. No. 11/763,369, 9 pages.
Office action for U.S. Appl. No. 11/693,682, mailed on Apr. 23, 2012, Siegel et al., “Providing Annotations of a Digital Work”, 12 pages.
Final Office Action for U.S. Appl. No. 11/763,386, mailed on Apr. 26, 2012, Thomas Ryan et al., “Handling of Subscription-Related Issues in a Media Consumption System”, 14 pages.
Non-Final Office Action for U.S. Appl. No. 13/083,445, mailed on May 4, 2012, Hilliard B. Siegel et al., “Method and System for Providing Annotations of a Digital Work”, 20 pages.
Final Office Action for U.S. Appl. No. 11/763,395, mailed May 9, 2012, Thomas Ryan et al., “Providing Supplemental Information Based on Hints in a Media Consumption System”, 12 pages.
Office action for U.S. Appl. No. 11/763,390, mailed on Jun. 27, 2012, Bajaj et al., “Providing User-Supplied Items to a User Device”, 7 pages.
Office action for U.S. Appl. No. 11/763,392, mailed on Jun. 27, 2012, Ryan et al., “Administrative Tasks in a Media Consumption System”, 47 pages.
On-Final Office Action for U.S. Appl. No. 12/943,211, mailed on Jun. 6, 2012, James. R. Retzlaff II et al., “Obtaining and Verifying Search Indices”, 10 pages.
Non-Final Office Action for U.S. Appl. No. 11/763,369 mailed on Jun. 7, 2012, James R. Reztlaff II et al., “Search of Multiple Content Sources on a User Device”, 20 pages.
Canadian Office Action mailed Jul. 6, 2012 for Canadian patent application No. 2594573, a counterpart foreign application of US patent application No. 8,131,647, 5 pages.
Translated Japanese Office mailed Oct. 12, 2012 for Japanese patent application No. 2009-544304, a counterpart foreign application of US patent No. 7,865,817, 6 pages.
Translated Japanese Office Action mailed Sep. 18, 2012 for Japanese patent application No. 2007-552235, a counterpart foreign application of US patent No. 8,131,647, 4 pages.
Office action for U.S. Appl. No. 11/693,685, mailed on Aug. 15, 2013, Lattyak et al., “Relative Progress and Event Indicators”, 24 pages.
US Pat. Pub. No. 2004081300 dated Apr. 29, 2004, corresponds to Japanese Patent Application Laid-open No. 2002-259718, 14 pages.
US Patent No. 7,340,436 dated Mar. 4, 2008, corresponds to Japanese Patent Application Laid-open No. 2003-513384, 7 pages.
Translated Chinese Office Action mailed Dec. 13, 2012 for Chinese patent application No. 20078004873.9, a counterpart foreign application of US patent No. 7,865,817, 4 pages.
Translated Chinese Office Action mailed Dec. 14, 2012 for Chinese patent application No. 200880017589.9, a counterpart foreign application of U.S. Appl. No. 11/763,369, 8 pages.
Translated Chinese Office Aciton mailed Feb. 1, 2013 for Chinese patent application No. 200880025056.5, a counterpart foreign application of U.S. Appl. No. 11/763,374, 19 pages.
Chinese Office Action mailed Jun. 28, 2013 for Chinese patent application No. 20078004873.9, a counterpart foreign application of US patent application No. 7,865,817, 4 pages.
Translated Chinese Office Action mailed Jun. 6, 2013 for Chinese patent application No. 201080006308.7, a counterpart foreign application of US patent No. 8,378,979, 13 pages.
Translated Chinese Office Action mailed Jul. 10, 2013 for Chinese patent application No. 200880025056.5, a counterpart foreign application of U.S. Appl. No. 11/763,377, 8 pages.
European Office Action mailed Jun. 10, 2013 for European patent application No. 06718773.2, a counterpart foreign application of U.S. Appl. No. 11/693,682, 6 pages.
Goodreads.com, “About goodreads”, 2006, 2 pages.
Translated Japanese Office Action mailed Dec. 17, 2012 for Japanese patent application No. 2010-509529, a counterpart foreign application of U.S. Appl. No. 11/763,374, 7 pages.
Translated Japanese Office Action mailed Dec. 7, 2012 for Japanese patent application No. 2010-501124, a counterpart foreign application of U.S. Appl. No. 11/693,682, 6 pages.
Translated Japanese Office Action mailed Apr. 12, 2013 for Japanese patent application No. 2010-501125, a counterpart foreign application of U.S. Appl. No. 11/763,369, 5 pages.
Translated Japanese Office Action mailed May 24, 2013 for Japanese patent application No. 2010-501124, a counterpart foreign application of U.S. Appl. No. 11/693,682, 7 pages.
Translated Japanese Office Action mailed May 31, 2013 for Japanese patent application No. 2010-509529, a counterpart foreign application of U.S. Appl. No. 11/763,374, 5 pages.
Translated Japanese Office Action mailed Aug. 23, 2013 for Japanese patent application No. 2009-544304, a counterpart foreign application of US patent No. 7,865,817, 4 pages.
Office action for U.S. Appl. No. 12/943,211, mailed on Feb. 6, 2013, Reztlaff, II et al., “Obtaining and Verifying Search Indices”, 9 pages.
Office action for U.S. Appl. No. 11/763,392, mailed on Feb. 14, 2013, Ryan et al., “Administrative Tasks in a Media Consumption System”, 47 pages.
Office action for U.S. Appl. No. 13/294,803, mailed on Feb. 21, 2013, Inventor #1, “Progress Indication for a Digital Work”, 76 pages.
Office action for U.S. Appl. No. 11/763,386, mailed on Feb. 28, 2013, Ryan et al., “Handling of Subscription-Related Issues in a Media Consumption System”, 17 pages.
Office action for U.S. Appl. No. 11/763,374, mailed on Apr. 22, 2013, Ryan et al., “Consumption of Items via a User Device”, 17 pages.
Office action for U.S. Appl. No. 11/763,390, mailed on Apr. 8, 2013, Bajaj et al, “Providing User-Supplied Items to a User Device”, 7 pages.
Office action for U.S. Appl. No. 11/763,369, mailed on May 14, 2013, Reztlaff, II et al., “Search of Multiple Content Sources on a User Device”, 24 pages.
Office action for U.S. Appl. No. 11/763,395, mailed on May 2, 2013,Ryan et al., “Providing Supplemental Information Based on Hints in a Media Consumption System”, 12 pages.
Office action for U.S. Appl. No. 13/294,803, mailed on Jun 4, 2013, Lattyak et al., “Progress Indication for a Digital Work”, 26 pages.
Office action for U.S. Appl. No. 12/759,828, mailed on Jun. 6, 2013, Reztlaff, II et al., “Search and Indexing on a User Device”, 27 pages.
Office action for U.S. Appl. 11/693,685, mailed on Aug. 15, 2013, Lattyak et al., “Relative Progress and Event Indicators”, 24 pages.
Office action for U.S. Appl. No. 11/763,376, mailed on Aug. 19, 2013, Kiraly et al., “Notification of a User Device to Perform an Action”, 16 pages.
Office action for U.S. Appl. No. 11/537,484, mailed on Aug. 27, 2013, Ryan, “Expedited Acquisition of a Digital Item Following a Sample Presentation of the Item”, 13 pages.
Office action for U.S. Appl. No. 12/414,914, mailed on Sep. 13, 2013, Agarwal et al, “Questions on Highlighted Passages”, 35 pages.
Final Office Action for U.S. Appl. No. 11/763,369, mailed on Sep. 16, 2013, James R. Reztlaff II et al., “Search of Multiple Content Sources on a User Device”, 23 pages.
Office Action for U.S. Appl. No. 13/294,803, mailed on Sep. 24, 2013, John Lattyak, “Progress Indication for a Digital Work”, 27 pages.
Office action for U.S. Appl. No. 13/722,961, mailed on Sep. 5, 2013, Lattyak et al., “Delivery of Items for Consumption by a User Device”, 6 pages.
Oki et al., “The Infomation Bus—An Architecture for Extensive Distributed Systems”, ACM, 1993, 11 pages.
Palm Reader Handbook, Palm Inc., 2000, 56 pages.
International Search Report mailed Sep. 9, 2008, in International Application No. PCT/US08/64387, filed May 21, 2008, 1 page.
Translated Chinese Office Action mailed Nov. 5, 2013 for Chinese patent application No. 200880025056.5, a counterpart foreign application of U.S. Appl. No. 11/763,374, 15 pages.
Final Office Action for U.S. Appl. No. 11/763,395, mailed on Oct. 30, 2013, Thomas A. Ryan, “Providing Supplemental Information Based on Hints in a Media Consumption System”, 14 pages.
Office action for U.S. Appl. No. 11/763,386, mailed on Oct. 16, 2013, Ryan et al., “Handling of Subscription-Related Issues in a Media Consumption System”,18 pages.
Office Action for U.S. Appl. No. 12/943,211, mailed on Oct. 8, 2013, “Obtaining and Verifying Search Indices”, 9 pages.
Canadian Office Action mailed May 29, 2014 for Canadian patent application No. 2684580, a counterpart foreign application of U.S. Appl. No. 11/763,374, 3 pages.
Translated Chinese Office Action mailed Feb. 25, 2014 for Chinese patent application No. 200880025056.5 , a counterpart foreign application of U.S. Appl. No. 11/763,374, 13 pages.
Translated Chinese Office Action mailed Jan. 6, 2014 for Chinese patent application No. 201080006308.7, a counterpart foreign application of US patent No. 8,378,979, 12 pages.
Chinese Office Action mailed Jun. 5, 2014 for Chinese patent application No. 201080006308.7, a counterpart foreign application of US patent No. 8,378,979, 9 pages.
European Office Action mailed Apr. 7, 2014 for European patent application No. 06718773.2, a counterpart foreign application of US patent No. 8,131,647, 7 pages.
Final Office Action for U.S. Appl. No. 12/414,914, mailed on Feb. 10, 2014, Amit D. Agarwal, “Questions on Highlighted Passages”, 40 pages.
Homer, et al., “Instant HTML”, Wrox Press, 1997, pp. 76-79.
Translated Japanese Office Action mailed Jan. 14, 2014 for Japanese patent application No. 2011-548210, a counterpart foreign application of US patent No. 8,378,979, 4 pages.
Office Action for U.S. Appl. No. 11/537,518, mailed on Feb. 14, 2014, John Lattyak, “Acquisition of an Item Based on a Catalog Presentation of Items”, 14 pages.
Office Action for U.S. Appl. No. 11/763,314, mailed on Mar. 10, 2014, Craig S. Griffin, “Display Dependent Markup Language”, 42 pages.
Office action for U.S. Appl. No. 12/366,941, mailed on Mar. 14, 2014, Dixon et al., “Bundled Digital Content”, 13 pages.
Final Office Action for U.S. Appl. No. 11/693,685, mailed on Mar. 24, 2014, John Lattyak, “Relative Progress and Event Indicators”, 26 pages.
Office Action for U.S. Appl. No. 11/763,357, mailed on Mar. 27, 2014, James R. Retzlaff II, “Obtaining and Verifying Search Indices”, 14 pages.
Office Action for U.S. Appl. No. 13/722,961, mailed on Apr. 25, 2014, John Lattyak, “Delivery of Items for Consumption by a User Device”, 4 pages.
Final Office Action for U.S. Appl. No. 11/763,374, mailed on May 14, 2014, Thomas A. Ryan, “Consumption of Items via a User Device”, 21 pages.
Final Office Action for U.S. Appl. No. 12/759,828, mailed on May 2, 2014, James R. Retzlaff II, “Search and Indexing on a User Device”, 27 pages.
Office Action for U.S. Appl. No. 13/959,589, mailed on Jun. 2, 2014, Thomas A. Ryan, “Administrative Tasks in a Media Consumption System”, 24 pages.
Office action for U.S. Appl. No. 13/284,446, mailed on Jun. 24, 2014, Hansen, “Indicators for Navigating Digital Works”, 19 pages.
Office Action for U.S. Appl. No. 12/949,115, mailed on Jun. 4, 2014, Thomas A. Ryan, “Invariant Referencing in Digital Works”, 11 pages.
Office action for U.S. Appl. No. 12/943,211, mailed on Jul. 2, 2014, Retzlaff, II et al., “Obtaining and Verifying Search Indices”, 9 pages.
“Trilogy Definition”, Merriam-Webster's Collegiate Dictionary, Tenth Edition, 1999, 2 pages.
Translated Japanese Office Action mailed Nov. 12, 2013 for Japanese patent application No. 2010-501125, a counterpart foreign application of U.S. Appl. No. 11/763,369, 9 pages.
“Mastering to Become a True Manager, Well-selected commands for an efficient event log management, Part 1,” Windows Server World, vol. 9, No. 2, pp. 86-96, IDG Japan, Japan, Feb. 1, 2004.
Office Action for U.S. Appl. No. 12/759,828, mailed on Dec. 17, 2013, James R. Retzlaff II, “Search and Indexing on a User Device”, 25 pages.
Office Action for U.S. Appl. No. 11/763,374, mailed on Dec. 24, 2013, Thomas A. Ryan, “Consumption of Items via a User Device”, 16 pages.
Canadian Office Action mailed Aug. 14, 2014 for Canadian patent application No. 2684955, a counterpart foreign application of U.S. Appl. No. 11/693,682, 3 pages.
Translated Chinese Office Action mailed Jun. 16, 2014 for Chinese patent application No. 200880025056.5, a counterpart foreign application of U.S. Appl. No. 11/763,374, 18 pages.
Barnes & Noble, “Nook User Guide”, retrieved from the Internet Feb 5, 2013, 120 Pages.
Kindle Community, Discussions—Screen Saver, retrieved from the Internet on Nov. 06, 2009 at <<http://www.amazon.com/tag/kindle/forum?cdForum=Fx1D7SY3BVSESG&cdThread=Tx28QGUBE29L22J>>, 4 Pages.
“Kobo Wireless eReader & Desktop Application User Guide”, Feb 2011, 170 Pages.
Office Action for U.S. Appl. No. 12/886,877, mailed on Jan. 15, 2015, Gilles Jean Roger Belin, “Cover Display”, 45 Pages.
Office Action for U.S. Appl. No. 12/886,877, mailed on Feb. 21, 2014, Gilles Jean Roger Belin, “Cover Display”, 36 Pages.
Office Action for U.S. Appl. No. 13/070,328, mailed on Feb. 25, 2014, Sailesh Rachabathuni, “Last Screen Rendering for Electronic Book Readers”, 11 Pages.
Office action for U.S. Appl. No. 12/567,984, mailed on Mar. 15, 2013, Kim, “Last Screen Rendering for Electronic Book Readern”, 10 Pages.
Office action for U.S. Appl. No. 13/070,328, mailed on 7/25/13, Rachabathuni, “Last Screen Rendering for Electronic Book Readers”, 11 Pages.
Office action for U.S. Appl. No. 13/070,328, mailed on Aug. 12, 2014, Rachabathuni, “Last Screen Rendering for Electronic Book Readers”, 6 Pages.
Office action for U.S. Appl. No. 12/886,877, mailed on 8/13/14, Belin et al., “Cover Display”, 40 Pages.
Office action for U.S. Appl. No. 12/886,877, mailed on Sep. 11, 2013, Belin et al., “Cover Display”, 31 Pages.
Non-Final Office Action for U.S. Appl. No. 12/567,984, mailed on Sep. 27, 2012, John T. Kim, “Last Screen Rendering for Electronic Book Reader”, 9 Pages.
Copy of the Canadian Office Action mailed Dec. 15, 2014 for Canadian patent application No. 2681754, a counterpart foreign application of U.S. Appl. No. 11/763,369, 5 Pages.
Copy of the Mintues of the Oral Proceedings mailed on Nov. 27, 2014 for European patent application No. 06718773.2, a counterpart foreign application of U.S. Appl. No. 8,131,647, 13 Pages.
Copy of the European Office Action mailed Sep. 23, 2014 for European patent application No. 08732668.2, a counterpart foreign application of U.S. Appl. No. 11/763,369, 7 Pages.
Copy of the European Office Action mailed Nov. 27, 2014 for European patent application No. 06718773.2, a counterpart foreign application of U.S. Appl. No. 8,131,647, 31 Pages.
Malloy, et al., “Google Search”, retrieved on Sep. 17, 2014 at <<http://en.wikipedia.org/w/index.php?title=GoogleSearch&oldid=118323867>>, Wikipedia, the free encyclopedia, Mar. 27, 2007, 6 Pages.
Translated Copy of the Japanese Office Action mailed Sep. 2, 2014 for Japanese patent application No. 2011-548210, a counterpart foreign application of U.S. Appl. No. 12/360,744, 4 Pages.
Translated Copy of the Japanese Office Action mailed Dec. 16, 2014 for Japanese patent application No. 2009-544304, a counterpart foreign application of U.S. Appl. No. 11/693,677, 2 Pages.
Translated copy of the Japanese Office Action mailed Aug. 5, 2014 for Japanese patent application No. 2010-501125, a counterpart foreign application of U.S. Appl. No. 11/763,369, 7 Pages.
Translated copy of the Korean Office Action mailed Dec. 19, 2014 for Korean patent application No. Oct. 2009-7024280, a counterpart foreign application of U.S. Appl. No. 11/763,374, 10 Pages.
Office Action for U.S. Appl. No. 12/366,941, mailed on Jan. 6, 2015, Scott Dixon, “Bundled Digital Content”, 15 Pages.
Final Office Action for U.S. Appl. No. 11/537,518, mailed on Jan. 9, 2015, John Lattyak, “Acquisition of an Item Based on a Catalog Presentation of Items”, 13 Pages.
Office Action for U.S. Appl. 13/722,961, mailed on Oct. 10, 2014, John Lattyak, “Delivery of Items for Consumption by a User Device”, 8 Pages.
Final Office Action for U.S. Appl. No. 13/284,446, mailed on Oct. 31, 2014, Linsey R. Hansen, “Indicators for Navigating Digital Works”, 17 Pages.
Office Action from the U.S. Patent and Trademark Office for Application U.S. Appl. No. 11/763,378, mailed on Oct. 6, 2014, Lattyak et al., “Transfer of Instructions to a User Device ”, 16 Pages.
Office Action for U.S. Appl. No. 11/693,682, mailed on Oct. 7, 2014, Siegelet al., “Providing Annotations of a Digital Work”, 12 Pages.
Final Office Action for U.S. Appl. No. 13/959,589, mailed on Nov. 6, 2014, Thomas A. Ryan, “Administrative Tasks in a Media Consumption System”, 29 Pages.
Office action for U.S. Appl. No. 11/763,314, mailed on Aug. 28, 2014, Griffin et al., “Display Dependent Markup Language”, 52 Pages.
Office action for U.S. Appl. No. 13/083,445, mailed on Sep. 24, 2014, Siegel et al., “Method and System for Providing Annotations of a Digital Work”, 31 Pages.
Office action for U.S. Appl. No. 11/537,518, mailed on 9/4/14, Lattyak, “Acquisition of an Item Based on a Catalog Presentation of Items”, 10 Pages.
Final Office Action for U.S. Appl. No. 11/763,378, mailed on Feb. 05, 2015, John Lattyak, “Transfer of Instructions to a User Device”, 21 Pages.
Office Action for U.S. Appl. No. 13/959,589, mailed on Feb. 26, 2015, Thomas A. Ryan, “Administrative Tasks in a Media Consumption System”, 45 Pages.
Copy of the Canadian Office Action mailed Mar. 30, 2015 for Canadian patent application No. 2688002, a counterpart foreign application of U.S. Appl. No. 11/763,358, 5 Pages.
Translated copy of the Chinese Office Action mailed Mar. 30, 2015 for Chinese patent application No. 200880017589.9, a counterpart foreign application of U.S. Appl. No. 11/763,369, 10 Pages.
Copy of the Japanese Office Action mailed Mar. 10, 2015 for Japanese patent application No. 2010-501125, a counterpart foreign application of U.S. Appl. No. 11/763,369, 19 Pages.
Final Office Action for U.S. Appl. No. 12/943,211, mailed on Apr. 24, 2015, James R. Retzlaff II, “Obtaining and Verifying Search Indices”, 10 Pages.