1461095264-8a3eba78-c95c-4810-9d66-4c392e4df8b6

1. A vehicle lamp comprising:
a first lamp unit comprising a first light emitting element and a first reflector configured to reflect the light from the first light emitting element toward the front, and
a second lamp unit comprising a second light emitting element and a second reflector configured to reflect the light from the second light emitting element toward the front,
wherein the first lamp unit and the second lamp unit are arranged side by side in a direction intersecting with a lamp longitudinal direction, and
a first additional reflector configured to reflect the light from the second light emitting element toward the front is disposed in the vicinity of a front end edge of the first reflector.
2. The vehicle lamp according to claim 1, wherein a second additional reflector configured to reflect the light from the first light emitting element toward the front is disposed in the vicinity of a front end edge of the second reflector.
3. The vehicle lamp according to claim 2, wherein each of the first and second light emitting elements is a light emitting element that has a light emitting surface extending in the direction intersecting with the lamp longitudinal direction.
4. The vehicle lamp according to any one of claim 1, wherein a third lamp unit is disposed between the first lamp unit and the second lamp unit.
5. The vehicle lamp according to claim 4, wherein the third lamp unit comprises a third light emitting element and a third reflector configured to reflect the light from the third light emitting element toward the front.
6. A vehicle lamp comprising:
a first lamp unit comprising a first light source and a first reflector configured to reflect the light from the first light source toward the front, and
a second lamp unit comprising a second light source and a second reflector configured to reflect the light from the second light source toward the front,
wherein the first lamp unit and the second lamp unit are arranged side by side in such a way that the second lamp unit is provided on the outside in a vehicle width direction,
the second reflector is disposed so as to be positioned on the rear side of the first reflector,
a reflective surface of the second reflector is formed so as to extend to the inside in the vehicle width direction up to a position of partially overlapping with a reflective surface of the first reflector, as seen from the front of the lamp, and
a first overlapping portion of the reflective surface of the second reflector, which overlaps with the reflective surface of the first reflector, is formed so as to reflect the light from the second light source toward the outside in the vehicle width direction.
7. The vehicle lamp according to claim 6, wherein a third lamp unit comprising a third light source and a third reflector configured to reflect the light from the third light source toward the front is disposed on the outside in the vehicle width direction of the second lamp unit,
the third reflector is disposed so as to be positioned on the rear side of the second reflector,
a reflective surface of the third reflector is formed so as to extend to the inside in the vehicle width direction up to a position of partially overlapping with the reflective surface of the second reflector, as seen from the front of the lamp, and
a second overlapping portion of the reflective surface of the third reflector, which overlaps with the reflective surface of the second reflector, is formed so as to reflect the light from the third light source toward the outside in the vehicle width direction.
8. The vehicle lamp according to claim 7, wherein a deflection angle to the outside in the vehicle width direction of the reflected light from the first overlapping portion and a deflection angle to the outside in the vehicle width direction of the reflected light from the second overlapping portion are set to different values.
9. The vehicle lamp according to claim 8, wherein a rearward displacement amount of the third reflector with respect to the second reflector is set to a value greater than a rearward displacement amount of the second reflector with respect to the first reflector, and
the deflection angle to the outside in the vehicle width direction of the reflected light from the second overlapping portion is set to a value greater than the deflection angle to the outside in the vehicle width direction of the reflected light from the first overlapping portion.

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 system, comprising:
a search engine that processes a query to derive query intent and returns search results based on the query intent;
an advertising component that communicates the query intent to one or more services and receives advertisements from the one or more services based on the query intent, an advertisement selected for and presented with the search results; the query intent, advertisement selection, and presentation with the search results all performed in realtime; and
a processor that executes computer-executable instructions associated with at least the advertising component.
2. The system of claim 1, wherein the query intent is analyzed and classified into a query intent classification.
3. The system of claim 2, wherein the advertising component enables subscription of a service to a specific query intent classification and a subscribing vendor service responds to the advertising component based on a received specific query intent classification.
4. The system of claim 1, wherein the advertising component also receives a bid from the one or more services for determining presentation of the advertisement on a search results page, the bid processed in realtime with the query intent, advertisement selection, and advertisement presentation with the search results.
5. The system of claim 1, wherein the advertising component receives multiple bids from multiple corresponding services and ranks the bids for selection of a top bid and associated advertisement.
6. The system of claim 1, wherein the advertising component aggregates all advertisements from the one or more services, and selects an advertisement based on selection criteria.
7. The system of claim 1, wherein the advertising component sends the query intent and classification confidence level data to each of the one or more services subscribing to the query intent.
8. The system of claim 1, wherein the advertising component serves up advertisements based on an optimized price-to-relevance computation.
9. A method, comprising acts of:
classifying query intent related to a query into an intent classification;
communicating the intent classification to services;
receiving advertisements from the services;
selecting one or more of the advertisements based on selection criteria;
presenting the selected one or more advertisements in association with search results of the query, the one or more advertisements presented in realtime in response to receiving the query intent; and
utilizing a processor that executes instructions stored in memory to perform at least one of the acts of classifying, communicating, receiving, selecting, or presenting.
10. The method of claim 9, further comprising selecting the one or more advertisements according to bid criteria.
11. The method of claim 9, further comprising performing a ranking process based on the criteria to select the one or more advertisements.
12. The method of claim 9, further comprising receiving selection criteria parameters from the services along with the advertisements.
13. The method of claim 9, further comprising communicating the intent classification only to services that subscribe to the intent classification.
14. The method of claim 9, further comprising communicating keywords to the services along with the intent classification.
15. The method of claim 9, further comprising processing the query intent to output a classification confidence level that is passed to the services.
16. The method of claim 9, further comprising serving the selected one or more advertisements based on a price-to-relevance computation.
17. A method, comprising acts of:
receiving query intent of a query from a search engine into an advertisement component;
classifying the query intent according to an intent classification;
communicating the intent classification to subscribing business services;
receiving advertisements and bids from the business services;
selecting an advertisement based on the bids;
sending the selected advertisement to the search engine;
presenting the selected advertisement in association with search results of the query, the advertisement presented in realtime in response to receiving the query; and
utilizing a processor that executes instructions stored in memory to perform at least one of the acts of receiving the query intent, classifying, communicating, receiving advertisements, selecting, sending, or presenting.
18. The method of claim 17, further comprising communicating advertisement parameters of the result page and query keywords to the subscribing business services.
19. The method of claim 17, further comprising ranking the received advertisements based on the bids and sending a top-ranked set of advertisements to the search engine.
20. The method of claim 17, further comprising processing the query intent to output a classification confidence level that is passed to the services.

