US 9,563,707 B2Grant
System and methods for searching and communication
Issue Date:2017-02-07
•30 Claims
•11 Drawing Sheets
Abstract
Described are computer-based methods and apparatuses, including computer program products, comprising the steps of, or structure for, storing a plurality of expert profiles in a database, each of the plurality of expert profiles comprising information associated with a person having knowledge in a particular category, subject or topic; receiving search criteria over a network from a query source; selecting at least one of the plurality of expert profiles comprising information that satisfy the search criteria; and transmitting expert profile data for each of the selected expert profiles to the remote search engine, the expert profile data comprising data that defines a displayable representation of a corresponding expert profile, the expert profile data further comprising data that facilitates a client-initiated, real-time communication session over the network with a person associated with the corresponding expert profile.
Metadata
Assignee
- LivePerson, Inc.
Inventors
- Matan Barak
- Julius Schorzman
- Nir Holtzman Ninio
- Uri Goldstein
Application Information
Application Number:US 14/711,609
Filing Date:2015-05-13
Priority Date:2008-08-04
Art Unit:2167
Classifications
IPC:
G06F17/30G06F17/22H04L12/58H04L29/06H04L12/911
Field of Search:
G06F 17/30545G06F 17/30864
Patent Drawings (11 sheets)
Description
Cross Reference to Related Applications
[0001] This application is a continuation of Ser. No. 14/500,502, filed Sep. 29, 2014; which is a continuation of Ser. No. 14/317,346, filed Jun. 27, 2014; which is a continuation of Ser. No. 12/725,999, filed Mar. 17, 2010; which is a continuation of U.S. application Ser. No. 12/535,539, filed Aug. 4, 2009; which claims the benefit of and priority to U.S. Provisional Application 61/085,992, filed Aug. 4, 2008, the entire disclosures of which are incorporated by reference herein.
Field of the Invention
[0002] The present invention relates generally to computerized methods and apparatuses, including computer program products, which can interact with standard search engines or other query sources to enable searches for, and establish user communications with, an expert (e.g., a person having knowledge in a particular category, subject or topic) over a computerized network infrastructure.
Background
[0003] There are various web search engines available for users to search for information on the World Wide Web (WWW). Some search engines operate by storing information about web pages retrieved by a web crawler. A web crawler is an automated web indexing program that accesses a web site, traverses through the site by following the links present on the pages, and compiles an index of those links and the information available via the links. The compiled index is stored in a database for use by a search engine.
[0004] When a user enters a keyword search query via a client terminal into a web-based search engine, the search engine examines the index and compiles a set of search results that match the keyword query. The search results are usually transmitted back to the client computer for presentation through a browser application to the user in the form of an ordered listing of web pages, images, information, and other types of files.
Summary of the Invention
[0005] The techniques described herein provide computer-based methods and apparatuses, including computer program products, which can interact with standard search engines or other query sources to enable searches for, and establish user communications with, an expert (e.g., a person having knowledge in a particular category, subject or topic) over a computerized network infrastructure.
[0006] According to one aspect, such computerized methods and apparatuses include the steps of, or structure for, storing a plurality of expert profiles in a database, each of the plurality of expert profiles comprising information associated with a person having knowledge in a particular category; receiving search criteria over a network from a query source; selecting at least one of the plurality of expert profiles comprising information that satisfy the search criteria; and transmitting expert profile data for each of the selected expert profiles to the remote search engine, the expert profile data comprising data that defines a displayable representation of a corresponding expert profile, the expert profile data further comprising data that facilitates a client-initiated, real-time communication session over the network with a person associated with the corresponding expert profile. The expert profile data can further comprise data that facilitates a client-initiated, non-real-time communication session over the network with the person associated with the corresponding expert profile. The query source can be a remote search engine, for example. The search criteria can be based on a search query from the remote search engine.
[0007] According to another aspect, such computerized methods and apparatuses can include the steps of, or structure for, tracking information regarding each expert and determining a ranking of the experts and their corresponding profiles based on such information.
[0008] According to a first embodiment, such computerized methods and apparatuses can include the steps of, or structure for, tracking, for each of the plurality of expert profiles, revenue opportunities corresponding to displays of the expert profile within prior listings of search results and tracking revenues realized from client-initiated, real-time communication sessions associated with one or more of the revenue opportunities; determining, for each of the plurality of expert profiles, a ranking for the expert profile based on a ratio of the revenues realized relative to the revenue opportunities; and sorting the selected expert profiles for transmission within an ordered listing of search results to the query source according to the ranking determined for each of the selected expert profiles.
[0009] According to a second embodiment, such computerized methods and apparatuses can include the steps of, or structure for, such computerized methods and apparatuses can include the steps of, or structure for, tracking, for each of the plurality of expert profiles, revenue opportunities corresponding to displays of the expert profile within prior listings of search results, tracking online revenues realized from client-initiated, real-time communication sessions associated with one or more of the revenue opportunities, and tracking offline revenues realized from client-initiated, non-real-time communication sessions associated with one or more of the revenue opportunities; determining, for each of the plurality of expert profiles, an online ranking for the expert profile associated with an online status of the expert and an offline ranking for the expert profile associated with an offline status of the expert, wherein the online ranking is based on a ratio of the online revenues realized relative to the revenue opportunities and the offline ranking is based on a ratio of the offline revenues realized relative to the revenue opportunities; sorting the selected expert profiles for transmission within an ordered listing of search results according to one of the online ranking and offline ranking determined for each of the selected expert profiles; and transmitting the data associated with the selected expert profiles to the query source for display within the ordered listing of search results.
[0010] Any of the aforementioned embodiments can further include one or more of the following features. For example, such computerized methods and apparatuses can further include the steps of, or structure for, tracking positions of the expert profile within the prior listings of search results; applying weights to the revenue opportunities associated with the expert profile according to the tracked positions, resulting in weighted revenue opportunities that compensate for position bias; and determining the ranking, including online and offline rankings, for the expert profile based on a ratio of the revenue realized relative to weighted revenue opportunities. Such computerized methods and apparatuses can further include the steps of, or structure for, shuffling the ordered listing of search results prior to transmission of the expert profile data, such that at least one of the selected expert profiles is moved from a lower position within the ordered listing of search results to a higher position. Online, real-time communication sessions can comprise at least real-time chat sessions over a network, and offline, non-real-time communication sessions can comprise at least offline email sessions.
[0011] Other aspects and advantages of the present invention will become apparent from the following detailed description, taken in conjunction with the accompanying drawings, illustrating the principles of the invention by way of example only.
Brief Description of the Drawings
[0012] The foregoing and other objects, features, and advantages of the present invention, as well as the invention itself, will be more fully understood from the following description of various embodiments, when read together with the accompanying drawings.
[0013] FIG. 1 is a diagram that illustrates a computerized system in which an expert search server system interacts with a remote search engine according to one embodiment;
[0014] FIG. 2 is flow diagram that illustrates a method in which the expert search server system of FIG. 1 interacts with standard search engines enabling searches for, and establishing user communications with, an expert over a network according to one embodiment;
[0015] FIG. 3 is a flow diagram that illustrates a method for tracking information regarding each expert and determining a ranking of the experts and their corresponding profiles based on such information according to one embodiment;
[0016] FIGS. 4 and 5 are exemplary diagrams of charts displaying information relevant to expert profile selection;
[0017] FIG. 6 is an exemplary screenshot showing an experts search results page provided through a search engine according to one embodiment;
[0018] FIG. 7 is an exemplary screenshot showing an experts search results page on the expert search server through a browser according to one embodiment;
[0019] FIG. 8 is an exemplary screenshot showing an expert search server webpage for searching experts by category according to one embodiment;
[0020] FIG. 9 is an exemplary screenshot showing an expert profile page on an expert search server website according to one embodiment; and
[0021] FIGS. 10A and 10B are exemplary screenshots showing expert profile pages presented by a generic search engine communicating using Application Programming Interface (API) calls with an expert search engine according to one embodiment.
Detailed Description
[0022] Disclosed are embodiments of computerized methods and apparatuses, including computer program products, which can interact with standard search engines or other query sources to enable searches for, and establish user communications with, an expert (e.g., a person having knowledge in a particular category, subject or topic) over a computerized network infrastructure.
[0023] Such embodiments can include an expert search server system that stores expert profiles in a database that contain information associated with persons having registered themselves with the system as experts in a particular category, subject or topic for the purpose of providing their knowledge as an online and/or offline service available through the expert search server system. The expert search server system can receive search criteria transmitted over a computerized network infrastructure (hereinafter “network”) from various query sources, such as search engines, operating remotely from the system. In response, the expert search system can analyze its database to select expert profiles satisfying the search criteria. Thereafter, the expert search system transmits data associated with the selected expert profiles to the respective query sources for use, including presentation of such profiles at the client computers.
[0024] For example, the expert profile data transmitted to the respective search engines can include data that defines a displayable representation (e.g., graphics and/or text) of the selected profiles for display as individual results within an ordered listing of search results. Further the expert profile data can further include data that facilitates client-initiated online, real-time communication sessions and/or offline, non-real-time communication sessions over the network with the corresponding experts through the system. Accordingly, the client computer receiving such expert profile data can attempt to establish communication on behalf of the end user with an expert identified in the search results. Online, real-time communication sessions can include real-time chat sessions over a network or internet telephony-based sessions, and offline, non-real-time communication sessions can include email or text messaging.
[0025] FIG. 1 is a diagram that illustrates a computerized system in which an expert search server system interacts with a remote search engine according to one embodiment. As shown, the expert search server system 102 includes one or more expert search servers 104 in communication with a database 106 and a chat engine 108. Alternatively, the chat engine 108 can be replaced, or combined, with another communication server supporting email, internet telephony, or text messaging communication sessions, for example.
[0026] A search engine 110, operating remotely from the expert search system 102, communicates with the expert search server 104 over a network, such as the Internet. The search engine 110 can be implemented as a stand alone server or as an embedded service of a web page. In particular implementations, the search engine, in communication with the expert search server system 102, can provide listing of expert profiles as search results in response to user-input search queries (e.g., Ask.com)
[0027] A computer or other computerized terminal 112 associated with an end user (hereinafter “client computer 112”) can interact with the search engine 110 or other query source over a network. A computer or other computerized terminal 114 associated with an end user that is registered with the expert search server 104 as an “expert” (hereinafter “expert computer 114”) interacts with the expert search server 104 over a network. The client computer 112 and the expert computer 114 can be any general purpose computer, and preferably a computer that executes a web browsing software application. In certain embodiments, the client computer 112 and/or the expert computer 112 can be any computerized device, such as personal digital assistants (PDA) and mobile devices. The client computer 112 and the expert computer 114 can also communicate with each other through the chat engine 108 or other communication server of the expert search system 102 for email, text messaging, internet telephony.
[0028] The database 106 can act as a central source of data, including the expert profile information, for access by servers within the expert search system 102. In particular embodiments, the expert search server 104 and/or chat engine 108 can cache data obtained from the database 106 reducing the volume of database accesses. In such embodiments, whenever the expert profile information is updated on the database 106, the database can cause the other servers/services, through an associated trigger system, to update their locally cached data to reflect the changes made to the database 106. The triggering system (not shown) can be a computerized application service that interfaces with the database 106 and provides notifications of database changes to the servers within the expert search system 102. For example, the database 106 can maintain the status of each expert registered with the expert search system 102. Accordingly, the triggering system can be configured to send notifications whenever there is a change to an expert's status, e.g., online or offline and available or busy.
[0029] Other query sources, in addition to remote search engines, can be used as well. For example, a web banner can include code that, when executed or otherwise invoked by the client computer, automatically requests and displays listings of expert profiles by causing transmission of a hard-coded search query to the expert search server. For example, a web banner embedded within a web page dedicated to discussion threads and other information regarding Java programming can be used to present access to experts in Java programming available for contact.
[0030] Another query source can include so-called “category pages” that present listings of user-selectable categories (e.g., Style & Fashion, Psychics, Java Programming etc.). In response to user selection of a category link, code embedded in the category page can be invoked by the client computer to automatically request and display listings of expert profiles by causing transmission of a hard-coded search query to the expert search server.
[0031] Another query source can include various social networking sites (e.g., Facebook™, Twitter™) through which users can post queries to their “friends” and/or “friends of friends.” For example, a social networking site can be configured with code, such that when a user posts a query to the social networking site for publishing to his or her friends, the code can be executed causing a server within the social networking site to transmit the posted query to the expert search server, thus automatically requesting a listing of expert profiles capable of handing such query for display.
[0032] Another query source can include so-called answer services, such as Aardvark™ Using the Aardvark™ answer service, a user can submit a question to the service via an instant message or e-mail. In turn, the Aardvark™ answer service identifies friends of the user, such as Facebook™ friends, that volunteer to answer the user's question. Thereafter, the answer service forwards the answer from the volunteer back to the requesting user that originally posted the question. Embodiments of the present invention can complement such answer services by also forwarding such queries to the expert search server, which in turn can provide the answer service with data associated with one or more expert profiles capable of handing such query and data to facilitate a client-initiated, communication session over the network with a person associated with the corresponding expert profile. Accordingly, with such information, either the answer service can transmit the question to the expert or forward the expert profile data to the requesting user so that he or she can facilitate a client-initiated, communication session, including email or instant messaging, over the network with the expert.
[0033] FIG. 2 is flow diagram that illustrates a method in which the expert search server system of FIG. 1 interacts with standard search engines enabling searches for, and establishing user communications with, an expert over a network according to one embodiment.
[0034] At step 202, the expert search server 104 stores a plurality of expert profiles in the database 106, such that each of the expert profiles includes information associated with a person having knowledge in a particular category, subject or topic. An end user can register as an expert with the expert search system 102 through a user interface (not shown) presented at the expert computer 114 by the expert search server 104. Upon completion of the registration process, an expert profile can be created and stored in the database 106. In some examples, newly created expert profiles can be approved manually by a support team having access to the expert search system 102, automatic rules in the expert search system 102 that validate portions of the newly created expert profile, or any combination thereof.
[0035] The expert profile can include a expert profile identifier; the name of the expert; online chat address, email address and/or other contact information; identification of one or more categories, subjects or topics in which the expert is knowledgeable; fee structure for services rendered by the expert through the system 102 (e.g., $0.50 per minute for online chat services), and other relevant information. The expert profile preferably includes data including executable instructions defining a displayable representation of the profile (e.g., graphics and/or text describing the expert), and preferably displayable through a web browser application executing on the client computer. The expert profiles can also be linked to a status table that indicates the current status of each expert as online or offline and available or busy, for example.
[0036] At step 204, the expert search server 104 receives search criteria over a network from the remote search engine 110 or other query source. In this example, the search engine 110 generates and transmits a request to the expert search server 104 for a list of expert profiles that satisfy a search query. The expert search request can be triggered in response to automated or manual entry of search queries into the search engine. For example, manual entry can involve the search engine receiving a keyword search query input from user via a client computer 112. Automated entry can involve the search engine being hardcoded with the desired search query. The request for experts can include, for example, the content of the search query, requested format of expert profiles for display (e.g., XML), maximum number of expert profiles, and a relevancy threshold that represents a minimum correlation between the search query and the expert profile information.
[0037] At step 206, the expert search server selects one or more expert profiles containing information that satisfy the search criteria. For example, the server can select matching profiles by referencing an index generated from the expert profile information.
[0038] At step 208, the expert search server 104 transmits data associated with the selected expert profiles to the search engine 110 for display within a listing of search results. Preferably, the expert profile data transmitted to the search engine includes data that facilitates client-initiated online and/or offline sessions over the network with the corresponding expert. Accordingly, the client computer 112 receiving such expert profile data through the search engine can attempt to establish communication over the network with an expert identified in the search results (e.g., online via chat or offline via email).
[0039] At step 210, the search engine 110 causes the display of the selected expert profiles at the client computer 112. In particular implementation, the listing of expert profiles can optionally be displayed in combination with other search results obtained by the search engine 110 from other sources in response to a user search query. For example, FIG. 6 is an exemplary screenshot of search results from a search engine, including displays of expert profiles obtained by request from the expert search system, according to one embodiment. Specifically, the graphical and textual displays of expert profiles 606A, 606B are presented by a third party search engine (Ask.com™) in the search results page 600 in response to the search query 602 regarding tarot cards.
[0040] As shown, each display of the expert profiles 606A, 606B includes a respective picture 608A, 608B, name of the expert 610A, 610B, and brief description 612A, 612B. The user selectable “More” links 614A, 614B can cause the client computer 112 to present more detailed information from the expert profile, such as the profiles shown in FIGS. 9 and 10A . The user selectable “See More Experts” link 618 can cause the search engine to issue another request to the expert search server 104 for another set of expert profiles that satisfy the search query 602, as shown in FIG. 10B . The stars 620A, 620B and numerical values 622A, 622B provide an overall rating for the expert and the number of reviews received for this expert, respectively.
[0041] Furthermore, the display of the expert profiles can also indicate the current status of the selected experts, such as online or offline and available or busy. For example, such status information can be presented to the user in the form of a callback button or other selectable link within the display of the expert profile. The callback button or link is user-selectable causing the client computer 112 to establish communication with the corresponding expert on behalf of the end user.
[0042] For example, as shown in FIG. 6 , the expert profile data transmitted from the expert search server 104 can cause the search engine to display a “Chat With This Person Live” link 616 when the expert is online and available. By selecting the “Chat With This Person Live” link 616, the user of the search engine website 604 can establish an online chat session over the network with the expert associated with the expert profile 606A in real-time between their respective computers 112, 114 through the chat engine 108 of the expert search system 102. Alternatively, where an expert's status is offline and thus the expert is not available for communication at that time, the expert profile data transmitted from the expert search server 104 can cause the search engine to display an “Email This Person Now” link 618. Accordingly, the client can engage in an offline, non-real-time email session with the expert.
[0043] In order for an expert to engage in online, real-time chat communication sessions, an expert can download and install on its expert computer 114 software referred to herein as an expert messenger application. An expert can obtain the software from the expert search server 104 at the time the expert registers with the system 102. Alternatively the expert messenger application is implemented with code supported by standard web browsers, such as a flash application code, avoiding the need to separately download and install such additional software.
[0044] An expert can be considered online if they are logged into the chat engine 108. For example, upon execution at the expert computer 114, the expert messenger application establishes a communication link over the network to the chat engine 108 and then transmits a message notifying the chat engine 108 that the expert is online and available to accept chat requests through the system 102. Conversely, when the expert chat messenger application is closed, the expert is logged off the chat engine 108 and the database 106 is updated to indicate the status of the expert as offline and thus not available to chat with end users. Particular implementations of the expert messenger application can also enable an expert to initiate transmission of messages to the chat engine 108 indicating his or her status. In turn, the chat engine 108, either directly or indirectly through the expert search server 104, can update the current status associated with the corresponding expert profile in the database 106 to indicate the expert's current status.
[0045] Once the user selects the callback button associated with an expert profile to initiate the chat, the client computer 112 executes a client chat application that presents a chat window through which to communicate with the expert. The chat window can be displayed integral to, or a separate from, the page from which the expert search query originated. Preferably, users are not required to separately download or install any communication software on their client computers 112. Rather the client chat application preferably includes code supported by standard web browsers, such as a flash application code.
[0046] The client chat application then directs the client computer 112 to send a request to the chat engine 108 in order to open a unique TCP socket connection over which to communicate with the desired expert. The chat engine 108 includes communication logic necessary to facilitate communication between client and expert computers. In response, the chat engine 108 sends a message over the network to the expert computer 114 notifying the expert messenger application of the user's chat request. Once accepted, preferably all communications between the client computer 112 and the expert computer 114 occur through the chat engine 108 via TCP socket connections. In other words, the client chat application and the expert messenger application communicate over separate TCP sockets connections to the chat engine 108, and the chat engine 108, in turn, delivers such communications over the appropriate destination TCP socket connections to the respective client and expert computers 112, 114. Such communications between the client and the expert can be encrypted to preserve the confidentiality of the conversation.
[0047] In particular embodiments, the expert search system 102 can optionally require user registration and/or payment authorization in advance of establishing the chat session with the expert through the chat engine 108. For example, first-time users can be required to create a user account prior to gaining access to experts over the expert search system 102. Users requesting services from particular experts can also be required to remit or configure payment in advance prior to communicating with the expert.
[0048] According to another aspect, such computerized methods and apparatuses can include the steps of, or structure for, tracking information regarding each expert, determining a ranking of the experts and their corresponding profiles based on such information, and sorting the expert profiles according to their determined prior to transmission to a remote search engine or other query source.
[0049] FIG. 3 is a flow diagram that illustrates a method for tracking information regarding each expert and determining a ranking of the experts and their corresponding profiles based on such information according to one embodiment. At step 302, the expert search server 104 tracks revenue opportunities for each of the plurality of expert profiles and revenues realized from such revenue opportunities. At step 304, the expert search server 104 determines a ranking for each of the selected expert profiles based on a ratio of the revenues realized relative to the revenue opportunities. At step 306, the expert search server 104 sorts the selected expert profiles according to the ranking determined for each profile. In step 308, the expert search server 104 can transmit the selected expert profiles to the remote search engine server 110 or other query source for display within an ordered listing of search results.
[0050] Tracking of Revenue Opportunities and Realized Revenues
[0051] A revenue opportunity is preferably associated with a user view of an expert profile. An expert profile can be deemed viewed by a user in the event that data associated with the expert profile is transmitted to the search engine or other query source for display. For example, particular query sources can enable a user to conduct a search for experts through in a particular category (e.g., “Style & Fashion”). Each time a user selects the category for Style & Fashion, data associated with a list of expert profiles matching that category is transmitted from the expert search server 104 to the query source for presentation to the end user for display. As a result, each expert having profile data transmitted for display within a corresponding listing of search results is deemed to have experienced a revenue opportunity. Accordingly, for each revenue opportunity, the expert search server 104 updates the information associated with the respective expert profiles in the database 106 by incrementing a count representing the number of revenue opportunities (hereinafter “a revenue opportunity count”).
[0052] The expert search server 104 can also preclude certain user views of an expert profile in certain contexts from the revenue opportunity count. For example, in some implementations of the expert search system 102, a registered user can be given access to a personal page (e.g., “My Experts” page) in which to maintain displays of desired expert profiles. Accordingly, user views of profiles in this context are preferably not included in the revenue opportunity count. Likewise, the revenue opportunity count is preferably not incremented multiple times to correspond to multiple views of an expert profile resulting from, for example, a user navigating from a search results page to a page providing more detailed information regarding the expert (e.g., by selecting the “More” link 614A, 614B as shown in FIG. 6 ). Rather, such the revenue opportunity count is incremented once to represent this scenario as a single revenue opportunity.
[0053] Additional information associated with a revenue opportunity can also be tracked. For example, the tracked information can further include, the profile identifier of the expert profile, the current status of the expert (e.g., online or offline), a timestamp corresponding to the display of the expert profile within a listing of search results (and thus viewing of the expert profile), position of the expert profile in the listing, context in which the expert profile is displayed (e.g., category pages, banners, query-based search results pages), a category identifier (if the context is a category page), a banner identifier (if the context is a banner), and/or a search query (if the context is a search results page based on user query).
[0054] The position in the list refers to the actual position of the expert profile as displayed within a listing of search results. For example, if the expert profile is displayed on the second category results page in the fourth position, and ten results are displayed per page, the position in the list for the expert profile is fourteen. Pagination refers to the number of results per page in the context that the expert profile was displayed. For example, a category page can be configured to display ten profiles per page, so the pagination is recorded as ten. However, for a banner embedded within a web page, the number of experts to return in a page may be variable and will need to be recorded individually for each banner.
[0055] Revenues can be realized from real-time and/or non-real-time communication sessions with a client in response to such revenue opportunities. Online, real-time communication sessions can include real-time chat sessions over a network or internet telephony-based sessions; and offline, non-real-time communication sessions can include email or text messaging.
[0056] With respect to online, real-time chat communication sessions, for example, between a user of the client computer 112 and an expert of the expert computer 114, the chat engine 102 can map an identifier associated with the particular chat session to a corresponding expert profile, such that revenues generated from session and other tracking data can be stored in the database 106 for the expert profile.
[0057] With respect to non-real-time email communication sessions, the expert search server 104 providing a mail service or a separate mail server (not shown) within the system 102 can manage local email accounts on the database 106 for the respective experts. For example, when a user selects link 618 to email a corresponding expert, the client computer 112 is redirected to the mail service of the expert search server 104 or a separate mail server (not shown). A user interface can be displayed at the client computer 112 through which the user can write and submit a message directly to the expert's email account in the system 102. Preferably, the user interface comprises one or more forms through which the user can negotiate and/or accept a fee for the expert's services. When the user accepts the expert fee by clicking on an “Accept” button in a form, for example, the expert search server 102 is notified and thereafter updates the database 106, such that the fee along with other information tracked for the particular email session is added to the corresponding expert profile. Once submitted, the mail service/server stores the email message in the expert's email account that is maintained at the database 106. In turn, the expert search server 102 notifies the expert of the incoming email by sending notification through the expert messenger application or a third party email account (e.g., Yahoo™). To obtain the email, the expert can log into the mail service/server and retrieve the message from his or her email account. A user interface can be displayed at the expert computer 112 through which the expert can write and submit an email message to the end user customer. Preferably, the user interface for the expert can also provide one or more forms through which the expert can negotiate a fee for his or her expert services with the end user.
[0058] The following example is a typically use case.
(1) A user views page one of a category of experts containing ten experts.
(2) The user continues to page two of the category which contains another ten experts.
(3) The user clicks on a selectable link to initiate a real-time or non-real-time communication session with the expert in position fifteen.
(4) The user establishes a communication session with the expert, hires the expert according to a particular fee or rate, and subsequently purchases $30 worth of assistance.
[0059] In this example, the tracking data, including the revenue generated from the session (i.e., $30 worth of revenue), is stored in the database 106 and associated with information regarding the corresponding revenue opportunity (e.g., view of the expert profile on the category page). The expert search server 104, by tracking revenue opportunities and any revenue realized from the revenue opportunities, facilitates attribution of the $30 revenue yield to the user view of the expert profile and also tracks the lack of realized revenue to the other nineteen expert profiles considered to have received a revenue opportunity.
[0060] Determining a Ranking for Each of the Selected Expert Profiles
[0061] With respect to step 304, the expert search server 104 determines a ranking for each of the selected expert profiles based on a ratio of the revenues realized relative to the tracked revenue opportunities as show in Equation 1:
ranking metric=revenue/revenue opportunities (1)
ranking metric=revenue/revenue opportunities (1)
[0062] Such ranking can be implemented according to a number of embodiments.
[0063] According to a first embodiment, the expert search server 104 determines a ranking for each expert profile based on total revenues realized by the expert from all communication sessions relative to the total number of revenue opportunities. Certain revenue and revenue opportunities can be excluded from the ranking calculation. For example, chat or email sessions that are initiated with an expert from pages that are either bookmarked or otherwise stored by a user for direct access to the expert are preferably not considered revenue opportunities and thus not included in the calculation of the ranking metric.
[0064] According to a second embodiment, the expert search server 104 can determine an online ranking and an offline ranking for each expert profile based on respective revenues realized by the expert from online, real-time communication sessions and offline, non-real-time communication sessions relative to the total number of revenue opportunities (or relative to the respective numbers of revenue opportunities corresponding to the expert having an online and offline status).
[0065] Accordingly, by determining separate online and offline rankings for an expert, a ranking algorithm that is designed to rank experts having an online status higher than experts having an offline status can be compensated. For example, in a system that ranks online experts higher than offline experts, an expert may log into the expert search system 102 to obtain an online status for the sole purpose of gaining a higher ranking, even though they do not accept live chats other than to push users into offline sessions. Accordingly, this second embodiment can avoid such situations by having the expert search server 104 determine an online ranking and an offline ranking for all experts. As a result, the experts are ranked according to the actual methods of communication despite their current status as either online or offline. For example, if Expert A, who is currently offline, has a higher offline ranking than Expert B's online ranking, Expert A Offline is preferably ranked higher than Expert B, who is currently online.
[0066] In particular implementations, the second embodiment can be modified to handle the special case in which an expert's offline ranking is greater than his or her online ranking. In this special case, the expert search server 102 can be configured to rank the expert according to his or her greater offline ranking even if the expert's current status is online (e.g., if (offline rank>online rank) then online rank=offline rank).
[0067] According to a third embodiment, the expert search server 104 can determine a ranking that accounts for position bias associated with the display of expert profiles in prior listings of search results. Specifically, for each of the selected expert profiles, the expert search server 104 can determine a ranking based on a ratio of the revenues realized relative to the tracked revenue opportunities, such that each of revenue opportunities is weighted to account for position bias associated with the display of the expert profile within prior listings of search results.
[0068] Position bias refers to the tendency of users to commonly select the top search result provided in a listing of search results despite the quality of the underlying content. Furthermore, once a user identifies a satisfactory result, they typically do not continue down the list of search results. As a result, the display of an expert profile is inherently biased according to its position within a listing of search results, thus limiting the effectiveness of the revenue opportunity for that expert. Accordingly, it is preferably to compensate or otherwise adjust the ranking of expert profiles that are repeatedly placed lower on a search results page by applying a weight to each revenue opportunity according to the display position of the expert profile within prior search result listings. As a result, a revenue opportunity in which the expert profile is displayed towards the top of a listing of search results can be weighted less than revenue opportunities in which the expert profile is displayed towards the bottom of a listing of search results. Alternatively, a revenue opportunity in which the expert profile is displayed towards the bottom of a listing can be weighted more than revenue opportunities in which the expert profile is displayed towards the top of the listing.
[0069] For example, as shown in chart 400 of FIG. 4 , the top 10 experts presented on a first search page will usually all have similarly high values (e.g., quality values, click-through values, etc.). However, because the experts are presented in descending order from number 1 through number 10, a user may tend to pick from the experts in the topmost positions. This is because the user generally considers the experts in the top few positions to be the best results for their particular query. In another example, users may not consider experts beyond the first expert to be of sufficiently high enough quality. As a result, experts at the top of the list experience disproportionately higher click-through rates as shown in chart 500 of FIG. 5 . Accordingly, as part of the ranking determination step, the expert search server 104 can use click through rates recorded as additional tracking data to adjust the revenue opportunity count of each expert page view to follow the curve of FIG. 5 . As a result, the value of the revenue opportunity recorded for the experts in the topmost positions can be higher than the value for those further down the page, compensating for the expert's placement.
[0070] Sorting the Identified Expert Profiles According to the Determined Ranking
[0071] With respect to step 306, sorting can be accomplished in a number of embodiments.
[0072] According to a first embodiment, experts can be sorted from highest to lowest based on their ranking metric obtained from Equation 1.
[0073] According to a second embodiment, experts can be sorted to avoid over-ranking so-called “outliers.” For example, if an Expert A makes $300 from one chat session resulting from one revenue opportunity (e.g., one profile view), then Expert A's revenue per opportunity is $300. Likewise, if Expert B makes $30,000 from 200 chat sessions resulting from 10,000 revenue opportunities (e.g., profile views), Expert B's revenue per opportunity is $3. Based on this calculation alone, Expert A is a higher ranking expert than Expert B. However, whereas Expert B has realized significantly more revenue relative to a significantly greater number of revenue opportunities, Expert B is more likely a more experienced, if not better, expert than Expert A. In order to accommodate for such disparity, the range of ranking metrics determined in step 304 can be weighted to incorporate statistical significance. Specifically, when calculating a range of ranking metrics at a confidence interval of, for example, 95%, the weighting can be adjusted to err on the lower bound of the range, which can advantageously prevent users with lower volumes of revenue opportunities from being ranked too high.
[0074] For example, the actual earning potential for an expert can be determined with a certain confidence level as follows. The inputs to this calculation preferably include a confidence level that represents a degree of certainty to which a statistical prediction (e.g., mean value) can be trusted, a sample size that represents the current number of profile views (earning opportunities), a mean value that represents the average value earned per profile view and a standard deviation value that represents the dispersion of the overall data set (e.g. individual fees collected by the expert from the paid sessions). Thus, for a confidence level of 95%, a sample size of 10, a mean value of $50 and a standard deviation of $20, a standard score can be calculated using any standard statistical techniques known to one skilled in the art. Thereafter, the actual earning potential for the expert can be determined using the formula:
Mean±Standard Score(Standard Deviation/√Sample Size)
Mean±Standard Score(Standard Deviation/√Sample Size)
[0075] For the present example, the actual earning potential for this expert has a 95% probability of being between ±$12.40 the mean of $50, and thus a range of $37.60 to $62.40 (i.e. $50±1.96061215 ($20/√10)).
[0076] In order to be conservative with the experts presented to the user, the $37.6 estimate can be used to rank experts. To show how the preceding calculation can benefit experts with more views, by changing the number of expert profile views should from 10 to 100 in the previous example, the range of the potential earning opportunity value increases to $46.08-$53.92. Advantageously, the potential earning opportunity value is directly correlated to the number of expert profile views.
[0077] According to a third embodiment, the expert search server 104 can further sort the ordered listing of expert profiles by shuffling, such that at least one of the identified expert profiles is moved from a lower position within the ordered listing of expert profiles to a higher position. As described above, the position of an expert profile within a list of search results can bias the number of times the expert profile is selected by a user per view. By randomly shuffling an expert profile to the top, the shuffled expert profile can be compensated for position bias, and is given a better chance of being selected for hire by an end user.
[0078] In a particular implementation, the expert search server 104 can select one slot on each channel's display of experts, and shuffle in an expert randomly from lower in the stack. For example, page one of a category view on the website may display the experts as shown below:
List Position 1—Expert Ranked #1
List Position 2—Expert Ranked #2
List Position 3—Expert Ranked #3
List Position 4—Expert Ranked #4
List Position 5—Expert Ranked #5
List Position 6—Expert Ranked #132
List Position 7—Expert Ranked #6
List Position 8—Expert Ranked #7
List Position 9—Expert Ranked #8
List Position 10—Expert Ranked #9
[0079] Advantageously, the expert Ranked #132 is shuffled into the list position 6, which gives the expert a better revenue opportunity. In cases with fewer slots, for example, such as an implementation with only two expert slots, a lower ranked expert can be rotated into one of the two slots a certain percentage of page queries. For example, a lower ranked expert can be rotated into one of the two slots on 20% of page views. In some implementations, the lower ranked (or shuffled) expert is not inserted into the first few positions (e.g., not into the first or second position) to keep the top-most experts within the first few positions since they have a strong revenue history. In some implementations, a random spot from the lower positions (e.g., positions three through ten) is selected, and the lower ranked expert is inserted into the selected position. Advantageously, such random noise can be purposefully included in the sorting algorithm to give more revenue opportunities to less-frequently displayed experts.
[0080] With further respect to step 308, the data associated with the selected expert profiles and transmitted to the remote search engine server 110 can include data, such as executable instructions, that facilitate the real-time and non-real-time communication sessions over the network with the expert corresponding to the profile. The expert search server 104 can transmit executable instructions to the remote search engine server 110, where the executable instructions define a manner of displaying the identified expert profiles.
[0081] The following discussion relates to FIGS. 7-10B which illustrate various screenshot provided by one or more embodiments of the systems, methods and computer apparatus as disclosed herein.
[0082] FIG. 7 is a screenshot showing an experts search results page 700 from an expert search engine (e.g., the expert search server 104, such as the LivePerson website) through a browser. In this embodiment, the user navigates from a generic search engine (e.g., Ask™) to the “search experts” page 702 retrieved from the expert search engine. From the search experts page 702 a user has several ways to search for experts. The user can select a particular category (sometimes referred to as a channel) from the list of categories 704 (see FIG. 8 ). Or the user can issue a keyword search to identify experts. As shown in FIG. 7 , the user entered the keyword search “how to read tarot cards?” 706. The experts search results page 700 is generated by the expert search engine based on the keyword search 706. A user can search using any keywords, and the results displayed in the experts search results page 700 match the user's keywords search 706. As another example, a user can search for experts on “sports” and a listing of experts which are related to the keyword “sports” can be displayed on the experts search results page 700.
[0083] FIG. 8 is an exemplary screenshot showing a LivePerson expert search server webpage 800 for searching for experts by category. The category the user selected is “Shopping & Style” 802. In addition to searching categories, the user can also browse topics 804 within a particular category. The results for the category 802 selected by the user are displayed within the list 806, and include “mini” expert profiles 808A through 808E (which are described with reference to FIG. 6 ).
[0084] FIG. 9 is an exemplary screenshot showing an expert profile page 900 on the expert search server website (e.g., the LivePerson website) according to one embodiment. The expert profile page 900 includes a picture 902, a name 904, an expert category or topic 906, an expert rating 908, profile information 910, and contact pricing information for online chat prices 912 and offline communication prices 914. The status of the expert is indicated as away 916. A user viewing the expert profile page 900 can click the send email button 918 to send an email to the expert. If, for example, the user status was online instead of away, the user would also be presented with a contact live now button to facilitate an online chat session with the expert.
[0085] FIGS. 10A and 10B are exemplary screenshots showing expert profile pages presented by a generic search engine (e.g., search engine server 110) communicating using API calls with an expert search engine (e.g., expert search server 104) according to one embodiment. FIG. 10A shows a full expert profile 1000 on the Ask™ search engine website 1002. The full expert profile 1000 includes the same information as described with the expert profile page 900 of FIG. 9 . FIG. 10B shows a list 1050 of mini expert profiles 1052A through 1052F on the Ask™ search engine website 1054. The list 1050 was generated by the expert search engine in response to the search query “how to read tarot cards?” 1056 executed by the user on the Ask™ search engine website 1052.
[0086] The above-described techniques can be implemented in digital and/or analog electronic circuitry, or in computer hardware, firmware, software, or in combinations of them. The implementation can be as a computer program product, i.e., a computer program tangibly embodied in a machine-readable storage device, for execution by, or to control the operation of, a data processing apparatus, e.g., a programmable processor, a computer, and/or multiple computers. A computer program can be written in any form of computer or programming language, including source code, compiled code, interpreted code and/or machine code, and the computer program can be deployed in any form, including as a stand-alone program or as a subroutine, element, or other unit suitable for use in a computing environment. A computer program can be deployed to be executed on one computer or on multiple computers at one or more sites.
[0087] Method steps can be performed by one or more processors executing a computer program to perform functions of the invention by operating on input data and/or generating output data. Method steps can also be performed by, and an apparatus can be implemented as, special purpose logic circuitry, e.g., a FPGA (field programmable gate array), a FPAA (field-programmable analog array), a CPLD (complex programmable logic device), a PSoC (Programmable System-on-Chip), ASIP (application-specific instruction-set processor), or an ASIC (application-specific integrated circuit). Subroutines can refer to portions of the computer program and/or the processor/special circuitry that implement one or more functions.
[0088] Processors suitable for the execution of a computer program include, by way of example, both general and special purpose microprocessors, and any one or more processors of any kind of digital or analog computer. Generally, a processor receives instructions and data from a read-only memory or a random access memory or both. The essential elements of a computer are a processor for executing instructions and one or more memory devices for storing instructions and/or data. Memory devices, such as a cache, can be used to temporarily store data. Memory devices can also be used for long-term data storage. Generally, a computer also includes, or is operatively coupled to receive data from or transfer data to, or both, one or more mass storage devices for storing data, e.g., magnetic, magneto-optical disks, or optical disks. A computer can also be operatively coupled to a communications network in order to receive instructions and/or data from the network and/or to transfer instructions and/or data to the network. Computer-readable storage devices suitable for embodying computer program instructions and data include all forms of volatile and non-volatile memory, including by way of example semiconductor memory devices, e.g., DRAM, SRAM, EPROM, EEPROM, and flash memory devices; magnetic disks, e.g., internal hard disks or removable disks; magneto-optical disks; and optical disks, e.g., CD, DVD, HD-DVD, and Blu-ray disks. The processor and the memory can be supplemented by and/or incorporated in special purpose logic circuitry.
[0089] To provide for interaction with a user, the above described techniques can be implemented on a computer in communication with a display device, e.g., a CRT (cathode ray tube), plasma, or LCD (liquid crystal display) monitor, for displaying information to the user and a keyboard and a pointing device, e.g., a mouse, a trackball, a touchpad, or a motion sensor, by which the user can provide input to the computer (e.g., interact with a user interface element). Other kinds of devices can be used to provide for interaction with a user as well; for example, feedback provided to the user can be any form of sensory feedback, e.g., visual feedback, auditory feedback, or tactile feedback; and input from the user can be received in any form, including acoustic, speech, and/or tactile input.
[0090] The above described techniques can be implemented in a distributed computing system that includes a back-end component. The back-end component can, for example, be a data server, a middleware component, and/or an application server. The above described techniques can be implemented in a distributed computing system that includes a front-end component. The front-end component can, for example, be a client computer having a graphical user interface, a Web browser through which a user can interact with an example implementation, and/or other graphical user interfaces for a transmitting device. The above described techniques can be implemented in a distributed computing system that includes any combination of such back-end, middleware, or front-end components.
[0091] The computing system can include clients and servers. A client and a server are generally remote from each other and typically interact through a communication network. The relationship of client and server arises by virtue of computer programs running on the respective computers and having a client-server relationship to each other.
[0092] The components of the computing system can be interconnected by any form or medium of digital or analog data communication (e.g., a communication network). Examples of communication networks include circuit-based and packet-based networks. Packet-based networks can include, for example, the Internet, a carrier internet protocol (IP) network (e.g., local area network (LAN), wide area network (WAN), campus area network (CAN), metropolitan area network (MAN), home area network (HAN)), a private IP network, an IP private branch exchange (IPBX), a wireless network (e.g., radio access network (RAN), 802.11 network, 802.16 network, general packet radio service (GPRS) network, HiperLAN), and/or other packet-based networks. Circuit-based networks can include, for example, the public switched telephone network (PSTN), a private branch exchange (PBX), a wireless network (e.g., RAN, bluetooth, code-division multiple access (CDMA) network, time division multiple access (TDMA) network, global system for mobile communications (GSM) network), and/or other circuit-based networks.
[0093] Devices of the computing system and/or computing devices can include, for example, a computer, a computer with a browser device, a telephone, an IP phone, a mobile device (e.g., cellular phone, personal digital assistant (PDA) device, laptop computer, electronic mail device), a server, a rack with one or more processing cards, special purpose circuitry, and/or other communication devices. The browser device includes, for example, a computer (e.g., desktop computer, laptop computer) with a world wide web browser (e.g., Microsoft® Internet Explorer® available from Microsoft Corporation, Mozilla® Firefox available from Mozilla Corporation). A mobile computing device includes, for example, a Blackberry®. IP phones include, for example, a Cisco® Unified IP Phone 7985G available from Cisco System, Inc, and/or a Cisco® Unified Wireless Phone 7920 available from Cisco System, Inc.
[0094] One skilled in the art will realize the invention may be embodied in other specific forms without departing from the spirit or essential characteristics thereof. The foregoing embodiments are therefore to be considered in all respects illustrative rather than limiting of the invention described herein. Scope of the invention is thus indicated by the appended claims, rather than by the foregoing description, and all changes that come within the meaning and range of equivalency of the claims are therefore intended to be embraced therein.
Claims
What is claimed:
1. A computer-implemented method, comprising:
storing, by an agent search server, topic data and agent data in a database within a system;
associating, by the agent search server, topic data with one or more agents, wherein agents are active or inactive, and wherein agents are relevant or irrelevant to the topic data;
determining, by the agent search server, whether any agents associated with the topic data are active and relevant, wherein agents are relevant when a topic included in one or more profiles of one or more relevant agents matches the topic data;
associating, by the agent search server, one or more real-time interaction options with active relevant agents;
determining, by the agent search server, status data, wherein the status data is stored in the database, and wherein the status data corresponds to active relevant agents associated with one or more real-time interaction options and the topic data;
transmitting, by the agent search server, the status data to a search engine server operating remotely from the agent search server and in communication with the agent search server over a network, wherein interactive elements are associated with search results by the search engine server, wherein the search results are generated by the search engine server in response to a search request including the topic data, wherein the search request does not include a request for an agent, wherein an agent search request is generated using the topic data, wherein the agent search request is separate from the search request and includes the topic data, and wherein the agent search request is used to determine relevant agents associated with the topic data; and
receiving data corresponding to a selection of an interactive element associated with search results, wherein an interactive element is separate from a search result and is displayed concurrently with a search result, wherein the selected interactive element is associated with one or more agents based on the status data, wherein the selection of the interactive element facilitates a real-time interaction option among two or more devices, and wherein at least one device is associated with an active relevant agent associated with the topic data.
2. The method of claim 1, wherein the status data is dynamically modifiable.
3. The method of claim 1, wherein the status data is active or inactive, wherein the status data is active when a relevant agent associated with the topic is active, and wherein the status data is inactive when a relevant agent associated with the topic is inactive.
4. The method of claim 1, wherein the real-time interactions include using communication logic capable of facilitating a real-time communication session.
5. The method of claim 1, wherein real-time communication sessions include text messaging sessions, internet telephony sessions, or real-time chat sessions, and wherein real-time chat sessions include audio, video, or textual communication.
6. The method of claim 1, wherein an agent corresponds to an individual, and wherein when a relevant agent is active, the individual is available, and wherein when a relevant agent is inactive, the individual is unavailable.
7. The method of claim 6, wherein an available individual is an individual that is available for a real-time communication session including text messaging sessions, internet telephony sessions, or real-time chat sessions, and wherein real-time chat sessions include audio, video, or textual communication.
8. The method of claim 1, wherein facilitating real-time communication includes evaluating additional data including credential data or historical data.
9. The method of claim 1, wherein the status data is generated in response to the search request, and wherein the search request includes a search query or one or more keywords.
10. The method of claim 1, wherein when a relevant agent associated with the topic data is active, corresponding status data is generated.
11. A system including an agent search server, comprising:
a processor;
a non-transitory computer-readable storage medium containing instructions which when executed on the processor, cause the processor to perform operations including:
storing topic data and agent data in a database within a system;
associating topic data with one or more agents, wherein agents are active or inactive, and wherein agents are relevant or irrelevant to the topic data;
determining whether any agents associated with the topic data are active and relevant, wherein agents are relevant when a topic included in one or more profiles of the one or more relevant agents matches the topic data;
associating one or more real-time interaction options with active relevant agents;
determining status data, wherein the status data is stored in the database, and wherein the status data corresponds to active relevant agents associated with one or more real-time interaction options and the topic data;
transmitting the status data to a search engine server operating remotely from the agent search server and in communication with the agent search server over a network, wherein interactive elements are associated with search results by the search engine server, wherein the search results are generated by the search engine server in response to a search request including the topic data, wherein the search request does not include a request for an agent, wherein an agent search request is generated using the topic data, wherein the agent search request is separate from the search request and includes the topic data, and wherein the agent search request is used to determine relevant agents associated with the topic data; and
receiving data corresponding to a selection of an interactive element associated with search results, wherein an interactive element is separate from a search result and is displayed concurrently with a search result, wherein the selected interactive element is associated with one or more agents based on the status data, wherein the selection of the interactive element facilitates a real-time interaction option among two or more devices, and wherein at least one device is associated with an active relevant agent associated with the topic data.
12. The system of claim 11, wherein the status data is dynamically modifiable.
13. The system of claim 11, wherein the status data is active or inactive, wherein the status data is active when a relevant agent associated with the topic is active, and wherein the status data is inactive when a relevant agent associated with the topic is inactive.
14. The system of claim 11, wherein the real-time interactions include using communication logic capable of facilitating a real-time communication session.
15. The system of claim 11, wherein real-time communication sessions include text messaging sessions, internet telephony sessions, or real-time chat sessions, and wherein real-time chat sessions include audio, video, or textual communication.
16. The system of claim 11, wherein an agent corresponds to an individual, and wherein when a relevant agent is active, the individual is available, and wherein when a relevant agent is inactive, the individual is unavailable.
17. The system of claim 16, wherein an available individual is an individual that is available for a real-time communication session including text messaging sessions, internet telephony sessions, or real-time chat sessions, and wherein real-time chat sessions include audio, video, or textual communication.
18. The system of claim 11, wherein facilitating real-time communication includes evaluating additional data including credential data or historical data.
19. The system of claim 11, wherein the status data is generated in response to the search request, and wherein the search request includes a search query or one or more keywords.
20. The system of claim 11, wherein when a relevant agent associated with the topic data is active, corresponding status data is generated.
21. A computer-program product tangibly embodied in a non-transitory machine-readable storage medium of an agent search server, including instructions configured to cause a data processing apparatus to:
store topic data and agent data in a database within a system;
associate topic data with one or more agents, wherein agents are active or inactive, and wherein agents are relevant or irrelevant to the topic data;
determine whether any agents associated with the topic data are active and relevant, wherein agents are relevant when a topic included in one or more profiles of the one or more relevant agents matches the topic data;
associate one or more real-time interaction options with active relevant agents;
determine status data, wherein the status data is stored in the database, and wherein the status data corresponds to active relevant agents associated with one or more real-time interaction options and the topic data;
transmit the status data to a search engine server operating remotely from the agent search server and in communication with the agent search server over a network, wherein interactive elements are associated with search results by the search engine server, wherein the search results are generated by the search engine server in response to a search request including the topic data, wherein the search request does not include a request for an agent, wherein an agent search request is generated using the topic data, wherein the agent search request is separate from the search request and includes the topic data, and wherein the agent search request is used to determine relevant agents associated with the topic data; and
receive data corresponding to a selection of an interactive element associated with search results, wherein an interactive element is separate from a search result and is displayed concurrently with a search result, wherein the selected interactive element is associated with one or more agents based on the status data, wherein the selection of the interactive element facilitates a real-time interaction option among two or more devices, and wherein at least one device is associated with an active relevant agent associated with the topic data.
22. The computer-program product of claim 21, wherein the status data is dynamically modifiable.
23. The computer-program product of claim 21, wherein the status data is active or inactive, wherein the status data is active when a relevant agent associated with the topic is active, and wherein the status data is inactive when a relevant agent associated with the topic is inactive.
24. The computer-program product of claim 21, wherein the real-time interactions include using communication logic capable of facilitating a real-time communication session.
25. The computer-program product of claim 21, wherein real-time communication sessions include text messaging sessions, internet telephony sessions, or real-time chat sessions, and wherein real-time chat sessions include audio, video, or textual communication.
26. The computer-program product of claim 21, wherein an agent corresponds to an individual, and wherein when a relevant agent is active, the individual is available, and wherein when a relevant agent is inactive, the individual is unavailable.
27. The computer-program product of claim 26, wherein an available individual is an individual that is available for a real-time communication session including text messaging sessions, internet telephony sessions, or real-time chat sessions, and wherein real-time chat sessions include audio, video, or textual communication.
28. The computer-program product of claim 21, wherein facilitating real-time communication includes evaluating additional data including credential data or historical data.
29. The computer-program product of claim 21, wherein the status data is generated in response to the search request, and wherein the search request includes a search query or one or more keywords.
30. The computer-program product of claim 21, wherein when a relevant agent associated with the topic data is active, corresponding status data is generated.
Patent Citations (631)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4881261(A) | 1989-11-01 | Oliphant et al. | Applicant |
| US5187735(A) | 1993-02-01 | Herrero Garcia et al. | Applicant |
| US5206903(A) | 1993-04-01 | Kohler et al. | Applicant |
| US5208748(A) | 1993-05-01 | Flores et al. | Applicant |
| US5235519(A) | 1993-08-01 | Miura | Applicant |
| US5239462(A) | 1993-08-01 | Jones et al. | Applicant |
| US5262941(A) | 1993-11-01 | Saladin et al. | Applicant |
| US5289371(A) | 1994-02-01 | Abel et al. | Applicant |
| US5319542(A) | 1994-06-01 | King et al. | Applicant |
| US5351186(A) | 1994-09-01 | Bullock et al. | Applicant |
| US5372507(A) | 1994-12-01 | Goleh | Applicant |
| US5375055(A) | 1994-12-01 | Togher et al. | Applicant |
| US5387783(A) | 1995-02-01 | Mihm et al. | Applicant |
| US5450537(A) | 1995-09-01 | Hirai et al. | Applicant |
| US5517405(A) | 1996-05-01 | McAndrew et al. | Applicant |
| US5563805(A) | 1996-10-01 | Arbuckle et al. | Applicant |
| US5572643(A) | 1996-11-01 | Judson | Applicant |
| US5581702(A) | 1996-12-01 | McArdle et al. | Applicant |
| US5583763(A) | 1996-12-01 | Atcheson et al. | Applicant |
| US5590038(A) | 1996-12-01 | Pitroda | Applicant |
| US5592378(A) | 1997-01-01 | Cameron et al. | Applicant |
| US5596493(A) | 1997-01-01 | Tone | Applicant |
| US5611052(A) | 1997-03-01 | Dykstra et al. | Applicant |
| US5636346(A) | 1997-06-01 | Saxe | Applicant |
| US5664115(A) | 1997-09-01 | Fraser | Applicant |
| US5668953(A) | 1997-09-01 | Sloo | Applicant |
| US5678002(A) | 1997-10-01 | Fawcett et al. | Applicant |
| US5694163(A) | 1997-12-01 | Harrison | Applicant |
| US5696907(A) | 1997-12-01 | Tom | Applicant |
| US5699526(A) | 1997-12-01 | Siefert | Applicant |
| US5704029(A) | 1997-12-01 | Wright | Applicant |
| US5710887(A) | 1998-01-01 | Chelliah et al. | Applicant |
| US5715402(A) | 1998-02-01 | Popolo | Applicant |
| US5724155(A) | 1998-03-01 | Saito | Applicant |
| US5724522(A) | 1998-03-01 | Kagami et al. | Applicant |
| US5727048(A) | 1998-03-01 | Hiroshima et al. | Applicant |
| US5727163(A) | 1998-03-01 | Bezos | Applicant |
| US5732400(A) | 1998-03-01 | Mandler et al. | Applicant |
| US5745654(A) | 1998-04-01 | Titan | Applicant |
| US5748755(A) | 1998-05-01 | Johnson et al. | Applicant |
| US5758328(A) | 1998-05-01 | Giovannoli | Applicant |
| US5760771(A) | 1998-06-01 | Blonder et al. | Applicant |
| US5761640(A) | 1998-06-01 | Kalyanswamy et al. | Applicant |
| US5761649(A) | 1998-06-01 | Hill | Applicant |
| US5764916(A) | 1998-06-01 | Busey et al. | Applicant |
| US5765142(A) | 1998-06-01 | Allred et al. | Applicant |
| US5774869(A) | 1998-06-01 | Toader | Applicant |
| US5774870(A) | 1998-06-01 | Storey | Applicant |
| US5774882(A) | 1998-06-01 | Keen et al. | Applicant |
| US5774883(A) | 1998-06-01 | Andersen et al. | Applicant |
| US5778164(A) | 1998-07-01 | Watkins et al. | Applicant |
| US5784568(A) | 1998-07-01 | Needham | Applicant |
| US5793365(A) | 1998-08-01 | Tang et al. | Applicant |
| US5794207(A) | 1998-08-01 | Walker et al. | Applicant |
| US5796393(A) | 1998-08-01 | MacNaughton et al. | Applicant |
| US5797133(A) | 1998-08-01 | Jones et al. | Applicant |
| US5799151(A) | 1998-08-01 | Hoffer | Applicant |
| US5805159(A) | 1998-09-01 | Bertram et al. | Applicant |
| US5806043(A) | 1998-09-01 | Toader | Applicant |
| US5812769(A) | 1998-09-01 | Graber et al. | Applicant |
| US5815663(A) | 1998-09-01 | Uomini | Applicant |
| US5818907(A) | 1998-10-01 | Maloney et al. | Applicant |
| US5819029(A) | 1998-10-01 | Edwards et al. | Applicant |
| US5819235(A) | 1998-10-01 | Tamai et al. | Applicant |
| US5819236(A) | 1998-10-01 | Josephson | Applicant |
| US5819291(A) | 1998-10-01 | Haimowitz et al. | Applicant |
| US5825869(A) | 1998-10-01 | Brooks et al. | Applicant |
| US5826241(A) | 1998-10-01 | Stein et al. | Applicant |
| US5826244(A) | 1998-10-01 | Huberman | Applicant |
| US5828839(A) | 1998-10-01 | Moncreiff | Applicant |
| US5832465(A) | 1998-11-01 | Tom | Applicant |
| US5835087(A) | 1998-11-01 | Herz et al. | Applicant |
| US5838682(A) | 1998-11-01 | Dekelbaum et al. | Applicant |
| US5838910(A) | 1998-11-01 | Domenikos et al. | Applicant |
| US5839117(A) | 1998-11-01 | Cameron et al. | Applicant |
| US5850517(A) | 1998-12-01 | Verkler et al. | Applicant |
| US5852809(A) | 1998-12-01 | Abel et al. | Applicant |
| US5857079(A) | 1999-01-01 | Claus et al. | Applicant |
| US5859974(A) | 1999-01-01 | McArdle et al. | Applicant |
| US5862330(A) | 1999-01-01 | Anupam et al. | Applicant |
| US5866889(A) | 1999-02-01 | Weiss et al. | Applicant |
| US5870721(A) | 1999-02-01 | Norris | Applicant |
| US5878403(A) | 1999-03-01 | DeFrancesco et al. | Applicant |
| US5895454(A) | 1999-04-01 | Harrington | Applicant |
| US5903641(A) | 1999-05-01 | Tonisson | Applicant |
| US5907677(A) | 1999-05-01 | Glenn et al. | Applicant |
| US5911135(A) | 1999-06-01 | Atkins | Applicant |
| US5916302(A) | 1999-06-01 | Dunn et al. | Applicant |
| US5918014(A) | 1999-06-01 | Robinson | Applicant |
| US5924082(A) | 1999-07-01 | Silverman et al. | Applicant |
| US5930776(A) | 1999-07-01 | Dykstra et al. | Applicant |
| US5940811(A) | 1999-08-01 | Norris | Applicant |
| US5940812(A) | 1999-08-01 | Tengel et al. | Applicant |
| US5943416(A) | 1999-08-01 | Gisby et al. | Applicant |
| US5943478(A) | 1999-08-01 | Aggarwal et al. | Applicant |
| US5945989(A) | 1999-08-01 | Freishtat et al. | Applicant |
| US5948061(A) | 1999-09-01 | Merriman et al. | Applicant |
| US5950179(A) | 1999-09-01 | Buchanan et al. | Applicant |
| US5956693(A) | 1999-09-01 | Geerlings | Applicant |
| US5958014(A) | 1999-09-01 | Cave | Applicant |
| US5960411(A) | 1999-09-01 | Hartman et al. | Applicant |
| US5963625(A) | 1999-10-01 | Kawecki et al. | Applicant |
| US5963635(A) | 1999-10-01 | Szlam | Applicant |
| US5966699(A) | 1999-10-01 | Zandi | Applicant |
| US5970475(A) | 1999-10-01 | Barnes et al. | Applicant |
| US5970478(A) | 1999-10-01 | Walker et al. | Applicant |
| US5974396(A) | 1999-10-01 | Anderson | Applicant |
| US5974446(A) | 1999-10-01 | Sonnenrich et al. | Applicant |
| US5987434(A) | 1999-11-01 | Libman | Applicant |
| US5991740(A) | 1999-11-01 | Messer | Applicant |
| US5995947(A) | 1999-11-01 | Fraser et al. | Applicant |
| US6000832(A) | 1999-12-01 | Franklin et al. | Applicant |
| US6003013(A) | 1999-12-01 | Boushy | Applicant |
| US6009410(A) | 1999-12-01 | LeMole et al. | Applicant |
| US6014644(A) | 2000-01-01 | Erickson | Applicant |
| US6014645(A) | 2000-01-01 | Cunningham | Applicant |
| US6014647(A) | 2000-01-01 | Nizzari | Applicant |
| US6016504(A) | 2000-01-01 | Arnold et al. | Applicant |
| US6026370(A) | 2000-02-01 | Jermyn | Applicant |
| US6028601(A) | 2000-02-01 | Machiraju et al. | Applicant |
| US6029141(A) | 2000-02-01 | Bezos et al. | Applicant |
| US6029149(A) | 2000-02-01 | Dykstra et al. | Applicant |
| US6029890(A) | 2000-02-01 | Austin et al. | Applicant |
| US6044146(A) | 2000-03-01 | Gisby et al. | Applicant |
| US6044360(A) | 2000-03-01 | Picciallo | Applicant |
| US6049784(A) | 2000-04-01 | Weatherly et al. | Applicant |
| US6052447(A) | 2000-04-01 | Golden | Applicant |
| US6052730(A) | 2000-04-01 | Felciano | Applicant |
| US6055573(A) | 2000-04-01 | Gardenswartz et al. | Applicant |
| US6058375(A) | 2000-05-01 | Park et al. | Applicant |
| US6058428(A) | 2000-05-01 | Wang et al. | Applicant |
| US6061658(A) | 2000-05-01 | Chou et al. | Applicant |
| US6064987(A) | 2000-05-01 | Walker et al. | Applicant |
| US6067525(A) | 2000-05-01 | Johnson et al. | Applicant |
| US6070149(A) | 2000-05-01 | Tavor et al. | Applicant |
| US6073112(A) | 2000-06-01 | Geerlings | Applicant |
| US6076100(A) | 2000-06-01 | Cottrille et al. | Applicant |
| US6078892(A) | 2000-06-01 | Anderson et al. | Applicant |
| US6084585(A) | 2000-07-01 | Kraft et al. | Applicant |
| US6085126(A) | 2000-07-01 | Mellgren, III et al. | Applicant |
| US6085195(A) | 2000-07-01 | Hoyt et al. | Applicant |
| US6088686(A) | 2000-07-01 | Walker et al. | Applicant |
| US6105007(A) | 2000-08-01 | Norris | Applicant |
| US6112190(A) | 2000-08-01 | Fletcher et al. | Applicant |
| US6119101(A) | 2000-09-01 | Peckover | Applicant |
| US6119103(A) | 2000-09-01 | Basch et al. | Applicant |
| US6131087(A) | 2000-10-01 | Luke et al. | Applicant |
| US6131095(A) | 2000-10-01 | Low et al. | Applicant |
| US6134318(A) | 2000-10-01 | O'Neil | Applicant |
| US6134530(A) | 2000-10-01 | Bunting et al. | Applicant |
| US6134532(A) | 2000-10-01 | Lazarus et al. | Applicant |
| US6134533(A) | 2000-10-01 | Shell | Applicant |
| US6134548(A) | 2000-10-01 | Gottsman et al. | Applicant |
| US6138139(A) | 2000-10-01 | Beck et al. | Applicant |
| US6141653(A) | 2000-10-01 | Conklin et al. | Applicant |
| US6144991(A) | 2000-11-01 | England | Applicant |
| US6163607(A) | 2000-12-01 | Bogart et al. | Applicant |
| US6167395(A) | 2000-12-01 | Beck et al. | Applicant |
| US6170011(B1) | 2001-01-01 | Macleod Beck et al. | Applicant |
| US6173053(B1) | 2001-01-01 | Bogart et al. | Applicant |
| US6182050(B1) | 2001-01-01 | Ballard | Applicant |
| US6182124(B1) | 2001-01-01 | Lau et al. | Applicant |
| US6185543(B1) | 2001-02-01 | Galperin et al. | Applicant |
| US6189003(B1) | 2001-02-01 | Leal | Applicant |
| US6192319(B1) | 2001-02-01 | Simonson | Applicant |
| US6192380(B1) | 2001-02-01 | Light et al. | Applicant |
| US6199079(B1) | 2001-03-01 | Gupta et al. | Applicant |
| US6202053(B1) | 2001-03-01 | Christiansen et al. | Applicant |
| US6202155(B1) | 2001-03-01 | Tushie et al. | Applicant |
| US6208979(B1) | 2001-03-01 | Sinclair | Applicant |
| US6222919(B1) | 2001-04-01 | Hollatz et al. | Applicant |
| US6236975(B1) | 2001-05-01 | Boe et al. | Applicant |
| US6240396(B1) | 2001-05-01 | Walker et al. | Applicant |
| US6249795(B1) | 2001-06-01 | Douglis | Applicant |
| US6262730(B1) | 2001-07-01 | Horvitz | Applicant |
| US6267292(B1) | 2001-07-01 | Walker et al. | Applicant |
| US6272506(B1) | 2001-08-01 | Bell | Applicant |
| US6282284(B1) | 2001-08-01 | Dezonno et al. | Applicant |
| US6285983(B1) | 2001-09-01 | Jenkins | Applicant |
| US6289319(B1) | 2001-09-01 | Lockwood | Applicant |
| US6292786(B1) | 2001-09-01 | Deaton | Applicant |
| US6295061(B1) | 2001-09-01 | Park et al. | Applicant |
| US6298348(B1) | 2001-10-01 | Eldering | Applicant |
| US6311169(B2) | 2001-10-01 | Duhon | Applicant |
| US6311178(B1) | 2001-10-01 | Bi et al. | Applicant |
| US6324524(B1) | 2001-11-01 | Lent et al. | Applicant |
| US6327574(B1) | 2001-12-01 | Kramer et al. | Applicant |
| US6330546(B1) | 2001-12-01 | Gopinathan et al. | Applicant |
| US6334110(B1) | 2001-12-01 | Walter | Applicant |
| US6338066(B1) | 2002-01-01 | Martin | Applicant |
| US6346952(B1) | 2002-02-01 | Shtivelman | Applicant |
| US6349290(B1) | 2002-02-01 | Horowitz et al. | Applicant |
| US6356909(B1) | 2002-03-01 | Spencer | Applicant |
| US6374230(B1) | 2002-04-01 | Walker et al. | Applicant |
| US6377936(B1) | 2002-04-01 | Henrick et al. | Applicant |
| US6381640(B1) | 2002-04-01 | Beck | Applicant |
| US6385594(B1) | 2002-05-01 | Lebda et al. | Applicant |
| US6393479(B1) | 2002-05-01 | Glommen et al. | Applicant |
| US6405181(B2) | 2002-06-01 | Lent et al. | Applicant |
| US6438526(B1) | 2002-08-01 | Dykes et al. | Applicant |
| US6449358(B1) | 2002-09-01 | Anisimov | Applicant |
| US6449646(B1) | 2002-09-01 | Sikora et al. | Applicant |
| US6463149(B1) | 2002-10-01 | Jolissaint et al. | Applicant |
| US6466970(B1) | 2002-10-01 | Lee | Applicant |
| US6477533(B2) | 2002-11-01 | Schiff et al. | Applicant |
| US6507851(B1) | 2003-01-01 | Fujiwara et al. | Applicant |
| US6510418(B1) | 2003-01-01 | Case et al. | Applicant |
| US6510427(B1) | 2003-01-01 | Bossemeyer, Jr. et al. | Applicant |
| US6516421(B1) | 2003-02-01 | Peters | Applicant |
| US6519628(B1) | 2003-02-01 | Locascio | Applicant |
| US6535492(B2) | 2003-03-01 | Shtivelman | Applicant |
| US6542936(B1) | 2003-04-01 | Mayle et al. | Applicant |
| US6546372(B2) | 2003-04-01 | Lauffer | Applicant |
| US6549919(B2) | 2003-04-01 | Lambert et al. | Applicant |
| US6567791(B2) | 2003-05-01 | Lent et al. | Applicant |
| US6571236(B1) | 2003-05-01 | Ruppelt | Applicant |
| US6597377(B1) | 2003-07-01 | MacPhail | Applicant |
| US6606744(B1) | 2003-08-01 | Mikurak | Applicant |
| US6618746(B2) | 2003-09-01 | Desai et al. | Applicant |
| US6622131(B1) | 2003-09-01 | Brown et al. | Applicant |
| US6622138(B1) | 2003-09-01 | Bellamkonda | Applicant |
| US6654815(B1) | 2003-11-01 | Goss | Applicant |
| US6662215(B1) | 2003-12-01 | Moskowitz et al. | Applicant |
| US6665395(B1) | 2003-12-01 | Busey et al. | Applicant |
| US6671818(B1) | 2003-12-01 | Mikurak | Applicant |
| US6691151(B1) | 2004-02-01 | Cheyer et al. | Applicant |
| US6691159(B1) | 2004-02-01 | Grewal et al. | Applicant |
| US6701441(B1) | 2004-03-01 | Balasubramaniam et al. | Applicant |
| US6718313(B1) | 2004-04-01 | Lent et al. | Applicant |
| US6721713(B1) | 2004-04-01 | Guheen et al. | Applicant |
| US6725210(B1) | 2004-04-01 | Key | Applicant |
| US6741995(B1) | 2004-05-01 | Chen | Applicant |
| US6760429(B1) | 2004-07-01 | Hung et al. | Applicant |
| US6766302(B2) | 2004-07-01 | Bach | Applicant |
| US6771766(B1) | 2004-08-01 | Shaflee et al. | Applicant |
| US6795812(B1) | 2004-09-01 | Lent et al. | Applicant |
| US6804659(B1) | 2004-10-01 | Graham et al. | Applicant |
| US6826594(B1) | 2004-11-01 | Pettersen | Applicant |
| US6829585(B1) | 2004-12-01 | Grewal et al. | Applicant |
| US6836768(B1) | 2004-12-01 | Hirsch | Applicant |
| US6839680(B1) | 2005-01-01 | Liu | Applicant |
| US6839682(B1) | 2005-01-01 | Blume | Applicant |
| US6850896(B1) | 2005-02-01 | Kelman et al. | Applicant |
| US6865267(B2) | 2005-03-01 | Dezono | Applicant |
| US6892226(B1) | 2005-05-01 | Tso et al. | Applicant |
| US6892347(B1) | 2005-05-01 | Williams | Applicant |
| US6904408(B1) | 2005-06-01 | McCarthy et al. | Applicant |
| US6920434(B1) | 2005-07-01 | Cossette | Applicant |
| US6922705(B1) | 2005-07-01 | Northrup | Applicant |
| US6925441(B1) | 2005-08-01 | Jones | Applicant |
| US6925442(B1) | 2005-08-01 | Shapira et al. | Applicant |
| US6950983(B1) | 2005-09-01 | Snavely | Applicant |
| US6965868(B1) | 2005-11-01 | Bednarek | Applicant |
| US6981028(B1) | 2005-12-01 | Rawat et al. | Applicant |
| US6993557(B1) | 2006-01-01 | Yen | Applicant |
| US7003476(B1) | 2006-02-01 | Samra et al. | Applicant |
| US7039599(B2) | 2006-05-01 | Merriman et al. | Applicant |
| US7051273(B1) | 2006-05-01 | Holt et al. | Applicant |
| US7076443(B1) | 2006-07-01 | Emens et al. | Applicant |
| US7085682(B1) | 2006-08-01 | Heller et al. | Applicant |
| US7092959(B2) | 2006-08-01 | Chen | Applicant |
| US7106850(B2) | 2006-09-01 | Campbell et al. | Applicant |
| US7143063(B2) | 2006-11-01 | Lent et al. | Applicant |
| US7181492(B2) | 2007-02-01 | Wen et al. | Applicant |
| US7200614(B2) | 2007-04-01 | Reid et al. | Applicant |
| US7242760(B2) | 2007-07-01 | Shires | Applicant |
| US7243109(B2) | 2007-07-01 | Omega et al. | Applicant |
| US7251648(B2) | 2007-07-01 | Chaudhuri et al. | Applicant |
| US7266510(B1) | 2007-09-01 | Cofino | Applicant |
| US7287000(B2) | 2007-10-01 | Boyd et al. | Applicant |
| US7313575(B2) | 2007-12-01 | Carr et al. | Applicant |
| US7337127(B1) | 2008-02-01 | Smith et al. | Applicant |
| US7346576(B2) | 2008-03-01 | Lent et al. | Applicant |
| US7346604(B1) | 2008-03-01 | Bharat et al. | Applicant |
| US7346606(B2) | 2008-03-01 | Bharat | Applicant |
| US7370002(B2) | 2008-05-01 | Heckerman et al. | Applicant |
| US7376603(B1) | 2008-05-01 | Mayr et al. | Applicant |
| US7403973(B2) | 2008-07-01 | Wilsher et al. | Applicant |
| US7424363(B2) | 2008-09-01 | Cheng | Applicant |
| US7523191(B1) | 2009-04-01 | Thomas et al. | Applicant |
| US7526439(B2) | 2009-04-01 | Freishtat et al. | Applicant |
| US7536320(B2) | 2009-05-01 | McQueen et al. | Applicant |
| US7552080(B1) | 2009-06-01 | Willard et al. | Applicant |
| US7562058(B2) | 2009-07-01 | Pinto | Applicant |
| US7590550(B2) | 2009-09-01 | Schoenberg | Applicant |
| US7630986(B1) | 2009-12-01 | Herz et al. | Applicant |
| US7650381(B2) | 2010-01-01 | Peters | Applicant |
| US7657465(B2) | 2010-02-01 | Freishtat et al. | Applicant |
| US7689924(B1) | 2010-03-01 | Schneider et al. | Applicant |
| US7702635(B2) | 2010-04-01 | Horvitz et al. | Applicant |
| US7716322(B2) | 2010-05-01 | Benedikt et al. | Applicant |
| US7730010(B2) | 2010-06-01 | Kishore et al. | Applicant |
| US7734503(B2) | 2010-06-01 | Agarwal et al. | Applicant |
| US7734632(B2) | 2010-06-01 | Wang | Applicant |
| US7739149(B2) | 2010-06-01 | Freishtat et al. | Applicant |
| US7818340(B1) | 2010-10-01 | Warren | Examiner |
| US7827128(B1) | 2010-11-01 | Karlsson et al. | Applicant |
| US7865457(B2) | 2011-01-01 | Ravin et al. | Applicant |
| US7877679(B2) | 2011-01-01 | Ozana | Applicant |
| US7958066(B2) | 2011-06-01 | Pinckney et al. | Applicant |
| US7966564(B2) | 2011-06-01 | Catlin et al. | Applicant |
| US7975020(B1) | 2011-07-01 | Green et al. | Applicant |
| US8010422(B1) | 2011-08-01 | Lascelles et al. | Applicant |
| US8185544(B2) | 2012-05-01 | Oztekin et al. | Applicant |
| US8260846(B2) | 2012-09-01 | Lahav | Applicant |
| US8266127(B2) | 2012-09-01 | Mattox et al. | Applicant |
| US8386340(B1) | 2013-02-01 | Feinstein | Applicant |
| US8392580(B2) | 2013-03-01 | Allen et al. | Applicant |
| US8738732(B2) | 2014-05-01 | Karidi | Applicant |
| US8762313(B2) | 2014-06-01 | Lahav et al. | Applicant |
| US8799200(B2) | 2014-08-01 | Lahav | Applicant |
| US8805844(B2) | 2014-08-01 | Schorzman et al. | Applicant |
| US8805941(B2) | 2014-08-01 | Barak et al. | Applicant |
| US8868448(B2) | 2014-10-01 | Freishtat et al. | Applicant |
| US8918465(B2) | 2014-12-01 | Barak | Applicant |
| US8943002(B2) | 2015-01-01 | Zelenko et al. | Applicant |
| US8943145(B1) | 2015-01-01 | Peters et al. | Applicant |
| US8954539(B2) | 2015-02-01 | Lahav | Applicant |
| US8965998(B1) | 2015-02-01 | Dicker | Applicant |
| US9104970(B2) | 2015-08-01 | Lahav et al. | Applicant |
| US9331969(B2) | 2016-05-01 | Barak et al. | Applicant |
| US9336487(B2) | 2016-05-01 | Lahav | Applicant |
| US9350598(B2) | 2016-05-01 | Barak et al. | Applicant |
| US9396295(B2) | 2016-07-01 | Lahav et al. | Applicant |
| US9396436(B2) | 2016-07-01 | Lahav | Applicant |
| US9432468(B2) | 2016-08-01 | Karidi | Applicant |
| US2001/0011245(A1) | 2001-08-01 | Duhon | Applicant |
| US2001/0011246(A1) | 2001-08-01 | Tammaro | Applicant |
| US2001/0011262(A1) | 2001-08-01 | Hoyt et al. | Applicant |
| US2001/0011282(A1) | 2001-08-01 | Katsumata et al. | Applicant |
| US2001/0013009(A1) | 2001-08-01 | Greening et al. | Applicant |
| US2001/0014877(A1) | 2001-08-01 | Defrancesco et al. | Applicant |
| US2001/0025249(A1) | 2001-09-01 | Tokunaga | Applicant |
| US2001/0027436(A1) | 2001-10-01 | Tenembaum | Applicant |
| US2001/0032140(A1) | 2001-10-01 | Hoffman | Applicant |
| US2001/0032244(A1) | 2001-10-01 | Neustel | Applicant |
| US2001/0034689(A1) | 2001-10-01 | Heilman | Applicant |
| US2001/0044751(A1) | 2001-11-01 | Pugliese | Applicant |
| US2001/0054041(A1) | 2001-12-01 | Chang | Applicant |
| US2001/0054064(A1) | 2001-12-01 | Kannan | Applicant |
| US2001/0056405(A1) | 2001-12-01 | Muyres | Applicant |
| US2002/0002491(A1) | 2002-01-01 | Whitfield | Applicant |
| US2002/0004735(A1) | 2002-01-01 | Gross | Applicant |
| US2002/0010625(A1) | 2002-01-01 | Smith et al. | Applicant |
| US2002/0016731(A1) | 2002-02-01 | Kupersmit | Applicant |
| US2002/0023051(A1) | 2002-02-01 | Kunzle et al. | Applicant |
| US2002/0026351(A1) | 2002-02-01 | Coleman | Applicant |
| US2002/0029188(A1) | 2002-03-01 | Schmid | Applicant |
| US2002/0029267(A1) | 2002-03-01 | Sankuratripati et al. | Applicant |
| US2002/0035486(A1) | 2002-03-01 | Huyn et al. | Applicant |
| US2002/0038230(A1) | 2002-03-01 | Chen | Applicant |
| US2002/0045154(A1) | 2002-04-01 | Wood | Applicant |
| US2002/0046086(A1) | 2002-04-01 | Pletz | Applicant |
| US2002/0046096(A1) | 2002-04-01 | Srinivasan | Applicant |
| US2002/0047859(A1) | 2002-04-01 | Szlam et al. | Applicant |
| US2002/0055878(A1) | 2002-05-01 | Burton et al. | Applicant |
| US2002/0059095(A1) | 2002-05-01 | Cook | Applicant |
| US2002/0067500(A1) | 2002-06-01 | Yokomizo et al. | Applicant |
| US2002/0073162(A1) | 2002-06-01 | McErlean et al. | Applicant |
| US2002/0082923(A1) | 2002-06-01 | Merriman et al. | Applicant |
| US2002/0083095(A1) | 2002-06-01 | Wu et al. | Applicant |
| US2002/0083167(A1) | 2002-06-01 | Costigan et al. | Applicant |
| US2002/0085705(A1) | 2002-07-01 | Shires | Applicant |
| US2002/0091832(A1) | 2002-07-01 | Low et al. | Applicant |
| US2002/0107728(A1) | 2002-08-01 | Bailey et al. | Applicant |
| US2002/0111847(A1) | 2002-08-01 | Smith | Applicant |
| US2002/0111850(A1) | 2002-08-01 | Smrcka et al. | Applicant |
| US2002/0123926(A1) | 2002-09-01 | Bushold | Applicant |
| US2002/0161620(A1) | 2002-10-01 | Hatanaka | Applicant |
| US2002/0161651(A1) | 2002-10-01 | Godsey | Applicant |
| US2002/0161664(A1) | 2002-10-01 | Shaya et al. | Applicant |
| US2002/0167539(A1) | 2002-11-01 | Brown et al. | Applicant |
| US2003/0004781(A1) | 2003-01-01 | Mallon | Applicant |
| US2003/0009768(A1) | 2003-01-01 | Moir | Applicant |
| US2003/0011641(A1) | 2003-01-01 | Totman et al. | Applicant |
| US2003/0014304(A1) | 2003-01-01 | Calvert et al. | Applicant |
| US2003/0023754(A1) | 2003-01-01 | Eichstadt et al. | Applicant |
| US2003/0028415(A1) | 2003-02-01 | Herschap et al. | Applicant |
| US2003/0036949(A1) | 2003-02-01 | Kaddeche et al. | Applicant |
| US2003/0041056(A1) | 2003-02-01 | Bossemeyer et al. | Applicant |
| US2003/0055778(A1) | 2003-03-01 | Erlanger | Applicant |
| US2003/0061091(A1) | 2003-03-01 | Amaratunga | Applicant |
| US2003/0079176(A1) | 2003-04-01 | Kang et al. | Applicant |
| US2003/0105826(A1) | 2003-06-01 | Mayraz | Applicant |
| US2003/0110130(A1) | 2003-06-01 | Pelletier | Applicant |
| US2003/0140037(A1) | 2003-07-01 | Deh-Lee | Applicant |
| US2003/0149581(A1) | 2003-08-01 | Chaudhri et al. | Applicant |
| US2003/0149937(A1) | 2003-08-01 | McElfresh et al. | Applicant |
| US2003/0154196(A1) | 2003-08-01 | Goodwin et al. | Applicant |
| US2003/0167195(A1) | 2003-09-01 | Fernandes et al. | Applicant |
| US2003/0177096(A1) | 2003-09-01 | Trent et al. | Applicant |
| US2003/0195848(A1) | 2003-10-01 | Felger | Applicant |
| US2003/0217332(A1) | 2003-11-01 | Smith et al. | Applicant |
| US2003/0221163(A1) | 2003-11-01 | Glover et al. | Applicant |
| US2003/0233425(A1) | 2003-12-01 | Lyons et al. | Applicant |
| US2004/0034567(A1) | 2004-02-01 | Gravett | Applicant |
| US2004/0064412(A1) | 2004-04-01 | Phillips et al. | Applicant |
| US2004/0073475(A1) | 2004-04-01 | Tupper | Applicant |
| US2004/0088323(A1) | 2004-05-01 | Elder et al. | Applicant |
| US2004/0128390(A1) | 2004-07-01 | Blakley et al. | Applicant |
| US2004/0141016(A1) | 2004-07-01 | Fukatsu et al. | Applicant |
| US2004/0153368(A1) | 2004-08-01 | Freishtat et al. | Applicant |
| US2004/0163101(A1) | 2004-08-01 | Swix et al. | Applicant |
| US2004/0167928(A1) | 2004-08-01 | Anderson et al. | Applicant |
| US2004/0193377(A1) | 2004-09-01 | Brown | Applicant |
| US2004/0210820(A1) | 2004-10-01 | Tarr et al. | Applicant |
| US2004/0243539(A1) | 2004-12-01 | Skurtovich et al. | Applicant |
| US2004/0249650(A1) | 2004-12-01 | Freedman | Applicant |
| US2004/0260574(A1) | 2004-12-01 | Gross | Applicant |
| US2005/0004864(A1) | 2005-01-01 | Lent et al. | Applicant |
| US2005/0014117(A1) | 2005-01-01 | Stillman | Applicant |
| US2005/0033641(A1) | 2005-02-01 | Jha et al. | Applicant |
| US2005/0033728(A1) | 2005-02-01 | James | Applicant |
| US2005/0044149(A1) | 2005-02-01 | Regardie et al. | Applicant |
| US2005/0096963(A1) | 2005-05-01 | Myr | Applicant |
| US2005/0096997(A1) | 2005-05-01 | Jain et al. | Applicant |
| US2005/0097089(A1) | 2005-05-01 | Nielsen et al. | Applicant |
| US2005/0102177(A1) | 2005-05-01 | Takayama | Applicant |
| US2005/0114195(A1) | 2005-05-01 | Bernasconi | Applicant |
| US2005/0132205(A1) | 2005-06-01 | Palliyil et al. | Applicant |
| US2005/0138115(A1) | 2005-06-01 | Llamas et al. | Applicant |
| US2005/0171861(A1) | 2005-08-01 | Bezos et al. | Applicant |
| US2005/0183003(A1) | 2005-08-01 | Peri | Applicant |
| US2005/0198120(A1) | 2005-09-01 | Reshef et al. | Applicant |
| US2005/0198212(A1) | 2005-09-01 | Zilberfayn et al. | Applicant |
| US2005/0198220(A1) | 2005-09-01 | Wada et al. | Applicant |
| US2005/0216342(A1) | 2005-09-01 | Ashbaugh | Applicant |
| US2005/0234761(A1) | 2005-10-01 | Pinto | Applicant |
| US2005/0256955(A1) | 2005-11-01 | Bodwell et al. | Applicant |
| US2005/0262065(A1) | 2005-11-01 | Barth et al. | Applicant |
| US2005/0273388(A1) | 2005-12-01 | Roetter | Applicant |
| US2005/0288943(A1) | 2005-12-01 | Wei et al. | Applicant |
| US2006/0015390(A1) | 2006-01-01 | Rijisinghani et al. | Applicant |
| US2006/0021009(A1) | 2006-01-01 | Lunt | Applicant |
| US2006/0026147(A1) | 2006-02-01 | Cone et al. | Applicant |
| US2006/0026237(A1) | 2006-02-01 | Wang et al. | Applicant |
| US2006/0041378(A1) | 2006-02-01 | Chen | Applicant |
| US2006/0041476(A1) | 2006-02-01 | Zheng | Applicant |
| US2006/0041562(A1) | 2006-02-01 | Paczkowski et al. | Applicant |
| US2006/0047615(A1) | 2006-03-01 | Ravin et al. | Applicant |
| US2006/0059124(A1) | 2006-03-01 | Krishna | Applicant |
| US2006/0106788(A1) | 2006-05-01 | Forrest | Applicant |
| US2006/0122850(A1) | 2006-06-01 | Ward et al. | Applicant |
| US2006/0168509(A1) | 2006-07-01 | Boss et al. | Applicant |
| US2006/0224750(A1) | 2006-10-01 | Davies | Applicant |
| US2006/0253319(A1) | 2006-11-01 | Chayes et al. | Applicant |
| US2006/0265495(A1) | 2006-11-01 | Butler et al. | Applicant |
| US2006/0271545(A1) | 2006-11-01 | Youn | Examiner |
| US2006/0277477(A1) | 2006-12-01 | Christenson | Applicant |
| US2006/0282327(A1) | 2006-12-01 | Neal et al. | Applicant |
| US2006/0282328(A1) | 2006-12-01 | Gerace et al. | Applicant |
| US2006/0284378(A1) | 2006-12-01 | Snow et al. | Applicant |
| US2006/0284892(A1) | 2006-12-01 | Sheridan | Applicant |
| US2006/0288087(A1) | 2006-12-01 | Sun | Applicant |
| US2006/0293950(A1) | 2006-12-01 | Meek et al. | Applicant |
| US2007/0027771(A1) | 2007-02-01 | Collins et al. | Applicant |
| US2007/0027785(A1) | 2007-02-01 | Lent et al. | Applicant |
| US2007/0053513(A1) | 2007-03-01 | Hoffberg | Applicant |
| US2007/0061412(A1) | 2007-03-01 | Karidi et al. | Applicant |
| US2007/0061421(A1) | 2007-03-01 | Karidi | Applicant |
| US2007/0073585(A1) | 2007-03-01 | Apple et al. | Applicant |
| US2007/0094228(A1) | 2007-04-01 | Nevin et al. | Applicant |
| US2007/0100653(A1) | 2007-05-01 | Ramer et al. | Applicant |
| US2007/0100688(A1) | 2007-05-01 | Book | Applicant |
| US2007/0116238(A1) | 2007-05-01 | Jacobi | Applicant |
| US2007/0116239(A1) | 2007-05-01 | Jacobi | Applicant |
| US2007/0162501(A1) | 2007-07-01 | Agassi et al. | Applicant |
| US2007/0168874(A1) | 2007-07-01 | Kloeffer | Applicant |
| US2007/0185751(A1) | 2007-08-01 | Dempers | Applicant |
| US2007/0206086(A1) | 2007-09-01 | Baron | Examiner |
| US2007/0239527(A1) | 2007-10-01 | Nazer et al. | Applicant |
| US2007/0250585(A1) | 2007-10-01 | Ly et al. | Applicant |
| US2007/0260596(A1) | 2007-11-01 | Koran et al. | Applicant |
| US2007/0260624(A1) | 2007-11-01 | Chung et al. | Applicant |
| US2007/0265873(A1) | 2007-11-01 | Sheth et al. | Applicant |
| US2008/0021816(A1) | 2008-01-01 | Lent et al. | Applicant |
| US2008/0033794(A1) | 2008-02-01 | Ou et al. | Applicant |
| US2008/0033941(A1) | 2008-02-01 | Parrish | Applicant |
| US2008/0040225(A1) | 2008-02-01 | Roker | Applicant |
| US2008/0072170(A1) | 2008-03-01 | Simons | Applicant |
| US2008/0133650(A1) | 2008-06-01 | Saarimaki et al. | Applicant |
| US2008/0147480(A1) | 2008-06-01 | Sarma et al. | Applicant |
| US2008/0147486(A1) | 2008-06-01 | Wu et al. | Applicant |
| US2008/0147741(A1) | 2008-06-01 | Gonen et al. | Applicant |
| US2008/0183745(A1) | 2008-07-01 | Cancel et al. | Applicant |
| US2008/0183806(A1) | 2008-07-01 | Cancel et al. | Applicant |
| US2008/0201436(A1) | 2008-08-01 | Gartner | Applicant |
| US2008/0215541(A1) | 2008-09-01 | Li et al. | Applicant |
| US2008/0222656(A1) | 2008-09-01 | Lyman | Applicant |
| US2008/0244024(A1) | 2008-10-01 | Aaltonen et al. | Applicant |
| US2008/0262897(A1) | 2008-10-01 | Howarter et al. | Applicant |
| US2008/0270294(A1) | 2008-10-01 | Lent et al. | Applicant |
| US2008/0270295(A1) | 2008-10-01 | Lent et al. | Applicant |
| US2008/0319778(A1) | 2008-12-01 | Abhyanker | Applicant |
| US2009/0006174(A1) | 2009-01-01 | Lauffer | Applicant |
| US2009/0006179(A1) | 2009-01-01 | Billingsley et al. | Applicant |
| US2009/0006622(A1) | 2009-01-01 | Doerr | Applicant |
| US2009/0030859(A1) | 2009-01-01 | Buchs et al. | Applicant |
| US2009/0055267(A1) | 2009-02-01 | Roker | Applicant |
| US2009/0063645(A1) | 2009-03-01 | Casey et al. | Applicant |
| US2009/0076887(A1) | 2009-03-01 | Spivack et al. | Applicant |
| US2009/0099904(A1) | 2009-04-01 | Affeld et al. | Applicant |
| US2009/0119173(A1) | 2009-05-01 | Parsons et al. | Applicant |
| US2009/0132368(A1) | 2009-05-01 | Cotter et al. | Applicant |
| US2009/0138563(A1) | 2009-05-01 | Zhu | Applicant |
| US2009/0138606(A1) | 2009-05-01 | Moran et al. | Applicant |
| US2009/0164171(A1) | 2009-06-01 | Wold et al. | Applicant |
| US2009/0177771(A1) | 2009-07-01 | Britton et al. | Applicant |
| US2009/0210405(A1) | 2009-08-01 | Ortega et al. | Applicant |
| US2009/0222572(A1) | 2009-09-01 | Fujihara | Applicant |
| US2009/0228914(A1) | 2009-09-01 | Wong | Applicant |
| US2009/0240586(A1) | 2009-09-01 | Ramer et al. | Applicant |
| US2009/0287534(A1) | 2009-11-01 | Guo et al. | Applicant |
| US2009/0287633(A1) | 2009-11-01 | Nevin et al. | Applicant |
| US2009/0293001(A1) | 2009-11-01 | Lu et al. | Applicant |
| US2009/0307003(A1) | 2009-12-01 | Benjamin | Applicant |
| US2009/0319296(A1) | 2009-12-01 | Schoenberg | Applicant |
| US2009/0327863(A1) | 2009-12-01 | Holt et al. | Applicant |
| US2010/0023475(A1) | 2010-01-01 | Lahav | Applicant |
| US2010/0023581(A1) | 2010-01-01 | Lahav | Applicant |
| US2010/0049602(A1) | 2010-02-01 | Softky | Applicant |
| US2010/0063879(A1) | 2010-03-01 | Araradian et al. | Applicant |
| US2010/0106552(A1) | 2010-04-01 | Barillaud | Applicant |
| US2010/0125657(A1) | 2010-05-01 | Dowling et al. | Applicant |
| US2010/0205024(A1) | 2010-08-01 | Shachar et al. | Applicant |
| US2010/0255812(A1) | 2010-10-01 | Nanjundaiah et al. | Applicant |
| US2010/0262558(A1) | 2010-10-01 | Willcock | Applicant |
| US2010/0281008(A1) | 2010-11-01 | Braunwarth | Applicant |
| US2010/0306043(A1) | 2010-12-01 | Lindsay et al. | Applicant |
| US2011/0041168(A1) | 2011-02-01 | Murray et al. | Applicant |
| US2011/0055207(A1) | 2011-03-01 | Schorzman et al. | Applicant |
| US2011/0055331(A1) | 2011-03-01 | Adelman et al. | Applicant |
| US2011/0055338(A1) | 2011-03-01 | Loeb et al. | Applicant |
| US2011/0112893(A1) | 2011-05-01 | Karlsson et al. | Applicant |
| US2011/0113101(A1) | 2011-05-01 | Ye et al. | Applicant |
| US2011/0119264(A1) | 2011-05-01 | Hu et al. | Applicant |
| US2011/0131077(A1) | 2011-06-01 | Tan | Applicant |
| US2011/0137733(A1) | 2011-06-01 | Baird et al. | Applicant |
| US2011/0138298(A1) | 2011-06-01 | Alfred et al. | Applicant |
| US2011/0161792(A1) | 2011-06-01 | Florence et al. | Applicant |
| US2011/0208822(A1) | 2011-08-01 | Rathod | Applicant |
| US2011/0246255(A1) | 2011-10-01 | Gilbert et al. | Applicant |
| US2011/0246406(A1) | 2011-10-01 | Lahav et al. | Applicant |
| US2011/0258039(A1) | 2011-10-01 | Patwa et al. | Applicant |
| US2011/0270926(A1) | 2011-11-01 | Boyd | Applicant |
| US2011/0271175(A1) | 2011-11-01 | Lavi et al. | Applicant |
| US2011/0307331(A1) | 2011-12-01 | Richard et al. | Applicant |
| US2011/0320715(A1) | 2011-12-01 | Ickman et al. | Applicant |
| US2012/0012358(A1) | 2012-01-01 | Horan et al. | Applicant |
| US2012/0042389(A1) | 2012-02-01 | Bradley et al. | Applicant |
| US2012/0059722(A1) | 2012-03-01 | Rao | Applicant |
| US2012/0066345(A1) | 2012-03-01 | Rayan | Applicant |
| US2012/0130918(A1) | 2012-05-01 | Gordon | Applicant |
| US2012/0136939(A1) | 2012-05-01 | Stern et al. | Applicant |
| US2012/0150973(A1) | 2012-06-01 | Barak | Applicant |
| US2012/0195422(A1) | 2012-08-01 | Famous | Applicant |
| US2012/0254301(A1) | 2012-10-01 | Fiero | Examiner |
| US2012/0259891(A1) | 2012-10-01 | Edoja | Applicant |
| US2012/0323346(A1) | 2012-12-01 | Ashby et al. | Applicant |
| US2013/0013362(A1) | 2013-01-01 | Walker et al. | Applicant |
| US2013/0036202(A1) | 2013-02-01 | Lahav | Applicant |
| US2013/0054707(A1) | 2013-02-01 | Muszynski et al. | Applicant |
| US2013/0117804(A1) | 2013-05-01 | Chawla | Applicant |
| US2013/0132194(A1) | 2013-05-01 | Rajaram | Applicant |
| US2013/0182834(A1) | 2013-07-01 | Lauffer | Applicant |
| US2013/0204859(A1) | 2013-08-01 | Vijaywargi et al. | Applicant |
| US2013/0212497(A1) | 2013-08-01 | Zelenko et al. | Applicant |
| US2013/0238714(A1) | 2013-09-01 | Barak et al. | Applicant |
| US2013/0268468(A1) | 2013-10-01 | Vijayaraghavan et al. | Applicant |
| US2013/0275862(A1) | 2013-10-01 | Adra | Applicant |
| US2013/0290533(A1) | 2013-10-01 | Barak | Applicant |
| US2013/0311874(A1) | 2013-11-01 | Schachar et al. | Applicant |
| US2013/0326375(A1) | 2013-12-01 | Barak et al. | Applicant |
| US2013/0336471(A1) | 2013-12-01 | Agarwal et al. | Applicant |
| US2014/0068011(A1) | 2014-03-01 | Zhang et al. | Applicant |
| US2014/0115466(A1) | 2014-04-01 | Barak et al. | Applicant |
| US2014/0222888(A1) | 2014-08-01 | Karidi | Applicant |
| US2014/0250051(A1) | 2014-09-01 | Lahav et al. | Applicant |
| US2014/0310229(A1) | 2014-10-01 | Lahav et al. | Applicant |
| US2014/0372240(A1) | 2014-12-01 | Freishtat et al. | Applicant |
| US2015/0012602(A1) | 2015-01-01 | Schorzman et al. | Applicant |
| US2015/0012848(A1) | 2015-01-01 | Barak et al. | Applicant |
| US2015/0019525(A1) | 2015-01-01 | Barak et al. | Applicant |
| US2015/0019527(A1) | 2015-01-01 | Barak et al. | Applicant |
| US2015/0149571(A1) | 2015-05-01 | Barak et al. | Applicant |
| US2015/0200822(A1) | 2015-07-01 | Zelenko et al. | Applicant |
| US2015/0213363(A1) | 2015-07-01 | Lahav et al. | Applicant |
| US2015/0269609(A1) | 2015-09-01 | Mehanian | Applicant |
| US2015/0278837(A1) | 2015-10-01 | Lahav et al. | Applicant |
| US2016/0055277(A1) | 2016-02-01 | Lahav et al. | Applicant |
| US2016/0248706(A1) | 2016-08-01 | Karidi | Applicant |
| EP840244(A1) | 1998-05-01 | Applicant | |
| EP1233361(A1) | 2002-08-01 | Applicant | |
| EP1276064(A2) | 2003-01-01 | Applicant | |
| EP1549025(A1) | 2005-06-01 | Applicant | |
| EP1840803(A1) | 2007-10-01 | Applicant | |
| EP1845436(A2) | 2007-10-01 | Applicant | |
| EP1850284(A1) | 2007-10-01 | Applicant | |
| FR2950214(A1) | 2011-03-01 | Applicant | |
| JP9288453 | 1997-11-01 | Applicant | |
| JP2004-054533 | 2004-02-01 | Applicant | |
| JP2010/128877 | 2010-06-01 | Applicant | |
| KR20040110399(A) | 2004-12-01 | Applicant | |
| KR20050010487(A) | 2005-01-01 | Applicant | |
| KR20080046310(A) | 2008-05-01 | Applicant | |
| KR20080097751(A) | 2008-11-01 | Applicant | |
| WO9722073(A1) | 1997-06-01 | Applicant | |
| WO9845797(A2) | 1998-10-01 | Applicant | |
| WO9909470(A1) | 1999-02-01 | Applicant | |
| WO9922328(A1) | 1999-05-01 | Applicant | |
| WO9944152(A1) | 1999-09-01 | Applicant | |
| WO/57294(A1) | 2000-09-01 | Applicant | |
| WO1/27825(A1) | 2001-04-01 | Applicant | |
| WO1/35272(A2) | 2001-05-01 | Applicant | |
| WO2/065367(A2) | 2002-08-01 | Applicant | |
| WO3/032146(A1) | 2003-04-01 | Applicant | |
| WO2004/057473(A1) | 2004-07-01 | Applicant | |
| WO2005/059777(A1) | 2005-06-01 | Applicant | |
| WO2007/044757(A1) | 2007-04-01 | Applicant | |
| WO2007/129625(A1) | 2007-11-01 | Applicant | |
| WO2008/057181(A2) | 2008-05-01 | Applicant | |
| WO2008/143382(A1) | 2008-11-01 | Applicant | |
| WO2009/029940(A1) | 2009-03-01 | Applicant | |
| WO2010/099632(A1) | 2010-09-01 | Applicant | |
| WO2010/119379(A1) | 2010-10-01 | Applicant | |
| WO2010/144207(A2) | 2010-12-01 | Applicant | |
| WO2011/127049(A1) | 2011-10-01 | Applicant | |
| WO2013/119808(A1) | 2013-08-01 | Applicant | |
| WO2013/158830(A1) | 2013-10-01 | Applicant | |
| WO2013/163426(A1) | 2013-10-01 | Applicant | |
| WO2015/021068(A2) | 2015-02-01 | Applicant |
Non-Patent Literature (241)
- Chartrand Sabra, “A new system seeks to ease the bottleneck in the customer-service information highway” New York Times (Apr. 30, 2001) p. 12, col. 4.Applicant
- Just Answer (2004 Faq) Archive.org cache of www.justanswer.com circa (Dec. 2004).Applicant
- Pack Thomas, “Human Search Engines the next Killer app,” (Dec. 1, 2000) Econtent DBS vol. 23; Issue 6 p. 16.Applicant
- match.com “Match.com Launches Match.com Advisors,” PR Newswire (Oct. 14, 2003).Applicant
- SITEL, “SITEL to Provide Live Agent Support Online for Expertcity.com,” PR Newswire (Feb. 28, 2000).Applicant
- Webmaster World, “Link to my website is in a frame with banner ad at the top,” (Nov. 11, 2003) www.webmasterworld.com.Applicant
- Bry et al., “Realilzing Business Processes with ECA Rules: Benefits, Challenges, Limits,” Principles and Practice of Sematic Web Reasoning Lecture Notes in Computer Science, pp. 48-62, LNCS, Springer, Berlin, DE (Jan. 2006).Applicant
- Fairisaac, “How SmartForms for Blaze Advisor Works,” www.fairisaac.com 12 pages (Jan. 2005).Applicant
- Mesbah A et al., “A Component-and Push-Based Architectural Style for Ajax Applications,” The Journal of Systems & Software, 81 (12): pp. 2194-2209, Elsevier North Holland, New York, NY US (Dec. 2008).Applicant
- Oracle Fusion Middleware Administrator's Guide for Oracle SOA (Oracle Guide) Suite 11g Release 1 (11.1.1) Part No. E10226-02 www.docs.oracle.com (Oct. 2009).Applicant
- “Oauth core 1.0 Revision A,” [XP002570263] Jun. 24, 2009, Oauth Core Workgroups pp. 1-27 www.ouath.net/core/1.0a/) retrieved Jun. 24, 2009.Applicant
- PRN: “First American Financial Acquires Tele-Track Inc.,” PR Newswire, (May 11, 1999), Proquest #41275773, 2 pages.Applicant
- Young, Deborah, “The Information Store,” (Sep. 15, 2000), Wireless Review, pp. 42, 44, 46, 48, 50.Applicant
- Whiting et al., “Profitable Customers,” (Mar. 29, 1999), Information Week, Issue 727, pp. 44, 45, 48, 52, 56.Applicant
- Bayer, Judy, “A Framework for Developing and Using Retail Promotion Response Models,” Cares Integrated Solutions, retrieved from www.ceresion.com (2007) 5 pages.Applicant
- Bayer, Judy, “Automated Response Modeling System for Targeted Marketing,” (Mar. 1998), Ceres Integrated Solutions, 5 pages.Applicant
- Sweet et al., “Instant Marketing,” (Aug. 12, 1999), Information Week, pp. 18-20.Applicant
- SmartKids.com “Chooses Quadstone—The Smartest Customer Data Mining Solution,” (Jul. 31, 2000), Business Wire, 2 pages.Applicant
- “NCR's Next Generation Software Makes True Customer Relationship Management a Reality,” (Jul. 26, 1999) PR Newswire, 3 pages.Applicant
- “Quadstone System 3.0 Meets New Market Demand for Fast, Easy-to-Use Predictive Analysis for CRM,” (May 22, 2000) Business Wire, 3 pages.Applicant
- “Net Perceptions Alters Dynamics of Marketing Industry with Introduction of Net Perceptions for Call Centers,” (Oct. 12, 1998) PR Newswire, 3 pages.Applicant
- “Ceres Targeted Marketing Application,” Ceres Integrated Solutions: retrieved from www.ceresios.com/Product/index.htm (2007) 3 pages.Applicant
- Prince, C. J., E:business: A Look at the Future, Chief Executive, vol. 154, (Apr. 2000), pp. 10-11.Applicant
- Richardson et al., “Predicting Clicks: Estimating the Click-Through Rate for New Ads,” (May 2007).Applicant
- Anon., “AnswerSoft Announces Concerto; First to Combine Call Center Automation with Power of Web,” Business Wire, (Feb. 3, 1997) 3 pages.Applicant
- Emigh, J., “AnswerSoft Unveils Concerto for Web-Based Call Centers Feb. 5, 1996,” Newsbytes, (Feb. 5, 1997) 2 pages.Applicant
- Grigonis, R., “Webphony-It's not Just Callback Buttons Anymore,” Computer Telephony, (Dec. 1997) 4 pages.Applicant
- Wagner, M., “Caring for Customers,” Internet World, (Sep. 1, 1999) 3 pages.Applicant
- Sweat, J., “Human Touch—A New Wave of E-Service Offerings Blends the Web, E-Mail, and Voice Bringing People back into the Picture,” Inforamtionweek, (Oct. 4, 1999) 2 pages.Applicant
- Kirkpatrick, K., “Electronic Exchange 2000, The,” Computer Shopper, (Nov. 1999) 5 pages.Applicant
- Anon., “InstantService.com Teams with Island Data to provide Integrated Solution for Online Customer Response,” Business Wire, (May 22, 2000) 3 pages.Applicant
- Kersnar, S., “Countrywide Offers Proprietary Technology for Online Wholesale Lending,” National Mortgage News, vol. 24, No. 38, (Jun. 5, 2000) 2 pages.Applicant
- Douglas Armstrong, Firstar Web site helps add up future, Milwaukee Journal Sentinel, (Mar. 28, 1996) 3 pages.Applicant
- Oikarinen et al. “Internet Relay Chat Protocol” RFC-1459, pp. 1-65, (May 1993).Applicant
- eDiet.com: Personalized Diets, Fitness, and Counseling, (May 3, 1998), pp. 1-15.Applicant
- Fiszer, Max; “Customizing an inbound call-center with skills-based routing,” Telemarketing & Call Center Solutions, (Jan. 1997), v15i7p. 24; Proquest #11267840, 5 pages.Applicant
- redhat .com downloaded on Jul. 23, 2006.Applicant
- apache.org downloaded on Jul. 23, 2006.Applicant
- mysql.com downloaded on Jul. 23, 2006.Applicant
- developer.com downloaded on Jul. 23, 2006.Applicant
- Canter, Ronald S., “Lender Beware-Federal Regulation of Consumer Credit”, Credit World, vol. 81, No. 5, pp. 16-20, (May 1993).Applicant
- Staff, “On-Line System Approves Loans While Customer Waits,” Communication News, vol. 31, Issue 9, (Sep. 1994) 3 pages.Applicant
- “Low-Rent Loan Officer in a Kiosk”, Bank Technology News vol. 8 No. 2, p (Feb. 1995) 2 pages.Applicant
- Duclaux, Denise, “A Check for $5,000 in Ten Minutes”, ABA Banking Journal, vol. 87, No. 8, p. 45, AUQ. (1995) 2 pages.Applicant
- “World Wide Web Enhances Customer's Choice”, Cards International, No. 143, p. 9, (Nov. 1995) 2 pages.Applicant
- Wells Fargo Launches First Real-Time, Online Home Equity Credit Decision-Making Service, Business Wire, (Jun. 3, 1998), Dialog— File 621:New Product Announcement, 3 pages.Applicant
- Handley, John, “Credit Review Lets the Numbers do the Talking in Home Mortgage Game”, Chicaao Tribune (Jul. 1998) 3 pages.Applicant
- Sherman, Lee, “Wells Fargo Writes a New Online Script”, Interactive Week, vol. 5, No. 31, p. 29, (Aug. 1998) 2 pages.Applicant
- Calvey, Mark, “Internet Gives Bankers a Snappy Comeback”, San Francisco Business Times, vol. 13, No. 5, p. 3 (Sep. 1998) 2 pages.Applicant
- McCormick, Linda, “Users of Credit Scoring Face Tough Rules on Notification”, American Banker, Dialoa File 625:American Banker Publications, (Mar. 21, 1982) 2 pages.Applicant
- What the Credit Bureau is Saying About You: If a Mistake Sneaks Into Your Record, You May Not Know About it Until You Get Turned Down for Credit, Changing Times, vol. 37, p. 56, (Jul. 1983) 2 pages.Applicant
- McShane. Peter K., “Got Financing?”, Business Journal Serving Southern Tier, CNY, Mohawk Valley, Finger Lakes. North, vol. 11, Issue 19, p. 9, (Sep. 15, 1997) 3 pages.Applicant
- Borowsky, Mark, “The Neural Net: Predictor of Fraud or Victim of Hype?”, Bank Technology News DialoQ File 16:PROMT, p. 7 (Sep. 1993) 2 pages.Applicant
- FICO http://houseloans.idis.com/fico (2009) 1 page.Applicant
- Altavista: search, FICO http://www.altavista.com (2001) 3 pages.Applicant
- What Do FICO Scores Mean to Me?, http://www.sancap.com. (1999) 3 pages.Applicant
- What is a FICO Score?, http://www.aspeenloan.com (2009) 1 page.Applicant
- “Credit”, The New Encyclopaedia Britannica vol. 3 p. 722. (1994) 3 pages.Applicant
- “Creditnet.com—An Online Guide to Credit Cards”, http://www.creditnet/com. (1999) 1 page.Applicant
- “Phillips 66 Introduces Mastercard with Rebate Feature”, PR Newswire, p914NY067, (Sep. 14, 1995) 1 page.Applicant
- Anon, “VAR Agreement Expands Credit Bureau Access.”, (CCS America, Magnum Communications Ltd expand CardPac access, Computers in Banking, v6, n10, p. 58 (1) (Oct. 1989) 2 pages.Applicant
- Wortmann, Harry S., “Reengineering Update—Outsourcing: An Option Full of Benefits and Responsibilities”, American Banker, (Oct. 24, 1994), p. 7A vol. 159, No. 205 3 pages.Applicant
- Anon. “To Boost Balances, AT&T Renews No-Fee Universal Credit Card Offer”, Gale Group Newsletter, V 10, N. 13, (Mar. 30, 1992) 2 pages.Applicant
- Anon. “Citgo Puts a New Spin on the Cobranded Oil Card”, Credit Card News, p. 4, (Nov. 1, 1995) 2 pages.Applicant
- Anon. “Microsoft Targets More than PIM Market with Outlook 2000,” Computer Reseller News, N. 805 pp. 99, (Aug. 31, 1998) 2 pages.Applicant
- Chesanow, Neil, “Pick the Right Credit Cards-and use them wisely”, Medical Economics, v. 75, n. 16, p. 94, (Aug. 24, 1998) 4 pages.Applicant
- Friedland, Marc, “Credit Scoring Digs Deeper into Data”, Credit World, v. 84, n. 5 p. 19-23, (May 1996) 5 pages.Applicant
- Hollander, Geoffrey, “Sibling Tool Personator 3 untangles File Formats”, InfoWorld, v20, n5, pp. 102 (Feb. 2, 1998) 2 pages.Applicant
- Kantrow, Yvette D., “Banks Press Cardholders to Take Cash Advances”, American Banker, v. 157, n. 18 pp. 1-2. (Jan. 28, 1992) 2 pages.Applicant
- Lotus News Release: “Lotus Delivers Pre-Release of Lotus Notes 4.6 Client Provides Compelling New Integration with Internet Explorer”, (May 20, 1997) 2 pages.Applicant
- Stetenfeld, Beth, “Credit Scoring: Finding the Right Recipe”, Credit Union Management, v. 17, n. 11, pp. 24-26 (Nov. 1994).Applicant
- Block, Valerie, “Network Assembles Card Issuers at an Internet Site”, Am. Banker, V160, (1998) 1 page.Applicant
- CreditNet Financial Network http://consumers.creditnet.com (1999) 1 page.Applicant
- Anon., “Lending Tree: Lending Tree Provides Borrowers Fast and Easy Online Access to Multiple Loan Offers,” Business Wire, Jun. 23, 1998, 2 pages.Applicant
- Anon, Regulation Z Commentary Amendments, Retail Banking Digest, vol. 15, No. 2, p. 17-18, (Mar.-Apr. 1995).Applicant
- Anon, San Diego Savings Association Offers Customers No-Fee Visa Product, Card News, (Feb. 29, 1988) 1 page.Applicant
- Bloom, J.K., “For This New Visa, Only Web Surfers Need Apply,” American Banker, vol. 1163, No. 34 12 (Feb. 20, 1998) 2 pages.Applicant
- Harney, K.R., “Realty Brokers, Lenders Face Restrictions,” Arizona Republic, Final Chaser edition, Sun Living section, (Feb. 10, 1991) 2 pages.Applicant
- Higgins, K.T., “Mr. Plastic Joins the Marketing Team,” Credit Card Management, vol. 6, No. 3, pp. 26-30, Jun. 1993.Applicant
- Microsoft Press Computer Dictionary, Third Edition, Microsoft Press, Redmond, 1997, 4 pages.Applicant
- Whiteside, D.E., “One Million and Counting,” Collections and Credit Risk, vol. 1, No. 11 (Nov. 1996) 5 pages.Applicant
- Fickenscher, L., “Providian Undercuts rivals with 7.9% Rate Offer,” American banker, vol. 163, Oct. 8, 1998, 2 pages.Applicant
- Fargo, J., “The Internet Specialists,” Credit Card Management, vol. 11, No. 10, pp. 38-45, Jan. 1999.Applicant
- Lemay, T., “Browsing for a Mortgage a Click away,” Financial Post, (Jan. 15, 2000) 1 page.Applicant
- Wijnen, R., “Banks Fortify Online Services,” Bank Technology News, vol. 13, No. 3, Mar. 2000, 3 pages.Applicant
- Anon. “IAFC Launches NextCard, The First True Internet VISA,” Business Wire, New York: (Feb. 6, 1998), 3 pages.Applicant
- Lazarony, Lucy, “Only Online Applicants Need Apply,” Bank Advertising News, North Palm Beach, Mar. 23, 1998, vol. 21, Issue 15, 3 pages.Applicant
- FIData, Inc., News & Press Releases, “Instant Credit Union Loans via the Internet,” http://web.archive.org/web/19990221115203/www.fidata-inc.com/news-pr01.htm (1999) 2 pages.Applicant
- FIData, Inc., Press Releases, “Instant Loan Approvals via the Internet,” http://www.fidata-—inc.com/news/pr—040198.htm, (Apr. 1, 1998) 2 pages.Applicant
- Staff, “On-Line System Approves Loans While Customer Waits”—Abstract, Communication News, vol. 31, Issue 9, (Sep. 1994) 3 pages.Applicant
- Anon. “Affordable Lending Systems Now Available for Smaller Financial Institutions,” Business Wire, (May 18, 1998), 2 pages.Applicant
- Nexis—All News Sources—Examiner's NPL Search Results in U.S. Appl. No. 11/932,498, included with Office Action issued Oct. 8, 2008, 14 pages.Applicant
- “Sample Experian Credit Report” by Consumer Information consumerinfo.com (Jul. 9, 1998) 4 pages.Applicant
- Plaintiffs Original Complaint, Nextcard, LLC v. Liveperson, Inc.; Civil Action No. 2:08-cv-00184-TJW, In the U.S. District Court for the Eastern District ofTexas, Marshall Division, filed Apr. 30, 2008 (7 pages).Applicant
- Amended Complaint and Jury Demand; Liveperson, Inc. v. Nextcard, LLC, et al.; Civil Action No. 08-062 (GMS), in the U.S. District Court for the District of Delaware, filed Mar. 18, 2008 (5 pages).Applicant
- Plaintiffs Second Amended Complaint; Nextcard, LLC v. American Express Company, et al; Civil Action No. 2:07-cv-354 (TJW); In the U.S. District Court for the Eastern District of Texas, Marshall Division, filed Apr. 9, 2008 (12 pages).Applicant
- Defendants HSBC North America Holdings Inc.'s and HSBC USA Inc's Answer, Affirmative Defenses and Counterclaims to Plaintiffs Second Amended Compalint; Nextcard, LLC v. American Express Company, et al; Civil Action No. 2:07-cv-354 (TJW); In the U.S. District Court for the Eastern District of Texas, Marshall Division filed (Apr. 28, 2008), 13 pages.Applicant
- Answer and Counterclaims of Defendant DFS Services LLC; Nextcard, LLC v. American Express Company, et al; Civil Action No. 2:07-cv-354 (TJW); In the U.S. District Court for the Eastern District of Texas, Marshall Division, filed Apr. 28, 2008 (13 pages).Applicant
- Defendant The PNC Financial Services Group, Inc.'s Answer and Affirmative Defenses to Second Amended Complaint; Nextcard, LLC v. American Express Company, et al; Civil Action No. 2:07-cv-354 (TJW); In the U.S. District Court for the Eastern District of Texas, Marshall Division, filed Apr. 28, 2008, 10 pages.Applicant
- Plaintiffs Second Amended Reply to Counterclaims of Defendants HSBC North America Holdings Inc. and HSBC USA Inc.; Nextcard, LLC v. American Express Company, et al; Civil Action No. 2:07-cv-354 (TJW); In the U.S. District Court for the Eastern District of Texas, Marshall Division, filed May 14, 2008 (5 paoes).Applicant
- Plaintiffs Second Amended Reply to Counterclaims of Defendant DFS Services LLC; Nextcard, LLC v. American Express Company, et al; Civil Action No. 2:07-cv-354 (TJW); In the U.S. District Court for the Eastern District of Texas, Marshall Division, filed May 14, 2008 (71 pages).Applicant
- Plaintiffs Second Amended Reply to Counterclaims of Defendant American Express Company; Nextcard, LLC v. American Express Company, et al; Civil Action No. 2:07-cv-354 (TJW); In the U.S. District Court for the Eastern District of Texas, Marshall Division, filed (May 8, 2008), 8 paqes.Applicant
- Justin Hibbard, Gregory Dalton, Mary E Thyfault. (Jun. 1998). “Web-based customer care.” Information Week, (684) 18-20, 3 pages.Applicant
- “ESL Federal Credit Union Inaugurates Internet Target Marketing.” PR Newswire p. 4210 (Oct. 6, 1998), 3 pages.Applicant
- Kim S. Nash “Call all Customers.” Computerworld, 32 (1), 25-28 (Dec. 1997), 2 pages.Applicant
- “Welcome to eStara—The Industry Leader in Click to Call and Call Tracking Solutions,” e-Stara, Inc., retrieved from www.estara.com on Mar. 21, 2013, 1 page.Applicant
- “Push to Talk Live Now! From your website” iTalkSystem, Inc., retrieved from www.italksystems.com on Mar. 21, 2013, 1 page.Applicant
- Welcome to Keen retrieved from www.archive.org/web/20010302014355/http://www.keen.com/ on Jan. 25, 2013, 1 page.Applicant
- Christophe Destruel, Herve Luga, Yves Duthen, Rene Caubet. “Classifiers based system for interface evolution.” Expersys Conference, 265-270 (1997), 6 pages.Applicant
- Ulla de Stricker, Annie Joan Olesen. “Is Management Consulting for You?” Searcher, 48-53 (Mar. 2005), 6 pages.Applicant
- Humberto T. Marques Neto, Leonardo C.D. Rocha, Pedro H.C. Guerra, Jussara M. Almeida, Wagner Meira Jr., Virgilio A. F. Almeida. “A Characterization of Broadband User Behavior and Their E-Business Activities.” ACM SIGMETRICS Performance Evaluation Review, 3-13 (2004), 11 pages.Applicant
- Greg Bowman, Michael M. Danchak, Mary LaCombe, Don Porter. “Implementing the Rensselaer 80/20 Model in Professional Education.” 30th ASEE/IEEE Frontiers in Education Conference, Session T3G (Oct. 18-21, 2000), 1 page.Applicant
- Elizabeth Sklar Rozier, Richard Alterman. “Participatory Adaptation.” CHI, 97, 261-262 (Mar. 22-27, 1997), 2 pages.Applicant
- Frank White. “The User Interface of Expert Systems: What Recent Research Tells Us.” Library Software Review, vol. 13, No. 2, p. 91-98 (Summer 1994) 8 pages.Applicant
- Frederick W. Rook, Michael L. Donnell. “Human Cognition and the Expert System Interface: Mental Models and Inference Explanations.” IEEE Transactions on Systems, Man, and Cybernetics, vol. 23, No. 6, p. 1649-1661 (Nov./Dec. 1993), 13 pages.Applicant
- International Search Report for PCT Application No. PCT/US2011/031239, mailed on Jul. 7, 2011, 3 pages.Applicant
- International Search Report for PCT Application No. PCT/US2011/064946, mailed on Jun. 22, 2012, 3 pages.Applicant
- International Search Report for PCT Application No. PCT/US03/41090, mailed on Sep. 1, 2004, 3 pages.Applicant
- International Search Report for PCT Application No. PCT/US05/40012, mailed on Oct. 5, 2007, 2 pages.Applicant
- International Preliminary Report on Patentability for PCT Application No. PCT/US2011/031239, dated Oct. 9, 2012, 8 pages.Applicant
- International Preliminary Report on Patentability for PCT Application No. PCT/US2006/039630, dated Apr. 16, 2008, 4 pages.Applicant
- International Search Report and Written Opinion for PCT Application No. PCT/US2013/037086, mailed Jul. 12, 2013, 9 pages.Applicant
- International Search Report and Written Opinion for PCT Application No. PCT/US2013/29389, mailed Jul. 24, 2013, 8 pages.Applicant
- International Preliminary Report on Patentability for PCT Application No. PCT/US2013/29389, mailed Sep. 18, 2014, 6 pages.Applicant
- International Search Report and Written Opinion for PCT Application No. PCT/US2013/038212, mailed Jul. 17, 2013, 11 pages.Applicant
- International Preliminary Report on Patentability for PCT Application No. PCT/US2013/038212, mailed Nov. 6, 2014, 8 pages.Applicant
- International Search Report and Written Opinion for PCT Application No. PCT/US2013/041147, mailed Jul. 30, 2013, 9 pages.Applicant
- International Preliminary Report on Patentability for PCT Application No. PCT/US2013/041147, mailed Jan. 22, 2015, 21 pages.Applicant
- International Search Report for PCT Application No. PCT/US2013/025142, mailed Jun. 5, 2013, 4 pages.Applicant
- International Preliminary Report on Patentability for PCT Application No. PCT/US2013/025142, mailed Aug. 21, 2014, 5 pages.Applicant
- International Search Report and Written Opinion for PCT Application No. PCT/US14/49822, mailed Feb. 27, 2015, 11 pages.Applicant
- Non-Final Office Action of Dec. 11, 2008 for U.S. Appl. No. 11/394,078, 15 pages.Applicant
- Final Office Action of Jul. 9, 2009 for U.S. Appl. No. 11/394,078, 15 pages.Applicant
- Non-Final Office Action of Jan. 28, 2010 for U.S. Appl. No. 11/394,078, 14 pages.Applicant
- Final Office Action of Jul. 9, 2010 for U.S. Appl. No. 11/394,078, 16 pages.Applicant
- Non-Final Office Action of Feb. 1, 2011 for U.S. Appl. No. 11/394,078, 20 pages.Applicant
- Final Office Action of Aug. 2, 2011 for U.S. Appl. No. 11/394,078, 23 pages.Applicant
- Non-Final Office Action of May 16, 2012 for U.S. Appl. No. 11/394,078, 23 pages.Applicant
- Final Office Action of Jan. 25, 2013 for U.S. Appl. No. 11/394,078, 22 pages.Applicant
- Non-Final Office Action of Jun. 22, 2012 for U.S. Appl. No. 13/080,324, 9 pages.Applicant
- Non-Final Office Action of Jan. 16, 2012 for U.S. Appl. No. 12/725,999, 13 pages.Applicant
- Final Office Action of Aug. 2, 2012 for U.S. Appl. No. 12/725,999, 15 pages.Applicant
- Non-Final Office Action of Aug. 15, 2012 for U.S. Appl. No. 12/967,782, 31 pages.Applicant
- Non-Final Office Action of Jul. 29, 2011 for U.S. Appl. No. 12/608,117, 20 pages.Applicant
- Final Office Action of Apr. 4, 2012 for U.S. Appl. No. 12/608,117, 25 pages.Applicant
- Non-Final Office Action of Apr. 24, 2004 for U.S. Appl. No. 09/922,753, 16 pages.Applicant
- Final Office Action of Oct. 14, 2004 for U.S. Appl. No. 09/922,753, 13 pages.Applicant
- Non-Final Office Action of May 17, 2005 for U.S. Appl. No. 09/922,753, 13 pages.Applicant
- Non-Final Office Action of Mar. 14, 2006 for U.S. Appl. No. 09/922,753, 13 pages.Applicant
- Final Office Action of Jul. 26, 2006 for U.S. Appl. No. 09/922,753, 13 pages.Applicant
- Non-Final Office Action of Aug. 13, 2008 for U.S. Appl. No. 09/922,753, 10 pages.Applicant
- Final Office Action of Apr. 23, 2009 for U.S. Appl. No. 09/922,753, 11 pages.Applicant
- Non-Final Office Action of Jul. 21, 2009 for U.S. Appl. No. 09/922,753, 10 pages.Applicant
- Final Office Action of Feb. 18, 2010 for U.S. Appl. No. 09/922,753, 9 pages.Applicant
- Non-Final Office Action of Apr. 25, 2011 for U.S. Appl. No. 09/922,753, 9 pages.Applicant
- Final Office Action of Nov. 25, 2011 for U.S. Appl. No. 09/922,753, 10 pages.Applicant
- Non-Final Office Action of Aug. 7, 2007 for U.S. Appl. No. 10/980,613, 16 pages.Applicant
- Non-Final Office Action of May 15, 2008 for U.S. Appl. No. 10/980,613, 23 pages.Applicant
- Non-Final Office Action of Apr. 30, 2012 for U.S. Appl. No. 12/504,265, 16 pages.Applicant
- Final Office Action of Aug. 28, 2012 for U.S. Appl. No. 12/504,265, 28 pages.Applicant
- Final Office Action of Feb. 14, 2013 for U.S. Appl. No. 13/080,324, 11 pages.Applicant
- Final Office Action of Apr. 11, 2013 for U.S. Appl. No. 12/967,782 18 pages.Applicant
- Non-Final Office Action of Jun. 12, 2013 for U.S. Appl. No. 12/608,117, 56 pages.Applicant
- Non-Final Office Action of Jul. 8, 2013 for U.S. Appl. No. 13/413,197, 10 pages.Applicant
- Non-Final Office Action of Jun. 27, 2013 for U.S. Appl. No. 12/504,265 , 11 pages.Applicant
- Non-Final Office Action of Jun. 20, 2013 for U.S. Appl. No. 13/157,936, 19 pages.Applicant
- Non-Final Office Action of May 10, 2013 for U.S. Appl. No. 13/563,708, 20 pages.Applicant
- Non-Final Office Action of Mar. 30, 2013 for U.S. Appl. No. 11/360,530, 23 pages.Applicant
- Non-Final Office Action of Oct. 30, 2013 for U.S. Appl. No. 13/961,072, 10 pages.Applicant
- Non-Final Office Action of Dec. 5, 2013 for U.S. Appl. No. 12/967,782, 14 pages.Applicant
- Final Office Action of Oct. 21, 2013 for U.S. Appl. No. 12/504,265 14 pages.Applicant
- Notice of Allowance of Jan. 3, 2014 for U.S. Appl. No. 11/360,530, 29 pages.Applicant
- Final Office Action of Jan. 22, 2014 for U.S. Appl. No. 12/608,117, 45 pages.Applicant
- Final Office Action of Jan. 27, 2014 for U.S. Appl. No. 13/563,708, 35 pages.Applicant
- Non-Final Office Action of Jan. 30, 2014 for U.S. Appl. No. 13/413,158, 19 pages.Applicant
- Notice of Allowance of Feb. 12, 2014 for U.S. Appl. No. 13/157,936, 33 pages.Applicant
- Final Office Action of Feb. 19, 2014 for U.S. Appl. No. 13/961,072, 35 pages.Applicant
- Non-Final Office Action of Feb. 20, 2014 for U.S. Appl. No. 10/980,613, 43 pages.Applicant
- Notice of Allowance of Feb. 28, 2014 for U.S. Appl. No. 09/922,753, 13 pages.Applicant
- Notice of Allowance of Mar. 25, 2014 for U.S. Appl. No. 12/504,265, 31 pages.Applicant
- Notice of Allowance of Mar. 31, 2014 for U.S. Appl. No. 12/725,999, 41 pages.Applicant
- Notice of Allowance of Apr. 1, 2014 for U.S. Appl. No. 13/413,197, 32 pages.Applicant
- Non-Final Office Action of Jul. 17, 2014 for U.S. Appl. No. 11/394,078, 41 pages.Applicant
- Non-Final Office Action of Jul. 31, 2014 for U.S. Appl. No. 13/080,324, 38 pages.Applicant
- Notice of Allowance of Aug. 18, 2014 for U.S. Appl. No. 12/967,782, 43 pages.Applicant
- Non-Final Office Action of Aug. 21, 2014 for U.S. Appl. No. 10/980,613, 43 pages.Applicant
- Notice of Allowance of Sep. 17, 2014 for U.S. Appl. No. 13/413,158, 14 pages.Applicant
- Notice of Allowance of Sep. 26, 2014 for U.S. Appl. No. 13/563,708, 14 pages.Applicant
- Non-Final Office Action of Dec. 4, 2014 for U.S. Appl. No. 14/275,698, 6 pages.Applicant
- Non-Final Office Action of Dec. 23, 2014 for U.S. Appl. No. 13/961,072, 11 pages.Applicant
- Non-Final Office Action of Jan. 14, 2015 for U.S. Appl. No. 14/288,258, 12 pages.Applicant
- Non-Final Office Action of Jan. 21, 2015 for U.S. Appl. No. 14/500,502, 8 pages.Applicant
- Final Office Action of Jan. 29, 2015 for U.S. Appl. No. 14/245,400, 28 pages.Applicant
- Final Office Action of Mar. 12, 2015 for U.S. Appl. No. 13/080,324, 13 pages.Applicant
- Non-Final Office Action of Mar. 13, 2015 for U.S. Appl. No. 13/841,434, 26 pages.Applicant
- Non-Final Office Action of Apr. 9, 2015 for U.S. Appl. No. 13/830,719, 24 pages.Applicant
- Final Office Action of Apr. 7, 2015 for U.S. Appl. No. 11/394,078, 18 pages.Applicant
- Notice of Allowance of Mar. 30, 2015 for U.S. Appl. No. 14/275,698, 11 pages.Applicant
- Non-Final Office Action of Apr. 6, 2015 for U.S. Appl. No. 14/322,736, 13 pages.Applicant
- Non-Final Office Action of May 7, 2015 for U.S. Appl. No. 13/829,708, 16 pages.Applicant
- Final Office Action of May 8, 2015 for U.S. Appl. No. 10/980,613, 18 pages.Applicant
- Non-Final Office Action of May 13, 2015 for U.S. Appl. No. 14/317,346, 21 pages.Applicant
- Non-Final Office Acton of Jun. 2, 2015 for U.S. Appl. No. 12/608,117, 26 pages.Applicant
- First Action Interview Pilot Program Pre-Interview Communication of Jun. 19, 2015 for U.S. Appl. No. 14/244,830, 7 pages.Applicant
- Extended European Search Report dated Jul. 7, 2015 for European Patent Application No. 15161694.3; 8 pages.Applicant
- Non-Final Office Action of Jul. 20, 2015 for U.S. Appl. No. 14/500,537; 12 pages.Applicant
- Final Office Action of Jul. 31, 2015 for U.S. Appl. No. 14/317,346, 13 pages.Applicant
- Final Office Action of Aug. 10, 2015 for U.S. Appl. No. 13/961,072, 12 pages.Applicant
- Non-Final Office Action of Aug. 14, 2015 for U.S. Appl. No. 14/543,397, 12 pages.Applicant
- Non-Final Office Action of Aug. 18, 2015 for U.S. Appl. No. 14/570,963, 23 pages.Applicant
- Non-Final Office Action of Aug. 27, 2015 for U.S. Appl. No. 11/394,078, 21 pages.Applicant
- Non-Final Office Action of Sep. 11, 2015 for U.S. Appl. No. 14/500,502; 12 pages.Applicant
- Final Office Action of Sep. 18, 2015 for U.S. Appl. No. 14/288,258, 17 pages.Applicant
- Notice of Allowance of Sep. 18, 2015 for U.S. Appl. No. 14/244,830, 13 pages.Applicant
- First Action Interview Pilot Program Pre-Interview Communication of Oct. 21, 2015 for U.S. Appl. No. 14/313,511, 3 pages.Applicant
- Final Office Action of Jan. 29, 2016 for U.S. Appl. No. 14/500,537; 15 pages.Applicant
- Non-Final Office Action of Feb. 12, 2016 for U.S. Appl. No. 13/080,324, 15 pages.Applicant
- Notice of Allowance of Mar. 16, 2016 for U.S. Appl. No. 14/582,550; 9 pages.Applicant
- Notice of Allowance of Mar. 21, 2016 for U.S. Appl. No. 14/753,496; 5 pages.Applicant
- Final Office Action of Apr. 14, 2016 for U.S. Appl. No. 10/980,613, 21 pages.Applicant
- Final Office Action of Apr. 21, 2016 for U.S. Appl. No. 14/317,346, 17 pages.Applicant
- Non-Final Office Action of Apr. 22, 2016 for U.S. Appl. No. 14/288,258 11 pages.Applicant
- Notice of Allowance of Apr. 22, 2016 for U.S. Appl. No. 11/394,078, 16 pages.Applicant
- Final Office Action of Oct. 22, 2015 for U.S. Appl. No. 13/830,719, 29 pages.Applicant
- Final Office Action of Nov. 10, 2015 for U.S. Appl. No. 13/841,434; 30 pages.Applicant
- Final Office Acton of Nov. 17, 2015 for U.S. Appl. No. 12/608,117, 32 pages.Applicant
- Non-Final Office Action of Dec. 4, 2015 for U.S. Appl. No. 10/980,613 21 pages.Applicant
- Non-Final Office Action of Dec. 24, 2015 for U.S. Appl. No. 14/317,346, 15 pages.Applicant
- Notice of Allowance of Dec. 30, 2015 for U.S. Appl. No. 14/322,736, 9 pages.Applicant
- Non-Final Office Action of Jan. 5, 2016 for U.S. Appl. No. 14/245,400, 33 pages.Applicant
- Notice of Allowance of Jan. 7, 2016 for U.S. Appl. No. 14/313,511, 5 pages.Applicant
- First Action Interview Pilot Program Pre-Interview Communication of Jan. 12, 2016 for U.S. Appl. No. 14/753,496, 3 pages.Applicant
- Notice of Allowance of Jan. 20, 2016 for U.S. Appl. No. 13/829,708, 11 pages.Applicant
- Non-Final Office Action of May 12, 2016 for U.S. Appl. No. 13/961,072, 12 pages.Applicant
- Non-Final Office Acton of May 23, 2016 for U.S. Appl. No. 12/608,117, 35 pages.Applicant
- Final Office Action of Jun. 9, 2016 for U.S. Appl. No. 14/543,397, 18 pages.Applicant
- Final Office Action of Jun. 17, 2016 for U.S. Appl. No. 14/570,963, 18 pages.Applicant
- Notice of Allowance of Jun. 23, 2016 for U.S. Appl. No. 13/830,719; 26 pages.Applicant
- Final Office Action of Jun. 28, 2016 for U.S. Appl. No. 14/500,502, 10 pages.Applicant
- Final Office Action of Jul. 12, 2016 for U.S. Appl. No. 14/245,400, 36 pages.Applicant
- First Action Interview Pilot Program Pre-Interview Communication of Jul. 14, 2016 for U.S. Appl. No. 14/970,225, 5 pages.Applicant