Call and data correspondence in a call-in center employing virtual restructuring for computer telephony integrated functionality

A call center having agent stations comprising telephones connected to computer stations by a Telephone Application Programming Interface (TAPI)-compliant bridge has data pertaining to callers stored in a database on a local area network (LAN) to which the computer stations are also connected. Origination data for incoming calls, both conventional calls to the telephones and computer-simulated calls to the computer platforms, is used as a key to extract data pertaining to calls from the database for display on video display units (VDUs) of the computer workstations where the calls are terminated. In some cases, data is only extracted and displayed for calls from previously listed origination points.

Skip to: Description  ·  Claims  ·  References Cited  · Patent History  ·  Patent History
Description
CROSS-REFERENCE TO RELATED DOCUMENTS

The present application is a reissue patent application of U.S. Pat. No. 7,903,807 filed on May 11, 2004 as patent application Ser. No. 10/843,802, which is a continuation application of patent application Ser. No. 10/234,691, filed Sep. 3, 2002, now U.S. Pat. No. 6,735,298, which is a continuation application of patent application Ser. No. 08/949,566, filed Oct. 14, 1997, now U.S. Pat. No. 6,480,600, which is a divisional application of patent application Ser. No. 08/928,861, filed Sep. 12, 1997, now U.S. Pat. No. 7,031,442. U.S. Pat. No. 7,903,807 filed on May 11, 2004 as patent application Ser. No. 10/843,802 is also a continuation application of patent application Ser. No. 08/928,861, filed Sep. 12, 1997, now U.S. Pat. No. 7,031,442, which is a Continuation-In-Part (CIP) of prior patent application Ser. No. 08/869,815, filed Jun. 4, 1997, now U.S. Pat. No. 6,148,074, which is a CIP of patent application Ser. No. 08/802,667, filed Feb. 19, 1997, now U.S. Pat. No. 6,201,863, which is a CIP of patent application Ser. No. 08/797,420, filed Feb. 10, 1997, now U.S. Pat. No. 6,185,291. The present application Application Ser. No. 08/928,861, filed Sep. 12, 1997, now U.S. Pat. No. 7,031,442, is also a CIP of application Ser. No. 08/833,340, filed Apr. 3, 1997, now U.S. Pat. No. 6,560,328 and a CIP of application Ser. No. 08/891,675, filed Jul. 9, 1997, now U.S. Pat. No. 6,205,412.

FIELD OF THE INVENTION

The present invention is in the area of telephone call processing and switching, and pertains more particularly to intelligent call-routing systems, and equipment and methods for customizing and personalizing Routing Rules and Protocol.

BACKGROUND OF THE INVENTION

Telephone call processing and switching systems are, at the time of the present patent application, relatively sophisticated, computerized systems, and development and introduction of new systems continues. Much information on the nature of such hardware and software is available in a number of publications accessible to the present inventor and to those with skill in the art in general. For this reason, much minute detail of known systems is not reproduced here, as to do so would obscure the facts of the invention.

One document which provides considerable information on intelligent networks is “ITU-T Recommendation Q.1219, Intelligent Network User's Guide for Capability Set 1”, dated April, 1994. This document is incorporated herein by reference.

At the time of filing the present patent application there continues to be remarkable growth in telephone routing systems, with routing done both at or near point-of origin of incoming calls, and at call destinations. For example, systems are known to the present inventor that perform initial call processing before routing an incoming call to a destination switch, and further routing is done at the call destination in computerized telephony equipment, often termed customer premises equipment (CPE). The present invention pertains most particularly to routing at customer premises.

There are, at the time of the present patent application a considerable range of CPE systems available for use from various manufacturers, and, as state-of-the-art routing systems are typically computerized, there is a broad variety of software available for such systems as well. It is the software in general wherein routing rules are set, and the routing rules determine the decision-making paths a system follows in routing calls.

In current art, although there are widely varying systems in the art relative to routing rules, all such systems exhibit a common drawback. Typically such systems, once set up (programmed) to follow certain routing rules and practices, cannot easily vary, and individual users or groups of users, cannot change the rules arbitrarily. To tinker with the routing rules in CPE typically requires a highly-trained maintenance technician (system administrator).

What is clearly needed is method and apparatus which allows an individual user of a routing system, or a group of users, to alter and customize the routing rules of the system for particular purposes, which may change from time to time, depending on the users.

SUMMARY OF THE INVENTION

In a preferred embodiment of the present invention a telephony call-in center is provided, comprising a plurality of agent stations, individual ones of the agent stations having a telephone and a computer platform including a video display unit (VDU), the telephone and computer platform connected by a Telephone Application Programming Interface (TAPI)-compliant data link; a local area network (LAN) connecting at least some of the computer platforms at the agent stations; and a first computer processor connected on the LAN, having a wide area network connection (WAN) adapted to receive computer-simulated telephone calls, and having access to a database. The computer platform is adapted to retrieve origination data for incoming calls to the telephone, and to use the origination data to correlate the caller with further data retrieved from the database for display on the VDU. In some embodiments the the first computer processor is adapted to service calls from specific Service Control Points (SCPs) and to block display of data at agent station VDUs for any call not identified as originating at one of the specific SCPs.

In preferred embodiments the computer platforms are adapted to report the origination data to the first processor, and the first processor is adapted to correlate the caller with further data retrieved from the database for display on the VDU.

In an alternative embodiment a telephone call-routing system is provided, comprising a call-in center comprising a plurality of agent stations, individual ones of the agent stations having a telephone and a computer platform including a video display unit (VDU), the telephone and the computer platform connected by a Telephone Application Programming Interface (TAPI)-compliant bridge, with a plurality of the computer workstations connected to one another, to a first processor, and to a database on a local area network (LAN); and a call-routing center comprising a telephony switch adapted to switch telephone calls to the telephones at the call-in center and a processor adapted to route computer-simulated telephone calls to the computer platforms at the agent stations. In this embodiment the computer workstation is adapted to retrieve origination data for incoming calls, both conventional telephony and computer-simulated, and to report the origination data to the first processor, and wherein the first processor is adapted to use the origination data to correlate the caller with further data retrieved from the database for display on the VDU. IN some instances the first processor is adapted to service calls from specific Service Control Points (SCPs) and to block display of data at agent station VDUs for any call not identified as originating at one of the specific SCPs.

In yet another embodiment an agent station for a call-in center is provided, comprising a computer platform having a local area network (LAN) adapter, the computer platform adapted for receiving and processing computer-simulated telephone calls; a telephone having a telephone line port; and a Telephone Application Programming Interface (TAPI)-compliant bridge connecting the computer workstation and the telephone. The computer workstation is adapted to retrieve origination data for calls, both calls to the telephone and computer-simulated calls to the computer platform, and to report the origination data on a LAN via the LAN adapter to a processor connected to the LAN.

In still another embodiment a method for correlating displayed data with incoming conventional telephone and computer-simulated telephone calls at a call-in center is provided, comprising steps of (a) connecting individual telephones at the call-in center by a Telephone Application Programming Interace (TAPI)-compliant bridge to individual computer platforms; (b) connecting each telephone-connected computer workstation on a local area network (LAN) to a processor connected on the LAN, the processor having access to a database storing data to be displayed; (c) monitoring origination information of incoming calls by the computer workstations; (d) providing the origination information over the LAN to the LAN-connected processor; and (e) using the origination information via the processor to correlate data to be displayed with the incoming calls.

In the various embodiments of the invention described in enabling detail below, call centers without call-switching apparatus and capable of also processing computer-simulated calls are enabled, while also providing means of correlating stored data pertaining to callers with calls to agent stations, displaying the data on VDUs at the agent stations while calls are in progress.

BRIEF DESCRIPTION OF THE DRAWING FIGURES

FIG. 1 is a system diagram of a call-routing system in an embodiment of the present invention.

FIG. 2 is a sample of a broadcast announcement record in an embodiment of the present invention.

FIG. 3 is a sample user interface screen in an embodiment of the present invention.

FIG. 4 is a system diagram of a call-routing system implemented in client-server mode in an embodiment of the present invention.

FIG. 5 is a block diagram of a call-routing system in the prior art.

FIG. 6 is a block diagram of a call-routing and call-in system according to embodiments of inventions known to the present inventors.

FIG. 7 is a block diagram of a call and information routing and call-center system according to an embodiment of the present invention.

FIG. 8 is a block diagram depicting a simulated system according to a preferred embodiment of the present invention.

DESCRIPTION OF THE PREFERRED EMBODIMENTS

FIG. 1 is a system diagram of a call-routing system according to a preferred embodiment of the present invention. Dotted lines 123 enclose elements of the system native to a customer's premises (CPE). This equipment in a preferred embodiment comprises a computerized telephony central switch 121 connected by a data link 212 to a processor 223 running an instance of a unique telephony server (T-Server) T-S 207. Switch 121 in conventional art distributes incoming calls (on line 105) to connected telephones, such as telephone 131 at a workstation 361 and telephone 132 at a second workstation 362. In various embodiments of the present invention T-Server 207 running on processor 223 exerts controlling influence on routing of incoming calls, as is described in further detail below.

In various embodiments of the present invention each workstation (361, 362) has a PC with a video display, such as PC/VDU 331 at workstation 361 and PC/VDU 332 at workstation 362. There will be in most architectures many more than the two telephone workstations shown, each with an associated PC, but two are considered adequate by the inventors to illustrate embodiments of the present invention.

PC/VDUs 331 and 332 in various embodiments are connected on a local area network (LAN) 301 which also connects to a data file server 303 and to processor 223 running an instance of T-Server 207. The arrangement of PC/VDU plus telephone at each workstation is a common arrangement for many company facilities, and has become more common as more and more people become computer literate. Moreover, many companies are actively training employees in use of computers, and providing PC-type computer equipment, usually interconnected by company LAN, for employees to use.

In the exemplary system shown, calls may originate at any remote call-in point, which is represented in FIG. 1 by region 100, referred to herein as the network cloud. Network cloud 100 may be a small regional portion of the world-wide network of connected telephony equipment, or may represent the entire world-wide network. An incoming call at any point in network cloud 100 is represented by vector 107 to service control point (SCP) 101 (typically a telephony central switch), which in this example is connected to an adjunct processor 103 and coupled thereby to an intelligent peripheral (I-P) 102, a distribution processor 104 and a processor 208 running a second instance of unique T-Server 207 as well as a statistical server (stat-server) 209. In this system calls are forwarded to switch 121 at the customer premises equipment over telephone line 105, and associated data is forwarded in parallel to processor 223 over a digital network link 210. Such systems, wherein data associated with a call is forwarded on a separate link from the call itself, are, to the inventor's knowledge at the time of the present patent application, not known in the art, but are known to the inventor. This feature, however, is not required in practice of the present invention, but preferred in some embodiments.

In embodiments of the present invention a call originating in the network cloud and routed to switch 121, destined for one of telephones 131 or 132 or to another destination at the customer's premises, typically carries a destination number, which may include a direct inward dialing (DID) feature, whereby a limited number of lines may be used to carry calls to a larger number of final destinations, accomplished principally by software techniques. Destination may also be to a virtual number, of which many may be programmed, and T-Server 207 may be adapted to further route calls forwarded to such virtual numbers. The phone call may also have caller ID attached (originating caller's phone number), and in those cases wherein a separate network digital data link is accomplished between processors at the origination end (208) and the customer's premises (223) cases a data packet associated with the call may be forwarded over link 210. Also, T-S 207, which interacts continuously with switch 121 in this embodiment, is capable of transacting with data file server 303, given caller ID and/or other data associated with a call, to retrieve further information about the caller from data file server 303.

It will be apparent to those with skill in the art that incoming calls are not limited to two telephones as shown in FIG. 1. There may be many more than two telephones connected to switch 121, other telephony equipment, such as facsimile equipment and data lines may also be connected and involved in routing decisions and transactions according to embodiments of the present invention. Moreover, existing techniques, such as virtual expansion for routing calls with a certain number to multiple destinations on some pre-programmed protocol may also be involved. The simple diagram of a switch with two telephones connected is meant to be illustrative for description of embodiments of the present invention.

It will be apparent to those with skill in the art as well, that a separate processor shown as processor 223 in FIG. 1, is not strictly required in embodiments of the invention, depending on the level of machine intelligence and sophistication of switch 121. Switches for customer premises continue to be developed with new levels of intelligent capability, and some may be capable of interacting with other elements of the present invention without a separate processor between the switch and a LAN such as LAN 301. Processor 223 will be required to practice various embodiments of the invention with many existing telephony switches which may be used as element 121. In virtually all cases in practicing the present invention, an instance of unique T-Server 207 executing on a computerized platform will be required.

In a preferred embodiment of the present invention routing intelligence is no longer confined to a central location such as telephony switch 121 or T-Server 207 running on a connected processor, but distributed in a manner that individual users of the system may customize routing at their own workstations, using individual PCs. This is accomplished in large part by control code executable at a user's computer workstation. It is not required that the actual code be always at the user's workstation, as it may be shared code resident at, for example a file server on LAN 301, such as file server 303. The unique code may be accessed from such a server and executed at any one of several workstations such as workstations 361 and 362 by PC/VDU 331 and PC/VDU 332 respectively. The location of stored code, and access to such code is not, however germane to the invention. In embodiments of the invention, an individual PC executes unique code to provide call-routing control for an individual.

In embodiments of the present invention, T-Server 207 is adapted to cooperate with code executed at individual PCs to route incoming calls. In this unique routing process there are at least two different mechanisms that may be used. In one mechanism, all calls are routed to a single routing point, and each individual routing application registers with that routing point. In this case a record of each call is broadcast on LAN 301, as will be described more fully below, and filtering occurs at each PC router. In a second mechanism there may be a virtual routing point for each PC using a personal router on the LAN. In this second case there is no need to broadcast call particulars on the LAN. This second alternative is typically more expensive than the first, and there are currently rather severe limitations on how many automatic call distribution (ACD) queues or routing points may be allocated on a typical central switch.

Referring now to FIG. 2, and presuming the first of the two mechanisms described immediately above, with each incoming call, an overall record of the call, prior to routing, is broadcast on LAN 301. This overall record can take a number of different forms, of which the example in FIG. 2 is just one exemplary form. In this example the overall record consists of four data portions. One data portion consists of elements 201 and 202. Data element 201 identifies this portion as the caller ID associated with the incoming call, and element 202 is the caller ID number. A second data portion consists of data elements 203 and 204. This portion is a data set which may be transmitted via link 210 to processor 223 in parallel with the incoming call, or may be composed partly of data retrieved from server 303, using other call data as a pointer. Element 203 identifies the data as a data set, and element 204 is the pointer. Similarly elements 205 and 206 constitute a direct inward dialing (DID) number, and elements 207 and 208 fix number of rings.

A central element in the present invention is that a user at an individual PC rims an instance of a personal router application, providing that user with instant and complete control over routing of calls meant for that user (or, in some cases, associated users). The user's PC, such as PC/VDU 331 is connected typically by LAN to a processor such as processor 223, in turn connected to the central switch, such as switch 121.

At the computer portion of an individual workstation, such as PC/VDU 331 at workstation 361, the user has access to the local application which is interactive with code executed at T-Server 207 at processor 223, to control and customize routing for incoming calls, depending on certain data elements in the broadcast announcement record (FIG. 2). As a part of this unique capability to program routing responses, the individual user may in some embodiments load to his/her VDU a unique user interface, an example of which is shown in FIG. 3.

FIG. 3 illustrates a window presentable to a user at an individual workstation, compatible, for example, with Windows operating systems. This is an input and display interface for a personal router, a variation of which may be assigned to each of selected employees to provide these individuals with an ability in conjunction with the premises telephone equipment to customize and periodically adjust the routing of certain incoming calls. In this example, the interface is for company XYZ and limited to employee John Doe.

Through the individual interface, John Doe in this instance, may program in a relatively high-level language, routing preferences for certain incoming calls, according to data broadcast for such calls on LAN 301. In the case where each user has a dedicated routing point, an incoming call is directed to the individual's computer, and the broadcast is not necessary.

In this example John Doe has programmed his interface to pick up all calls having Caller ID matched with a list “list1” after n1 rings. List1 is resident in John Doe's database associated with his own Personal Router, and John Doe may call up this list and amend, delete, and expand it as he wishes. The number of rings n1 may be any convenient number to accomplish John's purpose.

John Doe may program negative lists as well. Although not specifically recommended, a negative list could be used to hang up on all calls that have an ID associated with a company or individual that has been making harassing calls to an employee, or to shunt such calls to a special tracking program or the like.

John Doe in this instance has also programmed his personal router to send all calls bearing his assigned DID number to the telephone at his desk after 0 rings, and to an answering machine after n2 rings. Associations with data sets may also be made, comparing such data sets to stored profiles and the like. At the bottom of the display in this example a status summary of calls may be provided. A user may choose to have this window resident on his computer screen as a pix-on-pix, or to hide it and call it as needed. Also, it will be apparent to those with skill in the art that it is not strictly required that each selected person having an associated routing interface assigned have a computer at his/her elbow. For those persons not, for one reason or another, inclined to program their own routing, the interface may be called up and done by another, with appropriate access security applied. A secretary or system administrator may perform such functions, using any workstation connected to company LAN 301.

The user interface at the user's workstation can take any of a variety of forms, and have a variety of functionality. Typically, when the user logs on, his system will be configured to execute the unique application to run in the background, and to monitor for incoming calls at all times the user is present and active. It will be apparent to those with skill in the art that this can be done in a variety of ways. The interface, for example, may be a Graphic User Interface (GUI) wherein icons may be used to represent calls, callers, and other users, and the individual user at one workstation may select to display icons as desired. In this alternative embodiment an incoming call may appear on a user's PC VDU as a small telephone in an announcement bar. Such announcement bars are familiar to those with skill in the art, such as seen on Operating System Desktops, where an e-mail arrival may be indicated by a letter icon and a sound.

