Audiovisual distribution system for playing an audiovisual piece among a plurality of audiovisual devices connected to a central server through a network

Information

  • Patent Grant
  • 8724436
  • Patent Number
    8,724,436
  • Date Filed
    Wednesday, May 4, 2011
    13 years ago
  • Date Issued
    Tuesday, May 13, 2014
    10 years ago
Abstract
An audiovisual distribution system includes a central server and a plurality of audiovisual units. Each unit includes structure for interactively communicating with the user for selecting a piece or a menu, a payment device, a computer network card, and a permanent semiconductor memory containing a multitask operating system comprising at least a hard disc access management task. The order for performing a selected piece is processed as a hard disc sequential access task. The hard disc is declared as a peripheral corresponding to the network card of the unit, enabling a request to be sent through the network to the server for processing.
Description
BACKGROUND AND SUMMARY OF THE INVENTION

1. Field of the Invention


This invention relates to an audiovisual distribution system for playing an audiovisual piece on at least one audiovisual device from among a plurality of audiovisual devices linked in a network to a central server.


2. Background and Summary


Networks exist which make it possible to produce music from a jukebox-type device by frequency multiplexing a musical selection on a cable network of the coaxial cable type used to distribute television channels. A device such as this one is known from patent EP 0140593. This patent has the drawback, however, that it requires conversion boxes to demultiplex signals, and it uses a network of the coaxial type involving—for one channel—distribution of the same selection to all stations.


A first object of the invention is to allow the network to distribute as a matter of choice either the same selection to all the devices, or a different selection to each individual device; the selection can be either of the audio or video type.


British patent 2193420 and patent PCT WO 9415416 also disclose audio selection distribution networks requiring telephone lines. Due to the use of these telephone lines, network transmission speeds are limited and a network such as this cannot be used for distribution of video selections requiring a high transmission speed to allow good-quality video reproduction.


PCT patent WO 9415416 discloses use of a telephone line of the ISDN type, but even this type of line—the transmission speed of which is limited to 18 megabits per second—is not sufficient to distribute good-quality video data to a sufficient number of devices.


Finally, another object of the invention is a network in which the costly elements are transferred to the level of the server to reduce the cost of each audiovisual reproduction device, but without detriment to their performance. These costly elements are high-capacity hard disks allowing storage of a sufficient number of data selections, in particular video, and also telecommunication modems with transmission speeds allowing the network to be linked to a central system servicing a plurality of networks.


This object is achieved in an audiovisual distribution system according to the present invention. An audiovisual piece can be played on at least one audiovisual device from among a plurality of audiovisual devices. Each device includes audio or video units for playing a piece. The audio or video units are linked to a central computer server containing optical or magnetic memory for mass storage of a plurality of audiovisual pieces selectable from any of these devices. Each of the audiovisual devices has interactive structure for communication with the user to select a piece or a menu, a payment device, a computer network card, a permanent semiconductor memory containing a multitask operating system including at least one hard disk access management task in which the order to play a piece resulting from a selection is handled as a hard disk sequential access task and declaration of the hard disk as a peripheral corresponding to the network card of the device, in order to allow a request to a server to be sent through the network for processing. The server includes a multitask operating system, a permanent mass memory of the magnetic or optical type, and a network card by which the requests from different devices are received. The operating system processes these disk access requests produced by the devices as actual disk access requests.


Another feature of the invention is that in the operating system of each audiovisual device, the declaration of the telecommunications modem belonging to a telecommunications access task as peripheral corresponds to that of the network card, and when a telecommunications access request is made at the device level, the network card of this device transmits this request to the server which itself has at least one telecommunications modem.


According to another feature, the audiovisual device is assured beforehand by a request that the modem card of the server be available.


According to another feature, the transmission speed of each network card and the buffers of video and audio control circuits are dimensioned to allow exchange of data with a transmission rate sufficient for video animation on a network containing at least eight audiovisual devices.


According to another feature, each audiovisual device has a touch screen and its interface software connected as an interactive means of communication with the user.


According to another feature, the network has as many servers each linked to a hard disk as it does servers corresponding to the number (multiple of eight) of audiovisual devices.


According to another feature, the operating system of each server is linked to a switching device making it possible to decide whether the data supplied in response to the request of one network device are given to all the network devices or only to those devices which transmitted a request.


According to another feature, the server is equipped with structure for audio or video performance of a piece, a payment device, and structure for interactive communication with a user or network manager.





BRIEF DESCRIPTION OF THE DRAWINGS

Other advantages and features of the invention will be discussed in the description below, with reference to the attached drawings, given by way of an illustrative example but not limited to one embodiment of the invention, in which:



FIG. 1 shows a circuit diagram of the network according to the invention;



FIG. 2 shows a schematic of the circuits which comprise an audiovisual device of the network;



FIG. 3 shows a schematic of the circuits which comprise a server of the network;



FIG. 4 shows the organization of the multitask system which manages the hardware and software structure of each of the devices or servers of the network;



FIG. 5 shows a flowchart which describes how the multitask operating system functions;



FIG. 6 shows a flowchart which describes how the activities of tasks in the multitask system are verified; and



FIG. 7 is a flowchart which describes task queuing.





DETAILED DESCRIPTION OF PREFERRED EMBODIMENTS

Preferably, but in a nonrestrictive manner, the audiovisual reproduction system uses the components cited above and numbered hereafter as in FIG. 1.


The system is comprised of a plurality of audiovisual devices AV (81, 82, 816) linked to one another and via a computer server to at least one server (91, 92).


There are two types of servers (91, 92) which can be linked to a local network (10), master servers (91) and mirror servers (92). Master servers (91) are those which are actively involved with the local network. They are the ones which receive requests from the jukeboxes (8) and which do the work.


The job of the mirror servers (92) is to clone the master servers (91). They must be perfectly synchronized with their masters to be ready for any change. When they detect that the master server (91) is no longer responding to the requests of the jukeboxes (8), they must make distress calls to the network administrators in order to take over for the masters until the latter are operating normally again.


Each server (91, 92) is comprised of a central microprocessor (1 in FIG. 3) which is, for example, a high-performance PC-compatible system, the choice for the embodiment having fallen on an Intel 80486 DX/2 system which has storage means and the following characteristics.

    • compatibility with the local Vesa bus,
    • processor cache memory: 256 kO,
    • 100 Mbit network card (71)
    • high performance parallel and serial ports,
    • 32-bit type SCSI/2WIDE bus controller,
    • 32 MO battery backedup static RAM.


The operating system of the network cards must be a local network server such as NOVELL, OS/2 LAN SERVER, UNIX or any other similar operating system.


This network server software allows access, exchange and sharing of data and equipment resources in an orderly manner by applying priorities and rules of access to each of the customers connected to the local network.


Any other central processor with equivalent or better performance can be used in the invention.


The central unit (1, FIG. 3) of the server controls and manages network control circuit (7), telecommunications control circuit (4), input control or interface circuit (3), and mass storage control circuit (2). If server (9) must operate as a jukebox, it is possible to add audio control circuit (5) and display control circuit (6) of the same type as of devices (8). The display consists essentially of 14 inch (35.56 cm) flat screen video monitor (62) without interleaving of the SVGA type, with high resolution and low radiation, which is used for image reproduction (for example, the covers of the albums of the musical selections), graphics or video clips.


For maintenance, server (9) uses external keyboard (34) which can be linked to the server which has for that purpose a keyboard connector, controlled by interface circuit (3).


Mass storage means (21) using high-speed, high-capacity SCSI-type hard disks are connected to the storage means already present in the microprocessor of server (9). These means are used to store digitized and compressed audiovisual data.


High-speed telecommunications modem circuit (41) of at least 28.8 Kbps is incorporated into server (9) to authorize the link to a network for distribution of audiovisual data controlled by a central system covering several servers.