1461095254-affff217-0278-4476-8849-5ace24fbcb7a

1. An interleaving method using a parallel structured Latin square matrix in a communication system, comprising:
dividing input information bits into a plurality of sub-blocks according to a parallel processing order;
generating a first Latin square matrix or a second Latin square matrix by comparing the parallel processing order with a predetermined threshold; and
interleaving the information bits divided into the sub-blocks according to the generated Latin square matrix.
2. The interleaving method of claim 1, wherein if the parallel processing order is less than the threshold, generating a first Latin square matrix having a size of the parallel processing order and having a good distribution.
3. The interleaving method of claim 1, wherein if the parallel processing order is greater than the threshold, generating a Latin square matrix having a size of a predetermined order less than the parallel processing order and generating a second Latin square matrix extended by the size of the parallel processing order from the Latin square matrix.
4. The interleaving method of claim 3, wherein the predetermined order size l is a constant less than the parallel processing order L, where L is a multiple of l.
5. The interleaving method of claim 3, wherein the second Latin square matrix is expressed by:
u
L

=

\ue89e
(

u
l

)
(
n
)
=

\ue89e
(
a
11
a
12
\u2026
a

1
\ue89e
l
a
21
a
22
a

2
\ue89e
l
\u22ee
\u22f0
\u22ee
a

l
\ue89e
\ue89e
1
a

l
\ue89e
\ue89e
2
\u2026
a
ll
)
(
n
)
=

\ue89e
a
11
\u2026
a

1
\ue89e
\ue89e
l
a
11

(
1
)
\u2026
a

1
\ue89e
\ue89e
l
(
1
)
\u2026
a
11

(

n
–
1

)
\u2026
a

1
\ue89e
l
(

n
–
1

)
a
21

(

n
–
1

)
\u2026
a
21

(

n
–
1

)
a
21
\u2026
a

2
\ue89e
l
\u2026
a
21

(

n
–
2

)
\u2026
a

2
\ue89e
l
(

n
–
2

)
\u22ee
\u22ee
\u22ee
\u22ee
\u22f0
\u22ee
\u22ee
a
11

