1. An extinguishing medium in pasty to solid form for quenching electric arcs, consisting of a silicone polymer or a mixture of such silicone polymers, characterized in that this silicone polymer or the mixture of the silicone polymers contains at least one mineral compound or a mixture of such compounds in powder form as a filler.
2. The extinguishing medium as claimed in claim 1, characterized in that the filler has an average grain size in the range of from 500 nm to 500 m.
3. The extinguishing medium as claimed in claim 1 or 2, characterized in that it contains the filler in a concentration of at least 10 percent by weight, expressed in terms of the total weight of the extinguishing medium.
4. The extinguishing medium as claimed in one of claims 1 to 3, characterized in that a curable polysiloxane or a curable polysiloxane mixture, which cures at room temperature or at elevated temperature by addition polymerization or condensation polymerization, is used in order to produce the extinguishing medium.
5. The extinguishing medium as claimed in one of claims 1 to 4, characterized in that the organopolysiloxane represents a compound, or a compound mixture, of the general formula (I):
2
wherein
R independently of each other denote an alkyl radical having from 1 to 8 carbon atoms, (C1-C4) alkylaryl or aryl; preferably an alkyl radical having from 1 to 4 carbon atoms or phenyl; preferably methyl;
R1 independently of each other denote one of the meanings of R or R2 and, optionally, two end substituents R1 bonded to different Si atoms may collectively stand for an oxygen atom (cyclic compound);
R2 denotes one of the meanings of R, or hydrogen, or an (A)rCHCH2 radical;
A denotes a CsH2s radical, preferably (CH2)s, wherein
s denotes an integer from 1 to 6, preferably 1;
r denotes zero or one;
m denotes on average from zero to 5000, preferably from 20 to 5000, preferably from 50 to 1500;
n denotes on average from zero to 100, preferably from 2 to 100, preferably from 2 to 20;
the sum of mn for non-cyclic compounds being preferably at least 20, and preferably at least 50, and the groups Si(R)(R)O and Si(R1)(R2)O being arranged in an arbitrary order in the molecule.
6. The extinguishing medium as claimed in claim 5, characterized in that the siloxane of the formula (I) represents a non-cyclic compound, wherein the sum of mn is on average in the range of from 20 to 5000, and preferably in the range of from 50 to 1500.
7. The extinguishing medium as claimed in claim 5, characterized in that the compound of the formula (I) represents a cyclic organohydrogenpolysiloxane or an organovinylpolysiloxane, which is made up of Si(R)(R)O units andor Si(R1)(R2)O units, preferably of SiH(R2)O units, and which forms a ring having preferably from 4 to 12 such units, preferably having from 4 to 8 siloxy units.
8. The extinguishing medium as claimed in one of claims 1 to 7, characterized in that the extinguishing medium is present as a curable mixture consisting of two components, wherein, in one of the components, R2 denotes hydrogen for at least some of the molecules present in that component and, in the other component, R2 denotes ACHCH2 for at least some of the molecules present in this other component.
9. The extinguishing medium as claimed in one of claims 1 to 8, characterized in that, in order to facilitate the addition-crosslinking reaction, it contains a coordination compound or a mixture of such coordination compounds from the group comprising rhodium, nickel, palladium andor platinum metals.
10. The extinguishing medium as claimed in one of claims 1 to 6, characterized in that it contains a condensation-crosslinking silicone-resin system.
11. The extinguishing medium as claimed in one of claims 1 to 10, characterized in that the mineral compound or the mixture of such compounds is selected from the following group: natural purified sands; silicon oxide; aluminum oxide; titanium oxide; silicates, preferably sodiumpotassium silicates, silicon aluminosilicates; mineral carbonates, preferably calcium-magnesium carbonate or calcium-silicon-magnesium carbonates; geopolymers, preferably trolites andor zeolites based on aluminosilicates or other alkaline earth metals, glasses, mica, ceramic particles; boric acid, metals hydroxides, preferably aluminum hydroxide, magnesium hydroxide; mineral substances that contain water of hydration, preferably aluminum oxide that contains water of hydration; MgCO3; Mg(OH)2.4MgCO3.4H2O; Mg(OH)2; MgO; MgCl2.5Mg(OH)2.7H2O.
12. The extinguishing medium as claimed in one of claims 1 to 11, characterized in that the mineral compound or the mixture of such compounds has an average grain size in the range of from 500 nm to 500 m, preferably in the range of from 10 m to 250 m, and especially in the range of from 20 m to 150 m, preferably in the range of from 30 m to 130 m or in the range of from 500 nm to 50 m, preferably in the range of from 0.5 m to 10 m.
13. The extinguishing medium as claimed in one of claims 1 to 12, characterized in that the proportion of the filler in the silicone resin is in the range of from 5% by weight to 95% by weight, preferably in the range of from 40% by weight to 85% by weight, and in particular in the range of from 60% by weight to 80% by weight, calculated in terms of the total weight of filler and polymer.
14. The use of the extinguishing medium to quench electric arcs in overcurrent-protection elements, preferably in fuses, preferably in household fusible cutouts, in high-voltagehigh-breaking-capacity fuses in the distribution network or substrate fuses; in electronics, microelectronics; in high-voltage engineering; or in repeating fuses, preferably in PTC elements.
15. An electrical device, machines and systems, preferably overcurrent-protection elements, preferably fuses in general, household fusible cutouts, high-voltagehigh-breaking-capacity fuses (h.v.h.b.c. fuses) in the distribution network or substrate fuses; machines in the field of electronics, microelectronics, high-voltage engineering; repeating fuses, characterized in that they contain an extinguishing medium as claimed in one of claims 1 to 13.
16. A method for producing a device, in particular fuses, as claimed in claim 15, characterized in that a liquid to pasty silicone compound or a mixture of such silicone compounds is uniformly mixed with a suitable filler or a mixture of such fillers in the desired concentration in an arbitrary order, the mixture obtained is converted into a desired shape andor applied to the fuse wire of the device andor introduced into the interior of the device and the mixture is subsequently cured or allowed to cure, optionally prior andor subsequent to the introduction into the interior of the device.
17. A fuse, in which the fuse element is aligned and placed in the housing by means of the silicone composition.
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 data arrangement calculating system comprising:
a master unit which has data of records arranged in order based on key data of said records and a job which executes sliding window calculation every predetermined window width; and
a plurality of slave units connected with said master unit,
wherein said master unit comprises:
a data arranging section configured to divide said data to arrange in said plurality of slave units; and
a job allocating section configured to allocate said job to each of said plurality of slave units,
wherein said data arranging section comprises:
a data dividing section configured to divide said data and generate blocks and replica blocks of said blocks; and
an arranging section configured to arrange a first block of said blocks in a first slave unit of said plurality of slave units as an owner block, and arrange the replica block of a second block of said blocks next to said first block in said first slave unit,
wherein said first slave unit comprises:
a data retaining section configured to retain said first block and the replica block of said second block; and
a job executing section configured to receive said job and execute said job to carry out the sliding window calculation every said predetermined window width to said first block, and
wherein said job executing section executes the sliding window calculation by using said first block and the replica block of said second block when the predetermined window width extends over said first block and the replica block of said second block.
2. The data arrangement calculating system according to claim 1, wherein in said master unit, said arranging section generates arrangement data in which said first block is related to said first slave unit as the owner block, and the replica block of said second block is related to said first slave unit as the replica block,
wherein said job allocating section refers to said arrangement data to recognize a kind of the key data defining the order of first records of said first block, and allocates a plurality of first key data corresponding to the kind and said job to said first slave unit, and
wherein in said first slave unit, said job executing section executes the sliding window calculation every said predetermined window width by using the plurality of first key data as start keys.
3. The data arrangement calculating system according to claim 2, further comprising:
a data re-arranging section configured to update each of said plurality of slave units when receiving data containing a new record,
wherein said data re-arranging section comprises:
a data inserting section configured to refer to said arrangement data to insert said new record into said second block based on a second key of the same kind as that of key data which is contained in said new record to generate an insertion block in which said new record has been inserted;
a determining section configured to determine whether or not a size of said insertion block is within a first threshold value; and
a re-arranging section configured to divide said insertion block into a first half and a second half to generate a fourth block and a fifth block, when the size of said insertion block is larger than said first threshold value, arrange said fourth block as an owner block in a new second slave unit, arrange a replica block of said fifth block next to said fourth block in said second slave unit, re-arrange a replica block of said fourth block in said first slave unit which retains the replica block of said second block, and re-arrange said fifth block as the owner block in said third slave unit which retains said second block.
4. The data arrangement calculating system according to claim 3, wherein said re-arranging section inserts said new record in the replica of said second block and said second block when the size of said insertion block is within said first threshold value.
5. The data arrangement calculating system according to claim 3, wherein said data re-arranging section further comprises:
a data deleting section configured to refer to said arrangement data to delete said second record from said second block, as a deletion block, when receiving a request of deleting said second record contained in said second block,
wherein said determining section determines whether or not the size of said deletion block is within a second threshold value, and
wherein said re-arranging section generates an integration block by integrating a third block next to said deletion block and said deletion block based on the order of the key data, when the size of said deletion block is within the second threshold value, re-arranges a replica block of said integration block in said first slave unit which retains the replica block of said second block, re-arranges said integration block as an owner block in a fourth slave unit which retains said third block, and deletes said second block in said third slave unit which retains said second block as the owner block.
6. The data arrangement calculating system according to claim 5, wherein said re-arranging section deletes said second record from said second block and the replica block of said second block, when the size of said deletion block is larger than said second threshold value.
7. A data arrangement calculating method comprising:
a master unit dividing data of records arranged in order based on key data of said records;
said master unit arranging said data which has been divided, in a plurality of slave units;
said master unit allocating a job which executes sliding window calculation every predetermined window width to each of said plurality of slave units; and
each of said plurality of slave units executing the sliding window calculation based on the allocated job,
wherein said dividing comprises:
dividing said data to generate blocks and replica blocks of said blocks,
wherein said arranging comprises:
arranging a first block of said blocks as an owner block in a first slave unit of said plurality of slave units; and
arranging the replica block of said second block next to said first block in said first slave unit,
wherein said executing comprises:
said first slave unit receiving said job and executing the sliding window calculation every said predetermined window width to said first block, and
wherein said executing comprises:
executing the sliding window calculation by using said first block and the replica block of said second block, when said predetermined window width extends over said first block and the replica block of said second block.
8. The data arrangement calculating method according to claim 7, wherein said arranging further comprises:
generating arrangement data in which said first block is related to said first slave unit as the owner block and the replica block of said second block is related to said first slave unit,
wherein said allocating comprises:
referring to said arrangement data to recognize a kind of the key data defining the order of first records of said first block; and
allocating said job and a plurality of first key data corresponding to the kind of the key data, to said first slave unit, and
wherein said executing comprises:
executing the sliding window calculation every said predetermined window width by using the plurality of first key data as start keys.
9. The data arrangement calculating method according to claim 8, further comprising:
updating each of said plurality of slave units when said master unit receives data containing a new record,
wherein said updating comprises:
referring to said arrangement data to insert said new record into said second block based on second key data of the same kind as that of the key data which is contained in said new record to generate an insertion block;
determining whether or not a size of said insertion block is within a first threshold value;
dividing said insertion block into a first half and a second half to generate a fourth block and a fifth block, when the size of said insertion block is larger than said first threshold value;
arranging said fourth block as an owner block in a new second slave unit;
arranging a replica block of said fifth block next to said fourth block in said second slave unit;
re-arranging a replica block of said fourth block in said first slave unit which retains the replica block of said second block; and
re-arranging said fifth block as the owner block in said third slave unit which retains said second block as the owner block.
10. The data arrangement calculating method according to claim 9, wherein said updating further comprises:
inserting said new record in the replica block of said second block and said second block when the size of said insertion block is within said first threshold value.
11. The data arrangement calculating method according to claim 8, further comprising:
said master unit updating each of said plurality of slave units in response to a request, when receiving the request of deleting said second record which is contained in said second block,
wherein said updating each of said plurality of slave units in response to said request comprises:
referring to said arrangement data to delete said second record from said second block to generate a deletion block when receiving said request;
determining whether or not a size of said deletion block is within a second threshold value;
integrating a third block next to said deletion block and said deletion block to generate an integration block, when the size of said deletion block is within said second threshold value;
re-arranging a replica block of said integration block in said first slave unit which retains the replica block of said second block;
re-arranging said integration block as an owner block in a fourth slave unit which retains said third block as the owner block; and
controlling said third slave unit which retains said second block as the owner block to delete said second block.
12. The data arrangement calculating method according to claim 11, wherein said updating each of said plurality of slave units in response to said request further comprises:
deleting said second record from the replica block of said second block and said second block, when the size of said deletion block is larger than said second threshold value.
13. (canceled)
14. A data arranging method comprising:
dividing data of records arranged in order defined based on key data of said records;
arranging the divisions of said data in a plurality of slave units; and
allocating a job which executes a sliding window calculation every predetermined window width to each of said plurality of slave units,
wherein said dividing comprises:
generating blocks and replica blocks of said blocks from said data, and
wherein said arranging comprises:
arranging a first block of said blocks in a first slave unit of said plurality of slave units as an owner block; and
arranging the replica block of a second block next to said first block in said first slave unit.
15. The data arranging method according to claim 14, wherein said arranging further comprises:
generating arrangement data by relating said first block to said first slave unit as the owner block, and relating the replica block of said second block to said first slave unit, and
wherein said allocating comprises:
referring to said arrangement data to recognize a kind of the key data defining an order of first records which are contained in said first block; and
allocating a plurality of first key data corresponding to the kind of the key data and said job to said first slave unit.
16. The data arranging method according to claim 15, further comprising:
updating each of said plurality of slave units when receiving data containing a new record,
wherein said updating comprises:
referring to said arrangement data to insert said new record in said second block to generate an insertion block, based on a second key of the same kind as that of the key data contained in said new record;
determining whether or not a size of said insertion block is within a first threshold value;
dividing said insertion block to generate a fourth block and a fifth block when the size of said insertion block is larger than said first threshold value;
arranging said fourth block as an owner block in a new second slave unit;
arranging a replica block of said fifth block next to said fourth block in said second slave unit;
re-arranging a replica block of said fourth block in said first slave unit which retains the replica block of said second block; and
re-arranging said fifth block as an owner block in a third slave unit which retains said second block as the owner block.
17. The data arranging method according to claim 16, wherein said updating further comprises:
inserting said new record in said second block and the replica block of said second block, when the size of said insertion block is within said first threshold value.
18. The data arranging method according to claim 15, further comprising:
updating each of said plurality of slave units in response to a request when receiving the request which deletes a second record contained in said second block,
wherein said updating each of said plurality of slave units comprises:
referring to said arrangement data to delete said second record from said second block to generate a deletion block, when receiving said request;
determining whether or not the size of said deletion block is within a second threshold value;
integrating a third block next to said deletion block and said deletion block to generate an integration block when the size of said deletion block is within the second threshold value;
re-arranging a replica block of said integration block in said first slave unit which retains the replica block of said second block;
re-arranging said integration block as an owner block in a fourth slave unit which retains said third block as an owner block; and
controlling said third slave unit which retains said second block as the owner block to delete said second block.
19. The data arranging method according to claim 18, wherein said updating each of said plurality of slave units comprises:
deleting said second record from a replica block of said second block and said second block when the size of said deletion block is larger than said second threshold value.
20. (canceled)