초록 ▼

An adjustable bed having a bed frame and a center support section supported by the bed frame. A second support section has one end pivotally attached to one end of the center support section, and the second support section has an opening therethrough. A massage motor assembly has a housing mounted t

An adjustable bed having a bed frame and a center support section supported by the bed frame. A second support section has one end pivotally attached to one end of the center support section, and the second support section has an opening therethrough. A massage motor assembly has a housing mounted to the second support section over the opening. A massage motor is disposed in the housing, and a resilient material is disposed in the housing between the massage motor and the housing. Enclosing the massage motor in the resilient material reduces its operational noise and permits the massage motor to move in its natural orbital motion.

대표청구항 ▼

An adjustable bed having a bed frame and a center support section supported by the bed frame. A second support section has one end pivotally attached to one end of the center support section, and the second support section has an opening therethrough. A massage motor assembly has a housing mounted t

An adjustable bed having a bed frame and a center support section supported by the bed frame. A second support section has one end pivotally attached to one end of the center support section, and the second support section has an opening therethrough. A massage motor assembly has a housing mounted to the second support section over the opening. A massage motor is disposed in the housing, and a resilient material is disposed in the housing between the massage motor and the housing. Enclosing the massage motor in the resilient material reduces its operational noise and permits the massage motor to move in its natural orbital motion. id memory space is reclaimed without garbage collecting and is reused without allocating a new memory space. 12. The method according to claim 11, further comprising: determining if there is a sufficient amount of memory space available to store said object in said memory space prior to reusing said memory space. 13. The method according to claim 11 further comprising: recursively determining all objects potentially referenced by said object. 14. The method according to claim 12 further comprising: recursively determining all objects that potentially reference said object. 15. The method according to claim 11, further comprising: performing a safety check on the instructions of said computer program module. 16. A computer system, comprising: a memory configured and arranged to store an object; a processor associated with said memory executing an executable module having a portion that analyzes an incoming stream of computer instructions; said executable module identifying a loop within said stream of computer instructions and at least one first instruction within said loop which, upon execution, allocates an unallocated portion of said memory for an instance of a first object for each iteration of said loop; said executable module replacing said at least one first instruction with at least one second instruction which, upon execution, reuses the same allocated portion of said memory for an instance of said first object for each iteration of said loop. 17. The system according to claim l6, wherein said at least one second instruction being interposed by said executable module is hidden from the programmer. 18. The system according to claim 16, wherein said at least one second instruction acts to reuse a memory space previously allocated for an existing object. 19. The system according to claim 16, wherein said executable module performs a safety check prior to replacing said at least one first instruction with said at least one second instruction. 20. The system according to claim 19 wherein, in performing the safety check said executable module executes a transitive closure of all functions along a function tree called while said object is still in use. 21. The system according to claim 19 wherein, said executable module executes the transitive closure of the constructor used by said object. 22. The system according to claim 19 wherein, said executable module executes the transitive closure of any function using said object as an argument along said function tree. 23. The system according to claim 19 wherein, said executable module executes the transitive closure of any function called by said object along said function tree. 24. The method according to claim 16, wherein said instances of said first object are reclaimed without garbage collecting. 25. The system according to claim 16, wherein said executable module is a compiler. 26. The system according to claim 25, wherein said executable module compiler is a JAVA compiler. 27. The system according to claim 26, wherein said JAVA compiler is a Just In Time compiler. 28. A program storage device readable by a computer system, the program storage device tangibly embodying a program of instructions executable by the computer system to perform a method of reusing a memory space in a computer, the method comprising: analyzing an incoming stream of computer instructions with an executable module; determining the presence of a first predetermined operator within a loop in said stream of computer instructions, said first predetermined operator allocating an unallocated portion of said memory space upon execution; if said first predetermined operator is present, determining the value of a parameter following said first operator in said stream; interposing a second operator within said loop in place of said first operator by said executable module; and reusing the same allocated portion of said memory space to store an instance of said parameter in