Author: claimsbot

1. A method for reducing an amount of data needed to determine where, in a computer system, to render a geometry chunk, comprising:
receiving, at a graphics rendering device, data that define a bounding region that outlines a space the geometry chunk occupies, wherein an amount of the data that define the bounding region is less than an amount of data of the geometry chunk;
determining, at the graphics rendering device, whether the geometry chunk is associated with the graphics rendering device based on the data that define the bounding region;
receiving the data of the geometry chunk at the graphics rendering device if the geometry chunk is associated with the graphics rendering device; and
rendering, by the graphics rendering device, a subarea of a compositing window.
2. The method of claim 1, wherein the geometry chunk comprises at least one piece of geometry and the geometry chunk is configured to be communicated by a graphics application as a unit.
3. The method of claim 2, wherein the data of the geometry chunk include graphics data that define each of the at least one piece of geometry, a number of the each of the at least one piece of geometry, and a position of the each of the at least one piece of geometry.
4. The method of claim 3, wherein the graphics data that define the each of the at least one piece of geometry are stored in at least one of a display list, a vertex array object, and buffered vertices.
5. The method of claim 1, wherein the graphics rendering device is assigned to a subarea of a compositing window and the determining, from the data that define the bounding region, if the geometry chunk is associated with the graphics rendering device comprises determining at least one of if the subarea contains the bounding region, if the bounding region contains the subarea, and if the bounding region overlaps the subarea.
6. The method of claim 1, wherein the graphics rendering device is one of a plurality of graphics rendering devices and the plurality of graphics rendering devices are configured for spatial compositing.
7. The method of claim 1, further comprising:
calculating the data that define the bounding region;
storing the data that define the bounding region for use in processing the geometry chunk at a subsequent time; and
determining, at the subsequent time, if the bounding region for the geometry chunk has been calculated.
8. A method for reducing an amount of data needed to determine where, in a computer system, to render a geometry chunk, comprising:
determining, at a processor, whether the geometry chunk is associated with a graphics rendering device based on data that define a bounding region that outlines a space the geometry chunk occupies, wherein an amount of the data that define the bounding region is less than an amount of data of the geometry chunk;
communicating the data of the geometry chunk to the graphics rendering device if the geometry chunk is associated with the graphics rendering device;
communicating, to the graphics rendering device, the data that define the bounding region that outlines the space the geometry chunk occupies; and
rendering, by the graphics rendering device, a subarea of a compositing window.
9. The method of claim 8, wherein the geometry chunk comprises at least one piece of geometry and the geometry chunk is configured to be communicated by a graphics application as a unit.
10. The method of claim 9, wherein the data of the geometry chunk include graphics data that define each of the at least one piece of geometry, a number of the each of the at least one piece of geometry, and a position of the each of the at least one piece of geometry.
11. The method of claim 10, wherein the graphics data that define the each of the at least one piece of geometry are stored in at least one of a display list, a vertex array object, and buffered vertices.
12. The method of claim 8, wherein the graphics rendering device is assigned to a subarea of a compositing window and the determining, from the data that define the bounding region, if the geometry chunk is associated with the graphics rendering device comprises determining at least one of if the subarea contains the bounding region, if the bounding region contains the subarea, and if the bounding region overlaps the subarea.
13. The method of claim 8, wherein the graphics rendering device is one of a plurality of graphics rendering devices and the plurality of graphics rendering devices are configured for spatial compositing.
14. The method of claim 8, further comprising:
calculating the data that define the bounding region;
storing the data that define the bounding region for use in processing the geometry chunk at a subsequent time; and
determining, at the subsequent time, if the bounding region for the geometry chunk has been calculated.
15. An apparatus for reducing an amount of data needed to determine where, in a computer system, to render a geometry chunk, comprising:
a bus configured to communicate data that define a bounding region that outlines a space the geometry chunk occupies, wherein an amount of the data that define the bounding region is less than an amount of data of the geometry chunk; and
a graphics rendering device configured to receive the data that define the bounding region and to determine, from the data that define the bounding region, whether the geometry chunk is associated with the graphics rendering device,
wherein the bus is further configured to communicate the data of the geometry chunk to the graphics rendering device if the geometry chunk is associated with the graphics rendering device and the graphics rendering device is further configured to render a subarea of a compositing window.
16. The apparatus of claim 15, wherein the geometry chunk comprises at least one piece of geometry and the geometry chunk is configured to be communicated by a graphics application as a unit.
17. The apparatus of claim 16, wherein the data of the geometry chunk include graphics data that define each of the at least one piece of geometry, a number of the each of the at least one piece of geometry, and a position of the each of the at least one piece of geometry.
18. The apparatus of claim 17, wherein the graphics data that define the each of the at least one piece of geometry are stored in at least one of a display list, a vertex array object, and buffered vertices.
19. The apparatus of claim 15, wherein the graphics rendering device is further configured to be assigned to a subarea of a compositing window and to determine, from the data that define the bounding region, at least one of if the subarea contains the bounding region, if the bounding region contains the subarea, and if the bounding region overlaps the subarea.
20. The apparatus of claim 15, wherein the graphics rendering device is one of a plurality of graphics rendering devices and the plurality of graphics rendering devices are configured for spatial compositing.
21. The apparatus of claim 15, further comprising:
a processor configured to calculate the data that define the bounding region and to determine if the bounding region for the geometry chunk has been calculated; and
a memory configured to store the data that define the bounding region for use in processing the geometry chunk at a subsequent time.
22. An apparatus for reducing an amount of data needed to determine where, in a computer system, to render a geometry chunk, comprising:
a graphics rendering device configured to determine, from data that define a bounding region that outlines a space the geometry chunk occupies, whether the geometry chunk is associated with the graphics rendering device, wherein an amount of the data that define the bounding region is less than an amount of data of the geometry chunk; and
a bus configured to communicate the data of the geometry chunk to the graphics rendering device if the geometry chunk is associated with the graphics rendering device,
wherein the bus is further configured to communicate, to the graphics rendering device, the data that define the bounding region that outlines the space the geometry chunk occupies and the graphics rendering device is further configured to render a subarea of a compositing window.
23. The apparatus of claim 22, wherein the geometry chunk comprises at least one piece of geometry and the geometry chunk is configured to be communicated by a graphics application as a unit.
24. The apparatus of claim 23, wherein the data of the geometry chunk include graphics data that define each of the at least one piece of geometry, a number of the each of the at least one piece of geometry, and a position of the each of the at least one piece of geometry.
25. The apparatus of claim 24, wherein the graphics data that define the each of the at least one piece of geometry are stored in at least one of a display list, a vertex array object, and buffered vertices.
26. The apparatus of claim 22, wherein the graphics rendering device is further configured to be assigned to a subarea of a compositing window and to determine, from the data that define the bounding region, at least one of if the subarea contains the bounding region, if the bounding region contains the subarea, and if the bounding region overlaps the subarea.
27. The apparatus of claim 22, wherein the graphics rendering device is one of a plurality of graphics rendering devices and the plurality of graphics rendering devices are configured for spatial compositing.
28. The apparatus of claim 22, further comprising:
a processor configured to calculate the data that define the bounding region and to determine if the bounding region for the geometry chunk has been calculated; and
a memory configured to store the data that define the bounding region for use in processing the geometry chunk at a subsequent time.
29. A tangible computer-readable storage medium having computer program code stored thereon, the computer program code comprising:
a first program code for causing a computer to communicate, to a graphics rendering device, data that define a bounding region that outlines a space a geometry chunk occupies, wherein an amount of the data that define the bounding region is less than an amount of data of the geometry chunk;
a second program code for causing the computer to determine, from the data that define the bounding region, whether the geometry chunk is associated with the graphics rendering device;
a third program code for causing the computer to communicate the data of the geometry chunk to the graphics rendering device if the geometry chunk is associated with the graphics rendering device; and
a fourth program code for causing the computer to render, by the graphics rendering device, a subarea of a compositing window.
30. The computer-readable storage medium of claim 29, the computer program code further comprising:
a fifth program code for causing the computer to calculate the data that define the bounding region;
a sixth program code for causing the computer to store the data that define the bounding region for use in processing the geometry chunk at a subsequent time; and
a seventh program code for causing the computer to determine, at the subsequent time, if the bounding region for the geometry chunk has been calculated.
31. A tangible computer-readable storage medium having computer program code stored thereon, the computer program code comprising:
a first program code for causing a computer to determine, from data that define a bounding region that outlines a space the geometry chunk occupies, whether the geometry chunk is associated with a graphics rendering device, wherein an amount of the data that define the bounding region is less than an amount of data of the geometry chunk;
a second program code for causing the computer to communicate the data of the geometry chunk to the graphics rendering device if the geometry chunk is associated with the graphics rendering device;
a third program code for causing the computer to communicate, to the graphics rendering device, the data that define the bounding region that outlines the space the geometry chunk occupies; and
a fourth program code for causing the computer to render, by the graphics rendering device, a subarea of a compositing window.
32. The computer-readable storage medium of claim 31, the computer program code further comprising:
a fifth program code for causing the computer to calculate the data that define the bounding region;
a sixth program code for causing the computer to store the data that define the bounding region for use in processing the geometry chunk at a subsequent time; and
a seventh program code for causing the computer to determine, at the subsequent time, if the bounding region for the geometry chunk has been calculated.

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 providing improved thickness control of a workpiece formed by impact forming, an impact forming device including an upper die and a lower die, the lower die being configured and disposed for receiving the workpiece thereon, the workpiece being heated to a predetermined first temperature that is above the upper die temperature, the lower die temperature, and the impact temperature of the workpiece, the upper die operatively connected to a ram for directing the upper die into a controlled impact with the lower die with the heated workpiece interposed therebetween to effect the impact forming of the workpiece, the steps comprising:
determining a precise relationship between a finished thickness of the workpiece, the temperature of the workpiece and period of time that the workpiece is in contact with the lower die prior to impact with the upper die to achieve the particular workpiece thickness;
placing the workpiece on the lower die;
actuating the ram within the period of time to effect the controlled impact of the upper and the lower die in response to the precise relationship (within the period of time).
2. The method of claim 1 wherein the thickness of the workpiece is within about 0.0015 inches from a nominal thickness.
3. The method of claim 1 wherein the precise relationship further includes the effects of die deformation.
4. The method of claim 1 wherein the precise relationship can be modified to achieve the desired thickness control.
5. The method of claim 4 wherein the precise relationship can be modified manually.
6. The method of claim 4 wherein the precise relationship can be modified automatically.
7. The method of claim 1 wherein the workpiece is a thin part.
8. The method of claim 7 wherein the thin part has a significant amount of edge thickness of about 0.10 inches or less, the edge thickness being critical to the successful operation of the part.
9. The method of claim 8 wherein the thin part has an edge thickness of about 0.050 inches.
10. The method of claim 1, wherein the step of actuating the ram is prevented when the precise relationship cannot be satisfied.

