Author: claimsbot

I claim:

1. A window system for placing a window of a motor vehicle into an open position and a closed position, said window system comprising:
a window;
a pivot bearing;
a guide rail supported on said pivot bearing so as to pivot in a plane which is substantially parallel to a plane of said window between laterally outward and laterally inward positions; and
engagement means for moving said window to said open position and said closed position, said engagement means being movably supported on said side guide rail,
wherein said engagement means moves in a direction away from said pivot bearing to place said window into said open position.
2. The window system as claimed in claim 1, further comprising two pivoting guide rails for supporting said window on two opposing sides of said window.
3. The window system as claimed in claim 1, wherein said guide rail is guided on an end located opposite to said pivot bearing.
4. The window system as claimed in claim 1, wherein said guide rail is pre-tensioned into an outer pivot position by a tensioning device.
5. The window system as claimed in claim 4, wherein said engagement means pivots said guide rail against a force supplied by said tensioning means when said window is placed into said open position.
6. The window system as claimed in claim 1, further comprising a pivoting drive for moving said guide rail into said pivot position to match the position of said engagement means.
7. The window system as in claim 1, further comprising parallel guide means attached to a lower edge of said window for vertically guiding said window into at least a lowered position into a body part of said motor vehicle.
8. The window system as claimed in claim 7, further comprising a drive motor for movably guiding said window along said parallel guide means.
9. The window system as claimed in claim 7, wherein said parallel guide means has two parallel guide paths on which slide elements mounted on said lower edge of said window are movably guided.
10. The window system as claimed in claim 9, wherein each of said guide paths has an initial section which is bent in a direction toward said window.
11. The window system as claimed in claim 1, wherein said guide rail has an initial section which is bent in a direction toward said window such that when said window is in said open position, an initial displacement motion causes said window to lift inwardly.
12. The window system as claimed in claim 1, wherein said window is a rear window for a motor vehicle.
13. The window system as claimed in claim 1, wherein said window is a cover of a sliding roof for a motor vehicle.
14. A window system for placing a window of a motor vehicle into an open position and a closed position, said window system comprising:
a window;
engagement means movable along a path for moving said window to said open position and said to closed position,
a guide rail supported on a vehicle body part by a pivot bearing at each side of said window between laterally outward and laterally inward positions, said engagement means being movably supported on said side guide rail, the guide rail being in an outwardly pivoted position relative to the path of movement of the engagement means in the closed position of the window, and the guide rail being progressively pivoted inwardly about said pivot bearing by displacement of the engagement means in a direction away from the pivot bearing during movement of the window into said open.

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 operating a wireless device, comprising:
determining to use one grouping of peer discovery resources of a plurality of groupings of peer discovery resources based on one of a path loss or a distance to a base station, the plurality of groupings comprising a first grouping of resources having a first plurality of identical subsets of resources and a second grouping of resources having a second plurality of identical subsets of resources, each of the first plurality of identical subsets of resources extending over at least one of a different time period or a different number of subcarriers than each of the second plurality of identical subsets of resources; and
transmitting a peer discovery signal on one subset of the identical subsets of said one grouping of peer discovery resources.
2. The method of claim 1, wherein each of the first plurality of identical subsets of resources extends over a different time period and a different number of subcarriers than each of the second plurality of identical subsets of resources.
3. The method of claim 2, wherein each of the first plurality of identical subsets of resources extends over a first time period and over a first number of subcarriers, each of the second plurality of identical subsets of resources extends over a second time period and over a second number of subcarriers, the first time period is less than the second time period, and the first number of subcarriers is greater than the second number of sub carriers.
4. The method of claim 1, wherein each of the first plurality of identical subsets of resources extends over a different number of subcarriers than each of the second plurality of identical subsets of resources, each of the first plurality of identical subsets of resources extends over a first number of subcarriers, each of the second plurality of identical subsets of resources extends over a second number of subcarriers, and the first number of subcarriers is greater than the second number of subcarriers.
5. The method of claim 4, wherein the determining to use said one grouping of peer discovery resources comprises:
determining to use resources in the first plurality of identical subsets of resources when the wireless device has a path loss or a distance to a serving base station that is greater than a first threshold; and
determining to use resources in the second plurality of identical subsets of resources when the wireless device has a path loss or a distance to the serving base station that is less than a second threshold.
6. The method of claim 4, wherein the determining to use said one grouping of peer discovery resources comprises:
determining to use resources in the first plurality of identical subsets of resources when the wireless device has a path loss or a distance to a neighboring base station that is less than a first threshold; and
determining to use resources in the second plurality of identical subsets of resources when the wireless device has a path loss or a distance to the neighboring base station that is greater than a second threshold.
7. A method of operating a base station, comprising:
determining a path loss or a distance to each of a plurality of wireless devices; and
transmitting information to the wireless devices instructing the wireless devices to use peer discovery resources based on the determined path loss or distance.
8. The method of claim 7, further comprising distributing an allocation of the peer discovery resources to the wireless devices such that resources allocated to wireless devices with a path loss or a distance less than a threshold and to wireless devices with a path loss or a distance greater than the threshold are approximately evenly distributed across each set of time concurrent resources of the peer discovery resources.
9. The method of claim 7, further comprising summing path losses and distances for each set of concurrent resources such that at least one of a maximum is minimized or a minimum is maximized across the concurrent resources.
10. An apparatus for wireless communication, comprising:
means for determining to use one grouping of peer discovery resources of a plurality of groupings of peer discovery resources based on one of a path loss or a distance to a base station, the plurality of groupings comprising a first grouping of resources having a first plurality of identical subsets of resources and a second grouping of resources having a second plurality of identical subsets of resources, each of the first plurality of identical subsets of resources extending over at least one of a different time period or a different number of subcarriers than each of the second plurality of identical subsets of resources; and
means for transmitting a peer discovery signal on one subset of the identical subsets of said one grouping of peer discovery resources.
11. The apparatus of claim 10, wherein each of the first plurality of identical subsets of resources extends over a different time period and a different number of subcarriers than each of the second plurality of identical subsets of resources.
12. The apparatus of claim 11, wherein each of the first plurality of identical subsets of resources extends over a first time period and over a first number of subcarriers, each of the second plurality of identical subsets of resources extends over a second time period and over a second number of subcarriers, the first time period is less than the second time period, and the first number of subcarriers is greater than the second number of sub carriers.
13. The apparatus of claim 10, wherein each of the first plurality of identical subsets of resources extends over a different number of subcarriers than each of the second plurality of identical subsets of resources, each of the first plurality of identical subsets of resources extends over a first number of subcarriers, each of the second plurality of identical subsets of resources extends over a second number of subcarriers, and the first number of subcarriers is greater than the second number of subcarriers.
14. The apparatus of claim 13, wherein the means for determining to use said one grouping of peer discovery resources is configured to:
determine to use resources in the first plurality of identical subsets of resources when the apparatus has a path loss or a distance to a serving base station that is greater than a first threshold; and
determine to use resources in the second plurality of identical subsets of resources when the apparatus has a path loss or a distance to the serving base station that is less than a second threshold.
15. The apparatus of claim 13, wherein the means for determining to use said one grouping of peer discovery resources is configured to:
determine to use resources in the first plurality of identical subsets of resources when the apparatus has a path loss or a distance to a neighboring base station that is less than a first threshold; and
determine to use resources in the second plurality of identical subsets of resources when the apparatus has a path loss or a distance to the neighboring base station that is greater than a second threshold.
16. An apparatus for wireless communication, comprising:
means for determining a path loss or a distance to each of a plurality of wireless devices; and
means for transmitting information to the wireless devices instructing the wireless devices to use peer discovery resources based on the determined path loss or distance.
17. The apparatus of claim 16, further comprising means for distributing an allocation of the peer discovery resources to the wireless devices such that resources allocated to wireless devices with a path loss or a distance less than a threshold and to wireless devices with a path loss or a distance greater than the threshold are approximately evenly distributed across each set of time concurrent resources of the peer discovery resources.
18. The apparatus of claim 16, further comprising means for summing path losses and distances for each set of concurrent resources such that at least one of a maximum is minimized or a minimum is maximized across the concurrent resources.
19. An apparatus for wireless communication, comprising:
a processing system configured to:
determine to use one grouping of peer discovery resources of a plurality of groupings of peer discovery resources based on one of a path loss or a distance to a base station, the plurality of groupings comprising a first grouping of resources having a first plurality of identical subsets of resources and a second grouping of resources having a second plurality of identical subsets of resources, each of the first plurality of identical subsets of resources extending over at least one of a different time period or a different number of subcarriers than each of the second plurality of identical subsets of resources; and
transmit a peer discovery signal on one subset of the identical subsets of said one grouping of peer discovery resources.
20. The apparatus of claim 19, wherein each of the first plurality of identical subsets of resources extends over a different time period and a different number of subcarriers than each of the second plurality of identical subsets of resources.
21. The apparatus of claim 20, wherein each of the first plurality of identical subsets of resources extends over a first time period and over a first number of subcarriers, each of the second plurality of identical subsets of resources extends over a second time period and over a second number of subcarriers, the first time period is less than the second time period, and the first number of subcarriers is greater than the second number of sub carriers.
22. The apparatus of claim 19, wherein each of the first plurality of identical subsets of resources extends over a different number of subcarriers than each of the second plurality of identical subsets of resources, each of the first plurality of identical subsets of resources extends over a first number of subcarriers, each of the second plurality of identical subsets of resources extends over a second number of subcarriers, and the first number of subcarriers is greater than the second number of subcarriers.
23. The apparatus of claim 22, wherein to determine to use said one grouping of peer discovery resources, the processing system is configured to:
determine to use resources in the first plurality of identical subsets of resources when the apparatus has a path loss or a distance to a serving base station that is greater than a first threshold; and
determine to use resources in the second plurality of identical subsets of resources when the apparatus has a path loss or a distance to the serving base station that is less than a second threshold.
24. The apparatus of claim 22, wherein to determine to use said one grouping of peer discovery resources, the processing system is configured to:
determine to use resources in the first plurality of identical subsets of resources when the apparatus has a path loss or a distance to a neighboring base station that is less than a first threshold; and
determine to use resources in the second plurality of identical subsets of resources when the apparatus has a path loss or a distance to the neighboring base station that is greater than a second threshold.
25. An apparatus for wireless communication, comprising:
a processing system configured to:
determine a path loss or a distance to each of a plurality of wireless devices; and
transmit information to the wireless devices instructing the wireless devices to use peer discovery resources based on the determined path loss or distance.
26. The apparatus of claim 25, wherein the processing system is further configured to distribute an allocation of the peer discovery resources to the wireless devices such that resources allocated to wireless devices with a path loss or a distance less than a threshold and to wireless devices with a path loss or a distance greater than the threshold are approximately evenly distributed across each set of time concurrent resources of the peer discovery resources.
27. The apparatus of claim 25, wherein the processing system is further configured to sum path losses and distances for each set of concurrent resources such that at least one of a maximum is minimized or a minimum is maximized across the concurrent resources.
28. A computer program product in a wireless device, comprising:
a computer-readable medium comprising code for:
determining to use one grouping of peer discovery resources of a plurality of groupings of peer discovery resources based on one of a path loss or a distance to a base station, the plurality of groupings comprising a first grouping of resources having a first plurality of identical subsets of resources and a second grouping of resources having a second plurality of identical subsets of resources, each of the first plurality of identical subsets of resources extending over at least one of a different time period or a different number of subcarriers than each of the second plurality of identical subsets of resources; and
transmitting a peer discovery signal on one subset of the identical subsets of said one grouping of peer discovery resources.
29. The computer program product of claim 28, wherein each of the first plurality of identical subsets of resources extends over a different time period and a different number of subcarriers than each of the second plurality of identical subsets of resources.
30. The computer program product of claim 29, wherein each of the first plurality of identical subsets of resources extends over a first time period and over a first number of subcarriers, each of the second plurality of identical subsets of resources extends over a second time period and over a second number of subcarriers, the first time period is less than the second time period, and the first number of subcarriers is greater than the second number of subcarriers.
31. The computer program product of claim 28, wherein each of the first plurality of identical subsets of resources extends over a different number of subcarriers than each of the second plurality of identical subsets of resources, each of the first plurality of identical subsets of resources extends over a first number of subcarriers, each of the second plurality of identical subsets of resources extends over a second number of subcarriers, and the first number of subcarriers is greater than the second number of sub carriers.
32. The computer program product of claim 31, wherein the determining to use said one grouping of peer discovery resources comprises:
determining to use resources in the first plurality of identical subsets of resources when the wireless device has a path loss or a distance to a serving base station that is greater than a first threshold; and
determining to use resources in the second plurality of identical subsets of resources when the wireless device has a path loss or a distance to the serving base station that is less than a second threshold.
33. The computer program product of claim 31, wherein the determining to use said one grouping of peer discovery resources comprises:
determining to use resources in the first plurality of identical subsets of resources when the wireless device has a path loss or a distance to a neighboring base station that is less than a first threshold; and
determining to use resources in the second plurality of identical subsets of resources when the wireless device has a path loss or a distance to the neighboring base station that is greater than a second threshold.
34. A computer program product in a base station, comprising:
a computer-readable medium comprising code for:
determining a path loss or a distance to each of a plurality of wireless devices; and
transmitting information to the wireless devices instructing the wireless devices to use peer discovery resources based on the determined path loss or distance.
35. The computer program product of claim 34, wherein the computer-readable medium further comprises code for distributing an allocation of the peer discovery resources to the wireless devices such that resources allocated to wireless devices with a path loss or a distance less than a threshold and to wireless devices with a path loss or a distance greater than the threshold are approximately evenly distributed across each set of time concurrent resources of the peer discovery resources.
36. The computer program product of claim 34, wherein the computer-readable medium further comprises code for summing path losses and distances for each set of concurrent resources such that at least one of a maximum is minimized or a minimum is maximized across the concurrent resources.

