1461097916-e8345448-1ed5-418d-ac3a-ec86711449e6

1. An apparatus for stabilizing the filling or refilling of a flexible, collapsible container having a spout for dispensing the contents thereof, the apparatus comprising: a clamping device for removably clamping said apparatus to a surface other than the flexible, collapsible container;
a center frame element having a first end and a second end;
an upper frame element attached to the first end of the center frame element and adapted to receive at least a portion of the spout; and
a lower frame element attached to the second end of the center frame element, the lower frame element having a first segment extending from the center frame element and a lip extending from the first segment upwardly and away relative to the second end of the center frame element and wherein the lip and the upper frame element are not substantially parallel.
2. The apparatus of claim 1, wherein the lower frame element is adapted to cradle at least a portion of the container.
3. The apparatus of claim 1, wherein the clamping device comprises a clamp attached to at least one of the upper frame element, the lower frame element and the center frame element.
4. The apparatus of claim 1 wherein the upper frame element is integral with the center frame element.
5. The apparatus of claim 1, wherein the lower frame element is integral with said center frame element.
6. The apparatus of claim 1, further comprising a support leg attached to at least one of the upper frame element, the lower frame element and the center frame element.
7. A method of filling a flexible, collapsible container comprising:
(a) providing a flexible, collapsible container having a spout;
(b) providing an apparatus comprising
(i) a center frame element having a first end and a second end;
(ii) an upper frame element attached to the first end of the center frame element and adapted to receive at least a portion of the spout; and
(iii) a lower frame element attached to the second end of the center frame element, the lower frame element having a first segment and a lip extending therefrom, wherein the lip and upper frame element are not substantially parallel; and
(iv) a clamping device;

(c) removably clamping the clamping device to a surface other than the flexible, collapsible container;
(d) providing a material for filling the container;
(e) engaging at least a portion of a neck portion of the container with said upper frame element;
(f) positioning at least a portion of the container onto the lower frame element; and
(g) causing material to enter the container through the spout.
8. The apparatus of claim 1, further comprising a drip cup disposed on the upper frame element.
9. The apparatus of claim 1, wherein the center frame element forms at least one mounting hole.
10. The apparatus of claim 1, further comprising a support leg attached to one of the upper frame element, the center frame element and the lower frame element.
11. The apparatus of claim 10, wherein the support leg includes a support foot.
12. The apparatus of claim 3, wherein the clamp includes a clamp bracket slidably associated with one of the upper frame element, the center frame element, and the lower frame element.
13. The apparatus of claim 12, wherein the upper frame element, the center frame element, and the lower frame element combine to define a first major side of the apparatus at which a flexible container is received, and further wherein the clamp bracket is positioned to generate a clamping zone relative to a second major side of the apparatus, opposite the first major side.
14. The apparatus of claim 13, wherein the first segment of the lower frame element includes a first horizontal section extending from the center frame element, a vertical section extending from the first horizontal section, and a second horizontal section extending a front face of the vertical section opposite the first horizontal section, the lip extending from the second horizontal section, and further wherein the clamp bracket is positioned adjacent a rear face of the vertical section such that the clamping zone is established between the clamping bracket and the rear face of the vertical section.
15. The apparatus of claim 13, wherein the upper frame element projects forwardly of a front face of the center frame element, and further wherein the clamp bracket is positioned rearwardly of a rear face of the center frame element such that the clamping zone is established between the clamp bracket and the rear face of the center frame element.
16. The apparatus of claim 12, wherein the clamp further includes a set screw assembled to the clamp bracket.
17. The method of claim 7, wherein removably clamping the clamping device includes removably assembling the clamping device to a vertical surface.

The claims below are in addition to those above.
All refrences to claim(s) which appear below refer to the numbering after this setence.

