Author: claimsbot

1. A speech synthesis dictionary creation apparatus for creating speech synthesis dictionaries containing pitch mark data for use in performing speech synthesis by using pitch marks, the apparatus comprising:
first recording means for recording an inter-pitch-mark distance between the first two pitch marks of a voiced portion of speech data to be processed into data for speech synthesis dictionaries;
calculation means for calculating a difference between adjacent inter-pitch-mark distances, which are obtained by calculating distances between adjacent pitch-mark positions; and
second recording means for recording the calculation results obtained by said calculation means in the speech synthesis dictionaries,
wherein the speech synthesis dictionaries are accessed to generate and output synthesized speech.
2. The apparatus according to claim 1, further comprising counting means for counting the number of pitch marks of the voiced portion, and
when the number of pitch marks is counted by said counting means, said second recording means stores the number of pitch marks in a file and manages the number of pitch marks.
3. The apparatus of claim 1, wherein the speech synthesis dictionaries further contain speech data.
4. A method for creating speech synthesis dictionaries containing pitch mark data for use in performing speech synthesis by using pitch marks, the method comprising:
a first recording step for recording an inter-pitch-mark distance between the first two pitch marks of a voiced portion of speech data to be processed into data for speech synthesis dictionaries;
a calculation step for calculating a difference between adjacent inter-pitch-mark distances, which are obtained by calculating distances between adjacent pitch-mark positions; and
a second recording step for recording the calculation results obtained in said calculation step in the speech synthesis dictionaries,
wherein the speech synthesis dictionaries are accessed to generate and output synthesized speech.
5. The method according to claim 4, further comprising a counting step of counting the number of pitch marks of the voiced portion, and
when the number of pitch marks is counted in said counting step, said second recording step stores the number of pitch marks in a file and manages the number of pitch marks.
6. The method of claim 4, wherein the speech synthesis dictionaries further contain speech data.
7. A computer-readable medium storing executable program codes for creating speech synthesis dictionaries, the speech synthesis dictionaries containing pitch mark data for use in performing speech synthesis by using pitch marks, causing a computer to perform the steps comprising:
a first recording step for recording an inter-pitch-mark distance between the first two pitch marks of a voiced portion of speech data to be processed into data for speech synthesis dictionaries;
a calculating step for calculating a difference between adjacent inter-pitch-mark distances, which are obtained by calculating distances between adjacent pitch-mark positions; and
a second recording step for recording the calculation results obtained in said calculating step in the speech synthesis dictionaries.
8. The computer-readable medium of claim 7, wherein the speech synthesis dictionaries further contain speech data.
9. A pitch-mark-data file creation apparatus for creating pitch-mark-data files from speech data, the apparatus comprising:
computer processing means for processing speech data, said computer processing means comprising:
(i) a memory for storing data, including speech data and a pitch-mark-data file, the speech data comprising a voiced portion having pitch marks;
(ii) first determination means for accessing the speech data from said memory and determining inter-pitch-mark distances between adjacent pitch marks of the voiced portion of the speech data;
(iii) first recording means for recording in the pitch-mark-data file a first inter-pitch-mark distance between the first two pitch marks of the voiced portion;
(iv) second determination means for determining a difference between the first inter-pitch-mark distance and a second inter-pitch-mark distance determined by said first determination means; and
(v) second recording means for recording in the pitch-mark-data file the difference determined by said second determination means,
wherein pitch marks of the voiced portion of the speech data can be determined from the first inter-pitch-mark distance determined by said first determination means and the difference determined by said second determination means.
10. The apparatus according to claim 9, further comprising counting means for counting the number of pitch marks of the voiced portion,
wherein said second recording means stores in the pitch-mark-data file the number of pitch marks counted by said counting means.
11. A pitch-mark-data file creation method for an information processing apparatus, the information processing apparatus comprising computer processing means for implementing the method and a memory storing speech data and a pitch-mark-data file, the speech data comprising a voiced portion having pitch marks, the method comprising:
(i) a first determination step of accessing the speech data from the memory and determining inter-pitch-mark distances between adjacent pitch marks of the voiced portion of the speech data;
(ii) a first recording step of recording in the pitch-mark-data file a first inter-pitch-mark distance between the first two pitch marks of the voiced portion;
(iii) a second determination step of determining a difference between the first inter-pitch-mark distance and a second inter-pitch-mark distance determined in said first determination step; and
(iv) a second recording step of recording in the pitch-mark-data file the difference determined in said second determination step,
wherein pitch marks of the voiced portion of the speech data can be determined from the first inter-pitch-mark distance determined in said first determination step and the difference determined in said second determination step.
12. The method according to claim 11, further comprising a counting step of counting the number of pitch marks of the voiced portion,
wherein said recording step further comprises recording in the pitch-mark-data file the number of pitch marks counted in said counting step.
13. A computer-readable medium storing executable program codes for creating pitch-mark-data files for use in performing speech synthesis by using pitch marks, causing a computer to perform the steps comprising:
(i) a first determination step of accessing speech data from a memory and determining inter-pitch-mark distances between adjacent pitch marks of a voiced portion of the speech data;
(ii) a first recording step of recording in a pitch-mark-data file a first inter-pitch-mark distance between the first two pitch marks of the voiced portion;
(iii) a second determination step of determining a difference between the first inter-pitch-mark distance and a second inter-pitch-mark distance determined in said first determination step; and
(iv) a second recording step of recording in the pitch-mark-data file the difference determined in said second determination step,
wherein pitch marks of the voiced portion of the speech data can be determined from the first inter-pitch-mark distance determined in said first determination step and the difference determined in said second determination step.

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, comprising:
executing, via a processor, a tree traversal operation for a tree data structure, wherein each node in the tree data structure is classified into one of a plurality of nodesets, the plurality of nodesets corresponding to a plurality of local coordinate systems;
receiving, at the processor, a transformation node during the tree traversal operation, wherein the transformation node includes transformation data; and
transforming, by the processor, spatial data included in a query data structure based on the transformation data.
2. The method of claim 1, wherein the tree data structure represents a bounding volume hierarchy (BVH).
3. The method of claim 1, further comprising:
receiving the tree data structure at the processor;
classifying, by the processor, the nodes of the tree data structure into the plurality of nodesets;
selecting, by the processor, a local coordinate system for each nodeset; and
adding at least one transformation node to the tree data structure, each transformation node in the at least one transformation node including transformation data that represents a transformation from one coordinate system into another coordinate system.
4. The method of claim 3, wherein selecting the local coordinate system for each nodeset comprises calculating a geometric center of a set of bounding volumes associated with the nodes in the nodeset, wherein the geometric center is selected as the origin of the local coordinate system.
5. The method of claim 4, wherein selecting the local coordinate system for each nodeset further comprises calculating a scale factor that represents a difference in scale between a global coordinate system and the local coordinate system.
6. The method of claim 3, wherein classifying the nodes of the tree data structure into the plurality of nodesets comprises:
creating an initial proposed classification for the nodes by classifying all nodes in the tree data structure into a single nodeset;
evaluating a cost function for each nodeset in the proposed classification to calculate a set of cost values;
determining that at least one nodeset in the proposed classification did not meet the acceptance criterion; and
adjusting the proposed classification of the nodes into one or more new nodesets, evaluating the cost function for each nodeset in the adjusted proposed classification, and determining whether each of the nodesets in the adjusted proposed classification meets the acceptance criterion.
7. The method of claim 6, wherein adjusting the proposed classification of the nodes comprises, for each nodeset that does not meet the acceptance criterion:
classifying the root node of the nodeset into a top-level nodeset; and
splitting the nodeset into multiple lower-level nodesets, where each nodeset in the multiple lower-level nodesets corresponds to a subtree associated with a child node of the root node.
8. The method of claim 6, wherein the cost function estimates the expected number of additional intersection tests that need to be performed due to conservative rounding.
9. The method of claim 1, wherein transforming spatial data included in the query data structure based on the transformation data comprises transforming the spatial data such that the spatial data is specified relative to a local coordinate system associated with a nodeset connected to the transformation node.
10. The method of claim 1, wherein the processor comprises a parallel processing unit that includes at least one tree traversal unit configured to perform, at least in part, the tree traversal operation.
11. A non-transitory computer-readable storage medium storing instructions that, when executed by a processor, cause the processor to perform steps comprising:
executing a tree traversal operation for a tree data structure, wherein each node in the tree data structure is classified according to one of a plurality of nodesets, the plurality of nodesets corresponding to a plurality of local coordinate systems;
receiving a transformation node during the tree traversal operation, wherein the transformation node includes transformation data; and
transforming spatial data included in a query data structure based on the transformation data.
12. The non-transitory computer-readable storage medium of claim 11, the steps further comprising:
receiving the tree data structure at the processor;
classifying, by the processor, the nodes of the tree data structure into the plurality of nodesets;
selecting, by the processor, a local coordinate system for each nodeset; and
adding at least one transformation node to the tree data structure, each transformation node in the at least one transformation node including transformation data that represents a transformation from one coordinate system into another coordinate system.
13. The non-transitory computer-readable storage medium of claim 12, wherein selecting the local coordinate system for each nodeset comprises calculating a geometric center of a set of bounding volumes associated with the nodes in the nodeset, wherein the geometric center is selected as the origin of the local coordinate system.
14. The non-transitory computer-readable storage medium of claim 13, wherein selecting the local coordinate system for each nodeset further comprises calculating a scale factor that represents a difference in scale between a global coordinate system and the local coordinate system.
15. The non-transitory computer-readable storage medium of claim 12, wherein classifying the nodes of the tree data structure into the plurality of nodesets comprises:
creating an initial proposed classification for the nodes by classifying all nodes in the tree data structure into a single nodeset;
evaluating a cost function for each nodeset in the proposed classification to calculate a set of cost values;
determining that at least one nodeset in the proposed classification did not meet the acceptance criterion; and
adjusting the proposed classification of the nodes into one or more new nodesets, evaluating the cost function for each nodeset in the adjusted proposed classification, and determining whether each of the nodesets in the adjusted proposed classification meets the acceptance criterion.
16. The method of claim 15, wherein adjusting the proposed classification of the nodes comprises, for each nodeset that does not meet the acceptance criterion:
classifying the root node of the nodeset into a top-level nodeset; and
splitting the nodeset into multiple lower-level nodesets, where each nodeset in the multiple lower-level nodesets corresponds to a subtree associated with a child node of the root node
17. A system, comprising:
a parallel processing unit that includes at least one tree traversal unit configured to:
execute a tree traversal operation for a tree data structure, wherein each node in the tree data structure is classified according to one of a plurality of nodesets, the plurality of nodesets corresponding to a plurality of local coordinate systems,
receive a transformation node during the tree traversal operation, wherein the transformation node includes transformation data, and
transform spatial data included in a query data structure based on the transformation data.
18. The system of claim 17, the parallel processing unit further configured to:
receive the tree data structure;
classify the nodes of the tree data structure into the plurality of nodesets;
select a local coordinate system for each nodeset; and
add at least one transformation node to the tree data structure, each transformation node in the at least one transformation node including transformation data that represents a transformation from one coordinate system into another coordinate system.
19. The system of claim 18, wherein classifying the nodes of the tree data structure into the plurality of nodesets comprises:
creating an initial proposed classification for the nodes by classifying all nodes in the tree data structure into a single nodeset;
evaluating a cost function for each nodeset in the proposed classification to calculate a set of cost values;
determining that at least one nodeset in the proposed classification did not meet the acceptance criterion; and
adjusting the proposed classification of the nodes into one or more new nodesets, evaluating the cost function for each nodeset in the adjusted proposed classification, and determining whether each of the nodesets in the adjusted proposed classification meets the acceptance criterion.
20. The system of claim 17, wherein the tree traversal operation is executed, at least in part, by a tree traversal unit in the parallel processing unit, and wherein a setup unit within the tree traversal unit is configured to transform the spatial data included in the query data structure.

