IPC분류정보
국가/구분 |
United States(US) Patent
등록
|
국제특허분류(IPC7판) |
|
출원번호 |
US-0019704
(2002-05-03)
|
우선권정보 |
GB-19990015265 (1999-07-01) |
국제출원번호 |
PCT/GB00/02314
(2000-06-27)
|
국제공개번호 |
WO01/02268
(2001-01-11)
|
발명자
/ 주소 |
- Rickson, Colin David
- Pring, John Bernard
|
출원인 / 주소 |
|
대리인 / 주소 |
Fay, Sharpe, Fagan, Minnich & McKee, LLP
|
인용정보 |
피인용 횟수 :
8 인용 특허 :
12 |
초록
▼
A thermally insulated container includes a payload volume (36) that, in use, is to be maintained within a predetermined temperature range, at least one heat reservoir (44, 54), and a control device (48, 58) for controlling the flow of heat between the payload volume (36) and the heat reservoir (44,
A thermally insulated container includes a payload volume (36) that, in use, is to be maintained within a predetermined temperature range, at least one heat reservoir (44, 54), and a control device (48, 58) for controlling the flow of heat between the payload volume (36) and the heat reservoir (44, 54) so as to maintain the temperature in the payload volume (36) within the predetermined range.
대표청구항
▼
A thermally insulated container includes a payload volume (36) that, in use, is to be maintained within a predetermined temperature range, at least one heat reservoir (44, 54), and a control device (48, 58) for controlling the flow of heat between the payload volume (36) and the heat reservoir (44,
A thermally insulated container includes a payload volume (36) that, in use, is to be maintained within a predetermined temperature range, at least one heat reservoir (44, 54), and a control device (48, 58) for controlling the flow of heat between the payload volume (36) and the heat reservoir (44, 54) so as to maintain the temperature in the payload volume (36) within the predetermined range. audio data, video data and other data, said continuous media steams of varying bandwidth requirement and duration comprising the steps of generating said composite multimedia objects from said continuous media streams, determining a run-length compressed form for each of said composite multimedia objects, scheduling at least two of said composite multimedia objects, wherein said at least two of said composite multimedia objects require a bandwidth in excess of a maximum allowable bandwidth constraint, determining a set of feasible starting points for each of said at least two of said composite multimedia objects, and determining the earliest starting point for each of said at least two of said composite multimedia objects such that said maximum allowable bandwidth constraint is not exceeded. 2. A method of scheduling the provision of composite multimedia objects as recited in claim 1 wherein said step of determining a run-length compressed form of said composite multimedia objects comprises the substeps of partitioning said composite multimedia objects into blocks of constant bandwidth requirement, and representing each said block by a pair representing 1) the constant bandwidth requirement over 2) a duration in time. 3. A method of scheduling the provision of composite multimedia objects as recited in claim 2 further comprising the step of scheduling two of said composite multimedia objects. 4. A method of scheduling the provision of composite multimedia objects as recited in claim 2 further comprising the step of scheduling a plurality of non-disjoint composite multimedia objects whereby said continuous media streams deliver one or more common components of said plurality of non-disjoint composite multimedia objects so that said common components can be shared by all said plurality of non-disjoint composite multimedia objects. 5. A method of scheduling the provision of composite multimedia objects as recited in claim 3 wherein said scheduling step comprises the step of using an algorithm to determine the earliest starting point for each of said two composite multimedia objects such that said maximum allowable bandwidth constraint is not exceeded. 6. A method of scheduling the provision of composite multimedia objects as recited in claim 3 wherein said scheduling step further comprises the steps of combining said two composite multimedia objects to form a partial original schedule, and if said partial original schedule is longer than the longest of said two composite multimedia objects, then (a) removing a specified number of said composite multimedia objects from said partial original schedule to create a remainder schedule, (b) combining said specified number of said composite multimedia objects to maximize the density of a resulting sequence, (c) combining said resulting sequence with said remainder schedule to form a revised schedule, (d) comparing the length of said revised schedule to the length of said partial original schedule, and (e) keeping the schedule with the shortest length as a new partial original schedule. 7. A method of scheduling the provision of composite multimedia objects as recited in claim 5 wherein said algorithm is FINDMIN. 8. A method of scheduling the provision of composite multimedia objects as recited in claim 5 wherein said algorithm is BITONIC-FINDMIN. 9. A method of scheduling the provision of composite multimedia objects as recited in claim 5 wherein said scheduling step further comprises the steps of combining said two composite multimedia objects to form a partial original schedule, and if said partial original schedule is longer than the longest of said two composite multimedia objects, then (a) removing a specified number of said composite multimedia objects from said partial original schedule to create a remainder schedule, (b) combining said specified number of said composite multimedia objects to maximize the density of a resulting se
※ AI-Helper는 부적절한 답변을 할 수 있습니다.