(
1
)
\ue89e
\u2026
a

1
\ue89e
l
(
1
)
a
11

(
2
)
\u2026
a

1
\ue89e
l
(
2
)
\u2026
a
11
\u2026
a

1
\ue89e
l
a
21
\u2026
a

2
\ue89e
l
a
21

(
1
)
\u2026
a

2
\ue89e
l
(
1
)
\u2026
a
21

(

n
–
1

)
\u2026
a

2
\ue89e
l
(

n
–
1

)
\u22ee
\u22ee
\u22ee
\u22ee
\u22f0
\u22ee
\u22ee
\u22ee
\u22ee
\u22ee
\u22ee
\u22f0
\u22ee
\u22ee
a
11

(

n
–
1

)
\u2026
a

1
\ue89e
l
(

n
–
1

)
a
11
\u2026
a

1
\ue89e
l
\u2026
a
11

(

n
–
2

)
\u2026
a

1
\ue89e
l
(

n
–
2

)
a
21

(

n
–
2

)
\u2026
a

2
\ue89e
l
(

n
–
2

)
a
21

(

n
–
1

)
\u2026
a

2
\ue89e
l
(

n
–
1

)
\u2026
a
21

(

n
–
3

)
\u2026
a

2
\ue89e
l
(

n
–
3

)
\u22ee
\u22ee
\u22ee
\u22ee
\u22f0
\u22ee
\u22ee
where uL denotes the second Latin matrix having a size of L\xd7L, ul denotes a Latin square matrix having a size of l\xd7l, and n denotes a parameter for converting the Latin square matrix ul into the Latin square matrix uL having a size required by the system.
6. The interleaving method of claim 5, wherein an element ai,j(k) of the second Latin square matrix is calculated according to:
aij(k)=aij+l\xb7k, 0\u2266k\u2266n\u22121,
where ai,j(k) denotes an element of the second Latin square matrix, ai,j denotes an element of an ith row and an jth column of the reduced Latin square matrix ul, l denotes a predetermined order size, i denotes a sub-block index, and j denotes a time-domain index.
7. The interleaving method of claim 1, wherein interleaving the information bits divided into the sub-blocks according to the generated Latin square matrix further comprises:
determining an information bit permutation is so that a memory contention does not occur.
8. The interleaving method of claim 7, wherein the information bit permutation is determined according to:
\u03c0(k)=uij\xb7M+\u03c0T(t), k=j\xd7M+i,

wherein \u03c0(k) denotes an interleaving rule of an interleaver, \u03c0T(t) denotes a conventional sub-block interleaver, uijdenotes an element of an ith row and an jth column of the second Latin square matrix U, and M denotes a sub-block size.
9. The interleaving method of claim 1, wherein interleaving using the parallel structured Latin square matrix is based on parallel processing of a turbo code.
10. The interleaving method of claim 1, further comprising generating the first Latin square matrix by determining a number of sub-blocks to a number of columns and by determining a number of bits for each sub-block to a number of rows, or generating the first Latin square matrix by determining a number of sub-blocks to a number of rows and by determining a number of bits for each sub-block to a number of columns.
11. An interleaving apparatus using a parallel structured Latin square matrix in a communication system, wherein the apparatus divides input information bits into a plurality of sub-blocks according to a parallel processing order, generates a first Latin square matrix or a second Latin square matrix by comparing the parallel processing order with a predetermined threshold, and interleaves the information bits divided into the sub-blocks according to the generated Latin square matrix.
12. The interleaving apparatus of claim 11, wherein, if the parallel processing order is less than the threshold, the apparatus generates a first Latin square matrix having a size of the parallel processing order and having a good distribution.
13. The interleaving apparatus of claim 11, wherein if the parallel processing order is greater than the threshold, the apparatus generates a Latin square matrix having a size of a predetermined order less than the parallel processing order and generates a second Latin square matrix extended by the size of the parallel processing order from the Latin square matrix.
14. The interleaving apparatus of claim 13, wherein the preset order size l is a constant less than the parallel processing order L, where L is a multiple of l.
15. The interleaving apparatus of claim 13, wherein the second Latin square matrix is expressed by:
u
L

=

\ue89e
(

u
l

)
(
n
)
=

