US 7,308,485 B2Grant
Method and system for accessing web pages based on playback of recordings
Issue Date:2007-12-11
•38 Claims
•4 Drawing Sheets
Abstract
Entertainment content complementary to a musical recording is delivered to a user's computer by means of a computer network link. The user employs a browser to access the computer network. A plug-in for the browser is able to control an audio CD or other device for playing the musical recording. A script stored on the remote computer accessed over the network is downloaded. The script synchronizes the delivery of the complementary entertainment content with the play of the musical recording.
Metadata
Assignee
- Gracenote, Inc.
Inventors
- Dale Tyson Roberts
- Ann E. Greenberg
Application Information
Application Number:US 09/820,722
Filing Date:2001-03-30
Priority Date:1997-04-15
Art Unit:2154
Classifications
IPC:
G06F13/00
Patent Drawings (4 sheets)
Description
Cross-Reference to Related Applications
[0001] This is a continuation of U.S. patent application Ser. No. 09/354,166, filed Jul. 16, 1999 now U.S. Pat. No. 6,230,192 which is a divisional of U.S. patent application Ser. Nos. 08/838,082 filed Apr. 15, 1997 now U.S. Pat. No. 5,987,525 and 09/060,876 filed Apr. 15, 1998 now U.S. Pat. No. 6,154,773 all three hereby incorporated by reference.
Background
[0002] 1. Field of the Invention
[0003] This invention pertains to the field of computer networking, and more particularly to the use of network protocols to provide services to users which are related to audio recordings.
[0004] 2. Related Art
[0005] Over the past few years, on-line services have experienced explosive growth and have become a major new form of entertainment. Alongside this new entertainment, more traditional forms such as musical recordings have continued to be consumed on a massive scale.
[0006] The traditional experience of the musical recording is listening by a small group of persons gathered together in a room. The music fills the room acoustically, but there is little associated visual content, and there is only a limited interaction with the recording, consisting essentially of deciding which tracks to play and performing simple transformations on the recorded sound, such as setting the volume or applying an audio equalizer. This traditional experience dates back to the early age of 78 r.p.m. musical recordings almost a century ago.
[0007] The traditional production of a musical recording complements the traditional experience of the recording. The recording is produced in a number of recording sessions, subject to careful mixing and editing, and then released to the public. At that point, the recording is in a fixed form, nowadays an audio CD, whose purpose is to record as faithfully as possible the final sonic experience designed by its authors, the musicians, producer, and recording engineers.
[0008] Music videos have supplemented the traditional experience of musical recordings by allowing the association of visual content with tracks of such a recording. In practice, however, music videos have been broadcast, with all the problems of lack of user control which that implies, and they have not contributed to interactivity or participation by the consumer.
[0009] On-line services offer opportunities for enriching the experience associated with musical recordings. The present invention is addressed to computer programs, systems, and protocols which can fulfil this promise.
Summary of the Invention
[0010] It is therefore an object of this invention to provide computer programs, systems, and protocols which allow producers to deliver entertainment complementary to musical recordings by means of on-line services such as the Internet. It is a further object of this invention to provide computer programs, systems, and protocols which allow such complementary entertainment to be meaningfully interactive for the consumer, such that the consumer can also be a creator of the experience.
[0011] It is a further object of the invention to achieve the foregoing objects by means of implementations designed to attain integration with existing environments and programs, particularly on the Internet, while retaining the flexibility to adapt to the continuing evolution of standards for on-line services.
[0012] In one aspect of the invention, software is provided which permits a computer program running on a remote host to control a compact disk (CD) player, DVD player, or the like on a user's computer. (For convenience, we use the term “CD player” to refer also to DVD players and similar devices.) The software is designed to permit the remote host both to initiate actions on the CD player and to become aware actions which the user has initiated by other control means, such as the buttons on the CD player's front panel or a different CD player control program. This aspect of the invention is a building-block for the provision of complementary entertainment for musical recordings when those recordings are fixed in the prevailing contemporary form, the audio CD.
[0013] In a second aspect of the invention, visual content, including interactive content, may be delivered over an on-line service in such a way that it is synchronized to the delivery of content from a musical recording. Such visual content may, for example, be synchronized to the playing of an audio CD in the user's computer. The visual content is thematically linked to the musical recording, for example in the manner of a music video.
[0014] In a third aspect of the invention, a method is provided for assigning a unique identifier to musical recordings consisting of a number of tracks. A unique identifier is a useful complement to the delivery of visual content in conjunction with the playing of an audio CD in that it allows the software which delivers the visual content to be sure that the audio CD is in fact the correct CD to which the visual content corresponds. If the visual content is designed, for example, to accompany the Rosary Sonatas of Heinrich Ignaz Franz Biber, it would presumably not function well if the CD in the user's player were the soundtrack for the film Mary Poppins. The unique identifier also allows a CD to be used as a key to access a premium Web area. Furthermore, the unique identifier can allow the user to be directed to an area of the Web corresponding to the CD which is in the user's machine.
[0015] In a fourth aspect of the invention, the immensely popular on-line service generally referred to as a “chat room” may be enhanced by means of a link to a musical recording to which all persons in the room are listening. The chat room experience as it exists today in on-line services has a disembodied quality by comparison with traditional face-to-face social encounters, in which there are identifiable surroundings. The only common experience to the chat users today are the words of the chat as they fly by on a computer screen, and perhaps the user icons (“avatars”) or other visual content occupying a small space on the screen. The use of a musical recording in conjunction with a chat room opens up the possibility of restoring to the experience a degree of the shared ambience of traditional social encounters. Furthermore, the musical recording offers a focal point that allows chat-seekers to group together by means of shared interests in a particular type of recording.
Brief Description of the Drawings
[0016] FIG. 1 is a block diagram of the environment in which the preferred embodiment operates.
[0017] FIG. 2 is a flowchart of the synchronization code of the invention.
[0018] FIG. 3 is a flowchart of the sequence of operations for connection to a chat room focused on a musical recording.
Description of Preferred Embodiments
1. Introduction
[0019] The preferred embodiment of this invention operates on the World Wide Web. The software implementation environment provided by the World Wide Web is described in a number of books, for example, John December & Mark Ginsburg, HTML 3.2 and CGI Unleashed (1996). The World Wide Web is based on a network protocol called HTTP (hypertext transfer protocol), which is described in T. Berners-Lee et al., Hypertext Transfer Protocol—HYTP/1.0 (Internet Request for Comments No. 1945, 1996). The HTTP protocol must be run atop a general connection-oriented protocol, which today is generally TCP/IP, described in Douglas E. Comer, Internetworking with TCP/IP (3d ed. 1995). However, the invention described here is not limited to HTTP running over any particular kind of network software or hardware. The principles of the invention apply to other protocols for access to remote information that may come to compete with or supplant HTTP.
[0020] As shown in FIG. 1 , a Web user sits at his or her computer and runs a computer program called a browser. The browser sends out HTTP requests to other computers, referred to as servers. In requests, particular items of data, referred to as resources, which are available on servers, are referred to by means of uniform resource locators (URL's), character strings in a particular format defined in Berners-Lee et al., supra. A URL includes both an identification of the server and an identification of a particular item of data within the server. Reacting to the requests, the servers return responses to the user's browser, and the browser acts upon those responses, generally by displaying some sort of content to the user.
[0021] The content portion of the responses can be a “Web page,” expressed in the hypertext markup language (HTML). That language allows one to express content consisting of text interspersed with bitmap-format images and links (also known as anchors and hyperlinks). The links are further URL's to which the browser may, at the user's prompting, send further requests.
[0022] The responses can also include more complex commands to be interpreted by the browser, e.g., commands which result in an animation. HTML itself does not define complex commands, but rather they are considered to belong to separately-defined scripting languages, of which the two most common ones are JavaScript and VBScript.
[0023] In addition to extending the function of the browser by means of code written in a scripting language, it is also possible to extend the function of a browser with compiled code. Such compiled code is referred to as a “plug-in.” The precise protocol for writing a plug-in is dependent on the particular browser. Plug-ins for the Microsoft browser are referred to by the name of ActiveX controls.
[0024] Plug-ins may be very complex. A plug-in which may advantageously be used in connection with the invention is Shockwave from Macromedia. It permits animations which are part of a server response to be downloaded and played to the user. Shockwave defines its own scripting language called Lingo. Lingo scripts are contained within the downloadable animations which the Shockwave plug-in can play. The general format of a Shockwave animation is a timeline consisting of a series of frames, together with a number of visual objects which appear, perform motions, and disappear at particular frames within the timeline. To achieve more complex effects within a Shockwave animation, Lingo scripts may be invoked in addition to predefined visual objects.
2. Command Plug-in
[0025] A preferred embodiment of the invention employs a plug-in, referred to as the command plug-in, which provides to a scripting language the ability to command in a detailed fashion the playing of a musical recording. The command plug-in should provide, at a minimum, the following basic functions:
-
- [0026] (1) Start and stop play.
- [0027] (2) Get current track and position within the track.
- [0028] (3) Seek to a track and a position within the track.
- [0029] (4) Get and set volume.
- [0030] (5) Get information regarding the CD (e.g., the number of tracks, their lengths, the pauses between tracks).
- [0031] (6) Get information regarding the capabilities of the CD drive.
Other functions may be provided, limited only by what the underlying operating system services are able to provide.
[0032] The command plug-in is preferably written in a conventional programming language such as C++. The plug in must conform to the existing standards for plug-ins, such as those required of Microsoft ActiveX objects. In order to obtain the information and carry out the functions which the command plug-in makes available to the scripting language, the command plug-in relies on functions which provide control and information regarding the playing musical recording. These functions will depend on the precise source of the recording. If, as in the currently preferred embodiment, the recording is being played on an audio CD in the computer CD player, and if the browser is running under Microsoft Windows 3.1 or Windows 95, these functions would be the MCI functions, which form a part of the Win32 application programming interface. These functions are documented, for example, in Microsoft Win32 Programmer's Reference. Different functions may be provided by streaming audio receivers, as for example receivers which capture audio which is coming into the user's computer over a network connection in a suitable audio encoding format such as MPEG.
[0033] An important point to note about the implementation of the command plug-in is that the operations which it carries out, as for example seeks, may take times on the order of a second. It is undesirable for the command-plug in to retain control of the machine during that interval, so it is important that the plug-in relinquish control of the machine to the browser whenever a lengthy operation is undertaken, and report on the results of the operation via the asynchronous event handling capability used in the common scripting languages.
[0034] Given the above summary of the functions which the command plug-in provides, a general knowledge of how to write plug-ins (e.g., of how to write ActiveX objects), and a knowledge of the relevant application programming interface for controlling the play of the musical recording (e.g., MCI in Win32), a person skilled in the art could readily and without undue experimentation develop an actual working command plug-in. For this reason, further details of how the command plug-in is implemented are not provided here.
3. Synchronization
[0035] The existence of a command plug-in providing the functions listed above to a scripting language is a foundation on which entertainment complementary to a musical recording may be constructed. In particular, it is possible to devise, building on this foundation, a method for synchronizing the display of visual content by means of the scripting language with the events which are occurring on the audio CD.
[0036] In a preferred embodiment of the invention, the synchronization of the visual content to the audio CD proceeds as follows. The visual content is provided by means of a Shockwave animation, which is downloaded from the server and displayed for the user by means of a Shockwave plug-in. This downloading may take place before the animation is displayed, or alternatively it make take place as the animation is being displayed, provided the user's connection to the network is fast enough to support download at an appropriate speed. The downloading is a function provided by the Shockwave plug-in itself.
[0037] As the Shockwave animation is played, a Lingo script executes each time a frame finishes displaying. The Lingo script contains a description of the relationship which should exist between frames of the animation and segments of the musical recording, identified by track number and by time. The Lingo script determines, by means of the command plug-in described above, at which track and time the play of the audio CD is. It then refers to the description in order to determine which frames of the animation correspond to that portion of the audio CD. If the current frame is not one of those frames, the Lingo script resets the time line of the animation so that the animation will begin to play at the frame which corresponds to the current position of the audio CD. This permits the visual content to catch up if it ever lags the CD, for example because downloading from the network has fallen behind, because the user's computer lacks the cycles to play the animation at full speed, or because the user has fast forwarded the CD.
[0038] In a variant form of this synchronization algorithm (shown in FIG. 2 ), the frames of the animation are arranged into groups of contiguous frames. A correspondence is established between each such group of frames and a particular segment of the audio recording (box 200 in FIG. 2 ). At the end of each frame of the animation, the audio play position is determined (box 210). A test is done to determine whether the audio play position is within the segment of the recording that corresponds to the group of frames to which the next sequential frame belongs (box 215). If the audio play position is within that segment, the playback of the animation proceeds with that next frame (box 230). If the audio play position is not within that segment, then the playback of the animation is advanced to the frame corresponding to where the audio is (boxes 220 and 225).
4. Unique Identifiers for Audio CDs
[0039] A further aspect of the invention is the ability, by making use of the command plug-in, to provide a technique for establishing a unique identifier for an audio CD which is located in the user's CD player. The unique identifier may be based on the number and lengths of the tracks (measured in blocks, i.e., 1/75ths of a second), so that the identifier would be a concatenation of these lengths. In practice, however, it is desirable to have a somewhat shorter identifier, so the unique identifier is preferably the concatenation of the track lengths expressed in a fairly coarse unit, such as ¼th of a second.
[0040] Appendix A contains source code, written in C, for a fuzzy comparison algorithm suitable for determining whether two audio CDs are exactly or approximately the same. The fuzzy comparison algorithm proceeds as follows. For each of the two audio CDs to be compared, one determines the lengths of all the tracks in the recordings in milliseconds. One then shifts all track lengths to the right by eight bits, in effect performing a truncating division by 28=256. One then goes through both of the recordings track by track, accumulating as one proceeds two numbers, the match total and the match error. These numbers are both initialized to zero at the start of the comparison. For each of the tracks, one increments the match total by the shifted length of that track in the first CD to be compared, and one increments the match error by the absolute value of the difference between the shifted lengths of the track in the two CDs. When one gets to the last track in the CD with the fewer number of tracks, one continues with the tracks in the other CD, incrementing both the match total and the match error by the shifted lengths of those tracks. Following these steps of going through the tracks, the algorithm then divides the match error by the match number, subtracts the resulting quotient from 1, and converts the difference to a percentage which is indicative of how well the two CDs match.
[0041] Appendix B contains source code, written in C, for a comparison algorithm suitable for determining whether two audio CDs are exactly the same. The algorithm generates from the number of tracks, the track lengths, and the start and end times of the tracks an 8-byte value. The high order 4 bytes are obtained by summing the start and end times of all tracks, expressed in milliseconds. The low order 4 bytes are obtained by summing the lengths of all tracks expressed in milliseconds, shifting the sum left ten bits, and adding the number of tracks.
[0042] A unique identifier for a musical recording may be employed as a database key. A site may maintain a database of information about CDs, for example information about all CDs issued by the particular record company can be maintained on that record company's site. There are various alternative ways for users to navigate this information. For example, they could use a Web page containing many hyperlinks as a table of contents, or they could use a conventional search engine. A third way of searching which is enabled by the unique identifier of the invention is for there to be Web page which invites the user to place in the computer's CD drive the CD about which he or she is seeldng information. Upon detection of the presence of the CD in the drive, a script in the Web page computes the unique identifier corresponding to the CD and sends it to the server. The server then displays information about the CD retrieved from a database on the basis of that unique identifier. This information may include a Web address (URL) that is related to the audio CD (e.g., that of the artists' home page), simple data such as the names of the songs, and also complementary entertainment, including potentially photographs (e.g., of the band), artwork, animations, and video clips. It is also possible to arrange things so that, when the user inserts an audio CD into the computer, (i) the Web browser is launched if not already running, (ii) the browser computes the CD's unique identifier and from that unique identifier derives a URL, and (iii) the browser does an HTTP get transaction on that URL.
[0043] An alternative application of unique identifiers for musical recordings is to employ an audio CD as a key for entering into a premium area of the Web. There are presently premium areas of the Web to which people are admitted by subscription. A simple form of admission based on the unique identifier is to require, before accessing a particular area of the Web, that the user place in his or her CD drive a particular CD, or a CD published by a particular company or containing the music of a particular band or artist. This is readily accomplished by means of a script which invokes the functions provided by the command plug-in and computes a unique identifier.
5. Chat Rooms Connected with Musical Recordings
[0044] A third aspect of the invention is the connection of chat rooms with musical recordings. The goal is to provide all participants in a chat room with the same music at approximately the same time.
[0045] The prevailing network protocol for chat services is Interney Relay Chat (IRC), described J. Oikarinen & D. Reed, Internet Relay Chat Protocol (Internet Request for Comments No. 1459, 1993). In this protocol, when one becomes a client of a chat server, one sends the name of a chat room. The chat server receives messages from all of its of clients and relays the messages sent in by one client to all the other clients connected in the same room as that client. The messages which a client sends are typically typed in by the user who is running the client, and the messages which a client receives are typically displayed for the user who is running the client to read.
[0046] In a preferred embodiment of the invention, a chat client is customized by means of a plug-in, which we will call the chat plug-in. The chat client is started up by a browser as follows (see FIG. 3 ). The user connects by means of the browser to a central Web page (box 300) which, upon being downloaded, asks that the user insert a CD into his or her player (box 305). A unique identifier of the CD is computed and communicated back to the server by using the control plug-in described above under the command of a script in the central Web page (box 310). The server then employs the unique identifier to determine whether it has a chat room focused on the CD (box 315). This step may be carried out by looking the unique identifier up in a database using techniques well known in the art. There exists a vast literature on connecting Web pages to databases, e.g., December & Ginsburg, supra, chapter 21. If a chat room focused on the CD exists or can be created, the server responds with the name of that chat room, and the browser starts up a chat client on the user's computer as a client of that chat room (box 320).
[0047] The chat room's name is set by the server to contain information about the track which the CD is playing in the other chat room clients' machines and the time at which the track started to play, as well as about the volume at which the CD is playing. The chat client plug-in employs that information to direct the control plug-in to set the CD in the user's computer to play in such a manner that it is approximately synchronized to the CD which is playing in the other chat room clients' machines (box 320).
[0048] Each user in the chat room is able to control the CD which is playing in his or her machine. Control actions result in the chat plug-in sending messages to the chat server which describe the control action being taken (box 325). For example, such messages may indicate a change in the position of the CD, a change in the volume, or the ejection of the CD to replace it with another. The chat plug-ins running on the other users' machines, upon seeing a message of this kind, replicate the action (as far as possible) on the other users' machines by using the control plug-in described above (box 330).
[0049] In a further aspect of the invention, a chat room focused on a particular musical recording might allow for a voting procedure to select particular tracks. A simple voting procedure would be for each chat plug-in to act upon a change message of the kind described in the preceding paragraph only when it sees two identical consecutive change messages. This would mean that in order to change the track which is being played, it would be necessary for two users to change to that track. The number two may be replaced by a higher number.
[0050] In a further aspect of the invention the messages delivered to the users of a chat can be driven from a text file rather than manual typing. This would allow a prerecorded experience to be played back for a group of chat users. Such a technique may be used to create a pre-recorded, narrated tour of an audio CD.
[0051] An important advantage of the preferred embodiment as described above is that it may be used with any chat server software which supports the minimal functionality required by Internet Relay Chat or by a protocol providing similar minimum chat service. The additional software required is located in the chat client plug-n and in the central Web page, with its connection to a database of CD information.
Appendix A
/*
[0052] *FUZZY CD ID
[0053] *(c) 1996 ION
[0054] *
[0055] *
[0056] *by Ty Roberts
[0057] */
[0058] #include <stdio.h>
[0059] #include <stdlib.h>
[0060] #include <time.h>
[0061] struct fuzzy CDid{
-
- [0062] short num Tracks; // start time in milliseconds
[0063] unsigned short fuzzlength[100];
[0064] };
[0065] typedef struct fuzzyCDid fuzzyCDid, *fuzzy CDidPtr;
[0066] //structure of a cd track with all times stored in milliseconds
[0067] struck cdtrack {
-
- [0068] long beginsMs; //start time in milliseconds
- [0069] long endMs; //end time in milliseconds
[0070] long lengthMs; //length in milliseconds
[0071] };
[0072] typedef struct cdtrack cdtrac, *cdTrackPtr;
[0073] struct cd {
-
- [0074] short numTracks;
- [0075] cdtrack track[100];
[0076] };
[0077] typedef struct cd cd, *cdPtr;
[0078] void CreateFuzzyId (fuzzy CdidPtr fid, cdPtr cd);
[0079] float Fuzzy Match (fuzzyCdiPtr fid1, fuzzyCdidPtr fid2);
[0080] //SUBROUTINES
[0081] void CreateFuzzyId (fuzzy CDidPtr fid, cdPtr cd)
[0082] {
-
- [0083] long i;
- [0084] // first copy in the number of tracks
- [0085] fid->numTracks=cd->numTracks;
- [0086] for(i=0;i<fid->numTracks;i++) {
- [0087] // shift left and create a MSB length thats not exact
- [0088] fid->fuzzlength[i]=(short)/(cd->track[i].lengthMs>>8);
- [0089] }
[0090] }
[0091] float Fuzzy Match (fuzzyCDidPtr fid1, fuzzyCDidPtr fid2)
[0092] {
-
- [0093] long fidmatcher=0, fidmatchtotal=0;
- [0094] short i, trackent;
- [0095] float matchpercent;
- [0096] //find the larger number of tracks
- [0097] trackent=fid1->numTracks<fid2->numTracks?fid2->numTracks:
[0098] fid1->numTracks;
-
-
- [0099] // cycle thru the tracks accumulating error and total comparedtimes
- [0100] for(i=0;i<trackent;i++){
- [0101] if (i<fid-1>numTracks) && (i<fid2->numTracks)) {fidmatcherr+=abs(fid1−>fuzzlength[i]−fid2−×fuzzlength[i]); findmatchtotal+=fid1−>fuzzlength[i];
- [0102] } else if (i>=fid2−>num Tracks) {fidmatcherr+=fid1−>fuzzlength[i]; fidmatchtotal+=fid1−>fuzzlength[i];
- [0103] } else if (i>=fid1−>numTracks) {fidmatcherr+=fid2−>fuzzlength[i]; fidmatchtotal+fid2−>fuzzlength[i];
- [0104] }
- [0105] {
- [0106] if (fidmatcherr<0) {
- [0107] matchpercent=100−(((float)fidmatcherr/(float)fidmatchtotal)*100);
- [0108] } else {
- [0109] matchpercent=100;
- [0110] {
- [0111] return matchpecent;
{
-
[0112] void main(void)
[0113] {
-
- [0114] short i;
- [0115] float matchpercent;
- [0116] //create global structures for two complete cds with up to 100 tracks
- [0117] cd cd2id;
- [0118] fuzzyCdid fidcd2id;
- [0119] cd cdFromDB;
- [0120] fuzzyCdid fidedFromDB;
- [0121] print (“Test #1 will compare two CDs that are exactly the same\n\”);
- [0122] //put in some test values for the cd track lengths
- [0123] //since these areas are in ms, its basically 6000=1 minute
- [0124] cd2id.track[0].lengthMs=121323;
- [0125] cd2id.track[1].lengthMs=234565;
- [0126] cd2id.track[2].lengthMs=566437;
- [0127] cd2id.track[3]lengthMs=235120;
- [0128] cd2id.track[4].lengthMs=20000;
- [0129] cd2id.track[5].lengthMs=120386;
- [0130] cd2id.numTracks=7;
- [0131] for(=1;i<cd2id.numTracks;i++) {
- [0132] printf (“CD #1: Track=%d length in minutes=%f\n”,
- [0133] i, (float)cd2id.track[i].lengthMs/60000.0);
- [0132] printf (“CD #1: Track=%d length in minutes=%f\n”,
- [0134] }
- [0135] printf(“\n”);
- [0136] cdFromDB.track[0].lengthMs=121323;
- [0137] cdFromDB.track[1].lengthMs=234565;
- [0138] cdFromDB.track[2].lengthMs=566437;
- [0139] cdFromDB.track[3].lengthMs=245120;
- [0140] cdFromDB.track[4].lengthMs=20000;
- [0141] cdFromDb.track[5].lengthMs=120386;
- [0142] cdFromDB.track[6].lengthMs=323453;
- [0143] cdFromDB.numTracks=7;
- [0144] for(i=1;i<cdFromDB.numTracks;i++) {
- [0145] printf (“CD #2: Track=% d length in minutes=%f\n”,
- [0146] i, (float)cdFromDB.track[i].lengthMS/60000.0);
- [0145] printf (“CD #2: Track=% d length in minutes=%f\n”,
[0147] }
[0148] CreateFuzzyId( &fidcd2id, &cd2id );
[0149] CreateFuzzyld( &fidcdFromDB, &cdFromDB );
[0150] matchpercent =FuzzyMatch( &fidcd2id, &fidcdFromDB);
[0151] printf (“The cd's matchpercent was computed as=%f”, matchpercent);
[0152] printf (“\n”);
[0153] printf (“\n”);
[0154] printf (“Test #2 will compare two cd that are nearly the same\nexcept they have diffent # of tracks \n”);
[0155] // put in some test values for the cd track lengths
[0156] // since these are in ms, its basically 60000=1 minute
[0157] cd2id.track[0].lengthMs=121323;
[0158] cd2id.track[1].lengthMs=234565;
[0159] cd2id.track[2].lengthMs=566437;
[0160] cd2id.track[3].lengthMs=245120;
[0161] cd2id.track[4].lengthMs=20000;
[0162] cd2id.track[5].lengthMs=120386;
[0163] cd2id.track[6].lengthMs=323453;
[0164] cd2id.numTracks=7;
[0165] for(i=1;i<cd2id.numTracks;i++) {
-
- [0166] printf (“CD #1: Track=%d length in minutes=%f\n”,
- [0167] i, (float)cd2id.track[i].lengthMs/60000.0);
- [0166] printf (“CD #1: Track=%d length in minutes=%f\n”,
[0168] }
[0169] printf (“\n”);
[0170] cdFromDB.track[0].lengthMs=121323;
[0171] cdFromDB.track[1].lengthMs=234565;
[0172] cdFromDB.track[2].lengthMs=566437;
[0173] cdFromDB.track[3].lengthMs=245120;
[0174] cdFromDB.track[4].lengthMs=20000;
[0175] cdFromDB.track[5].lengthMs=120386;
[0176] cdFromDB.numTracks=6;
[0177] for(i=1;i<cdFromDB.numTracks;i++) {
-
-
- [0178] printf (“CD #2: Track=%d length in minutes =%f\n”,
- [0179] i, (float)cdFromDB.track[i].lengthMs/60000.0);
- [0178] printf (“CD #2: Track=%d length in minutes =%f\n”,
-
[0180] }
[0181] CreateFuzzyld( &fidcd2id, &cd2id );
[0182] CreateFuzzyld( &fidcdFromDB, &cdFromDB );
[0183] matchpercent=FuzzyMatch( &fidcd2id, &fidcdFromDB);
[0184] printf (“The cd's matchpercent was computed as=%f”,matchpercent);
[0185] printf (“\n”);
[0186] printf (“\n”);
[0187] printf (“Test #3 will compare two cd that are not the same\n\n”);
[0188] // put in some test. values for the cd track lengths
[0189] // since these are in ms, its basically 60000=1 minute
[0190] cd2id.track[0].lengthMs=34213;
[0191] cd2id.track[1].lengthMs=334565;
[0192] cd2id.track[2].IengthMs=231423;
[0193] cd2id.track[3].lengthMs=134122;
[0194] cd2id.track[4].lengthMs=2342;
[0195] cd2id.track[5].lengthMs=3487;
[0196] cd2id.track[6].lengthMs=9976;
[0197] cd2id.numTracks=7;
[0198] for(i=l;i<cd2id.numTracks;i++) {
-
- [0199] printf (“CD #1: Track=%d length in midutes =%f\n”,
- [0200] i, (float)cd2id.track[i].lengthMs/60000.0);
- [0199] printf (“CD #1: Track=%d length in midutes =%f\n”,
[0201] }
[0202] printf (“\n”);
[0203] cdFromDB.track[0].lengthMs=121323;
[0204] cdFromDB.track[1].lengthMs=234565;
[0205] cdFromDB.track[2].lengthMs=566437;
[0206] cdFromDB.track[3].lengthMs=245120;
[0207] cdFromDB.track[4].lengthMs=20000;
[0208] cdFromDB.track[5].lengthMs=120386;
[0209] cdFromDB.track[6].lengthMs=323453;
[0210] cdFromDB.numTracks=6;
[0211] for(i=1;i<cdFromDB.numTracks;i++) {
-
- [0212] printf (“CD #2: Track=%d length in minutes =%f\n”,
- [0213] i, (float)cdFromDB.track[i].lengthMs/60000.0);
- [0212] printf (“CD #2: Track=%d length in minutes =%f\n”,
[0214] }
[0215] CreateFuzzyId( &fidcd2id, &cd2id);
[0216] CreateFuzzyId( &fidcdFromDB, &cdFromDB);
[0217] matchpercent=FuzzyMatch( &fidcd2id, &fidcdFromDB);
[0218] printf (“The cd's matchpercent was computed as=%f”,matchpercent);
[0219] }
Appendix B
/*
-
-
- [0220] *EXACT MATCH CD ID
* 1996 ION
*
*
* by Ty Roberts
*/
#include <stdio.h>
10 #include <stdlib.h>
#include <time.h>
struct cdid{
- [0220] *EXACT MATCH CD ID
-
[0221] long id[2];
}
typedef struct cdid cdid, *cdidptr;
// structure of a cd track with all times stored in milliseconds
struct cdtrack{
[0222] long beginMs; // start time in miliseconds
long endMs; // end time in milliseconds
long lengthMs; //length in Miliseconds
};
typedef struct cdtrack cdtrack, *cdTrackPtr;
struct cd {
[0223] short numTracks;
[0224] cdtrack track[100];
};
typedef struct cd cd, *cdptr;
void CreateUniqueId( cdidPtr cid, cdPtr cd );
// SUBROUTINES
void CreateUniqueld( cdidptr cid, cdPtr cd )
}
[0225] long i, t, n;
[0226] t=0;
[0227] n=0;
[0228] for(i=0;i<cd->numTracks;i++) {
-
- [0229] // shift left and create a MSB length thats not exact
[0230] t+=cd->track[i].lengthMs;
[0231] n+=cd->track[i].beginMs+cd->track[i].endMs;
[0232] }
[0233] cid->id[0]=t<<10+cd->numTracks;
[0234] cid->id[1] =n;
}
void main(void)
{
[0235] short i;
[0236] short matchtest;
[0237] // create global structures for two complete cds with up to 100 tracks
[0238] cd cd2id;
[0239] cdid cd2UID;
[0240] cd cdFromDB;
[0241] cdid cdFromDBUID;
[0242] printf (“Test #1 will compare two cd that are exactly the same\n\n”);
[0243] // put in some test values for the cd track lengths
[0244] // since thes are in ms, its basically 60000=1 minute
[0245] cd2id.track[0].beginMs=0;
[0246] cd2id.track[1].beginMs=100001;
[0247] cd2id.track[2].beginMs =231001;
[0248] cd2id.track[3].beginMs=345001;
[0249] cd2id.track[4].beginMs=435001;
[0250] cd2id.track[5].beginMs=460001;
[0251] cd2id.track[6].beginMs=590001;
[0252] cd2id.track[0].endMs=100000;
[0253] cd2id.track[1].endMs=231000;
[0254] cd2id.track[2].endMs=345000;
[0255] cd2id.track[3].endMs=435000;
[0256] cd2id.track[4].endMs=460000;
[0257] cd2id.track[5].endMs=590000;
[0258] cd2id.track[6].endMs=690000;
[0259] cd2id. track[0].lengthMs=cd2id.track[0].endMs-cd2id.track[0].beginMs;
[0260] cd2id.track[1].lengthMs=cd2id.track[1].endMs-cd2id.track[1].beginMs;
[0261] cd2id.track[2].lengthMs=cd2id.track[2].endMs-cd2id.track[2].beginMs;
[0262] cd2id.track[3].lengthMs=cd2id.track[3].endMs-cd2id.track[3].beginMs;
[0263] cd2id.track[4].lengthMs=cd2id.track[4].endMs-cd2id.track[4].beginMs;
[0264] cd2id.track[5].lengthMs=cd2id.track[5].endMs-cd2id.track[5].beginMs;
[0265] cd2id.track[6].lengthMs=cd2id.track[6].endMs-cd2id.track[6].beginMs;
[0266] cd2id.numTracks=7;
[0267] for(i=l;i<cd2id.numTracks;i++) {
-
- [0268] printf (“CD #1: Track=%d length inminutes=%f\n”, i,
}
- [0268] printf (“CD #1: Track=%d length inminutes=%f\n”, i,
[0269] (float)cd2id. track[i].lengthMs/60000.0);
[0270] printf (“\n”);
[0271] cdFromDB.track[0].beginMs=0;
[0272] cdFromDB.track[1].beginMs=100001;
[0273] cdFromDB.track[2].beginMs=231001;
[0274] cdFromDB.track[3].beginMs=345001;
[0275] cdFromDB.track[4].beginMs=435001;
[0276] cdFromDB.track[5].beginMs=460001;
[0277] cdFromDB.track[6].beginMs=590001;
[0278] cdFromDB.track[0].endMs=100000;
[0279] cdFromDB.track[1].endMs=231000;
[0280] cdFromDB.track[2].endMs=345000;
[0281] cdFromDB.track[3].endMs=435000;
[0282] cdFromDB.track[4].endMs=460000;
[0283] cdFromDB.track[5].endMs=590000;
[0284] cdFromDB.track[6].endMs=690000;
[0285] cdFromDB.track[0].lengthMs=cd2id.track[0].endMs-cd2id.track[0].beginMs;
[0286] cdFromDB.track[1].lengthMs=cd2id.track[1].endMs-cd2id.track[1].beginMs;
[0287] cdFromDB.track[2].lengthMs=cd2id.track[2].endMs-cd2id.track[2].beginMs;
[0288] cdFromDB.track[3].lengthMs=cd2id.track[3].endMs-cd2id.track[3].beginMs;
[0289] cdFromDB.track[4].lengthMs=cd2id.track[4].endMs-cd2id.track[4].beginMs;
[0290] cdFromDB.track[5].lengthMs=cd2id.track[5].endMs-cd2id.track[5].beginMs;
[0291] cdFromDB.track[6].lengthMs=cd2id.track[6].endMs-cd2id.track[6].beginMs;
[0292] cdFromDB.numTracks=7;
[0293] for(i=1;i<cdFromDB.numTracks;i++) }
-
- [0294] printf (“CD #2: Track =%d length inminutes=%f\n”, i, (float)cdFromDB. track[i].lengthMs/60000.0);
[0295] }
[0296] CreateUniqueId( &cd2UID, &cd2id );
[0297] printf( “Unique ID for CD #1 %d%d\n”, cd2UID.id[0], cd2UID.id[1]);
[0298] CreateUniqueld( &cdFromDBUID, &cdFromDB );
[0299] printf( “Unique ID for CD #2=%d%d\n”, cdFromDBUID.id[0], cdFromDBUID.id[1]);
[0300] matchtest=(cd2UID.id[0]==cdFromDBUID.id[0]) && (cd2UID.id[1]==cdFromDBUID.id[1]);
[0301] printf (“The cd's match if result is non zero matchresult=%d”,matchtest);
[0302] printf (“\n”);
[0303] printf (“\n”);
[0304] printf (“Test #2 will compare two cd that are nearly the same\nexcept they have diffent # of tracks \n”);
[0305] // put in some test values for the cd track lengths
[0306] // since thes are in ms, its basically 60000=1 minute
[0307] cd2id.track[0].beginMs=0;
[0308] cd2id.track[1].beginMs=100001;
[0309] cd2id.track[2].beginMs=231001;
[0310] cd2id.track[3].beginMs=345001;
[0311] cd2id.track[4].beginMs=435001;
[0312] cd2id.track[5].beginMs=460001;
[0313] cd2id.track[6].beginMs=590001;
[0314] cd2id.track[0].endMs=100000;
[0315] cd2id.track[1].endMs=231000;
[0316] cd2id.track[2].endMs=345000;
[0317] cd2id.track[3].endMs=435000;
[0318] cd2id.track[4].endMs=460000;
[0319] cd2id.track[5].endMs=590000;
[0320] cd2id.track[6].endMs=690000;
[0321] cd2id.track[0].lengthMs=cd2id.track[0].endMs-cd2id.track[0].beginMs;
[0322] cd2id.track[1].lengthMs=cd2id.track[0].endMs-cd2id.track[1].beginMs;
[0323] cd2id.track[2].lengthMs=cd2id.track[2].endMs-cd2id.track[2].beginMs;
[0324] cd2id.track[3].lengthMs=cd2id.track[3].endMs-cd2id.track[3].beginMs;
[0325] cd2id.track[4].lengthMs=cd2id.track[4].endMs-cd2id.track[4].beginMs;
[0326] cd2id.track[5].lengthMs=cd2id.track[4].endMs-cd2id.track[5].beginMs;
[0327] cd2id.track[6].lengthMs=cd2id.track[6].endMs-cd2id.track[6].beginMs;
[0328] cd2id.numTracks =7;
[0329] for(i=1;i<cd2id.numTracks;i++) {
-
- [0330] printf (“CD #1: Track=%d length inminutes=%f\n”, i, (float)cd2id.track[i].lengthMs/60000.0);
[0331] }
[0332] printf (“\n”);
[0333] cdFromDB.track[0].beginMs=0;
[0334] cdFromDB.track[1].beginMs=100001;
[0335] cdFromDB.track[2].beginMs=231001;
[0336] cdFromDB.track[3].beginMs=345001;
[0337] cdFromDB.track[4].beginMs=435001;
[0338] cdFromDB.track[5].beginMs=460001;
[0339] cdFromDB.track[6].beginMs=590001;
[0340] cdFromDB.track[0].endMs=100000;
[0341] cdFromDB.track[1].endMs=231000;
[0342] cdFromDB.track[2].endMs=345000;
[0343] cdFromDB.track[3].endMs=435000;
[0344] cdFromDB.track[4].endMs=460000;
[0345] cdFromDB.track[5].endMs=590000;
[0346] cdFromDB.track[0].lengthMs=cd2id.track[0].endMs-cd2id.track[0].beginMs;
[0347] cdFromDB.track[1].lengthMs=cd2id.track[1].endMs-cd2id.track[1].beginMs;
[0348] cdFromDB.track[2].lengthMs=cd2id.track[2].endMs-cd2id.track[2].beginMs;
[0349] cdFromDB.track[3].lengthMs=cd2id.track[3].endMs-cd2id.track[3].beginMs;
[0350] cdFromDB.track[4].lengthMs=cd2id.track[4].endMs-cd2id.track[4].beginMs;
[0351] cdFromDB.track[5].lengthMs=cd2id.track[5].endMs-cd2id.track[5].beginMs;
[0352] cdFromDB.numTracks=6;
[0353] for(i=1;i<cdFromDB.numTracks;i++) {
-
- [0354] printf (“CD #2: Track =%d length inminutes=%f\n”, i, (float)cdFromDB.track[i].lengthMs/60000.0);
[0355] }
[0356] CreateUniqueld( &cd2UID, &cd2id );
[0357] printf( “Unique ID for CD #1=%d%d\n”, cd2UID.id[0],.cd2UID.id[1]);
[0358] CreateUniqueId( &cdFromDBUID, &cdFromDB );
[0359] printf( “Unique ID for CD #2=%d%d\n”, cdFromDBUID.id[0], cdFromDBUID.id[1]);
[0360] matchtest=(cd2UID.id[0]==cdFromDBUID.id[0]) && (cd2UID.id[1]==cdFromDBUID.id[1]);
[0361] printf (“The cd's match if result is non zero matchresult=%d”,matchtest);
[0362] printf (“\n”);
[0363] printf (“\n”);
Claims
I claim:
1. A system coupled to a network to associate remote data with local data, where the local data is included in a recording and is accessed to play the recording for a user of the local device said system comprising:
an access unit accessing the local data;
a processor deriving an identifier by abstracting table of contents information for the local data;
a communication unit automatically obtaining the remote data from the network upon access to the local data, using at least one uniform resource locator based on an at least partial pointer obtained from the network and corresponding to the identifier; and
an output unit outputting the remote data.
2. A system as recited in claim 1, wherein the recording is an electronic file of digitally encoded audio.
3. A system as recited in claim 2,
wherein the electronic file is stored on a disc,
wherein said access unit is a disc playback unit, and
wherein said communication unit requests the remote data upon insertion of the disc into said playback unit.
4. A system the local data is an electronic file of digitally encoded audio, and wherein the remote data include at least one of an image associated with the local data, animation associated with the local data, a video associated with the local data, and an album cover associated with the electronic file, said system comprising:
an access unit accessing the local data;
a processor deriving an identifier by abstracting table of contents information for the local data;
a communication unit automatically obtaining the remote data from the network upon access to the local data, using at least one uniform resource locator based on an at least partial pointer obtained from the network and corresponding to the identifier; and
an output unit outputting the remote data.
5. A method using a local computer connected to a network, comprising:
obtaining an identifier of a recording accessed by the local computer from an abstraction of contents of the recording the abstraction including table of contents information used in playing back the recording said obtaining, using a process capable of having multiple recordings approximately matching the identifier and further abstraction of the identifier is possible;
determining an at least partial pointer based on the identifier;
obtaining via the network from at least one storage location determined using the at least partial pointer remote data related to the recording; and
outputting the remote data on the local computer.
6. A method of delivering content complementary to a compact disc inserted in a compact disc player coupled with a computer connected to a network, comprising:
inserting the compact disc in the compact disc player coupled with the computer;
obtaining an identifier for the compact disc from table of contents information for the compact disc;
retrieving at least one uniform resource locator related to the identifier, including
searching a local cache for the identifier;
connecting to a remote look-up server to search for the identifier and to return an at least partial pointer, when the identifier is not found in the local cache;
storing the at least partial pointer returned from the remote look-up server in the local cache; and
providing the at least one uniform resource locator based on the at least partial pointer, when the identifier is found in the local cache and when the at least partial pointer is returned from the remote look-up server;
linking to at least one remote device via the network, in response to the at least one uniform resource locator; and
delivering content complementary to the compact disc from the at least one remote device to the computer via the network.
7. A method as recited in claim 6,
wherein a plurality of uniform resource locators related to the identifier are returned from the remote look-up server, and
wherein said linking initially links to a selected remote device corresponding to one of the uniform resource locators related to the identifier.
8. At least one computer program stored on a computer-readable medium, embodying a method for delivering content complementary to a compact disc inserted into a compact disc player coupled with a computer connected to a network, comprising:
inserting the compact disc in the compact disc player coupled with the computer;
obtaining an identifier for the compact disc from table of contents information for the compact disc;
retrieving at least one uniform resource locator related to the identifier, including
searching a local cache for the identifier;
connecting to a remote look-up server to search for the identifier and to return an at least partial pointer, when the identifier is not found in the local cache;
storing the at least partial pointer returned from the remote look-up server in the local cache; and
providing the at least one uniform resource locator based on the at least partial pointer, when the identifier is found in the local cache and when the at least partial pointer is returned from the remote look-up server;
linking to at least one remote device via the network, in response to the at least one uniform resource locator; and
delivering content complementary to the compact disc from the at least one remote device to the computer via the network.
9. At least one computer program as recited in claim 8,
wherein a plurality of uniform resource locators related to the identifier are returned from the remote look-up server, and
wherein said linking initially links to a selected remote device corresponding to one of the uniform resource locators related to the identifier.
10. At least one computer program stored on a computer-readable medium, embodying a method for delivering content complementary to a compact disc inserted into a compact disc player coupled with a computer connected to a network, comprising:
inserting the compact disc in the compact disc player coupled with the computer;
obtaining an identifier for the compact disc from table of contents information for the compact disc;
determining at least one uniform resource locator related to the identifier;
linking to at least one remote device using the at least one uniform resource locator via the network using the identifier as a password to access the at least one remote site; and
delivering content complementary to the compact disc from the at least one remote device to the computer via the network.
11. At least one computer program as recited in claim 10, wherein said delivering delivers the content including at least one name of a song on the compact disc.
12. At least one computer program as recited in claims 10, wherein the compact disc contains a plurality of tracks, and
wherein said delivering delivers the content including at least one title of a corresponding track on the compact disc.
13. A method of delivering content complementary to a compact disc inserted in a compact disc player coupled with a computer connected to a network, comprising:
receiving the compact disc in the compact disc player coupled with the computer;
obtaining an identifier for the compact disc from table of contents information for the compact disc;
retrieving from a remote computer via the network an at least partial pointer related to the identifier;
linking to a remote device via the network using the at least partial pointer; and
delivering content complementary to the compact disc from the remote device to the computer via the network.
14. A computer system, coupled to a network, to associate remote data and audio, comprising:
a playback unit, located at a first location, to play a recording using information provided with the recording;
a communication unit, located at the first location, to obtain remote data from the network using an at least partial pointer corresponding to the recording;
an output unit, located at the first location, to output the remote data; and
a remote computer, coupled to said communication unit via the network and located at a second location remote from the first location, storing at least one database of recording identifiers derived from the information used to play the recordings, and at least partial pointers and providing said communication unit with the at least partial pointer.
15. A computer system as recited in claim 14, wherein the at least one database stored on said remote computer associates the recording identifiers with at least partial pointers of corresponding World Wide Web pages for a plurality of recordings released by an organization.
16. A computer system, as recited in claim 14, wherein the at least partial pointer is at least one uniform resource locator of at least one World Wide Web page maintained on behalf of at least one person who produced sound for the recording.
17. At least one computer program stored on a computer-readable medium, embodying a method for delivering content complementary to a compact disc inserted into a compact disc player coupled with a local computer connected to a network, comprising:
detecting insertion of the compact disc in the compact disc player coupled with the local computer;
obtaining an identifier for the compact disc from table of contents information for the compact disc;
retrieving from a remote computer via the network an at least partial pointer corresponding to the identifier;
linking to a remote device via the network, based on the at least partial pointer; and
delivering content complementary to the compact disc from the remote device to the local computer via the network.
18. At least one computer program as recited in claim 17,
further comprising automatically sending information, stored on the compact disc to play back the compact disc, from the local computer to the remote computer, and
wherein said obtaining is performed by the remote computer from the information received from the local computer.
19. At least one computer program as recited in claim 17,
wherein said obtaining includes generating the identifier by the local computer based on information stored on the compact disc to play back the compact disc, and
wherein said method further comprises automatically sending the identifier from the local computer to the remote computer.
20. At least one computer program as recited in claim 17, further comprising automatically starting a client program within the computer to cause the computer to access the network when the compact disc is inserted in the compact disc player.
21. At least one computer program as recited in claim 17,
wherein said obtaining is performed automatically upon insertion of the compact disc,
wherein said retrieving of the at least partial pointer automatically retrieves a plurality of character strings at least partially defining uniform resource locators related to the identifier upon determination of the identifier for the compact disc, and
wherein said linking automatically links the computer to a selected remote device corresponding to one of the uniform resource locators.
22. At least one computer program stored on a computer-readable medium, embodying a method for delivering content complementary to a compact disc inserted into a compact disc player coupled with a computer connected to a network, comprising:
inserting the compact disc in the compact disc player coupled with the computer;
obtaining an identifier for the compact disc from table of contents information for the compact disc;
retrieving an at least partial pointer corresponding to the identifier, including
searching a local cache for the identifier;
connecting to a remote look-up server to search for the identifier and return at least one character string related thereto, when the identifier is not found in the local cache within a predetermined period of time;
storing the at least one character string returned from the remote look-up server in the local cache; and
providing the at least one character string as the at least partial pointer, when the identifier is found in the local cache and when the at least one character string is returned from the remote look-up server;
linking to a remote device via the network, based on the at least partial pointer; and
delivering content complementary to the compact disc from the remote device to the computer via the network.
23. At least one computer program as recited in claim 22,
further comprising automatically sending information, stored on the compact disc to play back the compact disc, from the computer to the remote look-up server, and
wherein said obtaining is performed by the remote look-up server from the information received from the computer.
24. At least one computer program as recited in claim 22,
wherein said obtaining includes generating the identifier by the computer based on information stored on the compact disc to play back the compact disc, and
wherein said method further comprises automatically sending the identifier from the computer to the remote look-up server.
25. At least one computer program as recited in claim 22, wherein a plurality of uniform resource locators related to the identifier are returned from the remote look-up server, and
wherein said linking initially links to a selected remote device corresponding to one of the uniform resource locators related to the identifier.
26. A method of delivering content complementary to a recording ready for playback by a local device connected to a network, comprising:
obtaining an identifier for the recording from information provided with the recording to play back the recording;
retrieving from a remote device via the network an at least partial pointer corresponding to the identifier;
linking to the remote device via the network, based on the at least partial pointer; and
delivering content complementary to the recording from the remote device to the local device via the network.
27. A method as recited in claim 26, wherein the local device is a computer connected to the remote device via the network, and
wherein said method further comprises:
detecting access to the recording by the computer; and
automatically starting a client program within the computer to control the computer when the recording is accessed.
28. A method as recited in claim 26, wherein said retrieving of the at least partial pointer includes
searching a local cache for the identifier;
connecting to a remote look-up server to search for the identifier and return at least one pointer string related thereto, when the identifier is not found in the local cache within a predetermined period of time;
storing the at least pointer string returned from the remote look-up server in the local cache; and
providing the at least one pointer string as the at least partial pointer for said linking, when the identifier is found in the local cache and when the at least one pointer string is returned from the remote look-up server.
29. A method as recited in claim 28, wherein a plurality of pointer strings related to the identifier are returned from the remote look-up server, and
wherein said linking initially links to a selected remote device at least partially addressed by one of the pointer strings.
30. A method as recited in claim 26,
wherein said retrieving of the at least partial pointer related to the identifier retrieves a plurality of pointer strings at least partially defining uniform resource locators related to the identifier, and
wherein said linking initially links to a selected remote device corresponding to one of the uniform resource locators related to the identifier.
31. At least one computer program stored on a computer-readable medium, embodying a method for delivering content complementary to a recording ready for playback by a local device connected to a network, comprising:
obtaining an identifier for the recording from information provided with the recording to play back the recording;
retrieving from a remote device via the network an at least partial pointer corresponding to the identifier;
linking to a remote device via the network based on the at least partial pointer; and
delivering content complementary to the recording from the remote device to the local device via the network.
32. At least one computer program as recited in claim 31,
wherein the local device is a computer connected to the remote device via the network, and
further comprising:
detecting access to the recording by the computer; and
automatically starting a client program within the computer to control the computer when the recording is accessed.
33. At least one computer program as recited in claim 31, wherein said retrieving of the at least partial pointer includes
generating the identifier by the local device based on information provided with the recording for playback of the recording;
searching the local cache for the identifier;
connecting to a remote look-up server to search for the identifier and return at least one pointer string at least partially defining a uniform resource locator related thereto, when the identifier is not found in the local cache within a predetermined period of time;
storing the at least one pointer string returned from the remote look-up server in the local cache; and
providing the at least one pointer string as the at least partial pointer for said linking, when the identifier is found in the local cache and when the at least one pointer string is returned from the remote look-up server.
34. At least one computer program as recited in claim 33,
wherein a plurality of pointer strings related to the identifier are returned from the remote look-up server, and
wherein said linking initially links to a selected remote device at least partially addressed by one of the pointer strings.
35. At least one computer program as recited in claim 31, wherein said retrieving of the at least partial pointer corresponding to the identifier retrieves a plurality of pointer strings at least partially defining uniform resource locators related to the identifier, and
wherein said linking initially links to a selected remote device at least partially addressed by one of the pointer strings.
36. At least one computer program as recited in claim 31, further comprising:
sending information, provided with the recording to play back the recording, from the local device to the remote device;
determining the identifier by the remote device based on the information received from the local device; and
comparing the identifier with records in a database maintained on the remote device to find the at least partial pointer corresponding to the identifier.
37. At least one computer program as recited in claim 31, wherein the content complementary to the recording includes at least one of an image associated with the recording, animation associated with the recording, and a video associated with the recording.
38. At least one computer program as recited in claim 37, wherein the recording is an electronic file of digital audio, and
wherein the content complementary to the recording further includes an album cover associated with the electronic file.
Patent Citations (147)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4488179(A) | 1984-12-01 | Krüger et al. | Applicant |
| US4641205(A) | 1987-02-01 | Beyers, Jr. | Applicant |
| US4870568(A) | 1989-09-01 | Kahle et al. | Applicant |
| US5113383(A) | 1992-05-01 | Amemiya et al. | Applicant |
| US5132949(A) | 1992-07-01 | Choi | Applicant |
| US5157614(A) | 1992-10-01 | Kashiwazaki et al. | Applicant |
| US5157646(A) | 1992-10-01 | Amemiya et al. | Applicant |
| US5206949(A) | 1993-04-01 | Cochran et al. | Applicant |
| US5210734(A) | 1993-05-01 | Sakurai | Applicant |
| US5237157(A) | 1993-08-01 | Kaplan | Applicant |
| US5263010(A) | 1993-11-01 | Amemiya et al. | Applicant |
| US5341350(A) | 1994-08-01 | Frank et al. | Applicant |
| US5388259(A) | 1995-02-01 | Fleischman et al. | Applicant |
| US5392264(A) | 1995-02-01 | Hira | Applicant |
| US5410543(A) | 1995-04-01 | Seitz et al. | Applicant |
| US5414684(A) | 1995-05-01 | Nonaka et al. | Applicant |
| US5430698(A) | 1995-07-01 | Nonaka et al. | Applicant |
| US5446714(A) | 1995-08-01 | Yoshio et al. | Applicant |
| US5446891(A) | 1995-08-01 | Kaplan et al. | Applicant |
| US5463605(A) | 1995-10-01 | Nishida et al. | Applicant |
| US5464946(A) | 1995-11-01 | Lewis | Applicant |
| US5465240(A) | 1995-11-01 | Mankovitz | Applicant |
| US5475835(A) | 1995-12-01 | Hickey | Applicant |
| US5488725(A) | 1996-01-01 | Turtle et al. | Applicant |
| US5544139(A) | 1996-08-01 | Aramaki et al. | Applicant |
| US5559764(A) | 1996-09-01 | Chen et al. | Applicant |
| US5559949(A) | 1996-09-01 | Reimer et al. | Applicant |
| US5583560(A) | 1996-12-01 | Florin et al. | Applicant |
| US5584025(A) | 1996-12-01 | Keithley et al. | Applicant |
| US5615345(A) | 1997-03-01 | Wanger | Applicant |
| US5625608(A) | 1997-04-01 | Grewe et al. | Applicant |
| US5642337(A) | 1997-06-01 | Oskay et al. | Applicant |
| US5649114(A) | 1997-07-01 | Deaton et al. | Applicant |
| US5659732(A) | 1997-08-01 | Kirsch | Applicant |
| US5673322(A) | 1997-09-01 | Pepe et al. | Applicant |
| US5679911(A) | 1997-10-01 | Moriyama et al. | Applicant |
| US5680379(A) | 1997-10-01 | Ishida et al. | Applicant |
| US5689484(A) | 1997-11-01 | Hirasawa | Applicant |
| US5691964(A) | 1997-11-01 | Niederlein et al. | Applicant |
| US5694162(A) | 1997-12-01 | Freeny, Jr. | Applicant |
| US5694546(A) | 1997-12-01 | Reisman | Applicant |
| US5701385(A) | 1997-12-01 | Katsuyama et al. | Applicant |
| US5703795(A) | 1997-12-01 | Mankovitz | Applicant |
| US5721827(A) | 1998-02-01 | Logan et al. | Applicant |
| US5726957(A) | 1998-03-01 | Hisamatsu et al. | Applicant |
| US5727129(A) | 1998-03-01 | Barrett et al. | Applicant |
| US5740304(A) | 1998-04-01 | Katsuyama et al. | Applicant |
| US5740549(A) | 1998-04-01 | Reilly et al. | Applicant |
| US5745681(A) | 1998-04-01 | Levine et al. | Applicant |
| US5751672(A) | 1998-05-01 | Yankowski | Applicant |
| US5751956(A) | 1998-05-01 | Kirsch | Applicant |
| US5754784(A) | 1998-05-01 | Garland et al. | Applicant |
| US5757739(A) | 1998-05-01 | Heath et al. | Applicant |
| US5761606(A) | 1998-06-01 | Wolzien | Applicant |
| US5761649(A) | 1998-06-01 | Hill | Applicant |
| US5768222(A) | 1998-06-01 | Hisamatsu et al. | Applicant |
| US5774431(A) | 1998-06-01 | Bos et al. | Applicant |
| US5774664(A) | 1998-06-01 | Hidary et al. | Applicant |
| US5774666(A) | 1998-06-01 | Portuesi | Applicant |
| US5778181(A) | 1998-07-01 | Hidary et al. | Applicant |
| US5778187(A) | 1998-07-01 | Monteiro et al. | Applicant |
| US5781889(A) | 1998-07-01 | Martin et al. | Applicant |
| US5781897(A) | 1998-07-01 | Chen et al. | Applicant |
| US5781909(A) | 1998-07-01 | Logan et al. | Applicant |
| US5782692(A) | 1998-07-01 | Stelovsky | Applicant |
| US5793726(A) | 1998-08-01 | Nagano | Applicant |
| US5793980(A) | 1998-08-01 | Glaser et al. | Applicant |
| US5796393(A) | 1998-08-01 | MacNaughton et al. | Applicant |
| US5796945(A) | 1998-08-01 | Tarabella | Applicant |
| US5796952(A) | 1998-08-01 | Davis et al. | Applicant |
| US5809250(A) | 1998-09-01 | Kisor | Applicant |
| US5809512(A) | 1998-09-01 | Kato | Applicant |
| US5815471(A) | 1998-09-01 | Mince et al. | Applicant |
| US5822216(A) | 1998-10-01 | Satchell, Jr. et al. | Applicant |
| US5822283(A) | 1998-10-01 | Bos et al. | Applicant |
| US5822436(A) | 1998-10-01 | Rhoads | Applicant |
| US5826267(A) | 1998-10-01 | McMillan | Applicant |
| US5835914(A) | 1998-11-01 | Brim | Applicant |
| US5838910(A) | 1998-11-01 | Domenikos et al. | Applicant |
| US5848413(A) | 1998-12-01 | Wolff | Examiner |
| US5848427(A) | 1998-12-01 | Hyodo | Applicant |
| US5893910(A) | 1999-04-01 | Martineau et al. | Applicant |
| US5894554(A) | 1999-04-01 | Lowery et al. | Applicant |
| US5903816(A) | 1999-05-01 | Broadwin et al. | Applicant |
| US5905248(A) | 1999-05-01 | Russell et al. | Applicant |
| US5905865(A) | 1999-05-01 | Palmer et al. | Examiner |
| US5929849(A) | 1999-07-01 | Kikinis | Applicant |
| US5950173(A) | 1999-09-01 | Perkowski | Applicant |
| US5953005(A) | 1999-09-01 | Liu | Applicant |
| US5959944(A) | 1999-09-01 | Dockes et al. | Applicant |
| US5959945(A) | 1999-09-01 | Kleiman | Applicant |
| US5978773(A) | 1999-11-01 | Hudetz et al. | Examiner |
| US5987454(A) | 1999-11-01 | Hobbs | Applicant |
| US5991798(A) | 1999-11-01 | Ozaki et al. | Applicant |
| US5996000(A) | 1999-11-01 | Shuster | Applicant |
| US6005565(A) | 1999-12-01 | Legall et al. | Applicant |
| US6009410(A) | 1999-12-01 | LeMole et al. | Applicant |
| US6011758(A) | 2000-01-01 | Dockes et al. | Applicant |
| US6018768(A) | 2000-01-01 | Ullman et al. | Applicant |
| US6025837(A) | 2000-02-01 | Matthews, III et al. | Applicant |
| US6029142(A) | 2000-02-01 | Hill | Applicant |
| US6031795(A) | 2000-02-01 | Wehmeyer | Applicant |
| US6032130(A) | 2000-02-01 | Alloul et al. | Applicant |
| US6034925(A) | 2000-03-01 | Wehmeyer | Applicant |
| US6112240(A) | 2000-08-01 | Pogue et al. | Applicant |
| US6128255(A) | 2000-10-01 | Yankowski | Applicant |
| US6128625(A) | 2000-10-01 | Yankowski | Applicant |
| US6138162(A) | 2000-10-01 | Pistriotto et al. | Applicant |
| US6147940(A) | 2000-11-01 | Yankowski | Applicant |
| US6175857(B1) | 2001-01-01 | Hachiya et al. | Applicant |
| US6189030(B1) | 2001-02-01 | Kirsch et al. | Applicant |
| US6195693(B1) | 2001-02-01 | Berry et al. | Applicant |
| US6226672(B1) | 2001-05-01 | DeMartin et al. | Applicant |
| US6243725(B1) | 2001-06-01 | Hempleman et al. | Applicant |
| US6247022(B1) | 2001-06-01 | Yankowski | Applicant |
| US6263028(B1) | 2001-07-01 | Nagano | Applicant |
| US6263505(B1) | 2001-07-01 | Walker et al. | Applicant |
| US6272078(B2) | 2001-08-01 | Yankowski | Applicant |
| US6304523(B1) | 2001-10-01 | Jones et al. | Applicant |
| US6314570(B1) | 2001-11-01 | Tanigawa et al. | Applicant |
| US6324694(B1) | 2001-11-01 | Watts et al. | Applicant |
| US6388957(B2) | 2002-05-01 | Yankowski | Applicant |
| US6388958(B1) | 2002-05-01 | Yankowski | Applicant |
| US6434597(B1) | 2002-08-01 | Hachiya et al. | Applicant |
| US6457076(B1) | 2002-09-01 | Cheng et al. | Applicant |
| US6496802(B1) | 2002-12-01 | Van Zoest et al. | Applicant |
| US6505160(B1) | 2003-01-01 | Levy et al. | Applicant |
| US6535907(B1) | 2003-03-01 | Hachiya et al. | Applicant |
| US6609105(B2) | 2003-08-01 | Van Zoest et al. | Applicant |
| US6636249(B1) | 2003-10-01 | Rekimoto | Applicant |
| US6671736(B2) | 2003-12-01 | Virine et al. | Applicant |
| EP194143 | 1986-09-01 | Applicant | |
| EP460869 | 1991-12-01 | Applicant | |
| EP319567(B1) | 1993-02-01 | Applicant | |
| EP814419 | 1997-12-01 | Applicant | |
| JP7-95522 | 1995-04-01 | Applicant | |
| JP8-194453 | 1996-07-01 | Applicant | |
| JP8-306167 | 1996-11-01 | Applicant | |
| JP8-306170 | 1996-11-01 | Applicant | |
| JP9-16476 | 1997-01-01 | Applicant | |
| JP10-171818 | 1998-06-01 | Applicant | |
| WO7/05616 | 1997-02-01 | Applicant | |
| WO97/05616 | 1997-02-01 | Applicant | |
| WO97/41504 | 1997-11-01 | Applicant | |
| WO98/00788 | 1998-01-01 | Applicant | |
| WO98/02820 | 1998-01-01 | Applicant | |
| WO1/28222 | 2001-04-01 | Applicant |
Non-Patent Literature (79)
- M. Mascha et al. “Interactive Education: Transitioning CD-ROMs to the Web” Computer Network and ISDN Systems, vol. 27, No. 2, Nov. 1994, pp. 267-272.Applicant
- International Search Report for PCT/US 98 07660 mailed Nov. 16, 1998.Applicant
- USMARC Format for Bibliographic Data, Library of Congress, 1994.Applicant
- USMARC Format for Bibliographic Data—Update No. 2, Library of Congress, Mar. 1996.Applicant
- Sound Recordings Format, OCLC Online Systems, 2nd Edition 1986.Applicant
- Table of Contents of the Proceedings of the Second Annual ACM Conference on Hypertext, 1989, Printed from The ACM Digital Library, 4 pp.Applicant
- Table of Contents of the Proceedings of the Third Annual ACM Conference on Hypertext, 1991, Printed from The ACM Digital Library, 5 pages.Applicant
- Table of Contents of the Proceedings of the ACM Conference on Hypertext, 1992, Printed from The ACM Digital Library, 4 pages.Applicant
- Table of Contents of the Proceedings of the First ACM International Conference on Multimedia, 1993, Printed from The ACM Digital Library, 6 pages.Applicant
- Mark Baugher et al., “A Multimedia Client to the IBM LAN Server”, Proceedings of the First ACM International Conference on Multimedia, 1993, pp. 105-112.Applicant
- Naveed U. Qazi et al., “A Synchronization and Communication Model for Distributed Multimedia Objects”, Proceedings of the First ACM International Conference on Multimedia, 1993, pp. 147-155 (1-9).Applicant
- B. Prabhakaran et al., “Synchronization Models for Multimedia Presentation with User Participation”, Proceedings of the First ACM International Conference on Multimedia, 1993, pp. 157-166 (1-12).Applicant
- T.D.C. Little et al., “A Digital On-Demand Video Service Supporting Content-Based Queries”, Proceedings of the First ACM International Conference on Multimedia, 1993, pp. 427-436 (1-9).Applicant
- Table of Contents of the Proceedings of the 1994 ACM European Conference on Hypermedia Technology, 1994, Printed from The ACM Digital Library, 4 pages.Applicant
- Table of Contents of the Proceedings of the Fifth ACM Conference on Hypertext, 1993, Printed from The ACM Digital Library, 4 pages.Applicant
- Yoshitaka Shibata et al., “Dynamic Hypertext and Knowledge Agent Systems for Multimedia Information Networks”, Proceedings of the Fifth ACM Conference on Hypertext, 1993, pp. 82-92.Applicant
- Frank Wm. Tompa et al., “Hypertext by Link-Resolving Components”, Proceedings of the Fifth ACM Conference on Hypertext, 1993, pp. 118-130.Applicant
- Kyoji Hirata et al., “Media-based Navigation for Hypermedia Systems”, Proceedings of the Fifth ACM Conference on Hypertext, 1993, pp. 159-173.Applicant
- Robert M. Akscyn et al., “Design of Hypermedia Script Languages: The KMS Experience”, Proceedings of the Fifth ACM Conference on Hypertext, 1993, pp. 268-269.Applicant
- Table of Contents of the Proceedings of the Second ACM International Conference on Multimedia, 1994, from The ACM Digital Library, 10 pages.Applicant
- Dragutin Petkovic et al., “Multimedia Databases and Information Systems”, Proceedings of the Second ACM International Conference on Multimedia, 1994, p. 67.Applicant
- Jean-Pierre Courtiat et al., “Towards a New Multimedia Synchronization Mechanism and its Formal Specification”, Proceedings of the Second ACM International Conference on Multimedia, 1994, pp. 133-140.Applicant
- Tat-Seng Chua et al., “Content-based Retrieval of Segmented Images”, Proceedings of the Second ACM International Conference on Multi-media, 1994, pp. 211-218.Applicant
- Lian Ll et al., “MPEG-2 Coded- and Uncoded-Stream Synchronization Control for Real-time Multimedia Transmission and Presentation over B-ISDN”, Proceedings of the Second ACM International Conference on Multimedia, 1994, pp. 239-246.Applicant
- Shahram Ghandeharizadeh et al., “On Multimedia Repositories, Personal Computers, and Hierarchical Storage Systems”, Proceedings of the Second ACM International Conference on Multimedia, 1994, pp. 407-416.Applicant
- Louis Weitzman, “Automatic Presentation of Multimedia Documents Using Relational Grammars”, Proceedings of the Second ACM International Conference on Multimedia, 1994, pp. 443-451.Applicant
- Michael Mascha et al., “Interactive Education: Transitioning CD-ROMs to the Web”, Computer Networks and ISDN Systems, vol. 27, No. 2, 1994, pp. 267-272.Applicant
- Proposal No. 95-1: Changes to Field 856 (Electronic Location and Access) in the USMARC Bibliographic Format, Library of Congress, Dec. 2, 1994, 13 pages.Applicant
- Proposal No. 95-8: Define Field 856 (Electronic Location and Access) in the USMARC Classification Format, Library of Congress, May 5, 1995, 2 pages.Applicant
- ANSI/NISO Z39.50-1995—Information retrieval (Z39.50): Application Service Definition and Protocol Specification, 1995, pp. i-iv & 1-156.Applicant
- Table of Contents of the Proceedings of the Third ACM International Conference on Multimedia, 1995, from The ACM Digital Library, 8 pages.Applicant
- HongJiang Zhang et al., “Video Parsing, Retrieval and Browsing: An Integrated and Content-Based Solution”, Proceedings of the Third ACM International Conference on Multimedia, 1995, pp. 15-24 (1-19).Applicant
- Table of Contents of the Proceedings of the Seventh ACM Conference on Hypertext, 1996, Printed from The ACM Digital Library, 4 pages.Applicant
- Paul H. Lewis et al., “Media-based Navigation with Generic Links”, Proceedings of the Seventh ACM Conference on Hypertext, 1996, pp. 215-223.Applicant
- PURL Frequently Asked Questions, OCLC, Mar. 20, 1996, pp. 1-19.Applicant
- Z39.50 Implementors Group (ZIG) Meeting Minutes for Apr. 25, 1995, pp. 1-29.Applicant
- ZIG Meeting Minutes for Sep. 1995, pp. 1-22.Applicant
- Proposal No. 96-1: Changes to Field 856 (Electronic Location and Access) in the USMARC Formats, Library of Congress, Dec. 1, 1995, 12 pages.Applicant
- “The Computer Network Unveils Revolutionary Internet Advertising Tools that Allow Custom Banner Ad Delivery Based Demographic Information”, CNET Networks, Dec. 6, 1995, pp. 1-3.Applicant
- BookWhere? for Windows v1.1—Readme.txt, Sea Change Corporation 1995, pp. 1-3.Applicant
- GeoPac Management Guide, Release 1.25, Geac Computer Corporation Limited, 1994, pp. 1-1 to 4-24.Applicant
- Ian S. Graham, The HTML Sourcebook, 1995, pp. 18, 19, 178, 179, 192, 193, 258-277.Applicant
- Joshua Eddings, How the Internet Works, 1994, pp. 136-147, 158, 159.Applicant
- John D. Lenk, Lenk's Laser Handbook, McGraw-Hill, Inc., 1992, pp. 2.1-2.13.Applicant
- Protocol Specification for Internet Protocol—RFC 791, DARPA Internet Program, Sep. 1981, pp. i-iii, 1-45.Applicant
- Win32 Programmer's Reference vol. 2: System Services, Multimedia Extensions and Application Notes, Microsoft Press, 1993, pp. 517-519, 521-672.Applicant
- Comer et al, Internetworking with TCP/IP, vol. 1: Principles, Protocols and Architecture, Third Ed., 1995, pp. 59-71, 73-88 and 588.Applicant
- Comer et al, Internetworking with TCP/IP, vol. II: Design, Implementation and Internals, Third Ed., 1995, pp.Applicant
- Comer et al, Internetworking with TCP/IP, vol. III: Client-Server Programming and Applications, Third Ed., 1995, pp.Applicant
- Steve Scherf, cddb—CD Database Protocol Server, version 1.0, 1996.Applicant
- Ti Kan, xmcd—Unix CD Player, version 2.0, 1996.Applicant
- Martin Röscheisen et al., “Beyond Browsing: Shared Comments, SOAPs, Trails, and On-line Communities”, Computer Networks and ISDN Systems, vol. 27, 1994, pp. 739-749.Applicant
- Table of Contents of the Proceedings of the Fourth ACM International Conference on Multimedia, 1996, from The ACM Digital Library, 7 pages.Applicant
- Rainer Lienhart, “Automatic Text Recognition for Video Indexing”, Proceedings of the Fourth ACM International Conference on Multimedia, 1996, pp. 11-20.Applicant
- Ketan Mayer-Patel et al., “Synchronization Continuous Media Playback Through the World Wide Web”, Proceedings of the Fourth ACM International Conference on Multimedia, 1996, pp. 435-436.Applicant
- Brian C. Smith et al., “The Berkeley Continuous Media Toolkit”, Proceedings of the Fourth ACM International Conference on Multimedia, 1996, pp. 451-452.Applicant
- David DeRoure et al., “A Multiagent System for Content Based Navigation of Music”, Proceedings of the Seventh ACM International Conference on Multimedia, 1999, pp. 63-66.Applicant
- Keith Shafer et al., Introduction to Persistent Uniform Resource Locators, Proceedings of INET96, 1996, pp. 1-8.Applicant
- Proposal No. 97-9: Renaming of subfield 856$u to accommodate URNs, National Digital Library Program, May 1, 1997, pp. 1-6.Applicant
- Record for DISCID af0f630c from xmcd 1.4 CD database file, 1996.Applicant
- Record for DISCID af0f630c, Revision 1, processed by cddb v1.4b14PL0, 1996.Applicant
- Ti Kan, “X M C D version 2.0”, BSD News Article 64976, 1996, pp. 1-10.Applicant
- Tim Berners-Lee et al., Weaving the Web, 1999, pp. 188, 189, 211-219.Applicant
- Richard Seltzer, The AltaVista Search Revolution, Osborne McGraw-Hill, 1997, pp. 7, 8, 215-237.Applicant
- John Deep et al., Developing CGI Applications with Perl, 1996, pp. 71, 73, 76, 77.Applicant
- T. Berners-Lee, Hypertext Transfer Protocol—HTTP/1.0 (RFC 1945), Network Working Group, May 1996, pp. 1-60.Applicant
- WorkMan changes as of Release 1.3 (undated, Release 1.2.2a dated May 22, 1994).Applicant
- BookWhere? for Windows User Guide Manual Version 2.0.4, Sea Change Corporation 1996, pp. 5-36.Applicant
- BookWhere? for Windows v2.1—Readme.txt, Sea Change Corporation 1996, pp. 1-7.Applicant
- BookWhere? for Windows Help v2.0, Sea Change Corporation 1996, 16 pages.Applicant
- Paul H. Lewis et al., “Content Based Navigation in Multimedia Information Systems”, Proceedings of the Fourth ACM International Conference on Multimedia, 1996, pp. 415-416.Applicant
- Röscheisen et al; “Beyond browsing: shared comments, SOAPs, trails, and on-line communities”, Computer Networks and ISDN Systems, vol. 27, No. 6, 1995, pp. 739-749.Applicant
- Andy Hertzfeld, “User interface and artistic values”; Seminar on People, Computers and Design, Stanford University Program in Human-Computer Interaction, Apr. 15, 1992, printed on Mar. 10, 2005 from hci.stanford.edu/cs547/abstracts/91-92/920415-hertzfeld.html, 1 page.Applicant
- Denise Caruso, “CD-I Has a Rough Row to Hoe”, Digital Media, Jul. 1991; printed on Mar. 10, 2005 from www.Caruso.com/Digital—Media/DM91-07.TXT, pp. 1-13.Applicant
- “Frequently Asked Questions; Troubleshooting ConnecteD”, printed on Mar. 10, 2005 from jenniferlopez.com/ConnectedD/faq.html, pp. 1-5.Applicant
- Hiroshige Gotoh, “Microsoft Announces 'PC98' in April - Presentation of Annual PC Spec for the Coming Year of WinHEC,” DOS/V Power Report, Apr. 1, 1997, vol. 7, No. 4, p. 227.Applicant
- Office Action for Japanese Application No. 10-544286; mailed May 29, 2007.Applicant
- Office Action for Japanese Application No. 2007-100966; mailed May 29, 2007.Applicant
- Office Action for Japanese Application No. 2007-59701; mailed Jun. 5, 2007.Applicant