This invention relates generally to procurement of services, and more particularly to coordinating the group procurement of services.
Often trips, particularly business trips, must be planned far in advance of the departure date. In some cases, it may happen that at the time of the trip, people that a traveler wants to meet with may be in the same area as the traveler. However, because no meeting has been scheduled to occur during the trip, a traveler may be unaware of the proximity of the people that he or she potentially wants to meet.
What is clearly needed is a system and method for a chance meeting planner that helps arrange meetings with people that a traveler may be interested in meeting but whose travel plans he was not aware of when the trip was planned, so he did not schedule a meeting with them during his trip.
One embodiment of the present invention includes a system and method for a chance meeting planner that helps arrange meetings with people that a traveler may be interested in meeting but whose travel plans he was not aware of when the trip was planned, so he did not schedule a meeting with them during his trip.
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.
For example, if Mark is traveling from San Francisco to Chicago and John is traveling from New York to Chicago, they may have the same evening available in Chicago. The system may propose a dinner meeting for them. Or if John is planning to fly back to New York that night, the system may propose, for example, that John take a late night flight (such as a flight at 10 or 11 p.m.), or even stay overnight in Chicago.
Other than using contact databases, the system may look for information about contacts and their travel plans and follow certain rules about “advertisement,” meaning that, for example, if Mark and John don't work for the same company, Mark may make his trip “private” so that even if John is on Mark's preferred list, John may not see that Mark is traveling. This feature is important for reasons such as, for example, a case where Mark decided he doesn't want to meet with John. Or in other cases, due to some current “political” situation between the two companies or between the persons, such a meeting may not be desired and the advertisement of the availability of such a meeting could create problems.
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
Trips, particularly business trips involving multiple persons, may often be complicated, multi-event expeditions that require a complex orchestration of events and services to meet all the requirements of all parties. Typically, a traveler would like to rely on a personal assistant who, from long experience, knows the preferences of the traveler and therefore can quickly and easily book all the arrangements for services and events of the trip. Even advanced travel service systems, such as Expedia, Travelocity, or airline vacation package services still require the user to specify each element separately. The only convenience offered to the user is that he does not need to seek another provider or re-enter this payment information for each booking. He still has to indicate each desired service separately.
What is clearly needed is a system and method for trip planning that, based on the specifics of the planned event and on a user profile compiled from historical experience and known user preferences, can propose a complete trip package instead of asking the user for responses on each element.
Further, the system 700 may extract certain location or context-specific information. For example, the system might have a history of typical travel times or patterns for a given city of a traveler. The system might also have data on what options for ground transportation exist at a given airport, such as, for example, shuttle, taxi, subway, and limo. The system would also know how to calculate the cost of the various modes of transportation. Similarly, the system might know how much the hotel charges for parking a car overnight and take that into account when making a recommendation. The contextual information could also include the availability of other services and factor that into decisions on how to plan the trip. For example, the system could know that at a certain airport rental offices (e.g., Laptop Lane) or a Wi-Fi hot spot are available etc. Based on this information, the system might determine that it is better to take certain layovers than others.
For example, in one embodiment, a personal preference editor 801 allows a user to view and modify records of his preferences. The records could be ordered by type of service (hotel, airline, ground transport, restaurant, etc.), or by location (i.e., when traveling to New York, when traveling to Boston etc.), or by customer/partner to be visited, etc.
In one embodiment, a personal preference wizard 802 could interview the user to initially obtain a comprehensive set of preferences. In one embodiment, a personal preferences parser 803 could, for example, parse a historical transaction databases 810, which can be extracted from system 710, for example a services reservation system.
In one embodiment, an interactive change monitor 804 could track interactive changes occurring during trips as changes are required and the user makes choices. These changes may then be recorded in preferences set 701a. In other cases, they may be culled on a regular basis by refresh reviewing of historic data.
One embodiment of the interactive change monitor 804 may also include the ability to generate automated updates of preferences based on past events or trips. For example, a traveler may consistently stay in a Hilton when visiting a certain city, or ask for certain amenities, etc. In one embodiment, the interactive change monitor 804 extracts these patterns and trends and adjust the preferences and hence the search results (or query) accordingly. As a result the traveler is presented with more targeted results in regards to what they are likely to select as a trip segment.
In one embodiment, preferences may be influenced by many factors and may vary according to each situation. Factors may include location, time of day, time of year, customer, country, and many other variables. Based on each factor or combination of factors, event or service preferences may vary.
For example, during the day in New York a traveler may prefer to use the subway, but at night (after 8 p.m.) the traveler may prefer to use a taxi or limo service. When meeting with a certain customer, he may have a particular restaurant preference, or for that specific customer his preference may be to let the customer choose the restaurant. In Los Angeles, the traveler may prefer a rental car, while in New York, he may prefer public transportation (subway by day; limo at night, as stated above). Hotel preferences may also vary, according to each location (city), according to the specific customer visited, or according to some other set or combination of factors.
In addition, in one embodiment the system may issue status updates based on location of a service provider. For example, it may alert a user that a limo is 15 minutes behind schedule based on GPS/driving time estimates and, if necessary, move a flight time based on the resulting schedule change.
In some cases, one embodiment may also be used for services unrelated or not directly related to travel. For example, an invitation to a meeting might first ask invitees if they will attend in person or virtually. If they elect to attend virtually, the system could arrange for audio and web conferencing or possibly video conferencing. Phone available time as discussed above may be scheduled during a trip to a meeting for another meeting. If they elect to attend in person, the system could arrange for travel, as described in the description. Other, additional types of services may also be scheduled through the system.
There are many situational elements that affect preferences, resulting in a complex set of preference rules that may be deduced from the traveler's historical selections and augmented by preference selections input by the traveler. These historical records and stated preferences are used to book a trip according to template 900, in one embodiment.
There may be different templates for a trip involving a single customer visit; a multi-event trip; a multi-city, multi-event trip; etc. Accordingly, one embodiment disclosed herein may automatically suggest templates based on the particulars of the trip, or the user may manually select a specific template type. For example, trips that are automatically planned may have an additional feature or parameter in personal calendar software or web based systems, such as MS Outlook/Exchange™, IBM Lotus Notes™, Yahoo Calendar, or other, similar software that causes the trip planner 700 to transfer the information to the services platform system 710 to be booked accordingly.
Further, in one embodiment trip planner 700 can then block out times for each segment of a trip. In one case, various components of the trip could be entered into a user's calendar with differing definitions of “busy.” For example, when a user is in a limo, the calendar might say that they are free for phone calls. Or in another example, the traveler might be available for email on certain flights, based on contextual information about airline email availability and the company's agreement and or rules for use of such facilities, etc.
In one embodiment, the system may offer a search function for previous bookings. For example, a user may search by keyword; such as finding all past trips with “Chicago” and “May” or “Hertz.” More generally, this feature may be a mechanism whereby a user can search all previous transactions.
In one embodiment, the system may automatically offer services based on event information. For example, if person's mother dies, it may suggest sending flowers, or if person's calendar says “Meeting in New York,” it may suggest a flight.
In one embodiment, automated rules-based changes to services may be included. For example, a terrorist attack in France could cause all flights to France in the next month to be canceled, so the system would send an alert to users. Similarly, automated changes may be based on status updates from service providers. For example, a flight cancellation due to bad weather may cause a travel record to be “protected” so that alternative flights are put in the passenger name record for a user rather than just canceling the whole trip.
Before final bookings are confirmed in one embodiment of the system may send a trip proposal to the user by email, for example, or may send an invitation for the user to review the proposal on a web page.
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).
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).
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.
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.
Number | Name | Date | Kind |
---|---|---|---|
4445181 | Yatman | Apr 1984 | A |
4626836 | Curtis et al. | Dec 1986 | A |
4862357 | Ahlstrom et al. | Aug 1989 | A |
4977520 | McGaughey et al. | Dec 1990 | A |
5111391 | Fields et al. | May 1992 | A |
5323314 | Baber et al. | Jun 1994 | A |
5475740 | Biggs et al. | Dec 1995 | A |
5570283 | Shoolery et al. | Oct 1996 | A |
5655008 | Futch et al. | Aug 1997 | A |
5692125 | Schloss et al. | Nov 1997 | A |
5732401 | Conway | Mar 1998 | A |
5832451 | Flake et al. | Nov 1998 | A |
5852812 | Reeder | Dec 1998 | A |
5854835 | Montgomery et al. | Dec 1998 | A |
5893077 | Griffin | Apr 1999 | A |
5897620 | Walker et al. | Apr 1999 | A |
5933810 | Okawa | Aug 1999 | A |
5960069 | Felger | Sep 1999 | A |
5960406 | Rasansky et al. | Sep 1999 | A |
5963913 | Henneuse et al. | Oct 1999 | A |
5966386 | Maegawa | Oct 1999 | A |
5974391 | Hongawa | Oct 1999 | A |
6016478 | Zhang et al. | Jan 2000 | A |
6078907 | Lamm | Jun 2000 | A |
6101480 | Conmy et al. | Aug 2000 | A |
6167379 | Dean et al. | Dec 2000 | A |
6195420 | Tognazzini | Feb 2001 | B1 |
6220512 | Cooper | Apr 2001 | B1 |
6230204 | Fleming | May 2001 | B1 |
6295521 | DeMarcken et al. | Sep 2001 | B1 |
6304850 | Keller et al. | Oct 2001 | B1 |
6307572 | DeMarcken et al. | Oct 2001 | B1 |
6324517 | Bingham et al. | Nov 2001 | B1 |
6441836 | Takasu et al. | Aug 2002 | B1 |
6442526 | Vance et al. | Aug 2002 | B1 |
6477520 | Malaviya et al. | Nov 2002 | B1 |
6506056 | DeMedio | Jan 2003 | B1 |
6529597 | Barrett | Mar 2003 | B1 |
6603489 | Edlund et al. | Aug 2003 | B1 |
6732103 | Strick et al. | May 2004 | B1 |
6781920 | Bates et al. | Aug 2004 | B2 |
6816882 | Conner et al. | Nov 2004 | B1 |
6847988 | Toyouchi et al. | Jan 2005 | B2 |
6889205 | Lamm | May 2005 | B1 |
6961773 | Hartman et al. | Nov 2005 | B2 |
6993430 | Bellesfield et al. | Jan 2006 | B1 |
7007080 | Wilson | Feb 2006 | B2 |
7013127 | Wills et al. | Mar 2006 | B2 |
7027995 | Kaufman et al. | Apr 2006 | B2 |
7050986 | Vance et al. | May 2006 | B1 |
7054825 | Hirahara et al. | May 2006 | B1 |
7080019 | Hurzeier | Jul 2006 | B1 |
7092892 | Sobalvarro et al. | Aug 2006 | B1 |
7139728 | Rigole | Nov 2006 | B2 |
7149700 | Munoz et al. | Dec 2006 | B1 |
7207009 | Aamodt et al. | Apr 2007 | B1 |
7212983 | Redmann et al. | May 2007 | B2 |
7222084 | Archibald et al. | May 2007 | B2 |
7233971 | Levy | Jun 2007 | B1 |
7236976 | Breitenbach et al. | Jun 2007 | B2 |
7277888 | Gelormine et al. | Oct 2007 | B2 |
7283970 | Cragun et al. | Oct 2007 | B2 |
7340402 | DeMarcken et al. | Mar 2008 | B1 |
7343312 | Capek et al. | Mar 2008 | B2 |
7360164 | Bjoernsen et al. | Apr 2008 | B2 |
7383291 | Guiheneuf et al. | Jun 2008 | B2 |
7389351 | Horvitz | Jun 2008 | B2 |
7409643 | Daughtrey | Aug 2008 | B2 |
7418409 | Goel | Aug 2008 | B1 |
7451392 | Chalecki et al. | Nov 2008 | B1 |
7471209 | Hartman et al. | Dec 2008 | B2 |
7487211 | Beavers et al. | Feb 2009 | B2 |
7603285 | Jacobs et al. | Oct 2009 | B2 |
7640548 | Yu et al. | Dec 2009 | B1 |
7668536 | Hull et al. | Feb 2010 | B2 |
20010014867 | Conmy | Aug 2001 | A1 |
20020022923 | Hirabayashi | Feb 2002 | A1 |
20020022981 | Goldstein et al. | Feb 2002 | A1 |
20020023230 | Bolnick et al. | Feb 2002 | A1 |
20020026336 | Eizenburg et al. | Feb 2002 | A1 |
20020032589 | Shah | Mar 2002 | A1 |
20020032592 | Krasnick et al. | Mar 2002 | A1 |
20020038180 | Bellesfield et al. | Mar 2002 | A1 |
20020046076 | Baillargeon et al. | Apr 2002 | A1 |
20020065689 | Bingham et al. | May 2002 | A1 |
20020069093 | Stanfield | Jun 2002 | A1 |
20020069094 | Bingham et al. | Jun 2002 | A1 |
20020091556 | Fiala et al. | Jul 2002 | A1 |
20020111845 | Chong | Aug 2002 | A1 |
20020131565 | Scheuring et al. | Sep 2002 | A1 |
20020154178 | Barnett et al. | Oct 2002 | A1 |
20020156661 | Jones et al. | Oct 2002 | A1 |
20030004746 | Kheirolomoom et al. | Jan 2003 | A1 |
20030004762 | Banerjee et al. | Jan 2003 | A1 |
20030018551 | Hanson et al. | Jan 2003 | A1 |
20030033164 | Faltings et al. | Feb 2003 | A1 |
20030036929 | Vaughan et al. | Feb 2003 | A1 |
20030040946 | Sprenger et al. | Feb 2003 | A1 |
20030050806 | Friesen et al. | Mar 2003 | A1 |
20030055689 | Block et al. | Mar 2003 | A1 |
20030110062 | Mogler et al. | Jun 2003 | A1 |
20030110063 | Among et al. | Jun 2003 | A1 |
20030149606 | Cragun et al. | Aug 2003 | A1 |
20040003042 | Horvitz et al. | Jan 2004 | A1 |
20040027379 | Hong et al. | Feb 2004 | A1 |
20040039617 | Maycotte et al. | Feb 2004 | A1 |
20040044556 | Brady et al. | Mar 2004 | A1 |
20040073615 | Darling | Apr 2004 | A1 |
20040078257 | Schweitzer et al. | Apr 2004 | A1 |
20040093263 | Doraisamy et al. | May 2004 | A1 |
20040093290 | Doss et al. | May 2004 | A1 |
20040116115 | Ertel | Jun 2004 | A1 |
20040122721 | Lasora | Jun 2004 | A1 |
20040148207 | Smith et al. | Jul 2004 | A1 |
20040153348 | Garback | Aug 2004 | A1 |
20040193457 | Shogren | Sep 2004 | A1 |
20040199423 | LaBrosse et al. | Oct 2004 | A1 |
20050033614 | Lettovsky et al. | Feb 2005 | A1 |
20050033615 | Nguyen et al. | Feb 2005 | A1 |
20050033616 | Vavul et al. | Feb 2005 | A1 |
20050066304 | Tattrie et al. | Mar 2005 | A1 |
20050119927 | Patel | Jun 2005 | A1 |
20050125408 | Somaroo et al. | Jun 2005 | A1 |
20050209914 | Nguyen et al. | Sep 2005 | A1 |
20050228677 | McCabe et al. | Oct 2005 | A1 |
20050233743 | Karaguz et al. | Oct 2005 | A1 |
20060004590 | Khoo | Jan 2006 | A1 |
20060004613 | Roller et al. | Jan 2006 | A1 |
20060010023 | Tromczynski et al. | Jan 2006 | A1 |
20060059024 | Bailey et al. | Mar 2006 | A1 |
20060095377 | Young et al. | May 2006 | A1 |
20060106655 | Lettovsky et al. | May 2006 | A1 |
20060224969 | Marston | Oct 2006 | A1 |
20060277079 | Gilligan et al. | Dec 2006 | A1 |
20070150075 | Dumas et al. | Jun 2007 | A1 |
20070185744 | Robertson | Aug 2007 | A1 |
20080052217 | Etkin | Feb 2008 | A1 |
20080126143 | Altman et al. | May 2008 | A1 |
20080141158 | Daughtrey | Jun 2008 | A1 |
20080228547 | Doss et al. | Sep 2008 | A1 |