Each audiovisual device (8) has one central microprocessor unit (1, FIG. 2) which is, for example, a high-performance PC-compatible system. The choice for the embodiment has fallen on an Intel 80486 DX/2 system which has storage means and the following characteristics:

    • compatibility with the local Vesa bus,
    • processor cache memory: 256 kO,
    • 100 Mbit network card (71),
    • 32 MO battery-backed static RAM,
    • high performance parallel and serial ports.


Any other central processor with equivalent or better performance can be used in the invention.


This central unit controls and manages audio control circuit (5), input control circuit (3), computer network control circuit (7) and display control circuit (6). The display consists essentially of a 14 or 15 inch (35.56 cm) flat screen video monitor (62) without interleaving of the SVGA type, with high resolution and low radiation, which is used for image reproduction (for example, the covers of the albums of the musical selections), graphics or video clips.


To reproduce the audio data of musical selections, the devices and possibly the server(s) have loudspeakers (54) which receive the signal of an amplifier-tuner (53) linked to electronic circuit (5) of the music synthesizer type intended to support a large number of input sources while providing one output with CD (compact disk)-type quality, such as for example the microprocessor multimedia audio adapter of the “Sound Blaster” card type SBP32AWE by Creative Labs Inc to which two memory buffers (56, 57) are added for the purpose described below. This circuit (5) has the function of decompressing the digital data arriving via the network.


Likewise the display control circuit also has two buffer memories (66, 67) for the purpose described below.


A ventilated, thermally controlled power supply of 240 watts powers each device or server. This power supply is protected from surges and harmonics.


Each audiovisual device (8) and possibly the server(s) (9) manage—via input controller circuit (3)—an “Intelli Touch” 14-inch (35.56 cm) touch screen (33) from Elo Touch Systems Inc. which includes a glass coated board using “advanced surface wave technology” and an AT type bus controller. This touch screen allows, after having displayed on video monitor (62) or television screen (61) various selection data used by the customers, as well as management command and control information used by the system manager or owner. It is likewise used on each device (8) for maintenance purposes in combination with external keyboard (34) which can be connected to the device which has a keyboard connector for this purpose, controlled by key lock (32) via interface circuit (3).


Input circuit (3) of at least one of devices (8) of the network likewise interfaces with a remote control set (31) composed for example of:

    • an infrared remote control from Mind Path Technologies Inc., including an emitter which has 15 control keys for the microprocessor system and 8 control keys for the projection device.
    • an infrared receiver with serial adapter from Mind Path Technologies Inc.


A fee payment device (35) from National Rejectors Inc. is likewise connected to input interface circuit (3). It is also possible to use any other device which allows receipt of any type of payment by coins, bills, tokens, magnetic chip cards or a combination of means of payment.


To house the circuits, each device has a chassis or frame of steel with external customizable fittings.


Besides these components, a wireless or wired microphone (55) is connected to audio controller (5) of each device; this allows transformation of the latter into a powerful public address system or possibly a karaoke machine Likewise a wireless loudspeaker system can be used by the system.


Remote control set (31) allows the manager, for example from behind the bar, to access and control various commands such as:

    • microphone start/stop command,
    • loudspeaker muting command,
    • audio volume control command;
    • command to cancel the musical selection being played.


Two buffers (56, 57) are connected to audio controller circuit (5) to allow storage of information corresponding to a quarter of a second of sound each in alternation. Likewise two buffers (66, 67) are linked to each video controller circuit (6), each of which is able to store a tenth of a second of video in alternation. Finally, an input interface buffer (36) is connected to each input interface (3) of each device (8) or server (9).


The system operating software of each device (8) or server (9) was developed around a library of tools and services largely oriented to the audiovisual domain in a multimedia environment. This library advantageously includes a powerful multitask operating system which effectively authorizes simultaneous execution of multiple fragments of code. This operating software thus allows concurrent execution—in an orderly manner and avoiding any conflict—of operations carried out on the display or audio reproduction structure as well as management of the telecommunications lines via the distribution network. In addition, the software has high flexibility.


The digitized and compressed audiovisual data are stored in storage (21) of server (9).


Each selection is available in two digitized formats: with hi-fi quality or CD quality.


The operating software of each device (8) is installed in the battery backed-up static RAM of each device (8), while the operating software of server (9) can be backed up on hard disk (21) and loaded for operation in the server's RAM.


It must be noted that the specific tasks of the modules which make up the operating system are executed simultaneously in an environment using the multitask operating system. Consequently, the organizational chart indicates specific operations which a module must perform and not a branch to this module which would invalidate all the operations performed by the other modules.


The first module, labeled SSM, is the startup module. This module does only one thing, and consequently it is loaded automatically when the device or server is powered up and then directly re-enters the “in service” mode of the module labeled RMM.


The RMM module is the module of the “in service” mode which is the mode of operation which the system enters when its registration number has been validated. In this mode, device (8) or server (9) is ready to handle any request which can be triggered by various predefined events such as:

    • users touching the screen of device (8), transferring foreground session control to the CBSM module from the customer browsing and selection mode,
    • telecommunications call requests by the TSM telecommunications services module,


Device (8) or server (9) remains in the “in service” mode until one of the events cited above takes place.


The CBSM module is the customer browsing and selection mode. Access to this module is triggered from the “in service” mode when the customer touches the screen. The display allows the user to view a menu provided for powerful browsing assisted by digitized voice messages to guide the user in his choice of musical selections.


The TSM module is the telecommunications services mode module between the network server and a central system covering several servers belonging to different networks. The module allows management of all management services available on the distribution network. All the tasks specific to telecommunications are managed as background tasks of the system. These tasks always use only parts of the processing time remaining once the system has completed all its foreground tasks. Thus, when the system is busy with one of its higher priority tasks, the telecommunications tasks automatically will try to reduce the limitations on system resources and recover all the microprocessor processing time left available.


The SPMM module allows management of musical, song or video selections queued by the system for execution in the order of selection.


The multitask operating system is the essential component for allowing simultaneous execution of multiple code fragments and for managing priorities between the various tasks which arise.


This multitask operating system is organized as shown in FIG. 4 around a kernel comprising a module (11) for resolving priorities between tasks, task scheduling module (12), module (13) for serialization of hardware used, and process communications module (14). Each of the modules communicates with applications programming interfaces (15) and database (16). There are as many programming interfaces as there are applications. Thus, module (15) includes first programming interface (153) for touch screen (33), second programming interface (154) for the keyboard, third programming interface (155) for payment device (35), fourth programming interface (156) for audio control circuit (5), fifth programming interface (157) for video control circuit (6) and last interface (158) for computer network control circuit (7).


It should be noted that the programming interface of the network card is supplied with the card when a network kit is purchased and that the network card is declared to the operating system as the peripheral comprising the hard disk or the modem, telecommunication card of each audiovisual device (8). Thus each operating system of each device (8), after calling a telecommunications procedure or hard disk access procedure following a selection, triggers a network communication session in which the network card of the server will make the called resource available to each audiovisual device (8).


Five tasks with a decreasing order of priority are managed by the kernel of the operating system, the first (76) for the video inputs/outputs has the highest priority, the second (75) of level two relates to audio, the third (74) of level three to telecommunications, the fourth (73) of level four to interfaces and the fifth (70) of level five to management. These orders of priority will be considered by priority resolution module (11) as and when a task appears and disappears. Thus, as soon as a video task appears, the other tasks underway are suspended, priority is given to this task and all the resources are assigned to the video task. At the output, video task (76) is designed to unload the video files from mass memory (21) alternatively to one of two buffers (66, 67) of device (8) which made the request, whereas the other buffer (67 or 66) is used by video controller circuit (6) of device (8) having made the request to produce the display after data decompression. At the input, video task (76) from server (9) is designed to transfer data received in telecommunications buffer (46) of server (9) to mass storage (21) of server (9). It is the same for audio task (75) on the one hand at the input between a telecommunications buffer (46) and the buffer (26) of mass memory (21) and on the other hand at the output between a buffer (26) of mass memory (21) of server (9) and one of two buffers (56, 57) of audio controller circuit (5) of device (8) which made the request.


