Systems and methods for storing and searching data in a customer center environment

Abstract
A method includes generating data from workforce applications, at least one of the workforce applications including at least one of forecasting, scheduling, recording, and monitoring functionalities; and storing the data from the at least one of the workforce applications in a storage area network (SAN), the SAN being operable to connect the at least one of the workforce applications to computer storage devices. This may also include keeping recorded contacts in a long term storage device such as the SAN or an operational data store (ODS) and transparently searching in both the ODS and the SAN simultaneously. With a concept of moving data on to a file system SAN which is cheaper as compared to a database technology such as ODS, the method facilitates predictable performance from the ODS and easier manageability with constant cost from SAN.
Description
TECHNICAL FIELD

The present disclosure is generally related to storing and searching data in a customer center environment.


BACKGROUND

The business of a call center, also known as a customer center, is to provide rapid and efficient interaction between agents and customers (or prospective customers). Existing solutions require the purchase of multiple hardware and software components, typically from different vendors, to achieve the business goals of the customer center. The use of separate systems of components leads to a variety of problems. For instance, each system typically has its own method of configuration and its own user interface. Thus, exchanging data between the systems typically requires additional work by someone at the customer center.


Furthermore, customer centers are continually tasked with striking a balance between service quality, efficiency, effectiveness, revenue generation, cost cutting, and profitability, among others. As a result, today's customer center agents are charged with mastering multiple data sources and systems, delivering consistent service across customer touch points, up-selling, cross-selling, and saving at-risk customers, while winning new ones.


Data in the data sources and systems is typically stored in a structured database. The structured database is continually changing and growing due to the technological changes and development of customer centers. Because of compliance regulations, the structured database typically stores data for the recorded contacts for a long duration, such as seven (7) to ten (10) years. Thus, the structured database is increasingly large in size of storage and complicated to use, which may result in the increase of maintenance and licensing costs, the addition of more hardware, and the unreliable predictability in performance in querying the structured database.


SUMMARY

Systems and methods for searching in a customer center environment are provided. In this regard, a representative method comprises: generating data from a plurality of workforce applications, at least one of the plurality of workforce applications including at least one of forecasting, scheduling, recording, and monitoring functionalities; storing the data in a plurality of unstructured databases, at least one of the plurality of unstructured databases being operative to communicate with one of the plurality of workforce applications, the at least one of the plurality of unstructured databases including a plurality of unstructured data that does not have a data structure; receiving search parameters that are used to search the data in the at least one of the plurality of unstructured databases; searching the at least one of the plurality of unstructured databases according to the search parameters; and displaying search results on a displaying device.


An exemplary system for storing data in a customer center system comprises workforce applications that include at least one of forecasting, scheduling, recording, and monitoring functionalities, at least one of the workforce applications being operative to generate data related to customer center functionalities. The system further includes an operational data store operable to integrate data from the at least one of the workforce applications to facilitate operations, analysis and reporting and a storage area network operable to connect the at least one of the workforce applications to computer storage devices via the operational data store, the storage area network of which is operable to store the data from the at least one of the workforce applications. At least one of the workface applications is operable to search in both the operational data store and storage area network.


Other systems, methods, features, and advantages of the present disclosure will be or become apparent to one with skill in the art upon examination of the following drawings and detailed description. It is intended that all such additional systems, methods, features, and advantages be included within this description, be within the scope of the present disclosure, and be protected by the accompanying claims.





BRIEF DESCRIPTION OF THE DRAWINGS

Many aspects of the disclosure can be better understood with reference to the following drawings. The components in the drawings are not necessarily to scale, emphasis instead being placed upon clearly illustrating the principles of the present disclosure. Moreover, in the drawings, like reference numerals designate corresponding parts throughout the several views. While several embodiments are described in connection with these drawings, there is no intent to limit the disclosure to the embodiment or embodiments disclosed herein. On the contrary, the intent is to cover all alternatives, modifications and equivalents.



FIG. 1 illustrates an embodiment of a customer center environment;



FIG. 2 is a high-level view illustrating an embodiment of a customer center system that includes a data source, data mart, data processing, and search engine;



FIG. 3 is a block diagram illustrating an embodiment of a search engine and a data source in greater detail;



FIG. 4 is a block diagram illustrating an embodiment of a data storage system;



FIG. 5 is a block diagram illustrating another embodiment of a data storage system;



FIG. 6 is an exemplary structured database, such as that shown in FIG. 3; FIG. 7 is an exemplary unstructured database, such as that shown in FIG. 3; FIG. 8 is a flow diagram illustrating an exemplary process for searching a customer center system;



FIG. 9 is a flow diagram illustrating an exemplary process of a software application of a data source in a customer center system;



FIG. 10 is a flow diagram illustrating an exemplary process of a search engine in a customer center system;



FIG. 11 is a flow diagram illustrating an exemplary process for storing data in a storage area network and a data warehouse; and



FIG. 12 is a hardware block diagram of a general-purpose computer that can be used to implement one or more of the components of an embodiment of an integrated customer center system.





DETAILED DESCRIPTION

Disclosed herein are systems and methods for storing and searching data in a customer center environment. A customer center can include, but is not limited to, outsourced contact centers, outsourced customer relationship management, customer relationship management, voice of the customer, customer interaction, contact center, multi-media contact center, remote office, distributed enterprise, work-at-home agents, remote agents, branch office, back office, performance optimization, workforce optimization, hosted contact centers, payroll systems, and speech analytics, for example.


Additionally, included in this disclosure are embodiments of integrated workforce optimization platforms, as discussed in U.S. application Ser. No. 11/359,356, filed on Feb. 22, 2006, entitled “Systems and Methods for Workforce Optimization,” which is hereby incorporated by reference in its entirety. At least one embodiment of an integrated workforce optimization platform integrates: (1) Quality Monitoring/Call Recording—voice of the customer; the complete customer experience across multimedia touch points; (2) Workforce Management—strategic forecasting and scheduling that drives efficiency and adherence, aids in planning, and helps facilitate optimum staffing and service levels; (3) Performance Management—key performance indicators (KPIs) and scorecards that analyze and help identify synergies, opportunities and improvement areas; (4) e-Learning—training, new information and protocol disseminated to staff, leveraging best practice customer interactions and delivering learning to support development; and/or (5) Analytics—deliver insights from customer interactions to drive business performance. By way of example, the integrated workforce optimization process and system can include planning and establishing goals—from both an enterprise and center perspective—to ensure alignment and objectives that complement and support one another. Such planning may be complemented with forecasting and scheduling of the workforce to ensure optimum service levels. Recording and measuring performance may also be utilized, leveraging quality monitoring/call recording to assess service quality and the customer experience.


Exemplary systems are first discussed with reference to the figures. Although these systems are described in detail, they are provided for purposes of illustration only and various modifications are feasible. After the exemplary systems are described, examples of flow diagrams of the systems are provided to explain the manner in which data can be stored and searched.


Referring now in more detail to the figures, FIG. 1 illustrates an embodiment of a customer center environment 100. The customer center environment 100 is staffed by agents who handle incoming and/or outgoing contacts. Although the traditional and most common form of contact is by phone, other types of contacts are becoming more common (e.g., text chat, web collaboration, email, and fax, among others). An agent workspace can include an agent phone 110 and a workstation computer 120. A network 130 connects one or more of the workstations 120.


