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

Information

  • Patent Grant
  • 9002920
  • Patent Number
    9,002,920
  • Date Filed
    Tuesday, May 13, 2008
    16 years ago
  • Date Issued
    Tuesday, April 7, 2015
    9 years ago
Abstract
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.
Description
BACKGROUND OF THE INVENTION

1. 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.


2. Description of Related Art


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 multimedia telephone system known in the art by several names. In this new system telephone calls are simulated by multimedia 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 this 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 number 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 NanoBrowser 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, KWP 402 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 therefor 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.




embedded image



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 too 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. At 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 communications with a communication center, comprising: a processor;a memory, wherein the memory stores instructions that, when executed by the processor, cause the processor to: receive an indication that an incoming communication was received at a switch;receive status information relating to a plurality of remote agent terminals located remotely with respect to the communication center;inquire as to an availability status of one of the remote agent terminals in response to the incoming communication being directed to the one of the remote agent terminals;instruct the switch to direct the incoming communication to a local agent terminal located locally with respect to the communication center in response to the one of the remote agent terminals not being available;instruct the switch to direct the incoming communication to the one of the remote agent terminals in response to the one of the remote agent terminals being available; andtransmit data related to the incoming communication to at least one of the one of the remote agent terminals and the local agent terminal for display thereon.
  • 2. The system of claim 1, wherein the instructions further cause the processor to receive a request for the status information from the switch over a wide area network.
  • 3. The system of claim 1, wherein the status information includes a skill level of the agents.
  • 4. The system of claim 1, wherein the incoming communication comprises a telephone call from a customer.
  • 5. The system of claim 1, wherein the data related to the incoming communication comprises at least one of customer data, product data, history data, and communication center service tools.
  • 6. The system of claim 1, wherein the incoming communication comprises a text-based communication event from a customer.
  • 7. The system of claim 1, wherein the availability status comprises information regarding a telephone status of telephones corresponding to the plurality of agent terminals.
  • 8. The system of claim 1, wherein the status information includes at least one of a telephone number, fax number, Internet Protocol address, email address, universal resource locator, and pager number.
  • 9. The system of claim 1, wherein the one of the agent terminals comprises at least one of a telephone, personal computer, laptop, mobile telephone, and personal digital assistant.
  • 10. The system of claim 1, wherein the data related to the incoming communication is provided to the one of the agent terminals over a local area network.
  • 11. A method for managing communications with a communication center, comprising: receiving, by a processor, an indication that an incoming communication was received at a switch;receiving, by the processor, status information relating to a plurality of remote agent terminals located remotely with respect to the communication center;inquiring, by the processor, as to an availability status of one of the remote agent terminals in response to the incoming communication being directed to the one of the remote agent terminals;instructing, by the processor, the switch to direct the incoming communication to a local agent terminal located locally with respect to the communication center in response to the one of the remote agent terminals not being available;instructing, by the processor, the switch to direct the incoming communication to the one of the remote agent terminals in response to the one of the remote agent terminals being available; andtransmitting, by the processor, data related to the incoming communication to at least one of the one of the remote agent terminals and the local agent terminal for display thereon.
  • 12. The method of claim 11, further comprising receiving, by the processor, a request for the status information from the switch over a wide area network.
  • 13. The method of claim 11, wherein the status information includes a skill level of the agents.
  • 14. The method of claim 11, wherein the incoming communication comprises a telephone call from a customer.
  • 15. The method of claim 11, wherein the data related to the incoming communication comprises at least one of customer data, product data, history data, and communication center service tools.
  • 16. The method of claim 11, wherein the incoming communication comprises a text-based communication event from a customer.
  • 17. The method of claim 11, wherein the availability status comprises information regarding a telephone status of telephones corresponding to the plurality of agent terminals.
  • 18. The method of claim 11, wherein the status information includes at least one of a telephone number, fax number, Internet Protocol address, email address, universal resource locator, and pager number.
  • 19. The method of claim 11, wherein the one of the agent terminals comprises at least one of a telephone, personal computer, laptop, mobile telephone, and personal digital assistant.
  • 20. The method of claim 11, wherein the data related to the incoming communication is provided to the one of the agent terminals over a local area network.
CROSS-REFERENCE TO RELATED DOCUMENTS

The present invention is a continuation application of U.S. Ser. No. 11/070,898, filed Mar. 1, 2005, and issued as U.S. Pat. No. 7,373,405, which is a continuation application of U.S. Ser. No. 10/269,124, filed on Oct. 10, 2002 and issued as U.S. Pat. No. 6,985,943. all of which are incorporated by reference in their entirety. The present invention is also related to 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 and to a U.S. Pat. No. 5,802,163 entitled Methods and Apparatus for Implementing an Outbound Network Call Center both of which are incorporated herein by reference.

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