Task scheduling module (12) of each device (8) or server (9) will now be described in conjunction with FIG. 5. In the order of priority this module performs first test (761) to determine if the video task is active, i.e., if one of video buffers (66, 67) is empty. In the case of a negative response the task scheduling module passes to the following test which is second test (751) to determine if the audio task is active, i.e., if one of buffers (56, 57) is empty. In the case of a negative response, a third test (741) determines if the communication task is active, i.e., if buffer (46) is empty. After a positive response to one of the tests, task scheduling module (12) at stage (131) fills memory access request queue (13) and at stage (132) executes this request by reading or writing between mass storage (21) of server (9) and the buffer corresponding to the active task of device (8), then loops back to the first test. When test (741) on communications activity is affirmative, scheduler (12) performs test (742) to determine if it is a matter of reading or writing data in the memory. If yes, the read or write request is placed in a queue at stage (131). In the opposite case, the scheduler determines at stage (743) if it is transmission or reception and in the case of transmission sends via a network communication procedure at step (744) a block of data to server (9) for transmission by the latter to the central system covering several servers. In the case of reception the scheduler verifies at stage (746) that the server buffers are free for access and in the affirmative sends a message to the central server to accept reception of a data block at stage (747). After receiving a block, an error check (748) of the cyclic redundancy check (CRC) type is executed. The block is rejected at stage (740) in case of error, or accepted in the opposite case at stage (749) by sending a message corresponding to the central system indicating that the block bearing a specific number is rejected or accepted, then loops back to the start tests. When there is no higher level task active, at stage (731 or 701) the scheduler processes interface or management tasks.


Detection of an active task or ready task is done as shown in FIG. 6 by a test respectively (721 to 761) on each of respective hardware or software buffers (26) of the hard disk, (36) of the interface, (46) of telecommunications, (56 and 57) of audio, (66 and 67) of video which are linked to each of respective controller circuits (2, 3, 4, 5, 6, 7) of each of the hardware devices linked to central processor (1).


Test (721) makes it possible to see whether the data are present in the input and output memory buffer of the disk, test (731) makes it possible to see whether data are present in the hardware or software memory buffers of the customer interface device, test (741) makes it possible to see whether data are present in the software or hardware memory buffers of the telecommunications device, test (751) makes it possible to determine whether data are present in the hardware or software memory buffer for direction, and test (761) makes it possible to see whether data are present in the hardware or software memory buffers of the video device.


If one or more of these buffers are filled with data, scheduler (12) positions respective status buffer or buffers (821) for the hard disk, (831) for the interface, (841) for telecommunications, (851) for audio, (861) for video corresponding to the material in a logic state indicative of the activity. In the opposite case the scheduler status buffers are returned at stage (800) to a value indicative of inactivity.


The operating status of server (9) or respectively of device (8) is kept on hard disk (21) of server (9) or respectively in the battery backed-up memory of device (8).


Each time a notable event occurs, the system immediately registers it in the permanent storage.


Thus, in the case in which an electrical fault or hardware failure occurs, the system will accordingly restart exactly at the same location where it had been interrupted.


Events which trigger back-up of the operating status are:

    • insertion of money (crediting);
    • addition of a selection to the queue;
    • end of a selection (change from the selection currently being played).


The file is then in a machine format which can only be read by the unit and does not occupy more than 64 octets.


The number and type of active tasks are indicated to scheduler (12) by execution of the selection management module SPMM whose flowchart is shown in FIG. 7. The management exercised by this module begins with test (61) to determine if selections are in the queue.


Consequently, if test (61) on the queue determines that selections are waiting, when a customer chooses a title he wishes to hear, it is automatically written in a queue file of the system on hard disk.


Thus, any selection made will never be lost in case of an electrical failure. The system plays (reproduces) the selection in its entirety before removing it from the queue file.


When the selection has been reproduced in its entirety, it is removed from the queue file and written in the system statistics file with the date and time of purchase as well as the date and time at which it was played.


Immediately after transfer of the completed selection to the statistics file, the device checks if there are others in the queue file. If there is another, the device begins immediately to play the selection.


Processing continues with test (65) conducted to determine if the selection contains an audio scenario. If yes, at stage (651) this scenario is written in the task queue of scheduler (12). If not, or after this entry, processing is continued by test (66) to determine if the selection contains moving images. If yes, the video scenario is written at stage (661) in the task queue of scheduler (12). If no or if yes after this entry, processing is continued by test (64) to determine if the selection contains still graphics. If yes, at stage (641) this graphic presentation scenario is written in the task queue of scheduler (12). If no or if yes after this entry, processing is continued by test (63) to determine if the selection contains an advertising scenario. If yes, at stage (631) the scenario is written in the task queue of scheduler (12). Thus scheduler (12) notified of uncompleted tasks can manage the progression of tasks simultaneously.


Due on the one hand to the task management mode assigning highest orders of priority to video tasks requiring the most resources, on the other hand to the presence of hardware or software buffers assigned to each of the tasks to temporarily store data, the presence of status buffers relating to each task, and communication between each device and a server via the computer network, it is possible to transfer costly resources necessary for certain tasks of devices (8) to single central unit (9) which also has a multitask operating system.


A basic server (9) is designed to service a local network having up to eight customer jukeboxes. With addition of appropriate peripherals, such as supplementary hard disks, one server can serve a maximum of 8 additional jukeboxes. To add more jukeboxes, it is possible to create local network environments which have several servers which share tasks. Thus it is possible to create environments capable of meeting any need.


A completely equipped server has sufficient resources to administer 16 jukeboxes. A server can support up to 7 disks which can contain as many selections as there is available space needed for the type of selection, with the knowledge that an audio selection and its graphic part require 3.4125 Mbits of available disk space, and an audio and video selection requires 39.568 Mbits of available disk space.


In order to circumvent these limitations and meet the needs of establishments such as hotel complexes which sometimes have several hundred rooms, it is possible to use mass storage technologies such as RAID to back up the selections and/or network configurations with multiple servers in order to serve the jukeboxes.


It is also possible to add additional telecommunications peripherals (41) such as modems in order to satisfy the network's additional needs for telecommunications to the outside.


The network allows the server to assume responsibility for carrying out several tasks common to each jukebox in order to avoid redundancy of work, computer operations and equipment.


The local network also serves as an important link between all the jukeboxes by making connections which allow all data common to all the jukeboxes to be kept and made accessible to each of them.


The common data kept on a server are either audio/video selections or statistics of use of the purchases of each jukebox, or statistics on the audio/video selections.


The jukebox or audiovisual device (8) on the one hand has no telecommunications peripherals because the latter are centralized at server (9), but it does make requests to server (9) which processes them as a priority; on the other hand, it does not have the disk space required to store audio/video selections, since the selections are centralized at server (9) so that they may be shared with all the jukeboxes of the local network.


Network jukebox (8) needs very little permanent storage space, since all data will now be centralized, allowing units without hard disks to be produced and thus reducing maintenance by eliminating those parts most likely to break down. In jukebox (8) without a hard disk, a permanent memory region contains the information and an operating program necessary to make connections with the server and start-up the jukebox operating system.


This permanent memory can be in the form of an EEPROM, static memory banks which are backed up by batteries or even cards called HARD CARDS which are static memory banks backed up by batteries with functions allowing the tasks of a hard disk to be cloned.


The operating system of jukebox module (8) is assured of having the resources necessary to do its work. To do this it must manage the status of links with centralized peripherals and if necessary make requests to the server requesting that the appropriate connections be made between the jukebox and the required peripheral. If the resources, for example, telecommunications resources, are not in use by a jukebox, then server (9) will provide exclusive links to the jukebox.