A contact router 140 distributes incoming contacts to available agents. For example, when the contacts are made by traditional phone lines, the contact router 140 operates by connecting outside trunk lines 150 to agent trunk lines 160. In this environment, the contact router 140 may be implemented by an automatic call distributor (ACD), which queues calls until a suitable agent is available Other types of contacts, such as Voice over Internet Protocol (VoIP) calls and computer-based contacts (e.g., chat and email), are routed over one or more data networks. These contacts are distributed over network 130 to one of the agent workstations 120. Alternatively or additionally, the contact router 140 can include, but is not limited to, an instant messenger (IM) server, an e-mail server, and a computer telephony integration (CTI) server, among others.



FIG. 2 is a high-level view illustrating an embodiment of a customer center system 200 that includes a data source, data mart, data processing and search engine. The data source 210 has different agent workforce related applications, executables, processes or services, including quality monitoring, forecasting and scheduling, compliance recording, adherence, learning, voice recognition, ACD, CRM (customer relationship management) and/or other third party applications, among others.


Typical use of the agent workforce related applications results in data being provided to one or more databases. The data can be extracted, transformed, and loaded in an enterprise data mart 230. The data processing 240 can access the data to provide parameter reports, ad-hoc reports, custom reports, scorecards, an on-line analytical processing (OLAP) browser, and predictive analytics, among others.


Alternatively or additionally, data generated from the applications, such as quality monitoring, forecasting and scheduling, compliance recording, adherence, learning, and voice recognition, can be stored in the data source 210 in multiple respective databases (not shown). The operation of the applications is further described in relation to FIGS. 8 and 9.


The subject matter related to the data source 210, data mart 230 and data processing 240 is related to the subject matter disclosed in a pending U.S. patent application, which is entitled “Systems and Methods For Contact Center Analysis,” U.S. application Ser. No. 11/479,267, filed on Jun. 30, 2006, and incorporated by reference herein in its entirety.


The search engine 220 can be deployed at a centralized location, e.g., within a customer center, and/or embedded into a network as a service on the network and/or as intelligence in the network infrastructure. The search engine 220 communicates with the data source 210, data mart 230, and data processing 240 to search and retrieve data based on search parameters. The data source 210, data mart 230 and data processing 240 store data in either a structured database or unstructured database, or both. The structured database includes structured data, which are generally information that has been broken down and categorized. The structured database is further described in relation to FIG. 6.


The unstructured database includes a plurality of unstructured data, which are generally information that do not have a data structure. Examples of unstructured data may include, but is not limited to, audio, video, recorded contacts meta-data, such as, but not limited to, start-time and end-time of the call, agentID, customerID, and location of audio file, among others, and unstructured text, such as, but not limited to, the body of an email or word processor document. The unstructured database is further described in relation to FIG. 7.


The search engine 220 receives a query from a user and processes the query using a search algorithm. The search engine 220 searches either the structured database or unstructured database, or both, based on the query. The search engine 220 provides a search result in text format. The operation of the search engine 220 is further described in relation to FIGS. 8 and 10.



FIG. 3 is a block diagram illustrating an embodiment of a search engine and a data source in greater detail. In this embodiment, the data source 310 includes quality monitoring (QM) which further includes QM software applications 325. The applications 325 generate data related to quality monitoring that is gathered and sent to a data compilation manager 333. The data compilation manager 333 determines whether at least some portions of the data should be stored in either a structured database 335 or an unstructured database 345, or both, based on the content of the data.


If the data is to be stored in the structured database 335, then at least some portions of the data are transmitted to the structured database 335. For example, the data compilation manager 333 can determine if the data includes, by way of example, but is not limited to, agent ID, date of CTI event, talkover start time, talkover end time, ring time, and number of transfers, among others. Responsive to the determination, at least some portions of the data are transmitted, stored and categorized in the structured database 335.


If the data compilation manager 345 makes a determination to store the data in the unstructured database 345, then at least some portions of the data are transmitted to the data-to-text converter 340. For example, the data compilation manager 333 can be configured to transmit the data that is not stored in the structured database to the unstructured database 345. Alternatively or additionally, the data compilation manager 333 can be configured to transmit all data from the quality monitoring to the unstructured database, including data that is stored in the structured database.


The data-to-text converter 340 receives the data from the data compilation manager 333 and converts the data to a text format, such as an eXtensible Markup Language (XML) or HyperText Markup Language (HTML) format. The converted data is transmitted and stored in the unstructured database 345. Alternatively or additionally, the data being stored in the databases 335, 345 can also be stored in an enterprise data mart 330. The enterprise data mart 330 can be used as a long-term storage whereas the databases 335, 345 can be used as a short-term storage.


Metadata can be included in the converted data that can facilitate indexing. For example, the metadata includes specified key words and concepts under which the data can be indexed. This can be helpful, especially in cases in which the words in the data might have multiple meanings. The metadata can guide the search engine in choosing which of the meanings for these words is correct. The search engine 320 can confirm whether the metadata is correct by correlating metadata with content and rejecting the metadata that does not match the words in the data.


The search engine 320 includes a search parameter input 350, which receives search parameters (or a query) from a user. The parameters are then used by a search algorithm 355 to search the databases 330, 335, 345. The search parameters can involve one or more words with the use of Boolean operators that allow the user to refine and extend the terms of the search. The Boolean operators most often seen are:

    • AND—All the terms joined by “AND” must appear in the pages or documents. Some search engines substitute the operator “+” for the word AND.
    • OR—At least one of the terms joined by “OR” must appear in the pages or documents.
    • NOT—The term or terms following “NOT” must not appear in the pages or documents. Some search engines substitute the operator “2 for the word NOT.
    • FOLLOWED BY—One of the terms must be directly followed by the other.
    • NEAR—One of the terms must be within a specified number of words of the other.
    • Quotation Marks—The words between the quotation marks are treated as a phrase, and that phrase must be found within the document or file.


Alternatively or additionally, the search engine 320 includes a feature of a conditional search with conditional expressions, such as ten (10) instances of transferred calls found in a document for a particular contact. Alternatively or additionally, the search algorithm 355 can define the search parameter as literal searches. That is, the search algorithm 355 searches for the words or phrases exactly as the words are entered in the search parameter input 350.


Alternatively or additionally, the search algorithm 355 can define the search parameters as concept-based searches that use statistical analysis on the data containing the words or phrases defined in the search parameters. Alternatively or additionally, the search algorithm 355 can define the search parameters as natural-language queries. The search parameters in the natural-language queries are in the form of a question in the same way a person would ask another person.


The search results of the search algorithm 355 are then indexed by a search index 360. The search index 360 can highlight the words in the search results that were used in the search parameter and prioritize the search results. The search index 360 can include the number of times that the word appears in the search results. The search index 360 can assign a “weight” to each entry, with increasing values assigned to the words as the words appear near the top of the document, in sub-headings, in links, in the metadata or in the title of the document, among others.


The search index 360 allows information to be found quickly. An example of the index is a hash table. When using a hash table (or “hashing”), a formula is applied to attach a numerical value (or hash value) to each word. The formula is designed to evenly distribute the entries across a predetermined number of divisions. This numerical distribution is different from the distribution of words across the alphabet.


For example, in the English vocabulary, there are more words that begin with some letters than other letters. For instance, there are more words that begin with the letter “M” than the letter “X”. This means that finding a word beginning with the letter “M” could take much longer than finding a word that begins with letter “X”. The hash table contains a hash value along with a pointer to the actual data, which can be sorted in a way that allows the data to be stored most efficiently. The combination of efficient indexing and effective storage facilitates getting results quickly, even when the user creates a complicated search. Another example related to a contact center is searching for calls with a customer ID=“X”, called on Jan. 1, 1997, and associated with Agent=“Bob” on Campaign=“Sell Shares”.


