Method and apparatus for extended management of state and interaction of a remote knowledge worker from a contact center

A network system for managing remote agents of a communication center includes a primary server connected to the network the primary server controlling at least one routing point; one or more secondary servers distributed on the network and accessible to the remote agents, the secondary server or servers having data access to agent computing platforms and communication peripherals; and, a software suite distributed in part to the secondary server or servers and distributed in part to one or more agents computing platforms and peripherals, the software suite including protocol for reporting agent status data. The system monitors agents computing platforms and peripherals for activity state through the one or more secondary servers whereupon the one or more secondary servers exchange control messaging and event related data using ISCC protocols with the primary server over the network for intelligent routing purposes.

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

The present application is a continuation application of patent application Ser. No. 10/269,124, which was filed on Oct. 10, 2002 now U.S. Pat. No. 6,985,943, which is a continuation-in-part (CIP) to U.S. patent application Ser. No. 09/405,335 filed on Sep. 24, 1999, issued as U.S. Pat. No. 6,711,611 on Mar. 23, 2004, which is a continuation-in-part (CIP) to U.S. patent application Ser. No. 09/151,564 filed on Sep. 11, 1998, issued as U.S Pat. No. 6,108,711 on Aug. 22, 2000, these prior applications are incorporated by reference in their entirety. The present invention is also related to U.S. Pat. No. 5,960,073 and to U.S. Pat. No. 5,802,163, both of which are incorporated herein in its entirety. The present application is a reissue patent application of U.S. Pat. No. 7,373,405, filed on Mar. 1, 2005 as U.S. patent application Ser. No. 11/070,898, which is a continuation of U.S. patent application Ser. No. 10/269,124, filed on Oct. 10, 2002, now U.S. Pat. No. 6,985,943, the content of which is incorporated herein by reference in its entirety. The contents of U.S. patent application Ser. No. 09/405,335, filed on Sep. 24, 1999, now U.S. Pat. No. 6,711,611, of U.S. patent application Ser. No. 09/151,564, filed on Sep. 11, 1998, now U.S. Pat. No. 6,108,711, and of U.S. patent application Ser. No. 08/940,712, filed on Sep. 30, 1997, now U.S. Pat. No. 5,960,073, are incorporated herein by reference in their entirety.

FIELD OF THE INVENTION

The present invention pertains to telephony communications systems and has particular application to methods including software enabling extended management capabilities of state and interaction of a remote knowledge worker from a contact center.

BACKGROUND OF THE INVENTION

In the field of telephony communication, there have been many improvements in technology over the years that have contributed to more efficient use of telephone communication within hosted call-center environments. Most of these improvements involve integrating the telephones and switching systems in call centers with computer hardware and software adapted for better routing of telephone calls, faster delivery of telephone calls and associated information, and improved service with regard to client satisfaction. Such computer-enhanced telephony is known in the art as computer-telephony integration (CTI).

There are many ways that CTI enhancement may be done in the art, and the present inventors are knowledgeable in most of these. The present inventors are also knowledgeable about many special architectures and software enhancements that are not in the public domain. In the following background material only that material specifically designated as prior art should be taken to be acknowledged as prior art material by the inventors.

Generally speaking, CTI implementations of various design and purpose are implemented both within individual call-centers and, in some cases, at the telephone network level. For example, processors running CTI software applications may be linked to telephone switches, service control points (SCPs), and network entry points within a public or private telephone network. At the call-center level, CTI processors are typically connected to telephone switches and, in some cases, to similar CTI hardware at the network level, often by a dedicated digital link. CTI processors and other hardware within a call-center are commonly referred to as customer premises equipment (CPE). It is the CTI processor and application software in such centers that provides computer software enhancement to a call center.

In a CTI-enhanced call center, telephones at agent stations are connected to a central telephony switching apparatus, such as an automatic call distributor (ACD) switch or a private branch exchange (PBX). The agent stations may also be equipped with computer terminals such as personal computer/video display unit's (PC/VDU's) so that agents using such stations may have access to stored data and enhanced services and tools as well as being linked to incoming callers by telephone equipment. Such stations may be, and usually are, interconnected through the PC/VDUs by a local area network (LAN). One or more data or transaction servers may also be connected to the LAN that interconnects agent stations. The LAN is, in turn, typically connected to the CTI processor, which is connected to the call switching apparatus of the call center in systems known to the present inventors.

When a call arrives at a call center, whether or not the call has been pre-processed at a service control point (SCP), typically at least the telephone number of the calling line is made available to the receiving switch at the call center by the network provider. This service is available by most networks as caller-ID information in one of several formats such as Automatic Number Identification (ANI). Typically the number called is also available through a service such as Dialed Number Identification Service (DNIS). If the call center is computer-enhanced (CTI), the phone number of the calling party may be used, in systems known to the present inventors, as a key to access additional information from a customer information system (CIS) database at a server on the network that connects the agent workstations. In this manner information pertinent to a call may be provided to an agent, often as a screen pop on the agent's PC/VDU.

In recent years, advances in computer technology, telephony equipment, and infrastructure have provided many opportunities for improving telephone service in public-switched and private telephone intelligent networks. Similarly, development of a separate information and data network known as the Internet, together with advances in computer hardware and software have led to a new multi-media telephone system known in the art by several names. In this new system telephone calls are simulated by multi-media computer equipment, and data, such as audio data, is transmitted over data networks as data packets. In this system the broad term used to describe such computer-simulated telephony is Data Network Telephony (DNT).

For purposes of nomenclature and definition, the inventors wish to distinguish clearly between what might be called conventional telephony, which is the telephone service enjoyed by nearly all citizens through local telephone companies and several long-distance telephone network providers, and what has been described herein as computer-simulated telephony or data-network telephony. The conventional systems are referred to herein as Connection-Oriented Switched-Telephony (COST) systems, CTI enhanced or not.

The computer-simulated, or DNT systems are familiar to those who use and understand computers and data-network systems. Perhaps the best example of DNT is telephone service provided over the Internet, which will be referred to herein as Internet Protocol Network Telephony (IPNT), by far the most extensive, but still a subset of DNT.

Both systems use signals transmitted over network links. In fact, connection to data networks for DNT such as IPNT is typically accomplished over local telephone lines, used to reach points in the network such as an Internet Service Provider (ISP), which then connects the user to the Internet backbone. The definitive difference is that COST telephony may be considered to be connection-oriented telephony. In the COST system, calls are placed and connected by a specific dedicated path, and the connection path is maintained over the time of the call. Bandwidth is basically assured. Other calls and data do not share a connected channel path in a COST system. A DNT system, on the other hand, is not dedicated or connection-oriented. That is, data, including audio data, is prepared, sent, and received as data packets over a data-network. The data packets share network links and available bandwidth, and may travel by varied and variable paths.

Recent improvements to available technologies associated with the transmission and reception of data packets during real-time DNT communication have enabled companies to successfully add DNT, principally IPNT, capabilities to existing CTI call centers. Such improvements, as described herein and known to the inventor, include methods for guaranteeing available bandwidth or quality of service (QoS) for a transaction, improved mechanisms for organizing, coding, compressing, and carrying data more efficiently using less bandwidth, and methods and apparatus for intelligently replacing lost data via using voice supplementation methods and enhanced buffering capabilities.

In addition to Internet protocol (IPNT) calls, a DNT center may also share other forms of media with customers accessing the system through their computers. E-mails, Video mails, fax, file share, file transfer, video calls, and so forth are some of the other forms of media, which may be used. This capability of handling varied media leads to the term multimedia communications center. A multimedia communications center may be a combination CTI and DNT center, or may be a DNT center capable of receiving COST calls and converting them to a digital DNT format. The term communication center will replace the term call center hereinafter in this specification when referring to multimedia capabilities.

In typical communication centers, DNT is accomplished by Internet connection and IPNT calls. For this reason, IPNT and the Internet will be used in examples to follow. It should be understood, however, that this usage is exemplary, and not limiting.

In systems known to the inventors, incoming IPNT calls are processed and routed within an IPNT-capable communication center in much the same way as COST calls are routed in a CTI-enhanced call center, using similar or identical routing rules, waiting queues, and so on, aside from the fact that there are two separate networks involved. Communication centers having both CTI and IPNT capability utilize LAN-connected agent-stations with each station having a telephony-switch-connected headset or phone, and a PC connected, in most cases via LAN, to the network carrying the IPNT calls, or to a network-connected server on the LAN. Therefore, in most cases, IPNT calls are routed to the agent's PC while conventional telephony calls are routed to the agent's conventional telephone or headset. Typically separate lines and equipment are implemented for each type of call weather COST or IPNT.