1. A method for analyzing data in a computer-implemented data mining system, comprising:
(a) accessing customer transaction data from a relational database in the computer-implemented data-mining system;
(b) performing a factor analysis function on the customer transaction data in the computer-implemented data mining system to create a factor loadings matrix that has factors as columns and observed variables from the customer transaction data as rows, wherein each of the observed variables is assigned to one of the factors in the factor loadings matrix that has a maximum value for the row;
(c) deriving new variables in the computer-implemented data mining system by means of a factor-scoring method that combines the new variables into the factors in the factor loadings matrix; and
(d) identifying customer destination segments from the relational database in the computer-implemented data mining system using the factors and the new variables;
(e) using the identified customer destination segments for analyzing data in the computer implemented data mining system.
2. The method of claim 1, wherein the customer transaction data is comprised of baskets.
3. The method of claim 2, wherein each of the factors in the factor loadings matrix represents an affinity group of the observed variables that account for a specified percentage of a baskets total dollar value.
4. The method of claim 3, wherein each of the affinity groups is used to define one or more customer destination segments from the customer transaction data.
5. The method of claim 1, wherein the factor-scoring method uses scores generated by a data reduction function.
6. The method of claim 1, wherein the factor-scoring method uses an unweighted sum of variables assigned to each factor.
7. The method of claim 1, wherein the factor-scoring method generates factor scores as the new variables.
8. The method of claim 1, wherein the identifying step comprises selecting a subset of baskets related to each of the factors.
9. The method of claim 8, further comprising generating a profile for the selected subset of baskets.
10. The method of claim 1, further comprising performing a clustering function using the new variables to search for the customer destination segments.
11. The method of claim 10, wherein the clustering function uses only a first one of the factors to derive the new variables for use by the clustering function.
12. The method of claim 1, further comprising identifying customer destination segments from the relational database in the computer-implemented data mining system by means of a clustering tool using the new variables.
13. A computer-implemented data mining system for analyzing data, comprising:
(a) a computer;
(b) logic, performed by the computer, for:
(1) accessing customer transaction data from a relational database in the computer-implemented data mining system;
(2) performing a factor analysis function on the customer transaction data in the computer-implemented data mining system to create a factor loadings matrix that has factors as columns and observed variables from the customer transaction data as rows, wherein each of the observed variables is assigned to one of the factors in the factor loadings matrix that has a maximum value for the row;
(3) deriving new variables in the computer-implemented data mining system by means of a factor-scoring method that combines the new variables into the factors in the factor loadings matrix; and
(4) identifying customer destination segments from the relational database in the computer-implemented data mining system using the factors and the new variables;
(5) using the identified customer destination segments for analyzing data in the computer implemented data mining system.
14. The system of claim 13, wherein the customer transaction data is comprised of baskets.
15. The system of claim 14, wherein each of the factors in the factor loadings matrix represents an affinity group of the observed variables that account for a specified percentage of a baskets total dollar value.
16. The system of claim 15, wherein each of the affinity groups is used to define one or more customer destination segments from the customer transaction data.
17. The system of claim 13, wherein the factor-scoring method uses scores generated by a data reduction function.
18. The system of claim 13, wherein the factor-scoring method uses an unweighted sum of variables assigned to each factor.
19. The system of claim 13, wherein the factor-scoring method generates factor scores as the new variables.
20. The system of claim 13, wherein the logic for identifying comprises logic for selecting a subset of baskets related to each of the factors.
21. The system of claim 20, further comprising logic for generating a profile for the selected subset of baskets.
22. The system of claim 13, further comprising logic for performing a clustering function using the new variables to search for the customer destination segments.
23. The system of claim 22, wherein the clustering function uses only a first one of the factors to derive the new variables for use by the clustering function.
24. The system of claim 23, further comprising logic for identifying customer destination segments from the relational database in the computer-implemented data mining system by means of a clustering tool using the new variables.
25. An article of manufacture tangibly embodied on a computer readable medium embodying logic for analyzing data in a computer-implemented data mining system, the logic comprising:
(a) accessing customer transaction data from a relational database in the computer-implemented data mining system;
(b) performing a factor analysis function on the customer transaction data in the computer-implemented data mining system to create a factor loadings matrix that has factors as columns and observed variables from the customer transaction data as rows, wherein each of the observed variables is assigned to one of the factors in the factor loadings matrix that has a maximum value for the row;
(c) deriving new variables in the computer-implemented data mining system by means of a factor-scoring method that combines the new variables into the factors in the factor loadings matrix; and
(d) identifying customer destination segments from the relational database in the computer-implemented data mining system using the factors and the new variables;
(e) using the identified customer destination segments for analyzing data in the computer implemented data mining system.
26. The article of manufacture of claim 25, wherein the customer transaction data is comprised of baskets.
27. The article of manufacture of claim 26, wherein each of the factors in the factor loadings mat represents an affinity group of the observed variables that account for a specified percentage of a basket’s total dollar value.
28. The article of manufacture of claim 27, wherein each of the affinity groups is used to define one ox mote customer destination segments from the customer transaction data.
29. The article of manufacture of claim 25, wherein the factor-scoring method uses scores generated by a data reduction fraction.
30. The article of manufacture of claim 25, wherein the factor-scoring method uses an unweighted sum of variables assigned to each factor.
31. The article of manufacture of claim 25, wherein the factor-scoring method generates factor scores as the new variables.
32. The article of manufacture of claim 25, wherein the logic for identifying comprises logic for selecting a subset of baskets related to each of the factors.
33. The article of manufacture of claim 32, further comprising generating a profile for the selected subset of baskets.
34. The article of manufacture of claim 25, further comprising performing a clustering function using the new variables to search for the customer destination segments.
35. The article of manufacture of claim 34, wherein the clustering function uses only a first one of the factors to derive the new variables for use by the clustering function.
36. The article of manufacture of claim 35, further comprising identifying customer destination segments from the relational database in the computer-implemented data mining system by means of a clustering tool using the new variables.

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