The search results are then sent to a data encoding/conversion 365, which determines whether to convert the search result to a text format. If the search result is to be converted, the encoding/conversion 365 converts the search results to a text format, such as an XML or HTML format. If the data of the search results is in the text format, the data is then transmitted and stored in a search result database 370.


Alternatively or additionally, the search engine 320 can be configured to search in the structured database 335 for specific contact attribute search criteria. The search engine 320 can include a specific graphical user interface (not shown) and specific query composition (not shown) that enables the search engine 320 to communicate with the structured database 335.



FIG. 4 is a block diagram illustrating an embodiment of a data storage system 400, which includes an operational data store (ODS) 420, a data source 403, and a storage area network (SAN) 425. The data source 403 includes quality 405, speech analytics 410, and compliance search & replay 415. The data source 403 communicates with the ODS 420 and storage area network (SAN) 425 to store, for example, recorded contacts and/or transparently search in both the ODS 420 and SAN 425. In general, the ODS 420 can integrate data from multiple sources, such as the data source 403. The integration generally refers to formatting the data from at least one source to facilitate operations, analysis and reporting. Because the data originates from multiple sources, the integration often includes cleaning, redundancy resolution and business rule enforcement. The ODS 420 periodically extracts, transforms, and loads (ETL) data from the data source 403 to the SAN 425. Alternatively or additionally, the ODS 420 can strip unessential data before loading data to the SAN 425.


The SAN 425 can further communicate with the data source 403 directly without receiving data from the ODS 420. The SAN 425 is generally a network that connects a computing device, such as those in the data source 403, to computer storage devices, such as, disk array controllers and tape libraries. Generally, the SAN has two variations. The first variation of SAN is a network, the primary purpose of which is the transfer of data between computer systems and storage elements. The SAN can include a communication infrastructure, which provides physical connections, and a management layer, which organizes the connections, storage elements, and computer systems so that data transfer is secure and robust.


The second variation of SAN is a storage network that can include storage elements, storage devices, computer systems, and/or appliances, plus all control software, communicating over a network. In a storage network, a server issues a request for specific blocks, or data segments, from specific disk drives. The storage networks can use a small computer system interface (SCSI) protocol for communication between servers and devices. SAN physical interfaces can include, but are not limited to, 1 Gbit Fibre Channel, 2 Gbit Fibre Channel, 4 Gbit Fibre Channel, and (in limited cases) 1 Gbit iSCSI. The SCSI protocol information can be carried over a lower level protocol via a mapping layer.


Some SANs allow duplication functionality such as “cloning” and “snapshotting,” which allows for real-time duplication of a logical unit number (LUN), for the purposes of backup, disaster recovery, or system duplication. Cloning creates a complete replica of the LUN in the background (consuming I/O resources in the process), while snapshotting stores the original states of any blocks that get changed after the “snapshot” from the original LUN, and does not significantly slow the system.


The SAN 425 can include a file system 430 that can store and organize computer files. Such files can contain data to facilitate finding and accessing the files. The file system 430 can use a storage device such as a hard disk or CD-ROM. The file system 430 can be involved in maintaining the physical location of the files. The file system 430 can provide access to data on a file server by acting as clients for a network protocol (e.g., network file system (NFS), server message block (SMB), or plan 9 filesystem protocol (9P) clients). The file system 430 can be virtual and exist as an access method for virtual data.


In general, the file system 430 is a set of abstract data types that are implemented for the storage, hierarchical organization, manipulation, navigation, access, and retrieval of data. The file system 430 can make use of an underlying data storage device that offers access to an array of fixed-size blocks, generally 512 bytes each, for example. The file system 430 includes software that facilitates organizing the blocks into files and directories, and keeping track of which sectors belong to which file and which are not being used. Alternatively or additionally, the file system 430 can operate with a storage device. The file system 430 can be used to organize and provide access to any data, whether it be stored or dynamically generated (e.g., from a network connection).


With or without the use of storage devices, the file system 430 generally has directories that associate file names with files, usually by connecting the file name to an index into a file allocation table of some sort, such as the file allocation table (FAT) in an MS-DOS file system or in any other type of operating system which use file systems to store files. Directory structures may be flat, or allow hierarchies where directories may contain subdirectories. In some file systems, file names are structured, with special syntax for filename extensions and version numbers. In others, file names are simple strings, and per-file metadata is stored elsewhere.



FIG. 5 is a block diagram illustrating another embodiment of a data storage system. The system 500 is similar to the system 400 in FIG. 4 described above. That is, the system 500 includes an ODS 520, a data source 503, and a SAN 525. The system 500 further includes a long term data warehouse 535, which the ODS 520 periodically extracts, transforms, and loads (ETL) data from the data source 503. The data warehouse 535 can be configured to store data for a certain period of time, such as, for example, one, five, or seven years, among others. The data in the data warehouse 535 can be processed for visualization, analytics, recording related functionalities (e.g., Slice/Dice/Contact), business intelligence, and performance planning, among others, such as that shown in block 540.


In general, the data warehouse is a computer system that archives and analyzes an organization's historical data, such as sales, salaries, or other information from day-to-day operations. The data warehouse can use a “dimensional” approach to organize the stored data. The dimensional approach stores data as “facts,” which are numeric or text data that capture specific data about a single transaction or event, and “dimensions” which contain reference information, that allow each transaction or event to be classified in various ways.



FIG. 6 is an exemplary structured database, such as that shown in FIG. 3. The structured database 635 includes categories of data, such as agent ID 603, date of CTI event 606, talkover start time 609, talkover end time 613, ring time 616, and number of transfers 619, among others. In general, the structured database restricts the user from being able to search in categories that are available in the database. The search engine can search the categories available in the structured database based on received search parameters using, for example, concept-based searches and natural language queries. Alternatively or additionally, a specific graphical user interface (not shown) and specific query composition (not shown) can be used in conjunction with the search engine to communicate with the structured database.



FIG. 7 is an exemplary unstructured database, such as that shown in FIG. 3. The unstructured database 745 includes stored data 703 that corresponds to a respective index 706. The stored data can be in a text format that includes, by way of example, but is not limited to, the title of the data, subject and date of the data, and content of the data, among others. The corresponding index can include a list of words and notes where the words are found in the data 703.


Alternatively or additionally, at least one application of the data source can capture and store the data related to an interaction in a text format. For example, quality monitoring of the data source can store information corresponding to the interaction in the unstructured database 745 in which the information is floating around in a text format. The search engine can search for key words in the text, such as contact ID, start time, end time, DNIS, talk over start time, talk over end time, and competitor's name, for example. The unstructured database 745 may include characters, integers, float, character large object (clob) and binary large object (blob).



FIG. 8 is a flow diagram 800 illustrating an exemplary process for searching a customer center environment. Steps 805 and 810 inputs search parameters into the search engine and performs a search algorithm based on the inputted parameters. Step 815 searches in multiple databases across the customer center environment.


The multiple databases include data that is generated from workforce applications and stored in either structured databases or unstructured databases, or both. The multiple databases can be located anywhere in the customer center such as in the data source, data mart, and data processing.


Based on the search results, step 820 determines whether the data is to be encoded and converted. If the data is to be converted, step 825 encodes and converts the data in, for example, either an XML format or HTML, format, or both. Step 830 stores the data in a search result database. If the data is already in an XML or HTML format and does not need data encoding and/or conversion, then the data is stored in the search result database.



FIG. 9 is a flow diagram illustrating an exemplary process of a software application in a customer center environment. The process 900 includes the step 905 that performs computations of a related customer center analysis. Step 910 compiles the data from the computations for retrieval and storage. Step 920 determines whether the compiled data is to be stored in either a structured or unstructured database, or both. If the data is to be stored in an unstructured database, then step 930 converts the data to a text format, such as XML or HTML. Step 935 stores the data in an unstructured database.


