1. A method of causing a computer system to recommend a rideshare, comprising:
generating, in a data processor, a search criteria according to user-defined inputs including at least one itinerary and at least one personal affinity category,
storing a plurality of user profiles in a memory associated with the data processor,
generating, in the data processor, a cost value for each of the plurality of stored user profiles according to the search criteria, each stored user profile including at least one itinerary and one personal affinity category,
displaying anonymously at least one of the stored user profiles and a corresponding cost value on a display device,
transmitting a first anonymous message to a communication address corresponding to a selected user profile, the anonymous message requesting a rideshare,
receiving a second anonymous message from the communication address corresponding to the selected user profile, the second anonymous message indicating one of acceptance or rejection of the rideshare; and
displaying, on the display device, a rideshare finalizing information upon receipt of an acceptance or an anonymous denial message upon receipt of a rejection, the at least one itinerary and the at least one personal affinity category of the search criteria being weighted to generate the cost values according to a plurality of user-defined priorities;
updating, in the data processor, a user profile according to at least one other profile corresponding to a history of past rideshare acceptances by
identifying other user profiles, stored in the memory, corresponding to a rideshare history of the user profile,
determining, in the data processor, matching personal affinity categories between the other user profiles and the user profile,
updating, in the user profile, values corresponding to the matching personal affinity categories according to the other user profiles, and
updating, in the user profile, at least one itinerary according to itineraries corresponding to the other user profiles,
wherein for each matching personal affinity category corresponding values are copied from other user profiles to the user profile.
2. The method of causing a computer system to recommend a rideshare according to claim 1, further comprising:
comparing, in the data processor, the generated cost values corresponding to the stored user profiles to a predetermined threshold,
wherein only stored user profiles having a cost value below the predetermined threshold are displayed.
3. The method of causing a computer system to recommend a rideshare according to claim 1, wherein updating the user profile also includes adding at least one of a new personal affinity category and a new itinerary.
4. The method of causing a computer system to recommend a rideshare according to claim 1, wherein the generating a cost value step further includes:
computing, in the data processor, an itinerary cost value by determining a detour required to establish the rideshare between an itinerary in a stored profile and the itinerary in the search criteria;
weighting the computed itinerary cost according to the user-defined priorities;
identifying at least one matching personal affinity category between the search criteria and the stored profile;
computing, for every matching personal affinity category, a personal affinity cost corresponding to a relative distance between values corresponding to the search criteria and values corresponding to the stored profile;
weighting the personal affinity costs according to the user-defined priorities; and
combining, in the data processor, the itinerary cost and personal affinity costs to generate the cost value.
5. The method of causing a computer system to recommend a rideshare according to claim 4, wherein the detour is determined relative to an overall distance traveled.
6. The method of causing a computer system to recommend a rideshare according to claim 4, wherein the detour is determined as an absolute distance value.
7. The method of causing a computer system to recommend a rideshare according to claim 4, wherein the detour is determined as an amount of time.
8. The method of causing a computer system to recommend a rideshare according to claim 4, wherein the detour is determined as a relative amount of time.
9. The method of causing a computer system to recommend a rideshare according to claim 1, further comprising:
receiving a review of a past rideshare; and
appending the review of the past rideshare to at least one of the stored profiles associated with the past rideshare.
10. The method of causing a computer system to recommend a rideshare according to claim 9, wherein the review of a past rideshare includes reviewing at least one of punctuality, dependability and safety.
11. The method of causing a computer system to recommend a rideshare according to claim 1, further comprising:
determining a user current position using a real-time user localization source; and
overlaying the user current position on an electronic map display.
12. The method of recommending a rideshare according to claim 1, further comprising:
exchanging, between at least two of a credit account of a rider, a credit account of a driver and a third-party credit account, a credit corresponding to a rideshare in which the driver and the rider participated.
13. The method according to claim 1, wherein when the rideshare finalizing information is displayed, the rideshare finalizing information includes contact information corresponding to the selected user profile.
14. The method according to claim 1, wherein when the rideshare finalizing information is displayed, the rideshare finalizing information includes a predetermined meeting location and time.
15. The method of causing a computer system to recommend a rideshare according to claim 1, wherein the updating further includes deleting, from the user profile, a personal affinity category.
16. A system for recommending a rideshare, comprising:
an electronic storage device configured to store a plurality of user profiles;
a receiver configured to receive a search criteria including at least one itinerary and at least one personal affinity category identifying at least one personal user interest, the at least one itinerary and at least one personal affinity category being weighted according to user-defined priorities;
a processor configured to generate a cost value for each of the plurality of user profiles stored in the electronic storage device, and configured to determine a display list of user profiles and corresponding cost values;
a transmitter configured to transmit the user profiles corresponding to the display list over a communications network,
wherein the transmitter sends an anonymous message requesting a rideshare to a communications address of a selected profile, and transmits one of an anonymous denial message in response to a rideshare rejection or a rideshare finalizing information, including at least one of a phone number and an email address, in response to a rideshare acceptance, and
wherein the processor is further configured to update a user profile according to at least one other profile corresponding to a history of past rideshare acceptances by
identifying other user profiles, stored in the electronic storage device, corresponding to a rideshare history of the user profile,
determining, in the processor, matching personal affinity categories between the other user profiles and the user profile,
updating, in the user profile, values corresponding to the matching personal affinity categories according to the other user profiles, and
updating, in the user profile, at least one itinerary according to itineraries corresponding to the other user profiles, wherein for each matching personal affinity category corresponding values are copied from other user profiles to the user profile.
17. The system for recommending a rideshare according to claim 16, wherein the processor is further configured to compare the generated cost values corresponding to the stored user profiles to a predetermined threshold, and only the stored user profiles having a cost value below the predetermined threshold are displayed.
18. The system for recommending a rideshare according to claim 16, further comprising:
a real-time user localization unit configured to receive a current position of a user,
wherein the transmitter is further configured to transmit a graphical interface including an electronic map showing the current position of the user.
19. The system for recommending a rideshare according to claim 18, wherein the electronic map also displays a current capacity of a user corresponding to the current position.
20. The system for recommending a rideshare according to claim 19, wherein the processor is configured to account for a user travel direction and speed in computing the cost value.
21. The system according to claim 16, wherein when the rideshare finalizing information is displayed, the rideshare finalizing information includes contact information corresponding to the selected user profile.
22. The system according to claim 16, wherein when the rideshare finalizing information is displayed, the rideshare finalizing information includes a predetermined meeting location and time.
23. The method of causing a computer system to recommend a rideshare, according to claim 1, wherein the user interest includes at least one of books, movies, sports and hobbies.
24. A non-transitory computer-readable medium storing computer-readable instructions thereon, the computer readable instructions when executed by a computer cause the computer to perform a method for rideshare recommendation, comprising:
generating a search criteria according to user-defined inputs including at least one itinerary and at least one personal affinity category identifying at least one personal user interest, the personal affinity category being separate from the at least one itinerary;
generating a cost value for each of a plurality of stored user profiles according to the search criteria, each stored user profile including at least one itinerary and one personal affinity category;
displaying anonymously at least one of the stored user profiles and a corresponding cost value on a display;
transmitting a first anonymous message to a communication address corresponding to a selected user profile, the anonymous message requesting a rideshare;
receiving a second anonymous message from the communication address corresponding to the selected user profile, the second anonymous message indicating one of acceptance or rejection of the rideshare;
displaying one of a contact information, including at least a phone number or an email address, included in the selected user profile upon receipt of an acceptance and an anonymous denial message upon receipt of a rejection, wherein the at least one itinerary and the at least one personal affinity category of the search criteria are weighted to generate the cost values according to a plurality of user-defined priorities; and
updating a user profile according to at least one other profile corresponding to a history of past rideshare acceptances by
identifying other user profiles corresponding to a rideshare history of the user profile,
determining matching personal affinity categories between the other user profiles and the user profile,
updating values corresponding to the matching personal affinity categories according to the other user profiles, and
updating at least one itinerary according to itineraries corresponding to the other user profiles, wherein for each matching personal affinity category corresponding values are copied from other user profiles to the user profile.
25. The non-transitory computer-readable medium according to claim 24, further comprising:
comparing the generated cost values corresponding to the stored user profiles to a predetermined threshold,
wherein only the stored user profiles having a cost value below the predetermined threshold are displayed.
26. The non-transitory computer-readable medium according to claim 24, wherein the generating a cost value step further includes:
computing an itinerary cost value by determining a detour required to establish the rideshare between an itinerary in a stored profile and the itinerary in the search criteria;
weighting the computed itinerary cost according to the user-defined priorities;
identifying at least one matching personal affinity category between the search criteria and the stored profile;
computing, for every matching personal affinity category, a personal affinity cost corresponding to a relative distance between values corresponding to the search criteria and values corresponding to the stored profile;
weighting the personal affinity costs according to the user-defined priorities; and
combining the itinerary cost and personal affinity costs to generate the cost value.
27. The non-transitory computer-readable medium according to claim 24, wherein updating the user profile also includes adding at least one of a new personal affinity category and a new itinerary.
28. The non-transitory computer-readable medium according to claim 24, further comprising:
receiving a review of a past rideshare; and
appending the review of the past rideshare to at least one of the stored profiles associated with the past rideshare.
29. The non-transitory computer-readable medium according to claim 24, further comprising:
exchanging, between at least two of a credit account of a rider, a credit account of a driver and a third-party credit account, a credit corresponding to a rideshare in which the driver and the rider participated.
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 regenerating apparatus for a filter provided in an exhaust pipe of an internal combustion engine, wherein particulate material is collected in the filter and incombustible impurity is contained in the collected particulate material, comprising:
particulate detecting means for detecting a first parameter whose value is correlative with and predicts an amount of the collected particulate material;
impurity detecting means for detecting a second parameter whose value is correlative with and predicts an amount of the incombustible impurity contained in the collected particulate material;
regenerating means for burning the collected particulate material;
control means for controlling the regenerating means to selectively perform
a partial regenerating process in which a part of the collected particulate material is burnt to an extent that the impurity can not easily pass through the filter, and
a perfect regenerating process in which a substantially entire part of the collected particulate material is burnt to an extent that the impurity can easily pass through the filter,
wherein the partial regenerating process starts when the value of the first parameter exceeds a first threshold and terminates when the value of the first parameter falls below a second threshold that is smaller than the first threshold and the perfect regenerating process starts when the value of the second parameter meets a predetermined condition and terminates when the value of the first parameter falls below a third threshold that is smaller than the second threshold.
2. A regenerating apparatus according to claim 1, wherein the filter includes a catalyst for facilitating burning of the particulate material and the regenerating means includes a throttle valve, an exhaust gas recirculation valve and an injector and, further,
wherein, when the collected particulate material is burnt by the regenerating means, the control means executes at least one of first to third controls, the first control being to retard start timing of main fuel injection of the injector in a combustion cycle from that at a time immediately before burning the collected particulate material, second control being to further inject fuel from the injector after finishing the main fuel injection in the combustion cycle, and third control being to lessen an opening degree of at least one of the throttle valve and the exhaust gas recirculation valve compared to that at a time immediately before burning the collected particulate material.
3. A regenerating apparatus according to claim 1, wherein a value of the second threshold predicts that the collected particulate material is remained in the filter by an amount not less than 1 gram per liter of the filter and not more than 4 grams per liter of the filter.
4. A regenerating apparatus according to claim 1, wherein a value of the third threshold predicts that the particulate material is remained in the filter by an amount not less than 0.05 gram per liter of the filter and not more than 0.25 grams per liter of the filter.
5. A regenerating apparatus according to claim 1, wherein the second parameter is a cumulative driving mileage reset at a time when the immediately previous perfect regenerating process terminates.
6. A regenerating apparatus according to claim 1, wherein the second parameter is a cumulative fuel injection amount reset at a time when the immediately previous perfect regenerating process terminates.
7. A regenerating apparatus according to claim 1, wherein the second parameter is a cumulative number of times of the partial regenerating processes reset at a time when the immediately previous perfect regenerating process terminates.
8. A method for regenerating a filter provided in an exhaust pipe of an internal combustion engine, wherein particulate material is collected in the filter and incombustible impurity is contained in the collected particulate material, the method comprising steps of:
detecting a first parameter whose value is correlative with and detectable an amount of the collected particulate material;
detecting a second parameter whose value is correlative with and detectable an amount of the incombustible impurity contained in the collected particulate material; and
burning the collected particulate material through a selected one of first and second processes, the first process being a partial regenerating process in which a burn of the collected particulate material starts, when the value of the first parameter exceeds a first threshold, and terminates, when the value of the first parameter falls below a second threshold that is smaller than the first threshold, whereby a part of the collected particulate material is burned to an extent that the impurity can not easily pass through the filter and the second process is a prefect regenerating process in which the burn of the collected particulate material starts, when the value of the second parameter meets a predetermined condition, and terminates, when the value of the first parameter falls below a third threshold that is smaller than the second threshold, whereby a substantially entire part of the collected particulate material is burnt to an extent that the impurity can easily pass through the filter.
9. A method according to claim 8, wherein the filter includes a catalyst for facilitating burning of the particulate material and the regenerating means includes a throttle valve, an exhaust gas recirculation valve and an injector, further, comprising steps of:
executing at least one of first to third control, when the collected particulate material is burnt,
wherein the filter includes a catalyst for facilitating burning of the particulate material, the first control being to retard start timing of main fuel injection of the injector in a combustion cycle from that at a time immediately before burning the collected particulate material, second control being to further inject fuel from the injector after finishing the main fuel injection in the combustion cycle, and third control being to lessen an opening degree of at least one of the throttle valve and the exhaust gas recirculation valve compared to that at a time immediately before burning the collected particulate material.
10. A method according to claim 8, wherein a value of the second threshold predicts that the collected particulate material is remained in the filter by an amount less than 1 gram per liter of the filter and not more than 4 grams per liter of the filter.
11. A method according to claim 8, wherein a value of the third threshold predicts that the particulate material is remained in the filter by an amount not less than 0.05 gram per liter of the filter and not more than 0.25 grams per liter of the filter.
12. A regenerating apparatus for a filter provided in an exhaust pipe of an internal combustion engine, wherein particulate material is collected in the filter, comprising:
first detecting means for detecting a first parameter whose value is correlative with and predicts an amount of the collected particulate material;
second detecting means for detecting a second parameter whose value is correlative with and predicts a factor other than the amount of the collected particle material;
regenerating means for burning the collected particulate material;
control means for controlling the regenerating means to perform a partial regenerating process in which a part of the collected particulate material is burnt to an extent that the impurity can not easily pass through the filter, wherein the partial regenerating process starts when the value of the first parameter exceeds a first threshold and terminates when the value of the first parameter falls below a second threshold that is smaller than the first threshold, unless a value of the second parameter meets a predetermined condition.
13. A regenerating apparatus according to claim 12, wherein a value of the second threshold predicts that the collected particulate material is remained in the filter by an amount less than 1 gram per liter of the filter and not more than 4 grams per liter of the filter.
14. A regenerating apparatus according to claim 12, wherein incombustible impurity is contained in the collected particulate material, the value of the second parameter is correlative with and predicts an amount of the incombustible impurity contained in the collected particulate material, and the control means controls the regenerating means to perform a perfect regenerating process in which a substantially entire part of the collected particulate material is burnt to an extent that the impurity can easily pass through the filter, wherein the perfect regenerating process starts when the value of the second parameter meets a predetermined condition and terminates when the value of the first parameter falls below a third threshold that is smaller than the second threshold.
15. A method for regenerating a filter provided in an exhaust pipe of an internal combustion engine, wherein particulate material is collected in the filter, the method comprising steps of:
detecting a first parameter whose value is correlative with and detectable an amount of the collected particulate material;
detecting a second parameter whose value is correlative with and detectable a factor other than the amount of the collected particulate material; and
burning the collected particulate material through a partial regenerating process in which, unless the second parameter meets a predetermined condition, a burn of the collected particulate material starts, when the value of the first parameter exceeds a first threshold, and terminates, when the value of the first parameter falls below a second threshold that is smaller than the first threshold, whereby a part of the collected particulate material is burnt to an extent that the impurity can not easily pass through the filter.
16. A regenerating apparatus according to claim 12, wherein a value of the second threshold predicts that the collected particulate material is remained in the filter by an amount less than 1 gram per liter of the filter and not more than 4 grams per liter of the filter.
17. A process according to claim 12, wherein incombustible impurity is contained in the collected particulate material and the value of the second parameter is correlative with and predicts an amount of the incombustible impurity contained in the collected particulate material, further, comprising steps of:
performing a perfect regenerating process in which a substantially entire part of the collected particulate material is burnt to an extent that the impurity can easily pass through the filter, wherein the perfect regenerating process starts when the value of the second parameter meets the predetermined condition and terminates when the value of the first parameter falls below a third threshold that is smaller than the second threshold.