Once the connection has been made, jukebox (8) can do its work as if the resource were its own. Once the jukebox (8) finishes its work, it sends a request to the server to be disconnected from the resource, thus making it available for other jukeboxes (8) in the network.


The order and logic used to provide distribution and access privileges to the ordered resources are controlled by the network operating system which is on server (9).


Thus a switching device such as a hardware or software key allows the network operator to decide whether server (9) shall play the same selection on all devices (8) of the network or to let each device (8) play a different selection. In this latter case, hard disk resources will be accessed time-shared between each device (8), since buffers (56, 57; 66, 67) of each device (8) have sufficient capacity to await subsequent access without there being discontinuity in the audio or visual representation.


Moreover, the multitask operating system, which includes a library containing a set of tools and services, considerably facilitates operation due to its integration in the memory storage and the resulting high degree of flexibility. In particular, this allows a multimedia environment to be created by simply and efficiently managing audio reproduction, video or graphics display, and video animation. In addition, since the audiovisual data are digitized and stored in the server's storage alone, the cost of the network is considerably reduced.


Likewise, transfer of hardware necessary for the telecommunications function of each device (8) on the network server greatly reduces the cost and by using a computer network with a transmission speed of 100 Mbit/s makes it possible to serve simultaneously at least eight devices which can all simultaneously reproduce a different video animation piece on each of the devices, with the knowledge that each video animation requiring a transmission speed of 10 Mbit/s.


This would not have been possible with the ISDN network of patent WO 94/15416, with a transmission speed which is on the order of 1 Mbit/s, insufficient even for video animation. The same applies to any other line for long distance data transmission.


Any modification by one skilled in the art is likewise part of the invention. Thus, regarding buffers, it should be remembered that they can be present either physically in the circuit to which they are assigned or implemented by software by reserving storage space in the system memory.

Claims
  • 1. A jukebox system for playing a musical piece, comprising: a central jukebox server, including: a mass storage location configured to store a plurality of musical pieces, anda server network card configured to receive requests for said musical pieces; anda plurality of jukebox devices, each said jukebox device including: an audio reproduction unit configured to playback musical pieces,a user interface,a payment device configured to receive payment in exchange for the playback of musical pieces selected by the user interface,a network card linked to said server network card through a network, anda multitasking operating system operatively coupled with the audio reproduction unit, the user interface, the payment device, and the device network card,wherein the central jukebox server further comprises a switching device configured to selectively operate in first and second modes, the first mode causing all jukebox devices connected to the central jukebox server to play back a common musical piece at the same time, and the second mode enabling different jukebox devices to play back different musical pieces at the same time,wherein detected events are selectively logged in a permanent storage location,wherein an operating status is also selectively logged in the permanent storage location, andwherein, following an electrical fault or hardware failure, the system is configured to read logs in the permanent storage location so as to enable the system to be restarted at a same place as the system was just prior to the electrical fault or hardware failure.
  • 2. The jukebox system of claim 1, wherein the central jukebox server further comprises a network multitasking operating system configured to provide distribution and access privileges to the musical pieces stored in the mass storage location.
  • 3. The jukebox system of claim 1, wherein each said jukebox device is configured to play musical pieces from the central jukebox server.
  • 4. The jukebox system of claim 1, further comprising temporary network links between one said jukebox device and the central jukebox server configured to enable exclusive access to a resource on the central jukebox server.
  • 5. The jukebox system of claim 4, wherein one said jukebox device is configured to play musical pieces from the central jukebox server via a respective temporary network link.
  • 6. The jukebox system of claim 1, wherein the jukebox devices each include a permanent storage location configured to store the respective multitasking operating systems.
  • 7. The jukebox system of claim 6, wherein the central jukebox server is configured to maintain statistics relating to selections made via the jukebox devices.
  • 8. The jukebox system of claim 1, wherein the jukebox devices are linked together via a local network connection.
  • 9. The jukebox system of claim 1, wherein each said jukebox device is configured to access the mass storage location via the respective network card as if the mass storage location were a disk drive device integrated into the jukebox device.
  • 10. A method of operating a jukebox system, comprising a central jukebox server, including: a mass storage location configured to store a plurality of musical pieces, anda server network card configured to receive requests for said musical pieces; anda plurality of jukebox devices, each said jukebox device including: an audio reproduction unit configured to playback musical pieces,a user interface,a payment device configured to receive payment in exchange for the playback of musical pieces selected by the user interface,a network card linked to said server network card through a network, anda multitasking operating system operatively coupled with the audio reproduction unit, the user interface, the payment device, and the device network card,wherein the method comprises: selectively operating a switching device of the central jukebox server according to a first mode or a second modes, the first mode causing all jukebox devices connected to the central jukebox server to play back a common musical piece at the same time, and a second mode enabling different jukebox devices to play back different musical pieces at the same time; andfollowing an electrical fault or hardware failure, restarting the jukebox system by reading logs maintained in the permanent storage location, the logs including entries for selected events, the restarting being performed so as to restore the system to the place where it was just prior to the electrical fault or hardware failure.
  • 11. The method of claim 10, further comprising providing distribution and access privileges to the musical pieces stored in the mass storage location via a network multitasking operating system.
  • 12. The method of claim 10, further comprising configuring each said jukebox device to play musical pieces from the central jukebox server.
  • 13. The method of claim 10, further comprising establishing temporary network links between one said jukebox device and the central jukebox server, the temporarily network links being configured to enable exclusive access to a resource on the central jukebox server.
  • 14. The method of claim 10, wherein the jukebox devices each include a permanent storage location configured to store the respective multitasking operating systems.
  • 15. The method of claim 14, further comprising maintaining statistics relating to selections made via the jukebox devices on the central jukebox server.
  • 16. The method of claim 10, wherein the jukebox devices are linked together via a local network connection.
  • 17. The method of claim 10, wherein each said jukebox device is configured to access the mass storage location via the respective network card as if the mass storage location were a disk drive device integrated into the jukebox device.