1. A method comprising:
obtaining a first spherical graph signal defined on a graph, the graph including a plurality of graph vertices and a plurality of graph edges, the first spherical graph signal including a plurality of spherical signal points, each spherical signal point being a point in a N-dimensional sphere of a given radius, each spherical signal point corresponding to one of the graph vertices;
applying a spherical graph signal smoothing algorithm to the first spherical graph signal to produce a smoothed spherical graph signal defined on the graph, the smoothed spherical graph signal including a plurality of smoothed spherical signal points, each smoothed spherical signal point being a point in the N-dimensional sphere, each of the smoothed spherical signal points corresponding to one of the graph vertices; and
replacing the first spherical graph signal with the smoothed spherical graph signal.
2. A method as recited in claim 1, wherein the step of obtaining includes at least one of the following steps:
computing the first spherical graph signal as face normals of a polygon mesh;
reading the first spherical graph signal from an output of a computer program;
reading the first spherical graph signal from a computer memory buffer;
reading the first spherical graph signal from a display screen buffer;
reading the first spherical graph signal a computer file snored in a non-volatile storage medium;
reading the first spherical graph signal a computer file stored in a magnetic storage device;
reading the first spherical graph signal a computer file stored in an optical storage device;
reading the first spherical graph signal a computer file stored in a computer network;
scanning the first spherical graph signal a document;
multidimensional scanning the first spherical graph signal from a physical object;
drawing the first spherical graph signal with an electronic tablet;
constructing the first spherical graph signal with an interactive modeling system;
constructing the first spherical graph signal with a computer-aided design system;
constructing the first spherical graph signal with a computer animation system;
reconstructing the first spherical graph signal from multiple photographs; and
reconstructing the first spherical graph signal using a three-dimensional photography system.
3. A method as recited in claim 1, wherein the step of applying the spherical graph signal smoothing algorithm comprises the steps of:
constructing a vertex rotation matrix for each of the graph vertices of the graph; and
multiplying the vertex rotation matrix by the spherical signal point corresponding to the graph vertex to produce the smoothed spherical signal point corresponding to the same graph vertex.
4. A method as recited in claim 3, wherein the step of constructing the vertex rotation matrix comprises the steps of:
determining a vertex neighborhood of the graph vertex of the graph, the vertex neighborhood being a set of neighbor graph vertices, each neighbor graph vertex being a particular graph vertex of the graph different from the graph vertex, each neighbor graph vertex being connected to the graph vertex by a particular graph edge of the graph;
computing a neighbor rotation matrix for each neighbor graph vertex of the vertex neighborhood;
obtaining a neighbor weight for each neighbor graph vertex of the vertex neighborhood; and
evaluating the vertex rotation matrix as a weighted average of the neighbor rotation matrices using the neighbor weights.
5. A method as recited in claim 4, wherein the neighbor rotation matrix is a plane rotation, the plane rotation having a plane rotation subspace and an invariant subspace, the plane rotation subspace and the invariant subspace being orthogonal subspaces, the plane rotation subspace and the invariant subspace spanning N-dimensional space.
6. A method as recited in claim 5, wherein the plane rotation subspace includes the spherical signal point corresponding to the graph vertex and the spherical signal point corresponding to the neighbor graph vertex.
7. A method as recited in claim 4, wherein the rotation matrix satisfies a property such that a result of multiplying the neighbor rotation matrix by the spherical signal point corresponding to the graph vertex is equal to the spherical signal point corresponding to the neighbor graph vertex.
8. A method as recited in claim 4, wherein the step of evaluating the vertex rotation matrix comprises the steps of:
choosing a local parameterization of the group of rotations, the local parameterization having an inverse local parameterization;
computing a neighbor parameter value for each of the neighbor rotation matrices, the neighbor parameter value being equal to the inverse local parameterization evaluated at the neighbor rotation matrix;
computing a weighted average parameter value as a sum of a plurality of weighted neighbor parameter values, each weighted neighbor parameter value corresponding to one of the neighbor vertices, each weighted neighbor parameter value being equal to a product of the neighbor weight times the neighbor parameter value corresponding to said neighbor vertex; and
evaluating the local parameterization at the weighted average parameter value to produce the vertex rotation matrix.
9. A method as recited in claim 8, wherein the local parameterization of the group of rotations is a local parameterization taken from a group of local parameterizations including:
an exponential map parameterization;
a quaternions parameterization; or
a Cayley rational parameterization.
10. A method as recited in claim 4, wherein the neighbor rotation matrix is computed using Rodrigues’ formula.
11. A method as recited in claim 1, further comprising repeating the steps of applying and replacing until a spherical smoothing criterion is met.
12. A method as recited in claim 11, wherein the spherical smoothing criterion includes at least one stopping criterion taken from a group of stopping criteria including:
maximal error tolerance; and
maximal number of iterations.
13. A method as recited in claim 1, wherein the graph is a dual graph of a polygon mesh.
14. A method as recited in claim 1, wherein the spherical graph signal is a face normal signal of a polygon mesh.
15. A method as recited in claim 1, wherein the step of replacing comprises the following steps:
determining a set of unconstrained graph vertices, each unconstrained graph vertex being a particular graph vertex of said graph; and
replacing each spherical signal point of the first spherical signal corresponding to each unconstrained graph vertex of the set of unconstrained graph vertices with the smoothed spherical signal point corresponding to said unconstrained graph vertex.
16. A method as recited in claim 15, wherein the set of unconstrained graph vertices contains all the graph vertices of said graph.
17. A method comprising:
obtaining a graph signal defined on a graph, the graph including a plurality of graph vertices and a plurality of graph edges, the graph signal including a plurality of signal points, each signal point being a point in a N-dimensional space, each signal point corresponding to one of the graph vertices;
applying an anisotropic graph signal filter algorithm to the graph signal to produce a filtered graph signal defined on the graph, the filtered graph signal including a plurality of filtered signal points, each filtered signal point being a point in the same N-dimensional space each of the filtered signal points corresponding to one of the graph vertices; and
replacing the graph signal with the filtered graph signal.
18. A method as recited in claim 17, wherein the step of obtaining includes at least one of the following steps:
computing the graph signal an face normals of a polygon mesh;
reading the graph signal from the output of a computer program;
reading the graph signal from a computer memory buffer;
reading the graph signal from a display screen buffer;
reading the graph signal a computer file stored in a non-volatile storage medium;
reading the graph signal a computer file stored in a magnetic storage device;
reading the graph signal a computer file stored in an optical storage device;
reading the graph signal a computer file stored in a computer network;
scanning the graph signal a document;
multidimensional scanning the graph signal from a physical object;
drawing the graph signal with an electronic tablet;
constructing the graph signal with an interactive modeling system;
constructing the graph signal with a computer-aided design system;
constructing the graph signal with a computer animation system;
reconstructing the graph signal from multiple photographs; and
reconstructing the graph signal using a three-dimensional photography system.
19. A method as recited in claim 17, wherein the step of applying the anisotropic graph signal filter algorithm comprises the steps of:
constructing a vertex displacement for each of the graph vertices of the graph, the vertex displacement being a vector in the N-dimensional space;
adding the vertex displacement to the corresponding signal point to produce the filtered signal point corresponding to the same graph vertex.
20. A method as recited in claim 17, wherein the step of constructing the vertex displacement comprises the steps of:
determining a vertex neighborhood of the graph vertex of the graph, the vertex neighborhood being a set of neighbor graph vertices, each neighbor graph vertex being a particular graph vertex of the graph different from the graph vertex, each neighbor graph vertex being connected to the graph vertex by a particular graph edge of the graph;
computing a neighbor displacement for each neighbor graph vertex of the vertex neighborhood, the neighbor displacement being a vector in the N-dimensional space, the neighbor displacement computed by subtracting the signal point corresponding to the graph vertex from the signal point corresponding to the neighbor graph vertex;
obtaining a neighbor weight matrix for each neighbor graph vertex of the vertex neighborhood, the neighbor weight matrix being a matrix with N rows and N columns; and
evaluating each vertex displacement as the sum of a plurality of weighted neighbor displacement, each weighted neighbor displacement corresponding to one neighbor graph vertex, each weighted neighbor displacement being equal to the product of the neighbor weight matrix corresponding to the neighbor graph vertex times the neighbor displacement corresponding to the same neighbor graph vertex.
21. A method as recited in claim 17, further comprising repeating the steps of applying and replacing until an anisotropic smoothing criterion is met.
22. A method as recited in claim 21, wherein the anisotropic smoothing criterion includes at least one stopping criterion taken from a group of stopping criteria including:
maximal error tolerance; and
maximal number of iterations.
23. A method as recited in claim 20, where the graph is a primal graph of a polygon mesh.
24. A method as recited in claim 23, where the graph signal is a vertex position signal of a polygon mesh.
25. A method as recited in claim 23, where the step of obtaining each neighbor weight matrix corresponding to each neighbor graph vertex of each vertex neighborhood of each graph vertex comprises the steps of:
identifying a set of polygon mesh faces incident to a neighbor edge, the neighbor edge being a graph edge, the graph edge having the graph vertex and the neighbor graph vertex as ends, the set of polygon mesh faces containing one or more edge polygon mesh faces, each edge polygon mesh face being a polygon mesh face incident to the neighbor edge; and
obtaining the neighbor weight matrix as the average of a set of projection matrices, each projection matrix in the set of projection matrices being a matrix with N rows and N columns, each projection matrix in the set of projection matrices corresponding to one particular polygon mesh face in the set of polygon mesh faces, each projection matrix in the set of projection matrices representing the orthogonal projection onto a face plane, the face plane being a plane in N-dimensional space.
26. A method as recited in claim 17, wherein the step of replacing comprises the following steps:
determining a set of unconstrained graph vertices, each unconstrained graph vertex being a particular graph vertex of said graph; and
replacing each signal point of the graph signal corresponding to each unconstrained graph vertex of the set of unconstrained graph vertices with the filtered signal point corresponding to said unconstrained graph vertex.
27. A method as recited in claim 26, wherein the set of unconstrained graph vertices contains all the graph vertices of said graph.
28. A method comprising:
obtaining a polygon mesh having a polygon mesh connectivity and a vertex position signal;
obtaining a face normal signal for the polygon mesh;
smoothing the face normal signal;
integrating the vertex position signal and the face normal signal to produce a filtered vertex position signal; and
replacing the vertex position signal with the filtered vertex position signal.
29. A method, as recited in claim 28, where the step of obtaining the polygon mesh includes at least one of the following steps:
reading the polygon mesh from the output of a computer program;
reading the polygon mesh from a computer memory buffer;
reading the polygon mesh from a display screen buffer;
reading the polygon mesh a computer file stored in a non-volatile storage medium;
reading the polygon mesh a computer file stored in a magnetic storage device;
reading the polygon mesh a computer file stored in an optical storage device;
reading the polygon mesh a computer file stored in a computer network;
scanning the polygon mesh from a document;
multidimensional scanning the polygon mesh from a physical object;
drawing the polygon mesh with an electronic tablet;
constructing the polygon mesh with an interactive modeling system;
constructing the polygon mesh with a computer-aided design system;
constructing the polygon mesh with a computer animation system;
reconstructing the polygon mesh from multiple photographs; and
reconstructing the polygon mesh using a three-dimensional photography system.
30. A method, as recited in claim 29, where the face normal signal is obtained from the same source as the polygon mesh.
31. A method, as recited in claim 28, where the step the face normal signal is obtained as a function of the vertex positions of the vertex position signal.
32. A method, as recited in claim 28, where:
said polygon mesh connectivity includes a plurality of polygon mesh vertices and a plurality of polygon mesh faces, each polygon mesh face being a cycle of three or more polygon mesh corners, each polygon mesh corner corresponding to one of the polygon mesh vertices, each polygon mesh edge being an unordered pair of polygon mesh vertices that are consecutive in at least one polygon mesh face;
said vertex position signal is composed of a plurality of vertex positions, each vertex position corresponding to one polygon mesh vertex of the polygon mesh connectivity, said vertex position signal being a graph signal of the primal graph of the polygon mesh connectivity, said primal graph composed of primal graph vertices and primal graph edges, said primal graph vertices being the polygon mesh vertices of the polygon mesh connectivity, said primal graph edges being the polygon mesh edges of the polygon mesh connectivity; and
said face normal signal is a spherical graph signal on the dual graph of the polygon mesh connectivity, said dual graph being a graph, said dual graph composed of dual graph vertices and dual graph edges, said dual graph vertices being the polygon mesh faces, each of said dual graph edges corresponding to a particular regular edge of the polygon mesh connectivity and composed of the two polygon mesh faces which the regular edge is incident to, said face normal signal including a plurality of face normals, each of said face normals being a point in a N-dimensional sphere of a given radius, each face normal corresponding to one polygon mesh face.
33. A method, as recited in claim 32, where the step of smoothing comprises the following steps:
applying a spherical graph signal smoothing algorithm to the face normal signal to produce a smoothed face normal signal, said smoothed face normal signal being a spherical signal on the dual graph of the polygon mesh connectivity, said smoothed face normal signal including a plurality of smoothed face normals, each of said smoothed face normals being a point in the N-dimensional sphere, each smoothed face normal corresponding to one polygon mesh face; and
replacing the face normal signal with the smoothed face normal signal.
34. A method, as recited in claim 32, further comprising repeating the steps of applying and replacing until a face smoothing criterion is met.
35. A method, as recited in claim 32, wherein the step of replacing comprises the following steps:
determining a set of unconstrained polygon mesh faces, each unconstrained polygon mesh face being a particular polygon mesh face of said polygon mesh connectivity; and
replacing each face normal of the face normal signal corresponding to each unconstrained polygon mesh face of the set of unconstrained polygon mesh face with the smoothed face normal corresponding to said unconstrained polygon mesh face.
36. A method, as recited in claim 32, wherein the step of integrating comprises the following steps:
determining a polygon mesh vertex neighborhood of each polygon mesh vertex, the polygon mesh vertex neighborhood being a set of neighbor polygon mesh vertices, each neighbor polygon mesh vertex being a particular polygon mesh vertex of the polygon mesh connectivity different from the polygon mesh vertex, each neighbor polygon mesh vertex being connected to the polygon vertex by a particular polygon mesh edge of the polygon mesh connectivity;
computing a neighbor vertex displacement for each neighbor polygon mesh vertex of the polygon mesh vertex neighborhood, the neighbor vertex displacement being a vector in the N-dimensional space, the neighbor vertex displacement computed by subtracting the vertex position corresponding to the polygon mesh vertex from the vertex position corresponding to the neighbor polygon mesh vertex;
obtaining a neighbor vertex weight matrix for each neighbor polygon mesh vertex of the vertex neighborhood, the neighbor vertex weight matrix being a matrix with N rows and N columns; and
computing one polygon mesh vertex displacement for each polygon mesh vertex, the polygon mesh vertex displacement being computed as the sum of a plurality of weighted neighbor vertex displacements, each weighted neighbor vertex displacement corresponding to one neighbor polygon mesh vertex, each weighted neighbor vertex displacement being equal to the product of the neighbor vertex weight matrix corresponding to the neighbor polygon mesh vertex tunes the neighbor vertex displacement corresponding to the same neighbor polygon mesh vertex; and
adding each polygon mesh vertex displacement to the corresponding vertex position of the vertex position signal, to produce the corresponding filtered vertex position of the filtered vertex signal.
37. A method, as recited in claim 36, where the step of obtaining each neighbor vertex weight matrix for each neighbor polygon mesh vertex comprises the steps of:
identifying a set of polygon mesh faces incident to a neighbor polygon mesh edge, the neighbor polygon mesh edge being a polygon mesh edge, the polygon mesh edge having the polygon mesh vertex and the neighbor polygon mesh vertex as ends, the set of polygon mesh faces containing one or more edge polygon mesh faces, each edge polygon mesh face being a polygon mesh face incident to the neighbor polygon mesh edge; and
obtaining the neighbor vertex weight matrix as the average of a set of projection matrices, each projection matrix in the set of projection matrices being a matrix with N rows and N columns, each projection matrix in the set of projection matrices corresponding to one particular polygon mesh face in the set of polygon mesh faces, each projection matrix in the set of projection matrices representing the orthogonal projection onto a face plane, the face plane being a plane in N-dimensional space.
38. A method, as recited in claim 37, further comprising the following steps:
obtaining a first linear combination parameter and a second linear combination parameter;
constructing a combination neighbor vertex weight matrix for each neighbor vertex weight matrix as the sum of a first term and a second term, the first term being equal to the first linear combination parameter times the identity matrix of N rows and N columns, the second term being equal to the second linear combination parameter times said neighbor vertex weight matrix; and
replacing each neighbor vertex weight matrix by the corresponding combination neighbor vertex weight matrix.
39. An article of manufacture comprising a computer usable medium having computer readable program code means embodied therein for causing spherical graph signal smoothing, the computer readable program code means in said article of manufacture comprising computer readable program code means for causing a computer to effect the steps of claim 1.
40. A program storage device readable by machine, tangibly embodying a program of instructions executable by the machine to perform method steps for spherical graph signal smoothing, said method steps comprising the steps of claim 1.
41. An article of manufacture comprising a computer usable medium having computer readable program code means embodied therein for causing graph signal filtering, the computer readable program code means in said article of manufacture comprising computer readable program code means for causing a computer to effect the steps of claim 17.
42. A program storage device readable by machine, tangibly embodying a program of instructions executable by the machine to perform method steps for graph signal filtering, said method steps comprising the steps of claim 17.
43. An apparatus comprising:
means for obtaining a first spherical graph signal defined on a graph, the graph including a plurality of graph vertices and a plurality of graph edges, the first spherical graph signal including a plurality of spherical signal points, each spherical signal point being a point in a N-dimensional sphere of a given radius each spherical signal point corresponding to one of the graph vertices;
means for applying a spherical graph signal smoothing algorithm to the first spherical graph signal to produce a smoothed spherical graph signal defined on the graph, the smoothed spherical graph signal including a plurality of smoothed spherical signal points, each smoothed spherical signal point being a point in the N-dimensional sphere, each of the smoothed spherical signal points corresponding to one of the graph vertices; and
means for replacing the first spherical graph signal with the smoothed spherical graph signal.
44. An apparatus comprising:
means for obtaining a graph signal defined on a graph, the graph including a plurality of graph vertices and a plurality of graph edges, the graph signal including a plurality of signal points, each signal point being a point in a N-dimensional space, each signal point corresponding to one of the graph vertices;
means for applying en anisotropic graph signal filter is algorithm to the graph signal to produce a filtered graph signal defined on the graph, the filtered graph signal including a plurality of filtered signal points, each filtered signal point being a point in the same N-dimensional space, each of the filtered signal points corresponding to one of the graph vertices; and
means for replacing the graph signal with the filtered graph signal.
45. An apparatus comprising:
means for obtaining a polygon mesh having a polygon mesh connectivity and a vertex position signal;
means for obtaining a face normal signal for the polygon mesh;
means for smoothing the face normal signal;
means for integrating the vertex position signal and the face normal signal to produce a filtered vertex position signal; and
means for replacing the vertex position signal with the filtered vertex position signal.
46. A computer program product comprising a computer usable medium having computer readable program code means embodied therein for causing spherical graph signal smoothing, the computer readable program code means in said computer program product comprising computer readable program code means for causing a computer to effect the functions of claim 43.
47. A computer program product comprising a computer usable medium having computer readable program code means embodied therein for causing graph signal filtering, the computer readable program code means in said computer program product comprising computer readable program code means for causing a computer to effect the functions of claim 44.
48. An article of manufacture comprising a computer usable medium having computer readable program code means embodied therein for causing polygon mesh denoising, the computer readable program code means in said article of manufacture comprising computer readable program code means for causing a computer to effect the steps of claim 28.
49. A program storage device readable by machine, tangibly embodying a program of instructions executable by the machine to perform method steps for polygon mesh denoising, said method steps comprising the steps of claim 28.
50. A computer program product comprising a computer usable medium having computer readable program code means embodied therein for causing polygon mesh denoising, the computer readable program code means in said computer program product comprising computer readable program code means for causing a computer to effect the functions of claim 45.