1. A method comprising:
receiving an inquiry with a parameter from a user, wherein the inquiry is associated with a sale of an item;
identifying, by a processor, a discount item that satisfies the inquiry, the discount item having a discount price;
identifying a comparable item for the discount item at a nondiscount rate using real-time data wherein the comparable item is not available for sale;
identifying, by the processor, a sales opacity scale, wherein the sales opacity scale is determined independent of input from the user, wherein the sales opacity scale is associated with how much information is presented about the discount item;
presenting the discount price and a comparable group to the user, the comparable group comprising the discount item presented according to an opacity level based on the sales opacity scale and the comparable item to yield a presented comparable group, wherein the presented comparable group does not identify which item of the comparable group is available at the discount price;
receiving from the user a commitment to purchase based on the presented comparable group; and
disclosing the discount item to the user after receiving the commitment.
2. The method of claim 1, further comprising:
receiving comparable item parameters from the user; and
updating the presented comparable group based on the comparable item parameters.
3. The method of claim 1, wherein the sales opacity scale is time-sensitive and is configured to reveal additional details regarding the discount item as time progresses.
4. The method of claim 1, wherein presenting the comparable group to the user further comprises presenting details describing an item in the presented comparable group according to the sales opacity scale.
5. The method of claim 1, wherein the discount item and the comparable item comprise at least one of a product and a service.
6. The method of claim 1, further comprising:
allowing the user to select a number of items in the presented comparable group; and
quoting a nondiscount price for each of the number of items in the presented comparable group.
7. The method of claim 1, wherein each item in the presented comparable group is quoted at a nondiscount price.
8. The method of claim 1, wherein items in the presented comparable group are not identified to the user as one of the discount item and the comparable item until after the sale.
9. The method of claim 8, wherein items in the presented comparable group are not identified to the user as one of the discount item and the comparable item until a predetermined time after the sale.
10. The method of claim 8, further comprising:
determining a number of items that can be removed from the presented comparable group that ensures that the discount item remains; and
presenting the user with an option to remove any number of items up to the number of items that can be removed from the presented comparable group.
11. The method of claim 8, further comprising:
before receiving user input, offering the user an option to terminate a sales process at a later point for one of free and in exchange for a fee.
12. The method of claim 1, wherein the comparable group is generated by:
creating an array of all discount items and an array of all comparable items;
identifying each discount item in the array of all discount items which satisfies the parameter from the user;
creating a subset of comparable items for each identified discount item, each subset based on at least one attribute of each respective discount item; and
combining each discount item with its respective comparable items into the comparable group.
13. The method of claim 12, further comprising:
filtering each of the subsets of comparable items using a filter parameter.
14. The method of claim 13, wherein the filter parameter can be expanded when insufficient comparable items are returned after the subsets of comparable items are filtered.
15. The method of claim 12, wherein a subset is sorted based on an attribute value associated with a content of the subset.
16. The method of claim 1, further comprising:
receiving a request from the user for multiple sub-items associated with the discount item; and
engaging in a dialog with the user to enable payment for each of the multiple sub-items with one of multiple payment types.
17. A system for conducting sales, the system comprising:
a processor; and
a non-transitory computer-readable storage medium having stored therein instructions which, when executed by the processor, cause the processor to perform a method comprising:
receiving an inquiry with a parameter from a user, wherein the inquiry is associated with a sale of an item;
identifying a discount item that satisfies the inquiry, the discount item having a discount price;
identifying a comparable item for the discount item at a nondiscount rate using real-time data, wherein the comparable item is not available for sale;
identifying a sales opacity scale, wherein the sales opacity scale is determined independent of input from the user, wherein the sales opacity scale is associated with how much information is presented about the discount item;
presenting the discount price and a comparable group to the user, the comparable group comprising the discount item presented according to an opacity level based on the sales opacity scale and comparable item to yield a presented comparable group, wherein the presented comparable group does not identify which item of the comparable group is available at the discount price;
receiving from the user a commitment to purchase based on the presented comparable group; and
disclosing the discount item to the user after receiving the commitment.
18. The system of claim 17, wherein the sales opacity scale is time-sensitive and is configured to reveal additional details regarding the discount item as time progresses.
19. A non-transitory computer-readable storage medium having stored therein instructions which, when executed by a processor, cause the processor to perform a method comprising:
receiving an inquiry with a parameter from a user, wherein the inquiry is associated with a sale of an item;
identifying a discount item that satisfies the inquiry, the discount item having a discount price;
identifying a comparable item for the discount item at a nondiscount rate using real-time data, wherein the comparable item is not available for sale;
identifying a sales opacity scale, wherein the sales opacity scale is determined independent of input from the user, wherein the sales opacity scale is associated with how much information is presented about the discount item;
presenting the discount price and a comparable group to the user, the comparable group comprising the discount item presented according to an opacity level based on the sales opacity scale and the comparable item to yield a presented comparable group, wherein the presented comparable group does not identify which item of the comparable group is available at the discount price;
receiving from the user a commitment to purchase based on the presented comparable group; and
disclosing the discount item to the user after receiving the commitment.
20. The non-transitory computer-readable storage medium of claim 19, wherein the sales opacity scale is time sensitive and is configured to reveal additional details regarding the discount item as time progresses, and wherein presenting the comparable group to the user further comprises presenting details describing an item in the comparable group according to the sales opacity scale.

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 of manufacturing a thin film transistor array panel, the method comprising:
forming a gate line on a substrate;
forming a first insulating layer on the gate line;
forming a semiconductor layer on the first insulating layer;
forming a data line and a drain electrode on the semiconductor layer;
depositing a passivation layer on the data line and the drain electrode;
forming a photoresist on the passivation layer;
etching the passivation layer and the first insulating layer using the photoresist as a mask to expose portions of the drain electrode and at least a part of the substrate;
partially removing an exposed portion of the drain electrode;
depositing a conductive film; and
removing the photoresist to form a pixel electrode connected to the exposed portion of the drain electrode.
2. The method of claim 1, wherein the photoresist is formed by using a photo mask including a light blocking area and a light transmitting area.
3. The method of claim 1, wherein the removing of the drain electrode comprises dry etching.
4. The method of claim 3, wherein the removing of the drain electrode uses a Cl2O2-containing gas.
5. The method of claim 1, wherein the removing of the drain electrode comprises wet etching.
6. The method of claim 1, wherein the exposed portion of the drain electrode has a length of at least 7.5 \u03bcm.
7. The method of claim 1, wherein a distance between the gate line and the drain electrode is at least 6 \u03bcm.
8. The method of claim 1, wherein the exposed portion of the drain electrode has an area range of 80 to 120 \u03bcm2.
9. The method of claim 1, wherein the etching of the passivation layer and the first insulating layer generates an undercut region under the passivation layer and the first insulating layer.
10. The method of claim 1, wherein forming the data line and the drain electrode comprises forming a storage capacitor conductor overlapping a portion of the gate line.
11. The method of claim 1 further comprising lifting off the conductive film formed on the photoresist.
12. The method of claim 1, wherein the pixel electrode is at least partially connected to the substrate.
13. The method of claim 1, wherein the etching of the passivation layer and the first insulating layer comprises:
forming a first contact hole exposing an end portion of the data line; and
forming a first contact assistant connected to the end portion of the data line through the first contact hole.
14. The method of claim 13, wherein the etching of the passivation layer and the first insulating layers comprises:
forming a second contact hole exposing an end portion of the gate line; and
forming a second contact assistant connected to the end portion of the gate line through the second contact hole.
15. The method of claim 14 further comprising forming the pixel electrode along with the first and second contact assistants.
16. The method of claim 1, wherein the semiconductor layer, the data line, and the drain electrode are formed in a single lithography step.
17. A thin film transistor array panel comprising:
a gate line formed on a substrate;
a gate insulating layer formed on the gate line;
a semiconductor layer formed on the gate insulating layer;
a data line, a drain electrode, and a storage capacitor conductor formed on the semiconductor;
a passivation layer that is formed on the data line, a portion of the drain electrode, and a portion of the storage capacitor conductor; and
a pixel electrode connected to the drain electrode that is not covered by the passivation layer,
wherein a portion of the pixel electrode which is adjacent to the gate line is connected to the storage capacitor conductor on which the passivation layer is not formed.
18. The panel of claim 17, wherein the gate line comprises a projection overlapping the storage capacitor conductor, and the portion of the pixel electrode is adjacent to the projection of the gate line.
19. The panel of claim 17, wherein the drain electrode or the storage capacitor conductor connected to the pixel electrode has an area range of 80 to 120 \u03bcm2.
20. The panel of claim 17, wherein the pixel electrode is formed on a portion of the substrate.