Priority Claims (1)
Number Date Country Kind
94 01185 Oct 1994 FR national
CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a Continuation of U.S. application Ser. No. 12/662,639 filed Apr. 27, 2010 now U.S. Pat. No. 7,987,282, which is a Continuation of U.S. application Ser. No. 11/493,574 filed Jul. 27, 2006 now U.S. Pat. No. 7,783,774, now allowed, which is a continuation of U.S. application Ser. No. 10/195,476 filed Jul. 16, 2002, now patented as U.S. Pat. No. 7,124,194, which is a continuation of U.S. application Ser. No. 08/817,426 filed Jun. 19, 1997, now abandoned, which is a national stage entry of PCT/FR95/01337 filed Oct. 12, 1995, which claims foreign priority to PCT/FR94/01185 filed Oct. 12, 1994. The entire contents of which are hereby incorporated by reference in this application. This application is related to our co-pending commonly assigned patents and applications: USSN 08/817,690(Corres. to PCT/FR94/01185filed Oct. 12, 1994);USSN 08/817,689(Corres. to PCT/FR95/01333filed Oct. 12, 1995);U.S. PAT. NO. 6,308,204(Corres. to PCT/FR95/01334filed Oct. 12, 1995USSN 08/817,968(Corres. to PCT/FR95/01335filed Oct. 12, 1995)U.S. PAT. NO. 6,182,126(Corres. to PCT/FR95/01336filed Oct. 12, 1995)USSN 08/817,438(Corres. to PCT/FR95/01338filed Oct. 12, 1995)

US Referenced Citations (524)
Number Name Date Kind
3807541 Kortenhaus Apr 1974 A
3982620 Kortenhaus Sep 1976 A
4008369 Theurer et al. Feb 1977 A
4186438 Benson et al. Jan 1980 A
4232295 McConnell Nov 1980 A
4335809 Wain Jun 1982 A
4335908 Burge Jun 1982 A
4356509 Skerlos et al. Oct 1982 A
4369442 Werth et al. Jan 1983 A
4375287 Smith Mar 1983 A
4412292 Sedam et al. Oct 1983 A
4413260 Siegel et al. Nov 1983 A
4521014 Sitrick Jun 1985 A
4528643 Freeny, Jr. Jul 1985 A
4558413 Schmidt Dec 1985 A
4572509 Sitrick Feb 1986 A
4577333 Lewis et al. Mar 1986 A
4582324 Koza et al. Apr 1986 A
4588187 Dell May 1986 A
4593904 Graves Jun 1986 A
4597058 Izumi et al. Jun 1986 A
4636951 Harlick Jan 1987 A
4652998 Koza et al. Mar 1987 A
4654799 Ogaki et al. Mar 1987 A
4658093 Hellman Apr 1987 A
4667802 Verduin et al. May 1987 A
4674055 Ogaki et al. Jun 1987 A
4675538 Epstein Jun 1987 A
4677311 Morita Jun 1987 A
4677565 Ogaki Jun 1987 A
4703465 Parker Oct 1987 A
4704725 Harvey et al. Nov 1987 A
4707804 Leal Nov 1987 A
4722053 Dubno Jan 1988 A
4761684 Clark et al. Aug 1988 A
4766581 Korn et al. Aug 1988 A
4787050 Suzuki Nov 1988 A
4792849 McCalley Dec 1988 A
4807052 Amano Feb 1989 A
4811325 Sharples, Jr. et al. Mar 1989 A
4814972 Winter et al. Mar 1989 A
4825054 Rust Apr 1989 A
4829570 Schotz May 1989 A
4852154 Lewis et al. Jul 1989 A
4857714 Sunyich Aug 1989 A
4868832 Marrington Sep 1989 A
4885694 Pray et al. Dec 1989 A
4905279 Nishio Feb 1990 A
4920432 Eggers Apr 1990 A
4922420 Nakagawa et al. May 1990 A
4924378 Hershey May 1990 A
4926485 Yamashita May 1990 A
4937807 Weitz et al. Jun 1990 A
4949187 Cohen Aug 1990 A
4953159 Hayden et al. Aug 1990 A
4956768 Sidi et al. Sep 1990 A
4958835 Tashiro et al. Sep 1990 A
4977593 Ballance Dec 1990 A
4999806 Chernow Mar 1991 A
5008814 Mathur Apr 1991 A
5012121 Hammond Apr 1991 A
5027426 Chiocca Jun 1991 A
5041921 Scheffler Aug 1991 A
5046093 Wachob Sep 1991 A
5053758 Cornett et al. Oct 1991 A
5058089 Yoshimaru et al. Oct 1991 A
5077607 Johnson et al. Dec 1991 A
5081534 Geiger et al. Jan 1992 A
5101499 Streck et al. Mar 1992 A
5106097 Levine Apr 1992 A
5117407 Vogel May 1992 A
5138712 Corbin Aug 1992 A
5148159 Clark et al. Sep 1992 A
5155847 Kirouac Oct 1992 A
5163131 Row Nov 1992 A
5166886 Molnar Nov 1992 A
5172413 Bradley et al. Dec 1992 A
5180309 Egnor Jan 1993 A
5189630 Barstow et al. Feb 1993 A
5191573 Hair Mar 1993 A
5191611 Lang Mar 1993 A
5192999 Graczyk Mar 1993 A
5197094 Tillery Mar 1993 A
5203028 Shiraishi Apr 1993 A
5210854 Beaverton et al. May 1993 A
5214761 Barrett et al. May 1993 A
5222134 Waite et al. Jun 1993 A
5228015 Arbiter et al. Jul 1993 A
5237157 Kaplan Aug 1993 A
5237322 Heberle Aug 1993 A
5239480 Huegel Aug 1993 A
5250747 Tsumura Oct 1993 A
5252775 Urano Oct 1993 A
5260999 Wyman Nov 1993 A
5261104 Bertram et al. Nov 1993 A
5262875 Mincer et al. Nov 1993 A
5276866 Paolini Jan 1994 A
5278904 Servi Jan 1994 A
5282028 Johnson et al. Jan 1994 A
5289476 Johnson et al. Feb 1994 A
5289546 Hetherington Feb 1994 A
5315161 Robinson May 1994 A
5315711 Barone et al. May 1994 A
5319455 Hoarty et al. Jun 1994 A
5321846 Yokota et al. Jun 1994 A
5327230 Dockery Jul 1994 A
5339095 Redford Aug 1994 A
5339413 Koval et al. Aug 1994 A
5341350 Frank et al. Aug 1994 A
5355302 Martin et al. Oct 1994 A
5357276 Banker Oct 1994 A
5369778 SanSoucie Nov 1994 A
5375206 Hunter Dec 1994 A
5386251 Movshovich Jan 1995 A
5389950 Bouton Feb 1995 A
5404505 Levinson Apr 1995 A
5406634 Anderson et al. Apr 1995 A
5408417 Wilder Apr 1995 A
5410326 Goldstein Apr 1995 A
5410703 Nilsson et al. Apr 1995 A
5414455 Hooper et al. May 1995 A
5418713 Allen May 1995 A
5420923 Beyers May 1995 A
5428252 Walker Jun 1995 A
5428606 Moskowitz Jun 1995 A
5431492 Rothschild Jul 1995 A
5440632 Bacon et al. Aug 1995 A
5444499 Saitoh Aug 1995 A
5445295 Brown Aug 1995 A
5455619 Truckenmiller et al. Oct 1995 A
5455926 Keele Oct 1995 A
5457305 Akel et al. Oct 1995 A
5465213 Ross Nov 1995 A
5467326 Miyashita et al. Nov 1995 A
5469370 Ostrover et al. Nov 1995 A
5469573 McGill et al. Nov 1995 A
5471576 Yee Nov 1995 A
5475835 Hickey Dec 1995 A
5481509 Knowles Jan 1996 A
5487167 Dinallo et al. Jan 1996 A
5489103 Okamoto Feb 1996 A
5495610 Shing Feb 1996 A
5496178 Back Mar 1996 A
5499921 Sone Mar 1996 A
5511000 Kaloi Apr 1996 A
5513117 Small Apr 1996 A
5515173 Mankovitz et al. May 1996 A
5519435 Anderson May 1996 A
5519457 Nishigaki et al. May 1996 A
5521631 Budow et al. May 1996 A
5521918 Kim May 1996 A
5521922 Fujinami et al. May 1996 A
5523781 Brusaw Jun 1996 A
5528732 Klotz Jun 1996 A
5532734 Goertz Jul 1996 A
5546039 Hewitt et al. Aug 1996 A
5548729 Akiyoshi Aug 1996 A
5550577 Verbiest Aug 1996 A
5550982 Long et al. Aug 1996 A
5554968 Lee Sep 1996 A
5555244 Gupta Sep 1996 A
5557541 Schulhof Sep 1996 A
5557724 Sampat et al. Sep 1996 A
5559505 McNair Sep 1996 A
5559549 Hendricks Sep 1996 A
5561709 Remillard Oct 1996 A
5565908 Ahmad Oct 1996 A
5566237 Dobbs Oct 1996 A
5570363 Holm Oct 1996 A
5578999 Matsuzawa et al. Nov 1996 A
5579404 Fielder et al. Nov 1996 A
5583561 Baker et al. Dec 1996 A
5583937 Ullrich et al. Dec 1996 A
5583994 Rangan Dec 1996 A
5583995 Gardner et al. Dec 1996 A
5592482 Abraham Jan 1997 A
5592551 Lett Jan 1997 A
5592611 Midgely et al. Jan 1997 A
5594509 Florin Jan 1997 A
5596702 Stucka et al. Jan 1997 A
5612581 Kageyama Mar 1997 A
5613909 Stelovsky Mar 1997 A
5616876 Cluts Apr 1997 A
5617565 Augenbraun et al. Apr 1997 A
5619247 Russo Apr 1997 A
5619249 Billock et al. Apr 1997 A
5619250 McClellan et al. Apr 1997 A
5619698 Lillich Apr 1997 A
5623666 Pike Apr 1997 A
5631693 Wunderlich et al. May 1997 A
5636276 Brugger Jun 1997 A
5638426 Lewis Jun 1997 A
5642337 Oskay Jun 1997 A
5644714 Kikinis Jul 1997 A
5644766 Coy Jul 1997 A
5654714 Takahashi et al. Aug 1997 A
5659466 Norris et al. Aug 1997 A
5661517 Budow et al. Aug 1997 A
5661802 Nilssen Aug 1997 A
5663756 Blahut et al. Sep 1997 A
5668592 Spaulding Sep 1997 A
5668778 Quazi Sep 1997 A
5668788 Allison Sep 1997 A
5675734 Hair Oct 1997 A
5680533 Yamato et al. Oct 1997 A
5684716 Freeman Nov 1997 A
5689641 Ludwig et al. Nov 1997 A
5691778 Song Nov 1997 A
5691964 Niederlein et al. Nov 1997 A
5696914 Nahaboo et al. Dec 1997 A
5697844 Von Kohorn Dec 1997 A
5703795 Mankovitz Dec 1997 A
5708811 Arendt Jan 1998 A
5712976 Falcon et al. Jan 1998 A
5713024 Halladay Jan 1998 A
5715416 Baker Feb 1998 A
5717452 Janin et al. Feb 1998 A
5721583 Harada et al. Feb 1998 A
5721815 Ottesen et al. Feb 1998 A
5721829 Dunn et al. Feb 1998 A
5724525 Beyers et al. Mar 1998 A
5726909 Krikorian Mar 1998 A
5734719 Tsevdos et al. Mar 1998 A
5734961 Castille Mar 1998 A
5739451 Winksy et al. Apr 1998 A
5743745 Reintjes Apr 1998 A
5745391 Topor Apr 1998 A
5748254 Harrison et al. May 1998 A
5748468 Notenboom et al. May 1998 A
5751336 Aggarwal et al. May 1998 A
5757936 Lee May 1998 A
5758340 Nail May 1998 A
5761655 Hoffman Jun 1998 A
5762552 Vuong Jun 1998 A
5774527 Handelman et al. Jun 1998 A
5774668 Choquier Jun 1998 A
5774672 Funahashi Jun 1998 A
5781889 Martin et al. Jul 1998 A
5786784 Gaudichon Jul 1998 A
5790172 Imanaka Aug 1998 A
5790671 Cooper Aug 1998 A
5790856 Lillich Aug 1998 A
5793364 Bolanos et al. Aug 1998 A
5793980 Glaser Aug 1998 A
5798785 Hendricks Aug 1998 A
5802283 Grady et al. Sep 1998 A
5802599 Cabrera Sep 1998 A
5805804 Laursen et al. Sep 1998 A
5808224 Kato Sep 1998 A
5809246 Goldman Sep 1998 A
5812643 Schelberg et al. Sep 1998 A
5815146 Youden et al. Sep 1998 A
5825884 Zdepski et al. Oct 1998 A
5831555 Yu et al. Nov 1998 A
5831663 Waterhouse et al. Nov 1998 A
5832024 Schotz et al. Nov 1998 A
5832287 Atalla Nov 1998 A
5835843 Haddad Nov 1998 A
5842869 McGregor et al. Dec 1998 A
5845104 Rao Dec 1998 A
5845256 Pescitelli et al. Dec 1998 A
5848398 Martin Dec 1998 A
5851149 Xidos et al. Dec 1998 A
5854887 Kindell Dec 1998 A
5857020 Peterson Jan 1999 A
5857707 Devlin Jan 1999 A
5862324 Collins Jan 1999 A
5864811 Tran et al. Jan 1999 A
5864868 Contois Jan 1999 A
5864870 Guck Jan 1999 A
5867714 Todd Feb 1999 A
5870721 Norris Feb 1999 A
5880386 Wachi et al. Mar 1999 A
5880769 Nemirofsky et al. Mar 1999 A
5884028 Kindell et al. Mar 1999 A
5884298 Smith Mar 1999 A
5887193 Takahashi et al. Mar 1999 A
5896094 Narisada et al. Apr 1999 A
5903266 Berstis et al. May 1999 A
5913040 Rakavy Jun 1999 A
5914712 Sartain et al. Jun 1999 A
5915094 Kouloheris et al. Jun 1999 A
5915238 Tjaden Jun 1999 A
5917537 Lightfoot Jun 1999 A
5917835 Barrett Jun 1999 A
5918213 Bernard et al. Jun 1999 A
5920700 Gordon et al. Jul 1999 A
5920702 Bleidt et al. Jul 1999 A
5923885 Johnson Jul 1999 A
5926531 Petite Jul 1999 A
5930765 Martin Jul 1999 A
5931908 Gerba Aug 1999 A
5933090 Christenson Aug 1999 A
5940504 Griswold Aug 1999 A
5949411 Doerr et al. Sep 1999 A
5949688 Montoya Sep 1999 A
5953429 Wakai et al. Sep 1999 A
5956716 Kenner et al. Sep 1999 A
5959869 Miller Sep 1999 A
5959945 Kleiman Sep 1999 A
5963916 Kaplan Oct 1999 A
5966495 Takahashi Oct 1999 A
5978855 Metz Nov 1999 A
5978912 Rakavy et al. Nov 1999 A
5980261 Mino et al. Nov 1999 A
5999499 Pines et al. Dec 1999 A
5999624 Hopkins Dec 1999 A
6002720 Yurt Dec 1999 A
6005599 Asai et al. Dec 1999 A
6008735 Chiloyan et al. Dec 1999 A
6009274 Fletcher et al. Dec 1999 A
6011758 Dockes et al. Jan 2000 A
6018337 Peters Jan 2000 A
6018726 Tsumura Jan 2000 A
6025868 Russo Feb 2000 A
6034925 Wehmeyer Mar 2000 A
6038591 Wolfe et al. Mar 2000 A
6040829 Croy et al. Mar 2000 A
6041354 Biliris et al. Mar 2000 A
6054987 Richardson Apr 2000 A
6055573 Gardenswartz et al. Apr 2000 A
6057874 Michaud May 2000 A
6069672 Claassen May 2000 A
6072982 Haddad Jun 2000 A
6107937 Hamada Aug 2000 A
6118450 Proehl et al. Sep 2000 A
6124804 Kitao et al. Sep 2000 A
6131088 Hill Oct 2000 A
6131121 Mattaway et al. Oct 2000 A
6134547 Huxley et al. Oct 2000 A
6138150 Nichols et al. Oct 2000 A
6148142 Anderson Nov 2000 A
6151077 Vogel et al. Nov 2000 A
6151634 Glaser Nov 2000 A
6154207 Farris et al. Nov 2000 A
6157935 Tran et al. Dec 2000 A
6161059 Tedesco et al. Dec 2000 A
6170060 Mott et al. Jan 2001 B1
6173172 Masuda et al. Jan 2001 B1
6175861 Williams, Jr. et al. Jan 2001 B1
6182126 Nathan et al. Jan 2001 B1
6185184 Mattaway et al. Feb 2001 B1
6185619 Joffe et al. Feb 2001 B1
6191780 Martin et al. Feb 2001 B1
6192340 Abecassis Feb 2001 B1
6198408 Cohen Mar 2001 B1
6202060 Tran Mar 2001 B1
6209060 Machida Mar 2001 B1
6212138 Kalis et al. Apr 2001 B1
6216227 Goldstein et al. Apr 2001 B1
6219692 Stiles Apr 2001 B1
6223209 Watson Apr 2001 B1
6240550 Nathan et al. May 2001 B1
6243725 Hempleman et al. Jun 2001 B1
6247022 Yankowski Jun 2001 B1
6256773 Bowman-Amuah Jul 2001 B1
6262569 Carr et al. Jul 2001 B1
6280327 Leifer et al. Aug 2001 B1
6288991 Kajiyama et al. Sep 2001 B1
6289382 Bowman-Amuah Sep 2001 B1
6292443 Awazu et al. Sep 2001 B1
6298373 Burns et al. Oct 2001 B1
6302793 Fertitta et al. Oct 2001 B1
6308204 Nathan et al. Oct 2001 B1
6311214 Rhoads Oct 2001 B1
6315572 Owens et al. Nov 2001 B1
6323911 Schein et al. Nov 2001 B1
6332025 Takahashi et al. Dec 2001 B2
6336219 Nathan Jan 2002 B1
6341166 Basel Jan 2002 B1
6344862 Williams et al. Feb 2002 B1
6346951 Mastronardi Feb 2002 B1
6356971 Katz et al. Mar 2002 B1
6359661 Nickum Mar 2002 B1
6370580 Kriegsman Apr 2002 B2
6381575 Martin et al. Apr 2002 B1
6384737 Hsu et al. May 2002 B1
6393584 McLaren et al. May 2002 B1
6396480 Schindler et al. May 2002 B1
6397189 Martin et al. May 2002 B1
6407987 Abraham Jun 2002 B1
6408435 Sato Jun 2002 B1
6408437 Hendricks et al. Jun 2002 B1
6421651 Tedesco et al. Jul 2002 B1
6425125 Fries et al. Jul 2002 B1
6430537 Tedesco et al. Aug 2002 B1
6430738 Gross et al. Aug 2002 B1
6434678 Menzel Aug 2002 B1
6438450 DiLorenzo Aug 2002 B1
6442549 Schneider Aug 2002 B1
6446130 Grapes Sep 2002 B1
6449688 Peters et al. Sep 2002 B1
6470496 Kato et al. Oct 2002 B1
6488508 Okamoto Dec 2002 B2
6490570 Numaoka Dec 2002 B1
6496927 McGrane et al. Dec 2002 B1
6498855 Kokkosoulis et al. Dec 2002 B1
6522707 Brandstetter et al. Feb 2003 B1
6535911 Miller et al. Mar 2003 B1
6538558 Sakazume et al. Mar 2003 B2
6543052 Ogasawara Apr 2003 B1
6544122 Araki et al. Apr 2003 B2
6549719 Mankovitz Apr 2003 B2
6570507 Lee et al. May 2003 B1
6571282 Bowman-Amuah May 2003 B1
6577735 Bharat Jun 2003 B1
6578051 Mastronardi et al. Jun 2003 B1
6587403 Keller et al. Jul 2003 B1
6590838 Gerlings et al. Jul 2003 B1
6598230 Ballhorn Jul 2003 B1
6622307 Ho Sep 2003 B1
6628939 Paulsen Sep 2003 B2
6629318 Radha et al. Sep 2003 B1
6643620 Contolini et al. Nov 2003 B1
6643690 Duursma et al. Nov 2003 B2
6654801 Mann et al. Nov 2003 B2
6658090 Harjunen et al. Dec 2003 B1
6662231 Drosset et al. Dec 2003 B1
6702585 Okamoto Mar 2004 B2
6728956 Ono Apr 2004 B2
6728966 Arsenault et al. Apr 2004 B1
6744882 Gupta et al. Jun 2004 B1
6751794 McCaleb et al. Jun 2004 B1
6755744 Nathan et al. Jun 2004 B1
6789215 Rupp et al. Sep 2004 B1
6816578 Kredo et al. Nov 2004 B1
6898161 Nathan May 2005 B1
6904592 Johnson Jun 2005 B1
6928653 Ellis et al. Aug 2005 B1
6942574 LeMay et al. Sep 2005 B1
6974076 Siegel Dec 2005 B1
7024485 Dunning et al. Apr 2006 B2
7107109 Nathan et al. Sep 2006 B1
7124194 Nathan et al. Oct 2006 B2
7188352 Nathan et al. Mar 2007 B2
7195157 Swartz et al. Mar 2007 B2
7198571 LeMay et al. Apr 2007 B2
7206417 Nathan Apr 2007 B2
7210141 Nathan et al. Apr 2007 B1
7231656 Nathan Jun 2007 B1
7237198 Chaney Jun 2007 B1
7293277 Nathan Nov 2007 B1
7356831 Nathan Apr 2008 B2
7406529 Reed Jul 2008 B2
7424731 Nathan et al. Sep 2008 B1
7448057 Nathan Nov 2008 B1
7483958 Elabbady et al. Jan 2009 B1
7500192 Mastronardi Mar 2009 B2
7512632 Mastronardi et al. Mar 2009 B2
7519442 Nathan et al. Apr 2009 B2
7549919 Nathan et al. Jun 2009 B1
7574727 Nathan et al. Aug 2009 B2
7647613 Drakoulis et al. Jan 2010 B2
7749083 Nathan et al. Jul 2010 B2
7757264 Nathan Jul 2010 B2
7783774 Nathan et al. Aug 2010 B2
7793331 Nathan et al. Sep 2010 B2
20010016815 Takahashi et al. Aug 2001 A1
20010023403 Martin et al. Sep 2001 A1
20010030660 Zainoulline Oct 2001 A1
20010037367 Iyer Nov 2001 A1
20010044725 Matsuda et al. Nov 2001 A1
20020002079 Martin et al. Jan 2002 A1
20020002483 Siegel et al. Jan 2002 A1
20020113824 Myers Aug 2002 A1
20020116476 Eyal et al. Aug 2002 A1
20020118949 Jones et al. Aug 2002 A1
20020120925 Logan Aug 2002 A1
20020129036 Ho Yuen Lok et al. Sep 2002 A1
20020162104 Raike et al. Oct 2002 A1
20030005099 Sven et al. Jan 2003 A1
20030008703 Gauselmann Jan 2003 A1
20030018740 Sonoda et al. Jan 2003 A1
20030031096 Nathan et al. Feb 2003 A1
20030041093 Yamane et al. Feb 2003 A1
20030065639 Fiennes et al. Apr 2003 A1
20030088538 Ballard May 2003 A1
20030093790 Logan et al. May 2003 A1
20030101450 Davidsson et al. May 2003 A1
20030104865 Itkis et al. Jun 2003 A1
20030108164 Laurin et al. Jun 2003 A1
20030135424 Davis et al. Jul 2003 A1
20030208586 Mastronardi et al. Nov 2003 A1
20030225834 Lee et al. Dec 2003 A1
20040025185 Goci et al. Feb 2004 A1
20040085334 Reaney May 2004 A1
20040103150 Ogdon et al. May 2004 A1
20040204220 Fried et al. Oct 2004 A1
20040205171 Nathan et al. Oct 2004 A1
20040220926 Lamkin et al. Nov 2004 A1
20050060405 Nathan et al. Mar 2005 A1
20050073782 Nathan Apr 2005 A1
20050086172 Stefik Apr 2005 A1
20050125833 Nathan et al. Jun 2005 A1
20050267819 Kaplan Dec 2005 A1
20060018208 Nathan et al. Jan 2006 A1
20060035707 Nguyen et al. Feb 2006 A1
20060062094 Nathan et al. Mar 2006 A1
20060239131 Nathan et al. Oct 2006 A1
20060293773 Nathan et al. Dec 2006 A1
20070121430 Nathan May 2007 A1
20070142022 Madonna et al. Jun 2007 A1
20070160224 Nathan Jul 2007 A1
20070204263 Nathan et al. Aug 2007 A1
20070209053 Nathan Sep 2007 A1
20070247979 Brillon et al. Oct 2007 A1
20080069545 Nathan et al. Mar 2008 A1
20080077962 Nathan Mar 2008 A1
20080086379 Dion et al. Apr 2008 A1
20080096659 Kreloff et al. Apr 2008 A1
20080137849 Nathan Jun 2008 A1
20080168807 Dion et al. Jul 2008 A1
20080171594 Fedesna et al. Jul 2008 A1
20080195443 Nathan et al. Aug 2008 A1
20080239887 Tooker et al. Oct 2008 A1
20090037969 Nathan Feb 2009 A1
20090070341 Mastronardi et al. Mar 2009 A1
20090138111 Mastronardi May 2009 A1
20090265734 Dion et al. Oct 2009 A1
20090282491 Nathan Nov 2009 A1
20100042505 Straus Feb 2010 A1
20100211818 Nathan et al. Aug 2010 A1
20100241259 Nathan Sep 2010 A1
20100269066 Nathan Oct 2010 A1
Foreign Referenced Citations (88)
Number Date Country
199954012 Apr 2000 AU
3406058 Aug 1985 DE
3723737 Jan 1988 DE
3820835 Jan 1989 DE
3815071 Nov 1989 DE
4 244 198 Jun 1994 DE
19610739 Sep 1997 DE
19904007 Aug 2000 DE
A0082077 Jun 1983 EP
0140593 May 1985 EP
0256921 Feb 1988 EP
0283304 Sep 1988 EP
A0283350 Sep 1988 EP
0 309 298 Mar 1989 EP
A0313359 Apr 1989 EP
0340787 Nov 1989 EP
0363186 Apr 1990 EP
0 425 168 May 1991 EP
0464562 Jan 1992 EP
0480558 Apr 1992 EP
0498130 Aug 1992 EP
0498130 Aug 1992 EP
0 507 110 Oct 1992 EP
0529834 Mar 1993 EP
0538319 Apr 1993 EP
A0631283 Dec 1994 EP
0632371 Jan 1995 EP
0711076 May 1996 EP
0786122 Jul 1997 EP
0817103 Jan 1998 EP
0841616 May 1998 EP
0919964 Jun 1999 EP
0959570 Nov 1999 EP
0 974896 Jan 2000 EP
0974941 Jan 2000 EP
0982695 Mar 2000 EP
1001391 May 2000 EP
1408427 Apr 2004 EP
A2602352 Feb 1988 FR
2808906 Nov 2001 FR
A 2122799 Jan 1984 GB
2166328 Apr 1986 GB
2170943 Aug 1986 GB
2193420 Feb 1988 GB
A 2193420 Feb 1988 GB
A3820835 Jan 1989 GB
2 238680 Jun 1991 GB
2254469 Oct 1992 GB
2259398 Mar 1993 GB
A2259398 Mar 1993 GB
2262170 Jun 1993 GB
2380377 Apr 2003 GB
57-173207 Oct 1982 JP
58-179892 Oct 1983 JP
60-253082 Dec 1985 JP
61084143 Apr 1986 JP
62-192849 Aug 1987 JP
62-284496 Dec 1987 JP
63-60634 Mar 1988 JP
2-153665 Jun 1990 JP
5122282 May 1993 JP
5-74078 Oct 1993 JP
07281682 Oct 1995 JP
08-279235 Oct 1996 JP
8274812 Oct 1996 JP
10-098344 Apr 1998 JP
WO 86 01326 Feb 1986 WO
A9007843 Jul 1990 WO
WO 9108542 Jun 1991 WO
A 9120082 Dec 1991 WO
WO 9316557 Aug 1993 WO
A 9318465 Sep 1993 WO
A94 03894 Feb 1994 WO
WO 9414273 Jun 1994 WO
WO 9415306 Jul 1994 WO
WO 94 15416 Jul 1994 WO
WO 95 03609 Feb 1995 WO
WO 9529537 Nov 1995 WO
WO 9612255 Apr 1996 WO
WO 9612256 Apr 1996 WO
WO 9612257 Apr 1996 WO
WO 96 12258 Apr 1996 WO
WO 9807940 Feb 1998 WO
WO 9845835 Oct 1998 WO
WO 0100290 Jan 2001 WO
WO 0108148 Feb 2001 WO
WO 02095752 Nov 2002 WO
WO 2006014739 Feb 2006 WO
Non-Patent Literature Citations (30)
Entry
“Ecast Forges Landmark International Technology Partnership”, Business Wire at www.findarticles.com/cf—0/m0EIN/2000—July—25/63663604/print.jhtml, 2 pages, Jul. 25, 2000.
“Ecast Selects Viant to Build Siren Entertainment System (TM)”, ScreamingMedia, PR Newswire San Francisco, industry.java.sum.com/javanews/stories/story2/0,1072,17618,00.html, 3 pages, Aug. 3, 1999.
Derfler et al., “How Networks Work”, Millennium Ed., Que Corporation, Jan. 2000.
European Search Report from EP 1 993 079.
European Search Report issued for European Application No. 08000845.1-1238/1962251, dated Apr. 3, 2009.
Gralla, “How the Internet Works”, Millennium Ed., Que Corporation, Aug. 1999.
Hicks et al., “Dynamic software updating”, ACM PLDI, pp. 13-23, 2001.
iTOUCH 27 New Games brochure, JVL Corporation, 2005, 2 pages.
iTouch 8 Plus brochure, JVL Corporation, 2005, 2 pages.
Kozierok, The PC Guide, Site Version 2.2.0, http://www.pcguide.com, Apr. 17, 2001.
Liang et al., “Dynamic class loading in the Java virtual machine”, ACM OOPSLA, pp. 36-44, 1998.
Look and iTouch brochure, JVL Corporation, 2004, 2 pages.
Megatouch Champ brochure, Merit Industries, Inc., 2005, 2 pages.
Melnik et al., “A mediation infrastructure for digital library services”, ACM DL, pp. 123-132, 2000.
Mod Box Internet brochure, Merit Entertainment, 2006, 2 pages.
Newsome et al., “Proxy compilation of dynamically loaded java classes with MoJo”, ACM LCTES, pp. 204-212, 2002.
Patent Abstract of Japan vol. 95, No. 010 & JP 07 281682 A (Naguo Yuasa), Oct. 27 1 JP 07 281682, figure 1-6 abrége.
Schneier, “Applied Cryptography”, Second Edition, John Wiley & Sons, Inc. New York, 1996.
Vortex Brochure, JVL Corporation, 2005, 2 pages.
Waingrow, “Unix Hints & Hacks”, Que Corporation, Indianapolis, IN, 1999.
White, “How Computers Work”, Millennium Ed., Que Corporation, Indianapolis, IN, Sep. 1999 (Sep. 22, 1999).
“High-speed Opens and Shorts Substrate Tester”, IBM Technical Disclosure Bulletin, vol. 33, No. 12, May 1991, pp. 251-259.
“Darts Revolution Again”, Replay Magazine, Mar. 1991, pp. 146-148.
Bonczck, Robert H. et al, “The DSS Development System”, 1983 National Computer Conference, Anaheim, California, May 16-19, 1983, pp. 441-455.
IBM Technical Disclosure Bulletin, vol. 30, No. 5, Oct. 1987, “Method for Automated Assembly of Software Versions”, pp. 353-355.
“Robotic Wafer Handling System for Class 10 Environments” IBM Technical Disclosure Bulletin, vol. 32, No. 9A, Feb. 1990, pp. 141-143.
Galen A. Grimes, “Chapter 18, Taking Advantage or Web-based Audio.”.
Petri Koskelainem “Report on Streamworks ™”.
W. Richard Stevens, “TCP/IP Illustrated: vol. 1, the Protocols”.
Nowell Outlaw “Virtual Servers Offer Performance benefits for Networks Imaging”.
Related Publications (1)
Number Date Country
20110208335 A1 Aug 2011 US
Continuations (4)
Number Date Country
Parent 12662639 Apr 2010 US
Child 13100715 US
Parent 11493574 Jul 2006 US
Child 12662639 US
Parent 10195476 Jul 2002 US
Child 11493574 US
Parent 08817426 US
Child 10195476 US