In such an embodiment, by moving the screen cursor to the telephone icon, which may be programmed to “ring” or to vibrate as though it is ringing, the user may activate a text balloon announcing the caller ID or other call data, or such data may be displayed directly in the icon. The system can be configured in such an embodiment to allow the user to route the call to his own phone with a click, to hang up with a double click, to drag the call to a holding queue (represented by a basket, for example,) to send the call to an answering machine, which may be done by dragging and dropping the telephone icon to an answering machine icon, to transfer the call to another person by dragging and dropping the telephone icon to an icon representing another user (such as the instant user's secretary or supervisor for example). Those with skill in the art will recognize that the functionality through the use of click and drag-and-drop procedures is very broad indeed.

Actions taken at the personal router interface at an individual PC on LAN 301 in embodiments of the present invention are codified as instructions on the LAN to T-Server 207 (in most cases) running on a processor such as processor 223, connected to central switch 121. If an individual user at a workstation, for example, has received an indicator of a waiting call, and has dragged the ringing telephone to his secretary's desk icon in his interface, his personal router interacts with T-Server 207 to instruct switch 121 to reroute the call to the secretary's telephone. In a similar manner, most actions at a personal router become instructions to switch 121, and in general each user having access to such a personal router can program responses to calls and respond to incoming calls in real time with a broad set of available responses.

In embodiments of the invention, not necessarily all calls are routed by personal routers executed on PCs on LAN 301. There may also be over-riding routing rules programmed into switch 121, such that certain calls or types of calls are always handled in a certain way. Rules in switch 121 may also determine the fate of calls that are not eventually routed by personal routers. For example, all calls alive after seven rings may be switched to a recorded announcement, and the like. In this manner a very broad freedom of routing may be accomplished, with security and flexibility to adapt for changes in the organization.

It will be apparent to those with skill in the art that the division of code and functionality between server 303, T-Server 207 running on processor 223, and individual workstations on the LAN is somewhat arbitrary, with the requirement that individuals at the workstations have interface access to customize and update personal routing rules.

In another aspect of the present invention a Personal Desktop Router is implemented in a Client-Server architecture. This embodiment is illustrated with the aid of FIG. 4. In this embodiment a router 401 is provided and executes on processor 223 which also executes an instance of T-Server 207. Router 401 in this instance is a central router having routing rules divided in sections dedicated to each assigned user or DN on LAN 301. Unique Client Interface Packages represented by elements 401a and 401b are provided at individual workstations such as workstation 361 and workstation 362 connected to LAN 301. Client Interface Packages 401a and 401b are for the purpose of allowing users at the workstations to edit their own personal routing rules, much as has been described above for personal routers according to embodiments of the present invention, wherein the routers execute at the workstations.

In this Client-Server embodiment of the present invention, the actual router software exists and executes as one router 401. Client Packages 410a and 410b may be implemented as a Graphical User Interface (GUI) with iconic drag and drop features as described above with reference to FIG. 1, or may be of another suitable type designed to allow interaction with router 401.

It will be apparent to one with skill in the art that router 401, in this embodiment, is not required to reside in processor 223, but may reside in any other machine capable of executing the router and connected or coupled to LAN 301, such as switch 121. The router could be executed, for example, on a server on the Internet, and accessed by a WEB browser by a client connected to LAN 301. It will also be apparent to one with skill in the art that while router function does not occur at individual workstations 361 and 362 in this particular embodiment, editing capabilities provided to the user via client packages 401a and 401b can remain essentially the same as described in previous embodiments taught herein.

In typical embodiments, router 401 is configured to allow a group manager or system agent to perform higher level configurations to routing rules, such as type of calls available, call parameters, user function or location changes, etc., while individual users may, through their interfaces, configure routing rules for their own calls, within the boundaries set by the supervisor.

It will be apparent to one with skill in the art that any configurational division of editing capabilities may be employed with reference to routing rules as they may exist in any given application without departing from the spirit and scope of the present invention. A server-based router such as router 401 in this embodiment, wherein a unique client package is provided for editing purposes at a user's workstation, such as workstation 361, is heretofore unknown to the inventor.

In the embodiment illustrated by FIG. 4 communication over analog lines 105 and data link 210, and other functions of the system, is essentially the same in method as is illustrated in FIG. 1 and described above with reference to FIG. 1. Also, network cloud 100 and the components therein are essentially the same as in the embodiment in FIG. 1. For this reason much detail as to the dynamics of and paths of communication in an embodiment of the present invention with respect to FIG. 4 are not repeated here.

Virtualized Computer-Telephony Integrated Link (3211-3213)

To help create a context for a detailed description of preferred embodiments of the present invention which follow, attention is first directed to FIG. 5, which is a block diagram of a call-routing system in the prior art. In the system of FIG. 5 a call-in center 1150 is illustrated having two telephones 1162 and 1172. As was described above in the background section, the present invention is particularly adaptable to such call-in centers wherein a telephony switch is not a part of the equipment at the call-in center, thus no telephony switch is shown in FIG. 5 at call-in center 1150.

It will be apparent to those with skill in the art that there may be just one phone in call-in center, or there may be several more than the two shown. Two telephones is an arbitrary choice for purposes of illustration and description.

It is common and desirable at call-in centers for agents who man the phones to have at hand a personal computer (PC) or a data terminal of some description including a video display and processor. Access to such a computerized system allows the agent to recall and display data pertaining to a caller, and also other information of use in dealing with and helping caller, such as technical information about products and product use. Although several types of such data terminals are known, PCs are assumed here for purposes of description and illustration. A PC 1161 with a display is shown at hand for an agent using telephone 1162 and a PC 1171 is shown proximate telephone 1172 for use by an agent at telephone 1172.

In a very simple system there may be just one telephone and one PC proximate the telephone, therefore just a single equipped agent constituting the call-in center. In the system of FIG. 5 having two telephones, there are also two PCs. Each PC and associated telephone is considered here to constitute an agent station. Agent station 1160 comprises telephone 1162 and PC 1161, and agent-station 1170 comprises telephone 1172 and PC 1171.

In systems of the sort depicted by FIG. 5, having two or more agent stations, it is desirable that the PCs be connected in a Local Area Network (LAN), and this connectivity is shown in FIG. 5 with PCs 1161 and 1171 connected on a LAN 1152 wherein a data file server 1153 is also connected. Data file server 1153 in this system is the repository of customer data and the like accessible to agents manning the phones. Though not shown in FIG. 5 it will be apparent to those with skill in the art that there may be other servers on the LAN or elsewhere in the network as known in the art.

Telephone calls in the system of FIG. 5 are provided to telephone 1162 on line 1164 and to telephone 1172 on line 1174 from essentially anywhere represented by network cloud 1100. Cloud 1100 could represent a relatively small local calling area, a regional area, a single phone company or even the phone system of the entire planet. Calls are forwarded by telephony switches represented by telephony switch 1120.

Calls 1104 intended specifically for call-in center 1150 typically are received at Service Control Points (SCP) represented by SCP 1102, which are organized typically with one or more 800 numbers or the like. Calls received and processed at SCP 1102 are forwarded to switch 1120 which routes the calls to whatever area code and number is assigned to telephones 1162 and 1172. Other calls 1122 may also come into telephony switch 1120 and be routed to call-in center 1150. As is known in the art, SCP 1102 is also a telephony switch.

Also as is known in the art, there may be equipment associated with SCP 1102 to provided some additional functionality, such as an adjunct processor and an intelligent peripheral. For simplicity's sake these are not shown in FIG. 5, but FIG. 5 may be considered as typical of many prior art systems. In the rather simple system of the prior art represented by FIG. 5 some data (such as caller ID for example, and Dialed Number Information Service {DNIS}), may be associated with calls forwarded to call-in center 1150. Such data to be useful in the system of FIG. 5 must be received by specialized equipment, such as familiar caller-ID boxes or telephone sets adapted to use the information being sold to people for home and business use.

Attention is now directed to FIG. 6, wherein a call-in system known to the present inventors is illustrated. In this system SCP 1102 receiving calls 1104 intended for call-in center 1150 has a connection to an adjunct processor 1106 in communication with both an intelligent peripheral 1101 and a call-distribution processor 1108. There is further a processor 1116 connected by a two-way communication link to call-distribution processor 1110. Processor 1116 comprises an instance of a unique application termed by the inventors a Telephony Server 1114, or T-Server, and a Statistical Server (Stat-Server) 1112. T-Server 1114 and functions provided by the T-Server are described in detail in the related patent applications listed above and incorporated herein by reference.

In the system of FIG. 6 a processor 1151 is provided at call-in center 1150, running a second instance of T-Server application 1114. Processor 1151 is coupled to processor 1116 in network cloud 1100 by a network link 1118, and to LAN 1152 by a network adapter. There is in addition a CTI connection 1119 between telephony switch 1120 in network cloud 1100 and processor 1151 at call-in center 1150. CTI connection 1119 may be an ISDN link or other data-type connection allowing transfer of CTI data and commands.

In the system of FIG. 6 information garnered in initial processing with use of IP 1101 may be provided by T-Server 1114 at processor 1116 to T-Server 1114 running on processor 1151 at the call-in center. This data can be used, then, ahead of a routed call, to, for example, to extract further data regarding a caller from a customer data base in file server 1153, and to provide the transferred and retrieved data at the PC display, such as PC 1161, proximate the telephone to which a call has been routed, for use by the agent manning that telephone.

Further, CTI transactional data retrieved from switch 1120 (line busy, line available, and the like), may be provided to T-Server 1114 at processor 1116, and in some cases in raw or processed form to Stat-Server 1112 to be used in routing by CD processor 1108. Many other functions described in the related applications listed above may now also be accomplished. Still further, Stat-Server 1114 running on processor 1151 can issue CTI commands to switch 1120 in the network cloud via CTI link 1119.

Although the system of FIG. 6 may be used to provide many CTI 10 functions, there is a great dependence on telephony switch 1120. Some older switches are not capable of CTI functions and data sharing, and some others are very limited in their functions. Moreover, the organization that provides a call-in center under these circumstances has no control over the switches in the network cloud, and it may not be practical for such an organization to purchase and install an expensive CTI-capable switch on the premises of the call-in center. What is needed is an apparatus and methods that will provide CTI functionality in the absence of a workable CTI link, such as link 1119 in FIG. 2.

Virtual CTI link

FIG. 7 is a block diagram of a call and information routing and call-center system according to an embodiment of the present invention. The system of FIG. 7 has all of the connectivity and functionality of the system of FIG. 6, plus a data connection between each telephone in the call-in center and the associated PC. For example, in FIG. 7, PC 1161 is connected to telephone 1162 by link 1163, and PC 1171 is connected to telephone 1172 by data link 1173. Moreover, as previously described, each PC is connected on LAN 1152, which also connects to file server 1153 and to processor 1151 running an instance of T-Server 1114.

There are a number of different ways a telephone and PC may be connected, such as by a serial port and circuitry in the telephone and operating code in the PC such that the PC may monitor transactions of the telephone, including on-hook, off-hook, incoming caller-ID, ringing instance, and so forth. The PC via the data link may also exercise control over telephone functions. With this unique connectivity and adaptation, assuming all of the telephones in a call-in center are thus connected and adapted, T-Server 1114 running on processor 1151 may acquire in aggregate all of the information otherwise available from switch 1120 via CTI connection 1119. T-Server 1114 on processor 1151 may then perform as though a fully workable CTI connection 1119 to switch 1120 is established.

Call and Data Correspondence

One of the important functions performed is identification of callers, retrieval of data relating to callers, and transmittal of such data to be displayed at the PC associated with each telephone at each agent station. The advantage to all is readily apparent. The agent fielding a call is thus more prepared to deal with the caller, and will have information readily at hand.

To provide the call and data display functionality desired it is, of course, necessary that a caller's identity be established and the caller's correct data be retrieved for display. There are some instances in the system depicted in FIG. 7 and described herein, wherein such correspondence may be a problem. Consider, for example, the circumstance wherein an original call has been routed to telephone 1162. The origination of the call and caller ID are not available in the system of FIG. 7 (with a non-functioning link 1119) until the call is connected to telephone 1162. At that point the necessary information is transferred to T-Server 1114 at processor 1151, and data specific to the caller may be retrieved and displayed at PC 1161.

Consider now the further circumstance that after the agent answers and the data retrieval begins, the original caller hangs up or is otherwise disconnected, and a second call 1122, a random call, entering the system not through SCP 1102 but directly into switch 1120, goes to telephone 1162. This circumstance could occur in a number of different ways, including a misdialed or misrouted call. There are also other sequences of events that could result in the same mismatch between call and data. Unless some action is taken, the data will be retrieved and displayed, although there will no correspondence between the data and the caller.

In this circumstance the origination information, which may be such as caller ID information or DNIS information, for the second (random) call will not indicate the call originates at SCP 1102. In an embodiment of the present invention, origination data transmitted to T-Server 1114 at processor 1151 indicating the call last received was not through a valid SCP will cause any data being prepared for display at the agent station to be halted. In some embodiments, depending on the capability of switch 1120, T-Server 1114 on processor 1151 may cause such non-SCP calls to be disconnected and/or rerouted, by command over link 1119.

Voice Extensions Through Integrated Agent Workstations

The direct connection of a telephone to a PC connected on a LAN to a processor with an operating T-Server provides a platform for a number of voice extensions useful in the overall process of customer service through call-in centers. Several such voice extensions in embodiments of the present invention are described herein below.

Call recording is a major need in customer service operations of the sort described herein, especially in operations dealing with financial markets and utilities. Such recording operations in current art are typically quite expensive to implement and difficult to manage. In an embodiment of the present invention an improved call recording facility is provided by virtue of the connection of the telephone to the PC by data link, and the functionality afforded through LAN 1152 and code as a part of T-Server 1114. In this embodiment a digital voice rendition of both parties to a call is transmitted on link 163 (for example) to PC 1161.

In one embodiment of the present invention all calls are recorded, subject of course to local laws governing such matters, and provision is made for selective archiving of recorded conversations. The recording is all digital, and may be accomplished in a number of ways, utilizing a number of commercially available hardware and software entities, such as those marketed under the name SoundBlaster™. The LAN connection and availability of data servers such as server 1153 provide for the rather large amount of digital data needed for such a recording operation. In this embodiment organization of the recorded database can be done in a variety of ways, categorized by agent, by subject, by product, and so on, and relational cross-referencing may be done as well, providing a well of information not before available in such call-in centers. In addition interactive search and retrieve functionality, and interactive report generation is provided. In another embodiment of the invention digital voice recording is provided on demand, under control of the resident agent and/or the agent's supervisor. It will be apparent to those with skill in the art that there are many different schemes that may be employed for digital voice recording, using the uniquely connected and managed apparatus of the present invention.

In other embodiments of the present invention voice playback is provided, with pre-recorded massages played to a caller under agent or Host control. Such pre-recorded messages may be recorded by an agent or other person, and stored either locally in the PC or more remotely, such as on a server connected to LAN 152. Such messages can include greetings, mandatory messages required under law in some cases, disclaimers, and all kinds of messages that may be very repetitive for an agent.

In other embodiments of the present invention voice recognition routines are used allowing an agent to invoke displays with spoken initiators on the telephone, recognized in the PC and acted upon either in the PC or through the PC by means of LAN 1152 by other servers on the LAN or by T-Server 1114. Voice recognition may also be used to detect upselling opportunities in the course of calls at PC connected telephones. Other voice recognition routines are used in embodiments of the invention to detect abusive or threatening speech, and to automatically save calls or portions of calls that match patterns for such speech.

Methods in Computer Simulation of Telephony Systems (3226)

The present invention in embodiments described below pertains to computer simulation of telephony call centers and activity and functionality of such centers, and to computer telephony integration (CTI) as applied to such centers. It is well-known in the art that call center architecture and functionality is a rich and varied subject, and it is beyond the scope of the present specification to describe all of the rich variation in call center technology. There are, however, commonalties. Every call center, for example, is centered on a telephony switch, either at a customer's premises or provided by a telephone company. The telephony switch involved in a call center typically has one or more incoming trunks of telephone channels for receiving telephone calls, and typically one or more outgoing trunks as well, for placing calls back into the network.

Also common to call centers is the fact of connections to telephones at agent stations, which are typically assigned directory numbers. There may be just a few, dozens or even thousands of agent stations controlled by a single call center. In some call centers, only telephones are provided at agent stations. In others there may be computer terminals with display monitors, and the computer terminals may be interconnected on a local area network (LAN) along with network servers of various sorts. Call centers have recently been developed for providing video conferencing with agents. It may be seen that the architecture can be quite varied.

Telephone switches at call centers, depending on the model and manufacture, are capable of certain functions in switching, such as Automatic Call Distribution (ACD), queuing, playing recorded announcements to callers, and much more, and typically the functions available, and the manner in which the functions operate is specific to the make and model of the telephony switch.

In addition to all of the above, the systems of interest for the present invention are systems having a CTI link capability, enabling connection of a processor executing one or more usually customer-specific applications. According to the reference incorporated above, CTI involves three areas: (1) Call Control, which includes an ability to control and observe telephony calls, switching features and status, automatic call distribution (ACD) systems and ACD agents, and to use switching resources including tone generators and detectors; (2) Telephone Control, which is an ability to control and observe telephone devices; and (3) Media Access, which includes binding telephone calls to other media services.

In accomplishing the observation and control functions of CTI as listed above, applications executed on a CTI processor can be quite varied in function, really limited only to the imagination of application developers, and presently include such functions as agent-level routing, which will be familiar to those with skill in the art.

FIG. 8 is a block diagram depicting a simulated system according to a preferred embodiment of the present invention. In FIG. 8, boundary 2100 encloses software modules that emulate a call center and associated objects; boundary 2110 represents a unique CTI Link Interface Library (CLIL); and boundary 2120 represents a CTI application. Each of the three broad elements introduced here is described in further detail below.

In simulating a call center and associated elements as represented in FIG. 8 by group 2100, it is necessary to simulate both physical and logical elements. These include, but are not necessarily limited to (a) agents telephones and stations, (b) ACD, (c) ACD groups, (d) ACD queues, (c) incoming trunks, (f) outgoing trunks, (g) abstractions of communication relationship between one or more devices, and (h) communication with user applications.

In the example of FIG. 8, call center group 2100 comprises a software module 2101, termed a Simulated Incoming Call Module (SICM), which emulates incoming calls via one or more trunks 2104 to a switch 2102. The SICM operates with an ACD list, and simulates calls to ACD groups.

Switch 2102 is termed in embodiments of the invention a Simulated Telephony Objects Module (STOM), and comprises a variety of micro-emulated objects represented here by elements 2130-2132, which represent such as agents, ACD queues, and the like, as listed above.

Agent's telephones and agent stations as micro-emulated objects in a call center simulation will have attributes and statuses including, but not necessarily limited to two-line connections; perhaps a group relationship; and an equipment configuration mode (status when call offered, and status when call released).

Other entities that may become micro-emulated objects in a call center module, as represented by elements 2130-2132 include such as an Interactive Voice Response (IVR) system, remote access agents, media services that may appear in a call center switch, and generally, any feature that a call center switch can perform. Outgoing trunks have parameters including but not limited to a list of the outgoing trunks and a probability of answer result, such as answer, not answer, busy, answering machine, fax/modem, SIT tones, and so forth.

Calls in the simulation procedure have attributes and parameters including but not limited to origination party; destination party; PBX call identifier, DNIS number, ANI, and call status, such as connecting, waiting, alerting, or conferencing.

Elements 2130-2132, represented here as icons, may be, as indicated above, any function or behavior associated with STOM 2102, and it will be apparent to those with skill in the art that the three elements shown are not enough to depict all physical and logical elements that would have to be provided for STOM 2102 to make a realistic simulation. The elements shown, however, will be sufficient to teach to practice of the invention to those with skill in the art.

Software module 2103 represents an outgoing and return module, termed a Simulated Outgoing Dialing Module (SODM), wherein calls placed by STOM 2102 over path 2106 are modeled, and calls returned as a function of the outgoing calls over path 2105 are also modeled. STOM 2102 communicates with Interface Library 2110 via paths 2108 and 2109. Link 2113 represents a CTI link from application 2120 to switch 2102 via CLIL 2110.

The STOM notifies an application 2120 through CLIL 2110 of arriving calls, and data associated with arriving calls, as well changing status of telephony objects and statuses. STOM 2102 receives requests from application 2120 via CLIL 2110 to change status of agents phones and stations, such as login, logout, ready, not ready, or and busy. Requests are also received to change call status, such as answer, reconnect, disconnect, produce new call, transfer call, and include a call to a conference. If requested changes are available the STOM produces the changes and sends notification o the changes to application 2120 through CLIL 2110. If requested changes are out available, negative notification is sent.

In the embodiment of the invention illustrated by FIG. 8, although several computer functions are represented that may in a real system, rather than an emulated system, be executed on separate but connected and intercommunicating processors, all of the system represented by FIG. 8 will be typically executed on a single, relatively powerful computer. The various elements represented are software modules written to intercommunicate, and to simulate the behavior of real telephony systems.

FIG. 8 is more than a block diagram representing a system of the invention. FIG. 8 also represents a user interface wherein the elements are objects represented on a graphical user interface (GUI) as icons. The system of the invention is adapted such that object elements may be selected from a library and interchanged into an interconnected system.

As an example of the object-oriented nature of the GUI of FIG. 8, attention is directed to SICM 2101. This software module is a micro-application that, when initiated and operating may simulate calls to STOM 2102. A master SICM is developed that includes all of the characteristics of incoming calls. The master module has input parameters that allow a user to configure the module for certain behavior of interest. As an example, it may be of interest to test an application running as element 2120 against a rush of Christmas shoppers placing calls within a certain time frame at a certain rate, with the calls statistically distributed for a range of products for which agents at the emulated call center are adapted to enter orders and schedule deliveries.

The matter of importance in describing this invention is not the particular nature or statistical distribution of the calls, but the fact that the module has alterable parameters, also known as properties, which a user may manipulate to represent behavior of interest, and that the module is adapted to the system as an object, which may be removed and replaced by another object having a different parameter set. One may then quickly and conveniently alter the incoming conditions for a simulation, and new modules with different parameter sets may be developed off line and switched into the system.

Attention is now directed to STOM 2102. Iconic elements 2130-2132 are shown as three different shapes in FIG. 1. Each of these elements is a micro emulated object having alterable parameters. Description of an agent object should be adequate to illustrate the nature of the invention in this aspect.

Consider that element 2130 is a micro emulated agent module. This module may be selected from a library in the fashion described above for the SICM module, and dragged and dropped into switch 2132. Either before or after addition to the switch, parameters for the module may be accessed and set. It will be apparent to those with skill in the art that there may be a large number of agents assigned to a single call center, and that all of the agents may not have the same assignments or characteristics.

As an example of the versatility of the unique system, there may be, for example, agents for English speakers who call, and agents who speak Spanish for handling calls from Spanish-speaking customers. Certain agents may be trained for certain functions: to sell certain products, for example, or to provide technical assistance in certain situations. There may be, however, multiple instances of a micro-emulated agent. For example, of a Spanish-speaking agent assigned to first shift duty and trained to sell three specific related products. An icon represented agent, then, will have a multiplicity parameter. In setting up a simulation a user may select an agent, set certain parameters, then set the multiplicity parameter so that the call center will behave as though there were, say, twenty such agents.

It will be apparent to those with skill in the art that there are several ways parameters may be accessed and set for a micro-emulated object, such as element 2130, which may, for example, represent an agent having particular attributes. In one embodiment, for example, a selected icon representing a micro-emulated object may be caused to display an associated window in the GUI, and the window will have programming fields wherein a user may access and alter (edit) parameters. If the object is an agent, there may be, for example, a parameter field for language, for product knowledge, for shift assignment, and so forth; and, as indicated above, there may also be a parameter for multiplicity. If a simulated agent having a complete set of behavior parameters is to be represented multiple times in a call center simulation, the multiplicity parameter may be set for “n” instances, then the object will behave in operation of the simulation as “n” objects. The behavior of such objects can be in preferred embodiments, randomized, so the behavior, where there is a range, is not always the statistical average.

For example, even though there may be multiple instances of an agent with a certain characterization, it will never be true that every such agent will behave in exactly the same way. Some of the agents may habitually come late or leave early, and others may take longer than others for processing after calls are released. In an aspect of the invention such variations are accounted for by access to a statistical database and random generator. Typically the statistical average behavior of all such agents will be known, and may be stored in a manner to be accessible to the system. Multiple agents, otherwise identical in behavior, are caused to randomly alter their behavior in a way that the statistical average behavior is met.

It will be apparent to those with skill in the art that the above description of agent functionality and variation, and the method of applying parameters, multiplicity, and statistical behavior is not necessarily limiting in the invention. Many variations are possible, even including programming an individual module for each an every agent in a setup of interest.

Attention is now directed to CLIL 2110 and communication between STOM 2102 and CLIL 2110. CLIL is an interface library whose function it is to translate between STOM 2102 and application 2120 in a particular manner. STOM 2102 is configured in a manner that will be common to any of the several makes and models of available telephony switches currently available. Different makes and models of telephony switches communicate with CTI applications in different ways, however, and provide significantly different behavior specific to a particular make and model of switch. Communication may also be characterized by latency considerations. For example, in some real world situations one might wish to test, the telephony switch will be on the customer's premises, and in others, the telephony switch might be in the network, remote from the customer's premises. Latency issues in communication will differ by the different switch location, even with the same physical switch.

CLIL is a switch-dependent layer that controls communication of commands and status over data paths 2108/2109 and CTI link 2113. The function of CLIL 2110 is to add switch dependent characteristics to the communication, so one simulated generic call center can be made to appear to a CTI application as a particular make and model of a switch connected in a specific manner. The particular value of CLIL 2110 is that an application may be tested against one make and model of a switch, and, by selecting a different layer of software from CLIL 22110, one may then test the same CTI application against a different make and model of switch and/or location and connectivity of a switch user may quickly and conveniently substitute one CLIL setup for another for communication with a switch of interest.

Internet Protocol Network Telephony (IPNT)

In all of the embodiments and aspects of the invention described above specific examples have been drawn from the technological area of conventional intelligent telephony networks, other than what is now known as Internet protocol network telephony, wherein computers simulate telephones through software, microphones, and speakers, and telephony data between such equipped computers is transmitted over Internet connections and directed by servers, such as destination number servers (DNS) in the Internet. In the IPNT world IP addresses are used instead of telephone numbers, and there are differences in the way data packets are formulated and transmitted. Moreover, what may be termed routing is done by such as IP switches and hubs, wherein destination addresses may be changed. These differences, however, are not limiting in embodiments of the present invention.

FIG. 7 shows such an embodiment wherein Internet calls originating in Internet network 1200 from computer 1210 are received by the DNS in the Internet and forwarded to switch 1120, which in this embodiment also functions as an IP switch. From this point the Internet call is treated like a telephony call wherein the call may also have caller ID attached (originating caller's Internet address), and in those cases, wherein a separate network digital data link is accomplished between processors at the origination end (1114) and the customer's premises (1151) a data packet associated with the call may be forwarded over link 1118. Also, T-S 1116, which interacts continuously with switch 1120 in this embodiment, is capable of transacting with data file server 1153, given caller ID and/or other data associated with a call, to retrieve further information about the caller from data file server 1153.

In many embodiments of the invention described, the inventions are involved with new and unique ways to use machine intelligence for telephony functions, particularly, but not exclusively, as these functions relate to call centers and intelligent routing of calls. In instances of the invention described, the principles of the invention may also be applied to IPNT without undue experimentation.

As examples of IPNT application, in those embodiments dealing with personal routing and personal routers, the methods and apparatus described may also be adapted to IPNT so personal routing rules, negotiation, and the like may be provided for IPNT calls as well. In the aspects of the invention dealing with simulation of CTI applications and testing, the applications may apply to IPNT telephony as well as to more conventional telephony systems. Other examples will be apparent to those with skill in the telephony arts.

It will be apparent to those with skill in the art that there are many alterations that may be made in the embodiments of the invention herein described without departing from the spirit and scope of the invention. Some of these have been described above, such as the use of a telephony server like T-Server 1207 running on processor 1223. In some cases such a server is not needed to practice the invention, as was described above.

Many of the functional units of the system in embodiments of the invention may be implemented as code routines in computerized telephony equipment, computer servers, and individual workstations. It is well-known that programmers are highly individualistic, and may implement similar functionality by considerably different routines. Also, the invention may be applied to widely varying hardware systems. Further, hardware used to practice the invention may vary in many ways. There are similarly many other alterations in the embodiments described herein which will fall within the spirit and scope of the present invention in it's several aspects described. The invention is limited only by the breadth of the claims below.

Claims

1. A call center, comprising:

a plurality of agent stations having a telephone connected to computerized equipment enabling a user agent to interact with Internet Protocol (IP) calls over the telephone;
a local area network (LAN) connecting at least some of the agent stations;
a server having an Internet connection adapted to receive IP calls from the Internet;
an IP switch connected to the LAN having access to a data repository;
wherein the server attaches data initially received with an IP call and forwards the IP call to the IP switch which uses the attached data to retrieve further data associated with the IP call or caller from the data repository, and to provide the further data to an agent to which the call is routed.

2. The call center of claim 1 wherein the IP switch is adapted to service IP calls from specific servers in the Internet and to block display of data at agent stations for any call not identified as originating at one of the specific servers.

3. The call center of claim 1 wherein the computerized equipment comprises personal computers (PCs).

4. A call-routing system, comprising:

a server connected to the Internet, the server adapted to receive IP telephone calls originating from the Internet and attach data initially received with the IP call;
an IP switch for queuing the calls for agents at agent stations in a communication center; and
a call router executing in the IP switch, the call router adapted to route the IP calls to the agent stations;
wherein the IP switch uses data initially received with an IP call to retrieve further data associated with a caller from the data repository, and to provide the further data to an agent to which the call is routed.

5. The system of claim 4 wherein the IP switch is adapted to service calls from specific servers in the IP network and to block display of data at agent stations for any call not identified as originating at one of the specific servers.

6. The call-routing system of claim 4 wherein one or more of the agent stations comprise personal computers (PCs).

Referenced Cited
U.S. Patent Documents
3914559 October 1975 Knollman
4048452 September 13, 1977 Oehring et al.
4290141 September 15, 1981 Anderson et al.
4320256 March 16, 1982 Freeman
4345315 August 17, 1982 Cadotte et al.
4355207 October 19, 1982 Curtin
4355372 October 19, 1982 Johnson et al.
4400587 August 23, 1983 Taylor et al.
4439636 March 27, 1984 Newkirk et al.
4451700 May 29, 1984 Kempner et al.
4489438 December 18, 1984 Hughes
4512011 April 16, 1985 Turner
4517410 May 14, 1985 Williams et al.
4521643 June 4, 1985 Dupuis et al.
4523055 June 11, 1985 Hohl et al.
4528643 July 9, 1985 Freeny, Jr.
4539435 September 3, 1985 Eckmann
4555903 December 3, 1985 Heaton
4558180 December 10, 1985 Scordo
4559415 December 17, 1985 Bernard et al.
4566030 January 21, 1986 Nickerson et al.
4567323 January 28, 1986 Lottes et al.
4577062 March 18, 1986 Hilleary et al.
4577067 March 18, 1986 Levy et al.
4578700 March 25, 1986 Roberts et al.
4580012 April 1, 1986 Matthews et al.
4584602 April 22, 1986 Nakagawa
4587379 May 6, 1986 Masuda
4598367 July 1, 1986 DeFrancesco et al.
4603232 July 29, 1986 Kurland et al.
4611094 September 9, 1986 Asmuth et al.
4625276 November 25, 1986 Benton et al.
4630200 December 16, 1986 Ohmae et al.
4630201 December 16, 1986 White
4634809 January 6, 1987 Paulsson et al.
4649563 March 10, 1987 Riskin
4654482 March 31, 1987 DeAngelis
4667287 May 19, 1987 Allen et al.
4674044 June 16, 1987 Kalmus et al.
4679189 July 7, 1987 Olson et al.
4696029 September 22, 1987 Cohen
4697282 September 29, 1987 Winter et al.
4737983 April 12, 1988 Frauenthal et al.
4756020 July 5, 1988 Fodale
4757267 July 12, 1988 Riskin
4763191 August 9, 1988 Gordon et al.
4763317 August 9, 1988 Lehman et al.
4763353 August 9, 1988 Canale et al.
4771425 September 13, 1988 Baran et al.
4785408 November 15, 1988 Britton et al.
4788715 November 29, 1988 Lee
4811382 March 7, 1989 Sleevi
4812843 March 14, 1989 Champion, III et al.
4829563 May 9, 1989 Crockett et al.
4831518 May 16, 1989 Yu et al.
4852001 July 25, 1989 Tsushima et al.
4866756 September 12, 1989 Crane et al.
4881261 November 14, 1989 Oliphant et al.
4893328 January 9, 1990 Peacock
4896345 January 23, 1990 Thorne
4897866 January 30, 1990 Majmudar et al.
4908850 March 13, 1990 Masson et al.
4924488 May 8, 1990 Kosich
4943995 July 24, 1990 Daudelin et al.
4953204 August 28, 1990 Cuschleg, Jr. et al.
4972461 November 20, 1990 Brown et al.
4994985 February 19, 1991 Cree et al.
5001710 March 19, 1991 Gawrys et al.
5008930 April 16, 1991 Gawrys et al.
5017917 May 21, 1991 Fisher et al.
5020095 May 28, 1991 Morganstein et al.
5036535 July 30, 1991 Gechter et al.
5058152 October 15, 1991 Solomon et al.
5062103 October 29, 1991 Davidson et al.
5073890 December 17, 1991 Danielsen
5095504 March 10, 1992 Nishikawa et al.
5117225 May 26, 1992 Wang
5136633 August 4, 1992 Tejada et al.
5155761 October 13, 1992 Hammond
5164983 November 17, 1992 Brown et al.
5168515 December 1, 1992 Gechter et al.
5175800 December 29, 1992 Galis et al.
5179589 January 12, 1993 Syu
5181236 January 19, 1993 LaVallee et al.
5181239 January 19, 1993 Jolissaint
5185782 February 9, 1993 Srinivasan
5202828 April 13, 1993 Vertelney et al.
5206903 April 27, 1993 Kohler et al.
5208745 May 4, 1993 Quentin et al.
5212727 May 18, 1993 Ramkumar
5214688 May 25, 1993 Szlam et al.
5231670 July 27, 1993 Goldhor et al.
5247569 September 21, 1993 Cave
5249223 September 28, 1993 Vanacore
5253288 October 12, 1993 Frey et al.
5256863 October 26, 1993 Ferguson et al.
5261096 November 9, 1993 Howarth
5271058 December 14, 1993 Andrews et al.
5274635 December 28, 1993 Rahman et al.
5274700 December 28, 1993 Gechter et al.
5274782 December 28, 1993 Chalasani et al.
5278898 January 11, 1994 Cambray et al.
5278977 January 11, 1994 Spencer et al.
5280625 January 18, 1994 Howarter et al.
5283638 February 1, 1994 Engberg et al.
5283856 February 1, 1994 Gross et al.
5285494 February 8, 1994 Sprecher et al.
5288147 February 22, 1994 Schaefer et al.
5291550 March 1, 1994 Levy et al.
5291551 March 1, 1994 Conn et al.
5291552 March 1, 1994 Kerrigan et al.
5299259 March 29, 1994 Otto
5299260 March 29, 1994 Shaio
5301320 April 5, 1994 McAtee et al.
5309505 May 3, 1994 Szlam et al.
5311574 May 10, 1994 Livanos
5311583 May 10, 1994 Friedes et al.
5315709 May 24, 1994 Alston, Jr. et al.
5327486 July 5, 1994 Wolff et al.
5329583 July 12, 1994 Jurgensen et al.
5333266 July 26, 1994 Boaz et al.
5335268 August 2, 1994 Kelly, Jr. et al.
5335269 August 2, 1994 Steinlicht
5343477 August 30, 1994 Yamada
5343518 August 30, 1994 Kneipp
5355474 October 11, 1994 Thuraisngham et al.
5359649 October 25, 1994 Rosu et al.
5363507 November 1994 Nakayama et al.
5367329 November 22, 1994 Nakagaki et al.
5369695 November 29, 1994 Chakravarti et al.
5384766 January 24, 1995 Yamato et al.
5384771 January 24, 1995 Isidoro et al.
5384829 January 24, 1995 Heileman, Jr. et al.
5384841 January 24, 1995 Adams et al.
5392277 February 21, 1995 Bernstein
5392328 February 21, 1995 Schmidt et al.
5392345 February 21, 1995 Otto
5392400 February 21, 1995 Berkowitz et al.
5402474 March 28, 1995 Miller et al.
5414762 May 9, 1995 Flisik et al.
5422813 June 6, 1995 Schuchman et al.
5425091 June 13, 1995 Josephs
5425093 June 13, 1995 Trefzger
5426594 June 20, 1995 Wright et al.
5428608 June 27, 1995 Freeman et al.
5436965 July 25, 1995 Grossman et al.
5436967 July 25, 1995 Hanson
5440719 August 8, 1995 Hanes et al.
5444767 August 22, 1995 Goetcheus et al.
5444774 August 22, 1995 Friedes
5444823 August 22, 1995 Nguyen
5450482 September 12, 1995 Chen et al.
5450483 September 12, 1995 Williams
5452350 September 19, 1995 Reynolds et al.
5455903 October 3, 1995 Jolissaint et al.
5459780 October 17, 1995 Sand
5463685 October 31, 1995 Gaechter et al.
5465286 November 7, 1995 Clare et al.
5467391 November 14, 1995 Donaghue, Jr. et al.
5469504 November 21, 1995 Blaha
5473680 December 5, 1995 Porter
5475813 December 12, 1995 Cieslak et al.
5479487 December 26, 1995 Hammond
5481616 January 2, 1996 Freadman
5488648 January 30, 1996 Womble
5491783 February 13, 1996 Douglas et al.
5493564 February 20, 1996 Mullan
5495522 February 27, 1996 Allen et al.
5495523 February 27, 1996 Stent et al.
5496392 March 5, 1996 Sims et al.
5497317 March 5, 1996 Hawkins et al.
5497371 March 5, 1996 Ellis et al.
5497373 March 5, 1996 Hulen et al.
5500891 March 19, 1996 Harrington et al.
5506898 April 9, 1996 Costantini et al.
5509062 April 16, 1996 Carlsen
5510829 April 23, 1996 Sugiyama et al.
5511117 April 23, 1996 Zazzera
5517620 May 14, 1996 Hashimoto et al.
5519773 May 21, 1996 Dumas et al.
5524047 June 4, 1996 Brown et al.
5524147 June 4, 1996 Bean
5526353 June 11, 1996 Henley et al.
5528678 June 18, 1996 Kaplan
5530740 June 25, 1996 Irribarren et al.
5530744 June 25, 1996 Charalambous et al.
5533103 July 2, 1996 Peavey et al.
5533107 July 2, 1996 Irwin et al.
5533108 July 2, 1996 Harris et al.
5533110 July 2, 1996 Pinard et al.
5533115 July 2, 1996 Hollenbach et al.
5535211 July 9, 1996 Yano
5535256 July 9, 1996 Maloney et al.
5535323 July 9, 1996 Miller et al.
5537470 July 16, 1996 Lee
5537630 July 16, 1996 Berry et al.
5539811 July 23, 1996 Nakamura et al.
5544220 August 6, 1996 Trefzger
5546452 August 13, 1996 Andrews et al.
5550816 August 27, 1996 Hardwick et al.
5553133 September 3, 1996 Perkins
5555299 September 10, 1996 Maloney et al.
5555426 September 10, 1996 Johnson et al.
5557667 September 17, 1996 Bruno et al.
5559868 September 24, 1996 Blonder
5559877 September 24, 1996 Ash et al.
5559878 September 24, 1996 Keys et al.
5561711 October 1, 1996 Muller
5561841 October 1, 1996 Markus
5563805 October 8, 1996 Arbuckle et al.
5563937 October 8, 1996 Bruno et al.
5566294 October 15, 1996 Kojima et al.
5570419 October 29, 1996 Cave et al.
5570420 October 29, 1996 Bress et al.
5572579 November 5, 1996 Orriss et al.
5572643 November 5, 1996 Judson
5577100 November 19, 1996 McGregor et al.
5577105 November 19, 1996 Baum et al.
5583862 December 10, 1996 Callon
5583922 December 10, 1996 Davis et al.
5590188 December 31, 1996 Crockett
5592542 January 7, 1997 Honda et al.
5592543 January 7, 1997 Smith et al.
5594791 January 14, 1997 Szlam et al.
5598532 January 28, 1997 Liron
5604737 February 18, 1997 Iwami et al.
5606602 February 25, 1997 Johnson et al.
5608778 March 4, 1997 Partridge, III
5608786 March 4, 1997 Gordon
5610910 March 11, 1997 Focsaneanu et al.
5617570 April 1, 1997 Russell et al.
5619183 April 8, 1997 Ziegra et al.
5619557 April 8, 1997 Van Berkum
5619648 April 8, 1997 Canale et al.
5621789 April 15, 1997 McCalmont et al.
5621790 April 15, 1997 Grossman et al.
5623600 April 22, 1997 Ji et al.
5624265 April 29, 1997 Redford et al.
5625404 April 29, 1997 Grady et al.
5625676 April 29, 1997 Greco et al.
5625682 April 29, 1997 Gray et al.
5627764 May 6, 1997 Schutzman et al.
5627884 May 6, 1997 Williams et al.
5630127 May 13, 1997 Moore et al.
5632011 May 20, 1997 Landfield et al.
5633920 May 27, 1997 Kikinis et al.
5633924 May 27, 1997 Kaish et al.
5635918 June 3, 1997 Tett
5640445 June 17, 1997 David
5642411 June 24, 1997 Theis
5642477 June 24, 1997 de Carmo et al.
5642511 June 24, 1997 Chow et al.
5644720 July 1, 1997 Boll et al.
5646981 July 8, 1997 Klein
5649105 July 15, 1997 Aldred et al.
5652789 July 29, 1997 Miner et al.
5652791 July 29, 1997 Sunderman et al.
5654961 August 5, 1997 Araujo et al.
5655015 August 5, 1997 Walsh et al.
5657383 August 12, 1997 Gerber et al.
5659542 August 19, 1997 Bell et al.
5659604 August 19, 1997 Beckmann
5659746 August 19, 1997 Bankert et al.
5673304 September 30, 1997 Connor et al.
5673311 September 30, 1997 Andruska et al.
5673322 September 30, 1997 Pepe et al.
5675637 October 7, 1997 Szlam et al.
5684870 November 4, 1997 Maloney et al.
5689229 November 18, 1997 Chaco et al.
5692033 November 25, 1997 Farris
5696809 December 9, 1997 Voit
5696811 December 9, 1997 Maloney et al.
5701400 December 23, 1997 Amado
5703943 December 30, 1997 Otto
5706453 January 6, 1998 Cheng et al.
5708702 January 13, 1998 De Paul et al.
5712901 January 27, 1998 Meermans
5715306 February 3, 1998 Sunderman et al.
5715307 February 3, 1998 Zazzera
5715432 February 3, 1998 Xu et al.
5717747 February 10, 1998 Boyle, III et al.
5721770 February 24, 1998 Kohler
5724412 March 3, 1998 Srinivasan
5724418 March 3, 1998 Brady
5726984 March 10, 1998 Kubler et al.
5727159 March 10, 1998 Kikinis
5729594 March 17, 1998 Klingman
5732078 March 24, 1998 Arango
5734981 March 31, 1998 Kennedy, III et al.
5737495 April 7, 1998 Adams et al.
5737595 April 7, 1998 Cohen et al.
5737726 April 7, 1998 Cameron et al.
5737727 April 7, 1998 Lehmann et al.
5740238 April 14, 1998 Flockhart et al.
5740240 April 14, 1998 Jolissaint
5742668 April 21, 1998 Pepe et al.
5742670 April 21, 1998 Bennett
5742675 April 21, 1998 Kilander et al.
5742905 April 21, 1998 Pepe et al.
5745687 April 28, 1998 Randell
5745878 April 28, 1998 Hashimoto et al.
5748884 May 5, 1998 Royce et al.
5748907 May 5, 1998 Crane
5751706 May 12, 1998 Land et al.
5751707 May 12, 1998 Voit et al.
5751795 May 12, 1998 Hassler et al.
5752059 May 12, 1998 Holleran et al.
5752244 May 12, 1998 Rose et al.
5752246 May 12, 1998 Rogers et al.
5754111 May 19, 1998 Garcia
5754636 May 19, 1998 Bayless et al.
5754639 May 19, 1998 Flockhart et al.
5754655 May 19, 1998 Hughes et al.
5757904 May 26, 1998 Anderson
5760823 June 2, 1998 Brunson et al.
5761289 June 2, 1998 Keshav
5764736 June 9, 1998 Shachar et al.
5764898 June 9, 1998 Tsuji et al.
5765033 June 9, 1998 Miloslavsky
5768360 June 16, 1998 Reynolds et al.
5768527 June 16, 1998 Zhu et al.
5774583 June 30, 1998 Sasaki et al.
5778060 July 7, 1998 Otto
5778178 July 7, 1998 Arunachalam
5778377 July 7, 1998 Marlin et al.
5784438 July 21, 1998 Martinez
5784451 July 21, 1998 Smith, Jr.
5784452 July 21, 1998 Carney
5787160 July 28, 1998 Chaney et al.
5787163 July 28, 1998 Taylor et al.
5790635 August 4, 1998 Dezonno
5790650 August 4, 1998 Dunn et al.
5790789 August 4, 1998 Suarez
5790798 August 4, 1998 Beckett, II et al.
5793857 August 11, 1998 Barnes et al.
5793861 August 11, 1998 Haigh
5794039 August 11, 1998 Guck
5796398 August 18, 1998 Zimmer
5796729 August 18, 1998 Greaney et al.
5796791 August 18, 1998 Polcyn
5796813 August 18, 1998 Sonnenberg
5799067 August 25, 1998 Kikinis et al.
5799297 August 25, 1998 Goodridge et al.
5802163 September 1, 1998 Miloslavsky
5802253 September 1, 1998 Gross et al.
5802283 September 1, 1998 Grady et al.
5802314 September 1, 1998 Tullis et al.
5802316 September 1, 1998 Ito et al.
5802493 September 1, 1998 Sheflott et al.
5802526 September 1, 1998 Fawcett et al.
5805587 September 8, 1998 Norris et al.
5806061 September 8, 1998 Chaudhuri et al.
5809128 September 15, 1998 McMullin
5809282 September 15, 1998 Cooper et al.
5809512 September 15, 1998 Kato
5812795 September 22, 1998 Horovitz et al.
5813014 September 22, 1998 Gustman
5815566 September 29, 1998 Ramot et al.
5818935 October 6, 1998 Maa
5822306 October 13, 1998 Catchpole
5822400 October 13, 1998 Smith
5822404 October 13, 1998 Cave
5822526 October 13, 1998 Waskiewicz
5825775 October 20, 1998 Chin et al.
5825862 October 20, 1998 Voit et al.
5825869 October 20, 1998 Brooks et al.
5825870 October 20, 1998 Miloslavsky
5826040 October 20, 1998 Fargher et al.
5826269 October 20, 1998 Hussey
5828747 October 27, 1998 Fisher et al.
5828839 October 27, 1998 Moncreiff
5831611 November 3, 1998 Kennedy et al.
5832196 November 3, 1998 Croslin et al.
5835090 November 10, 1998 Clark et al.
5835583 November 10, 1998 Hetz et al.
5838682 November 17, 1998 Dekelbaum et al.
5838768 November 17, 1998 Sumar et al.
5838774 November 17, 1998 Weisser, Jr.
5841854 November 24, 1998 Schumacher et al.
5842131 November 24, 1998 Yamane
5844980 December 1, 1998 Patel et al.
5844982 December 1, 1998 Knitl
5847484 December 8, 1998 Kuyama et al.
5848131 December 8, 1998 Shaffer et al.
5848143 December 8, 1998 Andrews et al.
5850433 December 15, 1998 Rondeau
5852814 December 22, 1998 Allen
5857184 January 5, 1999 Lynch
5862134 January 19, 1999 Deng
5862211 January 19, 1999 Roush
5862223 January 19, 1999 Walker et al.
5864616 January 26, 1999 Hartmeier
5864848 January 26, 1999 Horvitz et al.
5867484 February 2, 1999 Shaunfield
5867494 February 2, 1999 Krishnaswamy et al.
5867495 February 2, 1999 Elliott et al.
5867559 February 2, 1999 Jorgensen et al.
5867562 February 2, 1999 Scherer
5867822 February 2, 1999 Sankar
5870464 February 9, 1999 Brewster et al.
5870549 February 9, 1999 Bobo, II
5872841 February 16, 1999 King et al.
5872926 February 16, 1999 Levac et al.
5873032 February 16, 1999 Cox et al.
5873040 February 16, 1999 Dunn et al.
5873076 February 16, 1999 Barr et al.
5878126 March 2, 1999 Velamuri et al.
5878130 March 2, 1999 Andrews et al.
5878230 March 2, 1999 Weber et al.
5881146 March 9, 1999 Hamilton
5883891 March 16, 1999 Williams et al.
5884032 March 16, 1999 Bateman et al.
5884262 March 16, 1999 Wise et al.
5887173 March 23, 1999 Ogawa et al.
5889474 March 30, 1999 LaDue
5889774 March 30, 1999 Mirashrafi et al.
5889799 March 30, 1999 Grossman et al.
5889863 March 30, 1999 Weber
5892764 April 6, 1999 Riemann et al.
5892822 April 6, 1999 Gottlieb et al.
5893912 April 13, 1999 Freund et al.
5894512 April 13, 1999 Zenner
5896444 April 20, 1999 Perlman et al.
5897635 April 27, 1999 Torres et al.
5901138 May 4, 1999 Bader et al.
5901203 May 4, 1999 Morganstein et al.
5901209 May 4, 1999 Tannenbaum et al.
5903631 May 11, 1999 Smith et al.
5903877 May 11, 1999 Berkowitz et al.
5905495 May 18, 1999 Tanaka et al.
5905792 May 18, 1999 Miloslavsky
5905793 May 18, 1999 Flockhart et al.
5905863 May 18, 1999 Knowles et al.
5907547 May 25, 1999 Foladare et al.
5911134 June 8, 1999 Castonguay et al.
5911776 June 15, 1999 Guck
5914941 June 22, 1999 Janky
5915001 June 22, 1999 Uppaluru
5915008 June 22, 1999 Dulman
5915011 June 22, 1999 Miloslavsky
5915012 June 22, 1999 Miloslavsky
5916302 June 29, 1999 Dunn et al.
5917817 June 29, 1999 Dunn et al.
5917898 June 29, 1999 Bassa et al.
5918213 June 29, 1999 Bernard et al.
5920621 July 6, 1999 Gottlieb
5920719 July 6, 1999 Sutton et al.
5920865 July 6, 1999 Ariga
5923745 July 13, 1999 Hurd
5923879 July 13, 1999 Sasmazel et al.
5926535 July 20, 1999 Reynolds
5926538 July 20, 1999 Deryugin et al.
5926539 July 20, 1999 Shtivelman
5933492 August 3, 1999 Turovski
5937051 August 10, 1999 Hurd et al.
5937057 August 10, 1999 Bell et al.
5937162 August 10, 1999 Funk et al.
5937388 August 10, 1999 Davis et al.
5938725 August 17, 1999 Hara
5940075 August 17, 1999 Mutschler, III et al.
5940478 August 17, 1999 Vaudreuil et al.
5940479 August 17, 1999 Guy et al.
5940488 August 17, 1999 DeGrazia et al.
5940495 August 17, 1999 Bondarenko et al.
5940496 August 17, 1999 Gisby et al.
5940497 August 17, 1999 Miloslavsky
5940598 August 17, 1999 Strauss et al.
5940823 August 17, 1999 Schreiber et al.
5943416 August 24, 1999 Gisby
5946375 August 31, 1999 Pattison et al.
5946386 August 31, 1999 Rogers et al.
5946387 August 31, 1999 Miloslavsky
5948054 September 7, 1999 Nielsen
5949988 September 7, 1999 Feisullin et al.
5953332 September 14, 1999 Miloslavsky
5953405 September 14, 1999 Miloslavsky
5953406 September 14, 1999 LaRue et al.
5956482 September 21, 1999 Agraharam et al.
5956729 September 21, 1999 Goetz et al.
5958014 September 28, 1999 Cave
5958016 September 28, 1999 Chang et al.
5958064 September 28, 1999 Judd et al.
5959982 September 28, 1999 Federkins et al.
5960073 September 28, 1999 Kikinis et al.
5960411 September 28, 1999 Hartman et al.
5963632 October 5, 1999 Miloslavsky
5963635 October 5, 1999 Szlam et al.
5966427 October 12, 1999 Shaffer et al.
5966695 October 12, 1999 Melchione et al.
5970065 October 19, 1999 Miloslavsky
5970134 October 19, 1999 Highland et al.
5974135 October 26, 1999 Breneman et al.
5974414 October 26, 1999 Stanczak et al.
5974448 October 26, 1999 Yamauchi et al.
RE36416 November 30, 1999 Szlam et al.
5978465 November 2, 1999 Corduroy et al.
5978467 November 2, 1999 Walker et al.
5978672 November 2, 1999 Hartmaier et al.
5978836 November 2, 1999 Ouchi
5982774 November 9, 1999 Foladare et al.
5982870 November 9, 1999 Pershan et al.
5982873 November 9, 1999 Flockhart et al.
5983218 November 9, 1999 Syeda-Mahmood
5987102 November 16, 1999 Elliott et al.
5987117 November 16, 1999 McNeil et al.
5987118 November 16, 1999 Dickerman et al.
5987423 November 16, 1999 Arnold et al.
5987446 November 16, 1999 Corey et al.
5991365 November 23, 1999 Pizano et al.
5991390 November 23, 1999 Booton
5991391 November 23, 1999 Miloslavsky
5991392 November 23, 1999 Miloslavsky
5991393 November 23, 1999 Kamen
5991394 November 23, 1999 Dezonno et al.
5991395 November 23, 1999 Miloslavsky
5995606 November 30, 1999 Civanlar et al.
5995614 November 30, 1999 Miloslavsky
5995615 November 30, 1999 Miloslavsky
5996000 November 30, 1999 Shuster
5999525 December 7, 1999 Krishnaswamy et al.
5999609 December 7, 1999 Nishimura
5999965 December 7, 1999 Kelly
6002396 December 14, 1999 Davies
6002760 December 14, 1999 Gisby
6003034 December 14, 1999 Tuli
6005845 December 21, 1999 Svennesson et al.
6005920 December 21, 1999 Fuller et al.
6005931 December 21, 1999 Neyman et al.
6009163 December 28, 1999 Nabkel et al.
6011792 January 4, 2000 Miloslavsky
6011844 January 4, 2000 Uppaluru et al.
6011974 January 4, 2000 Cedervall et al.
6012152 January 4, 2000 Douik et al.
6014137 January 11, 2000 Burns
6014138 January 11, 2000 Cain et al.
6014379 January 11, 2000 White et al.
6014437 January 11, 2000 Acker et al.
6014647 January 11, 2000 Nizzari et al.
6018578 January 25, 2000 Bondarenko et al.
6018579 January 25, 2000 Petrunka
6018761 January 25, 2000 Uomini
6021262 February 1, 2000 Cote et al.
6021411 February 1, 2000 Brophy et al.
6021428 February 1, 2000 Miloslavsky
6023684 February 8, 2000 Pearson
6023723 February 8, 2000 McCormick et al.
6026087 February 15, 2000 Mirashrafi et al.
6026375 February 15, 2000 Hall et al.
6028917 February 22, 2000 Creamer et al.
6029195 February 22, 2000 Herz
6038293 March 14, 2000 McNerney et al.
6038537 March 14, 2000 Matsuoka
6041116 March 21, 2000 Meyers
6044144 March 28, 2000 Becker et al.
6044146 March 28, 2000 Gisby et al.
6044368 March 28, 2000 Powers
6046762 April 4, 2000 Sonesh et al.
6047060 April 4, 2000 Fedorov et al.
6049272 April 11, 2000 Lee et al.
6049547 April 11, 2000 Fisher et al.
6049779 April 11, 2000 Berkson
6052514 April 18, 2000 Gill et al.
6055307 April 25, 2000 Behnke et al.
6055308 April 25, 2000 Miloslavsky et al.
6055513 April 25, 2000 Katz et al.
6058163 May 2, 2000 Pattison et al.
6058389 May 2, 2000 Chandra et al.
6058435 May 2, 2000 Sassin et al.
6061054 May 9, 2000 Jolly
6064667 May 16, 2000 Gisby et al.
6064722 May 16, 2000 Clise et al.
6064723 May 16, 2000 Cohn et al.
6064730 May 16, 2000 Ginsberg
6064973 May 16, 2000 Smith et al.
6067357 May 23, 2000 Kishinsky et al.
6069890 May 30, 2000 White et al.
6070142 May 30, 2000 McDonough et al.
6070144 May 30, 2000 Ginsberg et al.
6072864 June 6, 2000 Shtivelman et al.
6073013 June 6, 2000 Agre et al.
6073105 June 6, 2000 Sutcliffe et al.
6073109 June 6, 2000 Flores et al.
6073124 June 6, 2000 Krishnan et al.
6075783 June 13, 2000 Voit
6075843 June 13, 2000 Cave
6076101 June 13, 2000 Kamakura et al.
6076105 June 13, 2000 Wolff et al.
6078581 June 20, 2000 Shtivelman et al.
6078583 June 20, 2000 Takahara et al.
6081291 June 27, 2000 Ludwig, Jr.
6081591 June 27, 2000 Skoog
6081592 June 27, 2000 Battle
6085097 July 4, 2000 Savery et al.
6085201 July 4, 2000 Tso
6088340 July 11, 2000 Buchholz et al.
6088696 July 11, 2000 Moon et al.
6088717 July 11, 2000 Reed et al.
6094479 July 25, 2000 Lindeberg et al.
6094673 July 25, 2000 Dilip et al.
6097804 August 1, 2000 Gilbert et al.
6097938 August 1, 2000 Paxson
6098065 August 1, 2000 Skillen et al.
6104711 August 15, 2000 Voit
6104800 August 15, 2000 Benson
6104801 August 15, 2000 Miloslavsky
6104802 August 15, 2000 Perlmutter
6108688 August 22, 2000 Nielsen
6108711 August 22, 2000 Beck et al.
6112085 August 29, 2000 Garner et al.
6115596 September 5, 2000 Raith et al.
6115742 September 5, 2000 Franklin et al.
6118865 September 12, 2000 Gisby
6119155 September 12, 2000 Rossmann et al.
6119167 September 12, 2000 Boyle et al.
6122360 September 19, 2000 Neyman et al.
6122364 September 19, 2000 Petrunka et al.
6122365 September 19, 2000 Yegoshin
6122632 September 19, 2000 Botts et al.
6125113 September 26, 2000 Farris et al.
6125126 September 26, 2000 Hallenst
6128379 October 3, 2000 Smyk
6128482 October 3, 2000 Nixon et al.
6128603 October 3, 2000 Dent et al.
6128646 October 3, 2000 Miloslavsky
6130933 October 10, 2000 Miloslavsky
6134217 October 17, 2000 Stiliadis et al.
6134235 October 17, 2000 Goldman et al.
6134315 October 17, 2000 Galvin
6134318 October 17, 2000 O'Neil
6134530 October 17, 2000 Bunting et al.
6137870 October 24, 2000 Scherer
6138139 October 24, 2000 Beck et al.
6141345 October 31, 2000 Goeddel et al.
6148074 November 14, 2000 Miloslavsky et al.
6157653 December 5, 2000 Kline et al.
6157655 December 5, 2000 Shtivelman
6157924 December 5, 2000 Austin
6166735 December 26, 2000 Dom et al.
6167255 December 26, 2000 Kennedy, III et al.
6167395 December 26, 2000 Beck et al.
6167404 December 26, 2000 Morcos et al.
6170011 January 2, 2001 MacLeod et al.
6173052 January 9, 2001 Brady
6173316 January 9, 2001 De Boor et al.
6175562 January 16, 2001 Cave
6175563 January 16, 2001 Miloslavsky
6175564 January 16, 2001 Miloslavsky et al.
6175620 January 16, 2001 Rouge et al.
6175842 January 16, 2001 Kirk et al.
6178239 January 23, 2001 Kishinsky et al.
6181336 January 30, 2001 Chiu et al.
6181736 January 30, 2001 McLaughlin et al.
6181788 January 30, 2001 Miloslavsky
6182059 January 30, 2001 Angotti et al.
6182249 January 30, 2001 Wookey et al.
6185287 February 6, 2001 Miloslavsky
6185291 February 6, 2001 Miloslavsky
6185292 February 6, 2001 Miloslavsky
6185427 February 6, 2001 Krasner et al.
6185535 February 6, 2001 Hedin et al.
6188688 February 13, 2001 Buskirk, Jr.
6192250 February 20, 2001 Buskens et al.
6195357 February 27, 2001 Polcyn
6198738 March 6, 2001 Chang et al.
6198739 March 6, 2001 Neyman et al.
6201804 March 13, 2001 Kikinis
6201863 March 13, 2001 Miloslavsky
6205135 March 20, 2001 Chinni et al.
6205412 March 20, 2001 Barskyy
6212178 April 3, 2001 Beck et al.
6215783 April 10, 2001 Neyman
6219045 April 17, 2001 Leahy et al.
6219413 April 17, 2001 Burg
6222919 April 24, 2001 Hollatz et al.
6226285 May 1, 2001 Kozdon et al.
6229524 May 8, 2001 Chernock et al.
6229888 May 8, 2001 Miloslavsky
6230197 May 8, 2001 Beck et al.
6233234 May 15, 2001 Curry et al.
6233616 May 15, 2001 Reid
6236857 May 22, 2001 Calabrese et al.
6240285 May 29, 2001 Blum et al.
6243092 June 5, 2001 Okita et al.
6243373 June 5, 2001 Turock
6243375 June 5, 2001 Speicher
6243379 June 5, 2001 Veerina et al.
6243713 June 5, 2001 Nelson et al.
6249807 June 19, 2001 Shaw et al.
6253129 June 26, 2001 Jenkins et al.
6256489 July 3, 2001 Lichter et al.
6256503 July 3, 2001 Stephens
6259692 July 10, 2001 Shtivelman et al.
6259774 July 10, 2001 Miloslavsky
6259786 July 10, 2001 Gisby
6263049 July 17, 2001 Kuhn
6263065 July 17, 2001 Durinovic-Johri et al.
6263066 July 17, 2001 Shtivelman et al.
6263359 July 17, 2001 Fong et al.
6275693 August 14, 2001 Lin et al.
6278996 August 21, 2001 Richardson et al.
6282429 August 28, 2001 Baiyor et al.
6282565 August 28, 2001 Shaw et al.
6285316 September 4, 2001 Nir et al.
6285364 September 4, 2001 Giordano, III et al.
6286033 September 4, 2001 Kishinsky et al.
6286084 September 4, 2001 Wexler et al.
6286129 September 4, 2001 Agarwal et al.
6289094 September 11, 2001 Miloslavsky
6292181 September 18, 2001 Banerjee et al.
6292553 September 18, 2001 Fellingham et al.
6295353 September 25, 2001 Flockhart et al.
6295530 September 25, 2001 Ritchie et al.
6298041 October 2, 2001 Packer
6301480 October 9, 2001 Kennedy, III et al.
6304898 October 16, 2001 Shiigi
6314089 November 6, 2001 Szlam et al.
6314430 November 6, 2001 Chang
6320857 November 20, 2001 Tonnby et al.
6320951 November 20, 2001 Shtivelman et al.
6324276 November 27, 2001 Uppaluru et al.
6330323 December 11, 2001 Gottlieb et al.
6330426 December 11, 2001 Brown et al.
6332022 December 18, 2001 Martinez
6332154 December 18, 2001 Beck et al.
6332163 December 18, 2001 Bowman-Amuah
6333980 December 25, 2001 Hollatz et al.
6335927 January 1, 2002 Elliott et al.
6337904 January 8, 2002 Gisby
6339593 January 15, 2002 Kikinis
6343281 January 29, 2002 Kato
6345290 February 5, 2002 Okada et al.
6345300 February 5, 2002 Bakshi et al.
6345305 February 5, 2002 Beck et al.
6346952 February 12, 2002 Shtivelman
6347085 February 12, 2002 Kelly
6353608 March 5, 2002 Cullers et al.
6353667 March 5, 2002 Foster et al.
6359981 March 19, 2002 Neyman et al.
6362838 March 26, 2002 Szlam et al.
6363411 March 26, 2002 Dugan et al.
6366575 April 2, 2002 Barkan et al.
6366586 April 2, 2002 Christie
6366651 April 2, 2002 Griffith et al.
6366658 April 2, 2002 Bjornberg et al.
6366925 April 2, 2002 Meltzer et al.
6370238 April 9, 2002 Sansone et al.
6370508 April 9, 2002 Beck et al.
6370567 April 9, 2002 Ouchi
6373836 April 16, 2002 Deryugin et al.
6373937 April 16, 2002 Yegoshin
6377568 April 23, 2002 Kelly
6377583 April 23, 2002 Lyles et al.
6377944 April 23, 2002 Busey et al.
6377975 April 23, 2002 Florman
6381640 April 30, 2002 Beck et al.
6385191 May 7, 2002 Coffman et al.
6385202 May 7, 2002 Katseff et al.
6385646 May 7, 2002 Brown et al.
6389007 May 14, 2002 Shenkman et al.
6389133 May 14, 2002 Kamen
6393018 May 21, 2002 Miloslavsky
6393122 May 21, 2002 Belzile
6393481 May 21, 2002 Deo et al.
6396834 May 28, 2002 Bonomi et al.
6396919 May 28, 2002 Shimada et al.
6400725 June 4, 2002 Ross
6401094 June 4, 2002 Stemp et al.
6405033 June 11, 2002 Kennedy, III et al.
6407996 June 18, 2002 Witchalls
6407999 June 18, 2002 Olkkonen et al.
6408064 June 18, 2002 Fedorov et al.
6411806 June 25, 2002 Garner et al.
6418146 July 9, 2002 Miloslavsky
6418199 July 9, 2002 Perrone
6424709 July 23, 2002 Doyle et al.
6427002 July 30, 2002 Campbell et al.
6430174 August 6, 2002 Jennings et al.
6430282 August 6, 2002 Bannister et al.
6434231 August 13, 2002 Neyman et al.
6434530 August 13, 2002 Sloane et al.
6434549 August 13, 2002 Linetsky et al.
6442242 August 27, 2002 McAllister et al.
6442247 August 27, 2002 Garcia
6445788 September 3, 2002 Torba
6449260 September 10, 2002 Sassin et al.
6449270 September 10, 2002 Miloslavsky
6449358 September 10, 2002 Anisimov et al.
6449646 September 10, 2002 Sikora et al.
6452609 September 17, 2002 Katinsky et al.
6453038 September 17, 2002 McFarlane et al.
6453341 September 17, 2002 Miloslavsky
6456615 September 24, 2002 Kikinis
6456619 September 24, 2002 Sassin et al.
6459697 October 1, 2002 Neyman
6463148 October 8, 2002 Brady
6470010 October 22, 2002 Szviatovszki et al.
6470080 October 22, 2002 Perlmutter
6473787 October 29, 2002 Miloslavsky
6480600 November 12, 2002 Neyman et al.
6487663 November 26, 2002 Jaisimha et al.
6490350 December 3, 2002 McDuff et al.
6493447 December 10, 2002 Goss et al.
6496567 December 17, 2002 Bjornberg et al.
6496702 December 17, 2002 Lockhart
6496981 December 17, 2002 Wistendahl et al.
6498897 December 24, 2002 Nelson et al.
6499088 December 24, 2002 Wexler et al.
6512825 January 28, 2003 Lindholm et al.
6515996 February 4, 2003 Tonnby et al.
6519617 February 11, 2003 Wanderski et al.
6532493 March 11, 2003 Aviani, Jr. et al.
6535492 March 18, 2003 Shtivelman
6536043 March 18, 2003 Guedalia
6539419 March 25, 2003 Beck et al.
6546405 April 8, 2003 Gupta et al.
6549539 April 15, 2003 Neyman
6553114 April 22, 2003 Fisher et al.
6554183 April 29, 2003 Sticha et al.
6560328 May 6, 2003 Bondarenko et al.
6560329 May 6, 2003 Draginich et al.
6563788 May 13, 2003 Torba et al.
6581105 June 17, 2003 Miloslavsky et al.
6594269 July 15, 2003 Polcyn
6597685 July 22, 2003 Miloslavsky et al.
6600733 July 29, 2003 Deng
6600822 July 29, 2003 Kamen
6603762 August 5, 2003 Kikinis
6611498 August 26, 2003 Baker et al.
6611590 August 26, 2003 Lu et al.
6614780 September 2, 2003 Hakim et al.
6625139 September 23, 2003 Miloslavsky et al.
6628666 September 30, 2003 Pickering et al.
6631399 October 7, 2003 Stanczak et al.
6633910 October 14, 2003 Rajan et al.
6650747 November 18, 2003 Bala et al.
6651085 November 18, 2003 Woods
6668286 December 23, 2003 Noble et al.
6678718 January 13, 2004 Khouri et al.
6681010 January 20, 2004 Anderson et al.
6687241 February 3, 2004 Goss
6693893 February 17, 2004 Ehlinger
6704409 March 9, 2004 Dilip et al.
6704410 March 9, 2004 McFarlane et al.
6704411 March 9, 2004 Nishidate
6707903 March 16, 2004 Burok et al.
6711249 March 23, 2004 Weissman et al.
6711611 March 23, 2004 Hanhan
6714643 March 30, 2004 Gargeya et al.
6718032 April 6, 2004 Vrenjak et al.
6718366 April 6, 2004 Beck et al.
6721306 April 13, 2004 Farris et al.
6731626 May 4, 2004 Neyman
6735298 May 11, 2004 Neyman et al.
6744877 June 1, 2004 Edwards
6744878 June 1, 2004 Komissarchik et al.
6748211 June 8, 2004 Isaac et al.
6751210 June 15, 2004 Shaffer et al.
6753784 June 22, 2004 Sznaider et al.
6754181 June 22, 2004 Elliott et al.
6760322 July 6, 2004 Fukuda et al.
6760324 July 6, 2004 Scott et al.
6760428 July 6, 2004 Foster
6760727 July 6, 2004 Schroeder et al.
6763104 July 13, 2004 Judkins et al.
6763369 July 13, 2004 Ytuarte et al.
6771765 August 3, 2004 Crowther et al.
6778527 August 17, 2004 Amin
6785375 August 31, 2004 Beddus et al.
6785710 August 31, 2004 Kikinis
6785740 August 31, 2004 Yoneda et al.
6788779 September 7, 2004 Ostapchuck
6798771 September 28, 2004 Low et al.
6801520 October 5, 2004 Philonenko
6801928 October 5, 2004 Nuestro
6804346 October 12, 2004 Mewhinney
6816871 November 9, 2004 Lee
6816878 November 9, 2004 Zimmers et al.
6845154 January 18, 2005 Cave et al.
6847715 January 25, 2005 Swartz
6847825 January 25, 2005 Duvall et al.
6850602 February 1, 2005 Chou
6859529 February 22, 2005 Duncan et al.
6865267 March 8, 2005 Dezonno
6868391 March 15, 2005 Hultgren
6874119 March 29, 2005 MacLeod et al.
6876632 April 5, 2005 Takeda
6879586 April 12, 2005 Turovsky et al.
6882996 April 19, 2005 Preisig et al.
6898190 May 24, 2005 Shtivelman et al.
6903685 June 7, 2005 Arndt et al.
6907455 June 14, 2005 Wolfe et al.
6910072 June 21, 2005 MacLeod et al.
6912272 June 28, 2005 Kirk et al.
6922411 July 26, 2005 Taylor
6922689 July 26, 2005 Shtivelman
6934379 August 23, 2005 Falcon et al.
6934381 August 23, 2005 Klein et al.
6944272 September 13, 2005 Thomas
6958994 October 25, 2005 Zhakov et al.
6965914 November 15, 2005 Dowling
6970844 November 29, 2005 Bierenbaum
6977740 December 20, 2005 Mandalia
6981020 December 27, 2005 Miloslavsky et al.
6985478 January 10, 2006 Pogossiants et al.
6985943 January 10, 2006 Deryugin et al.
6987977 January 17, 2006 Lockhart
6996603 February 7, 2006 Srinivasan
7020264 March 28, 2006 Neyman et al.
7031442 April 18, 2006 Neyman et al.
7039176 May 2, 2006 Borodow et al.
7039857 May 2, 2006 Beck et al.
7076048 July 11, 2006 Lee et al.
7079641 July 18, 2006 Ostapchuck
7080092 July 18, 2006 Upton
7088814 August 8, 2006 Shaffer et al.
7092509 August 15, 2006 Mears et al.
7106850 September 12, 2006 Campbell et al.
7110523 September 19, 2006 Gagle et al.
7110525 September 19, 2006 Heller et al.
7117244 October 3, 2006 Florman et al.
7120700 October 10, 2006 MacLeod et al.
7127400 October 24, 2006 Koch
7133830 November 7, 2006 Hoban et al.
7136475 November 14, 2006 Rogers et al.
7155496 December 26, 2006 Froyd et al.
7155512 December 26, 2006 Lean et al.
7159224 January 2, 2007 Sharma et al.
7167924 January 23, 2007 Symonds et al.
7184747 February 27, 2007 Bogat
7216350 May 8, 2007 Martin et al.
7221377 May 22, 2007 Okita et al.
7222301 May 22, 2007 Makagon et al.
7231032 June 12, 2007 Nevman et al.
7236486 June 26, 2007 Baker et al.
7236584 June 26, 2007 Torba
7242760 July 10, 2007 Shires
7246009 July 17, 2007 Hamblen et al.
7254219 August 7, 2007 Hansen et al.
7254641 August 7, 2007 Broughton et al.
7263372 August 28, 2007 Lockhart
7263671 August 28, 2007 Hull et al.
7269263 September 11, 2007 Dedieu et al.
7272627 September 18, 2007 Petrovykh
7277536 October 2, 2007 Ostapchuk
7277916 October 2, 2007 Nuestro
7283519 October 16, 2007 Girard
7336649 February 26, 2008 Huang
7363228 April 22, 2008 Wyss et al.
7372956 May 13, 2008 Kikinis et al.
7373405 May 13, 2008 Deryugin et al.
7373410 May 13, 2008 Monza et al.
7376227 May 20, 2008 Anisimov et al.
7376431 May 20, 2008 Niedermeyer
7401112 July 15, 2008 Matz et al.
7415009 August 19, 2008 Neyman
7418094 August 26, 2008 Golitsin et al.
7428303 September 23, 2008 Campbell et al.
7434204 October 7, 2008 Everingham et al.
7460496 December 2, 2008 Miloslavsky et al.
7496640 February 24, 2009 Hanhan
7535479 May 19, 2009 Okita et al.
7558383 July 7, 2009 Shtivelman et al.
7561887 July 14, 2009 Lockhart
7565428 July 21, 2009 Deryugin et al.
7609829 October 27, 2009 Wang et al.
7610347 October 27, 2009 Petrovykh
7619996 November 17, 2009 Miloslavsky et al.
7669182 February 23, 2010 Garcia
7672998 March 2, 2010 Haskins et al.
7706520 April 27, 2010 Waterson et al.
7715332 May 11, 2010 Miloslavsky et al.
7716292 May 11, 2010 Kikinis
7739325 June 15, 2010 Okita et al.
7764231 July 27, 2010 Karr et al.
7769161 August 3, 2010 Hession et al.
7779067 August 17, 2010 Beck et al.
7792773 September 7, 2010 McCord et al.
7808977 October 5, 2010 Kikinis
7823167 October 26, 2010 Makagon et al.
7853717 December 14, 2010 Petrovykh
7856095 December 21, 2010 Brown
7903807 March 8, 2011 Neyman et al.
7907598 March 15, 2011 Anisimov et al.
7929978 April 19, 2011 Lockhart
8009821 August 30, 2011 Apparao et al.
8018921 September 13, 2011 Pogossiants et al.
8031698 October 4, 2011 Neyman
8059812 November 15, 2011 Bundy
8068598 November 29, 2011 Russi et al.
8126133 February 28, 2012 Everingham et al.
8130749 March 6, 2012 Kikinis
8180662 May 15, 2012 Minert et al.
8180666 May 15, 2012 Minert et al.
8199891 June 12, 2012 Brown et al.
8209207 June 26, 2012 Minert et al.
8209209 June 26, 2012 Minert et al.
8223948 July 17, 2012 Minert et al.
8226477 July 24, 2012 Machado et al.
8254558 August 28, 2012 Minert et al.
8275111 September 25, 2012 Golitsin et al.
8345856 January 1, 2013 Anisimov et al.
8351595 January 8, 2013 Peterson et al.
8358769 January 22, 2013 Neyman et al.
8395994 March 12, 2013 Stevenson et al.
8396205 March 12, 2013 Lowry et al.
8411844 April 2, 2013 Anisimov et al.
20010000458 April 26, 2001 Shtivelman et al.
20010001150 May 10, 2001 Miloslavsky
20010011366 August 2, 2001 Beck et al.
20010013041 August 9, 2001 MacLeod et al.
20010014604 August 16, 2001 Kingdon et al.
20010023430 September 20, 2001 Srinivasan
20010023448 September 20, 2001 Hanhan
20010024497 September 27, 2001 Campbell et al.
20010025309 September 27, 2001 MacLeod et al.
20010028649 October 11, 2001 Pogossiants et al.
20010029519 October 11, 2001 Hallinan et al.
20010037316 November 1, 2001 Shiloh
20010038624 November 8, 2001 Greenberg et al.
20010040887 November 15, 2001 Shtivelman et al.
20010042095 November 15, 2001 Kim et al.
20010043586 November 22, 2001 Miloslavsky
20010043589 November 22, 2001 Kikinis
20010044676 November 22, 2001 MacLeod et al.
20010044828 November 22, 2001 Kikinis
20010054064 December 20, 2001 Kannan
20020001300 January 3, 2002 Miloslavsky et al.
20020012428 January 31, 2002 Neyman et al.
20020013150 January 31, 2002 McKenna et al.
20020019844 February 14, 2002 Kurowski et al.
20020019846 February 14, 2002 Miloslavsky et al.
20020025819 February 28, 2002 Cetusic et al.
20020035647 March 21, 2002 Brown et al.
20020037076 March 28, 2002 Perlmutter
20020041674 April 11, 2002 Kamen
20020054579 May 9, 2002 Miloslavsky
20020055853 May 9, 2002 MacLeod et al.
20020056000 May 9, 2002 Coussement
20020057671 May 16, 2002 Kikinis
20020059164 May 16, 2002 Shtivelman
20020059374 May 16, 2002 Nuestro
20020060988 May 23, 2002 Shtivelman
20020062385 May 23, 2002 Dowling
20020064149 May 30, 2002 Elliott et al.
20020076031 June 20, 2002 Falcon et al.
20020078150 June 20, 2002 Thompson et al.
20020087648 July 4, 2002 Petrovykh
20020091726 July 11, 2002 MacLeod et al.
20020095462 July 18, 2002 Beck et al.
20020097708 July 25, 2002 Deng
20020099738 July 25, 2002 Grant
20020101866 August 1, 2002 Miloslavsky et al.
20020101880 August 1, 2002 Kim
20020103998 August 1, 2002 DeBruine
20020105957 August 8, 2002 Bondarenko et al.
20020114278 August 22, 2002 Coussement
20020114441 August 22, 2002 Coussement
20020120719 August 29, 2002 Lee et al.
20020123899 September 5, 2002 Hall et al.
20020126828 September 12, 2002 Kamen
20020131399 September 19, 2002 Philonenko
20020136167 September 26, 2002 Steele et al.
20020150311 October 17, 2002 Lynn
20020169834 November 14, 2002 Miloslavsky et al.
20030002479 January 2, 2003 Vortman et al.
20030002652 January 2, 2003 Neyman et al.
20030002654 January 2, 2003 Torba
20030007621 January 9, 2003 Graves et al.
20030009530 January 9, 2003 Philonenko et al.
20030018702 January 23, 2003 Broughton et al.
20030018729 January 23, 2003 Miloslavsky
20030021259 January 30, 2003 Miloslavsky et al.
20030021406 January 30, 2003 Ostapchuck
20030026414 February 6, 2003 Baker et al.
20030037113 February 20, 2003 Petrovykh
20030043832 March 6, 2003 Anisimov et al.
20030051037 March 13, 2003 Sundaram et al.
20030055884 March 20, 2003 Yuen et al.
20030058884 March 27, 2003 Kallner et al.
20030084128 May 1, 2003 Anderson et al.
20030084349 May 1, 2003 Friedrichs et al.
20030088421 May 8, 2003 Maes et al.
20030097457 May 22, 2003 Saran et al.
20030099343 May 29, 2003 Dezonno
20030115353 June 19, 2003 Deryugin et al.
20030125048 July 3, 2003 Lockhart
20030135592 July 17, 2003 Vetter et al.
20030161448 August 28, 2003 Parolkar et al.
20030179729 September 25, 2003 MacLeod et al.
20030212558 November 13, 2003 Matula
20030216923 November 20, 2003 Gilmore et al.
20030220875 November 27, 2003 Lam et al.
20030229529 December 11, 2003 Mui et al.
20040017797 January 29, 2004 Chen et al.
20040019638 January 29, 2004 Makagon et al.
20040030557 February 12, 2004 Culy et al.
20040047302 March 11, 2004 Dezonno et al.
20040064348 April 1, 2004 Humenansky et al.
20040081183 April 29, 2004 Monza et al.
20040083195 April 29, 2004 McCord et al.
20040083281 April 29, 2004 Makagon et al.
20040083479 April 29, 2004 Bondarenko et al.
20040083482 April 29, 2004 Makagon et al.
20040102977 May 27, 2004 Metzler et al.
20040107025 June 3, 2004 Ransom et al.
20040111269 June 10, 2004 Koch
20040120502 June 24, 2004 Strathmeyer et al.
20040169675 September 2, 2004 Beck et al.
20040179516 September 16, 2004 Neyman
20040181574 September 16, 2004 Hanhan
20040199580 October 7, 2004 Zhakov et al.
20040208134 October 21, 2004 Neyman et al.
20040208309 October 21, 2004 Miloslavsky
20040213400 October 28, 2004 Golitsin et al.
20040264678 December 30, 2004 Ostapchuck
20040267892 December 30, 2004 Kikinis
20050013417 January 20, 2005 Zimmers et al.
20050033851 February 10, 2005 Kikinis
20050041678 February 24, 2005 Nuestro
20050128961 June 16, 2005 Miloslavsky et al.
20050147090 July 7, 2005 MacLeod et al.
20050154792 July 14, 2005 Deryugin et al.
20050207559 September 22, 2005 Shtivelman et al.
20060029206 February 9, 2006 Anisimov et al.
20060034262 February 16, 2006 Pogossiants et al.
20060079250 April 13, 2006 Lockhart
20060080107 April 13, 2006 Hill et al.
20060095568 May 4, 2006 Makagon et al.
20060109976 May 25, 2006 Sundaram et al.
20060133594 June 22, 2006 Neyman et al.
20060153173 July 13, 2006 Beck et al.
20060209797 September 21, 2006 Anisimov et al.
20060210047 September 21, 2006 Neyman et al.
20060245421 November 2, 2006 Ostapchuk
20070002744 January 4, 2007 Mewhinney et al.
20070041525 February 22, 2007 Tingley et al.
20070041567 February 22, 2007 Anisimov et al.
20070071224 March 29, 2007 Shtivelman et al.
20070143301 June 21, 2007 Tran
20070195940 August 23, 2007 Miloslavsky et al.
20070213073 September 13, 2007 Lockhart
20070274495 November 29, 2007 Youd et al.
20080002822 January 3, 2008 Petrovykh
20080013531 January 17, 2008 Elliott et al.
20080043728 February 21, 2008 Miloslavsky et al.
20080043955 February 21, 2008 Shtivelman et al.
20080043975 February 21, 2008 Miloslavsky et al.
20080043977 February 21, 2008 Neyman et al.
20080046504 February 21, 2008 Deryugin et al.
20080046531 February 21, 2008 Shtivelman et al.
20080049731 February 28, 2008 Kikinis
20080049737 February 28, 2008 Neyman
20080049928 February 28, 2008 Miloslavsky et al.
20080049929 February 28, 2008 Miloslavsky et al.
20080062971 March 13, 2008 Kikinis
20080130844 June 5, 2008 Hubbard et al.
20080205378 August 28, 2008 Wyss et al.
20080222240 September 11, 2008 Deryugin et al.
20080285739 November 20, 2008 Golitsin et al.
20090089136 April 2, 2009 Minert et al.
20090089451 April 2, 2009 Petrovykh
20090227267 September 10, 2009 Lockhart
20090240346 September 24, 2009 Cadigan, Jr. et al.
20100157979 June 24, 2010 Anisimov et al.
20100198930 August 5, 2010 Kikinis
20110099602 April 28, 2011 Apparao et al.
20110178946 July 21, 2011 Minert et al.
20110179304 July 21, 2011 Peterson
20110179398 July 21, 2011 Peterson
20110182418 July 28, 2011 Anisimov et al.
20120047266 February 23, 2012 Minert
20120066016 March 15, 2012 Minert et al.
20120195415 August 2, 2012 Wyss et al.
20130016115 January 17, 2013 Minert et al.
20130129067 May 23, 2013 Neyman et al.
20130230160 September 5, 2013 Neyman et al.
Foreign Patent Documents
270486 July 2004 AT
281039 November 2004 AT
316736 February 2006 AT
317621 February 2006 AT
318048 March 2006 AT
337678 September 2006 AT
379921 December 2007 AT
380434 December 2007 AT
384398 February 2008 AT
388578 March 2008 AT
401736 August 2008 AT
413059 November 2008 AT
424090 March 2009 AT
465451 May 2010 AT
474415 July 2010 AT
2604797 October 1997 AU
718233 March 1998 AU
5274398 March 1998 AU
6023598 August 1998 AU
6034698 August 1998 AU
6167398 August 1998 AU
6319498 August 1998 AU
6655298 September 1998 AU
6655398 September 1998 AU
7099298 October 1998 AU
735134 March 1999 AU
736449 April 1999 AU
737483 April 1999 AU
743217 April 1999 AU
745404 April 1999 AU
748636 April 1999 AU
9225198 April 1999 AU
9228098 April 1999 AU
9381998 April 1999 AU
9479298 April 1999 AU
743880 May 1999 AU
1118899 May 1999 AU
740090 June 1999 AU
743737 June 1999 AU
744340 June 1999 AU
1120099 June 1999 AU
1276799 June 1999 AU
1286299 June 1999 AU
741437 August 1999 AU
758713 August 1999 AU
2595499 August 1999 AU
2595599 August 1999 AU
2667299 August 1999 AU
2674899 August 1999 AU
739979 September 1999 AU
2674799 September 1999 AU
749023 December 1999 AU
4427299 December 1999 AU
4819499 December 1999 AU
746085 January 2000 AU
4426799 January 2000 AU
750215 April 2000 AU
754238 April 2000 AU
755234 April 2000 AU
5807099 April 2000 AU
5810599 April 2000 AU
5813699 April 2000 AU
748456 May 2000 AU
751143 May 2000 AU
751232 May 2000 AU
751269 May 2000 AU
751301 May 2000 AU
755138 May 2000 AU
1233800 May 2000 AU
1327200 May 2000 AU
1328200 May 2000 AU
1328300 May 2000 AU
1454700 May 2000 AU
1717700 May 2000 AU
1718600 May 2000 AU
2045900 June 2000 AU
748447 July 2000 AU
3113800 July 2000 AU
2964900 September 2000 AU
3470800 September 2000 AU
4507700 February 2001 AU
6798300 April 2001 AU
1077201 June 2001 AU
1077301 June 2001 AU
8006800 June 2001 AU
4732501 October 2001 AU
5384201 October 2001 AU
5724801 November 2001 AU
756656 January 2003 AU
2003300117 August 2004 AU
9913621 May 2001 BR
9913622 May 2001 BR
2178705 March 1997 CA
2391428 March 1997 CA
2259912 January 1998 CA
2280002 August 1998 CA
2289193 December 1998 CA
2289198 December 1998 CA
2302397 March 1999 CA
2302488 March 1999 CA
2302674 March 1999 CA
2302680 March 1999 CA
2302704 March 1999 CA
2302678 April 1999 CA
2308590 May 1999 CA
2309185 May 1999 CA
2309186 May 1999 CA
2309183 June 1999 CA
2320978 August 1999 CA
2320979 August 1999 CA
2320989 August 1999 CA
2330608 December 1999 CA
2334513 December 1999 CA
2343286 March 2000 CA
2343288 March 2000 CA
2343756 March 2000 CA
2347721 May 2000 CA
2348567 May 2000 CA
2348574 May 2000 CA
2348575 May 2000 CA
2348994 May 2000 CA
2348999 May 2000 CA
2350515 May 2000 CA
2352973 June 2000 CA
2362172 August 2000 CA
2313596 February 2001 CA
1282484 January 2001 CN
1282485 January 2001 CN
1285990 February 2001 CN
1285991 February 2001 CN
1293798 May 2001 CN
1293858 May 2001 CN
1298590 June 2001 CN
1309861 August 2001 CN
1310822 August 2001 CN
1323418 November 2001 CN
1323421 November 2001 CN
1354942 June 2002 CN
1130061 December 2003 CN
1132399 December 2003 CN
1145314 April 2004 CN
1149521 May 2004 CN
1152549 June 2004 CN
1512724 July 2004 CN
1520197 August 2004 CN
1197336 April 2005 CN
1200548 May 2005 CN
1662025 August 2005 CN
1232077 December 2005 CN
1756280 April 2006 CN
100477702 April 2009 CN
100547568 October 2009 CN
102257789 November 2011 CN
101635775 December 2011 CN
60011863 December 2004 DE
69730498 September 2005 DE
60015236 February 2006 DE
69832275 August 2006 DE
69833285 September 2006 DE
69833394 October 2006 DE
69833462 October 2006 DE
69833935 November 2006 DE
60214191 December 2006 DE
69834184 March 2007 DE
69838795 October 2008 DE
69838814 November 2008 DE
69839022 January 2009 DE
69839222 March 2009 DE
0193961 September 1986 EP
0236013 September 1987 EP
0376517 July 1990 EP
0420779 April 1991 EP
0424015 April 1991 EP
0425161 May 1991 EP
0425163 May 1991 EP
0515068 November 1992 EP
0528732 February 1993 EP
0532972 March 1993 EP
0539105 April 1993 EP
0559979 September 1993 EP
0568770 November 1993 EP
0610625 August 1994 EP
0647050 April 1995 EP
0647051 April 1995 EP
0660573 June 1995 EP
0701358 March 1996 EP
0705017 April 1996 EP
0721268 July 1996 EP
0725526 August 1996 EP
0734187 September 1996 EP
0740450 October 1996 EP
0748102 December 1996 EP
0753956 January 1997 EP
0755146 January 1997 EP
0758175 February 1997 EP
0771095 May 1997 EP
0792076 August 1997 EP
0806858 November 1997 EP
0817455 January 1998 EP
0856980 August 1998 EP
0863651 September 1998 EP
0866407 September 1998 EP
0869639 October 1998 EP
0883306 December 1998 EP
0908047 April 1999 EP
0958560 November 1999 EP
0962087 December 1999 EP
1006706 June 2000 EP
1013062 June 2000 EP
1013066 June 2000 EP
1016280 July 2000 EP
1044553 October 2000 EP
1064630 January 2001 EP
1066712 January 2001 EP
1075153 February 2001 EP
1087597 March 2001 EP
1088277 April 2001 EP
1092313 April 2001 EP
1107555 June 2001 EP
1114543 July 2001 EP
1125214 August 2001 EP
1133677 September 2001 EP
1133736 September 2001 EP
1133742 September 2001 EP
1145153 October 2001 EP
1145154 October 2001 EP
1408678 November 2001 EP
1163564 December 2001 EP
1193961 April 2002 EP
1227635 July 2002 EP
1248447 October 2002 EP
1290861 March 2003 EP
1292901 March 2003 EP
1292939 March 2003 EP
1328121 July 2003 EP
0873642 April 2004 EP
1413954 April 2004 EP
1107615 June 2004 EP
1033024 September 2004 EP
1129545 September 2004 EP
1061723 October 2004 EP
1465397 October 2004 EP
1469663 October 2004 EP
1484903 December 2004 EP
1566949 August 2005 EP
0985308 November 2005 EP
1359735 January 2006 EP
1357729 February 2006 EP
1377001 February 2006 EP
0954922 March 2006 EP
0986875 April 2006 EP
1410614 August 2006 EP
1774760 April 2007 EP
1021905 November 2007 EP
1031232 December 2007 EP
1865697 December 2007 EP
1040638 January 2008 EP
1048162 March 2008 EP
1157509 July 2008 EP
1337079 September 2008 EP
1326415 October 2008 EP
1013054 February 2009 EP
1333653 April 2009 EP
0983676 June 2009 EP
1125208 April 2010 EP
1142284 July 2010 EP
2380323 October 2011 EP
1057301 August 2013 EP
1131728 January 2014 EP
1625460 May 2014 EP
2231120 May 2005 ES
2255657 July 2006 ES
2256666 July 2006 ES
2257639 August 2006 ES
2671252 July 1992 FR
2273225 June 1994 GB
2306853 May 1997 GB
2315190 January 1998 GB
2324627 October 1998 GB
2369263 May 2002 GB
62-200956 September 1987 JP
63-149955 June 1988 JP
64-7460 January 1989 JP
64-77265 March 1989 JP
02-298154 December 1990 JP
03-052443 March 1991 JP
03-160865 July 1991 JP
03-177144 August 1991 JP
04-40723 February 1992 JP
4-66858 June 1992 JP
04-265049 September 1992 JP
4-336742 November 1992 JP
04-371056 December 1992 JP
06-044157 February 1994 JP
06-046150 February 1994 JP
06-066830 March 1994 JP
06-069988 March 1994 JP
06-103058 April 1994 JP
06-121051 April 1994 JP
06-261129 September 1994 JP
06-291877 October 1994 JP
06-334748 December 1994 JP
07-046321 February 1995 JP
07-058851 March 1995 JP
07-115471 May 1995 JP
07-170288 July 1995 JP
07-170546 July 1995 JP
07-262104 October 1995 JP
07-319538 December 1995 JP
07-336447 December 1995 JP
08-46699 February 1996 JP
08-056377 February 1996 JP
08-163252 June 1996 JP
08-181793 July 1996 JP
08-214076 August 1996 JP
08-214346 August 1996 JP
8-321885 December 1996 JP
8-329118 December 1996 JP
09-036963 February 1997 JP
09-504394 April 1997 JP
09-149137 June 1997 JP
09-163031 June 1997 JP
09-224093 August 1997 JP
09-265408 October 1997 JP
10-11374 January 1998 JP
10-13811 January 1998 JP
10-093713 April 1998 JP
10-093716 April 1998 JP
10-116249 May 1998 JP
10-143451 May 1998 JP
10-214113 August 1998 JP
10-224477 August 1998 JP
10-509847 September 1998 JP
10-304073 November 1998 JP
10-304074 November 1998 JP
10-327258 December 1998 JP
10-513632 December 1998 JP
11-055741 February 1999 JP
11-506292 June 1999 JP
11-183189 July 1999 JP
11-508430 July 1999 JP
11-508715 July 1999 JP
11-317817 November 1999 JP
11-346266 December 1999 JP
2000-011005 January 2000 JP
2000-49847 February 2000 JP
2000-151819 May 2000 JP
2000-514985 November 2000 JP
2000-514986 November 2000 JP
2000-516432 December 2000 JP
2000-517142 December 2000 JP
2001-500677 January 2001 JP
2001-103533 April 2001 JP
2001-292236 October 2001 JP
2001-517027 October 2001 JP
2001-517029 October 2001 JP
2001-517038 October 2001 JP
2001-518754 October 2001 JP
2001-522201 November 2001 JP
2001-523930 November 2001 JP
3226929 November 2001 JP
2001-524782 December 2001 JP
2001-526871 December 2001 JP
2002-503903 February 2002 JP
2002-503921 February 2002 JP
2002-504783 February 2002 JP
2002-518890 June 2002 JP
2002-519762 July 2002 JP
2002-525895 August 2002 JP
2002-528824 September 2002 JP
2002-529836 September 2002 JP
2002-529943 September 2002 JP
2002-529944 September 2002 JP
2002-529945 September 2002 JP
2002-529994 September 2002 JP
2002-530010 September 2002 JP
2002-534003 October 2002 JP
2002-537594 November 2002 JP
2003-502720 January 2003 JP
2003-507908 February 2003 JP
2003-510929 March 2003 JP
3384792 March 2003 JP
3393119 April 2003 JP
2003-516672 May 2003 JP
3453561 October 2003 JP
3461488 October 2003 JP
3516656 April 2004 JP
3516659 April 2004 JP
3547142 July 2004 JP
3547397 July 2004 JP
2004-312730 November 2004 JP
2005-504452 February 2005 JP
3615708 February 2005 JP
3628962 March 2005 JP
2005-094780 April 2005 JP
2005-102234 April 2005 JP
2005-124184 May 2005 JP
3681403 August 2005 JP
3681406 August 2005 JP
3686087 August 2005 JP
3686337 August 2005 JP
3735124 January 2006 JP
3820151 September 2006 JP
2006-295947 October 2006 JP
3877523 February 2007 JP
4057785 March 2008 JP
4205310 January 2009 JP
4234926 March 2009 JP
4295186 July 2009 JP
4450515 April 2010 JP
8-331618 September 2011 JP
2012-513725 June 2012 JP
10-2011-0098841 September 2011 KR
WO9208194 May 1992 WO
9401959 January 1994 WO
WO9429995 December 1994 WO
WO9508236 March 1995 WO
9520860 August 1995 WO
9533325 December 1995 WO
9614704 May 1996 WO
9620553 July 1996 WO
WO9623265 August 1996 WO
9627254 September 1996 WO
9701917 January 1997 WO
9713352 April 1997 WO
WO9712472 April 1997 WO
9718662 May 1997 WO
WO9716014 May 1997 WO
9722201 June 1997 WO
WO9720424 June 1997 WO
WO9723078 June 1997 WO
9726749 July 1997 WO
9729584 August 1997 WO
WO9728635 August 1997 WO
WO9734401 September 1997 WO
9738389 October 1997 WO
WO9736414 October 1997 WO
WO9737500 October 1997 WO
WO9738519 October 1997 WO
WO9750235 December 1997 WO
WO9801987 January 1998 WO
9810573 March 1998 WO
WO9813765 April 1998 WO
WO9813974 April 1998 WO
WO9817048 April 1998 WO
9827479 June 1998 WO
WO9831130 July 1998 WO
9836551 August 1998 WO
9837481 August 1998 WO
WO9834390 August 1998 WO
WO9835326 August 1998 WO
WO9835509 August 1998 WO
WO9837677 August 1998 WO
WO9837686 August 1998 WO
WO9837687 August 1998 WO
9844714 October 1998 WO
WO9844699 October 1998 WO
WO9848577 October 1998 WO
9856133 December 1998 WO
WO9854877 December 1998 WO
WO9856141 December 1998 WO
WO9857501 December 1998 WO
9900960 January 1999 WO
WO9900966 January 1999 WO
WO9903247 January 1999 WO
9914951 March 1999 WO
WO9912367 March 1999 WO
WO9913635 March 1999 WO
WO9914919 March 1999 WO
WO9914920 March 1999 WO
WO9914924 March 1999 WO
WO9917518 April 1999 WO
WO9923806 May 1999 WO
WO9923807 May 1999 WO
WO9926395 May 1999 WO
WO9926424 May 1999 WO
WO9927698 June 1999 WO
WO9941720 August 1999 WO
WO9941890 August 1999 WO
WO9941891 August 1999 WO
WO9941895 August 1999 WO
WO9943137 August 1999 WO
WO9925117 October 1999 WO
WO9956227 November 1999 WO
WO9956229 November 1999 WO
WO9965214 December 1999 WO
WO9965252 December 1999 WO
WO9967718 December 1999 WO
WO0007332 February 2000 WO
0018094 March 2000 WO
WO0016203 March 2000 WO
WO0016207 March 2000 WO
WO0016523 March 2000 WO
WO0025238 May 2000 WO
WO0026804 May 2000 WO
WO0026816 May 2000 WO
WO0026817 May 2000 WO
WO0027063 May 2000 WO
WO0028425 May 2000 WO
WO0028702 May 2000 WO
WO0035173 June 2000 WO
WO0038398 June 2000 WO
0044159 July 2000 WO
WO0049482 August 2000 WO
WO0049778 August 2000 WO
WO0113606 February 2001 WO
WO0124025 April 2001 WO
WO0140997 June 2001 WO
WO0141372 June 2001 WO
WO0143410 June 2001 WO
WO0152513 July 2001 WO
WO0180214 October 2001 WO
WO0180540 October 2001 WO
WO0184360 November 2001 WO
WO02065741 August 2002 WO
WO03010948 February 2003 WO
WO20044063854 July 2004 WO
WO2005036907 April 2005 WO
WO2006055059 May 2006 WO
WO175151 July 2010 WO
Other references
  • Mattison, Rob, “Data Warehousing and Data Mining for Telecommunications,” Artech House, Boston, 1997, 7 pages.
  • Metz, Christopher, “IP Routers: New Tool for Gigabit Networking,” On the Wire, IEEE Internet, Nov./Dec. 1998, 5 pages.
  • Microsoft Dictionary Pages, Microsoft Press, Redmond, WA, 1991, 2 pages.
  • Monson-Haefel, Richard, “Enterprise JavaBeans,” O'Reilly & Assoc., 2nd Ed., 1999, 7 pages.
  • Murayama, Hideki, “Integrated Customer Supporting System View Workshop/CS, OA Business Personal Computer,” NEC Business System, Denpa Press Co., Ltd., vol. 15, No. 12, Dec. 1997, 6 pages.
  • Nariani, Sushil, “Internet Telephony,” Whatis.com, Oct. 25, 1999, 2 pages.
  • Newton'S Telecom Dictionary, The Official Dictionary of Telcommunications & the Internet, 16th Edition, Telecom Books, Feb. 2000, 3 pages.
  • Newton, Harry, “Newton's Telecom Dictionary,” Flatiron Publishing, New York, 1994, 7 pages.
  • Orozco-Barbosa, Luis et al., “Design and Performance Evaluation of Intelligent Multimedia Services,” Computer Communications, vol. 20, 1997, 14 pages.
  • Rangan, P. Venkat, et al., “A Window-Based Editor for Digital Video and Audio,” Proceedings of the 25th Hawaii International Conference on System Sciences, IEEE, vol. 2, Jan. 1992, 9 pages.
  • Recker, Mimi M. et al., “Predicting Document Access in Large, Multimedia Repositories,” ACM Transactions on Computer-Human Interaction, vol. 3, 1994, 23 pages.
  • Rodriguez-Martinez, Manuel et al., “MOCHA: A Self-Extensible Database Middleware System for Distributed Data Sources,” International Conference on Management Data—SIGMOD, 2000, 12 pages.
  • Rosenberg, Arthur M., “Call Center Computer Telephony: Technology Overview,” Gartner, Inc., Jan. 1998 (24 pages).
  • Schmandt, Chris, “Phoneshell: The Telephone as Computer Terminal,” Proceedings of ACM Multimedia Conference, 1993, 10 pages.
  • Sekine, Shoji et al., “Front Office Oriented Solution for Customer Satisfaction and Profit Expansion,” Hitachi Hyoron Co, Ltd., Japan, vol. 80, No. 9, Sep. 1998, 11 pages.
  • Semilof, Margie, “Call Centers Go On-Line,” Communications Week, No Date Available, 2 pages.
  • Sevcik, Peter et al., “The Call Center Revolution,” Northeast Consulting Technical Paper, Jan. 1, 1997, 12 pages.
  • Smith, J.D., An Overview to Computer-Telecommunications Integration (CTI), Telecommunications, Conference Publication No. 404, IEEE, Mar. 26-29, 1995, 5 pages.
  • Sulkin, Allan, Building the ACD-LAN Connection, Business Communications Review, Jun. 1996, 4 pages.
  • Supplemental European Search Report for Application No. 98908545.1, dated Sep. 5, 2002, 4 pages.
  • Szlam, Aleksander et al., “Predictive Dialing Fundamentals,” Flatiron Publishing, New York, 1996, 28 pages.
  • Tadamura, Katsumi et al., “Synchronizing Computer Graphics Animation and Audio,” IEEE, 1998, 11 pages.
  • Taisei, Mori et al., “Call Center: Promotion of Information Use with a Direct Link to Core Business with Eye on the Internet Customer,” Ric Telecom Corporation, Japan, vol. 10, No. 8, Aug. 1, 1998, 9 pages.
  • Tang, Jingrong et al., “Advanced Service Architecture for H.323 Internet Protocol Telephony,” Computer Communications, vol. 23, 2000, 14 pages.
  • Thio, Fu Wang et al., “Distributed Multimedia Database: a Design and Application Study,” The Fourth International Conference on High Performance Computing in the Asia-Pacific Region, IEEE, Beijing, China, vol. 2, May 2000, 6 pages.
  • Toji, Ryutaro et al., “A Study of Customer Contact Operation System and Functions,” Proceedings of the IECE General Conference, Comm. 2, Mar. 6, 1997, 3 pages.
  • Toji, Ryutaro et al., “OCN Multimedia Customer Contact System,” NTT Technical Journal, the Telecommunication Association, Japan, vol. 10, No. 1, Jan. 1, 1998, 6 pages.
  • Tsunemasa, Mizuo., “CTI World 2: World of CTI,” Business Communication, vol. 34, No. 2, Feb. 1, 1997, 13 pages.
  • Van Zijl, Lynette, et al., “A Tool for Graphical Network Modeling and Analysis,” IEEE Software, Jan. 1992, 8 pages.
  • Vazquez, E., et al., Graphical Interface for Communication Network Analysis and Simulation, Department of Telematic Engineering, Technical University of Madrid, IEE, 1991, Spain, 4 pages.
  • Wagner, Susanne., “Intralingual Speech-to-Text Conversion in Real-Time: Challenges and Opportunities,” Challenges of Multidimensional Translation Conference Proceedings, 2005, 10 pages.
  • Wang, Yong et al., “Real-time scheduling for multi-agent call center automation”, Information service agents lab, school of computing science Simon Fraser University, Burnaby, BC Canada, 1999, 13 pages.
  • Wolter, Roger., “XML Web Services Basics,” Microsoft Corporation, Dec. 2001, 4 pages.
  • Zenel, Bruce et al., Intelligent Communication Filtering for Limited Bandwidth Environments, Computer Science Department, Columnia University, IEEE, 1995, 7 pages.
  • “Competitive Gateway Product,” Nikkei Communications, Japan, No. 257, Nov. 1997, 18 pages.
  • “Guide for the Use of Micro-Researcher II/SGR (Scroll Graph Section),” NEC Corporation, Third Edition, Chapters 1 & 5, Jul. 1995, 2 pages.
  • “Kana: Customer Messaging System,” Kana Communications Sales Brochure, Palo Alto, CA, 1996, 12 pages.
  • “Latest Trend in CTI,” Nikkei Communications, No. 248, Jun. 16, 1997, 14 pages.
  • “Method for Automatic Contextual Transposition Upon Receipt of Item of Specified Criteria,” IBM Technical Disclosure Bulletin, vol. 37, No. 2B, Feb. 1994, 1 page.
  • “New Telephone Service Changing Computer Telephone Business,” Nikkei Communications, Nov. 11, 1996, 7 pages.
  • “Single Line Suffices for Internet Telephone,” Nikkei Communications, May 19, 1997, 9 pages.
  • “Solution Drivers/CTI, CTI Solution Strategy of Seven Computer Vendors, Toward Market Development of Mainly Bank, Insurance and Communications Markets,” Computopia, Computer Age Co., Ltd., Japan, vol. 33, No. 379, 5 pages, Apr. 1998.
  • Bachmann, David W. et al., “NetMod: A Design Tool for Large-Scale Heterogeneous Campus Networks,” Center for Information Technology Integration (CITI), The University of Michigan, Ann Arbor, MI, Jun. 15, 1990, 34 pages.
  • Bangun, H. et al., A Network Architecture for Multiuser Networked Games on Demand, International Conference on Information Communications and Signal Processing, ICICS '97, Sep. 9-12, 1997, 5 pages.
  • Bernett, Howard et al., “Assessing Web-Enabled Call Center Technologies,” IT Pro, May/Jun. 2001, 7 pages.
  • Bertsekas, Dimitri et al., “Data Networks,” Prentice-Hall, New Jersey, 1987, 5 pages.
  • Bickley, M. et al., Using Servers to Enhance Control System Capability, 1999 Particle Accelerator Conference, New York, NY, Mar. 29-Apr. 2, 1999, 3 pages.
  • Bradley, Kirk A. et al., “Detecting Disruptive Routers: a Distributed Network Monitoring Approach,” Department of Computer Science, University of California, Davis, Sep. 1, 1998, 10 pages.
  • Canadian Office Action for Application No. 2,259,912, dated Nov. 19, 2011, 2 pages.
  • Canadian Office Action for Application No. 2,289,198, dated Jun. 28, 2002, 2 pages.
  • Canadian Office Action for Application No. 2,302,397, dated Apr. 23, 2002, 2 pages.
  • Canadian Office Action for Application No. 2,302,678, dated Apr. 23, 2002, 2 pages.
  • Canadian Office Action for Application No. 2308590, dated Jun. 28, 2002, 2 pages.
  • Canadian Office Action for Application No. 2309183, dated Jul. 23, 2002, 2 pages.
  • Canadian Office Action for Application No. 2320978, dated Jun. 2, 2003, 2 pages.
  • Canadian Office Action for Application No. 2320978, dated Sep. 26, 2002, 2 pages.
  • Canadian Office Action for Application No. 2334513, dated May 30, 2003, 2 pages.
  • Canadian Office Action for Application No. 2347721, dated Aug. 12, 2004, 3 pages.
  • Canadian Office Action for Application No. 2352973, dated Apr. 17, 2003, 3 pages.
  • Chan, Kevin F. et al., “Interactive Network Planning and Analysis on a Personal Computer,” Computer Applications in Power, IEEE, vol. 3, No. 1, Jan. 1990, 5 pages.
  • Chau, Sam et al., “Intelligent Network Routing Using CCS7 and ISDN,” Global Telecommunications Conference, vol. 3, 6 pages, 1990.
  • Chaudhuri, Surajit et al., “Optimizing Queries over Multimedia Repositories,” Hewlett-Packard Laboratories, Stanford, Mar. 1996, 12 pages.
  • Chaum, David, “Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms,” Communications of the ACM, vol. 24, No. 2, Feb. 1981, 8 pages.
  • Chew, T.-S. et al., “NETPLAN-a Telecommunications Network Planning Support System,” TENCON '92, IEEE Region 10 International Conference, vol. 2, 7 pages, 1992.
  • Chinese Office Action for Application No. 200980151937.6, dated Jul. 1, 2013, 14 pages.
  • Chinese Office Action for Application No. 98812258.8 dated Jul. 26, 2002, 5 pages.
  • Chinese Office Action for Application No. 98812259.6, dated Jan. 10, 2003, 9 pages.
  • Chinese Office Action for Application No. 98812261.8, dated Jun. 20, 2003, 10 pages.
  • Chinese Office Action for Application No. 99808531.6, dated Mar. 14, 2003, 14 pages.
  • Chinese Office Action for Application No. 99811995.4, dated Apr. 8, 2005, 6 pages.
  • Chinese Office Action for Application No. 99811995.4, dated Jul. 6, 2007, 11 pages.
  • Chinese Office Action for Application No. 99811996.2, dated May 9, 2003, 10 pages.
  • Chiu, H. et al., “Conferencing Metaphor,” IBM Technical Disclosure Bulletin, vol. 36, No. 2, Feb. 1993, 4 pages.
  • Chou, Sheng-Lin., et al., “Computer Telephony Integration and Its Applications,” IEEE Communications Surveys & Tutorials, vol. 3, No. 1, 2000, 10 pages.
  • Cordom, Christopher et al., “CONVERSANT VIS Listens and Talks to Your Customers,” AT&T Technology, vol. 9, No. 2, 4 pages, 1994.
  • Curbera, Francisco et al., “Unraveling the Web Services Web: An Introduction to SOAP, WSDL, and UDDI,” IEEE Internet Computing, 8 pages, Mar./Apr. 2002.
  • D'Hooge, Herman, “The Communicating PC,” IEEE Communications Magazine, 6 pages, Apr. 1996.
  • Durinovic-Johri, Sanja et al., “Advanced Routing Solutions for Toll-Free Customers: Algorithm Design and Performance,” Proceedings of the International Teletraffic Congress, ITC-15, 1997, 12 pages.
  • Eren, P. Erhan, et al., “Interactive Object-Based Analysis and Manipulation of Digital Video,” IEEE Workshop on Multimedia Signal Processing, 1998, 6 pages.
  • Esesve, D.R., “Wireless Application Protocol (WAP),” Vitam College of Engineering, No Date Available, 12 pages.
  • European Office action Application No. 03022831.6, dated Nov. 30, 2006, 7 pages.
  • European Office action Application No. 04011886.1, dated Mar. 9, 2007, 6 pages.
  • European Office action for Application No. 00115441.8, dated Feb. 11, 2004, 7 pages.
  • European Office action for Application No. 00115441.8, dated Mar. 15, 2005, 4 pages.
  • European Office Action for Application No. 00119160.0, dated Jan. 16, 2004, 6 pages.
  • European Office action for Application No. 00123329.5, dated Jun. 17, 2002, 6 pages.
  • European Office Action for Application No. 00123331.1, dated Apr. 18, 2006, 5 pages.
  • European Office Action for Application No. 00305049.9, dated Dec. 29, 2003, 5 pages.
  • European Office Action for Application No. 00908266.0, dated Aug. 10, 2005, 6 pages.
  • European Office action for Application No. 02400027.5, dated Jan. 21, 2008, 5 pages.
  • European Office action for Application No. 02756535.7, dated Aug. 5, 2005, 6 pages.
  • European Office Action for Application No. 03800376.0, dated Jul. 8, 2008, 6 pages.
  • European Office Action for Application No. 04009176.1, dated Oct. 12, 2011, 8 pages.
  • European Office Action for Application No. 97904087.0, dated Jun. 25, 2002, 5 pages.
  • European Office Action for Application No. 97933327.5, dated Aug. 26, 2002, 4 pages.
  • European Office Action for Application No. 97933327.5, dated Feb. 7, 2002, 5 pages.
  • European Office Action for Application No. 98903471.5, dated May 29, 2006, 4 pages.
  • European Office Action for Application No. 98903471.5, dated Oct. 11, 2004, 6 pages.
  • European Office Action for Application No. 98908545.1, dated Mar. 15, 2005, 4 pages.
  • European Office Action for Application No. 98908545.1, dated Nov. 14, 2003, 10 pages.
  • European Office Action for Application No. 98924821.6, dated Aug. 26, 2003, 4 pages.
  • European Office Action for Application No. 98926248.0, dated Aug. 5, 2004, 4 pages.
  • European Office Action for Application No. 98926248.0, dated Dec. 11, 2003, 4 pages.
  • European Office Action for Application No. 98926248.0, dated Oct. 21, 2002, 6 pages.
  • European Office Action for Application No. 98944799.0, dated Aug. 18, 2005, 7 pages.
  • European Office Action for Application No. 98944799.0, dated Mar. 26, 2008, 5 pages.
  • European Office Action for Application No. 98944830.3, dated Jan. 30, 2006, 9 pages.
  • European Office Action for Application No. 98946907.7, dated Jun. 1, 2006, 6 pages.
  • European Office Action for Application No. 98946926.7, dated Dec. 8, 2005, 4 pages.
  • European Office Action for Application No. 98953947.3, dated Aug. 22, 2006, 6 pages.
  • European Office Action for Application No. 98953962.2, dated Oct. 28, 2005, 5 pages.
  • European Office Action for Application No. 98956309.3, dated Jun. 8, 2005, 5 pages.
  • European Office Action for Application No. 99905907.4, dated Oct. 31, 2005, 4 pages.
  • European Office Action for Application No. 99906856.2, dated Sep. 24, 2007, 5 pages.
  • European Office Action for Application No. 99906958.6, dated Feb. 22, 2006, 7 pages.
  • European Office Action for Application No. 99927333.7, dated Aug. 21, 2006, 9 pages.
  • European Office Action for Application No. 99927340.2, dated Aug. 9, 2011, 6 pages.
  • European Office Action for Application No. 99927340.2, dated Nov. 25, 2013, 5 pages.
  • European Office Action for Application No. 99945479.6, dated Aug. 9, 2006, 6 pages.
  • European Office Action for Application No. 99945519.9, dated Aug. 20, 2007, 6 pages.
  • European Office action for Application No. 99956732.4, dated Aug. 17, 2006, 7 pages.
  • European Office action for Application No. 99956745.6, dated Mar. 14, 2006, 5 pages.
  • European Office Action for Application No. 99960267.5, dated May 10, 2007, 6 pages.
  • European Office Action for Application No. 99960279.0, dated Aug. 16, 2005, 6 pages.
  • European Office Action for Application No. 99965163.1, dated Jul. 13, 2009, 5 pages.
  • European Office for Application No. 00115441.8, dated May 18, 2006, 11 pages.
  • European Search Report and Written Opinion for Application No. 05783002.8, dated Mar. 16, 2009, 8 pages.
  • European Search Report for 0115441.8 (now EP1075153), dated Nov. 6, 2002, 3 pages.
  • European Search Report for Application No. 00123329.5, dated Jan. 30, 2002, 2 pages.
  • European Search Report for Application No. 00123331.1, dated Dec. 5, 2003, 6 pages.
  • European Search Report for Application No. 00305049.9, dated May 7, 2003, 3 pages.
  • European Search Report for Application No. 00908266.0, dated May 24, 2005, 3 pages.
  • European Search Report for Application No. 00913226.7, dated Feb. 14, 2005, 3 pages.
  • European Search Report for Application No. 0119160.0, dated Apr. 17, 2003, 3 pages.
  • European Search Report for Application No. 01920248.0, dated May 3, 2004, 3 pages.
  • European Search Report for Application No. 01927387.9, dated Jun. 2, 2006, 3 pages.
  • European Search Report for Application No. 02400027.5, dated Feb. 20, 2004, 3 pages.
  • European Search Report for Application No. 02756535.7, dated May 25, 2005, 4 pages.
  • European Search Report for Application No. 03002575.3, dated Jun. 4, 2003, 3 pages.
  • European Search Report for Application No. 03008532.8, dated Dec. 27, 2004, 3 pages.
  • European Search Report for Application No. 03008534.4, dated Jul. 23, 2003, 3 pages.
  • European Search Report for Application No. 03022831.6, dated Mar. 22, 2006, 3 pages.
  • European Search Report for Application No. 03023463.7, dated Jun. 14, 2004, 3 pages.
  • European Search Report for Application No. 03076826.1, dated Sep. 10, 2003, 3 pages.
  • European Search Report for Application No. 03077174.5, dated Sep. 4, 2003, 4 pages.
  • European Search Report for Application No. 03077712.2, dated Mar. 29, 2004, 3 pages.
  • European Search Report for Application No. 03800376, dated May 7, 2007, 3 pages.
  • European Search Report for Application No. 04007911.3, dated Aug. 17, 2004, 5 pages.
  • European Search Report for Application No. 04007913.9, dated Aug. 5, 2004, 4 pages.
  • European Search Report for Application No. 04011886.1, dated Jun. 22, 2006, 5 pages.
  • European Search Report for Application No. 07018035.1, dated Apr. 23, 2009, 4 pages.
  • European Search Report for Application No. 97904087.0, dated Nov. 5, 2001, 3 pages.
  • European Search Report for Application No. 97933327.5, dated Oct. 11, 2001, 3 pages.
  • European Search Report for Application No. 98903471.5, dated Jul. 26, 2002, 4 pages.
  • European Search Report for Application No. 98907371.3, dated Mar. 28, 2002, 3 pages.
  • European Search Report for Application No. 98924821.6, dated Jun. 13, 2002, 2 pages.
  • European Search Report for Application No. 98926248, dated Jul. 18, 2002, 3 pages.
  • European Search Report for Application No. 98944799.0, dated Aug. 5, 2004, 3 pages.
  • European Search Report for Application No. 98944830.3, dated Aug. 11, 2004, 3 pages.
  • European Search Report for Application No. 98946907.7, dated Aug. 11, 2004, 3 pages.
  • European Search Report for Application No. 98946926.7, dated Aug. 11, 2004, 3 pages.
  • European Search Report for Application No. 98948163.5, dated Aug. 8, 2000, 3 pages.
  • European Search Report for Application No. 98948164.3, dated Jun. 15, 2004, 3 pages.
  • European Search Report for Application No. 98953947.3, dated Aug. 20, 2004, 3 pages.
  • European Search Report for Application No. 98953962.2, dated Sep. 2, 2004, 3 pages.
  • European Search Report for Application No. 98956187.3, dated Sep. 16, 2005, 3 pages.
  • European Search Report for Application No. 98956309.3, dated Sep. 10, 2004, 3 pages.
  • European Search Report for Application No. 99905907.4, dated Jun. 1, 2005, 3 pages.
  • European Search Report for Application No. 99906856.2, dated Oct. 4, 2006, 3 pages.
  • European Search Report for Application No. 99906958.6, dated Aug. 19, 2005, 3 pages.
  • European Search Report for Application No. 99927333.7, dated Mar. 30, 2005, 5 pages.
  • European Search Report for Application No. 99927340.2, dated Oct. 18, 2004, 3 pages.
  • European Search Report for Application No. 99945479.6, dated Mar. 24, 2006, 3 pages.
  • European Search Report for Application No. 99945519.9, dated Oct. 18, 2005, 3 pages.
  • European Search Report for Application No. 99945556.1, dated Nov. 16, 2004, 3 pages.
  • European Search Report for Application No. 99956732.4, dated Apr. 19, 2006, 4 pages.
  • European Search Report for Application No. 99956745.6, dated Jun. 30, 2005, 3 pages.
  • European Search Report for Application No. 99960267.5, dated Jul. 14, 2005, 3 pages.
  • European Search Report for Application No. 99960279.0, dated Apr. 26, 2005, 3 pages.
  • European Search Report for Application No. 99965163.1, dated Nov. 19, 2004, 4 pages.
  • European Search Report for Application No. 99971602.0, dated Feb. 6, 2007, 3 pages.
  • European Search Report for Application No. 98903623.1, dated Apr. 17, 2002, 3 pages.
  • Festa, Paul, “Vignette Updates StoryServer Platform,” CNET News.com, Sep. 16, 1997, 4 pages.
  • Foster, Robin Harris, “Advanced DEFINITY Call Centers: Working for You and Your Customers,” AT&T Technology, vol. 9, No. 2, 1994, 6 pages.
  • Francis, Paul et al., “Flexible Routing and Addressing for a Next Generation IP,” SIGCOMM, 10 pages, 1994.
  • Gawrys, G.W., et al., “ISDN: Integrated Network/Premises Solutions for Customer Needs,” ICC, 6 pages, 1986.
  • Gechter, J. et al., “ISDN Service Opportunities in the Intelligent Network,” Proceedings of the National Communications Forum, Chicago, IL, vol. 43, No. 1, Oct. 1989, 4 pages.
  • Harvey, Dean E. et al., “Call Center Solutions,” AT&T Technical Journal, vol. 70, No. 5, 10 pages, Sep./Oct. 1991.
  • Held, Gilbert, “Voice Over Data Networks,” McGraw Hill, Texas, 1998, 16 pages.
  • Henderson, Shane G. et al., “Rostering by Interating Integer Programming and Simulation,” Proceedings of the 1998 Winter Simulation Conference, Washington D.C., Dec. 13, 1998, 7 pages.
  • Hofmann, Peter. et al., “@INGate: Integrating Telephony and Internet,” IEEE Conference on Protocols for Multimedia Systems, 4 pages, Nov. 1997.
  • House, Eric, “How to Munge Outgoing From: Field When Using Mail?,” Google Discussion Group, Apr. 2, 1997, 1 page.
  • Hu, Michael Junke et al., “An Object-Relational Database System for the Interactive Multimedia,” IEEE International Conference on Intelligent Processing Systems, pp. 1571-1575, Oct. 1997.
  • International Preliminary Examination Report for PCT/US01/13313, dated Apr. 22, 2002, 4 pages.
  • International Preliminary Examination Report for PCT/US01/40267, dated Dec. 9, 2002, 4 pages.
  • International Preliminary Examination Report for PCT/US96/16919, dated Feb. 18, 1998, 18 pages.
  • International Preliminary Examination Report for PCT/US97/01469, dated Oct. 14, 1998, 8 pages.
  • International Preliminary Examination Report for PCT/US97/11881, dated Mar. 27, 1998, 3 pages.
  • International Preliminary Examination Report for PCT/US98/00631, dated Sep. 10, 1999, 7 pages.
  • International Preliminary Examination Report for PCT/US98/02847, dated Jul. 9, 1999, 5 pages.
  • International Preliminary Examination Report for PCT/US98/13644, dated Jan. 12, 2000, 6 pages.
  • International Preliminary Examination Report for PCT/US98/18646, dated Oct. 30, 2000, 5 pages.
  • International Preliminary Examination Report for PCT/US98/18789, dated Dec. 30, 1999, 6 pages.
  • International Preliminary Examination Report for PCT/US98/22527, dated Jun. 30, 2000, 5 pages.
  • International Preliminary Examination Report for PCT/US99/12841, dated Jan. 22, 2001, 5 pages.
  • International Preliminary Examination Report for PCT/US99/25308, dated Sep. 10, 2000, 3 pages.
  • International Preliminary Examination Report for PCT/US99/25309, dated May 8, 2001, 4 pages.
  • International Preliminary Report on Patentability for PCT/US2005/027544, dated May 22, 2007, 7 pages.
  • International Search Report and Written Opinion for PCT/US2009/068402, dated Mar. 31, 2010, 10 pages.
  • International Search Report for PCT/US00/00781, dated Apr. 12, 2000, 2 pages.
  • International Search Report for PCT/US00/00785, dated Oct. 2, 2000, 2 pages.
  • International Search Report for PCT/US00/023066, dated Oct. 30, 2000, 1 page.
  • International Search Report for PCT/US00/27982, dated Jan. 31, 2001, 3 pages.
  • International Search Report for PCT/US00/27983, dated Mar. 19, 2001, 2 pages.
  • International Search Report for PCT/US00/27984, dated Mar. 22, 2001, 1 page.
  • International Search Report for PCT/US01/07457, dated Aug. 30, 2001, 1 page.
  • International Search Report for PCT/US01/13313, dated Jul. 6, 2001, 1 page.
  • International Search Report for PCT/US01/40267, dated Jul. 17, 2001, 1 page.
  • International Search Report for PCT/US02/23080, dated Oct. 1, 2002, 1 page.
  • International Search Report for PCT/US03/41677, dated Apr. 10, 2006, 1 page.
  • International Search Report for PCT/US05/27544, dated Jun. 14, 2006, 1 page.
  • International Search Report for PCT/US96/16919, dated Jun. 2, 1997, 3 pages.
  • International Search Report for PCT/US97/01469, dated Apr. 14, 1997, 1 page.
  • International Search Report for PCT/US97/05457, dated Jun. 24, 1997, 2 pages.
  • International Search Report for PCT/US97/11881, dated Oct. 24, 1997, 1 page.
  • International Search Report for PCT/US98/00631, dated Jun. 18, 1998, 1 page.
  • International Search Report for PCT/US98/01158, dated Jul. 17, 1998, 1 page.
  • International Search Report for PCT/US98/02152, dated Jun. 25, 1998, 1 page.
  • International Search Report for PCT/US98/02847, dated Aug. 6, 1998, 1 page.
  • International Search Report for PCT/US98/02848, dated Aug. 11, 1998, 1 page.
  • International Search Report for PCT/US98/02923, dated Aug. 19, 1998, 1 page.
  • International Search Report for PCT/US98/06334, mailed Sep. 1, 1998, 2 pages.
  • International Search Report for PCT/US98/10357, dated Jan. 14, 1999, 1 page.
  • International Search Report for PCT/US98/11442, dated Oct. 21, 1998, 2 pages.
  • International Search Report for PCT/US98/13644, dated Apr. 21, 1999, 2 pages.
  • International Search Report for PCT/US98/18646, dated Jan. 29, 1999, 2 pages.
  • International Search Report for PCT/US98/18789, dated Jan. 29, 1999, 3 pages.
  • International Search Report for PCT/US98/18833, dated Nov. 19, 1998, 1 page.
  • International Search Report for PCT/US98/18874, dated Jan. 29, 1999, 1 page.
  • International Search Report for PCT/US98/18989, dated Jan. 25, 1999, 1 page.
  • International Search Report for PCT/US98/22527, dated Apr. 2, 1999, 2 pages.
  • International Search Report for PCT/US98/22555, mailed Mar. 3, 1999, 1 page.
  • International Search Report for PCT/US98/22600, mailed Jun. 4, 1999, 1 page.
  • International Search Report for PCT/US98/22935, mailed Apr. 14, 1999, 1 page.
  • International Search Report for PCT/US99/02812, mailed May 11, 1999, 1 page.
  • International Search Report for PCT/US99/02814, mailed Jun. 17, 1999, 1 page.
  • International Search Report for PCT/US99/02822, mailed Aug. 18, 1999, 1 page.
  • International Search Report for PCT/US99/03038, mailed Apr. 23, 1999, 1 page.
  • International Search Report for PCT/US99/03039, mailed May 11, 1999, 1 page.
  • International Search Report for PCT/US99/12700, mailed Nov. 30, 1999, 1 page.
  • International Search Report for PCT/US99/12781, mailed Sep. 9, 1999, 2 pages.
  • International Search Report for PCT/US99/12841, mailed Sep. 10, 1999, 2 pages.
  • International Search Report for PCT/US99/20259, dated Feb. 15, 2000, 1 page.
  • International Search Report for PCT/US99/20387, dated Dec. 7, 1999, 2 pages.
  • International Search Report for PCT/US99/20461, dated Dec. 23, 1999, 2 pages.
  • International Search Report for PCT/US99/25117, dated Nov. 1, 2000, 2 pages.
  • International Search Report for PCT/US99/25265, dated Feb. 18, 2000, 1 page.
  • International Search Report for PCT/US99/25308, dated Feb. 3, 2000, 1 page.
  • International Search Report for PCT/US99/25309, dated Feb. 10, 2000, 1 page.
  • International Search Report for PCT/US99/25310, dated Feb. 10, 2000, 1 page.
  • International Search Report for PCT/US99/26619, dated Mar. 17, 2000, 1 page.
  • International Search Report for PCT/US99/26659, dated Feb. 4, 2000, 1 page.
  • International Search Report for PCT/US99/29043, dated Mar. 20, 2000, 1 page.
  • International Search Report for PCT/US99/29044, dated May 11, 2000, 1 page.
  • International Written Opinion for PCT/US98/22527, mailed Dec. 27, 1999, 5 pages.
  • Japanese Interrogation and Re-Examination Report for Application No. 1999-502827, mailed Oct. 26, 2004, 7 pages.
  • Japanese Office Action for Application No. 1997-527811, mailed Oct. 10, 2000, 6 pages.
  • Japanese Office Action for Application No. 1998-505335, mailed Mar. 5, 2002, 7 pages.
  • Japanese Office Action for Application No. 1998-531244, mailed Jan. 6, 2004, 4 pages.
  • Japanese Office Action for Application No. 1998-531244, mailed Sep. 10, 2002, 5 pages.
  • Japanese Office Action for Application No. 1998-536740, mailed Feb. 24, 2004, 5 pages.
  • Japanese Office Action for Application No. 1998-536740, mailed Sep. 3, 2002, 14 pages.
  • Japanese Office Action for Application No. 1999-500765, mailed Feb. 10, 2004, 6 pages.
  • Japanese Office Action for Application No. 1999-500765, mailed Sep. 3, 2002, 11 pages.
  • Japanese Office Action for Application No. 1999-502827, mailed Dec. 3, 2002, 4 pages.
  • Japanese Office Action for Application No. 1999-502827, mailed May 28, 2002, 3 pages.
  • Japanese Office Action for Application No. 1999-502827, mailed Nov. 1, 2005, 8 pages.
  • Japanese Office action for Application No. 2000-220082, mailed on Apr. 1, 2003, 3 pages.
  • Japanese Office Action for Application No. 2000-511299, mailed Feb. 3, 2004, 4 pages.
  • Japanese Office Action for Application No. 2000-511299, mailed May 16, 2006, 7 pages.
  • Japanese Office Action for Application No. 2000-512333, mailed Sep. 3, 2002, 6 pages.
  • Japanese Office Action for Application No. 2000-512334, mailed Sep. 10, 2002, 9 pages.
  • Japanese Office Action for Application No. 2000-512336, mailed Jul. 23, 2002, 8 pages.
  • Japanese Office Action for Application No. 2000-512336, mailed Jun. 24, 2003, 4 pages.
  • Japanese Office Action for Application No. 2000-514448, mailed Sep. 3, 2002, 10 pages.
  • Japanese Office Action for Application No. 2000-519541, dated May 16, 2005, 4 pages.
  • Japanese Office Action for Application No. 2000-519541, mailed Aug. 20, 2002, 10 pages.
  • Japanese Office Action for Application No. 2000-519541, mailed Dec. 2, 2003, 7 pages.
  • Japanese Office Action for Application No. 2000-519541, mailed Mar. 14, 2006, 6 pages.
  • Japanese Office Action for Application No. 2000-522718, mailed Sep. 10, 2002, 9 pages.
  • Japanese Office Action for Application No. 2000-531822, mailed Sep. 24, 2002, 6 pages.
  • Japanese Office Action for Application No. 2000-531940, mailed Dec. 3, 2002, 4 pages.
  • Japanese Office Action for Application No. 2000-532958, mailed Aug. 20, 2002, 7 pages.
  • Japanese Office Action for Application No. 2000-554115, dated Apr. 27, 2005, 5 pages.
  • Japanese Office Action for Application No. 2000-554115, mailed Jan. 6, 2004, 4 pages.
  • Japanese Office Action for Application No. 2000-554115, mailed Oct. 1, 2002, 5 pages.
  • Japanese Office Action for Application No. 2000-556311, mailed Oct. 21, 2003, 6 pages.
  • Japanese Office Action for Application No. 2000-570673, dated Oct. 4, 2005, 4 pages.
  • Japanese Office Action for Application No. 2000-570673, mailed Mar. 8, 2005, 6 pages.
  • Japanese Office Action for Application No. 2000-570673, mailed Oct. 14, 2003, 6 pages.
  • Japanese Office Action for Application No. 2000-570677, mailed May 11, 2004, 8 pages.
  • Japanese Office Action for Application No. 2000-570677, mailed Nov. 30, 2004, 10 pages.
  • Japanese Office Action for Application No. 2000-570941, mailed Oct. 7, 2003, 6 pages.
  • Japanese Office Action for Application No. 2000-578753, mailed May 11, 2004, 11 pages.
  • Japanese Office Action for Application No. 2000-580124, mailed Apr. 12, 2005, 6 pages.
  • Japanese Office Action for Application No. 2000-580124, mailed Oct. 7, 2003, 5 pages.
  • Japanese Office Action for Application No. 2000-580329, mailed Feb. 15, 2005, 8 pages.
  • Japanese Office Action for Application No. 2000-580329, mailed May 13, 2008, 8 pages.
  • Japanese Office Action for Application No. 2000-580329, mailed Oct. 4, 2005, 5 pages.
  • Japanese Office Action for Application No. 2000-581781, mailed Feb. 3, 2004, 4 pages.
  • Japanese Office Action for Application No. 2000-581781, mailed Oct. 8, 2002, 4 pages.
  • Japanese Office Action for Application No. 2000-590363, mailed Apr. 1, 2003, 6 pages.
  • Japanese Office Action for Application No. 2001-526724, mailed Aug. 1, 2006, 5 pages.
  • Japanese Office Action for Application No. 2001-526724, mailed Dec. 13, 2005, 5 pages.
  • Japanese Office Action for Application No. 2001-526724, mailed May 17, 2005, 4 pages.
  • Japanese Office Action for Application No. 2006-127262, mailed Jun. 1, 2010 (5 pages).
  • Japanese Office Action for Application No. 2006-127262, mailed Nov. 18, 2008 (7 pages).
  • Japanese Office Action for Application No. 2011-543586, mailed Jan. 24, 2013, 5 pages.
  • Japanese Office Action for Application No. 532950, dated Dec. 17, 2002, 6 pages.
  • Katz, Michael, “When CTI Meets the Internet,” Telecommunications, vol. 31, No. 7, Jul. 1997, 6 pages.
  • Kaufman, Harvey, “Call Centers in Cyberspace,” Communications News, vol. 34, Issue 7, Jul. 1997, 4 pages.
  • Kaukonen, S., et al., “Agent-Based Conferencing Using Mobile IP-Telephony,” Proceedings of Multimedia Signal Processing, 1999, 6 pages.
  • Korean Office Action for Application No. 10-2011-7016735, dated Jun. 13, 2013, 3 pages.
  • Korean Office Action for Application No. 10-2011-7017067, dated Aug. 21, 2012, 9 pages.
  • Kramer, Brian, “How to Send a File to the Sender of a Message?,” Google Discussion Group, May 27, 1994, 5 pages.
  • Lee, Chien-I, et al., “A New Storage and Retrieval Method to Support Editing Operations in a Multi-Disk-based Video Server,” Fourth International Conference on Parallel and Distributed Information Systems, IEEE, Miami Beach, FL, Dec. 1996, 10 pages.
  • Lin, Yi-Bing et al., “A Flexible Graphical User Interface for Performance Modeling,” Software—Practice and Experience, vol. 25(2), Feb. 1995, 24 pages.
  • Low, Colin, “The Internet Telephony Red Herring,” Global Telecommunications Conference, Nov. 1996, 15 pages.
  • Mackay, Wendy E., et al., “Virtual Video Editing in Interactive Multimedia Applications,” Communications of the ACM, vol. 32, No. 7, Jul. 1989, 9 pages.
  • Malabocchia, Fabio, et al., “Mining Telecommunications Data Bases: An Approach to Support the Business Management,” Network Operations and Management Symposium, IEEE, vol. 1, Feb. 1998, 9 pages.
  • Masashi, Tsuboi et al., “Computer Telephony Integration System,” CTSTAGE, Oki Electric Research and Development, 174, vol. 64, No. 2, Apr. 1, 1997, 10 pages.
  • Matsumoto, Akihiko, “Bank CTI/Call Center Using Up Customer Information, Analysis of Six Major Manufacturers' Solutions,” Network Computing, Ric Telecom Corporation, Japan, vol. 10, No. 10, Oct. 1, 1998, 13 pages.
  • Matsuo, Yasunori, “Microsoft Project for Windows 95,” Nikkei Personal Computing, Nikkei Business Publications, Inc., No. 255, Dec. 18, 1995, 2 pages.
  • Beck, C. et al., Interactive process of operating system for multimedia communication center, Genesys Telecom Lab, Inc. 2014, 3 pages.
  • Chinese Office action with English Translation for Application No. 200980151937.6 dated May 23, 2014, 7 pages.
  • U.S. Appl. No. 10/234,691, Neyman et al.
  • U.S. Appl. No. 08/928,861, Neyman et al.
Patent History
Patent number: RE45606
Type: Grant
Filed: Mar 7, 2013
Date of Patent: Jul 7, 2015
Assignee: GENESYS TELECOMMUNICATIONS LABORATORIES, INC. (Daly, City, CA)
Inventors: Igor Neyman (Palo Alto, CA), Myhailo Barskyy (San Francisco, CA), Alec Miloslavsky (San Carlos, CA), Oleg Bondarenko (San Francisco, CA), Valeriy Issayev (Foster City, CA), Andrei Petrov (Redwood City, CA), Pavel Karpenko (Concord, CA)
Primary Examiner: Hemant Patel
Application Number: 13/789,640
Classifications
Current U.S. Class: Having A Multimedia Feature (e.g., Connected To Internet, E-mail, Etc.) (379/265.09)
International Classification: H04M 3/00 (20060101); H04M 3/51 (20060101);