1. An office machine, comprising:
a main body;
a shaft disposed on the main body;
a recording head slidably disposed on the shaft;
a driving wheel disposed on a first end of the main body;
a driven wheel disposed on a second end of the main body;
a tension buffer disposed on the main body and having a sleeve, a wheel mount and a resilient member, wherein the sleeve is disposed on the main body and has a cavity, the wheel mount is disposed in the cavity and connected to the driven wheel, and the resilient member is disposed between the sleeve and the wheel mount and biases the sleeve and the wheel mount to move the wheel mount in the sleeve; and
a transmission belt connecting the driving wheel and the driven wheel and the recording head bound thereon, wherein the driving wheel drives the transmission belt such that the recording head slides on the shaft.
2. The office machine as claimed in claim 1, further comprising a seal disposed on the wheel mount such that the cavity is sealed by the wheel mount and the seal.
3. The office machine as claimed in claim 1, wherein the sleeve has a hole.
4. The office machine as claimed in claim 3, further comprising a pin blocking the hole.
5. The office machine as claimed in claim 1, further comprising a fastener and a tab disposed on the sleeve, wherein the fastener fixes the tension buffer on the main body through the tab.
6. The office machine as claimed in claim 5, wherein the fastener is a screw or a hook.
7. The office machine as claimed in claim 1, wherein the resilient member is a spring.
8. The office machine as claimed in claim 1, wherein the office machine is a printer and the recording head is a print head.
9. The office machine as claimed in claim 1, wherein the office machine is a scanner and the recording head is a scan module.
10. The office machine as claimed in claim 1, wherein the transmission belt is a belt.
11. The office machine as claimed in claim 1, wherein the sleeve and wheel mount are arranged to trap air inside the cavity between the sleeve and the wheel mount such that air resistance is generated by the trapped air when the wheel mount is moved in the sleeve.
12. The office machine as claimed in claim 11, further comprising a hole in the sleeve communicating the cavity with the ambient, wherein the sleeve, wheel mount and hole are arranged such that air trapped in the cavity is vented out of the cavity through the hole when the resilient member is compressed by the wheel mount.
13. The office machine as claimed in claim 1, further comprising a seal disposed on the wheel mount, wherein the sleeve, wheel mount and seal are arranged to trap air inside the cavity between the sleeve and the wheel mount such that air resistance is generated by the trapped air when the wheel mount is moved in the sleeve.
14. The office machine as claimed in claim 13, further comprising a hole in the sleeve communicating the cavity with the ambient, wherein the sleeve, wheel mount, seal and hole are arranged such that air trapped in the cavity is vented out of the cavity through the hole when the resilient member is compressed by the wheel mount.
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 for optimizing performance of a software application within a computer system, wherein said software application includes a plurality of agents, said method comprising:
assigning each of said plurality of agents a different segment, wherein all of said segments initially have an identical size;
repeatedly performing:
randomly selecting one of said segments;
requesting a particular one of said plurality of agents assigned said selected segment to change a parameter of said software application; and
after each of said plurality of agents has been requested at least once, adjusting segment size assigned to one or more of said plurality of agents according to a performance change in said software application associated with the parameter change initiated by each respective agent.
2. The method of claim 1, wherein said adjusting further includes increasing segment size of an agent if the corresponding performance of said software application has improved.
3. The method of claim 1, wherein said adjusting further includes decreasing segment size of an agent if the corresponding performance of said software application has worsen.
4. The method of claim 1, wherein said method further includes generating a working weight for each of said plurality of agents, wherein said working weight corresponds with a segment size.
5. The method of claim 4, wherein said generating a working weight further includes calculating a new working weight for each of said plurality of agents that has a positive performance by
\u2200
n
\u2062
\u2003
\u2062
n
\u2062
ew
\u2062
\u2003
\u2062
working
\u2062
\u2003
\u2062
weight
(
n
)
=
improvement
success
\u2062
\u2003
\u2062
ratio
where n=agent number and said success ratio is determined by adding all positive performance change values from all said plurality of agents and ignoring all negative performance change values.
6. A computer program product residing on a computer usable medium for optimizing software applications within a computer system, wherein said software application includes a plurality of agents, said computer program product comprising:
program code means for assigning each of said plurality of agents a different segment, wherein all of said segments initially have an identical size;
program code means for repeatedly performing:
randomly selecting one of said segments;
requesting a particular one of said plurality of agents assigned said selected segment to change a parameter of said software application; and
program code means for adjusting segment size assigned to one or more of said plurality of agents according to a performance change in said software application associated with the parameter change initiated by each respective agent, after each of said plurality of agents has been requested at least once.
7. The computer program product of claim 6, wherein said program code means for adjusting further includes program code means for increasing segment size of an agent if the corresponding performance of said software application has improved.
8. The computer program product of claim 6, wherein said program code means for adjusting further includes program code means for decreasing segment size of an agent if the corresponding performance of said software application has worsen.
9. The computer program product of claim 6, wherein said computer program product further includes program code means for generating a working weight for each of said plurality of agents, wherein said working weight corresponds with a segment size.
10. The computer program product of claim 9, wherein said program code means for generating a working weight further includes program code means for calculating a new working weight for each of said plurality of agents that has a positive performance by
\u2200
n
\u2062
\u2003
\u2062
n
\u2062
ew
\u2062
\u2003
\u2062
working
\u2062
\u2003
\u2062
weight
(
n
)
=
improvement
success
\u2062
\u2003
\u2062
ratio
where n=agent number and said success ratio is determined by, adding all positive performance change values from all said plurality of agents and ignoring all negative performance change values.
11. A data processing system having a controller for optimizing software applications within a computer system, wherein said software application includes a plurality of agents, said data processing system comprising:
means for assigning each of said plurality of agents a different segment, wherein all of said segments initially have an identical size;
means for repeatedly performing:
randomly selecting one of said segments;
requesting a particular one of said plurality of agents assigned said selected segment to change a parameter of said software application; and
means for adjusting segment size assigned to one or more of said plurality of agents according to a performance change in said software application associated with the parameter change initiated by each respective agent, after each of said plurality of agents has been requested at least once.
12. The data processing system of claim 11, wherein said means for adjusting further includes program code means for increasing segment size of an agent if the corresponding performance of said software application has improved.
13. The data processing system of claim 11, wherein said means for adjusting further includes program code means for decreasing segment size of an agent if the corresponding performance of said software application has worsen.
14. The data processing system of claim 11, wherein said data processing system further includes program code means for generating a working weight for each of said plurality of agents, wherein said working weight corresponds with a segment size.
15. The data processing system of claim 14, wherein said means for generating a working weight further includes program code means for calculating a new working weight for each of said plurality of agents that has a positive performance by
\u2200
n
\u2062
\u2003
\u2062
n
\u2062
ew
\u2062
\u2003
\u2062
working
\u2062
\u2003
\u2062
weight
(
n
)
=
improvement
success
\u2062
\u2003
\u2062
ratio
where n=agent number and said success ratio is determined by adding all positive performance change values from all said plurality of agents and ignoring all negative performance change values.