If the data is determined to be stored in a structured database, step 925 extracts, transforms, and loads the data in a structured database. Step 940 provides communication between the databases and the search engine in a secure connection such that the search engine can search the databases. Alternatively or additionally, the data in the unstructured and/or structured databases can be transmitted to a data mart, such as that shown in FIG. 2, such that the search engine can search the data mart.



FIG. 10 is a flow diagram illustrating an exemplary process 1000 of a search engine. Beginning with step 1005, search parameters are inputted into the search engine. Step 1010 performs a search algorithm using the inputted search parameters to generate a search result. Step 1015 indexes the data associated with the search result. Step 1020 determines whether the data should be encoded and/or converted in either an XML format or HTML format, or both.


If the data is not to be encoded and/or converted, then step 1030 stores the data associated with the search result in a search result database of the search engine. If the data is to be encoded and/or converted, then step 1025 encodes and converts the data in either the XML format or HTML format, or both. Step 1030 stores the encoded/converted data in the search result database. Step 1035 displays the search result on a display device.



FIG. 11 is a flow diagram illustrating an exemplary process for storing data in a storage area network and a data warehouse. Beginning with step 1010, the data is retrieved from a data source. Step 1015 integrates the data from multiple sources to facilitate operations, analysis and reporting. Step 1020 determines where to store the data, either in a storage area network (SAN) and/or a data warehouse. Responsive to determining that the data is to be stored in a SAN, step 1125 transmits the data to the SAN. Step 1130 stores and organizes the data using a file system. Responsive to determining that the data is to be stored in a data warehouse, step 1135 transmits the data to the data warehouse and step 1140 can process the stored data for visualization, analytics, recording related functionalities (e.g., Slice/Dice/Contact), business intelligence, and performance planning, among others.



FIG. 12 is a hardware block diagram of a general-purpose computer 1200 that can be used to implement one or more of the components of an embodiment of an integrated customer center system, such as disclosed herein. The computer 1200 contains a number of components that are well known in the art of call center software, including a processor 1210, a network interface 1220, memory 1230, and non-volatile storage 1240. Examples of non-volatile storage include, for example, a hard disk, flash RAM, flash ROM, EEPROM, etc. These components are coupled via a bus 1250. The memory 1230 contains instructions which, when executed by the processor 1210, implement the methods and systems disclosed herein. Omitted from FIG. 12 are a number of conventional components, known to those skilled in the art those are unnecessary to explain the operation of the system 1200.


The systems and methods disclosed herein can be implemented in software, hardware, or a combination thereof. In some embodiments, the system and/or method is implemented in software that is stored in a memory and that is executed by a suitable microprocessor (pP) situated in a computing device. However, the systems and methods can be embodied in any non-transitory computer-readable medium for use by or in connection with an instruction execution system, apparatus, or device. Such instruction execution systems include any computer-based system, processor-containing system, or other system that can fetch and execute the instructions from the instruction execution system. In the context of this disclosure, a “computer-readable medium” can be any means that can contain, store, communicate, propagate, or transport the program for use by, or in connection with, the instruction execution system. The computer readable medium can be, for example but not limited to, a system or propagation medium that is based on electronic, magnetic, optical, electromagnetic, infrared, or semiconductor technology.


Specific examples of a computer-readable medium using electronic technology would include (but are not limited to) the following: an electrical connection (electronic) having one or more wires; a random access memory (RAM); a read-only memory (ROM); an erasable programmable read-only memory (EPROM or Flash memory). A specific example using magnetic technology includes (but is not limited to) a portable computer diskette. Specific examples using optical technology include (but are not limited to) optical fiber and compact disc read-only memory (CD-ROM).


The scope of certain embodiments of the present disclosure includes embodying the functionality of the preferred embodiments of the present disclosure in logic embodied in hardware and/or software-configured media.


It should be noted that the flowcharts included herein show the architecture, functionality and/or operation of implementations. In this regard, each block can be interpreted to represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that in some alternative implementations, the functions noted in the blocks may occur out of the order. For example, two blocks shown in succession may in fact be executed substantially concurrently or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved.


It should be emphasized that the above-described embodiments are merely possible examples of implementations, merely set forth for a clear understanding of the principles of this disclosure. Many variations and modifications may be made to the above-described embodiments without departing substantially from the spirit and principles of the disclosure. All such modifications and variations are intended to be included herein within the scope of this disclosure.

Claims
  • 1. A method comprising: receiving a query via a graphical user interface to search data generated by a plurality of different workforce applications of a customer contact center;in response to the query, substantially concurrently searching both a structured database and an unstructured database for information in the data related to the query,
  • 2. The method of claim 1 wherein the categories further comprise a date of each of the plurality of contacts.
  • 3. The method of claim 2 wherein the categories further comprise a number of transfers of each of the plurality of contacts.
  • 4. The method of claim 1 further comprising, prior to receiving the query, processing at least a portion of the data generated by the plurality of workforce applications to determine whether the portion of the data should be stored in either the structured database or the unstructured database, wherein the determination is made based on content of the portion.
  • 5. The method of claim 1 further comprising, prior to receiving the query, processing at least a portion of the data generated by the plurality of workforce applications to determine whether the portion of the data should be stored in either only a one of the structured database or the unstructured database, or both the structured database and the unstructured database, wherein the determination is made based on content of the portion.
  • 6. The method of claim 1 further comprising converting at least a portion of the results to a text format for storage in the search result database.
  • 7. The method of claim 1 further comprising displaying the results according to a prioritization.
  • 8. A non-transitory computer readable medium having instructions stored thereon that, when executed by a computer system, direct the computer system: to receive a query via a graphical user interface to search data generated by a plurality of different workforce applications of a customer contact center;in response to the query, to substantially concurrently search both a structured database and an unstructured database for information in the data related to the query, wherein the substantially concurrently search comprises searching the structured database using categories available in the structured database and searching the unstructured database using an index of the unstructured database, wherein the structured database includes a plurality of contacts sent and/or received by the customer contact center, wherein the categories comprise a customer center agent identifier associated with each of the plurality of contacts; andto store results of the substantially concurrent search in a search result database and to index the search results by a search index, wherein the search index is a hash table which evenly distributes a weighted hash value for each of the words that appear in the search results, the hash values being weighted and distributed based on the first letter found in each of the words of the search results, wherein the distribution of the weighted hash value for the each of the words is different from the distribution of words across the alphabet.
  • 9. The non-transitory computer readable medium of claim 8, wherein the categories further comprise a date of each of the plurality of contacts.
  • 10. The non-transitory computer readable medium of claim 9, wherein the categories further comprise a number of transfers of each of the plurality of contacts.
  • 11. The non-transitory computer readable medium of claim 8, wherein the instructions further direct the computer system to, prior to receiving the query, process at least a portion of the data generated by the plurality of workforce applications to determine whether the portion of the data should be stored in either the structured database or the unstructured database, wherein the determination is made based on content of the portion.
  • 12. The non-transitory computer readable medium of claim 8, wherein the instructions further direct the computer system to, prior to receiving the query, process at least a portion of the data generated by the plurality of workforce applications to determine whether the portion of the data should be stored in either only a one of the structured database or the unstructured database, or both the structured database and the unstructured database, wherein the determination is made based on content of the portion.
  • 13. The non-transitory computer readable medium of claim 8, wherein the instructions further direct the computer system to convert at least a portion of the results to a text format for storage in the search result database.
  • 14. The non-transitory computer readable medium of claim 8, wherein the instructions further direct the computer system to display the results according to a prioritization.
  • 15. A data storage system comprising: a data source comprising a structured database and an unstructured database, wherein the structured database includes categories of a plurality of contacts sent and/or received by a contact center, wherein the categories comprise a customer center agent identifier associated with each of the plurality of contacts;a search engine configured to receive a query via a graphical user interface to search data generated by a plurality of different workforce applications of a customer contact center; wherein the search engine is further configured to, in response to query;search both a structured database and an unstructured database for information in the data related to the query, wherein the search engine substantially concurrently searches both the structured database and the unstructured database comprises by at least searching the structured database using the categories available in the structured database and searching the unstructured database using an index of the unstructured database; and store results of the substantially concurrent search in a search result database and index the search results by a search index, wherein the search index is a hash table which evenly distributes a weighted hash value for each of the words that appear in the search results, the hash values being weighted and distributed based on the first letter found in each of the words of the search results, wherein the distribution of the weighted hash value for the each of the words is different from the distribution of words across the alphabet.
  • 16. The data storage system of claim 15, wherein the categories further comprise a date of each of the plurality of contacts.
  • 17. The data storage system of claim 15, wherein the data source is configured to process, prior to receiving the query, at least a portion of the data generated by the plurality of workforce applications to determine whether the portion of the data should be stored in either the structured database or the unstructured database, wherein the determination is made based on content of the portion.
  • 18. The data storage system of claim 15, wherein the data source is configured to process, prior to receiving the query, at least a portion of the data generated by the plurality of workforce applications to determine whether the portion of the data should be stored in either only a one of the structured database or the unstructured database, or both the structured database and the unstructured database, wherein the determination is made based on content of the portion.
  • 19. The data storage system of claim 15, wherein the search engine is configured to convert at least a portion of the results to a text format for storage in the search result database.
  • 20. The data storage system of claim 15, wherein the search engine is configured to display the results according to a prioritization.
CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of, and claims priority to, U.S. patent application Ser. No. 13/114,620, entitled “Systems and Methods for Storing and Searching Data in a Customer Center Environment,” filed May 24, 2011, which claims the benefit of priority to U.S. patent application Ser. No. 11/693,857, entitled “Systems and Methods For Storing And Searching Data in a Customer Center Environment,” filed on Mar. 30, 2007, which issued on May 31, 2011 as U.S. Pat. No. 7,953,750, and which claims the benefit of U.S. provisional application entitled, “Systems and Methods for Searching Data in a Customer Center Environment,” having Ser. No. 60/847,872, filed Sep. 28, 2006, which is entirely incorporated herein by reference, and is related to U.S. utility application entitled, all of which are incorporated herein by reference in their entireties.

US Referenced Citations (257)
Number Name Date Kind
3594919 De Bell et al. Jul 1971 A
3705271 De Bell et al. Dec 1972 A
4510351 Costello et al. Apr 1985 A
4684349 Ferguson et al. Aug 1987 A
4694483 Cheung Sep 1987 A
4763353 Canale et al. Aug 1988 A
4815120 Kosich Mar 1989 A
4924488 Kosich May 1990 A
4953159 Hayden et al. Aug 1990 A
5016272 Stubbs et al. May 1991 A
5101402 Chiu et al. Mar 1992 A
5117225 Wang May 1992 A
5210789 Jeffus et al. May 1993 A
5239460 LaRoche Aug 1993 A
5241625 Epard et al. Aug 1993 A
5267865 Lee et al. Dec 1993 A
5299260 Shaio Mar 1994 A
5311422 Loftin et al. May 1994 A
5315711 Barone et al. May 1994 A
5317628 Misholi et al. May 1994 A
5347306 Nitta Sep 1994 A
5388252 Dreste et al. Feb 1995 A
5396371 Henits et al. Mar 1995 A
5432715 Shigematsu et al. Jul 1995 A
5465286 Clare et al. Nov 1995 A
5475625 Glaschick Dec 1995 A
5485569 Goldman et al. Jan 1996 A
5491780 Fyles et al. Feb 1996 A
5499291 Kepley Mar 1996 A
5535256 Maloney et al. Jul 1996 A
5572652 Robusto et al. Nov 1996 A
5577112 Cambray et al. Nov 1996 A
5590171 Howe et al. Dec 1996 A
5597312 Bloom et al. Jan 1997 A
5619183 Ziegra et al. Apr 1997 A
5696906 Peters et al. Dec 1997 A
5717879 Moran et al. Feb 1998 A
5721842 Beasley et al. Feb 1998 A
5742670 Bennett Apr 1998 A
5748499 Trueblood May 1998 A
5778182 Cathey et al. Jul 1998 A
5784452 Carney Jul 1998 A
5790798 Beckett, II et al. Aug 1998 A
5796952 Davis et al. Aug 1998 A
5809247 Richardson et al. Sep 1998 A
5809250 Kisor Sep 1998 A
5825869 Brooks et al. Oct 1998 A
5835572 Richardson, Jr. et al. Nov 1998 A
5862330 Anupam et al. Jan 1999 A
5864772 Alvarado et al. Jan 1999 A
5884032 Bateman et al. Mar 1999 A
5907680 Nielsen May 1999 A
5918214 Perkowski Jun 1999 A
5923746 Baker et al. Jul 1999 A
5930764 Melchione et al. Jul 1999 A
5933811 Angles et al. Aug 1999 A
5944791 Scherpbier Aug 1999 A
5946375 Pattison Aug 1999 A
5948061 Merriman et al. Sep 1999 A
5958016 Chang et al. Sep 1999 A
5964836 Rowe et al. Oct 1999 A
5978648 George et al. Nov 1999 A
5982857 Brady Nov 1999 A
5987466 Greer et al. Nov 1999 A
5990852 Szamrej Nov 1999 A
5991373 Pattison et al. Nov 1999 A
5991796 Anupam et al. Nov 1999 A
6005932 Bloom Dec 1999 A
6009429 Greer et al. Dec 1999 A
6014134 Bell et al. Jan 2000 A
6014647 Nizzari et al. Jan 2000 A
6018619 Allard et al. Jan 2000 A
6035332 Ingrassia et al. Mar 2000 A
6038544 Machin Mar 2000 A
6039575 L'Allier et al. Mar 2000 A
6055314 Spies et al. Apr 2000 A
6057841 Thurlow et al. May 2000 A
6058163 Pattison et al. May 2000 A
6061798 Coley et al. May 2000 A
6072860 Kek et al. Jun 2000 A
6076099 Chen et al. Jun 2000 A
6078894 Clawson et al. Jun 2000 A
6091712 Pope et al. Jul 2000 A
6108711 Beck et al. Aug 2000 A
6122665 Bar et al. Sep 2000 A
6122668 Teng et al. Sep 2000 A
6130668 Stein Oct 2000 A
6138139 Beck et al. Oct 2000 A
6144991 England Nov 2000 A
6146148 Stuppy Nov 2000 A
6151622 Fraenkel et al. Nov 2000 A
6154771 Rangan et al. Nov 2000 A
6157808 Hollingsworth Dec 2000 A
6171109 Ohsuga Jan 2001 B1
6182094 Humpleman et al. Jan 2001 B1
6195679 Bauersfeld et al. Feb 2001 B1
6201948 Cook et al. Mar 2001 B1
6211451 Tohgi et al. Apr 2001 B1
6225993 Lindblad et al. May 2001 B1
6230197 Beck et al. May 2001 B1
6236977 Verba et al. May 2001 B1
6244758 Solymar et al. Jun 2001 B1
6249570 Glowny et al. Jun 2001 B1
6282548 Burner Aug 2001 B1
6286030 Wenig et al. Sep 2001 B1
6286046 Bryant Sep 2001 B1
6288753 DeNicola et al. Sep 2001 B1
6289340 Puram et al. Sep 2001 B1
6301462 Freeman et al. Oct 2001 B1
6301573 McIlwaine et al. Oct 2001 B1
6324282 McIlwaine et al. Nov 2001 B1
6347374 Drake et al. Feb 2002 B1
6351467 Dillon Feb 2002 B1
6353851 Anupam et al. Mar 2002 B1
6360250 Anupam et al. Mar 2002 B1
6370574 House et al. Apr 2002 B1
6404857 Blair et al. Jun 2002 B1
6411989 Anupam et al. Jun 2002 B1
6418471 Shelton et al. Jul 2002 B1
6459787 McIllwaine et al. Oct 2002 B2
6463445 Suzuki et al. Oct 2002 B1
6487195 Choung et al. Nov 2002 B1
6493758 McLain Dec 2002 B1
6502131 Vaid et al. Dec 2002 B1
6510220 Beckett, II et al. Jan 2003 B1
6523113 Wehrenberg Feb 2003 B1
6529602 Walker et al. Mar 2003 B1
6535909 Rust Mar 2003 B1
6542602 Elazar Apr 2003 B1
6546405 Gupta et al. Apr 2003 B2
6560328 Bondarenko et al. May 2003 B1
6567812 Garrecht et al. May 2003 B1
6583806 Ludwig et al. Jun 2003 B2
6587852 Svingen et al. Jul 2003 B1
6606657 Zilberstein Aug 2003 B1
6625734 Marvit et al. Sep 2003 B1
6665644 Kanevsky et al. Dec 2003 B1
6674447 Chiang et al. Jan 2004 B1
6683633 Holtzblatt et al. Jan 2004 B2
6697858 Ezerzer et al. Feb 2004 B1
6724887 Eilbacher et al. Apr 2004 B1
6738456 Wrona et al. May 2004 B2
6757361 Blair et al. Jun 2004 B2
6772396 Cronin et al. Aug 2004 B1
6775377 McIlwaine et al. Aug 2004 B2
6782412 Brophy et al. Aug 2004 B2
6792575 Samaniego et al. Sep 2004 B1
6810414 Brittain Oct 2004 B1
6820083 Nagy et al. Nov 2004 B1
6823384 Wilson et al. Nov 2004 B1
6870916 Henrikson et al. Mar 2005 B2
6901438 Davis et al. May 2005 B1
6910072 Macleod Beck Jun 2005 B2
6912513 Candelore Jun 2005 B1
6931408 Adams et al. Aug 2005 B2
6954854 Miura et al. Oct 2005 B1
6959078 Eilbacher et al. Oct 2005 B1
6965886 Govrin et al. Nov 2005 B2
6981138 Douceur et al. Dec 2005 B2
6986030 Shmueli et al. Jan 2006 B2
7042987 Schwartz et al. May 2006 B2
7073063 Peinado Jul 2006 B2
7103593 Dean Sep 2006 B2
7124304 Bel et al. Oct 2006 B2
7130426 Cha et al. Oct 2006 B1
7146356 Choi et al. Dec 2006 B2
7242771 Shiragami et al. Jul 2007 B2
7304855 Milligan et al. Dec 2007 B1
7346774 Douceur et al. Mar 2008 B2
7352867 Medvinsky Apr 2008 B2
7386452 Bates et al. Jun 2008 B1
7389240 Nygren et al. Jun 2008 B2
7412531 Lango et al. Aug 2008 B1
7499531 Claudatos et al. Mar 2009 B2
7503073 Kawamoto et al. Mar 2009 B2
7533404 Sinz et al. May 2009 B2
7587404 Albertelli, Jr. Sep 2009 B1
7657534 Kirkegaard Feb 2010 B2
7701972 Williams et al. Apr 2010 B1
7706520 Waterson et al. Apr 2010 B1
7769176 Watson et al. Aug 2010 B2
7848510 Shaffer et al. Dec 2010 B2
7881471 Spohrer et al. Feb 2011 B2
7965828 Calahan et al. Jun 2011 B2
8000465 Williams et al. Aug 2011 B2
8094557 Messing et al. Jan 2012 B2
8094786 Ilan et al. Jan 2012 B2
8102973 Peterson Jan 2012 B2
8139741 Calahan et al. Mar 2012 B1
8165113 Peters et al. Apr 2012 B1
RE43386 Blair et al. May 2012 E
8249244 Naparstek et al. Aug 2012 B2
8259711 Elazar et al. Sep 2012 B2
20010000962 Rajan May 2001 A1
20010032335 Jones Oct 2001 A1
20010042048 Boykin et al. Nov 2001 A1
20010043697 Cox et al. Nov 2001 A1
20020038363 MacLean Mar 2002 A1
20020049589 Poirier Apr 2002 A1
20020052948 Baudu et al. May 2002 A1
20020064283 Parenty May 2002 A1
20020065911 Von Klopp et al. May 2002 A1
20020065912 Catchpole et al. May 2002 A1
20020075880 Dolinar et al. Jun 2002 A1
20020080969 Giobbi Jun 2002 A1
20020128925 Angeles Sep 2002 A1
20020143925 Pricer et al. Oct 2002 A1
20020144116 Giobbi Oct 2002 A1
20020165954 Eshghi et al. Nov 2002 A1
20020184537 Inokuchi et al. Dec 2002 A1
20030016826 Asano et al. Jan 2003 A1
20030028765 Cromer et al. Feb 2003 A1
20030041253 Matsui et al. Feb 2003 A1
20030055883 Wiles et al. Mar 2003 A1
20030065941 Ballard et al. Apr 2003 A1
20030079020 Gourraud et al. Apr 2003 A1
20030144900 Whitmer Jul 2003 A1
20030154240 Nygren et al. Aug 2003 A1
20030204736 Garrison et al. Oct 2003 A1
20040010468 Abe et al. Jan 2004 A1
20040049473 Gower et al. Mar 2004 A1
20040100507 Hayner et al. May 2004 A1
20040165717 McIlwaine et al. Aug 2004 A1
20040207724 Crouch et al. Oct 2004 A1
20040208165 Cai et al. Oct 2004 A1
20040230571 Robertson Nov 2004 A1
20050050345 Dowdy et al. Mar 2005 A1
20050062843 Bowers et al. Mar 2005 A1
20050138560 Lee et al. Jun 2005 A1
20050144459 Qureshi et al. Jun 2005 A1
20050190947 Dulac Sep 2005 A1
20050249350 Kahn et al. Nov 2005 A1
20050265323 Thermond Dec 2005 A1
20050271211 Takemura Dec 2005 A1
20060074881 Vembu et al. Apr 2006 A1
20060087555 Boyd et al. Apr 2006 A1
20060146805 Krewson Jul 2006 A1
20060149399 Norhammar et al. Jul 2006 A1
20060158737 Hu et al. Jul 2006 A1
20060168111 Gidwani Jul 2006 A1
20060173957 Robinson et al. Aug 2006 A1
20070036283 Shaffer et al. Feb 2007 A1
20070043608 May et al. Feb 2007 A1
20070058793 Li et al. Mar 2007 A1
20070088704 Bourne et al. Apr 2007 A1
20070100981 Adamczyk et al. May 2007 A1
20070174067 Ito et al. Jul 2007 A1
20070198323 Bourne et al. Aug 2007 A1
20070201502 Abramson Aug 2007 A1
20070206768 Bourne et al. Sep 2007 A1
20070230345 Spohrer et al. Oct 2007 A1
20070297610 Chen et al. Dec 2007 A1
20080037719 Doren Feb 2008 A1
20080080685 Barnes et al. Apr 2008 A1
20080123628 Everard May 2008 A1
20090016522 Torres et al. Jan 2009 A1
20090295536 Doren Dec 2009 A1
Foreign Referenced Citations (6)
Number Date Country
0453128 Oct 1991 EP
0773687 May 1997 EP
0989720 Mar 2000 EP
2369263 May 2002 GB
1998043380 Nov 1998 WO
2000016207 Mar 2000 WO
Non-Patent Literature Citations (105)
Entry
Aspect Call Center Product Specification, “Release 2.0”, Aspect Telecommunications Corporation, May 23, 1998, p. 798.
“Customer Spotlight: Navistar International,” Web page, unverified print date of Apr. 1, 2002.
DKSystems Integrates QM Perception with OnTrack for Training, Web page, unverified print date of Apr. 1, 2002, unverified cover date of Jun. 15, 1999.
Abstract, net.working: “An Online Webliography,” Technical Training pp. 4-5 (Nov./Dec. 1998).
Adams et al., “Our Turn-of-the-Century Trend Watch” Technical Training, pp. 46-47, (Nov./Dec. 1998).
Anderson: Interactive TVs New Approach, The Standard, Oct. 1, 1999.
Ante, “Everything You Ever Wanted to Know About Cryptography Legislation . . . (But Were too Sensible to Ask)”, PC World Online, Dec. 14, 1999.
Barron, “The Road to Performance: Three Vignettes,” Technical Skills and Training, pp. 12-14 (Jan. 1997).
Bauer, “Technology Tools: Just-in-Time Desktop Training is Quick, Easy, and Affordable,” Technical Training, pp. 8-11 (May/Jun. 1998).
Beck et al., “Applications of AI in Education,” AMC Crossroads vol. 1:1-13 (Fall 1996), Web page, unverified print date of Apr. 12, 2002.
Benson and Cheney, “Best Practices in Training Delivery,” Technical Training pp. 14-17 (Oct. 1996).
Bental and Cawsey, “Personalized and Adaptive Systems for Medical Consumer Applications,” Communications ACM 45(5):62-63 (May 2002).
Berst, “It's Baa-aack. How Interactive TV is Sneaking Into Your Living Room”, The AnchorDesk, May 10, 1999.
Berst, “Why Interactive TV Won't Turn You on (Yet)”, The AnchorDesk, Jul. 13, 1999.
Blumenthal et al., “Reducing Development Costs with Intelligent Tutoring System Shells,” pp. 1-5, Web page, unverified print date of Apr. 9, 2002, unverified cover date of Jun. 10, 1996.
Borland and Davis, “US West Plans Web Services on TV”, CNETNews.com, Nov. 22, 1999.
Brown, “Let PC Technology Be Your TV Guide”, PC Magazine, Jun. 7, 1999.
Brown, “Interactive TV: The Sequel”, NewMedia, Feb. 10, 1998.
Brusilovsky, “Adaptive Educational Systems on the World-Wide-Web: A Review of Available Technologies,” pp. 1-10, Web Page, unverified print date of Apr. 12, 2002.
Brusilovsky, et al., “Distributed intelligent tutoring on the Web,” Proceedings of the 8th World Conference of the AIED Society, Kobe, Japan, Aug. 18-22, pp. 1-9 Web page, unverified print date of Apr. 12, 2002, unverified cover date of Aug. 18-22, 1997.
Brusilovsky, et al., ISIS-Tutor: An Intelligent Learning Environment for CD/ISIS Users, pp. 1-15 Web page, unverified print date of May 2, 2002.
“Building Customer Loyalty Through Business-Driven Recording of Multimedia Interactions in your Contact Center,” Witness Systems promotional brochure for eQuality, (2000).
Byrnes et al., “The Development of a Multiple-Choice and True-False Testing Environment on the Web,” pp. 1-8, Web page, unverified print date Apr. 12, 2002, unverified cover date of 1995.
Calvi and De Bra, “Improving the Usability of Hypertext Courseware through Adaptive Linking,” ACM, unknown page numbers (1997).
Center Products We Saw in 1999, Web page, unverified print date of Mar. 20, 2002, unverified cover date of Feb. 1, 2000.
Cline, “Deja vu—Will Interactive TV Make It This Time Around?”, DevHead, Jul. 9, 1999.
Coffey, “Are Performance Objectives Really Necessary?” Technical Skills and Training pp. 25-27 (Oct. 1995).
Cohen, “Knowledge Management's Killer App,” pp. 1-11, Web page, unverified print date of Apr. 12, 2002, unverified cover date of 2001.
Cole-Gomolski, “New ways to manage E-Classes,” Computerworld 32(48):4344 (Nov. 30, 1998).
Cross, “Sun Microsystems—the SunTAN Story,” Internet Time Group 8 (2001).
Crouch, “TV Channels on the Web”, PC World, Sep. 15, 1999.
D'Amico, “Interactive TV Gets $99 set-top box,” IDG.net, Oct. 6, 1999.
Davis, “Satellite Systems Gear Up for Interactive TV Fight”, CNETNews.com, Sep. 30, 1999.
De Bra et al., “Adaptive Hypermedia: From Systems to Framework,” ACM (2000).
De Bra, “Adaptive Educational Hypermedia on the Web,” Communications ACM 45(5):60-61 (May 2002).
Dennis and Gruner, “Computer Managed Instruction at Arthur Andersen & Company: A Status Report,” Educational Technical, pp. 7-16 (Mar. 1992).
Diederich, “Web TV Data Gathering Raises Privacy Concerns”, ComputerWorld, Oct. 13, 1998.
Diessel et al., “Individualized Course Generation: A Marriage Between CAL and ICAL,” Computers Educational 22(1/2)57-64 (1994).
Dyreson, “An Experiment in Class Management Using the World-Wide Web,” pp. 1-12, Web page, unverified print date of Apr. 12, 2002.
EchoStar, “MediaX Mix Interactive Multimedia With Interactive Television”, PRNews Wire, Jan. 11, 1999.
E Learning Community, “Excellence in Practice Award: Electronic Learning Technologies,” Personal Learning Network pp. 1-11, Web page, unverified print date of Apr. 12, 2002.
Eklund and Brusilovsky, “The Value of Adaptivity in Hypermedia Learning Environments: A Short Review of Empirical Evidence,” pp. 1-8, Web page, unverified print date of May 2, 2002.
E-Learning the future of learning, THINQ Limited, London, Version 1.0 (2000).
Eline, “A Trainer's Guide to Skill Building,” Technical Training pp. 34-41 (Sep./Oct. 1998).
Eline, “Case Study: Bridging the Gap in Canada's IT Skills,” Technical Skills and Training pp. 23-25 (Jul. 1997).
Eline, “Case Study: IBT's Place in the Sun,” Technical Training pp. 12-17 (Aug./Sep. 1997).
Fritz, “CB templates for productivity: Authoring system templates for trainers,” Emedia Professional 10(8):6876 (Aug. 1997).
Fritz, “ToolBook II: Asymetrix's updated authoring software tackles the Web,” Emedia Professional 10(2):102106 (Feb. 1997).
Furger, “The Internet Meets the Couch Potato”, PCWorld, Oct. 1996.
Gibson et al., “A Comparative Analysis of Web-Based Testing and Evaluation Systems,” pp. 1-8, Web page, unverified print date of Apr. 11, 2002.
Hallberg and DeFlore, “Curving Toward Performance: Following a Hierarchy of Steps Toward a Performance Orientation,” Technical Skills and Training pp. 9-11 (Jan. 1997).
Harsha, “Online Training “Sprints” Ahead,” Technical Training pp. 27-29 (Jan./Feb. 1999).
Heideman, “Training Technicians for a High-Tech Future: These six steps can help develop technician training for high-tech work,” pp. 11-14 (Feb./Mar. 1995).
Heideman, “Writing Performance Objectives Simple as A-B-C (and D),” Technical Skills and Training pp. 5-7 (May/Jun. 1996).
Hollman, “Train Without Pain: The Benefits of Computer-Based Training Tools,” pp. 1-11, Web page, unverified print date of Mar. 20, 2002, unverified cover date of Jan. 1, 2000.
“Hong Kong Comes First with Interactive TV”, SCI-TECH, Dec. 4, 1997.
Kane, AOL-Tivo: You've Got Interactive TV, ZDNN, Aug. 17, 1999.
Kay, “E-Mail in Your Kitchen”, PC World Online, Mar. 28, 1996.
“Keeping an Eye on Your Agents,” Call Center Magazine, pp. 32-34, Feb. 1993 LPRs & 798.
Kenny, “TV Meets Internet”, PC World Online, Mar. 28, 1996.
Koonce, “Where Technology and Training Meet,” Technical Training pp. 10-15 (Nov./Dec. 1998).
Kursh, “Going the distance with Web-based training,” Training and Development 52(3):5053 (Mar. 1998).
Larson, “Enhancing Performance Through Customized Online Learning Support,” Technical Skills and Training pp. 25-27 (May/Jun. 1997).
Linderholm, “Avatar Debuts Home Theater PC”, PC World Online, Dec. 1, 1999.
Linton et al., “OWL: A Recommender System for Organization-Wide Learning,” Educational Technical Society 3(1):62-76 (2000).
Lucadamo and Cheney, “Best Practices in Technical Training,” Technical Training pp. 21-26 (Oct. 1997).
McNamara, “Monitoring Solutions: Quality Must Be Seen and Heard,” Inbound/Outbound pp. 66-67 (Dec. 1989).
Merrill, “The New Component Design Theory: Instruction design for courseware authoring,” Instructional Science 16:19-34 (1987).
Metheus X Window Record and Playback, XRP Features and Benefits, 2 pages, Sep. 1994 LPRs.
Minton-Eversole, “IBT Training Truths Behind the Hype,” Technical Skills and Training pp. 15-19 (Jan. 1997).
Mizoguchi, “Intelligent Tutoring Systems: The Current State of the Art,” Trans. IEICE E73(3):297-307 (Mar. 1990).
Mostow, et al., “The Sounds of Silence: Towards Automated Evaluation of Student Learning a Reading Tutor that Listens” American Association for Artificial Intelligence, Web page, unknown date Aug. 1997.
Mullier et al., “A Web base Intelligent Tutoring System,” pp. 1-6, Web page, unverified print date of May 2, 2002.
Nash, Database Marketing, McGraw Hill, Inc., USA, 1993, pp. 158-165, 172-185.
Needle, “Will the Net Kill Network TV?”, PC World Online, Mar. 10, 1999.
Nelson et al., “The Assessment of End-User Training Needs,” Communications ACM 38(7):27-39 (Jul. 1995).
O'Herron, “CenterForce Technologies' CenterForce Analyzer,” Web page, unverified print date of Mar. 20, 2002, unverified cover date of Jun. 1, 1999.
O'Roark, “Basic Skills Get a Boost,” Technical Training pp. 10-13 (Jul./Aug. 1998).
“On Evaluating Educational Innovations,” Pamphlet authored by Alan Lesgold, unverified cover date of Mar. 5, 1998.
“OnTrack Online” Delivers New Web Functionality, Web page, unverified print date of Apr. 2, 2002, unverified cover date of Oct. 5, 1999.
Papa et al., “A Differential Diagnostic Skills Assessment and Tutorial Tool,” Computer Education 18(1-3):45-50 (1992).
Phaup, “New Software Puts Computerized Tests on the Internet: Presence Corporation announces breakthrough Question Mark Web product,” Web page, unverified print date of Apr. 1, 2002.
Phaup, “QM Perception Links with Integrity Training's WBT Manager to Provide Enhanced Assessments for Web-Based Courses,” Web page, unverified print date of Apr. 1, 2002, unverified cover date of Mar. 25, 1999.
Phaup, “Question Mark Introduces Access Export Software,” Web page, unverified print date of Apr. 2, 2002, unverified cover date of Mar. 1, 1997.
Phaup, “Question Mark Offers Instant Online Feedback for Web Quizzes and Questionnaires: University of California assist with Beta Testing, Server scripts now available to high-volume users,” Web page, unverified print date of Apr. 1, 2002, unverified cover date of May 6, 1996.
Piskurich, “Now-You-See-'Em, Now-You-Don't Learning Centers,” Technical Training pp. 18-21 (Jan./Feb. 1999).
“Price Waterhouse Coopers Case Study: the Business Challenge,” Web page, unverified cover date of 2000.
Read, “Sharpening Agents' Skills,” pp. 1-15, Web page, unverified print date of Mar. 20, 2002, unverified cover date of Oct. 1, 1999.
Reid, “On Target: Assessing Technical Skills,” Technical Skills and Training pp. 6-8 (May/Jun. 1995).
Rohde, “Gates Touts Interactive TV”, InfoWorld, Oct. 14, 1999.
Ross, “Broadcasters Use TV Signals to Send Data”, PC World, Oct. 1996.
Stewart, “Interactive Television at Home: Television Meets the Internet”, Aug. 1998.
Stormes, “Case Study: Restructuring Technical Training Using ISD,” Technical Skills and Training pp. 23-26 (Feb./Mar. 1997).
Tennyson, “Artificial Intelligence Methods in Computer-Based Instructional Design,” Journal of Instruction Development 7(3):17-22 (1984).
Tinoco et al., “Online Evaluation in WWW-based Courseware,” ACM pp. 194-198 (1997).
Uiterwijk et al., “The virtual classroom,” InfoWorld 20(47):6467 (Nov. 23, 1998).
Unitas, “A Single View: Integrating Structured and Unstructured Data/Information within the Enterprise,” 2002, 20 pages.
Unknown Author, “Long-distance learning,” InfoWorld 20(36):7276 (1998).
Untitled, 10th Mediterranean Electrotechnical Conference vol. 1 pp. 124-126 (2000).
Watson and Belland, “Use of Learner Data in Selecting Instructional Content for Continuing Education,” Journal of Instructional Development 8(4):29-33 (1985).
Weinschenk, “Performance Specifications as Change Agents,” Technical Training pp. 12-15 (Oct. 1997).
Wilson, “U.S. West Revisits Interactive TV”, Interactive Week, Nov. 28, 1999.
International Search Report and the Written Opinion of the International Searching Authority, dated Sep. 24, 2008.
Interrnational Search Report and the Written Opinion of the International Searching Authority, dated Apr. 9, 2009.
International Search Report, International Application No. PCT/US03/02541, dated May 12, 2003.
Related Publications (1)
Number Date Country
20160253393 A1 Sep 2016 US
Provisional Applications (1)
Number Date Country
60847872 Sep 2006 US
Continuations (2)
Number Date Country
Parent 13114620 May 2011 US
Child 15057171 US
Parent 11693857 Mar 2007 US
Child 13114620 US