\ue89e
(
a
11
a
12
\u2026
a

1
\ue89e
l
a
21
a
22
a

2
\ue89e
l
\u22ee
\u22f0
\u22ee
a

l
\ue89e
\ue89e
1
a

l
\ue89e
\ue89e
2
\u2026
a
ll
)
(
n
)
=

\ue89e
a
11
\u2026
a

1
\ue89e
\ue89e
l
a
11

(
1
)
\u2026
a

1
\ue89e
\ue89e
l
(
1
)
\u2026
a
11

(

n
–
1

)
\u2026
a

1
\ue89e
l
(

n
–
1

)
a
21

(

n
–
1

)
\u2026
a
21

(

n
–
1

)
a
21
\u2026
a

2
\ue89e
l
\u2026
a
21

(

n
–
2

)
\u2026
a

2
\ue89e
l
(

n
–
2

)
\u22ee
\u22ee
\u22ee
\u22ee
\u22f0
\u22ee
\u22ee
a
11

(
1
)
\ue89e
\u2026
a

1
\ue89e
l
(
1
)
a
11

(
2
)
\u2026
a

1
\ue89e
l
(
2
)
\u2026
a
11
\u2026
a

1
\ue89e
l
a
21
\u2026
a

2
\ue89e
l
a
21

(
1
)
\u2026
a

2
\ue89e
l
(
1
)
\u2026
a
21

(

n
–
1

)
\u2026
a

2
\ue89e
l
(

n
–
1

)
\u22ee
\u22ee
\u22ee
\u22ee
\u22f0
\u22ee
\u22ee
\u22ee
\u22ee
\u22ee
\u22ee
\u22f0
\u22ee
\u22ee
a
11

(

n
–
1

)
\u2026
a

1
\ue89e
l
(

n
–
1

)
a
11
\u2026
a

1
\ue89e
l
\u2026
a
11

(

n
–
2

)
\u2026
a

1
\ue89e
l
(

n
–
2

)
a
21

(

n
–
2

)
\u2026
a

2
\ue89e
l
(

n
–
2

)
a
21

(

n
–
1

)
\u2026
a

2
\ue89e
l
(

n
–
1

)
\u2026
a
21

(

n
–
3

)
\u2026
a

2
\ue89e
l
(

n
–
3

)
\u22ee
\u22ee
\u22ee
\u22ee
\u22f0
\u22ee
\u22ee
where uL denotes the second Latin matrix having a size of L\xd7L, ul denotes a Latin square matrix having a size of l\xd7l, and n denotes a parameter for converting the Latin square matrix ul into the Latin square matrix uL having a size required by the system.
16. The interleaving apparatus of claim 15, wherein an element ai,j(k) of the second Latin square matrix is calculated according to:
aij(k)=aij+l\xb7k, 0\u2266k\u2266n\u22121,

where ai,j(k) denotes an element of the second Latin square matrix, ai,j denotes an element of an ith row and an jth column of the reduced Latin square matrix ul, l denotes a predetermined order size, i denotes a sub-block index, and j denotes a time-domain index.
17. The interleaving apparatus of claim 11, wherein when the apparatus interleaves the information bits divided into the sub-blocks according to the generated Latin square matrix, an information bit permutation is determined so that a memory contention does not occur.
18. The interleaving apparatus of claim 17, wherein the information bit permutation is determined according to:
\u03c0(k)=uij\xb7M+\u03c0T(t), k=j\xd7M+i,

