1461106893-00b85cc2-1857-497c-9075-84aa54174c6d

1. A computer implemented method for providing a compressed index for a stream of binary records, the method comprising the steps of:
sorting the stream of binary records by content of a predetermined field of each of the binary records;
transforming the predetermined field from each of the binary records into a bitmap index, wherein the bitmap index is a matrix having a separate column corresponding to each possible value in the predetermined field;
compressing bits in a column of the bitmap index by replacing a group of successive bits with a code;
wherein the sorting comprises the step of assigning, for each binary record, a hash bucket of a hash table on a basis of a locality sensitive hash function on the contents of the predetermined field, so that the probability for two of the binary records to be assigned to the same hash bucket increases with the similarity of the contents of the predetermined field between the binary records;
wherein if a total number of binary records held in the hash table exceeds a first predetermined number, the hash bucket that is assigned greatest number of binary records is output to an output stream until the total number of binary records held in the hash table falls below a second predetermined number;
wherein if a number of binary records held in one of the hash buckets exceeds a third predetermined number, the binary records in that hash bucket are output to the output stream; and
wherein at least one step of the computer implemented method is executed on a computer device.
2. The method according to claim 1, wherein the locality sensitive hash function is generated by:
creating a first vector with the predetermined fields as elements;
creating a second vector with random numbers of a Gaussian distribution as elements;
projecting the first vector onto a scalar by generating the dot product of the first vector and the second vector; and
determining the hash bucket on the basis of the scalar.
3. The method according to claim 2, wherein determining the hash bucket comprises the steps of:
determining a predetermined number of scalars for the first vector on the basis of different second vectors by means of the locality sensitive hash function;
determining a sum of the scalars; and
assigning the hash bucket on the basis of a modulo division of the sum by the number of hash buckets in the hash table.
4. The method according to claim 2, wherein the stream is a communication data stream between computers in a computer network.
5. The method according to claim 3, wherein the stream is a communication data stream between computers in a computer network.
6. The method according to claim 1, further comprising the steps of:
assigning, for each binary record, a scalar quantity on a basis of another locality sensitive hash function that is independent from the first locality sensitive hash function; and
sorting the binary records inside each hash bucket according to the determined quantities of the binary records.
7. The method according to claim 6, wherein the stream is a communication data stream between computers in a computer network.
8. The method according to claim 1, wherein the stream is a communication data stream between computers in a computer network.
9. The method according to claim 8, wherein the predetermined field comprises a source address, a destination address, a source port, a destination port and a protocol type of a communication between computers on a network.
10. A computer readable storage medium tangibly embodying a computer readable program code having non-transitory computer readable instructions which, when implemented, cause a computer to carry out the steps of a method according to claim 1.
11. A computer implemented method for providing a compressed index for a stream of binary records, the method comprising the steps of:
sorting the stream of binary records based on a similarity of a content of a predetermined field associated with the binary records, wherein part of the sorting is accomplished by assigning each binary record to a hash bucket of a hash table on a basis of a locality sensitive hash function on the contents of the predetermined fields, so that the probability for two of the binary records to be assigned to the same hash bucket increases with the similarity of the contents of the predetermined field between the two binary records;
transforming the predetermined field from each of the binary records into a bitmap index, wherein the bitmap index is a matrix having a separate column corresponding to each possible value in the predetermined field;
compressing bits in a column of the bitmap index by replacing a group of successive bits with a code;
wherein if a total number of binary records held in the hash table exceeds a first predetermined number, the hash bucket that is assigned greatest number of binary records is output to an output stream until the total number of binary records held in the hash table falls below a second predetermined number;
wherein if a number of binary records held in one of the hash buckets exceeds a third predetermined number, the binary records in that hash bucket are output to the output stream; and
wherein at least one step of the computer implemented method is executed on a computer device.
12. The method according to claim 11, wherein the locality sensitive hash function is generated by:
creating a first vector with the predetermined fields as elements;
creating a second vector with random numbers of a Gaussian distribution as elements;
projecting the first vector onto a scalar by generating the dot product of the first vector and the second vector; and
determining the hash bucket on the basis of the scalar.
13. The method according to claim 12, wherein determining the hash bucket comprises the steps of:
determining a predetermined number of scalars for the first vector on the basis of different second vectors by means of the locality sensitive hash function;
determining a sum of the scalars; and
assigning the hash bucket on the basis of a modulo division of the sum by the number of hash buckets in the hash table.
14. A computer readable storage medium tangibly embodying a computer readable program code having non-transitory computer readable instructions which, when implemented, cause a computer to carry out the steps of a method according to claim 11.

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 device for correcting visual defects of an eye comprising:
a femtosecond laser configured to generate a pulsed laser beam having femtosecond pulses;
a beam modification device configured to shape and deflect the pulsed laser so as to process at least one of an intraocular lens and an eye lens;
a wavefront analyzer device configured to analyze a wavefront of an optical path in the eye and to generate wavefront signals indicative of the wavefront; and
a control unit configured to process the wavefront signals of the wavefront analyzer device and to control the femtosecond laser and the beam modification device based on the wavefront signals so as to perform a refractive correction.
2. The device as recited in claim 1, wherein the control unit is configured to process the signals simultaneously with the processing of at least one of the intraocular lens and the eye lens.
3. The device as recited in claim 1, wherein the control unit is configured to calculate a plurality of shot positions needed for processing the intraocular lens or eye lens based on the wavefront analysis.
4. The device as recited in claim 1, further comprising a topography analyzer configured to generate topography signals indicative of a topography of the intraocular lens or eye lens and wherein the control unit is configured to process the topography signals and the wavefront signals.
5. The device as recited in claim 4, wherein the beam modification device is configured to process at least one of the intraocular lens and the eye lens so as to form an ideal optical system.
6. A method for correcting visual defects of an eye comprising:
generating a pulsed laser beam having femtosecond pulses using a femtosecond laser;
shaping and deflecting the pulsed laser using a beam modification device so as to process at least one of an intraocular lens and an eye lens;
analyzing a wavefront of an optical path in the eye using a wavefront analyzer device;
generating wavefront signals indicative of the wavefront;
processing signals of the wavefront analyzer device using a control unit; and
controlling the femtosecond laser and the beam modification device using the control unit based on the wavefront signals so as to perform a refractive correction.
7. The method as recited in claim 6, wherein the processing of at least one of the intraocular lens and the eye lens and the processing the signals of the wavefront analyzer are performed simultaneously.
8. The method as recited in claim 6, further comprising calculating a plurality of shot positions needed for processing the intraocular lens or eye lens based on the wavefront analysis.
9. The method as recited in claim 8, further comprising generating topography signals indicative of a topography of the intraocular lens or eye lens using a topography analyzer and processing the topography signals and the wavefront signals using the control unit.
10. The method as recited in claim 9, wherein the processing of at least one of the intraocular lens and the eye lens includes reshaping at least one of the intraocular lens and the eye lens into an ideal optical system.

