Author: claimsbot

1. A digital pen system comprising a pen adapted to mark a medium and a sensor arranged to determine the position on the medium of a mark made by the pen, the system being arranged to identify a plurality of different areas on the medium and being further arranged to authenticate a user in dependence upon authentication data input by the user, the authentication data having a value dependent upon the order in which a group of the plurality of different areas of the medium are marked by the pen.
2. A system according to claim 1 in which the sensor is arranged to generate stroke data which allows the position of a mark made by the pen to be determined.
3. A system according to claim 2 which is arranged to store the stroke data generated by the sensor within a memory of the system and is further arranged to process the stored stroke data to identify the plurality of different areas.
4. A system according to any preceding claim which further comprises a processing means having, or being able to have created, a data connection to the pen wherein the processing means is arranged to process the stroke data generated by the sensor in order to identify the plurality of different areas.
5. A system according to claim 4 in which the processing means is provided by a computer.
6. A system according to any preceding claim in which the sensor is arranged to read position identifying markings provided on the medium.
7. A system according to claim 6 in which the sensor is arranged to read position identifying markings provided by the company Anoto\u2122.
8. A system according to any preceding claim in which the value given to the authentication data is dependent upon any one of following:
i: the first n areas marked by the pen;
ii: areas marked by the pen before predetermined stroke data is generated by the sensor;
iii: areas between the nth and mth areas marked by the pen; and
iv: areas marked at predetermined positions within the areas marked by the pen.
9. A method of authenticating a user comprising using a sensor of a digital pen system to generate stroke data, processing the stroke data to determine the position of marks made by the pen on a medium having a plurality of areas thereon, the method authenticating the user in dependence upon authentication data which has a value dependent upon the order in which a group of the plurality of different areas of the media are marked by the pen.
10. A method according to claim 9 which associates one or more strokes made by the pen with an area on the medium.
11. A method according to claim 9 or 10 in which the areas on the medium are provided by check boxes.
12. A method according to any of claims 9 to 11 comprising providing a medium having position identifying markings readable at a surface thereof.
13. A method according to claim 12 in which the position identifying markings are provided by a pattern provided by Anoto\u2122.
14. A method according to any of claims 9 to 13 which establishes a data connection between the pen and a processing device and causes the stroke data to be processed to determine the symbols andor the sequence on the processing device.
15. A machine readable medium containing instructions which when read by a processing device cause that processing device to provide the method of any of claims 9 to 14.
16. A machine readable medium containing instructions which when read by a processing device cause that processing device to perform as at least a part of the system of any of claims 1 to 8.
17. A digital pen system in combination with a medium, the system comprising a pen adapted to mark the medium and a sensor arranged to determine the position of a mark, made by the pen, on the medium and generate stroke data therefrom;
the system being arranged to derive a set of symbols from the stroke data with each symbol in the set corresponding to one or more marks made by the pen;
the system being further arranged to select according to predetermined criteria based upon the order in which the marks were made by the pen, a sub-set from the set of symbols wherein the sub-set constitutes information that it is desired to input to the system; and
wherein use of the pen on the medium is such that, once the information has been entered, the marks upon the medium cannot be used to determine the information.
18. A system according to claim 17 in which the medium is provided with a plurality of areas with each area having a symbol associated therewith.
19. A system according to claim 18 which is arranged to associate one or more strokes with any one of the areas to provide a symbol of the information.
20. A system according to claim 18 or 19 in which the areas are provided by check boxes.
21. A processing device arranged to receive stroke data, generated by use of a pen from a digital pen system on a medium having a plurality of areas thereon, the processing device being arranged to process the stroke data and identify a plurality of the areas of the medium marked by the pen, the device being further arranged to authenticate a user in dependence upon authentication data having a value dependent upon the order in which the areas of the medium were marked by the pen.

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 rotary electric device for a power working machine, which is operatively connected to an engine as a power source for the power working machine, and capable of being braked by a brake mechanism, the rotary electric device comprising:
a stator fixed to an engine main body;
a yoke including a bottom wall portion and a cylindrical portion which surrounds the stator, the yoke being formed in a bottomed cylindrical shape by connecting the bottom wall portion to one end of the cylindrical portion, and the yoke being connected to a crankshaft of the engine;
a magnet fixedly attached to an inner peripheral surface of the cylindrical portion of the yoke, and facing the stator; and
a cover having a bottomed cylindrical shape, and covering the yoke, wherein
the cover includes
a cover cylindrical portion concentrically surrounding an outer peripheral surface of the cylindrical portion of the yoke with an annular clearance interposed therebetween, and having an outer peripheral surface with which a brake shoe of the brake mechanism is capable of being placed in pressure contact, and
a cover bottom wall portion continuous to one end of the cover cylindrical portion, and connected to the bottom wall portion of the yoke,

