Patent application number | Description | Published |
20100161717 | METHOD AND SOFTWARE FOR REDUCING SERVER REQUESTS BY A BROWSER - This disclosure provides various embodiments of systems, software, and computerized methods for reducing the number of server requests sent to a web server. In one aspect, the software generates a file reference uniquely identifying a version of a file capable of being cached by a requester. The file reference can comprise a network-addressable location of the version of the cacheable file and a parameter uniquely identifying the version of the cacheable file, where the parameter is separated from the network-addressable location of the version of the cacheable file. The software can further embed the file reference into a web page file, and send the web page file in response to a request for the web page. The parameter may include a plurality of data elements, such as a second instance of the file name, a timestamp, or a version number of the cacheable file. | 06-24-2010 |
20110125545 | COMPUTER IMPLEMENTED METHOD FOR INTEGRATING SERVICES IN A CALENDAR APPLICATION VIA MEETING REQUEST E-MAILS - The invention relates to a method for integrating services in a calendar application via the meeting request functionality of calendar programs comprising:
| 05-26-2011 |
20110137929 | COMPUTER IMPLEMENTED METHOD FOR INTEGRATING SERVICES IN A CALENDAR APPLICATION VIA WEB SERVICES - A computer readable storage medium having stored therein instructions executable by a processor, the instructions when executed by the processor, integrate a service in a calendar application and cause the processor to:
| 06-09-2011 |
20130103450 | COMPUTER IMPLEMENTATION METHOD FOR INTEGRATING SERVICES IN A CALENDAR APPLICATION VIA MEETING REQUEST E-MAILS - The invention relates to a method for integrating services in a calendar application via the meeting request functionality of calendar programs comprising:
| 04-25-2013 |
20130159028 | Raising User Satisfaction in an Automated Ride Sharing System - Embodiments of the present invention may provide a various techniques for raising user satisfaction with an automated ride sharing system. In one embodiment, the system may disqualify potential passengers that will force the driver to return to a previously departed area. In another embodiment, the system may consolidate multiple stop locations to reduce the number and frequency of stops in a scheduled ride. In another embodiment, the system may select a best possible ride from a plurality of calculated rides based on user satisfaction factors. | 06-20-2013 |
20130159055 | SYSTEM AND METHOD FOR EMPLOYING SELF-OPTIMIZING ALGORITHMS TO PROBE AND REACH REGIONS OF HIGHER CUSTOMER SATISFACTION THROUGH ALTERED SYSTEM PARAMETERS ON SURVEY RESULTS - A system and method described herein provide for the generation of self-optimization algorithms from user survey results for a complex system, such as a matching algorithm for a trip sharing service. User feedback surveys are generated and transmitted to users of the complex system to obtain feedback on a user's experience using the complex system. Survey results from completed surveys are compiled to demonstrate statistical evidence of alternations that can be made to adjust the settings of the complex system. The system and method may use the generated alternations by the complex system to modify the settings of the complex system. | 06-20-2013 |
20140173511 | PROCESS AND METHOD FOR INCREASING USAGE FOR A CARPOOLING SYSTEM - A backend carpooling system including a memory device, a processing device, a communication device, a calculating arrangement, coupled to the memory and processing devices, that includes one or more algorithms for calculating distances, travel times, routes, and performing optimizations to select a distance, travel time, or route satisfying predetermined optimization criteria, the calculating arrangement generating a plurality of ridesharing opportunities, and a notification arrangement, coupled to the communication device, that transmits the plurality of ridesharing opportunities to a user, wherein the plurality of ridesharing opportunities are periodically transmitted to the user. | 06-19-2014 |
20140180746 | RIDE SHARING CALENDAR ENTRY CLASSIFICATION - A time difference between a segment belonging to a multi-segment ride and a ride intent may be calculated. The time difference may be compared to a threshold. If the time difference is less than or equal to the threshold, the ride intent may be marked as a new segment of the multi-segment ride. The parameters of the segment belonging to the multi-segment ride and the ride intent may be specified through electronic calendar entries. The segment belonging to the multi-segment ride may be the first temporal segment of the multi-segment ride. | 06-26-2014 |
20140188775 | SHARED RIDE DRIVER DETERMINATION - Values of a variable affecting the determination of the driver of a shared ride may be calculated. Each value may be associated with a respective potential driver. An optimal value from the calculated values may be selected. A potential driver associated with the selected optimal value may be assigned as the driver of the shared ride. The variable may be carbon emission, electricity consumption, passenger to driver role ratio, driving distance, driving time, vehicle size, fuel efficiency, electricity to gasoline usage ratio, accident occurrence, vehicle safety, vehicle comfort, or vehicle speed. The optimal value may be the lowest value or the highest value from the calculated values. Each value may be calculated based on parameters specified by the respective potential driver. | 07-03-2014 |
20140324505 | Raising User Satisfaction in an Automated Ride Sharing System - Embodiments of the present invention may provide a various techniques for raising user satisfaction with an automated ride sharing system. In one embodiment, the system may disqualify potential passengers that will force the driver to return to a previously departed area. In another embodiment, the system may consolidate multiple stop locations to reduce the number and frequency of stops in a scheduled ride. In another embodiment, the system may select a best possible ride from a plurality of calculated rides based on user satisfaction factors. | 10-30-2014 |