What is claimed is:

1. An inter-picture compression encoding apparatus, comprising:
inputting means for receiving decoded pictures;
picture type information generating means for generating a signal that represents a picture type corresponding to the decoded picture; and
GOP phase deviation determining means for determining the deviation of GOP phases corresponding to the output signal of said picture type information generating means.
2. The inter-picture compression encoding apparatus as set forth in claim 1,
wherein said picture type information generating means including:
information amount calculating means for calculating a value that represents an information amount assigned to each picture corresponding to the decoded pictures.
3. The inter-picture compression encoding apparatus as set forth in claim 2,
wherein said information amount calculating means calculates a value that represents an information amount of each pixel corresponding to a pixel value that is assigned to each pixel of a picture with reference to a predetermined threshold value, and
wherein said information amount calculating means adds the values that represent the information amounts of the pixels of the picture so as to calculate the value that represents the information amount assigned to each picture.
4. The inter-picture compression encoding apparatus as set forth in claim 1,
wherein the GOP phases are locked corresponding to the determined result of said GOP phase deviation determining means.
5. An inter-picture compression encoding apparatus, comprising:
inputting means for receiving decoded pictures;
encoding means for encoding the decoded pictures;
decoding means for decoding encoded pictures so as to generate re-decoded pictures;
picture quality deterioration evaluating means for calculating a value that represents the deterioration of the picture quality for each picture of a GOP corresponding to the decoded pictures and the re-decoded pictures; and
GOP phase deviation detecting means for detecting the deviation of GOP phases corresponding to a value that represents the deterioration of the picture quality.
6. The inter-picture compression encoding apparatus as set forth in claim 5,
wherein said GOP phase deviation detecting means detects the deviation of the GOP phases corresponding to a value that represents the deterioration of the picture quality of a plurality of pictures estimated as a predetermined number of successive B pictures corresponding to a GOP structure.
7. The inter-picture compression encoding apparatus as set forth in claim 5,
wherein said GOP phase deviation detecting means determines whether or not the value that represents the deterioration of the picture quality of a picture that is estimated as an I picture corresponding to a GOP structure is the maximum value of the GOP so as to determine the deviation of the GOP phases corresponding to the determined result.
8. The inter-picture compression encoding apparatus as set forth in claim 5,
wherein the value that represents the deterioration of the picture quality is signal noise ratio.
9. The inter-picture compression encoding apparatus as set forth in claim 5,
wherein the GOP phases are locked corresponding to the determined result of said GOP phase deviation detecting means.
10. An inter-picture compression encoding method, comprising the steps of:
receiving decoded pictures;
generating a signal that represents a picture type corresponding to the decoded pictures; and
determining the deviation of GOP phases corresponding to the output signal at the picture type information generating step.
11. An inter-picture compression encoding method, comprising the steps of:
receiving decoded pictures;
encoding the decoded pictures;
decoding encoded pictures so as to generate re-decoded pictures;
calculating a value that represents the deterioration of the picture quality for each picture of a GOP corresponding to the decoded pictures and the re-decoded pictures; and
detecting the deviation of GOP phases corresponding to a value that represents the deterioration of the picture quality.