a ventilation clearance communicating with the annular clearance is formed between the bottom wall portion of the yoke and the cover bottom wall portion, and
vent holes communicating the ventilation clearance with an outside of the yoke are provided through the bottom wall portion of the yoke and the cover bottom wall portion.
2. The rotary electric device for a power working machine according to claim 1, wherein a cooling fan for making cooling air forcedly flow in the annular clearance, the ventilation clearance and the vent holes is connected to an outer surface of the cover bottom wall portion.
3. The rotary electric device for a power working machine according to claim 1, wherein
the bottom wall portion of the yoke and the cover bottom wall portion are connected to each other with a hub interposed therebetween, and
a boss portion integrally included in the hub is connected to the crankshaft.
4. The rotary electric device for a power working machine according to claim 2, wherein
the bottom wall portion of the yoke and the cover bottom wall portion are connected to each other with a hub interposed therebetween, and
a boss portion integrally included in the hub is connected to the crankshaft.

1. A computer-implemented system comprising:
a processor that performs a join of two tables stored in a storage in pages processed in a column orientation wherein column values for all rows on a page are co-located in mini-pages within the page, the processor reducing inputoutput operations of the join by accessing only join columns and mini-pages containing join results; and
the processor that computes a join index by accessing only the join columns of input tables and uses the join index to compute a join result in a single read pass through the input tables.
2. The system according to claim 1 further comprising:
the processor that accesses only the join columns of the input tables, and computes a join index as a list of row identifier pairs wherein rows in a join result are represented by one pair of row identifiers, one row identifier from each table for which row join columns are equal; and
the processor that fetches pages and columns from the fetched pages for usage in computing the join result wherein rows are represented by one pair of row identifiers, the fetches being made only once.
3. The system according to claim 1 further comprising:
the processor that optimizes for fast random read page accesses wherein pages are read only once in non-sequential order and pages are written in sequential order.
4. The system according to claim 1 further comprising:
the processor that performs a one-pass join of a first table and a second table wherein both the first table and the second table fit in memory comprising:
building a hash table comprising reading a single join column of the second table;
probing the hash table comprising reading a single join column of the first table and probing the hash table for matching join columns from the second table;
retrieving projected columns of both the first and second tables for each matching pair of join columns; and
writing retrieved columns of both the first and second tables to a join result.
5. The system according to claim 1 further comprising:
the processor that performs a one-pass join over a second table and a separate pass over a first table wherein the first table does not fit in memory in combination with the second table comprising:
probing the hash table for each join result of a first table row identifier and a second table row identifier comprising:
reading values of projected columns of the first table indexed by the first table row identifier;
writing the projected values into a partition of the join result partitioned by the page identifiers of the second table; and
writing the second table row identifier into a partition of a temporary file of second table row identifiers; and
the processor that writes projected columns of the second table to a join result comprising:
reading values of projected columns of the second table indexed by the second table row identifier; and
writing the projected values into the partition of the join result.
6. The system according to claim 1 further comprising:
the processor that performs a two-pass join of a first table and a second table comprising:
partitioning the first and second tables on join columns wherein the first table and the second table are both read and written; and
computing a join result comprising reading each partition, computing, and writing the join result.
7. The system according to claim 1 further comprising:
the processor that performs a two-pass join of a first table and a second table comprising:
reading and partitioning a column of the second table using a hash function on join value;
reading and partitioning a column of the first table using the hash function;
computing a join index containing a first table row identifier and a second table row identifier for each partition;
merging partitions of the join index containing the first table row identifier and the second table row identifier for each partition into first table order, fetching projected columns of the first table, and writing projected values into a partition of a join result and second table row identifiers into a partition of a temporary file of second table row identifiers; and
writing probed columns of the second table to a join result.
8. The system according to claim 1 further comprising:
the processor that performs a two-pass join of a first table and a second table comprising:
reading and partitioning a join column of the second table using a hash function n join value;
reading and partitioning a join column of the first table using the hash function;
computing a join index containing a first table row identifier and a second table row identifier for each partition comprising:
reading the column of the second table and building a hash function;
reading a partition of the first table and probing the hash table; and
for each row in a join result, retrieving the projected columns from the first table and writing the projected values into a partition of the join result;
writing the second table row identifier into a partition of a temporary file of second table row identifiers; and
computing a final result comprising:
reading values of projected columns of the second table indexed by the second table row identifier; and
writing the projected values into the partition of the join result.
9. The system according to claim 1 further comprising:
the storage comprising a non-volatile store that supports fast page-based random accesses, the storage selected from a group consisting of a flash-based solid state drive, phase-change random access memory (PCRAM), ferro-electric random access memory (FeRAM), magneto-resistive random access memory (MRAM), and nano-random access memory (NRAM).
10. A non-transitory computer readable medium having stored thereon a computer executable program for processing data, the computer executable program when executed causes a computer system to:
perform a join of two tables stored in a storage in pages processed in a column orientation wherein column values for all rows on a page are co-located in mini-pages within the page;
reduce inputoutput operations of the join by accessing only join columns and mini-pages containing join results;
compute a join index by accessing only the join columns of input tables; and
use the join index to compute a join result in a single read pass through the input tables.
11. The non-transitory computer readable medium according to claim 10 further comprising the computer executable program for:
performing a join of a first table and a second table comprising;
building a hash table comprising reading a single join column of the second table;
probing the hash table comprising reading a single join column of the first table and probing the hash table for matching join columns from the second table;
retrieving projected columns of both the first and second tables for each matching pair of join columns; and
writing projected columns of both the first and second tables to a join result.
12. A computer-executed method of processing data comprising:
performing a join of two tables stored in a storage in pages processed in a column orientation wherein column values for all rows on a page are co-located in mini-pages within the page;
reducing inputoutput operations of the join by accessing only join columns and mini-pages containing join results;
computing a join index by accessing only the join columns of input tables; and
using the join index to compute a join result in a single read pass through the input tables.
13. The method according to claim 12 further comprising:
accessing only the join columns of the input tables;
computing a join index as a list of row identifier pairs wherein rows in a join result are represented by one pair of row identifiers, one row identifier from each table for which row join columns are equal; and
fetching pages and columns from the fetched pages for usage in computing the join result wherein rows are represented by one pair of row identifiers, the fetches being made only once.
14. The method according to claim 12 further comprising:
performing a join of a first table and a second table comprising:
building a hash table comprising reading a single join column of the second table;
probing the hash table comprising reading a single join column of the first table and probing the hash table for matching join columns from the second table;
retrieving projected columns of both the first and second tables for each matching pair of join columns; and
writing projected columns of both the first table and the second table to a join result.

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