1461097906-3bfbb61d-f89c-4855-8da4-79befca5b041

1. A diagnostic imaging suite comprising:
a diagnostic imaging apparatus with an imaging region;
first and second permanent walls;
a deployable containment wall that, in a deployed configuration, spans a distance between the first and second permanent walls separating the imaging suite into a potentially contaminated section and a non-contaminated section, the wall sealing the contaminated section from the non-contaminated section.
2. The diagnostic imaging suite as set forth in claim 1, wherein at least a gantry of the imaging apparatus is present in the non-contaminated section while a subject to be imaged is entirely present in the contaminated portion of the imaging suite.
3. The diagnostic imaging suite as set forth in claim 2, wherein the wall interfaces with a containment tube that extends the contaminated portion into the imaging region of the diagnostic imaging apparatus, into which the subject is inserted to be imaged.
4. The diagnostic imaging suite as set forth in claim 3, wherein a center portion of the wall includes a flange to which the containment tube is removably attached.
5. The diagnostic imaging suite as set forth in claim 1, wherein the wall further includes:
a center portion that is substantially aligned with the imaging region;
at least one deployable portion foldably attached to the first permanent wall, the deployable portion engaging the center portion when the deployable portion is deployed.
6. The diagnostic imaging suite as set forth in claim 5, further including:
a guide track in which the deployable portion is removably received to guide engagement of the deployable portion with the center portion.
7. The diagnostic imaging suite as set forth in claim 6, wherein the extendable portion includes a plurality of guide pins that engage the track.
8. The diagnostic imaging suite as set forth in claim 5, wherein the deployable portion includes at least two pivotally connected panels.
9. The diagnostic imaging suite as set forth in claim 8, wherein one of the at least two panels includes a clamping assembly for sealing the panel to the center portion.
10. The diagnostic imaging suite as set forth in claim 8, wherein each panel includes a sealing surface where the panel engages one of:
one of the permanent walls;
the center portion; and
another panel.
11. The diagnostic imaging suite as set forth in claim 8, wherein the panels include edge sealing sheets for sealing a juncture between the wall and a guide track.
12. The diagnostic imaging suite as set forth in claim 11, wherein the guide track includes a guide track sealing sheet that engages the edge sealing sheets of the panels for facilitating sealing of the juncture between the wall and the guide track.
13. The diagnostic imaging suite as set forth in claim 8, where at least one of the panels includes a wing for sealing a juncture between panels at a floor and a ceiling of the suite.
14. The diagnostic imaging suite as set forth in claim 5, wherein the center portion includes a patch panel that provides an electronic interface between the contaminated portion and the non-contaminated portion.
15. The diagnostic imaging suite as set forth in claim 1, wherein the deployable wall includes:
a center portion mounted adjacent the imaging apparatus;
an aperture in the center portion for receiving a containment tube that is removably connected with the center portion to surround a patient receiving imaging region of the imaging apparatus;
tracks extending along at least one of a ceiling and a floor from at least the center portion to the permanent walls;
a plurality of deployable panels hingedly connected with each other and being movably received in the tracks to move between a retracted configuration and a deployed configuration in which the panels extend from each permanent wall to the center section; and
seals which seal between the deployable panels, between the deployable panels and the center portion, between the deployable panels and the permanent walls, between the deployable panels and the floor and ceiling, and between the containment tube and the center portion such that the contaminated section of the suite is isolated from the non-contaminated side.
16. The diagnostic imaging suite as set forth in claim 15, wherein at least some of the seals include a plurality of alternating and mating tongues and grooves.
17. A method of creating an isolated imaging environment by constructing a wall comprising:
extending a plurality of panels from a permanent wall;
sealing a junction between the panels and the permanent wall;
sealing junctions between the panels; and
sealing a junction between the panels and the guide track.
18. The method as set forth in claim 17, wherein the step of extending includes:
extending the plurality of panels to interface with a center portion; and
sealing a junction between the panels and the center portion.
19. The method as set forth in claim 17, wherein the panels are extended along a guide track.
20. The method as set forth in claim 17, further including:
extending a containment tube into an imaging region of a diagnostic imaging apparatus;
attaching the containment tube to a flange on a center portion of the wall;
sealing a junction between the containment tube and the flange.
21. The method as set forth in claim 17, wherein the steps of sealing include engaging tongue and groove seals with each other.
22. An apparatus that performs the steps of claim 17.
23. A deployable containment wall for isolating a hot side of an imaging suite from a clean side, the wall comprising:
a plurality of deployable panels hingedly connected with each other and being configured to be movably received in tracks extending along a ceiling and a floor of the imaging suite, such that the panels are movable between a deployed configuration extending between walls of the suite and a retracted configuration; and
seals which seal between the deployable panels, between the deployable panels and the center portion, between the deployable panels and the permanent walls, between the deployable panels and the floor and ceiling, and between the containment tube and the center portion such that the contaminated section of the suite is isolated from the non-contaminated side.
24. The deployable containment wall as set forth in claim 23, wherein at least some of the seals include a plurality of alternating and mating tongues and grooves.
25. The deployable containment wall as set forth in claim 23, further including:
a center portion mountable adjacent an imaging apparatus with an aperture aligned with a patient receiving region of the imaging apparatus;
an aperture in the center portion for accommodating a containment device that surrounds a patient receiving imaging region of the imaging apparatus.
26. A containment wall for isolating a hot side of a room from the cold side of the room wherein the wall is selectably deployable and wherein the wall provides a biocontainment seal.
27. The containment wall as set forth in claim 26, further including:
an aperture in the wall for positioning a containment device therethrough.
28. A method of configuring an imaging suite for containment imaging by selectively deploying a containment wall, wherein the wall provides biocontainment from one side to the other.
29. The method as set forth in claim 28, further including:
reconfiguring the imaging suite to a state of non-biocontainment by retracting the containment wall.

