This invention relates generally to procurement of services, and more particularly to aggregating collection of travel data.
Data about travel schedules is frequently unreliable. Even though flights, shuttles, and most other carriers are scheduled, in reality, flights are often late. And their lateness is not just random, but often occurs in flights arriving at a certain airport from a particular airport. Similarly, taxis are stuck in traffic jams at about the same time of day, and on the same routes. Any experienced traveler can add many verses to this litany of the contrast between theory and fact in travel schedules.
What is clearly needed is a system and method to aggregate actual travel data from travelers, so that transit delays can be anticipated and predicted and travelers can more accurately calculate travel schedules, such as, for example, the travel time required between the end of a meeting and the departure of the participants' flights. This information can be used to more accurately plan and schedule transportation for individuals and groups.
One embodiment of the invention includes a method and system to provide a mobile device a travel schedule in response to the mobile device remotely logging into a separate system, provide the mobile device Global Positioning Systems (GPS) data for way points of the scheduled travel; and receive a time and location data from the mobile device in response to the mobile device entering a way point of the scheduled travel. In one embodiment, the time and location data received is to be used to determine at least one of an average, minimum, or maximum time of travel between separate way points.
The present invention describes systems, clients, servers, methods, and computer-readable media of varying scope. In addition to the aspects and advantages of the present invention described in this summary, further aspects and advantages of the invention will become apparent by reference to the drawings and by reading the detailed description that follows.
In the following detailed description of embodiments of the invention, reference is made to the accompanying drawings in which like references indicate similar elements, and in which is shown by way of illustration specific embodiments in which the invention may be practiced. These embodiments are described in sufficient detail to enable those skilled in the art to practice the invention, and it is to be understood that other embodiments may be utilized and that logical, mechanical, electrical, functional, and other changes may be made without departing from the scope of the present invention. The following detailed description is, therefore, not to be taken in a limiting sense, and the scope of the present invention is defined only by the appended claims.
A system level overview of the operation of one embodiment of an automatic services exchange system 100 is described by reference to
The services available through the exchange component 101 include travel services, entertainment service, personal services (e.g., haircutting), educational services, business administrative services and the like. Some services may be time critical, e.g., a dinner reservation at a particular time. The service request specifies other required criteria for the service, such as location (e.g., a certain geographic area), type, duration, quantity, price information (e.g., preferred price or price range and maximum price), etc. Additionally, a single service request may actually require services from multiple different service providers which are linked or associated. For example, if a user is planning a business trip, the request will often require services from airlines, hotels and car rental agencies and perhaps other services which are linked to or associated with the business trip.
The automatic services exchange component 101 automatically sends the service request to various service providers. In one embodiment, this transmission may be through several different electronic communication media such as structured e-mail, XML, IVR, etc. In the event that the exchange component 101 is unable to automatically procure the service requested by the user, the request is transferred to the backup call center component 103. For example, assume that request C 115 from user C 113 could not be automatically fulfilled by the exchange component 101. As illustrated in
Assuming there is at least one positive reply, the broker 131 sends a response 127 to the requestor 121 with the results indicating at least one response matched the request. Depending on parameters set by the requestor 121, if multiple positive replies are received by the broker 131, the broker may choose the best match based on the required or predetermined criteria or it may send responses for all the positive replies to the requestor 121 for selection. The requestor 121 may also authorize the broker 131 to contract for the service under certain circumstances without waiting for approval from the requestor 121. A match to request typically means that the response from the service provider is within the range of acceptable requesting parameters such as time of service, location of service, price of service, level (e.g., quality requested) of service, and other parameters specified by the request.
As illustrated in phantom in
Also shown in phantom in
The broker 131 reviews, through an automatic machine implemented process, the service requests to determine if the service request is actually a request for multiple services, such as multiple services which are linked or associated such as those associated with an event (e.g., a business trip which requires airline tickets, rental car reservation and hotel reservation). The resulting operation is illustrated in
The particular methods of the invention are now described in terms of computer software with reference to a series of flowcharts. The methods to be performed by a computer constitute computer programs made up of computer-executable instructions illustrated as blocks (acts). Describing the methods by reference to a flowchart enables one skilled in the art to develop such programs including such instructions to carry out the methods on suitably configured computers (e.g., the processor of the computer executing the instructions from computer-readable media). The computer-executable instructions may be written in a computer programming language or may be embodied in firmware logic. If written in a programming language conforming to a recognized standard, such instructions can be executed on a variety of hardware platforms and for interface to a variety of operating systems. In addition, the present invention is not described with reference to any particular programming language. It will be appreciated that a variety of programming languages may be used to implement the teachings of the invention as described herein. Furthermore, it is common in the art to speak of software, in one form or another (e.g., program, procedure, process, application, module, logic . . . ), as taking an action or causing a result. Such expressions are merely a shorthand way of saying that execution of the software by a computer causes the processor of the computer to perform an action or a produce a result.
Referring first to
The service request method 200 processes the replies for each request separately as illustrated by request loop starting at block 209. It will be appreciated that multiple request loops may be running concurrently. The requestor may specify a time which is associated with a deadline for completion of a search for a match to a request. In one embodiment, the requestor specifies a predetermined required period of time (time out period or deadline) within which replies must be received or by which time the requestor should be contacted by the exchange to inform the requestor of the incomplete status of a request. In another embodiment, the time out period is determined by the method 200 based on time criteria specified in the request. The request loop waits at block 209 until an incoming reply is received or until the time out period expires. When the request loop is activated by an incoming reply (block 211), the reply is recorded at block 213. If all replies have not yet been received, the request loop returns to its wait state. If all replies have been received, the particular request loop ends (block 215) and the method 200 proceeds to block 217 to evaluate the replies. Alternatively, if the time out period expires before any or all replies are received, the method 200 also proceeds to block 217. The time out period can provide the exchange system with some time to attempt to “manually” (through the intervention of a human operator) procure the service with enough time before the service is actually required. If the user/requestor fails to specify a time out period, the exchange system may specify a default time out period which is at least several hours before the requested time of the service (e.g., a 4:30 p.m. time out for a dinner reservation at 7:30 p.m.) or at least one day before the requested date of the service. Further, this time out period also allows the requestor to be notified of a failure to procure a service before the time requested for the service so that the requestor can take appropriate actions.
At block 217, the method 200 determines if any positive replies were received. If not, the corresponding request is transferred to the backup call center (which includes human operators) for processing along with all replies (block 219) so the backup call center knows the current status of the request (e.g., who has replied to the request, who has not, etc.). The processing represented by block 219 is described in more detail in conjunction with
If multiple services were requested, the method 200 determines if at least one service provider has replied positively to each service request (block 221). Requests that cannot been procured are sent to the backup call center at block 219, while positive replies are processed at block 223 (e.g., by sending out confirmations to the requestor and the service providers to secure the providing of the service). Similarly, if only one service was requested and at least one reply is positive, the method 200 proceeds to block 223 to process the reply. The processing represented by block 223 is described next.
One embodiment of a process reply method 230 is illustrated in
If more than one match is wanted at block 235 (as specified by a predetermined preference sent by the requestor or as set as a default by a system of the exchange service), a response containing all positive replies is sent to the requestor for selection (block 247) and the method 230 waits to receive approval of one of the providers at block 249. As in the case of a single reply, the method 230 contracts for or otherwise reserves the service from the approved provider at block 241 and returns a confirmation message at block 243, or the request is terminated if no approval is received.
Turning now to
The first positive reply at block 269 causes the method 260 to determine if the requester has authorized the automatic services exchange system to automatically procure the service (block 277). If so, the method 260 contracts or otherwise reserves the service from the corresponding service provider (block 279) and sends a confirmation request confirmation to the requestor that the service has been procured (block 281). If, however, there is no authorization at block 277, the information in the reply is sent to the requestor (block 283) and the method 260 waits to receive approval from the requestor. If approval is received (block 285), the method 260 contracts for or otherwise reserves the approved service and sends a confirmation as previously described. However, if approval of the particular service is not received from the requestor, a failure message is sent to the requester at block 272.
As described previously, the automatic services exchange system optionally can send change notices to the requester to alert him/her of changes in a procured service or receive a modified request from the requestor even after the services have been procured. One embodiment of a service change method 300 that communicates changes is illustrated in
The particular methods performed by computers acting as the automatic services exchange and backup call center components for one embodiment of the invention have been described with reference to flowcharts in
The following description of
The web server 9 is typically at least one computer system which operates as a server computer system and is configured to operate with the protocols of the World Wide Web and is coupled to the Internet. Optionally, the web server 9 can be part of an ISP which provides access to the Internet for client systems. The web server 9 is shown coupled to the server computer system 11 which itself is coupled to web content 10, which can be considered a form of a media database. It will be appreciated that while two computer systems 9 and 11 are shown in
Client computer systems 21, 25, 35, and 37 can each, with the appropriate web browsing software, view HTML pages provided by the web server 9. The ISP 5 provides Internet connectivity to the client computer system 21 through the modem interface 23 which can be considered part of the client computer system 21. The client computer system can be a personal computer system, a network computer, a Web TV system, a handheld wireless device, or other such computer system. Similarly, the ISP 7 provides Internet connectivity for client systems 25, 35, and 37, although as shown in
Alternatively, as well-known, a server computer system 43 can be directly coupled to the LAN 33 through a network interface 45 to provide files 47 and other services to the clients 35, 37, without the need to connect to the Internet through the gateway system 31.
It will be appreciated that the computer system 51 is one example of many possible computer systems which have different architectures. For example, personal computers based on an Intel microprocessor often have multiple buses, one of which can be an input/output (I/O) bus for the peripherals and one that directly connects the processor 55 and the memory 59 (often referred to as a memory bus). The buses are connected together through bridge components that perform any necessary translation due to differing bus protocols.
Network computers are another type of computer system that can be used with the present invention.
Network computers do not usually include a hard disk or other mass storage, and the executable programs are loaded from a network connection into the memory 59 for execution by the processor 55. A Web TV system, which is known in the art, is also considered to be a computer system according to the present invention, but it may lack some of the features shown in
It will also be appreciated that the computer system 51 is controlled by operating system software which includes a file management system, such as a disk operating system, which is part of the operating system software. One example of an operating system software with its associated file management system software is the family of operating systems known as Windows® from Microsoft Corporation of Redmond, Wash., and their associated file management systems. The file management system is typically stored in the non-volatile storage 65 and causes the processor 55 to execute the various acts required by the operating system to input and output data and to store data in memory, including storing files on the non-volatile storage 65.
One embodiment of the present invention permits group members to add additional reservations onto an existing reservation of a group leader, supervisor or any other member of the group in such a manner as to synchronize travel plans and coordinate locations, etc., both in terms of travel time, sharing rides, staying at the same hotel, tee times, and other services one may desire when attending an event. But rather than book all group members at once, individual group members may make plans separately, to accommodate instances in which group members are, for example, traveling from different locations, or are arriving at different times, etc. For example, a sales person may be coming from a different customer site in another city, while the marketing person and the technical person may be coming from the home office.
Thus in the example embodiment shown in
The system illustrated in
Yet in some cases, if a member needs to come in late, for example due to a previous meeting, he may not share in some aspects, such as the share car ride for example etc. In other circumstances, if a member needs special facilities, not available at the hotel/car/flight chosen for the group, the member may break out of the group arrangements. This may be on a case by case basis, with approval and or notification of the group leader, his supervisor etc., or may be pre-defined in the member's profile in some cases.
In yet other cases, a user may be able to forward their service request in an automatic fashion. For example, a user could initiate a group by inviting others to join for a meeting at a specific date, time, and location. Once they have done this, they have formed a group. Once one member of the group has booked their travel for this particular meeting, they would be prompted to see if they are willing to share their itinerary with the other members of the group. If they give permission for the other members to see the itinerary, all other members of the group would be automatically notified by the system. When notified, the other members of the group would be given options to book similar or identical services. When other group members select an option, a service request such as (123) in
Just before, or during, the travel unexpected events may occur that necessitate changes to the travel plans. For example, two parties may plan to travel and meet in a third city, but then one is delayed. To accommodate such occurrences, one embodiment of the present invention provides a process to automatically and dynamically identify an entity to adjust the pre-established travel plans to accommodate one or more of the travelers.
This rebooking of the flights and rides, etc., obviously could be done manually on a person-by-person basis, but preferably one group manager (e.g., an assistant or group member) could do the rebooking for the whole group. In one embodiment, the group manager doing the rebooking could be a robotic software agent or entity, being present as part of the reservation system and following certain preprogrammed rules.
In step 703, the GSMS notifies the manager of the changes that must take place to arrange rebooking all arrangements (different services, including such as hotel rooms, restaurant reservations, flights, limos, rental cars, deliveries etc.) of the event (locations, rides, hotel rooms, meetings, Web conferences, Audio conferences, catering, etc.). In some cases, the GSMS may need to offer alternatives. For example, a subset of invitees or listed attendees for a scheduled meeting (M1) that needs to be rescheduled, may be unable to attend the rescheduled meeting M1R (possibly due to a calendar conflict), and thus the meeting would have to be canceled.
Based on such scenarios, and rules as they may be stored for the event group in group database 610, or general rules of the enterprise or organization, in step 704 one or multiple options may be offered to the group manager, who may then make the decision and confirm selection of one among the offered options. In step 705, the GSMS rebooks arrangements as necessary and confirms all the arrangements, including flights, transportation, hotels, restaurants, etc. In step 706 the GSMS issues alerts and notifies all the parties in the group of the travel arrangements.
In one embodiment, it may be further useful for the system 700 according to the present invention also to know how to modify these options based on a user's profile. For example, a traveler's home location, unique starting destination, past list of flights, and/or necessary arrival times based for scheduled meetings of the traveler's original itinerary.
In one embodiment, the system might also do a quick calendar check before displaying the user's flight or other travel options, and show a visual alert to the respective traveler that existing travel arrangements may be in conflict with proposed changes.
Also, as changes occur in real time, a quick response is necessary, and in some cases, if an appointed group agent cannot respond in time, the system may escalate according to a set of rules to switch over to an automatic assumption of the role of group manager by the above-mentioned software agent. Such a change may be required, for example, if the group agent is on a plane himself, or in a different time zone, etc., and cannot be reached until after a time at which a decision for rebooking must be made. Alternatively, the system may escalate directly (i.e., if it knows the agent is not reachable) or it may first escalate to a backup designated agent. Further, in some cases, the system can automatically offer options to the user via email when they accept or decline original meeting invitation.
Furthermore, in some cases, the system can also take into account “criticality” of each resource and event when suggesting options or making decisions for the group. For instance, if the VP of Sales is designated as a critical person for a meeting, then first try to move his travel plans if meeting has to change. In case his requirements can't accommodate a new meeting time or location, then, for example, the system might not automatically move others, because meeting shouldn't happen without him.
It is clear, that many modifications may be made, without departing from the spirit of the invention. For example, a shared screen may be offered allowing all members of the group to concurrently view availability, and decide over a multitude of alternative options.
The embodiments as described herein allow for very efficient procurement of services, such as, for example, synchronization of business travel plans, within an existing organizational infrastructure. It also reduces the overhead for auxiliary personnel, such as assistants and secretaries trying to coordinate the plans of many group members. It is clear that many modifications and variations of this embodiment may be made by one skilled in the art without departing from the spirit of the novel art of this disclosure. For example, in some cases, such system and method can be used by consumers to similarly coordinate family gatherings/trips, etc.
The nature and purpose of the meeting dictates the list of people that must attend. In particular, some people may be required to attend in person, whereas others may be allowed, but not required, to attend in person. The system should allow the input of each person and a relative level of importance for attendance. In addition, the system should allow the input of whether each person is needed in person or if they can attend virtually. This will drive the dependencies of the service types and details scheduled by the system for the users. Yet others may not even be allowed to attend in person, but only to attend virtually. Based on the list of people and their attendance modes, already a certain number of venues may be considered, while others are eliminated. Additionally, because people are located in different places, arrangements must be made for their travel, accommodations, etc.
For example, if five people are to be in a meeting, two could be ranked as highly required to be present physically, meaning that the meeting cannot happen without their physical presence in the meeting location, two could be ranked as required, but can attend virtually; and one could be ranked as optional. The system would then look at their calendars and the service availability needed to pull this meeting together. For instance, if the predetermined meeting location is in New York and the Highly Required meeting attendee 1 is planning to be in San Francisco for a meeting at 8 pm-9 pm the previous day, the system would check for flights that leave at some time after the 9 pm meeting (likely starting at 11 pm to account for driving time to the airport and check-in time). If a flight leaves after 11 pm and arrives in time for the 9 am meeting in New York, including estimated driving time, then the system could auto-accept the meeting for that user and pre-plan all of his travel arrangements as well. If there is a conflict such that his physical presence cannot be accommodated at 9 am based on his previous meeting, the system would give the users the option of moving the 9 am meeting to 12 pm or some time that works for all involved parties. Once that time is vetted and accepted by the system rules and dependencies, then the meeting is scheduled and all ancillary services are automatically scheduled by the system, including travel arrangements, conference room reservations, web conference reservation, catering (for the number of people physically present), etc. If something about the meeting details or the attendees changes, the system would reexamine all of the dependencies and the services that are scheduled and make the appropriate adjustments to the meeting time, services or people attending.
Another feature of this system is the ability to find the best meeting time for a group of people. The meeting organizer can input into the system some of the details of the meeting such as desired location (if known), duration, agenda, invitees and their criticality to the meeting, including whether virtual or physical presence is required, etc. The system would then scan the invited attendees schedules (in Outlook, Notes, this system or some other system), determine who is required and who is not, determine if they can be present or not based on flight schedules and other dependencies, and either determine the optimal time and place to have the meeting or show the user a list of ranked options that he can choose from. Alternatively, the system can offer a bunch of predefined time and location options to the attendees and they can each respond with their preferences for each option. The system would then determine the optimal time based on these user-input preferences.
Based on the initial requirements of the meeting input in step 801, and the edit and review of parameters in step 802, invitations to the meeting are issued in step 803. Then responses to the invitations are received in step 804. In step 804b, the completeness of the those responses is compared to a pre-set threshold of completeness. The completeness does not have to be 100 percent, but if perhaps 80 percent have responded, that is enough to proceed with plans, or if 18 out of 25 persons who must attend in person have responded positively. This threshold used to decide completeness typically would also be part of the parameters set in step 802 above, but might be entered separately, or might conform to a set of corporate rules etc. (not shown). If the completeness level has not been achieved by a certain date, the process loops back to step 803 to send invitation reminders, and so on until the desired completeness level has been achieved.
The process then continues in step 805. Based on the responses and choices of the attendees, some of whom will attend in person and others of whom will attend virtually, a cost analysis is performed in step 805. This analysis optimizes both the venue and any travel costs involved, such as transportation (usually air), hotel, and any other required resources, such as auto rental, meals, and, for virtual attendees, the cost of using video-, web-, or teleconferencing equipment. This optimization happens in interaction with a services transaction system, such as the Reardon Services Platform 806, that is important to the novel art of this disclosure. This interaction optimizes the costs of all the meeting elements, taking into consideration less obvious cost aspects, such as time lost in travel and the salary value to the company of various attendees, so travel time is optimized not necessarily just by the number of people traveling, but by the total value to the company. Other parameters may be used as well to optimize value. Further, there may be certain limitations, such as that some people may be unable to travel, which would give them a greater weight in a decision made by the system, as compared to other people, just based on salary, lost work time, impacted projects, etc.
After all these optimizations have been done in step 805, in step 807 the system issues a final invitation with all the specifics of the meeting and venue, including an RSVP. The responses received in step 808 are used to finalize travel arrangements and other resources through the services transaction system 806, and then again, completeness of responses is checked in step 809. Once all the arrangements have been completed, the meeting is finalized in step 810 and tickets are issued, etc. All of the specific arrangements would be sent to the attendees (via email, calendar insertions, etc.) for each sub-component of the meeting (e.g. each travel segment, the meeting itself, sub-meetings within the overall meeting, etc.).
Further, in addition to gathering information on pricing of discrete items or services, information from the user community on the amenities in the hotel itself could be gathered. For example, information on whether there is a restaurant in the property and its price range, or whether the property has a van which they are willing to drive to and pickup from guests at local destinations, airports, etc. Also, the system could gather itemized details of services included in a “resort fee”, as some hotels charge, and try to attach a value to those, based on a traveler profile. For example, such a resort fee may include local phone access, 800 numbers etc, but not high speed interne access, so it my be valuable only to travelers having a dial up modem and a service with local access etc. It is clear, that the number and combination of such bundles and benefits is great, but shall all be considered as part of a total cost analysis.
This data could be, for example, communicated in real time from a mobile device while an employee is checking in or requesting authorization for a service. Likewise, a response may also be provided in real time as to what is or is not an acceptable fee in accordance with organizational rules.
All these modules 910 through 91x may interact primarily with the services transaction system 806. In some cases the interaction may be through system 806 via connections 910b, 911b, 912b, and 91xb and then back to database 901 via connection 901a, or in other cases the modules may interact directly with database 901 via connections 910c, 911c, 912c, and 91xc. And in yet other cases the primary interaction may be with database 901, and with only secondary interactions with services transaction system 806. The raw data in 901 is then managed by community pricing manager 920.
In pricing manager 920, various analyses are made and may be used to extract and estimate the true cost of services to generate comparable pricing information for various providers.
The analysis of these different modules, where in some cases the parking fee is covered and in others not, allows a much more direct comparison of the true cost of services to members of an organization using specific services.
It is clear that many modifications and variations of this embodiment may be made by one skilled in the art without departing from the spirit of the novel art of this disclosure. It is clear that the services subject to the novel art of this disclosure are not limited to those provided by hotels. Other examples are airlines, which may have all kinds of surcharges, such as fuel, food, ticket change, and others. Other examples may include shipping, where additional fees may apply due to, for example, packaging costs or fees for dealing with an inaccurate address, to name just a few.
An important element of the novel art of this disclosure is extracting from each of the cost models the lowest cost and thus creating a virtual competitor CR that offers a lower total cost. In
In the case of hotel rooms, for example, the cost components could be the costs of booking, cleaning, maintenance, amortization of investments (in furniture, equipment etc.), communications (phone, broadband Internet and TV), check-in and check-out, risk and amortization of purchase lease and/or market value of the property (adjustments for square footage of the rooms, for example, and location). Some of these cost components are a given, based on the property, but others can be changed by changing, for example, the communication equipment or service providers, or by subcontracting housekeeping, or by adjusting any of various other cost elements. By collecting as much information as possible through the service provisioning system, it can become clear where cost savings can be achieved, and by selecting a preferred partner, such cost saving ideas can be communicated to the partner without eliminating profit PR, resulting in the cost savings SA as shown in
It is clear that the applications of this system are not limited just to hotel costs. For example, this approach may also apply to flight services, where there is the cost of the fuel (which ties into the fuel efficiency of the fleet), the cost for the amortization and depreciation of the fleet equipment, costs of onboard services, cost of booking tickets, cost for airport services, cost for baggage handling services, cost for maintenance of the airplane, etc.
One other aspect where costs can be modified is by moving the risk cost from the service provider to the provisioning system. For example, the provisioning system could buy large blocks of rooms from a hotel, thus removing the risk from the hotel (or other provider) and allowing the organization to resell unused inventory in the free market. Risk cost can be quite high, especially during slow travel periods. Currently, hotels try to manage risk by inviting seminars or similar events to fill up space. Similarly, airlines may offer reduced travel rates to promote the sale of empty seats.
In cases where the signal from the traveler's device is not a schedule request, the software, after a secure login in step 1510, receives way-point data from the device in step 1511. It then adds that data to the database in step 1512, possibly as a type of log file. In some cases the software may continue to update average, minimum, and maximum travel times and other data being aggregated in step 1513, after which the process terminates in step 1514. In other cases the aggregation of step 1513 may be done in a separate procedure (not shown here), typically on a periodic basis. In one embodiment, the data is maintained anonymously, so rather than pursuing the exact time and location of an individual, the interest of the system is to aggregate the length of actual transit times as an average of a large group of travelers. In one embodiment, the average, minimum, and maximum travel times are generated across the typical day. Alternatively, the travel times may be generated as an average during a particular time of day (e.g. between noon and 2 pm) and taking into account special circumstances such as holidays or other events that may affect the data.
The processes described above can be stored in a memory of a computer system as a set of instructions to be executed. In addition, the instructions to perform the processes described above could alternatively be stored on other forms of machine-readable media, including magnetic and optical disks. For example, the processes described could be stored on machine-readable media, such as magnetic disks or optical disks, which are accessible via a disk drive (or computer-readable medium drive). Further, the instructions can be downloaded into a computing device over a data network in a form of compiled and linked version.
Alternatively, the logic to perform the processes as discussed above could be implemented in additional computer and/or machine readable media, such as discrete hardware components as large-scale integrated circuits (LSI's), application-specific integrated circuits (ASIC's), firmware such as electrically erasable programmable read-only memory (EEPROM's).
In addition, it is clear that many modifications and variations of this embodiment may be made by one skilled in the art without departing from the spirit of the novel art of this disclosure.
Whereas many alterations and modifications of the present invention will no doubt become apparent to a person of ordinary skill in the art after having read the foregoing description, it is to be understood that any particular embodiment shown and described by way of illustration is in no way intended to be considered limiting. Therefore, references to details of various embodiments are not intended to limit the scope of the claims which in them selves recite only those features regarded as essential to the invention.
This application is a continuation-in-part of and claims priority to co-pending U.S. application Ser. No. 11/027,115, entitled “Apparatus and Method to Provide Community Pricing,” filed Dec. 30, 2004 and co-pending U.S. application Ser. No. 11/093,615, entitled “Cost Model Analysis and Breakdown for Cost Buildup,” filed Mar. 29, 2005, all of which are incorporated herein by reference.
Number | Name | Date | Kind |
---|---|---|---|
4969136 | Chamberlin et al. | Nov 1990 | A |
5289531 | Levine | Feb 1994 | A |
5422816 | Sprague et al. | Jun 1995 | A |
5459859 | Senda | Oct 1995 | A |
5513126 | Harkins et al. | Apr 1996 | A |
5548515 | Pilley et al. | Aug 1996 | A |
5559707 | DeLorme et al. | Sep 1996 | A |
5623404 | Collins et al. | Apr 1997 | A |
5655081 | Bonnell et al. | Aug 1997 | A |
5765140 | Knudson | Jun 1998 | A |
5790974 | Tognazzini | Aug 1998 | A |
5802492 | DeLorme et al. | Sep 1998 | A |
5812844 | Jones et al. | Sep 1998 | A |
5875436 | Kikinis | Feb 1999 | A |
5892909 | Grasso et al. | Apr 1999 | A |
5966658 | Kennedy et al. | Oct 1999 | A |
5987377 | Westerlage et al. | Nov 1999 | A |
6009408 | Buchanan | Dec 1999 | A |
6091956 | Hollenberg | Jul 2000 | A |
6094681 | Shaffer et al. | Jul 2000 | A |
6104788 | Shaffer et al. | Aug 2000 | A |
6148261 | Obradovich et al. | Nov 2000 | A |
6157945 | Balma et al. | Dec 2000 | A |
6163748 | Guenther | Dec 2000 | A |
6177905 | Welch | Jan 2001 | B1 |
6249252 | Dupray | Jun 2001 | B1 |
6292830 | Taylor et al. | Sep 2001 | B1 |
6301533 | Markow | Oct 2001 | B1 |
6317686 | Ran | Nov 2001 | B1 |
6321158 | DeLorme et al. | Nov 2001 | B1 |
6336072 | Takayama et al. | Jan 2002 | B1 |
6370566 | Discolo et al. | Apr 2002 | B2 |
6381578 | DeMarcken | Apr 2002 | B1 |
6381640 | Beck et al. | Apr 2002 | B1 |
6389454 | Ralston et al. | May 2002 | B1 |
6392669 | Matoba et al. | May 2002 | B1 |
6414635 | Stewart et al. | Jul 2002 | B1 |
6457062 | Pivowar et al. | Sep 2002 | B1 |
6480830 | Ford et al. | Nov 2002 | B1 |
6484033 | Murray | Nov 2002 | B2 |
6496568 | Nelson | Dec 2002 | B1 |
6529136 | Cao et al. | Mar 2003 | B2 |
6549939 | Ford et al. | Apr 2003 | B1 |
6560456 | Lohtia et al. | May 2003 | B1 |
6574605 | Sanders et al. | Jun 2003 | B1 |
6578005 | Lesaint et al. | Jun 2003 | B1 |
6584489 | Jones et al. | Jun 2003 | B1 |
6591263 | Becker et al. | Jul 2003 | B1 |
6618668 | Laird | Sep 2003 | B1 |
6650902 | Richton | Nov 2003 | B1 |
6691029 | Hughes et al. | Feb 2004 | B2 |
6700535 | Gilkes et al. | Mar 2004 | B2 |
6801763 | Elsey et al. | Oct 2004 | B2 |
6826473 | Burch et al. | Nov 2004 | B1 |
6836537 | Zirngibl et al. | Dec 2004 | B1 |
6837427 | Overhultz et al. | Jan 2005 | B2 |
6944447 | Portman et al. | Sep 2005 | B2 |
6958692 | Ratschunas | Oct 2005 | B1 |
6980993 | Horvitz et al. | Dec 2005 | B2 |
7013149 | Vetro et al. | Mar 2006 | B2 |
7031998 | Archbold | Apr 2006 | B2 |
7035811 | Gorenstein | Apr 2006 | B2 |
7072886 | Salmenkaita et al. | Jul 2006 | B2 |
7080021 | McCulloch | Jul 2006 | B1 |
7124024 | Adelaide et al. | Oct 2006 | B1 |
7124087 | Rodriguez et al. | Oct 2006 | B1 |
7137099 | Knight et al. | Nov 2006 | B2 |
7139978 | Rojewski et al. | Nov 2006 | B2 |
7161497 | Gueziec | Jan 2007 | B2 |
7162254 | Smith | Jan 2007 | B1 |
7194417 | Jones | Mar 2007 | B1 |
7213048 | Parupudi et al. | May 2007 | B1 |
7280823 | Ternullo et al. | Oct 2007 | B2 |
7283970 | Cragun et al. | Oct 2007 | B2 |
7284002 | Doss et al. | Oct 2007 | B2 |
7289812 | Roberts et al. | Oct 2007 | B1 |
7296017 | Larcheveque et al. | Nov 2007 | B2 |
7330112 | Emigh et al. | Feb 2008 | B1 |
7340403 | DeMarcken | Mar 2008 | B1 |
7343165 | Obradovich | Mar 2008 | B2 |
7353182 | Missinhoun et al. | Apr 2008 | B1 |
7376662 | Caparas et al. | May 2008 | B2 |
7376735 | Straut et al. | May 2008 | B2 |
7394900 | Gerber et al. | Jul 2008 | B1 |
7409643 | Daughtrey | Aug 2008 | B2 |
7426537 | Lee et al. | Sep 2008 | B2 |
7428302 | Zirngibl et al. | Sep 2008 | B2 |
7441203 | Othmer et al. | Oct 2008 | B2 |
7565331 | Cutler et al. | Jul 2009 | B2 |
7599847 | Block et al. | Oct 2009 | B2 |
20010021928 | Ludwig et al. | Sep 2001 | A1 |
20010025314 | Matsumoto et al. | Sep 2001 | A1 |
20010029425 | Myr | Oct 2001 | A1 |
20020010604 | Block | Jan 2002 | A1 |
20020032591 | Mahaffy et al. | Mar 2002 | A1 |
20020057212 | Hamilton et al. | May 2002 | A1 |
20020065688 | Charlton et al. | May 2002 | A1 |
20020067308 | Robertson | Jun 2002 | A1 |
20020072938 | Black et al. | Jun 2002 | A1 |
20020077122 | Yule | Jun 2002 | A1 |
20020095454 | Reed et al. | Jul 2002 | A1 |
20020099613 | Swart et al. | Jul 2002 | A1 |
20020115430 | Hall | Aug 2002 | A1 |
20020116266 | Marshall | Aug 2002 | A1 |
20020123280 | Saiz | Sep 2002 | A1 |
20020143655 | Elston et al. | Oct 2002 | A1 |
20020178034 | Gardner et al. | Nov 2002 | A1 |
20020178226 | Anderson et al. | Nov 2002 | A1 |
20020198747 | Boyer et al. | Dec 2002 | A1 |
20030023499 | Das et al. | Jan 2003 | A1 |
20030028390 | Stern et al. | Feb 2003 | A1 |
20030033164 | Faltings et al. | Feb 2003 | A1 |
20030036928 | Kenigsberg et al. | Feb 2003 | A1 |
20030040944 | Hileman | Feb 2003 | A1 |
20030050964 | Debaty et al. | Mar 2003 | A1 |
20030055689 | Block et al. | Mar 2003 | A1 |
20030058842 | Bud | Mar 2003 | A1 |
20030120526 | Altman et al. | Jun 2003 | A1 |
20030120530 | Casati et al. | Jun 2003 | A1 |
20030126095 | Allen | Jul 2003 | A1 |
20030140172 | Woods et al. | Jul 2003 | A1 |
20030149781 | Yared et al. | Aug 2003 | A1 |
20030163251 | Obradovich et al. | Aug 2003 | A1 |
20030177045 | Fitzgerald et al. | Sep 2003 | A1 |
20030200146 | Levin et al. | Oct 2003 | A1 |
20030212486 | Hughes et al. | Nov 2003 | A1 |
20030220835 | Barnes, Jr. | Nov 2003 | A1 |
20030225600 | Slivka et al. | Dec 2003 | A1 |
20030233365 | Schmit et al. | Dec 2003 | A1 |
20040002876 | Sommers et al. | Jan 2004 | A1 |
20040019606 | Ackerman et al. | Jan 2004 | A1 |
20040064355 | Dorenbosch et al. | Apr 2004 | A1 |
20040064445 | Pfleging et al. | Apr 2004 | A1 |
20040064585 | Doss et al. | Apr 2004 | A1 |
20040088107 | Seligmann | May 2004 | A1 |
20040088392 | Barrett et al. | May 2004 | A1 |
20040102979 | Robertson et al. | May 2004 | A1 |
20040104977 | Mitsuhashi | Jun 2004 | A1 |
20040128196 | Shibuno | Jul 2004 | A1 |
20040133438 | Zeisset et al. | Jul 2004 | A1 |
20040193432 | Khalidi | Sep 2004 | A1 |
20040199411 | Bertram et al. | Oct 2004 | A1 |
20040215517 | Chen et al. | Oct 2004 | A1 |
20040220847 | Ogushi et al. | Nov 2004 | A1 |
20040249568 | Endo et al. | Dec 2004 | A1 |
20050010472 | Quatse et al. | Jan 2005 | A1 |
20050015316 | Salluzzo | Jan 2005 | A1 |
20050043974 | Vassilev et al. | Feb 2005 | A1 |
20050071245 | Norins et al. | Mar 2005 | A1 |
20050091005 | Huard | Apr 2005 | A1 |
20050125439 | Nourbakhsh et al. | Jun 2005 | A1 |
20050138187 | Breiter et al. | Jun 2005 | A1 |
20050187703 | Seligmann | Aug 2005 | A1 |
20050209772 | Yoshikawa et al. | Sep 2005 | A1 |
20050216301 | Brown | Sep 2005 | A1 |
20050227712 | Estevez et al. | Oct 2005 | A1 |
20050273373 | Walker et al. | Dec 2005 | A1 |
20060004511 | Yoshikawa et al. | Jan 2006 | A1 |
20060009987 | Wang | Jan 2006 | A1 |
20060010206 | Apacible et al. | Jan 2006 | A1 |
20060020565 | Rzevski et al. | Jan 2006 | A1 |
20060041477 | Zheng | Feb 2006 | A1 |
20060109106 | Braun | May 2006 | A1 |
20060129438 | Robinson | Jun 2006 | A1 |
20060206363 | Gove | Sep 2006 | A1 |
20060206412 | Van Luchene et al. | Sep 2006 | A1 |
20060220374 | Dorn et al. | Oct 2006 | A1 |
20060235754 | Walker et al. | Oct 2006 | A1 |
20060241983 | Viale et al. | Oct 2006 | A1 |
20060247954 | Hunt | Nov 2006 | A1 |
20070011034 | Jones et al. | Jan 2007 | A1 |
20070016514 | Al-Abdulqader et al. | Jan 2007 | A1 |
20070083327 | Brice et al. | Apr 2007 | A1 |
20070123280 | McGary et al. | May 2007 | A1 |
20070143153 | Ashby et al. | Jun 2007 | A1 |
20070162301 | Sussman et al. | Jul 2007 | A1 |
20070162328 | Reich | Jul 2007 | A1 |
20070208604 | Purohit et al. | Sep 2007 | A1 |
20080046298 | Ben-Yehuda et al. | Feb 2008 | A1 |
20080052159 | Balakrishnan | Feb 2008 | A1 |
20080103842 | Johnson | May 2008 | A1 |
20080126143 | Altman et al. | May 2008 | A1 |
20090101710 | Chakravarthy | Apr 2009 | A1 |
20090210261 | Mortimore, Jr. | Aug 2009 | A1 |
20090234564 | Onishi et al. | Sep 2009 | A1 |
20090248457 | Munter | Oct 2009 | A1 |
Number | Date | Country | |
---|---|---|---|
Parent | 11093615 | Mar 2005 | US |
Child | 11112376 | US | |
Parent | 11027115 | Dec 2004 | US |
Child | 11093615 | US |