wherein \u03c0(k) denotes an interleaving rule of an interleaver, \u03c0T(t) denotes a conventional sub-block interleaver, uij denotes an element of an ith row and an jth column of the second Latin square matrix U, and M denotes a sub-block size.
19. The interleaving apparatus of claim 11, wherein the interleaving using the parallel structured Latin square matrix is based on parallel processing of a turbo code.
20. The interleaving apparatus of claim 11, wherein the apparatus generates the first Latin square matrix by determining a number of sub-blocks to a number of columns and by determining a number of bits for each sub-block to a number of rows, or generates the first Latin square matrix by determining a number of sub-blocks to a number of rows and by determining a number of bits for each sub-block to a number of columns.

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 transmitting a spread signal at a base station in a mobile communication system, the method comprising:
spreading a signal using a plurality of spreading codes, wherein the plurality of spreading codes have a spreading factor of 4;
coding the spread signal for multiple antenna transmission;
multiplexing the coded spread signal by code division multiplexing for each antenna;
transmitting the multiplexed signal via four neighboring frequency resources of one orthogonal frequency-division multiplexing (OFDM) symbol of a first antenna set comprising two antennas; and
transmitting the same multiplexed signal via four neighboring frequency resources of one OFDM symbol of a second antenna set comprising two antennas,
wherein the multiplexed signal transmitted via the first antenna set and the multiplexed signal transmitted via the second antenna set are transmitted via different OFDM symbols,
wherein the multiplexed signal transmitted via the first antenna set and the multiplexed signal transmitted via the second antenna set are separated from each other by a plurality of subcarriers in a frequency domain,
wherein the spread signal is coded between the two antennas in each of the first antenna set and the second antenna set as shown in Table 1:
TABLE 1
neighboring frequency resources in
one OFDM symbol
antenna A
f1(a1)
f2(a2)
f1(a3)
f2(a4)
antenna B
f3(a2)
f4(a1)
f3(a4)
f4(a3)
wherein antenna A and antenna B represent the two antennas in each of the first antenna set and second antenna set, f1(x)=x, f2(x)=x, f3(x)=\u2212x* and f4(x)=x*, and a1 to a4 represent each element of the spread signal, and
wherein the spread signal is an ACKNACK signal for indicating whether or not uplink signal is successfully received.
2. The method of claim 1, wherein frequency switching transmitting diversity (FSTD) is applied in a way of transmitting the multiplexed signal alternately by the first antenna set and second antenna set repeatedly.
3. The method of claim 2, wherein the multiplexed signal is transmitted a total of 3 times using the first antenna set and second antenna set alternately.
4. The method of claim 1, wherein the first antenna set comprises a first antenna and a second antenna of a four-antenna group.
5. The method of claim 4, wherein the second antenna set comprises a third antenna and a fourth antenna of the four-antenna group.
6. The method of claim 1, wherein the first antenna set comprises a first antenna and a third antenna of a four-antenna group.
7. The method of claim 6, wherein the second antenna set comprises a second antenna and a fourth antenna of the four-antenna group.
8. A method for receiving a spread signal at a user equipment in a mobile communication system, the method comprising:
receiving a multiplexed signal via four neighboring frequency resources of one orthogonal frequency-division multiplexing (OFDM) symbol, the multiplexed signal being received from a first antenna set comprising two antennas of a transmitting end; and
receiving the same multiplexed signal via four neighboring frequency resources of one OFDM symbol, the same multiplexed signal being received from a second antenna set comprising two antennas of the transmitting end,
wherein the multiplexed signal received from the first antenna set and the multiplexed signal received from the second antenna set are received via different OFDM symbols,
wherein the multiplexed signal originates from a coded spread signal using code division multiplexing for each antenna,
wherein the coded spread signal originates from a spread signal coded between the two antennas in each of the first antenna set and the second antenna set as shown in Table 1:
TABLE 1
neighboring frequency resources in
one OFDM symbol
antenna A
f1(a1)
f2(a2)
f1(a3)
f2(a4)
antenna B
f3(a2)
f4(a1)
f3(a4)
f4(a3)
wherein antenna A and antenna B represent the two antennas in each of the first antenna set and second antenna set, f1(x)=x, f2(x)=x, f3(x)=\u2212x* and f4(x)=x*, and a1 to a4 represent each element of the spread signal,
wherein the spread signal originates from spreading a signal using a plurality of spreading codes, wherein the plurality of spreading codes have a spreading factor of 4,
wherein the multiplexed signal received via the first antenna set and the multiplexed signal received via the second antenna set are separated from each other by a plurality of subcarriers in a frequency domain,
wherein the spread signal is an ACKNACK signal for indicating whether or not uplink signal is successfully received.
9. The method of claim 8, wherein frequency switching transmitting diversity (FSTD) is applied in receiving the multiplexed signal alternately from the first antenna set and second antenna set repeatedly.
10. The method of claim 9, wherein the multiplexed signal is received a total of 3 times using the first antenna set and second antenna set alternately.
11. The method of claim 8, wherein the first antenna set comprises a first antenna and a second antenna of a four-antenna group.
12. The method of claim 11, wherein the second antenna set comprises a third antenna and a fourth antenna of the four-antenna group.
13. The method of claim 8, wherein the first antenna set comprises a first antenna and a third antenna of a four-antenna group.
14. The method of claim 13, wherein the second antenna set comprises a second antenna and a fourth antenna of the four-antenna group.