Due in part to added costs associated with additional equipment, lines, and data ports that are needed to add IPNT capability to a CTI-enhanced call-center, developers are currently experimenting with various forms of integration between the older COST system and the newer IPNT system. For example, by enhancing data servers, interactive voice response units (IVR's), agent-connecting networks, and so on, with the capability of conforming to Internet protocol, call data arriving from either network may be integrated requiring less equipment and lines to facilitate processing, storage, and transfer of data. Some such equipment and services are known to the present inventors, which are not in the public domain.

With many new communication products supporting various media types available to businesses and customers, a communication center must add significant application software to accommodate the diversity. For example, e-mail programs typically have differing parameters than do IP applications. IP applications are different regarding protocol than COST calls, and so on. Separate routing systems and/or software components are needed for routing e-mails, IP calls, COST calls, file sharing, etc. Agents must then be trained in the use of a variety of applications supporting the different types of media.

Keeping contact histories, reporting statistics, creating routing rules and the like becomes more complex as newer types of media are added to communication center capability. Additional hardware implementations such as servers, processors, etc. are generally required to aid full multimedia communication and reporting. Therefore, it is desirable that interactions of all multimedia sorts be analyzed, recorded, and routed according to enterprise (business) rules in a manner that provides seamless integration between media types and application types, thereby allowing agents to respond intelligently and efficiently to customer queries and problems.

In a system known to the inventor, full multimedia functionality is supported wherein agents and customers may interact in a seamless manner. Likewise interaction histories of virtually any supported media may be automatically recorded and stored for latter access by agents and in some cases customers (clients) themselves. Such a system, termed a customer-interaction-network-operating system (CINOS) by the inventor, comprises a suite of software enhancements, implemented both at the communication center and at CPE sites, that are designed to provide automated and seamless interaction between customers, associates, and agents.

In order to successfully implement and administer the many aspects of a network operating system such as the CINOS system introduced above, a new agent called a knowledge worker has emerged. This is especially true in more state-of-the-art multimedia communication-centers. In a broad sense, a knowledge worker may be any individual that specializes, or is expert in a specific field or fields utilized within the communication center. Knowledge workers may be responsible for such tasks as creating automated scripts, building integrated software applications, tracking and parsing certain history paths in a database for automated reporting, and other relatively complicated functions. Knowledge workers may also be trained agents responsible for sales, service and technical assistance.

A knowledge worker, weather an agent or specialized technician, generally has all of the resource in the way of customer data, interaction data, product data, and multimedia support at his fingertips as long as he or she is operating from a designated PC/VDU or other supported station within the communication center. In some cases, a knowledge worker may have full data access and multimedia support if he is located off-site but is linked to the center by a suitable data-network connection such as from a home office or remote station.

Because a network operating system such as CINOS requires that certain customer or client CPE, including network equipment, be enhanced with software designed to facilitate seamless interaction with the communication center, it is often necessary that knowledge workers be dispatched into the field away from the communication center to aid in such as installation, set-up, and programming of software applications and tools. In some instances this can be a formidable enterprise.

A knowledge worker possesses the kind of skills that are largely indispensable and not shared by the average communication center worker. When a knowledge worker is away from a home-center such as on the road, or at a client location, he is generally limited in data access and interaction capability with his or her home communication-center data and tools. In some cases this may be a liability to the center. In many cases she/he will be limited to specific data that was carried along, or that may be downloaded from the center to such as a cellular telephone, a personal digital assistant (PDA) or a Laptop computer. Moreover, a mobile knowledge worker in the field may also be limited in providing service to the home-center by virtue of the same data-access limitations.

In some cases, a knowledge worker at a client site may, after some set-up, programming, and initialization, commandeer a suitable client PC so that she/he may establish free and unfettered access to home-center data and software services. However, such interaction, if not on the be-half of the client, may be deemed by the client as an intrusion at most and an inconvenience at least.

In typical contact centers, which may also include multimedia communication centers, the preponderance of incoming and outgoing interactions are processed by voice (DNT) or Web-based self service interfaces or by communication-center agents located within the domain of the center and managed through a communication center environment. However, many interactions cannot be successfully processed through client self-service interfaces or on-site agents often because of a high level of assistance required. Such interactions require the expertise of a knowledge worker, a knowledge worker being a call-center employee with a more detailed knowledge of the center structure and operations than the typical on-site agent.

Knowledge workers are not required for routine service assistance or other duties that are routinely performed within the domain of the center. As a result, they are typically located off site in a pool or remote to the extent of performing as a home-based or traveling workers. Therefore, standard communication center control systems and procedures cannot be applied to such knowledge workers. Often this problem is due to an absence of a CTI link established between the location of the knowledge worker and the communication center. Off-site knowledge workers are mobile and typically operate using a variety of communication equipment (non-CTI telephone, personal digital assistants [PDAs], wireless Web, etc.) and using applications that are not assimilated in standard or unified array throughout the communication environment. Therefore, it becomes increasingly difficult to provide management from the communication center in terms of state control and report accessibility. For example, which of a force of off-site knowledge workers are at any given time able to receive an interaction wherein they are also able to exchange interaction-related data with the center, client or both?

Remote knowledge workers are, from a control and management standpoint, invisible to standard CTI-enabled facilities. Not having the ability to manage these workers causes the ongoing costs associated with doing business from a communication center to rise.

The inventors are familiar with a system taught in U.S. Pat. No. 5,802,163 entitled Methods and Apparatus for Implementing an Outbound Network Call Center referenced in the Cross-Reference to Related Documents section of this specification. That system teaches a method and apparatus for integrating a remote home agent in a call center. In practice, the home agent or knowledge worker must dial a specific enabled telephony switch in the telephone network when an interaction to the agent is detected. This action terminates the incoming interaction to a first station-side port of the telephony switch. A connection is thus maintained between the home agent and the telephony switch until the agent disconnects. In this way, all events that are determined to be destined to the home agent are switched to the established connection. This action provides a continuing connection between the telephony switch and the home agent until the home agent disconnects. Events, such as incoming calls at the center selected to go to the home agent may then be switched to the established connection. The telephony switch functions as a login portal for the agent. However only the agent's media stream is controlled in t his case. Interaction-related data and agent status are not considered or addressed.

The inventors are also familiar with a call-center system taught in U.S. Pat. No. 5,960,073 entitled Method and Apparatus for Providing an Interactive Home Agent with Access to Call Center Functionality and Resources also listed in the Cross-Reference section of this specification above. This system supports remote agent stations through a network by establishing a data link between a computer platform at the remote agent station and a CTI-processor connected to a telephony switch at the call center. Events destined to the agent are switched from the call center to a telephone at the agent station while data pertaining to the calls is transferred over the data link to the computer platform at the remote agent station to be displayed. In this system data pertaining to or related to calls is retrieved from a database at the call center. The data can include scripts for an agent at the remote station.

Call center services are supported by cooperation between software at the CTI processor and the computer platform at the remote station. In one embodiment the data link, once established, is kept open while calls continue to be switched to the remote station. In another embodiment after an initial agent log in, dial up is done from the remote station upon detecting calls from the call center by a TAPI compliant device. A reduced log is performed at the CTI processor at the call center to save time. In yet another embodiment, the CTI processor establishes the data connection each time using a modem bank adapted for dialing. The modem bank switches the call from the call center to the remote station. A plurality of remote stations may be thus supported.

A drawback with this system is that it requires first-party control equipment established at the remote agent workplace. The first-party control equipment controls the remote agent phone separately from the agent's computer platform.

The inventor is familiar with yet another system taught in U.S. patent application No. 2001/0023448 entitled Method and Apparatus for Data-Linking a Mobile Knowledge Worker to Home Communication-Center Infrastructure also listed in the cross-reference section of this specification. The system is a proxy system enabling a worker remote from a communication center to operate with full access to data and software at the communication center from a light computer device typically unable to operate as a workstation at the communication center. In this system, a proxy server, which may be a LAN-connected server at the communication center, has a two-way data link to the light computer device operated by the remote agent. The proxy executes software, which ascertains the hardware and software characteristics of the light device.

The proxy server accesses communication-center data at direction of the light device, operates communication center software tools, and provides results to the light device over the communication link in a form usable by the light device. This approach suggests a general method for management of remote knowledge workers from within a contact center (CC). In particular, it suggests using a proxy server as a mediator between a contact center environment and a remote agent device. However, it is still limited in terms of further enhancement that might enable more specific techniques and mechanisms. Part of this solution includes a remote option that requires special equipment to be provided and connected to the remote agent's telephone set, which in addition, must be a specially adapted telephone set to accept the equipment.

What is clearly needed is a method and apparatus that can provide full and unobstructed access to communication-center data and services for a mobile or otherwise remote knowledge worker. Such a method and apparatus would allow a communication center to freely dispatch mobile knowledge workers to client locations or other areas within the domain of a large communication campus or network of communication centers without compromising quality and response time of high-level technical services. Moreover, the method would not need to rely on client-associated resources.

SUMMARY OF THE INVENTION

In a preferred embodiment of the present invention a network system for managing remote agents of a communication center is provided, comprising a primary server connected to the network, the primary server controlling at least one routing point used by the communication center, one or more secondary servers distributed on the network and accessible to the agents, the secondary server or servers having data access to agent computing platforms and communication peripherals, and a software suite distributed in part to the secondary server or servers and in part to one or more agents computing platforms and peripherals, the software suite including protocol for reporting agent status data. The system is characterized in that the agent's computing platforms and peripherals are monitored for activity state by the one or more secondary servers whereupon the one or more secondary servers exchange control messaging and event related data using ISCC protocols with the primary server over the network, the primary server recognizing CTI protocol equivalents for the messaging for the purpose of intelligently routing events incoming to or otherwise communicatively involving the remote agents.

In some preferred embodiments the network is an Internet network and the routing point is one of or a combination of a telephony switch, a service control point, and an Internet Protocol Router. Also in some preferred embodiments the remote agents are grouped together in a central facility, while in some others the remote agents are distributed over a home network. In some cases the remote agents may be mobile and wirelessly connected to the one or more secondary servers.

In various embodiments the agent's computing platforms and peripherals are one of or a combination of a desktop computer, a lap top computer, a personal digital assistant, a cellular telephone, an Internet Protocol telephone and a paging device. Also in various embodiments remote agents are specialized knowledge workers offering service not available within the communication center.

In some preferred embodiments software suite is an extension of a CTI software suite used in the communication center, the extended portion for parameterizing and enabling additional services and communication apparatus generic to the remote agents but not available within the center. Also in some preferred embodiments control messaging and event related data exchanged between the primary server and the one or more secondary servers is formatted using Extensible Markup Language. In some cases Extensible Style sheet Language Transformation is used to transform the Extensible Markup Language files into formats useable on the computing platforms of the remote agents. The useable formats may include HTML, HDML, WAP, and WML.

In some embodiments a CTI-enhanced Interactive Voice Response system is used to exchange data with a remote agent receiving calls on an analog telephone in the event that the agent does not have access to a computing platform connected to the telephone and the one or more secondary servers. Also in some embodiments the remote agents establish one or more destination numbers for receiving events, the destination numbers to be set in the CTI environment for the period that the agent is logged into the system. The destination numbers may include one or a combination of telephone numbers, fax numbers, Internet Protocol addresses, e-mail addresses, universal resource locators (URLs), and pager numbers.

In another aspect of the invention a software suite for managing remote agents of a communication center is provided comprising a client portion including a contact navigation application, a contact extension application, and a code library, and a server application including a transaction management application, an agent specific application, and an ISCC application program interface. The suite is characterized in that the client portion specifies functionality and reports state information of the remote agent to the server application, whereupon the server application reports same under ISCC protocol to a communication-center suite for routing purposes and wherein the communication-center suite provides event-related data under ISCC protocol to the server application, which in turn transforms the data into data formats usable on various communication devices of the remote agent.

In some embodiments the remote agents are part of a communication center network, the server portion functioning as the network access and agent monitoring point for the remote agents. The communication network may include the Internet network and the public switched telephony network (PSTN). The remote agents may be grouped together in a central facility or distributed over a home network. In many cases the remote agents are mobile and wirelessly connected to the one or more secondary servers.

In some preferred embodiments the client portion resides on one or a combination of a desktop computer, a lap top computer, a personal digital assistant, a cellular telephone, an Internet Protocol telephone and a paging device. Further the remote agents may be specialized knowledge workers offering service not available within the communication center.

In some embodiments the software suite is an extension of a CTI software suite used in the communication center, the extended portion for parameterizing and enabling additional services and communication apparatus generic to the remote agents but not available within the center. The ISCC protocols may include Extensible Markup Language used to format messaging and event-related data. In some cases Extensible Style sheet Language Transformation may be used to transform the Extensible Markup Language files into formats useable on the computing platforms of the remote agents. The useable formats include HTML, HDML, WAP, and WML.

In some embodiments the remote agents establish one or more destination numbers for receiving events on the various communication devices, the destination numbers to be set in the CTI environment for the period that the agent is logged into the system providing the software. In some cases the destination numbers include one or a combination of telephone numbers, fax numbers, Internet Protocol addresses, e-mail addresses, universal resource locators, and pager numbers.

In yet another aspect of the invention a method for managing information about remote agents of a communication center for the purpose of intelligently routing events involving those agents is provided, comprising steps of (a) providing a software suite accessible to the agents for parameterizing and enabling additional services and communication apparatus generic to the remote agents but not available within the center; (b) providing a network link between the software suite and CTI software of the communication center; and (c) routing communication events involving the remote agents according to state and other information about the agents provided by and through the software suite.

In preferred embodiments of the method, in step (a), the agents are accessible to the communication center through a combination of the Internet network and the public switched telephony network. Also in preferred embodiments, in step (a), the software suite comprises a server portion and a client portion. Also in some embodiments, in step (a), the agents are knowledge workers offering service not available from agents within the communication center. Further, in step (a), communication apparatus may include one or a combination of a desktop computer, a lap top computer, a personal digital assistant, a cellular telephone, an Internet Protocol telephone and a paging device. Still further, in step (a), the software suite may be configured and updated from the communication center.

In some embodiments, in step (b), the network link supports ISCC protocol, which may include Extensible Markup Language and Extensible Style Sheet Transformation Language. In some cases the client portion resides on one or more of the communication apparatus and the server portion resides on a server accessible to the one or more communication apparatus via a network link.

In some embodiments, in step (c), state information includes ready, not ready, logged in, logged out, and on call. Also in step (c) other information may include skill level, registered destination numbers, and communication device type and platform.

BRIEF DESCRIPTION OF THE DRAWING FIGURES

FIG. 1 is an exemplary overview of a multimedia-interaction storage system within a communication center according to an embodiment of the present invention.

FIG. 2 is a block diagram illustrating a connective relationship between a proxy server and a hand-held computer operated by a mobile knowledge worker according to a preferred embodiment of the present invention.

FIG. 3 is an architectural overview of a state and interaction management system according to an embodiment of the present invention.

FIG. 4 is a block diagram illustrating system connection hierarchy according to an embodiment of the invention.

FIGS. 5 through 8 are block diagrams illustrating call control use cases according to an embodiment of the present invention.

FIG. 9 is a block diagram illustrating components of the Knowledge Worker software and integration thereof to a communication center framework.

FIG. 10 is a block diagram illustrating components of the knowledge worker platform.

FIG. 11 is a configuration model for knowledge worker state information.

FIG. 12 is a data model for presenting an active knowledge worker state.

FIG. 13 is a process flow diagram illustrating the sequence of a successful internal call.

FIG. 14 is a process flow diagram illustrating a variation of the sequence of FIG. 13 with a forced answer.

FIG. 15 is a process flow diagram illustrating the sequence of a failed internal call.

FIG. 16 is a process flow diagram illustrating the sequence of an internal call with a forced timeout before PIM decision according to an embodiment of the invention.

FIG. 17 is a process flow diagram illustrating the sequence of a successful external call from agent to remote KW according to an embodiment of the present invention.

FIG. 18 is a process flow diagram showing the process of a failed external call according to an embodiment of the present invention.

DESCRIPTION OF THE PREFERRED EMBODIMENTS

FIG. 1 is an exemplary overview of a multimedia-interaction storage system within communication-center architecture 9 according to an embodiment of the present invention. Communication center 9 is illustrated solely for the purpose of illustrating just one of many possible system architectures in which the invention may be practiced. Center 9, which in a preferred embodiment comprises both conventional and data-network telephony (DNT) apparatus, is exemplary of an architecture that could facilitate a network operating system such as CINOS (known to the inventor). Communication center 9 may be assumed to have all the internal components described in the background section such as agent workstations with LAN connected PC/VDUs, agent's COST telephones, and so on. Such a communication center operating an enhanced interaction network operating system such as CINOS would employ knowledge workers trained to interact with associates, clients, and in some cases internal systems that require programming, scripting, researching, and the like.

For the purposes of this specification, a knowledge worker (KW) is a highly skilled individual that is at least trained in systems programming and implementation using software tools. A KW is also typically trained in the use of all supported communication media and applications that may be used with a network operating system. In many instances, a KW may also handle high level sales and service while functioning as an agent for the communication center both inside the center and at a client's location. However, as described in the background section, a KW away from home (in the field) will not generally have full access to all communication center data and tools unless he/she carries a powerful computer station along, or commandeers a client's station having suitable connectivity and ability to perform all of the applications at the home station. Therefore, having many such highly skilled workers in the field and not in the communication center may be, at times, a considerable liability to the communication center, but unavoidable at times. It is to this aspect that the present invention mostly pertains.

Referring again to FIG. 1, a multimedia data-storage system represented herein by a centralized grouping of connected and labeled text blocks is provided and adapted to facilitate rules-based storage of all communication-center interaction between agents and clients including co-workers and associates. Such a representation illustrates an important part of CINOS function.

At the heart of the storage system is a mass-storage repository 11 adapted to store multimedia interactions as well as text-based related files. Repository 11 may utilize any form of digital storage technology known in the art such as Raid-Array, Optical Storage, and so on. The storage capacity of repository 11 will depend directly on its implementation with regard to the size of communication center 9 and predicted amount of data that will be stored and kept by the system.

In this example, repository 11 is divided logically into two sections. One section, multimedia information system (MIS) 15, is responsible for storing copies and records of all multimedia interactions, defined as media that is not text-based, such as audio, video, and graphics-based media. All multimedia interactions are stored in MIS 15 whether incoming, outgoing, or internal. A second section, herein referred to, as text section 13 is responsible for all text-based interactions as well as text versions and annotations related to non-text files.

Repository 11 is connected to a communication-center local area network (LAN) 45. Repository 11 is accessible via LAN 45 to authorized personnel within a communication center such as agents, KWs, or the like using computerized workstations connected on the LAN, and may, in some instances, also be made available, in full or in part, to clients and associates communicating with the call center. A network router (RTN) 19 is shown connected to LAN 45 via network connection 41. In this example, network router 19 is the first point within a communication center wherein data network telephony (DNT) media arrives. Network router 19 is exemplary of many types of routers that may be used to route data over LAN 45. An Internet-protocol-network-telephony (IPNT) switch 35 is connected to network router 19 via a data link. IPNT switch 35 further routes or distributes live IPNT calls that do not require routing to a live agent. IPNT calls that are routed to live agents are sent over connection 41 to LAN 45 where they reach agent PC/VDU's at agent and KW workstations connected to the LAN (PC/VDU is exemplary) or DNT-capable phones (not shown) as illustrated via directional arrows.

In the multimedia storage system represented herein, a KW such as one operating at a provided work station (PC/VDU 17) typically has access to all multimedia interaction histories that are stored in repository 11. CINOS applications (not shown) executable on workstations such as PC/VDU 17 empowers the KW to facilitate many tasks in the realm of communication center functionality. Such tasks include, but are not limited to, researching and creating virtually any type of system report regarding data held in repository 11, updating and creating new management applications that may alter or enhance CINOS functionality, and other such system-administrator-type duties. LAN 45 is the network through which the “in-house” KW is empowered to access such as a CINOS MGR server 29, repository 11, and other connected data sources and systems (not shown) that may be present in a communication center such as center 9.

By reviewing capabilities of the multimedia storage system of communication center 9, a full appreciation of the necessity of various in-house skills possessed by a KW, such as the skill of operating at station 17, may be acquired by one with skill in the art. Therefore, a detailed review of communication-center operation, particularly storing interactions follows.

Creating text-based versions of non-text multimedia transactions may, in some cases, be accomplished by an automated method. For example, a digital voice attendant 37 is provided and linked to IPNT switch 35. Digital voice attendant 37 may be of the form of a DNT-capable IVR or other digital voice-response mechanism as may be known in the art. Such automated attendants may interact with a voice caller instead of requiring a live agent. A speech-to-text converter 39 is provided and linked to voice attendant 37. As digital voice attendant 37 interacts with a caller, speech-to-text converter 39 converts the speech to text. Such text may then be stored automatically into text section 13 of repository 11 and related to the also-recorded audio data. Part of the purpose and rationale for the creation of text documents related to non-text files is that text can be more easily mined for content and meaning than non-text files.

It will be apparent to one with skill in the art that as speech recognition technologies are further improved over their current state, which is adequate for many implementations, reliable text versions of audio transactions are not only possible but also practical. Such speech-to-text conversions are used here only for the convenience of automation wherein no live attendant is needed to transcribe such audio data. The inventor is familiar with such converters as used in such as the CINOS system incorporated herein by reference. Such converters provide convenience in transaction recording but are not specifically required to achieve the interaction storage objectives of communication center 9. A KW such as one operating from station 17 may be called upon to create and set-up the various rules-based applications that are required for routing and determining when digital voice attendant 37 will interface with a client or associate.

An automated services system 43 is provided and has a direct connection to section 13 of data repository 11. System 43 is adapted to handle automated interaction and response for certain text-based interactions such as e-mails, facsimiles, and the like, wherein a complete text record of the interaction may be mirrored, or otherwise created and stored into text section 13. For example, a fax may be sent and mirrored into section 13 or, perhaps recreated using an optical character recognition (OCR) technique and then entered. Physical text-documents such as legal papers and the like may be automatically scanned, processed by OCR techniques, and then entered into text section 13 before they are sent to clients. There are many possible automated techniques for creating and entering text files into a database including methods for generating automated responses. A KW such as one operating at station 17 may be called upon to oversee the creation and operation of all automated services insuring such as prompt response time, queue management, accurate threading and organization into a database, updating or adding enhanced capability, and so on.

With respect to the dual telephony capability (COST/DNT) of communication center 9, a central telephony switch 21 is provided to be a first destination for COST calls arriving from, for example, a PSTN network. Switch 21 may be a PBX, ACD, or another known type of telephony switch. Internal COST-wiring 31 connects telephony switch 21 to agent's individual telephones (not shown). Switch 21 is enhanced by a computer-telephony integration (CTI) processor 25 running an instance of a T-server CTI suite and an instance of a Stat-server, which are software enhancements known to the inventor. Such enhancements provide CTI applications, such as intelligent routing, statistical analysis routines, and so on. CINOS as previously described and disclosed in the co pending prior application incorporated herein is adapted to be integrated with such software when present in a CINOS-enhanced communication-center. A KW such as one operating station 17 may be called upon to compile and analyze results provided from statistical analysis routines executed at processor 25 for the purpose of creating new routing rules of routines that further enhance functionality.

An intelligent peripheral in the form of a COST IVR 23 is provided for the purpose of interacting with callers seeking information and the like who do not require connection to a live agent at the communication center. IVR technology may comprise voice response, touch tone interaction, or a combination of such known technologies. IVR 23 is linked to processor 25 and also to automated services 43. An example of an IVR interaction may take the form of a presentation to a caller from the PSTN of options for using an automated service such as those described above, or perhaps waiting for a live agent. A KW such as a KW operating at station 17 may be called upon to create and install appropriate interaction scripts into IVR 23 for interaction with clients and associates calling in from the PSTN.

A CTI to DNT interface 27 is provided for the purpose of converting COST data to digital mode compatible with DNT so as to be adapted for digital storage and interaction according to CINOS functionality and enterprise business rules. Bi-directional arrows illustrated between interface 27 and IVR 23 represent the ability to route interactions in either direction. COST to DNT conversion may be accomplished in IVR 23 in addition to or in place of interface 27. The connection architecture presented herein is exemplary only.

A speech-to-text converter 33 is provided for converting audio from the CTI side to text for entering into text section 13 as was taught with regard to converter 39 on the DNT side. Actual recorded media interactions are illustrated entering MIS 15 after text versions are rendered and entered into section 13 however this is not required. In some instances text versions of multimedia interactions may be rendered after the interaction is stored. There is no limitation regarding sequence. It is sufficient to say that converters 39 and 33 are capable of real-time conversion and entry.

Server 29 shown connected to LAN 45 is adapted to host a CINOS MGR (operating system) application, which provides control and organization with regard to various functions provided by the CINOS system as a whole. The storage architecture represented herein by the described text blocks, and all it encompasses in this embodiment, is meant only to be an example architecture as may be dedicated to the storage and organization of communication-center data according to enterprise rules.

It will be appreciated by one with skill in the art that a network operating system including a system for automatically storing and recording virtually all communication center transactions requires substantial skill in set-up, implementation, and administration both on the COST side and the DNT side within a communication center such as center 9. Moreover, a substantial network operating system such as CINOS has client-side software applications that subscribers or associates must utilize in order to achieve full seamless interaction with agents and subsystems operating according to the system parameters. In some cases, the operating system may span several communication centers over a large technical campus connected by a WAN. This fact requires that system administrators and troubleshooters be available to assist in facilitating and preparing client and associate CPE for interacting with communication center equipment and software according to system parameters.

If a KW such as one operating at station 17 could be mobilized to operate effectively outside of communication center 9 such as at a client location, and still be able to service center 9 from the field, then an enterprise hosting center 9 and perhaps other like centers could save considerable resources associated with training and expenses incurred for maintaining a larger number of fixed KW's.

The inventor provides a method and apparatus whereby such a mobile KW could have full and unfettered access to virtually all data systems and sources housed within his home communication center without having to carry a powerful station or inconveniencing a client by commandeering client resources. This inventive method and apparatus is described below in enabling detail.

FIG. 2 is a block diagram illustrating a connective relationship between a proxy server 49 and a hand-held computer 47 operated by a mobile KW according to a preferred embodiment of the present invention.

Hand-held computer 47 has a CPU 63, a memory 57, a video adapter circuitry 55, and a modem 65 all communicating on bus 59. Video circuitry 55 drives a display 61. Memory 57 may be any of a number of types, such as flash, random access (RAM), read-only (ROM) or similar type, or a combination of these. There may be other components as well, but these are not shown to facilitate description of the unique aspects of this embodiment of the invention. The hardware arrangement is intentionally shown as general, and is meant to represent a broad variety of architectures, which depend on the particular computing device used. Possibilities include many types of portable hand-held computers and also adapted cellular phones capable of receiving and sending video. A mobile KW would use such as device for communication and data access while in the field.

Proxy-Server 49 is a relatively sophisticated and powerful computer typical of computers used as WEB servers, although the use in this embodiment of Proxy-Server 49 is not the conventional or typical functions of a WEB server as known in the art. Proxy-Server 49 has a CPU 69, a memory 71, and a means of connecting to a data network such as the Internet. The network connecting means in this embodiment is a modem 67 communicating on a bus 73. In other embodiments the network connecting means may be a network adapter or other.

Modem 67 in the embodiment shown is compatible with modem 65 in computer 47. A communication link 66, which may be facilitated by a telephone line or a wireless connection, facilitates communication between computer 47 and server 49. The means of connection and communication can be any one of several sorts, such as a telephone dial-up, an Internet connection through an ISP, or a cell telephone connection, wireless IP networks or other wireless link, including private cell or wireless WAN or LAN. A communication port 75 connects to communication link 77 providing communication, in this case, through the Internet, to a suitable station or server in communication center 9 of FIG. 1. In this example, the linked station is preferably the KW's own home-center workstation or PC/VDU 17 from FIG. 1.

Port 75 and link 77 may also be any one of several types, or a combination of types. In some embodiments, server 49 and station 17 will be nodes on a local area network (LAN) covering a large technical campus, and the link between the two servers will be a serial network link with port 75 being a LAN card according to any of a number of well-known protocols. In other embodiments link 77 may be a telephone line, and port 75 will be a dial-up telephone modem. In still other embodiments, this link could be a parallel communication link. This link could also be through the Internet or other wide area network.

Proxy-Server 49 exists in this embodiment of the invention to perform functions enabling hand-held computer 47 to operate as an apparently powerful web-browsing machine, even though the stand-alone capability of computer 47 will not even begin to support such functionality. As is well known in the art, for a computer to be a fully functional web-browsing system requires a high-performance CPU and execution of relatively sophisticated web-browsing and display applications. Such a computer typically has to operate, as described above, at or above a million instructions per second.

Proxy-Server 49 executes a program 53 the inventor terms an Inter-Browser. The Inter-Browser combines functionality of a conventional web browser with special functions for recognition of and communication with hand-held computer 47. Commands from computer 47, such as, for example, a command to access a WEB page on the World Wide Web, or a server or station such as station 17 within a home communication center such as center 9, are received by Proxy-Server 49 operating the Inter-Browser program, and acted upon as though they are commands received from a conventional input device such as a keyboard.

Following the example of a command communicated over link 66 from computer 47 for accessing station 17, shown herein and in FIG. 1, Proxy-Server 49 accesses the appropriate server (in this case station 17) over link 77, and transmits the appropriate data over link 77. Proxy-Server 49 therefore has HTML and TCP/IP capability for accessing source data over the Internet. By hosting other routines that allow interface with data systems, data sources and such as station 17, a KW may have full access to virtually any type of data or software tools that he could access from his station if he were operating from within center 9.

Proxy-Server 49, instead of displaying the downloaded data (or playing video and/or audio output, as the case may be, depending on the downloaded data), translates the data to a simpler communication protocol and sends the data in a TCP/IP protocol to computer 47 for output over link 66. Link 66 becomes a dedicated TCP/IP pipe to and from Proxy-Server 49. Proxy-Server 49 thus acts as a proxy for computer 47, performing those functions of WEB browsing and data download that computer 47 cannot perform under its own computing power.

Computer 47, through execution of a program the inventor terms a NanoBrowser 51 sends commands entered at computer 47 over link 66 to Proxy-Server 49 and accepts data from Proxy-Server 49 to be displayed on display 61. Data is transferred in a protocol the inventor terms HT-Lite. The NanoBrowser also provides for interactive selection of links and entry into fields in displays, as is typical for WEB pages displayed on a computer screen. The NanoBrowser provides for accepting such entry, packaging data packets in TCP/IP form, and forwarding such data to Proxy-Server 49, where much greater computer power provides for efficient processing.

One of the processing tasks that has to conventionally occur at the browser's computer is processing of received data into a format to be displayed on whatever display the user has. There are, as is well known in the art, many types of displays and many display modes. These range all the way from relatively crude LCD displays to high-resolution, multi-color displays. There are, in addition, a number of other functions that have to be performed conventionally at a user's computer to interact effectively with the WWW. For example, audio and video and some other functions typically require supplemental, or helper, applications to be installed on or downloaded to a field unit to process audio and video data and the like.

Most data transferred by WEB servers assumes relatively high-end displays, such as color SVGA displays as known in the art. Data accessed through the Internet from such as MIS database 15 of FIG. 1 would also assume a high-end display and large file size dependent on the type of media accessed. In PDAs, cellular video phones, and digital organizers, such as those anticipated for use in the present invention, the displays are relatively low resolution, and are typically LCD in nature. In the system described with the aid of FIGS. 1 and 2, Inter-Browser program 53 at Proxy-Server 49 and the HT-Lite Nano-Browser 51 at hand-held unit 47 cooperate in another manner as well. When one connects to the Proxy-Server the hand-held unit, through the HT-Lite Nano-Browser program, provides a signature, which the Proxy-Server compares with logged signatures.

An ID match when connecting a hand-held unit to the Proxy-Server provides the Proxy-Server with information about the hand-held unit, such as CPU type and power, screen size, type and resolution, presence of a pointer device, and sound capability. The Proxy-Server then uses this specific information to translate HTML and other files from the Internet to a form readily usable without extensive additional processing by the hand-held unit. For a small monochrome LCD display a 60 k/70 k JPEG file becomes a 2 k/4 k bit map, for example. Also, multi-file pages are recombined into single file pages. This translation also minimizes bandwidth requirement for link 66, and speeds transmission of data. In this way, a mobile KW may have access to all types of data sourced at his or her home communication center. Through proxy server 49, a KW may also initiate and receive multimedia interactions including high-end transactions while operating unit 47.

It is in this ability of the Proxy-Server to do the heavy computing, of which the translation of HTML files is a single example, that is responsible for a unique ability of hand-held devices in practicing embodiments of the present invention to accomplish functions that they could not otherwise accomplish, and to do so without inordinate usage of stored energy. In various embodiments of the present invention, hand-held devices with CPUs having an ability to run at from 0.001 to 0.05 MIPs can serve as WEB browsers, displaying WEB pages and allowing users to initiate on-screen links and to input data into input fields. Given the above example of MIPs requirement for WEB browsing, where currently available solutions may provide a 5× advantage, practicing the present invention can provide an advantage of up to 2000×, resulting in battery life approaching 2 weeks (given a 100 g battery weight), where expected battery life for similar functionality with a powerful CPU was calculated as 8 minutes.

As a given example of an instance wherein a mobile KW may provide full service to a home center, consider the following: Assume a mobile KW from center 9 of FIG. 1 is at a client premise installing network software and therefore not at center 9. He opens his or her hand-held device 47 and plugs in to a nearby telephone jack for the purpose of establishing a connection to proxy server 49, which in this case, may be implemented anywhere on the Internet. While he is configuring software on a client's computer, an important call from communication center 9 arrives through server 49 (hosted by the enterprise) to his hand-held 47. The call is pre-processed at proxy server 49 by Inter-Browser 53 and transmitted over link 66 to device 47 where it is displayed according to device parameters and rules associated with Nanno-Browser 51.

Suppose that the call requests that the KW rewrite a script used in such as digital voice attendant 37 because the current message has become corrupted or is not playing properly. The KW may then initiate a multimedia call to his resident workstation such as station 17 (FIG. 1) through proxy 49 by way of link 77. The call would arrive at router 19 and be routed directly over link 41 to station 17 based on identity thus by-passing normal DNT call handling routines. Part of the call includes a command to allow the KW to control the operation of station 17 by proxy. He may then use command keys to cause Inter-Browser 53 to browse a list of pre-prepared DNT scripts stored at station 17. Such a list may appear as a text summary on such as display 61 of device 47. The KW may then scroll through and select a script thus issuing a command to station 17 (by proxy) to access attendant 37 (FIG. 1) and replace the message which is overwritten by the new one.

It will be apparent to one with skill in the art that there are a wide variety of interaction possibilities by virtue of the method and apparatus of the present invention. In the cited example, a DNT call was made to the KW's computing device 47. Therefore, proxy 49 acts in one aspect as a call router. In another embodiment, a KW may accept a cellular call or a COST call and respond to the request-using device 47.

In still another embodiment, a KW operating a portable device such as device 47 may temporarily plug in to any connected LAN network such as may be found connecting a large technical campus or the like. Upon plugging in, the KW may initiate an outbound-call to server 49 in the Internet and receive a temporary IP address and device authentication for communicating with such as center 9.

To practice the invention, given an accessible WEB server configured as a Proxy-Server according to an embodiment of the present invention, one needs only to load HT-Lite NanoBrowser software on a computer and to provide Internet access for the computer, such as by a telephone modem. In many cases, candidate computers have built-in modems. In other cases, an external modem may be provided and connected. In the case of hand-held devices, such as PDAs and organizers, some have an ability to load software via a serial port, a PC card slot, through the modem extant or provided, or by other conventional means. In some cases, all operating code is embedded, that is, recorded in read-only memory. In some of these cases, adding HT-Lite routines may require a hardware replacement. In virtually all cases of hand-held devices, however, the necessary routines can be provided.

One of the components of the HT-Lite Nano-Browser software (51) is a minimum browser routine termed by the inventor a Nano-Browser. The Nano-Browser is capable of exerting a URL over the modem connection to access the Proxy-Server. Theoretically, one could exert a URL of a WEB site other than the Proxy-Server, but the result would be an unusable connection, as the small hand-held unit would not be able to handle the sophisticated data provided to be downloaded unless it were such as e-mail or other simple data.

Connection to the Proxy-Server provides the Proxy-Server with information as to the KW and the KW's equipment. These operations proceed in a manner well known in the art for such log-on and security transactions. Once access is extended to the KW, an interface is provided for the KW to browse in a manner very similar to well-known WEB interfaces. That is, the KW's display (61) provides an entry field for a URL which is asserted by an enter key or the like. There may also be an address book for often-visited sites, as is common with more powerful machines.

Similarly, there are no strict requirements for the location of Proxy-Server 49 or of accessible data sources or home stations in embodiments of the present invention. No restrictions are placed on such locations beyond restrictions on servers/nodes in general. In one embodiment, a corporation with multiple and perhaps international locations may have a local area network with one or more Proxy-Servers, and employees, particularly those employees whose job functions require travel, are provided with hand-held digital assistants according to an embodiment of the present invention. Multiple functions are then provided over Internet connection in Internet protocol, far beyond what could otherwise be provided with small and inexpensive units; and battery life for these units (device 47) would be far beyond what would otherwise be expected. Furthermore, a company could reduce or streamline a force of KW's to a smaller number of mobile KW's with enhanced portable devices such as device 47.

It will be apparent to one with skill in the art that the device-proxy method such as the one described above could be applied to a wide range of communication center architectures and network operating systems without departing from the spirit and scope of the present invention. A KW operating a device such as device 47 may operate while traveling to or from client locations as well as on-site at a client location. Types of devices used to communicate with proxy server 49 may vary without departing from the spirit and scope of the present invention. For example, PDAs, small notebook computers, some cellular telephones, CE type machines; all may be adapted for a proxy relationship.

Extended Management Control

According to another embodiment of the present invention an enhanced method and system is provided for enabling full and unobstructed access to contact center services and data for remote knowledge workers, including provision of full state and interaction management capabilities to the center managing the knowledge workers. The method and apparatus of the present invention is described in enabling detail below.

FIG. 3 is an architectural overview of a state and interaction management system implemented from a contact center 300 according to an embodiment of the present invention. Contact Center 300 can be employed in any mix of communication environment. For example, in a dually-capable COST/DNT multimedia environment, in a COST only environment, or in a DNT only environment. In the present example, a COST environment is illustrated. Likewise, one with skill in the art will recognize that there may be more and different types of known communication center equipment present and cooperative with the system of the invention other than what is illustrated in this example without departing from the spirit and scope of the present invention.

Center 300 utilizes a central office telephony switch 316, which in this case, is a private branch exchange (PBX) switch. Switch 316 may also be an automated call distributor (ACD) or another known type or manufacture of telephony switch. Switch 316 is a relatively dumb switch, but is enhanced for intelligent routing and control by a CTI processor 317 running an instance of CTI transaction server (T-Server) software. CTI enhancement in this example is driven by T-Server software, which is an application that controls switch 316 and provides the intelligent computerized rules and executable routines for interaction management and state detection and management. A typical CTI link 315 connects processor 317 to PBX switch 316 in this example.

An agent workplace 319 is illustrated within the domain of center 300. Workplace 319 is adapted minimally in this example with an agent desktop computer 320 and an agent telephone 321. It will be apparent to one with skill in the art that there will, in actual practice, be typically many agent stations provided and adapted for normal communication center routine business and communication. The inventor illustrates only one station and deems the illustration sufficient for the purpose of teaching the features of the present invention in an enabling way.

In this case, agent telephone 321 is a COST telephone connected to PBX switch 316 by standard internal telephony wiring. Agent desktop 320 is connected to a communication center LAN illustrated by a LAN network 318 labeled T-Lib (for transaction library). A transaction library contains all of the business and routing rules applied to normal center interaction and operation. It may be assumed in this example, that other equipment (not shown) is connected to LAN 318 such as other agent stations, a customer information system, a product history database, and many other equipment types both client-oriented and service-oriented.

An agent illustrated herein as agent 322 uses telephone 321 and desktop computer 320 for the purpose of handling routine interactions such as purchase orders, order status reports, internal logging and reporting, and other tasks. In one embodiment, telephone 321 may be an IP-capable telephone and also may have a sound connection to desktop computer 320.

A COST telephony network 303 is illustrated in this example as a preferred telephony network bridging customers to center 300 using COST technology. Network 303 is a public telephony switch notably most local to center 300, Switch 332 is the last routing point in network 303 before making connection to switch 316 in a preferred embodiment. In one embodiment, switch 323 is CTI-enabled similarly to switch 316 within center 300 and communication center routines can be executed at switch 323 over a separate network connecting the CTI processors associated with both switches 316 and 323.

A customer 301 and a customer 302 are illustrated in association with telephone network 303, which is a public switched telephone network (PSTN) in this example. Customer 302 is illustrated as placing a call to center 300 through switch 323 and switch 316. In normal practice, the call of customer 302 will be internally routed using CTI intelligence to an agent or automated interface within center 300. In this case agent 322 receives the call on telephone 321. Desktop 320 will display any pertinent customer information obtained from pre-interaction with customer 302 or from data sources internal to center 300, or both.

A knowledge worker workplace 310 is illustrated in this example and is associated with communication center 300 by a network link 314 adapted for ISCC protocols. ISCC is an acronym for the well-known International Symposium on Computers and Communications. ISCC-developed protocols may be assumed to be practiced over network line 314 including a Flexible Interconnecting Protocol (FLIP).

It may be assumed then, in this example, that KW workplace 310 is located remotely from center 300 and outside of the physical domain of center 300. Workplace 310 may be associated with other KW workplaces in a remote contact center. In another embodiment, workplace 310 may be a home-based workplace. In still another embodiment, workplace 310 may be in a state of mobility such as in a vehicle or at a remote customer worksite. KW workplace 310 has a desktop computer 311 (or equivalent) and a KW telephone 312. A knowledge worker (KW) 313 receives calls from PSTN 303 that are directly placed from customers such as from customer 301, or calls that are received to and then redirected from center 300.

As described above, KW workplace 310 is not physically part of center 300 in terms of residing within a same building or physical structure. Rather, worker 313 is operating from a remote location. A major difference between the architecture of agent 322 and knowledge worker 313 is that worker 313 has no CTI link between a local switch and center 300. In this example, a local switch 304 is illustrated and represents a local network switch (PSTN) presumably closest to KW 313. In practice however, if workplace 310 is mobile, such as working while traveling, there may not be a specific permanent local switch from whence calls arrive to KW 313.

It will be recognized by one with skill in the art that in the mobile sense, even in a wireless and semi-permanent networked environment, the fixtures illustrated within workplace 310 may vary widely. For example, telephone 312 may be a cellular telephone with Internet capability and desktop 311 may be a PDA or a laptop. In a fixed but remote location such as a remote knowledge worker contact center, individual knowledge workers may still be highly mobile but connected to communication to a LAN inside the center using a variety of communication devices.

To facilitate connection from center 300 to knowledge worker workspace 310, a programmable T-server/Processor 305 is provided and distributed on a data packet network (DPN) such as, for example, the well-known Internet network. If workplace 310 is part of a permanent contact center operating remotely from center 300, then switch 304 and processor 305 may be part of the equipment maintained in the contact center. However, for knowledge workers that are home agents or highly mobile, then switch 304 and processor 305 are network level systems, switch 304 in the PSTN and processor 305 in a private or public DPN.

The fact that there is no CTI link to center 300 means that under normal circumstance, the activities of KW 313 in workplace 310 cannot be managed. The system of the invention is enabled by a software platform known to the inventor as a Knowledge Worker Platform (KWP) that functions in cooperation with hosting equipment, namely processor 305, to alleviate the requirement for a hardwired CTI link or other complicated connection methods, system dependant CPE, or complex client software applications. KWP is a proxy agent that receives KW status information (e.g. ready or not ready) from a KW device such as from desktop 311 and sets the information within CC environment at center 300. Status reporting is used for determining KW availability for routing determination. KWP also supplies the KW device with call-related information (e.g. customer/product information) when an event is routed.

Workplace 310 is connected to processor 305, running an instance of programmable T-server, by a network link 308. In this case, processor 305 is accessible from desktop computer 311. In this particular embodiment, desktop 311 and telephone 312 are permanent fixtures and workplace 310 is part of an established physical center. In this case, link 308 may be a LAN network providing connectivity to other KW stations. Similarly, telephone 312 would be just one of many connected to switch 304 by internal telephone wiring. In this case, telephone 312 is also connected to desktop 311 by a cable so that desktop 311 may monitor call activity on telephone 312. It will be appreciated that there are many other possible architectural scenarios both fixed and mobile using wireless technologies.

Desktop computer 311 has an instance of agent desktop (AD) application installed thereon similar to a traditional application expected for a traditional in-house desktop like desktop 320 manned by agent 322 within center 300. However, the program on desktop 311 is modified to interact with KWP running on processor 305. KWP (processor 305) and AD (KW desktop 311) exchange information including Transaction Library data (T-Lib), Knowledge Worker Protocol (KW Protocol), and Interaction Preview Data Protocol (IPDP). Data links 307 and 309 are logical only and all data shared between processor 305 and desktop 311 may travel over a single physical or wireless data connection.

The AD application running on desktop 311 may be adapted to run on virtually any network-capable device such as a cellular telephone with display, an IP telephone, a PDA, a paging device, and so on. The only modifications required for AD at workplace 310 are the application program interfaces required to work with data that is not in standard CTI format. In a preferred embodiment, KWP uses Extensible Markup Language (XML)-based protocol for device independent presentation and Extensible Style sheet Language Transformation (XSLT) scripts for transforming XML source data to, for example, HTML data or other data formats to accommodate device-dependent data presentation requirements. Basically XSLT is an XML processing language known in the art.

It is important to note herein that the models for KWP and AD are the standard T-Server and agent desktop models. Appropriate extensions are made to KWP and AD to enhance capability for dealing with KW protocol and added T-Lib entities. For example, the model for a knowledge worker is an extension of the model for a standard agent. Therefore, attributes of the KW model do not exist in the standard agent model. These attributes or object entities are added to the standard T-Lib for KW use. The extended attributes define the separation of remote KW characteristics and function constraints from those of a regular CTI agent.

In practice, CTI telephony capability is extended to KW 313 by way of link 314, 308, and the adapted applications KWP and AD. Switch 304 remains a dumb switch having no CTI control. For example, assume customer 301 has a direct number to telephone 312 and places a call to KW 313. The call request is routed through switch 323 to switch 304 where notification of the call exemplifies a ringing event at telephone 312. At this point, center 300 has no indication or idea that KW 13 has a call-event ringing notification. However, when agent 313 takes the call, AD software on desktop 311 detects the activity and sends pertinent state data to KWP in processor 305, which in turn delivers the information to premise server 317.

Once server 317 has the information, other calls destined to telephone 312 can be managed and queued according to KWP reporting data. During interaction with the caller on telephone 312, KW 313 can use desktop 311 to obtain additional call and customer data, product data, history data and so on from center resources. Likewise, KW 313 may use terminal 311 to perform a call-related action such as hold, transfer, terminate, and other like commands. The command path in a preferred embodiment can be executed from server 317 and direct to a CTI-processor running an instance of T-Server (command path not shown) that intelligently enables switch 323 to terminate, interact or otherwise treat the event accordingly at switch 323. An advantage is that management information is available from the time of call receipt. If a queue is used, the information may be used for queue management purposes so that the center can tell whether or not a particular knowledge worker is not available. The center can then route calls destined to KW 313 based on availability.

In one embodiment, customer 302 places a call to KW 313 the event routed through switch 323, and switch 316. By identifying the DN as that of KW 313 (telephone 312) CTI messaging takes place between switch 316 and the Premise T-server application on processor 317. Server 317 then communicates through ISCC link 314 to the Programmable T-Server application on processor 305 enhanced as KWP. KWP messages with AD at desktop 310 to determine availability of DN (telephone 312). AD checks telephone activity by link 306 and if available responds along the reverse chain of links. Assuming availability then switch 323 can seamlessly re-direct the event to switch 304 by command from processor 317 and cause a ringing event at telephone 312. This assumes that processor 317 is connected to a like processor at switch 323. Otherwise, the call can be rerouted from switch 316 through switch 323 to switch 304. Link 306 is virtual in the sense that telephone activity at telephone 312 can instead be monitored from switch 323 if it is CTI-enabled and has a link to processor 317.

Outbound calls, inbound calls, and KW to KW remote calls can be monitored and reported in terms of state activity and availability. Assume, for example, that KW 313 places an outbound call from telephone 312 destined for telephone 321 in agent workplace 319. AD running on desktop 311 detects the outbound DN and uploads pertinent data to processor 305 whereupon KWP sends appropriate request for availability to Premise T-Server 317 controlling switch 316. Premise T-server 317 has information pertinent to the activity state and availability of agent 322 in his workplace 319 by way of LAN connection 318. Returned data follows the reverse chain and may show up on desktop 311 before the ringing event has expired. A wealth of information can be propagated between KW 313 and center 300.

Data about callers and contact center service tools and full database access is made available to KW 313 on desktop 311 using KWP and AD applications. If there is no monitoring capability between the device that KW 313 receives an event on and the computing platform of KW 313, then KW 313 may have to manipulate AD on the computing platform in order to access center 300 for data pertinent to the event. In other embodiments the computing platform and the device used to receive events are one in the same such as a network-capable cellular telephone for example.

KW 313 can register any number of DNs from AD on desktop 311 to receive events when he or she is leaving workplace 310 and will be away for a period. In the case of a short distance, a wireless peripheral can be used to access center data through desktop 311 and a wireless telephone can be set-up to receive the events. There are many equipment variations that are possible.

The nature of the connection between KWP and a KW device can be configured according to a number of criteria and supported platforms. For example, a one-way connection can be utilized for practicing only KW status notification to center 300. A two-way connection can be practiced for call-related data propagation. In addition to dial-up techniques to facilitate the connection between KWP and a KW device, wireless and Internet Protocol (IP) connections can be implemented. It is also possible to practice the invention with a simple PSTN connection.

KWP architecture supports any existing media and platform. More specifically, KWP supports a traditional desktop with a data link (illustrated in this example), wireless linking for PDAs and wireless browser applications. KWP also supports conventional voice devices including but not limited to analog telephone, conventional IVR, and VoiceXML based IVR. Messaging protocols such as Simple Messaging System (SMS), Instant Messaging (IM), email. Internet markup languages such as traditional HTML-based languages are supported along with more recently introduced Wireless Application Protocol (WAP) and Wireless Markup Language (WML). More detail regarding the software platform of the invention and how it functions in telephony scenarios is presented below.

FIG. 4 is a block diagram illustrating system connection hierarchy according to an embodiment of the invention. In this simple example, KWP402 resides between the communication center environment (401) and the remote KW or KWs. Therefore, KWP 402 is a proxy-serving platform that is integrated as an extension of the CTI telephony platform generally described as the T-Server platform. In this example, CC Environment 401 is analogous to the capabilities of center 300 described with reference to FIG. 3 including any extension of those capabilities into the PSTN network by way of separate data network connections and CTI processor distribution to network level components.

KWP 402 is analogous to KWP running on processor 303 described with reference to FIG. 3. IP network 404 and PSTN network 403 illustrate exemplary communication networks used in communication. Other networks may also be substituted therfor or used in conjunction therewith. A plurality of KW devices is illustrated as examples of varying types of devices that may be used by a KW to practice the invention. A standard analog telephone 405a can be used in a simple embodiment to communicate with KWP through PSTN 403. IVR-based technology is used in this case to provide the KW with call and center-related data as well as for receiving routed events. A cellular telephone 405b is illustrated and can be adapted to communicate with KWP 402 through a COST connection or through a DNT connection. WAP and WML are supported so that XML-based data from CC environment 401 can be displayed on device 405b.

It is noted herein that AD, described with reference to FIG. 3, normally requires approximately 30 megabytes of disk space in a robust version for desktops and the like. Therefore, an AD-Lite application would be downloaded to device 405b according to storage availability. In another embodiment, AD may be combined with KWP at server side wherein AD is still personalized to the particular KW authorized to access it and operate it from device 405b.

A PC 405c is illustrated in this example and is analogous to desktop 311 described with reference to FIG. 3. A PDA 405d is illustrated in this example as a possible KW device that communicates to KWP through IP network 404, or can also be operated with a wireless connection through PC 405c as a host.

FIGS. 5 through 8 are block diagrams illustrating call control use cases according to an embodiment of the present invention. Referring now to FIG. 5, the basic advantage of KWP in that KW agent 501 can accept inbound calls form customers (502) wherein availability status, skill level, and other criteria can be provided to the communication center environment for the purpose of routing call 502. If the DN of KW 501 is not integrated with a KW computing platform, then KW 501 can still enter input from the KWP-connected computing platform when on call using an unregistered DN to retrieve data. At this point the communication center can track the activities and results based on KW data input. In another embodiment, the DN of the KWs receiving telephone can be set in the CC environment wherein a network level switch enhanced by CTI software can monitor state, determine best routing, and initiate data transfer of call-related and center-related data to the KW without first party input.

Referring now to FIG. 6, KW 601 can initiate an outbound call (602). As an extension to traditional outbound dialing, a preview-dialing mode 603 is supported which includes preview dialing notification caused by outbound contact (605) and a preview-dialing mode supported by Internet suite (605) for IP mode.

Referring now to FIG. 7, a KW (701) can place or receive internal calls (702) from other knowledge workers. This includes an internal call without notification (703), an internal call with notification (707). An internal call with notification includes an option (708) for preview answer of the internal call associated with a manual agent reservation. There are several extended options including an external call (709) via RP queue performed by an external T-Server, an internal call (706) from a center agent performed by the external T-Server, and an internal call (704) from another KW. Option 704 can be extended to an option of internal call (710) from a KW performed by an external programmable T-Server, or an option of internal call (705) from a KW performed by a local programmable T-Server.

Referring now to FIG. 8, KW 801 can initiate more complicated interactions such as a two-step transfer (802), a two-step conference (803), and a hold and retrieve (804).

FIG. 9 is a block diagram illustrating components of the Knowledge Worker software and integration thereof to a communication center framework. The KWP 901 of the present invention includes a server application 904, which is analogous to programmable T-Server and KWP software running on processor 305 described with reference to FIG. 3 above. A KW desktop or “client” application 903 is also part of KWP 901. KW desktop 903 is analogous to AD running on desktop 311 described with reference to FIG. 3.

KWP communicates with a communication center (CC) Platform 902 over a data link (908, 907) that supports ISCC protocol. Link (908, 907) is separated in terms of element number to show communication of two separate components in this example. However, the physical link is analogous to link 314 described with reference to FIG. 1.

CC platform 902 includes a configuration server 905 and standard premise T-Server 906. Configuration server 905 is a software implement that is used to configure and update KWP/programmable T-server 904. In turn, KWP/T-Server programs KW desktop 903 if required. As was described further above, KWP 901 is an extension of CC framework. For example, T-server 906 serves as a basic model whereas KWP/T-Server is extended in functionality by additional attributes and capabilities.

Existing T-Library (T-Lib) protocol is used to build additional KW messaging between KWP/T-Server and client the application 903. Standard agent desktop applications are extended to provide KW functionality.

FIG. 10 is a block diagram illustrating components of the knowledge worker platform 901 of FIG. 9. As described with reference to FIG. 9 above, KWP 901 comprises a KW desktop application 903 and a KW T-Server application 904. KW desktop application 903 comprises an agent desktop application known to the inventor as Contact Navigator given the element number 1009. Contact Navigator 1009 utilizes a Transaction Library or T-Library 1008, which contains all of the required business and routing rules and object entities needed to build useful communication between two physically disparate systems namely, the CC platform and the KWP. By themselves, navigator 1009 and library 1008 are identical to the desktop application contained within the physical contact center domain analogous to AD running on agent desktop 320 in center 300 described with reference to FIG. 3 above.

In this example, desktop 903 is enhanced with KW extension software 1010. KW extension 1010 contains all of the attributes that facilitate the added capabilities of a KW desktop over a standard model desktop. T-Lib 1011 is thus enhanced with the appropriate components defined by the extension. It is noted herein that since KW desktop 903 is based on the standard desktop model (contact navigator) added capability can be remotely programmed thereto using the configuration server described with reference to the CC platform of FIG. 9. The appropriate components are downloaded to KW extension 1010 for KW use.

KW desktop 903 has connection with KW T-Server 904 as described further above in this specification. KW T-Server 904 is partitioned into two parts, a T-Server common part 1001 and a KW specific part 1002. KW T-Server 904 is also enhanced with ISCC communication capability via ISCC protocol 1003 for the purpose of economic communication with the contact-center platform.

One main goal of the invention is to maintain separation of KW specific part of T-Server functionality from the standard functionality of T-Server framework components at the host contact center. Such separation allows independent development and support for KWP 901 over contact center framework. Further, separation enables seamless integration of KWP with a variety of host customer-relation-management (CRM)-vendors.

KW protocol is provided instead of traditional CTI protocol. KW protocol, shown exchanged over logical link 1006 between the desktop and the T-Server provides CTI like messaging capability. This means that any KW desktop that registers a DN with KW T-Server 904 establishes telephony switch functionality at the contact center for servicing those registered DNs. KW protocol carries CTI like messages regarding real-time status of any registered DNs from KW desktop to KW T-Server. Various call-control messages are supported like TmakeCall, TanswerCall, TreleaseCall, THoldCall, and so on. These messages are treated as CTI messages that inform KW T-Server 904 of status of a particular interaction.

The structure of messages in KWP is presented below.

The KWP message is encoded in a KVList data type that enables future extension of KWP without breaking compatibility with older applications.

KVList Structure

The following code exemplifies the structure of a KVList:

typedef enum { KVTypeString, KVTypeInt, KVTypeBinary, KVTypeList, KVTypeIncorrect = −1 /* used for error indication only */ } TKVType; struct_kv_pair { TKVType type; char *key; int length; union { char *_string_value; int _int_value; unsigned char *_binary_value; struct kv_list *_list_value; } _value; #define string_value _value._string_value #define int_value _value._int_value #define binary_value _value._binary_value #define list_value _value._list_value struct_kv_pair *kv_next; struct_kv_pair *kv_prev; }; typedef struct _kv_pair TKVPair struct kv_list { struct _kv_pair *list; struct _kv_pair *current; struct _kv_pair *tail; }; typedef struct kv_list TKVList;

TEvent Structure

The following code exemplifies the structure of a transaction event (Tevent):

typedef struct { enum TMessageType Event; TServer Server; int ReferenceID; char *HomeLocation; char *CustomerID; TConnectionID ConnID; TConnectionID PreviousConnID; TCallID CallID; int NodeID; TCallID NetworkCallID; int NetworkNodeID; TCallHistoryInfo CallHistory; TCallType CallType; TCallState CallState; TAgentID AgentID; TAgentWorkMode WorkMode; long ErrorCode; char *ErrorMessage; TFile FileHandle; char *CollectedDigits; char LastCollectedDigit; TDirectoryNumber ThisDN; TDirectoryNumber ThisQueue; unsigned long ThisTrunk; TDNRole ThisDNRole; TDirectoryNumber OtherDN; TDirectoryNumber OtherQueue; unsigned long OtherTrunk; TDNRole OtherDNRole; TDirectoryNumber ThirdPartyDN; TDirectoryNumber ThirdPartyQueue; unsigned long ThirdPartyTrunk; TDNRole ThirdPartyDNRole; TDirectoryNumber DNIS; TDirectoryNumber ANI; char *CallingLineName; TDirectoryNumber CLID; TAddressInfoType InfoType; TAddressInfoStatus InfoStatus; TTreatmentType TreatmentType; TRouteType RouteType; char *ServerVersion; TServerRole ServerRole; TMask Capabilities; TKVList *UserData; TKVList *Reasons; TKVList *Extensions; TTimeStamp Time; void *RawData; TDirectoryNumber AccessNumber; TXRouteType XRouteType; TReferenceID XReferenceID; TKVList *TreatmentParameters; char *Place; int Timeout; TMediaType MediaType; /* added 7/15/99 ER#9462 */ TLocationInfoType LocationInfo; TMonitorNextCallType MonitorNextCallType; /*  * Used in RequestPrivateService/EventPrivateInfo:  */  TPrivateMsgType PrivateEvent; } TEvent;

Another protocol provided for use in practice of the present invention is known as Preview-Interaction-Protocol (PIP) to the inventor. Preview interaction protocol is illustrated as being exchanged between KW T-Server 904 and KW desktop 901 over logical link 1004. PIP provides an ability for a KW to preview incoming interactions before actually receiving them. In this way, a KW has the capability of accepting or rejecting an incoming interaction based on attached data such as user data attached with an incoming telephone call. This capability also allows the contact center platform to correctly process external call-control routines like external call, external transfer, external conference, and so on. All preview interaction messaging takes place between KW desktop 903 and KW T-Server 904.

T-Library functions as a messaging transport layer in the software communication scheme. In other words, particular T-Lib messages are used to carry KW protocol and PIP messages.

FIG. 11 is a configuration model 1100 for knowledge worker state information according to an embodiment of the present invention. Configuration-Management-Entities (CME) are configured into the system for active state and call control. CME configuration model 1100 is a typical CME configuration routine for configuring remote knowledge workers to practice the present invention. First a KW is configured with CfgPerson 1101. Secondly, the place or places of operation are configured with CfgPlace 1102. The relationship between person and place typically includes one place where a KW will receive interactions. However in some embodiments a KW may be live at one place and have automated services set up in another place. Therefore, the relationship between person and place in this CME model can be one to many.

Place 1102 has two basic attributes that must be configured. These are agent login (CfgAgentLogin) 1103 and DN (CfgDn) 1104. Agent login includes any pre-designed procedure deemed appropriate for a KW to login to the system of the invention. In some cases login may not be required in terms of passwords and so on. Simply opening a connection between the KW computing platform and the KW T-Server may be sufficient for login purposes. In some embodiments, KW platforms associated with automated systems may remain connected and, therefore logged in 24/7. In other cases, automated connection establishment and login may be pre-programmed so that the KW platform will login whether the agent is actually there or not.

CfgDn 1104 is used to register one or more KW DNs with the contact center environment, typically a CTI telephony switch. A KW may configure more than one DN with attached data as to what types of interactions should be routed to which DN. A DN may include one or more telephone numbers, cell phone numbers, an e-mail address, a virtual number for an automated system, an IP address and still other location identifications. One to many relationships between place 1102 and agent login 1103 are possible. Similarly, one to many relationships between agent login 1103 and CfgDn 1104 are possible.

CfgSwitch 1106 configures the acting telephony switch or switches practicing the present invention. This process uses a special KW gateway. CFGKWGateway enables the switch to differentiate KW telephony traffic from regular contact-center and other normal traffic. Switches with or without CTI links are configured if they are involved in KW interaction routing. CfgApplication 1107 is used to configure KWP software at the remote location. This configuration process includes configuring KW T-Server and KW desktop software. CME provides data sync methods for data synchronization, data transformation between customer main and central storage facilities and data transfer between directories by LDAP or preferably through XML and XSLT import/export mechanisms.

FIG. 12 is a data model for presenting an active knowledge worker state. The model of this example presents the various agent states that are implemented by KW T-Server 904 described with reference to FIG. 10 above. The basic reportable states are Agent Login, Agent Logout, Agent Ready, and Agent Not Ready. This model is the basic agent model for standard CTI-T-Server implementation as would be the case inside contact center 300 described with reference to FIG. 3. Hence the term agent can be replaced with the more appropriate term knowledge worker for remote implementation. The arrows represent all possible associations in the model. One with skill in the art will recognize that this is a basic example and that other reportable knowledge worker states may also be represented in this model. Similarly, this model may be applied to different types of interaction media including telephone interaction without departing from the spirit and scope of the invention.

FIG. 13 is a process flow diagram illustrating the sequence of a successful internal call. At step 1300 a KW initiates an internal call to another KW. This action can occur from a KW telephone or from a KW computing platform analogous to telephone 312 and desktop 311 of station 310 described with reference to FIG. 3. At step 1301, a KW T-Server analogous to processor 305 described with reference to FIG. 3 receives notification of the initiated call and sends a preview interaction message (PIM) to the destination KW. The PIM is forwarded before the call is dialed and gives the second KW a chance to decide whether or not he will accept the call based on the PIM data.

At step 1302, KW-2 receives and, in this case accepts the PIM from the KW T-Server. A dotted return arrow illustrates an acceptance response forwarded back to the T-Server. At step 1303, the T-Server dials the DN specified in the call initiation event. A notification of a dialing event (broken return arrow labeled Event Dialing) displays on the caller's computer platform or is activated on the caller's telephone with respect to KW of step 1300. There are many indication possibilities for a dialing event. A ringing event is also established by the T-Server at the computer platform or telephone of KW-2 as illustrated by the broken arrow labeled Ringing. At this particular moment it happens that KW-2 is on a current call. A pre-defined time period may be established for the ringing event so that KW-2 may, during that time, terminate the previous call and pick up.

At step 1304, KW-2 picks up the call. Detecting the pick up at step 1305, the KW T-Server establishes the connection between the KW of step 1300 and KW-2 of step 1304 as indicated by broken arrows. It will be apparent to one with skill in the art that there may be variations in this process for a successful internal call between 2 KWs without departing from the spirit and scope of the invention. Variations in the flow are dependant on actual events. For example, in the case that KW-2 could not terminate the previous call to pick up the initiated event before a sever timeout has occurred, a notification of not ready could be returned to the initiating KW. Similarly, KW-2 could opt to reject the call before it is made by rejection the PIM request.

FIG. 14 is a process flow diagram illustrating a variation of the sequence of FIG. 13 with a forced answer. In this example, steps 1400-1403 are identical to steps 1300-1303 described with reference to FIG. 13 above. Therefore, the same description given in the example above applies to steps 1400-1403 of this example as well.

At step 1404, there is a forced server time out indicating a forced answer mode. At step 1405, a ringing event is established at the station of KW-2 audible over telephone or audible and perhaps visible on the computing platform of KW-2. At step 1406 then, KW T-Server establishes connection for the dialed event. It is noted herein that event connection first connects the initiating party and then the receiving party as indicated by broken arrows A and B.

FIG. 15 is a process flow diagram illustrating the sequence of a failed internal call. At step 1500 a KW initiates a call to another KW as described with reference to the previous 2 examples. At step 1501, the KW T-Server sends a PIM request to the second KW (KW-2). However, upon reviewing the request, KW-2 decides not to accept the call and rejects the PIM in step 1502 as illustrated by a broken return arrow. The result of this action is that in step 1503, the KW T-Server returns an error message or notification to the initiating KW. It is noted herein that notification messages can take the form of a wide variety of media such as Voice over Internet Protocol (VoIP), IVR response, e-mail response, and son dependant upon media type and equipment.

FIG. 16 is a process flow diagram illustrating the sequence of an internal call with a forced timeout before PIM decision according to an embodiment of the invention. Steps 1600 and 1601 are identical to the first 2 steps of the previous examples. However, at step 1602 a forced server timeout occurs before KW-2 responds to the PIM request sent in step 1601.

At step 1603 the KW T-Server sends a timeout error notice to the initiating KW. In the meantime, the PIM request sent to KW-2 is still alive and pending. At step 1604 after the timeout occurs, KW-2 receives the PIM request and determines whether to accept or reject the call. If in step 1604 KW-2 accepts the request, then at step 1606 KW T-Server dials the DN number and subsequent steps for dial notification, ringing event notification and connection establishment occur as with a successful internal call. However, if KW-2 rejects the call event at step 1604, then at step 1605 KW T-Server sends an error notification back to the initiating KW as indicated by the broken return arrow.

FIG. 17 is a process flow diagram illustrating the sequence of a successful external call according to an embodiment of the invention. At step 1700 a center agent initiates a call to a remote KW. Initiation of the call can take place from the agent telephone or from the agent desktop analogous to telephone 321 and desktop 320 in workplace 319 of center 300 described with reference to FIG. 3. At step 1701 the desktop T Server opens a connection to a first local router or router 1. It is noted herein that the T-server implement may be in the agent desktop itself or it may be in a premise T Server processor accessible to the agent.

At step 1702 the first router local to the agent sends a request to a second router local to the KW to get an access number or DN. At step 1703 the second router forwards the request to the KW T-Server hosting the agent. It is assumed in this example that the KW in question is logged in. Otherwise, an error message (KW not available) would be returned to the initiating agent.

At step 1704 the KW T-Server sends a PIM to the KW having the requested access number or DN. The KW is now aware of the impending incoming call and can decide whether to accept or reject the call. In this case, the KW that will receive the call accepts the PIM request as indicated by the associated block below block 1704. At step 1705 KW T-Server requests call data from the second router. In the meantime, at step 1706 the second router gives the access number to the first router local to the agent.

At step 1707 the first router sends a call request to the premise T-Server. At step 1708 the premise T-Server extends the call request to the premise switch. At step 1709 the switch dials the associated DN and notifies the premise T Server in the first phase of dialing. At step 1710 the premise T-Server notifies the first router of the DN in phase 2 of dialing. At step 1711 the first router notifies the agent desktop of the dialing (phase 3). This manifestation may occur on the agent telephone, desktop or both.

At step 1712 the KW T-Server establishes a ringing event at the second router local to the KW in a first phase of ring notification. At step 1713 the second router establishes the ringing event at the KW station, for example, on the telephone or desktop or both. At step 1714 the connection is established between router 1 and router 2. A t step 1715, the connection is extended from router 1 to the calling agent. It is assumed in this example that the connection is a COST connection, however DNT interactions are similarly routed according to CTI rules.

It will be apparent to one with skill in the art that the steps described in this example may vary in number and order without departing from the spirit and scope of the present invention. For example, it may be that there are more than 2 routers involved in the connection path of the call. Similarly, server timeouts, agent availability, queuing requirements, and so on can change the nature and order of the described steps. The inventor intends that the presented example illustrate just one example of an external incoming call sourced from a center agent and destined to a remote knowledge worker according to a preferred embodiment.

FIG. 18 is a process flow diagram of a failed external call according to an embodiment of the present invention. Steps 1800 through 1804 are identical to steps 1700 through 1704 described with reference to FIG. 17 above for a successful external call from a center agent to a remote KW.

At step 1805 however, the KW decides not to accept the pending call and return a rejection response. At step 1806 the KW T-Server sends a data request to R-2 for call data. At step 1807 R-2 sends an error message to KW T-Server because of absence of call data due to KW rejection of PIM request. At step 1808 R-2 returns an error message to R-1 local to the agent regarding the earlier request for access number at step 1802. At step 1809 R-1 sends an error message to the agent station as indicated by a broken arrow. The error message may be that at this time KW John in not available due to current load or duties. The fact that KW decided not to take the incoming call from the agent can be expressed in a variety of syntax. Perhaps the agent could elect to receive a call back from the KW at a more advantageous time or perhaps the agent can be prompted to place the call again at a latter time period.

It will be apparent to one with skill in the art that remote call control is possible and practical using the method of the present invention without a functioning CTI link provided between the center and the local switch closest to the KW center or other remote KWs. Incoming calls can be routed to any remote KW with a connection to the KW T-Server according to availability, skill level, and so on. In a preferred embodiment intelligent routing of events to remote KWs can be made at the premise of the communication center or at network level. In the case of network level routing, a network T Server must be provided to enhance the involved network level switch or switches.

If all KWs are, for some reason, unavailable at the time of a call attempt, then IVR functionality can be utilized to prompt the caller to leave a number for a return call. In this embodiment, premise T-Server function enables outbound dialing and connection when it is determined that a KW becomes available to take calls. In one embodiment ISCC protocol enables a center agent engaged in a call to transfer the connection to a remote KW with data attached to the event. XML-based data and XSLT transformation capability renders the attached data into the desired format for dissemination at the KWs end device whether it is a voice only device or a display-capable/voice capable device, or even a display only device.

In another embodiment, the service-provider infrastructure (center) can partially monitor independent interactions through network signaling such as D-channel pinging, OSIG, or call progress detection mechanisms.

The method and apparatus of the present invention should be afforded the broadest scope in view of the many possible applications, many of which have been detailed above. The spirit and scope of the present invention is limited only by the claims that follow.

Claims

1. A system for managing remote agents for a communication center comprising:

a network-based facility controlling at least one routing point used by the communication center, including functions accessible to the agents and having data access to agent computing platforms and communication peripherals; and
a software suite distributed in part to the network-based facility and in part to one or more agents computing platforms and peripherals, the software suite including protocol for reporting agent status data;, wherein at least the software suite distributed to the network-based facility is an extension of a computer-telephony integration (CTI) software used in the communication center, wherein the software suite is adapted to format messaging and event-related data into a format useable on the one or more agents computing platforms, the software suite being further adapted to enable additional services by the remote agents, the enabling of additional services including routing communication events involving the remote agents via the software suite,
wherein the agent's computing platforms and peripherals are monitored for activity state by the network-based facility exchanging control messages and event related data.

2. The system of claim 1 wherein the network is the Internet network and the routing point is one of or a combination of a telephony switch, a service control point, and an Internet Protocol Router.

3. The system of claim 1 wherein the remote agents are distributed over the network.

4. The system of claim 1 wherein the software suite is an extension of a CTI software suite used in the communication center, the extended portion for parameterizing and enabling additional services and communication apparatus generic to the remote agents but not available within the center.

5. The system of claim 1 wherein the control messaging and event related data exchanged is formatted using Extensible Markup Language.

6. The system of claim 5 wherein Extensible Style Sheet Language Transformation is used to transform the Extensible Markup Language files into formats the format useable on the one or more agents computing platforms of the remote agents.

7. The system of claim 6 wherein the useable formats include HTML, HDML, WAP, and WML.

8. The system of claim 1 wherein an Interactive Voice Response system is used to exchange data with a remote agent receiving calls on an analog telephone.

9. The system of claim 1 wherein the remote agents establish one or more destination numbers for receiving events, the destination numbers to be set in for the period that the agent is logged into the system.

10. The system of claim 9 wherein the destination numbers include one or a combination of telephone numbers, fax numbers, Internet Protocol addresses, e-mail addresses, universal resource locators, and pager numbers.

11. A software suite executing from a memory media in a computerized appliance, for managing remote agents of a communication center comprising:

a client portion executing from a computerized device remote from the communication center comprising a contact navigation application, a contact extension application, and a code library; and
a server portion executing from a proxy server comprising a transaction management application, an agent specific application, and an application program interface;
wherein the client portion specifies functionality and reports state information of remote agents to the server application, the server application reports same under ISCC a protocol to a communication-center suite for routing purposes and wherein the communication-center suite provides event-related data to the server portion, which in turn transforms the data into data formats usable on various communication devices of the remote agent.

12. The software suite of claim 11 wherein the remote agents are part of a communication center network, the server portion functioning as the network access and agent monitoring point for the remote agents.

13. The software suite of claim 11 wherein the communication network includes the Internet network and the public switched telephony network.

14. The software suite of claim 11 wherein the remote agents are distributed over the network.

15. The software suite of claim 11 wherein the software suite is an extension of a CTI software suite used in the communication center, the extended portion for parameterizing and enabling additional services and communication apparatus generic to the remote agents but not available within the center.

16. The software suite of claim 11 wherein the ISCC protocols include Extensible Markup Language used to format messaging and event-related data.

17. The software suite of claim 16 wherein Extensible Style sheet Language Transformation is used to transform the Extensible Markup Language files into formats useable on the computing platforms of the remote agents.

18. The software suite of claim 17 wherein the useable formats include HTML, HDML, WAP, and WML.

19. The software suite of claim 11 wherein the remote agents establish one or more destination numbers for receiving events on the various communication devices, the destination numbers to be set for the period that the agent is logged into the system providing the software.

20. The software suite of claim 19 wherein the destination numbers include one or a combination of telephone numbers, fax numbers, Internet Protocol addresses, e-mail addresses, universal resource locators, and pager numbers.

21. A method for managing information about remote agents of a communication center for the purpose of intelligently routing events involving those agents comprising steps of:

(a) providing a software suite accessible to the agents for parameterizing and enabling additional services and communication apparatus generic to the remote agents but not available within the center;
(b) providing a network link between the software suite and software of the communication center; and
(c) routing communication events, involving the remote agents according to state and other information about the agents provided by and through the software suite.

22. The method of claim 21 wherein in step (a) the agents are accessible to the communication center through a combination of the Internet network and the public switched telephony network.

23. The method of claim 21 wherein in step (a) the software suite comprises a server portion and a client portion.

24. The method of claim 21 wherein in step (a) the software suit can be configured and updated from the communication server.

25. The method of claim 21 wherein in step (b) the network link supports ISCC protocol.

26. The method of claim 25 wherein the ISCC protocol includes Extensible Markup Language and Extensible Style Sheet Transformation Language.

27. The method of claim 21 wherein the client portion resides on one or more of the communication apparatus and the server portion resides on a server accessible to the one or more communication apparatus via a network link.

28. The method of claim 21 wherein in step (c) state information includes ready, not ready, logged in, logged out, and on call.

29. The method of claim 21 wherein in step (c) other information includes skill level, registered destination numbers, and communication device type and platform.

Referenced Cited
U.S. Patent Documents
3914559 October 1975 Knollman
4048452 September 13, 1977 Oehring et al.
4056683 November 1, 1977 Suehiro
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.
4944038 July 1990 Hardy 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.
5500889 March 19, 1996 Baker 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.
5652785 July 29, 1997 Richardson, Jr. 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.
5737691 April 7, 1998 Wang 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.
5835570 November 10, 1998 Wattenbarger
5835583 November 10, 1998 Hetz et al.
5838682 November 17, 1998 Dekelbaum et al.
5838768 November 17, 1998 Sumar et al.
5838773 November 17, 1998 Eisner 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
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
5946388 August 31, 1999 Walker et al.
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.
5974444 October 26, 1999 Konrad
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.
5995610 November 30, 1999 Smidt 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.
6009469 December 28, 1999 Mattaway 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.
6014711 January 11, 2000 Brown
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
6044142 March 28, 2000 Hammarstrom et al.
6044144 March 28, 2000 Becker et al.
6044146 March 28, 2000 Gisby et al.
6044368 March 28, 2000 Powers
6046762 April 4, 2000 Sonesh
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.
6076109 June 13, 2000 Kikinis
6078581 June 20, 2000 Shtivelman et al.
6078583 June 20, 2000 Takahara et al.
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.
6097792 August 1, 2000 Thornton
6097804 August 1, 2000 Gilbert et al.
6097938 August 1, 2000 Paxson
6098065 August 1, 2000 Skillen et al.
6101473 August 8, 2000 Scott 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
6108704 August 22, 2000 Hutton et al.
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ål
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 Beck 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.
6185184 February 6, 2001 Mattaway 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.
6188762 February 13, 2001 Shooster
6192122 February 20, 2001 Flockhart et al.
6192250 February 20, 2001 Buskens et al.
6192338 February 20, 2001 Haszto 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 Barskiy et al.
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.
6278976 August 21, 2001 Kochian
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
6341128 January 22, 2002 Svedberg
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.
6366656 April 2, 2002 Lee et al.
6366658 April 2, 2002 Bjornberg et al.
6366663 April 2, 2002 Bauer
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
6393278 May 21, 2002 Buchanan et al.
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
6401066 June 4, 2002 McIntosh
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.
6489954 December 3, 2002 Powlette
6490350 December 3, 2002 McDuff et al.
6493353 December 10, 2002 Kelly et al.
6493433 December 10, 2002 Clabaugh 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.
6519246 February 11, 2003 Strahs
6519617 February 11, 2003 Wanderski et al.
6532493 March 11, 2003 Aviani, Jr. et al.
6535492 March 18, 2003 Shtivelman
6535601 March 18, 2003 Flockhart et al.
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.
6560607 May 6, 2003 Lassesen
6563788 May 13, 2003 Torba et al.
6567854 May 20, 2003 Olshansky et al.
6581105 June 17, 2003 Miloslavsky et al.
6594269 July 15, 2003 Polcyn
6594347 July 15, 2003 Calder et al.
6597685 July 22, 2003 Miloslavsky et al.
6600733 July 29, 2003 Deng
6600822 July 29, 2003 Kamen
6603762 August 5, 2003 Kikinis
6603854 August 5, 2003 Judkins et al.
6611498 August 26, 2003 Baker et al.
6611590 August 26, 2003 Lu et al.
6614780 September 2, 2003 Hakim et al.
6614781 September 2, 2003 Elliott
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
6658389 December 2, 2003 Alpdemir
6661882 December 9, 2003 Muir et al.
6665395 December 16, 2003 Busey et al.
6665396 December 16, 2003 Khouri et al.
6668286 December 23, 2003 Bateman et al.
6678718 January 13, 2004 Khouri et al.
6681010 January 20, 2004 Anderson et al.
6687241 February 3, 2004 Goss
6690788 February 10, 2004 Bauer
6693893 February 17, 2004 Ehlinger
6704394 March 9, 2004 Kambhatla et al.
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.
6823197 November 23, 2004 Chen
6829349 December 7, 2004 Neale
6845154 January 18, 2005 Cave et al.
6847715 January 25, 2005 Swartz
6847825 January 25, 2005 Duvall et al.
6850602 February 1, 2005 Chou
6850614 February 1, 2005 Collins
6859529 February 22, 2005 Duncan et al.
6865267 March 8, 2005 Dezonno
6868391 March 15, 2005 Hultgren
6874119 March 29, 2005 Macleod Beck et al.
6876632 April 5, 2005 Takeda
6879586 April 12, 2005 Miloslavsky et al.
6882996 April 19, 2005 Preisig et al.
6898190 May 24, 2005 Shtivelman et al.
6903685 June 7, 2005 Arndt et al.
6907112 June 14, 2005 Guedalia et al.
6907455 June 14, 2005 Wolfe et al.
6910072 June 21, 2005 Macleod Beck et al.
6912272 June 28, 2005 Kirk et al.
6922411 July 26, 2005 Taylor
6922689 July 26, 2005 Shtivelman
6925161 August 2, 2005 Burg et al.
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.
6965870 November 15, 2005 Petras
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
7006614 February 28, 2006 Feinberg et al.
7020264 March 28, 2006 Neyman et al.
7031442 April 18, 2006 Neyman et al.
7036128 April 25, 2006 Julia 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 Beck 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
7245641 July 17, 2007 Kim et al.
7245711 July 17, 2007 Margolis
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
7277424 October 2, 2007 Dowling
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.
7457279 November 25, 2008 Scott 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
7564840 July 21, 2009 Elliott et al.
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.
7653744 January 26, 2010 Kanefsky 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
7957401 June 7, 2011 Zalenski et al.
8009821 August 30, 2011 Apparao et al.
8018921 September 13, 2011 Pogossiants et al.
8024401 September 20, 2011 Gurbani et al.
8031698 October 4, 2011 Neyman
8036214 October 11, 2011 Elliott et al.
8059812 November 15, 2011 Bundy
8068598 November 29, 2011 Russi et al.
8085761 December 27, 2011 Elliott et al.
8089958 January 3, 2012 Elliott 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.
8254404 August 28, 2012 Rabenko et al.
8254558 August 28, 2012 Minert et al.
8270421 September 18, 2012 Elliott 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.
8693347 April 8, 2014 Elliott et al.
9002920 April 7, 2015 Deryugin et al.
RE45583 June 23, 2015 Lockhart
9118781 August 25, 2015 Kavulak et al.
9241258 January 19, 2016 Ku et al.
9247053 January 26, 2016 Bruce et al.
20010000458 April 26, 2001 Shtivelman et al.
20010001150 May 10, 2001 Miloslavsky
20010005382 June 28, 2001 Cave et al.
20010008555 July 19, 2001 Bae et al.
20010011366 August 2, 2001 Beck et al.
20010013041 August 9, 2001 Macleod Beck et al.
20010014604 August 16, 2001 Kingdon et al.
20010023430 September 20, 2001 Srinivasan
20010023448 September 20, 2001 Hanhan
20010024497 September 27, 2001 Campbell
20010025309 September 27, 2001 Macleod Beck 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 Beck et al.
20010044828 November 22, 2001 Kikinis
20010047262 November 29, 2001 Kurganov et al.
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 Beck et al.
20020056000 May 9, 2002 Albert 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.
20020071529 June 13, 2002 Nelkenbaum
20020076031 June 20, 2002 Falcon et al.
20020078150 June 20, 2002 Thompson et al.
20020087648 July 4, 2002 Petrovykh
20020091527 July 11, 2002 Shiau
20020091726 July 11, 2002 Macleod Beck 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.
20020126678 September 12, 2002 Kelly 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.
20020174436 November 21, 2002 Wu et al.
20020176404 November 28, 2002 Girard
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.
20030161296 August 28, 2003 Butler et al.
20030161448 August 28, 2003 Parolkar et al.
20030179729 September 25, 2003 MacLeod Beck et al.
20030212558 November 13, 2003 Matula
20030216923 November 20, 2003 Gilmore et al.
20030219029 November 27, 2003 Pickett
20030220875 November 27, 2003 Lam et al.
20030229529 December 11, 2003 Mui et al.
20040006739 January 8, 2004 Mulligan
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.
20040054743 March 18, 2004 McPartlan 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.
20040223490 November 11, 2004 Donovan 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
20050047394 March 3, 2005 Hodson
20050128961 June 16, 2005 Miloslavsky et al.
20050147090 July 7, 2005 MacLeod Beck 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.
20060083357 April 20, 2006 Howell
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.
20070110043 May 17, 2007 Girard
20070127707 June 7, 2007 Koser 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.
20080025295 January 31, 2008 Elliott et al.
20080034354 February 7, 2008 Brughton 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.
20100106710 April 29, 2010 Nishizawa et al.
20100157979 June 24, 2010 Anisimov et al.
20100198930 August 5, 2010 Kikinis
20110099602 April 28, 2011 Apparao et al.
20110110363 May 12, 2011 Anandani
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.
20120177195 July 12, 2012 Elliott et al.
20120195415 August 2, 2012 Wyss et al.
20120250849 October 4, 2012 Liu et al.
20130016115 January 17, 2013 Minert et al.
20130070757 March 21, 2013 Elliott et al.
20130129067 May 23, 2013 Neyman et al.
20130230160 September 5, 2013 Neyman et al.
20140376708 December 25, 2014 Deryugin et al.
20140379936 December 25, 2014 Anisimov et al.
20150201021 July 16, 2015 Beck et al.
20150244870 August 27, 2015 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
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
1408678 November 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
61-51247 March 1986 JP
62-200956 September 1987 JP
63-149955 June 1988 JP
64-7460 January 1989 JP
64-77265 March 1989 JP
02-170756 July 1990 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-83771 March 1994 JP
06-90292 March 1994 JP
06-103058 April 1994 JP
06-121051 April 1994 JP
06-284203 July 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-212471 November 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-504305 July 1996 JP
08-214076 August 1996 JP
08-214346 August 1996 JP
08-510071 October 1996 JP
8-321885 December 1996 JP
8-329118 December 1996 JP
8-331618 December 1996 JP
09-036963 February 1997 JP
09-501812 February 1997 JP
09-504394 April 1997 JP
09-149137 June 1997 JP
09-163031 June 1997 JP
09-224093 August 1997 JP
09-508508 August 1997 JP
09-233118 September 1997 JP
09-265408 October 1997 JP
10-11374 January 1998 JP
10-13811 January 1998 JP
10-51549 February 1998 JP
10-093713 April 1998 JP
10-093716 April 1998 JP
10-504425 April 1998 JP
10-116249 May 1998 JP
10-143451 May 1998 JP
10-506766 June 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-512906 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-516795 December 2000 JP
2000-517142 December 2000 JP
2001-500677 January 2001 JP
2001-103533 April 2001 JP
2001-292236 October 2001 JP
2001-516993 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 62 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 82 January 2009 JP
4234926 March 2009 JP
4295186 July 2009 JP
4450515 April 2010 JP
2012-513725 June 2012 JP
10-2011-0098841 September 2011 KR
9208194 May 1992 WO
9401959 January 1994 WO
9429995 December 1994 WO
9508236 March 1995 WO
9520860 August 1995 WO
9533325 December 1995 WO
9614704 May 1996 WO
9620553 July 1996 WO
9623265 August 1996 WO
9627254 September 1996 WO
9701917 January 1997 WO
9712472 April 1997 WO
9713352 April 1997 WO
9716014 May 1997 WO
9718662 May 1997 WO
9720424 June 1997 WO
9722201 June 1997 WO
9723078 June 1997 WO
9726749 July 1997 WO
9728635 August 1997 WO
9729584 August 1997 WO
9734401 September 1997 WO
9736414 October 1997 WO
9737500 October 1997 WO
9738389 October 1997 WO
9738519 October 1997 WO
9750235 December 1997 WO
9801987 January 1998 WO
9810573 March 1998 WO
9813765 April 1998 WO
9813974 April 1998 WO
9817048 April 1998 WO
9827479 June 1998 WO
9831130 July 1998 WO
9834390 August 1998 WO
9835326 August 1998 WO
9835509 August 1998 WO
9836551 August 1998 WO
9837481 August 1998 WO
9837677 August 1998 WO
9837686 August 1998 WO
9837687 August 1998 WO
9844699 October 1998 WO
9844714 October 1998 WO
9848577 October 1998 WO
9854877 December 1998 WO
9856133 December 1998 WO
9856141 December 1998 WO
9857501 December 1998 WO
9900960 January 1999 WO
9900966 January 1999 WO
9903247 January 1999 WO
9912367 March 1999 WO
9913635 March 1999 WO
9914919 March 1999 WO
9914920 March 1999 WO
9914924 March 1999 WO
9914951 March 1999 WO
9917518 April 1999 WO
9923806 May 1999 WO
9923807 May 1999 WO
9926395 May 1999 WO
9926424 May 1999 WO
9927698 June 1999 WO
9941720 August 1999 WO
9941890 August 1999 WO
9941891 August 1999 WO
9941895 August 1999 WO
9943137 August 1999 WO
9925117 October 1999 WO
9956227 November 1999 WO
9956229 November 1999 WO
9965214 December 1999 WO
9965252 December 1999 WO
9967718 December 1999 WO
0007332 February 2000 WO
0016203 March 2000 WO
0016207 March 2000 WO
0016523 March 2000 WO
0018094 March 2000 WO
0025238 May 2000 WO
0026804 May 2000 WO
0026816 May 2000 WO
0026817 May 2000 WO
0027063 May 2000 WO
0028425 May 2000 WO
0028702 May 2000 WO
0035173 June 2000 WO
0038398 June 2000 WO
0044159 July 2000 WO
0049482 August 2000 WO
0049778 August 2000 WO
0113606 February 2001 WO
0124025 April 2001 WO
0140997 June 2001 WO
0141372 June 2001 WO
0143410 June 2001 WO
0152513 July 2001 WO
0180214 October 2001 WO
0180540 October 2001 WO
0184360 November 2001 WO
02065741 August 2002 WO
03010948 February 2003 WO
2004063854 July 2004 WO
2005036907 April 2005 WO
2006055059 May 2006 WO
2010075151 July 2010 WO
Other references
  • T-Server for Alcatel A4400/OXE, Genesys 2009, pp. 213-216.
  • Flip: a Flexible Protocol for Efficient Communication Between Heterogeneous Devices, Solis, IEEE 1530-1346/01, 2001.
  • European Office action for Application No. 00123329.5, dated Jun. 17, 2002, 6 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.
  • Japanese Office Action for Application No. 2000-581781, mailed Oct. 8, 2002, 4 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.
  • Beck, C. et al., Interactive process of operating system for multimedia communication center, Genesys Telecom Lab, Inc. 2014, 3 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, 2001, 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 Sep. 26, 2002, 2 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. 98812258.8 dated Jul. 26, 2002, 5 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. 04011886.1, dated Mar. 9, 2007, 6 pages.
  • European Search Report for Application No. 00123329.5, dated Jan. 30, 2002, 2 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. 98903623.1, dated Apr. 17, 2002, 3 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. 98948163.5, dated Aug. 8, 2000, 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/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 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/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, dated 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 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 Sep. 10, 2002, 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 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. 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-514448, mailed Sep. 3, 2002, 10 pages.
  • Japanese Office Action for Application No. 2000-519541, mailed Aug. 20, 2002, 10 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, mailed Oct. 1, 2002, 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.
  • 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.
  • 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.
  • Padmanabhan, M., et al. Speech Recognition Performance on a Voicemail Transcription Task, IBM T.J. Watson Research Center, Yorktown Height, NY, 4 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.
  • 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.
  • Canadian Office Action for Application No. 2320978, dated Jun. 2, 2003, 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.
  • Chinese Office Action for Application No. 200980151937.6, dated Jul. 1, 2013, 14 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.
  • Chinese Office action for Patent Application No. 200980151937.6, dated Feb. 15, 2015, 6 pages.
  • Chinese Office action with English Translation for Application No. 200980151937.6 dated May 23, 2014, 7 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. 00115441.8, dated May 18, 2006, 11 pages.
  • European Office Action for Application No. 00119160.0, dated Jan. 16, 2004, 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. 03022831.6, dated Nov. 30, 2006, 7 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. 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 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. 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. 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. 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.
  • International Preliminary Examination Report for PCT/US01/40267, dated Dec. 9, 2002, 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/US03/41677, dated Apr. 10, 2006, 1 page.
  • International Search Report for PCT/US05/27544, dated Jun. 14, 2006, 1 page.
  • Japanese Interrogation and Re-Examination Report for Application No. 1999-502827, mailed Oct. 26, 2004, 7 pages.
  • Japanese Office Action for Application No. 1998-531244, mailed Jan. 6, 2004, 4 pages.
  • Japanese Office Action for Application No. 1998-536740, mailed Feb. 24, 2004, 5 pages.
  • Japanese Office Action for Application No. 1999-500765, mailed Feb. 10, 2004, 6 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-512336, mailed Jun. 24, 2003, 4 pages.
  • Japanese Office Action for Application No. 2000-519541, dated May 16, 2005, 4 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-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-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-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.
  • 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.
  • Wagner, Susanne., “Intralingual Speech-to-Text Conversion in Real-Time: Challenges and Opportunities,” Challenges of Multidimensional Translation Conference Proceedings, 2005, 10 pages.
  • Derfler, Frank J. et al., How Networks Work, Que Corporation,Millennium Ed., 39 pages.
  • White, Ron, How Computers Work, Que Corporation, 7th Edition, Oct. 15, 2003, 53 pages.
  • U.S. Appl. No. 10/269,124, Deryugin et al.
Patent History
Patent number: RE46521
Type: Grant
Filed: Dec 19, 2014
Date of Patent: Aug 22, 2017
Assignee: GENESYS TELECOMMUNICATIONS LABORATORIES, INC. (Daly City, CA)
Inventors: Vladimir N. Deryugin (Pleasant Hill, CA), Patrick Giacomini (San Francisco, CA), Petr Makagon (San Francisco, CA), Andriy Ryabchun (Mill Valley, CA), Nikolay Anisimov (Concord, CA)
Primary Examiner: Fred Ferris, III
Application Number: 14/578,133
Classifications
Current U.S. Class: Routing Circuit Switched Traffic Through A Packet Switching Network (370/356)
International Classification: G06Q 10/06 (20120101);