1460706429-7ef82c35-c623-4fd5-be61-0408d999c5c8

1. A machine for noduling and comminuting having a bipartite machine-rack,
one half of it may be turned away over a hinge providing free access to the interior part at which a rotor-shaft, equipped with a plurality of hammer-rods, is located, forming a rotor-block together with all cooperating parts cooperating with the rotor shaft,
which is connected to an axial turnable swiveling arm that, allowing an axial turning supported by a joint, is based at the machine-rack firmly anchored to a foundation,
wherein a wall of both parts of the bipartite machine-rack which surround the interior space of the machine rack is paneled by two interchangeable, bipartite, lengthily waved layers,
wherein on diverting levels in the interior part of the machine-rack interchangeable two-part screens, divided at their middle, are located, and
wherein the openings of the screens may differ from one another and define the size of the material processed.
The claims below are in addition to those above.
All refrences to claims which appear below refer to the numbering after this setence.

1. A computer program product containing instructions which, when executed by a computer, automatically detect and heal a crossover in a data communications system having a P1394b-compliant bus and a PHY which wishes to join the bus, by:
determining, by the PHY, whether it has received a tone;
if the PHY has not received a tone, then examining a random Boolean value; and
if the value of said random Boolean value is true, then implementing, by said PHY, a crossover process.
2. The computer program product of claim 1, wherein said crossover process comprises instructions, which, when executed by a computer, couple transmitting logic of said PHY to TPA, and couple receive logic of said PHY to TPB.
3. The computer program product of claim 2, where said system is operatively coupled with a non-crossover cable.
4. A computer program product containing instructions, which, when executed by a computer, automatically detect and heal a crossover in a data communications system having a P1394b-compliant bus and a PHY which wishes to join the bus, by:
determining, by the PHY, whether it has received a tone;
if the PHY has not received a tone, then examining a random Boolean value;
if the value of said random Boolean value is true, determining, by said PHY, whether said PHY is sending a tone;
if said PHY is sending a tone, then waiting a predetermined period of time;
further determining by said PHY if said PHY has received a tone; and
if said PHY has not received a tone, then implementing, by said PHY, a crossover process.
5. The computer program product of claim 4, wherein said crossover process comprises instructions which, when executed by a computer, couple transmitting logic of said PHY to TPA, and couple receive logic of said PHY to TPB.
6. The computer program product of claim 5, where said system is operatively coupled with a non-crossover cable.

1460706426-0f814cca-f702-46c3-bcd3-e3d6d883bfe2

1. A lubricating oil composition comprising:
a base oil in a range of from 1 mass % to 80 mass %,
wherein the base oil having has a kinematic viscosity at 40\xb0 C. of from 0.5 mm2s to 20 mm2s and a viscosity index of 200 or more.
2. The lubricating oil composition according to claim 1, wherein
the lubricating oil composition has a kinematic viscosity at 100\xb0 C. of from 0.5 mm2s to 10 mm2s.
3. The lubricating oil composition according to claim 1, further comprising:
polyalphaolefin having a kinematic viscosity at 100\xb0 C. of from 50 mm2s to 200 mm2s.
4. The lubricating oil composition according to claim 1, further comprising:
at least one of an antiwear agent, an extreme pressure agent, a friction modifier, and a viscosity index improver.
5. The lubricating oil composition according to claim 1, wherein
which is suitable for a continuously variable transmission.
The claims below are in addition to those above.
All refrences to claims which appear below refer to the numbering after this setence.

1. A method power management in a clustered system, the method comprising:
monitoring utilization among nodes of the clustered system;
balancing work loads among nodes of the clustered system based on the utilization monitoring, wherein the utilization monitoring comprises monitoring an idle node; and
avoiding activation of the idle node when there is no work request of the idle node based on the utilization monitoring of the idle node.
2. The method as claimed in claim 1, wherein the utilization monitoring comprises obtaining utilization information of the idle node solely when work is requested of the idle node.
3. The method as claimed in claim 1, wherein the utilization monitoring comprises packet sniffing for general node utilization information.
4. The method as claimed in claim 3, wherein said packet sniffing comprises
examining network packet content; and
modeling a request being processed by a node.
5. The method as claimed in claim 1, wherein the step of avoiding activation comprises avoiding individual polling of the idle node when there is no work request of the idle node.
6. The method as claimed in claim 5, wherein the step of avoiding individual polling comprises avoiding daemon-based polling of the idle node when there is no work request of the idle node.
7. The method as claimed in claim 5, wherein the step of avoiding individual polling comprises avoiding periodic polling of the idle node when there is no work request of the idle node.
8. A data processing system comprising at least a processor and a memory, further comprising a network monitor which monitors utilization among nodes of a clustered system; a load balancer which balances work loads among nodes of the clustered system based on monitoring by the network monitor; and the network monitor configured to monitor an idle node by avoiding activation of the idle node when there is no work request of the idle node.
9. The system as claimed in claim 8, wherein the network monitor is configured to obtain utilization information of the idle node solely when work is requested of the idle node.
10. The system as claimed in claim 8, wherein the network monitor is configured to employ packet sniffing for general node utilization information.
11. The system as claimed in claim 10, wherein the network monitor is configured to examine network packet content and model a request being processed by a node.
12. The system as claimed in claim 8, wherein the network monitor is configured to avoid individual polling of the idle node when there is no work request of the idle node.
13. The system as claimed in claim 12, wherein the network monitor is configured to avoid daemon-based polling of the idle node when there is no work request of the idle node.
14. The system as claimed in claim 12, wherein the network monitor is configured to avoid periodic polling of the idle node when there is no work request of the idle node.
15. A program storage device readable by machine, tangibly embodying a program of instructions executable by the machine, the program of instructions when executed on the machine is capable of performing the steps of:
monitoring utilization among nodes of a clustered system;
balancing loads among nodes of the clustered system based on the utilization monitoring, wherein the utilization monitoring comprises monitoring an idle node; and
avoiding activation of the idle node when there is no work request of the idle node based on the utilization monitoring of an idle node.
16. The program storage device as claimed in claim 15, wherein the utilization monitoring comprises obtaining utilization information of the idle node solely when work is requested of the idle node.
17. The program storage device as claimed in claim 15, wherein the utilization monitoring comprises packet sniffing for general node utilization information.
18. The program storage device as claimed in claim 15, wherein the step of avoiding activation comprises avoiding individual polling of the idle node when there is no work request of the idle node.
19. The program storage device according to claim 18, wherein the step of avoiding individual polling comprises avoiding daemon-based polling of the idle node when there is no work request of the idle node.
20. The program storage device as claimed in claim 18, wherein the step of avoiding individual polling comprises avoiding periodic polling of the idle node when there is no work request of the idle node.