We claim:

1. Process comprising at least one stage of polymerization or copolymerization of at least one monomer which can be polymerized or copolymerized by the radical route in the presence of a stable free radical and of an iniferter.
2. Process according to claim 1, characterized in that the iniferter can split into two free radicals under the effect of ultraviolet radiation.
3. Process according to claim 1, characterized in that it comprises at least one stage of polymerization or copolymerization by the photochemical route.
4. Process according to claim 3, characterized in that the stage by the photochemical route is carried out at a temperature ranging from 30 to 60 C.
5. Process according to claim 1, characterized in that it comprises at least one stage of polymerization or copolymerization by the thermal route.
6. Process according to claim 1, characterized in that the degree of conversion of monomer to polymer or copolymer is greater than 50%.
7. Process according to claim 1, characterized in that the temperature and the duration are sufficient to obtain a polymer or copolymer with a weight-average molecular mass of greater than 10,000.
8. Process according to claim 1, characterized in that the iniferter can be represented by the formula
R1SSR2
wherein the R1 and R2 groups, which can be identical or different, represent radicals comprising at least one carbon atom.
9. Process according to claim 8, characterized in that R1 and R2 are chosen from alkyl, aryl, aralkyl, alkylaryl, thiuram, xanthate and carbamoyl radicals.
10. Process according to claim 9, characterized in that the iniferter is tetraethylthiuram disulphide or tetramethylthiuram disulphide.
11. Process according to claim 1, characterized in that the iniferter is introduced into the polymerization or copolymerization mixture in the proportion of 0.001 mol % to 15 mol % of the sum of the number of moles of monomer and of iniferter.
12. Process according to claim 1, characterized in that the stable free radical comprises the group NO.
13. Process according to claim 1, characterized in that the molar ratio of the stable free radical to the iniferter ranges from 0.2 to 5 and in a more preferred way from 0.5 to 3.
14. Process according to claim 1, characterized in that at least one monomer is a vinylaromatic monomer.
15. Process according to claim 1, characterized in that at least one monomer is a diene.
16. Process according to claim 1, characterized in that at least one monomer is chosen from acrylates or methacrylates.
17. Product which can be represented by the formula A(X)nE, in which A represents a radical resulting from an iniferter, X represents one or more monomer units which can be different in nature, n represents a non-zero integer and E represents a radical resulting from a stable free radical, characterized in that the radical A is connected to a unit X via a sulphur atom.
18. Product according to claim 17, is characterized in that A can be represented by the formula R1S, in which R1 is chosen from alkyl, aryl, aralkyl, alkylaryl, thiuram, xanthate and carbamoyl radicals.
19. Product according to claim 17, is characterized in that X represents at least one vinylaromatic monomer unit.
20. Product according to claim 17, is characterized in that X represents at least one (meth)acrylic monomer unit.
21. Product according to claim 17, characterized in that E represents a radical resulting from a nitroxide.