1. A digital television (DTV) transmitting system for processing broadcast data, the DTV transmitting system comprising:
a pre-processor configured to pre-process enhanced data and to output enhanced data packets including a known data sequence;
a multiplexer configured to multiplex the enhanced data packets with main data packets;
a first Reed-Solomon (RS) encoder configured to code the multiplexed data packets by adding systematic parity data to each main data packet and adding first non-systematic parity data to each enhanced data packet;
a trellis encoding module configured to perform trellis encoding on the RS-encoded main and enhanced data packets, wherein the trellis encoding module is configured to generate initialization data to initialize at least one of memories included in the trellis encoding module when the known data sequence is inputted from the first RS encoder;
a second Reed-Solomon (RS) encoder configured to remove the first parity data from an enhanced data packet outputted from the first RS encoder and including the known data sequence, to replace a portion of the known data sequence with the initialization data, and generating second non-systematic parity data based on the enhance data packet including the replaced initialization data; and
a parity replacer configured to replace the first parity data in an enhanced data packet outputted from the first RS encoder with the second parity data.
2. The DTV transmitting system of claim 1, wherein the trellis encoding module comprises:
a trellis encoder having the plurality of memories for performing trellis encoding on the RS-encoded main and enhanced data packets; and
an initialization data generator configured to generate the initialization data required to initialize at least one of the memories.
3. The DTV transmitting system of claim 2, wherein the portion of the known data sequence replaced with the initialization data is initialization data location holders.
4. The DTV transmitting system of claim 2, wherein the trellis encoder comprises:
a first and a second memory configured to perform trellis encoding on a lower input bit and to output a first and a second encoded bit; and
a third memory configured to perform pre-coding on a upper input bit and to output a third encoded bit, wherein the first and second memories are initialized when the known data sequence is inputted to the trellis encoding module from the first RS encoder.
5. The DTV transmitting system of claim 2, wherein the trellis encoder comprises:
a first and a second memory configured to perform trellis encoding on a lower input bit and to output a first and a second encoded bit; and
a third memory configured to perform pre-coding on a upper input bit and to output a third encoded bit, wherein the first, second, and third memories are initialized when the known data sequence is inputted to the trellis encoding module from the first RS encoder.
6. The DTV transmitting system of claim 1, further comprising an interleaver configured to interleave the enhanced data packet outputted from the first RS encoder and to output the interleaved data packet to the parity replacer and the second RS encoder.
7. A method of processing broadcast data in a digital television (DTV) transmitting system, the method comprising:
pre-processing enhanced data and generating enhanced data packets including a known data sequence;
multiplexing the enhanced data packets with main data packets;
Reed-Solomon (RS) coding the multiplexed data packets in a first RS encoder by adding systematic parity data to each main data packet and adding first non-systematic parity data to each enhanced data packet;
performing trellis encoding on the RS-coded data packets in a trellis encoding module;
generating initialization data to initialize at least one of memories included in the trellis encoding module when the known data sequence is inputted to the trellis encoding module;
removing the first parity data from an enhanced data packet outputted from the first RS encoder and including the known data sequence, replacing a portion of the known data sequence with the initialization data, and generating second non-systematic parity data in a second RS encoder based on the enhanced data packet including the replaced initialization data; and
replacing the first parity data in the enhanced data packet outputted from the first RS encoder with the second parity data.
8. The method of claim 7, wherein the portion of the known data sequence replaced with the initialization data is initialization data location holders.
9. The method of claim 7, wherein performing trellis encoding on the RS-coded data packets in a trellis encoding module comprises:
performing trellis encoding on a lower input bit to generate a first and second encoded bit using a first and a second memory; and
performing pre-coding on an upper input bit and to output a third encoded bit, wherein the first and second memories are initialized when the known data sequence is inputted to the trellis encoding module.
10. The method of claim 7, wherein performing trellis encoding on the RS-coded data packets in a trellis encoding module comprises:
performing trellis encoding on a lower input bit to generate a first and second encoded bit using a first and a second memory; and
performing pre-coding on an upper input bit and to output a third encoded bit, wherein the first, second, and third memories are initialized when the known data sequence is inputted to the trellis encoding module.
11. A digital television (DTV) receiving system for processing broadcast data, the DTV receiving system comprising:
a first known data detector configured to detect a location of a first known data sequence in a broadcast signal by calculating a first correlation value between the broadcast signal and a first reference known data sequence;
a second known data detector configured to detect a location of a second known data sequence in the broadcast signal by calculating a second correlation value between the broadcast signal and a second reference known data sequence; and
a first selector configured to select the location information detected by one of the first and second known data detectors with a greater correlation value.
12. The DTV receiving system of claim 11, wherein the first reference known data sequence is a known data sequence generated based on an assumption that an initial state of a memory included in a trellis encoder of a transmitting system for pre-coding is 0, and the second reference known data sequence is a known data sequence generated based on an assumption that the initial state of the memory is 1.
13. The DTV receiving system of claim 11, wherein the first known data detector further estimates a first frequency offset value based on the first correlation value, and the second known data detector further estimates a second frequency offset value based on the second correlation value.
14. The DTV receiving system of claim 11, wherein the selector compares peak values of the first and second correlation values and selects the location information detected by one of the first and second known data detectors with a greater peak value.
15. The DTV receiving system of claim 11, wherein each of the first and second known data detectors comprises:
a plurality of partial correlation units, each of which decimates data in the broadcast signal with a rate of 1N for a corresponding sampling phase and calculating a correlation value and a frequency offset value of the decimated data; and
a second selector configured to determine the location of the first or second known data sequence by selecting a maximum correlation value of the decimated data.
16. The DTV receiving system of claim 15, wherein each partial correlation unit comprises a partial correlator divides a reference known data sequence into a plurality of sections, calculates a correlation value between each divided section with a corresponding portion of the broadcast signal.
17. A method of processing broadcast data in a digital television (DTV) receiving system, the method comprising:
detecting a location of a first known data sequence in a broadcast signal by calculating a correlation value between the broadcast signal and a first reference known data sequence;
detecting a location of a second known data sequence in the broadcast signal by calculating a correlation value between the broadcast signal and a second reference known data sequence; and
selecting the location of one of the first or second known data sequence having a greater correlation value.
18. The method of claim 17, wherein the first reference known data sequence is a known data sequence generated based on an assumption that an initial state of a memory included in a trellis encoder for pre-coding is 0, and the second reference known data sequence is a known data sequence generated based on an assumption that the initial state of the memory is 1.
19. The method of claim 17, wherein further comprising:
estimating a first frequency offset value based on the first correlation value; and
estimating a second frequency offset value based on the second correlation value.
20. The method of claim 17, wherein selecting the location of the first or second known data sequence having a greater correlation value comprises:
comparing peak values of the first and second correlation values; and
selecting the location of one of the first or second data sequence with a greater peak value.
21. The method of claim 17, wherein detecting a location of a first known data sequence in a broadcast signal comprises:
decimating data in the broadcast signal with a rate of 1N for each sampling phase and calculating a correlation value and a frequency offset value of the decimated data; and
determining the location of the first known data sequence by selecting a maximum correlation value of the decimated data.
22. The method of claim 17, wherein detecting a location of a second known data sequence in the broadcast signal comprises:
decimating data in the broadcast signal with a rate of 1N for each sampling phase and calculating a correlation value and a frequency offset value of the decimated data; and
determining the location of the second known data sequence by selecting a maximum correlation value of the decimated data.

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. An electrode device for an electrochemical sensor chip for electrically connecting an analyte to electrodes formed on a surface of a transducer, comprising:
an insulation sheet having an insulating property and including a top surface and a bottom surface opposite to each other in a thickness direction; and
electrode members having a conductivity and held by the insulation sheet with the electrode members piercing the insulation sheet in a thickness direction, one ends of the electrode members located on the top surface side of the insulation sheet being connected to the analyte, the other ends located on the bottom surface side of the insulation sheet being connected to the electrodes of the transducer.
2. The electrode device for an electrochemical sensor chip according to claim 1, wherein the other ends of the electrode members each have a projecting portion protruding from the bottom surface of the insulation sheet.
3. The electrode device for an electrochemical sensor chip according to claim 2, wherein at least the projecting portion of the electrode members has elasticity.
4. The electrode device for an electrochemical sensor chip according to claim 1, wherein the insulation sheet has elasticity.
5. The electrode device for an electrochemical sensor chip according to claim 4, wherein the bottom surface of the insulation sheet has an adhesion.
6. The electrode device for an electrochemical sensor chip according to claim 1, wherein the electrode members are in intimate contact with the insulation sheet so that a liquid sample containing the analyte does not leak to the bottom surface side of the insulation sheet.
7. The electrode device for an electrochemical sensor chip according to claim 1, wherein the one ends of the electrode members are covered by a conductive biocompatible coating.
8. The electrode device for an electrochemical sensor chip according to claim 1, further comprising a liquid reservoir member provided on a periphery of the top surface of the insulation sheet.
9. The electrode device for an electrochemical sensor chip according to claim 1, further comprising a rigid frame attached to a periphery of the bottom surface of the insulation sheet.