1461106882-7f92aa47-c3ce-4759-98b4-65f7307459c8

1. In a computer system containing financial account information, a method for providing telephone services, the method comprising:
associating a financial account with at least one telephone number, the financial account configured for managing financial transactions in addition to transactions related to the at least one telephone number;
receiving a notification of the occurrence of a telephone transaction related to the at least one telephone number; and
deducting an amount from an account balance of the financial account reflecting at least a portion of the value of the telephone transaction.
2. The method as recited in claim 1, further comprising:
receiving an authorization request to perform the telephone transaction;
verifying that the financial account contains sufficient funds to perform the telephone transaction; and
authorizing the telephone transaction.
3. The method as recited in claim 2, wherein the telephone transaction employs a telephone network provided by a third party telephone service provider.
4. The method as recited in claim 3, wherein the authorization request is received from the third party telephone service provider.
5. The method as recited in claim 1, wherein the telephone number identifies a mobile wireless telephone number.
6. The method as recited in claim 1, wherein the telephone transaction is a phone call.
7. The method as recited in claim 1, wherein the telephone transaction is a data download using a mobile telephone.
8. The method as recited in claim 1, further comprising:
dedicating certain funds to the payment for telephone transactions related to the at least one telephone number, wherein additional telephone transactions will not be authorized upon the depletion of the funds dedicated to the telephone transactions.
9. The method as recited in claim 1, wherein the financial account is configured for managing financial transactions related to at least one of a checking account, a savings account, a line of credit, a debit card, a credit card, an overdraft account, and a brokerage account.
10. The method as recited in claim 1, further comprising:
providing a notification message to an end user of the at least one telephone number when an account balance used for paying for telephone transactions falls below a predetermined amount.
11. A system for providing telephone services, the system comprising:
a financial account having at least one balance;
a deposit component for adding funds to the at least one balance of the financial account; and
a debit component for accessing the at least one balance of the financial account with a telephone and for accessing the at least one balance of the financial account with at least one financial vehicle in addition to the telephone, wherein telephone transactions associated with the usage of the telephone are funded by the at least one balance of the financial account.
12. The system as recited in claim 11, wherein:
the financial account is a pre-paid financial account associated with a financial card that can be used to access pre-paid funds in the at least one balance; and
the debit component allows the at least one balance to be debited upon the occurrence of the telephone transactions in the same manner as the account balance is debited upon the occurrence of a financial transaction initiated by the use of the financial card.
13. The system as recited in claim 11, wherein the at least one balance includes a telephone balance including funds dedicated to funding the telephone transactions related to the telephone.
14. The system as recited in claim 11, wherein the telephone is a mobile wireless telephone.
15. In a computer system containing financial account information, a method for providing telephone services, the method comprising:
identifying a financial account having an account balance and being configured for managing financial transactions that are unrelated to telephone transactions;
associating the financial account with at least one telephone number; and
linking a debit component of the financial account to the at least one telephone number, such that when a telephone transaction is performed that relates to the at least one telephone number, an appropriate amount is debited from the account balance of the financial account.
16. The method as recited in claim 15, further comprising:
receiving an authorization request to perform the telephone transaction;
verifying that the financial account contains sufficient funds to perform the telephone transaction; and
authorizing the telephone transaction.
17. The method as recited in claim 16, wherein the telephone transaction employs a telephone network provided by a third party telephone service provider.
18. The method as recited in claim 17, wherein the authorization request is received from the third party telephone service provider.
19. The method as recited in claim 15, wherein the telephone number identifies a mobile wireless telephone number.
20. The method as recited in claim 15, wherein the financial account is configured for managing financial transactions related to at least one of a checking account, a savings account, a line of credit, a debit card, a credit card, an overdraft account, and a brokerage account.

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. A cap torsion preventing structure of truck, the structure including a cap perpendicularly combined head lamp support panel and wheel housing, the structure comprising a reinforcing material, one side of which being combined to an inner surface of the wheel housing and the other side being coupled to the head lamp support panel, thereby forming a closed space at a connected area between the head lamp support panel and the wheel housing for dispersion of load.
2. The structure as defined in claim 1, wherein the reinforcing material is formed by an upper flange and a right flange combining to an inner surface and an upper inner surface of the wheel housing so as to be coupled to a connected corner part between the wheel housing and the head lamp support panel, and is also formed by a left flange so as to be coupled to the head lamp support panel.