What is claimed:
1. A process for producing substantially soot-free exhaust gas from a diesel engine comprising:
a. filtering an exhaust gas containing soot particles using a deep-bed particle filter to provide an initially filtered exhaust gas, wherein the deep-bed particle filter has a filtration efficiency for soot particles and is coated with a catalytic coating for oxidizing nitrogen monoxide to nitrogen dioxide;
b. continuously combusting the soot particles collected on the deep-bed particle filter using nitrogen dioxide, which is generated by catalytic oxidation of nitrogen monoxide contained in the exhaust gas and is reduced back to nitrogen monoxide by combusting the soot particles, whereby the process of oxidizing and reducing of nitrogen monoxide is continuously repeated while the exhaust gas is passing the filter; and
c. further filtering the initially filtered exhaust gas from the deep-bed particle filter through a second particle filter, wherein the second particle filter serves as a soot barrier, has a filtration efficiency of at least 10% to produce a substantially soot-free exhaust gas.
2. A process according to claim 1, wherein the deep-bed particle filter has a filtration efficiency between about 10 and 95%.
3. A process according to claim 2, wherein the deep-bed particle filter has a filtration efficiency between about 50 and 80%.
4. A process according to claim 3, wherein the soot barrier has a filtration efficiency of more than about 98%.
5. A device for removing soot particles from an exhaust gas from a diesel engine comprising a deep-bed particle filter, the filter coated with a catalytic coating for the oxidation of nitrogen monoxide to nitrogen dioxide; and a second particle filter with a filtration efficiency of greater than 95%, wherein the second particle filter is downstream from the deep-bed particle filter and forms a soot barrier.
6. A device according to claim 5, wherein the deep-bed particle filter is made from a material selected from the group consisting of ceramic fibres, expanded ceramic material or wire mesh.
7. A device according to claim 6, wherein the catalytic coating contains at least one noble metal.
8. A device according to claim 7, wherein the catalytic coating contains platinum.
9. A device according to claim 7, wherein the catalytic coating contains at least one oxidic support material for each noble metal.
10. A device according to claim 9, wherein each oxidic support material is formed from aluminium oxide.
11. A device according to claim 5, wherein the catalytic coating further contains a material selected from the group consisting of cerium oxide, zirconium oxide, terbium oxide, praseodymium oxide and mixtures thereof.
12. A device according to claim 5, wherein the soot barrier is formed from a wall-flow filter located downstream of the deep-bed particle filter.
13. A device according to claim 5, wherein the soot barrier is formed from a metal sinter.
14. A device according to claim 13, wherein the deep-bed particle filter further comprises a plurality of arranged parallel filter elements containing the catalyst, through which the exhaust gas flows, wherein the filter elements have arranged sintered metal plates on an outflow face.
15. A process for producing substantially soot-free exhaust gas from a diesel engine by continuous combustion of the soot particles collected by a particle filter with the aid of nitrogen dioxide which is produced by catalytic oxidation of nitrogen monoxide contained in the exhaust gas, the improvement comprising:
a. filtering the exhaust gas containing soot particles using a deep-bed particle filter to provide an initially filtered exhaust gas, wherein the deep-bed particle filter has a filtration efficiency for soot particles and is coated with a catalytic coating for oxidizing nitrogen monoxide to nitrogen dioxide;
b. continuously combusting the soot particles collected within the deep-bed particle filter with the aid of nitrogen dioxide obtained by oxidizing the nitrogen monoxide contained in the exhaust gas at the catalytic coating of the filter and reducing the nitrogen dioxide back to nitrogen monoxide while combusting the soot particles, whereby the process of oxidizing and reducing of nitrogen monoxide is continuously repeated while the exhaust gas is passing the filter; and
c. further filtering the initially filtered exhaust gas from the deep-bed particle filter through a second particle filter, wherein the second particle filter serves as a soot barrier, has a filtration efficiency of at least 10% to produce a substantially soot-free exhaust gas.
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 computer implemented method, comprising:
identifying, by a computing device, a queue location for a resource and initializing a queue data structure and an exit data structure associated with the resource;
receiving, by the computing device, a plurality of periodic updates from a plurality of mobile devices in the queue location, each periodic update including an identification of the mobile device, a position of the mobile device, and a time of measurement;
when a mobile device is determined to have entered the queue location, storing, by the computing device, the mobile device identification, position and time of measurement at the end of a queue data structure with the time of measurement further stored as a queue entrance time;
when a mobile device is determined to be already in the queue location, updating, by the computing device, the position and time of measurement in the queue data structure;
when a mobile device is determined to have exited the queue location, moving, by the computing device, the identification, position, time of measurement and queue entrance time for the mobile device from the queue data structure to the exit data structure;
estimating, by the computing device, an average speed of the line based on an average rate of mobile devices exiting the queue location; and
estimating, by the computing device, a queue waiting time based on dividing a number of elements in the queue data structure by the average speed of the line.
2. The method of claim 1, further comprising:
storing in a web server the estimated average speed of the line, the estimated queue waiting time, the queue location, a time of day and a date.
3. The method of claim 1, wherein identifying the queue location comprises:
receiving one or more of the following: geographic coordinates of a polygon defining the boundary of the queue location, geographic coordinates of an entrance to the queue location, geographic coordinates of an exit to the queue location, and traffic handling characteristics of the resource.
4. The method of claim 1, wherein a mobile device is determined to have entered the queue location when the device identification is different from device identifications from other devices in the queue data structure.
5. The method of claim 1, wherein a mobile device is determined to be already in the queue location when the device identification is the same as the device identification for one device in the queue data structure.
6. The method of claim 1, wherein a mobile device is determined to have exited the queue location when a current time minus the time of measurement for the device in the data queue structure exceeds a defined threshold.
7. A system, comprising:
at least one computing device; and
a memory coupled to the computing device and having instructions stored thereon that, when executed by the computing device, cause the computing device:
identify a queue location for a resource and initializing a queue data structure and an exit data structure associated with the resource;
receive a plurality of periodic updates from a plurality of mobile devices in the queue location, each periodic update including an identification of the mobile device, a position of the mobile device, and a time of measurement;
when a mobile device is determined to have entered the queue location, store the mobile device identification, position and time of measurement at the end of a queue data structure with the time of measurement further stored as a queue entrance time;
when a mobile device is determined to be already in the queue location, update the position and time of measurement in the queue data structure;
when a mobile device is determined to have exited the queue location, move the identification, position, time of measurement and queue entrance time for the mobile device from the queue data structure to the exit data structure;
estimate an average speed of the line based on an average rate of mobile devices exiting the queue location; and
estimate a queue waiting time based on dividing a number of elements in the queue data structure by the average speed of the line.
8. The system of claim 7, wherein the instructions further cause the computing device to:
store in a web server the estimated average speed of the line, the estimated queue waiting time, the queue location, a time of day and a date.
9. The system of claim 7, wherein the instructions that cause the computing device to identify the queue location further cause the computing device to:
receive one or more of the following: geographic coordinates of a polygon defining the boundary of the queue location, geographic coordinates of an entrance to the queue location, geographic coordinates of an exit to the queue location, and traffic handling characteristics of the resource.
10. The system of claim 7, wherein a mobile device is determined to have entered the queue location when the device identification is different from device identifications from other devices in the queue data structure.
11. The system of claim 7, wherein a mobile device is determined to be already in the queue location when the device identification is the same as the device identification for one device in the queue data structure.
12. The system of claim 7, wherein a mobile device is determined to have exited the queue location when a current time minus the time of measurement for the device in the data queue structure exceeds a defined threshold.
13. A computer readable storage medium having instructions encoded thereon that, when executed by a computing device, cause the computing device to:
identify a queue location for a resource and initializing a queue data structure and an exit data structure associated with the resource;
receive a plurality of periodic updates from a plurality of mobile devices in the queue location, each periodic update including an identification of the mobile device, a position of the mobile device, and a time of measurement;
when a mobile device is determined to have entered the queue location, store the mobile device identification, position and time of measurement at the end of a queue data structure with the time of measurement further stored as a queue entrance time;
when a mobile device is determined to be already in the queue location, update the position and time of measurement in the queue data structure;
when a mobile device is determined to have exited the queue location, move the identification, position, time of measurement and queue entrance time for the mobile device from the queue data structure to the exit data structure;
estimate an average speed of the line based on an average rate of mobile devices exiting the queue location; and
estimate a queue waiting time based on dividing a number of elements in the queue data structure by the average speed of the line.
14. The computer readable storage medium of claim 13, wherein the instructions further cause the computing device to:
store in a web server the estimated average speed of the line, the estimated queue waiting time, the queue location, a time of day and a date.
15. The computer readable storage medium of claim 13, wherein the instructions that cause the computing device to identify the queue location further cause the computing device to:
receive one or more of the following: geographic coordinates of a polygon defining the boundary of the queue location, geographic coordinates of an entrance to the queue location, geographic coordinates of an exit to the queue location, and traffic handling characteristics of the resource.
16. The computer readable storage medium of claim 13, wherein a mobile device is determined to have entered the queue location when the device identification is different from device identifications from other devices in the queue data structure.
17. The computer readable storage medium of claim 13, wherein a mobile device is determined to be already in the queue location when the device identification is the same as the device identification for one device in the queue data structure.
18. The computer readable storage medium of claim 13, wherein a mobile device is determined to have exited the queue location when a current time minus the time of measurement for the device in the data queue structure exceeds a defined threshold.