← Back to Patent Explorer
US6049332A Expired / Lapsed US ⏱️ 0.0 years remaining

Method and apparatus for the scheduling and ordering of elements in a multimedia environment

Assignee: Sony Corp
•
Filing: 1996-10-07
•
Granted: 2000-04-11
•
Expires: 2016-10-07
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract The system and method creates a broadcast tree comprising a hierarchy of broadcast constituents, each constituent represented as a node in the tree. The tree includes at least two nodes representing at least two of the following constituents arranged in accordance with the following hierarchical order; channel, schedule, program, pod and element, wherein the channel is the highest order constituent and the element is the lowest order constituent and wherein each higher order constituent can be composed of one or more constituents of the same or lower order. Associations are provided between constituents to be used to identify the sequence the constituents are played in order to generate a broadcast. These associations identify the paths to be taken from a higher order node to a lower order node. Thus, to generate a broadcast, the tree is traversed beginning at the highest order constituent, and for each higher order constituent, the associations among lower order constituents of the same order are evaluated to determine the sequence the lower order constituents are to be played.

Inventors

  • 👤 Gerard J. Boetje
  • 👤 David C. Collier

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-05 12:29
CPC Classifications
G; G11; G11B; G11B27/00; G11B27/10; G11B27/102; G11B27/105

Claims Analysis