The claims below are in addition to those above.
All refrences to claim(s) which appear below refer to the numbering after this setence.

1. A temperature detector, comprising:
a plurality of temperature sensors each configured to generate a voltage signal in accordance with a sensed temperature and output the voltage signal;
a plurality of storage circuits each corresponding to a respective one of the plurality of temperature sensors, each storage circuit being configured to store a signal level input to the storage circuit in response to a control signal and to output the stored signal level; and
a control circuit configured to exclusively and sequentially select one of the voltage signals output from the plurality of respective temperature sensors, compare the selected voltage signal with a predetermined reference voltage, and store a comparison result into a corresponding one of the storage circuits, in response to the control signal.
2. The temperature detector of claim 1, wherein the control circuit comprises:
a reference-voltage generation circuit configured to generate a predetermined reference voltage;
a selection circuit configured to exclusively select the one of the voltage signals output from one of the plurality of temperature sensors and output the selected voltage signal in response to a select signal;
a voltage-compare circuit configured to compare the selected voltage signal output from the selection circuit with the predetermined reference voltage and to generate a binary signal indicating a comparison result; and
a time-shared control circuit configured to cause the selection circuit to exclusively select the one of the voltage signals output from the respective temperature sensors sequentially, and to output the selected voltage signal to the voltage-compare circuit, and to cause a storage circuit corresponding to the temperature sensor from which the selected voltage signal was output to store the binary signal from the voltage-compare circuit sequentially.
3. The temperature detector of claim 1, wherein the control circuit further comprises a signal generator that generates an abnormal-temperature signal and outputs the abnormal-temperature signal, when at least one of the output signal levels from the storage circuits indicates an abnormal temperature detected by the temperature sensor.
4. The temperature detector of claim 1, wherein the control circuit further comprises a signal generator that generates an abnormal-temperature signal and outputs the abnormal-temperature signal, when at least one of temperature sensors specified from outside the temperature detector detects an abnormal temperature.
5. The temperature detector of claim 1, wherein the plurality of temperature sensors, the plurality of storage circuits, and the control circuit are integrated in an IC chip.
6. The temperature detector of claim 3, wherein the plurality of temperature sensors, the plurality of storage circuits, the control circuit and the signal generator are integrated in an IC chip.
7. A semiconductor device, comprising:
a plurality of internal circuits each configured to perform a corresponding predetermined function;
a temperature detector comprising:
a plurality of temperature sensors corresponding to the respective internal circuits, each temperature sensor being configured to generate a corresponding voltage signal in accordance with a sensed temperature of the corresponding internal circuit and to output the corresponding voltage signal;
a plurality of storage circuits each corresponding to a respective one of the plurality of temperature sensors, each storage circuit being configured to store a signal level input to the storage circuit in response to a control signal and to output the stored signal level; and
a control circuit configured to exclusively and sequentially select one of the voltage signals output from the plurality of respective temperature sensors, compare the selected voltage signal with a predetermined reference voltage, and store a comparison result into a corresponding one of the storage circuits, in response to the control signal.
8. The semiconductor device of claim 7, wherein the control circuit comprises:
a reference-voltage generation circuit configured to generate a predetermined reference voltage;
a selection circuit configured to exclusively select the one of the voltage signals output from one of the plurality of temperature sensors and output the selected voltage signal in response to a selection signal;
a voltage-compare circuit configured to compare the selected voltage signal output from the selection circuit with the predetermined reference voltage and generate a binary signal indicating a comparison result; and
a time-shared control circuit configured to cause the selection circuit to exclusively select the one of the voltage signals output from the temperature sensors sequentially, and to output the selected voltage signal from the corresponding temperature sensor to the voltage-compare circuit, and to cause the storage circuit corresponding to the temperature sensor from which the selected voltage signal was output to store the binary signal from the voltage-compare circuit sequentially.
9. The semiconductor device of claim 7, wherein each storage circuit outputs the signal level stored in the storage circuit to the corresponding internal circuit.
10. The semiconductor device of claim 9, wherein each internal circuit stops operation when the corresponding storage circuit outputs an abnormal temperature signal level indicating abnormal temperature to the internal circuit.
11. The semiconductor device of claim 7, wherein the control circuit further comprises a signal generator that checks the signal level output from the plurality of storage circuit circuits and generates an abnormal temperature indication signal indicating that at least one temperature sensor detects an abnormal temperature, and outputs the abnormal temperature indication signal indicating abnormal temperature if at least one temperature sensor detects an abnormal temperature.
12. The semiconductor device of claim 7, wherein the control circuit further comprises a signal generator that checks the signal level output from the plurality of storage circuits and generates an abnormal temperature indication signal indicating that at least one temperature sensor specified from outside the semiconductor device detects abnormal temperature, and outputs the abnormal temperature indication signal indicating abnormal temperature.
13. The semiconductor device of claim 7, wherein each internal circuit stops operation when the internal circuit receives an abnormal temperature signal indicating abnormal temperature from the corresponding storage circuit.
14. The semiconductor device of claim 7, wherein the internal circuits include power supply circuits that supply power to a load.
15. The semiconductor device of claim 7, wherein the internal circuits and the temperature detector are integrated in an IC chip.
16. A method for detecting temperature, comprising:
detecting temperatures at a plurality of locations using a plurality of temperature sensors;
generating for the temperatures detected at the plurality of locations voltage signals in accordance with the temperatures detected at the respective locations;
outputting the voltage signals;
generating a predetermined reference voltage; and
selecting exclusively one of the voltage signals,
comparing the selected voltage signal with the predetermined reference voltage; and
storing a signal level corresponding to comparison result in a storage circuit corresponding to the temperature sensor from which the selected voltage signal was output.
17. The method of claim 16, further comprising generating an abnormal temperature indication signal indicating abnormal temperature and outputting the abnormal temperature indication signal indicating abnormal temperature, when at least one of the voltage signals indicates abnormal temperature detected by at least one of the temperature sensors.
18. The method of claim 16, further comprising generating an abnormal temperature indication signal indicating abnormal temperature and outputting the abnormal temperature indication signal, when at least one temperature sensor detects abnormal temperature.