Total Claims: 48
Claim 1
Independent Claim 107 words
A method for scheduling broadcasts comprising broadcast constituents, at least one of the broadcast constituents comprising at least one common broadcast pattern of broadcast elements comprising the steps of: constructing a broadcast pattern comprising at least one variable element; specifying a first instance of the broadcast pattern in a first broadcast constituent; specifying an association between an instance of the broadcast pattern and a first element in the context of the first broadcast constituent; such that when the first broadcast constituent is played, a first instance of the broadcast pattern that is played includes the first element as the context is that of the first broadcast constituent.
Claim 2
Independent Claim 107 words
A method for scheduling broadcasts comprising broadcast constituents, at least one of the broadcast constituents comprising at least one common broadcast pattern of broadcast elements comprising the steps of: constructing a broadcast pattern comprising at least one variable element; specifying a first instance of the broadcast pattern in a first broadcast constituent; specifying an association between an instance of the broadcast pattern and a first element in the context of the first broadcast constituent; such that when the first broadcast constituent is played, a first instance of the broadcast pattern that is played includes the first element as the context is that of the first broadcast constituent.
Claim 3
Dependent Claim 139 words
The method as set forth in claim 1, wherein the broadcast pattern comprises at least one element and the at least one variable element organized in a sequence, said method further comprising the step of playing a broadcast comprising the first constituent comprising the steps of: storing the association between the first instance of the broadcast pattern and the first element in a queue; playing in sequence the at least one element and at least one variable element; when the variable element is to be played, searching a stack for an association to the variable element that is in the context of the first broadcast constituent; and if an association to the variable element that is in the context of the first broadcast constituent is found, binding the first element to the variable element and playing the first element.
Claim 4
Independent Claim 185 words
A method for generating a schedule for at least one channel of broadcast comprising the steps of: generating a broadcast tree comprising a hierarchy of broadcast constituents, each constituent represented as a node in the tree, the tree comprising at least two nodes representing at least two of the following constituents arranged in accordance with the following hierarchical order; channel, schedule, program, pod and element, wherein the channel is the highest order constituent and the element is the lowest order constituent and wherein each higher order constituent can be composed of one or more constituents of the same or lower order; providing associations between constituents to be used to identify the sequence the constituents are played in order to generate a broadcast, said associations identifying the paths to be taken from a higher order node to a lower order node; wherein to generate a broadcast, the tree is traversed beginning at the highest order constituent, and for each higher order constituent, the associations among lower order constituents of the same order are evaluated to determine the sequence the lower order constituents are to be played.
Claim 5
Independent Claim 185 words
A method for generating a schedule for at least one channel of broadcast comprising the steps of: generating a broadcast tree comprising a hierarchy of broadcast constituents, each constituent represented as a node in the tree, the tree comprising at least two nodes representing at least two of the following constituents arranged in accordance with the following hierarchical order; channel, schedule, program, pod and element, wherein the channel is the highest order constituent and the element is the lowest order constituent and wherein each higher order constituent can be composed of one or more constituents of the same or lower order; providing associations between constituents to be used to identify the sequence the constituents are played in order to generate a broadcast, said associations identifying the paths to be taken from a higher order node to a lower order node; wherein to generate a broadcast, the tree is traversed beginning at the highest order constituent, and for each higher order constituent, the associations among lower order constituents of the same order are evaluated to determine the sequence the lower order constituents are to be played.
Claim 6
Dependent Claim 17 words
The method of claim 1, wherein the at least one variable element substitutes for a broadcast constituent.
Claim 7
Dependent Claim 53 words
The method of claim 1, further comprising the steps of: using the broadcast pattern repetitively in the at least one of the broadcast constituents; using the first broadcast constituent repetitively in a broadcast; using the first element repetitively in the first broadcast pattern; and using the first element in a second broadcast pattern.
Claim 8
Dependent Claim 31 words
The method of claim 2, wherein binding is established by specifying an interval relationship between a variable interval and a real event interval that is bound at the time of broadcast.
Claim 9
Dependent Claim 21 words
The method of claim 1, wherein the first broadcast constituent is composed of at least one of a plurality of constituents.
Claim 10
Dependent Claim 34 words
The method of claim 1, further comprising the step of controlling the relative ordering of constituents and elements with the specified association, wherein the association includes interval relations, the association being independent of time.
Claim 11
Dependent Claim 15 words
The method of claim 8, wherein the association defines a temporal relationship between scheduling elements.
Claim 12
Dependent Claim 23 words
The method of claim 1, further comprising the step of representing the first broadcast constituent by at least one a plurality of constituents.
Claim 13
Dependent Claim 23 words
The method of claim 1, further comprising the step of relating the first broadcast constituent to a second broadcast constituent through proxy relations.
Claim 14
Independent Claim 41 words
The method of claim. 11, wherein the proxy relation contains a set of possible alternative representations of the first constituent and a set of selection rules which determine which representation is appropriate, the proxy relation being owned by the first constituent.
Claim 15
Dependent Claim 64 words
The method of claim 1, further comprising the step of specifying different compositions for a broadcast constituent using proxy relations, the proxy relations containing at least one possible alternative composition for a broadcast constituent and a set of selection rules, said set of selection rules resulting in the selection of at least one composition for broadcast from the at least one possible alternative compositions.
Claim 16
Dependent Claim 23 words
The method of claim 13, wherein the at least one possible alternative composition is a plurality of different versions of a broadcast event.
Claim 17
Dependent Claim 18 words
The method of claim 13, wherein the proxy relation contains a plurality of alternative compositions executing in parallel.
Claim 18
Dependent Claim 50 words
The method of claim 1, further comprising the step of relating the first constituent to a second constituent through mapped relations, the mapped relations including a composition relation that defines the set of subcomponents of a constituent, wherein the composition relation provides a time base of elements and track mappings.
Claim 19
Dependent Claim 26 words
The method of claim 16, wherein the mapped relation includes a representation relation that defines how the first constituent may be manifested by a second constituent.
Claim 20
Dependent Claim 54 words
The method of claim 3, further comprising the step of tracking a context of the constituents using a traversing algorithm which implements a finite state machine combined with a stack, wherein when each node in the tree is reached, the constituent is pushed on the stack so that the stacks indicate the path traversed.
Claim 21
Dependent Claim 40 words
The method of claim 3, further comprising the steps of: representing the schedule constituents with a material that represents specific action that should occur during a broadcast; representing the material with media that represents the physical manifestation of the material.
Claim 22
Dependent Claim 72 words
A broadcast system comprising: a processor; a plurality of media devices coupled to the processor; a broadcast pattern comprising at least one variable broadcast element; a first broadcast constituent comprising a first instance of the broadcast pattern, the first instance of the broadcast pattern including a first broadcast element; an association between the first instance of the broadcast pattern and the first broadcast element in the context of the first broadcast constituent.
Claim 23
Dependent Claim 72 words
A broadcast system comprising: a processor; a plurality of media devices coupled to the processor; a broadcast pattern comprising at least one variable broadcast element; a first broadcast constituent comprising a first instance of the broadcast pattern, the first instance of the broadcast pattern including a first broadcast element; an association between the first instance of the broadcast pattern and the first broadcast element in the context of the first broadcast constituent.
Claim 24
Dependent Claim 100 words
The broadcast system of claim 20, wherein the broadcast pattern comprises: at least one broadcast element; an association between the first instance of the broadcast pattern and the first broadcast element; a sequence comprising the at least one broadcast element and the at least one variable element; a queue which stores said association, said processor searching said queue for an association to the at least one variable element that is in the context of the first broadcast constituent; and a binding of the first broadcast element to the at least one variable element for play of the first broadcast element.
Claim 25
Dependent Claim 55 words
The broadcast system of claim 20, wherein: the first broadcast element is used repetitively in the first broadcast pattern; the broadcast pattern is used repetitively in the at least one of the broadcast constituents; the first broadcast constituent is used repetitively in a broadcast; the first broadcast element is used in a second broadcast pattern.
Claim 26
Dependent Claim 22 words
The broadcast system of claim 20, wherein the first broadcast constituent is composed of at least one of a plurality of constituents.
Claim 27
Dependent Claim 31 words
The broadcast system of claim 20, wherein the association is used to control the relative ordering of constituents and elements, said association comprising interval relations, the association being independent of time.
Claim 28
Dependent Claim 16 words
The broadcast system of claim 24, wherein the association defines a temporal relationship between scheduling elements.
Claim 29
Dependent Claim 21 words
The broadcast system of claim 20, further comprising a first broadcast constituent represented by at least one a plurality of constituents.
Claim 30
Dependent Claim 21 words
The broadcast system of claim 20, further comprising proxy relations that relate the first broadcast constituent to a second broadcast constituent.
Claim 31
Dependent Claim 42 words
The broadcast system of claim 27, wherein the proxy relations contain a set of possible alternative representations of the first constituent and a set of selection rules which determine which representation is appropriate, the proxy relation being owned by the first constituent.
Claim 32
Dependent Claim 61 words
The broadcast system of claim 20, wherein the proxy relations specify different compositions for a broadcast constituent, the proxy relations containing at least one possible alternative composition for a broadcast constituent and a set of selection rules, said set of selection rules resulting in the selection of at least one composition for broadcast from the at least one possible alternative compositions.
Claim 33
Dependent Claim 37 words
The broadcast system of claim 20, further comprising mapped relations that relate the first broadcast constituent to a second broadcast constituent, the mapped relations including a composition relation that defines the set of subcomponents of a constituent.
Claim 34
Dependent Claim 27 words
The broadcast system of claim 30, wherein the mapped relation includes a representation relation that defines how the first constituent may be manifested by a second constituent.
Claim 35
Dependent Claim 191 words
A broadcast system comprising a processor coupled to a memory and a plurality of media devices, said processor configured to control the broadcast system to: generate a broadcast tree comprising a hierarchy of broadcast constituents, each constituent represented as a node in the tree, the tree comprising at least two nodes representing at least two of the following constituents arranged in accordance with the following hierarchical order; channel, schedule, program, pod and element, wherein the channel is the highest order constituent and the element is the lowest order constituent and wherein each higher order constituent can be composed of one or more constituents of the same or lower order; provide associations between constituents to be used to identify the sequence the constituents are played in order to generate a broadcast, said associations identifying the paths to be taken from a higher order node to a lower order node; generate a broadcast by traversing the tree beginning at the highest order constituent, and for each higher order constituent, the associations among lower order constituents of the same order are evaluated to determine the sequence the lower order constituents are to be played.
Claim 36
Dependent Claim 191 words
A broadcast system comprising a processor coupled to a memory and a plurality of media devices, said processor configured to control the broadcast system to: generate a broadcast tree comprising a hierarchy of broadcast constituents, each constituent represented as a node in the tree, the tree comprising at least two nodes representing at least two of the following constituents arranged in accordance with the following hierarchical order; channel, schedule, program, pod and element, wherein the channel is the highest order constituent and the element is the lowest order constituent and wherein each higher order constituent can be composed of one or more constituents of the same or lower order; provide associations between constituents to be used to identify the sequence the constituents are played in order to generate a broadcast, said associations identifying the paths to be taken from a higher order node to a lower order node; generate a broadcast by traversing the tree beginning at the highest order constituent, and for each higher order constituent, the associations among lower order constituents of the same order are evaluated to determine the sequence the lower order constituents are to be played.
Claim 37
Dependent Claim 62 words
The broadcast system of claim 32, wherein the processor is further configured to control the broadcast system to track a context of the constituents using a traversing algorithm which implements a finite state machine combined with a stack, wherein when each node in the tree is reached, the constituent is pushed on the stack so that the stacks indicate the path traversed.
Claim 38
Dependent Claim 109 words
A computer readable medium containing executable instructions which, when executed in a processing system, causes the system to perform the steps for scheduling broadcasts comprising broadcast constituents comprising the steps of: constructing a broadcast pattern comprising at least one variable element; specifying a first instance of the broadcast pattern in a first broadcast constituent; specifying an association between an instance of the broadcast pattern and a first element in the context of the first broadcast constituent; such that when the first broadcast constituent is played, a first instance of the broadcast pattern that is played includes the first element as the context is that of the first broadcast constituent.
Claim 39
Dependent Claim 109 words
A computer readable medium containing executable instructions which, when executed in a processing system, causes the system to perform the steps for scheduling broadcasts comprising broadcast constituents comprising the steps of: constructing a broadcast pattern comprising at least one variable element; specifying a first instance of the broadcast pattern in a first broadcast constituent; specifying an association between an instance of the broadcast pattern and a first element in the context of the first broadcast constituent; such that when the first broadcast constituent is played, a first instance of the broadcast pattern that is played includes the first element as the context is that of the first broadcast constituent.
Claim 40
Dependent Claim 141 words
The computer readable medium of claim 34, wherein the broadcast pattern comprises at least one broadcast element and the at least one variable element organized in a sequence, said computer system further configured to play a broadcast comprising the first constituent comprising the steps of: storing the association between the first instance of the broadcast pattern and the first broadcast element in a queue; playing in sequence the at least one broadcast element and at least one variable element; when the variable element is to be played, searching the stack for an association to the variable element that is in the context of the first broadcast constituent; and if an association to the variable element that is in the context of the first broadcast constituent is found, binding the first broadcast element to the variable element and playing the first element.
Claim 41
Dependent Claim 62 words
The computer readable medium of claim 34, wherein the instructions cause the system to further perform the steps of: using the broadcast pattern repetitively in the at least one of the broadcast constituents; using the first broadcast constituent repetitively in a broadcast; using the first element repetitively in the first broadcast pattern; and using the first element in a second broadcast pattern.
Claim 42
Dependent Claim 43 words
The computer readable medium of claim 34, wherein the instructions cause the system to further perform the step of controlling the relative ordering of constituents and elements with the specified association, wherein the association includes interval relations, the association being independent of time.
Claim 43
Dependent Claim 37 words
The computer readable medium of claim 34, wherein the instructions cause the system to further perform the step of further comprising the step of representing the first broadcast constituent by at least one a plurality of constituents.
Claim 44
Dependent Claim 32 words
The computer readable medium of claim 34, wherein the instructions cause the system to further perform the step of relating the first broadcast constituent to a second broadcast constituent through proxy relations.
Claim 45
Dependent Claim 43 words
The computer readable medium of claim 39, wherein the proxy relations contain a set of possible alternative representations of the first constituent and a set of selection rules which determine which representation is appropriate, the proxy relation being owned by the first constituent.
Claim 46
Dependent Claim 73 words
The computer readable medium of claim 34, wherein the instructions cause the system to further perform the step of specifying different compositions for a broadcast constituent using proxy relations, the proxy relations containing at least one possible alternative composition for a broadcast constituent and a set of selection rules, said set of selection rules resulting in the selection of at least one composition for broadcast from the at least one possible alternative compositions.
Claim 47
Dependent Claim 59 words
The computer readable medium of claim 34, wherein the instructions cause the system to further perform the step of relating the first constituent to a second constituent through mapped relations, the mapped relations including a composition relation that defines the set of subcomponents of a constituent, wherein the composition relation provides a time base of elements and track mappings.
Claim 48
Dependent Claim 28 words
The computer readable medium of claim 42, wherein the mapped relation includes a representation relation that defines how the first constituent may be manifested by a second constituent.

References Cited (Backward Citations)

US5404505A Cited
US5758257A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2003-04-11 2003-10-11 2004-04-11 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2007-04-11 2007-10-11 2008-04-11 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2011-04-11 2011-10-11 2012-04-11 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag