Task flow identification based on user intent

Information

  • Patent Grant
  • 11423886
  • Patent Number
    11,423,886
  • Date Filed
    Wednesday, May 20, 2020
    4 years ago
  • Date Issued
    Tuesday, August 23, 2022
    a year ago
Abstract
The intelligent automated assistant system engages with the user in an integrated, conversational manner using natural language dialog, and invokes external services when appropriate to obtain information or perform various actions. The system can be implemented using any of a number of different platforms, such as the web, email, smartphone, and the like, or any combination thereof. In one embodiment, the system is based on sets of interrelated domains and tasks, and employs additional functionally powered by external services with which the system can interact.
Description
FIELD OF THE INVENTION

The present invention relates to intelligent systems, and more specifically for classes of applications for intelligent automated assistants.


BACKGROUND OF THE INVENTION

Today's electronic devices are able to access a large, growing, and diverse quantity of functions, services, and information, both via the Internet and from other sources. Functionality for such devices is increasing rapidly, as many consumer devices, smartphones, tablet computers, and the like, are able to run software applications to perform various tasks and provide different types of information. Often, each application, function, website, or feature has its own user interface and its own operational paradigms, many of which can be burdensome to learn or overwhelming for users. In addition, many users may have difficulty even discovering what functionality and/or information is available on their electronic devices or on various websites; thus, such users may become frustrated or overwhelmed, or may simply be unable to use the resources available to them in an effective manner.


In particular, novice users, or individuals who are impaired or disabled in some manner, and/or are elderly, busy, distracted, and/or operating a vehicle may have difficulty interfacing with their electronic devices effectively, and/or engaging online services effectively. Such users are particularly likely to have difficulty with the large number of diverse and inconsistent functions, applications, and websites that may be available for their use.


Accordingly, existing systems are often difficult to use and to navigate, and often present users with inconsistent and overwhelming interfaces that often prevent the users from making effective use of the technology.


SUMMARY

According to various embodiments of the present invention, an intelligent automated assistant is implemented on an electronic device, to facilitate user interaction with a device, and to help the user more effectively engage with local and/or remote services. In various embodiments, the intelligent automated assistant engages with the user in an integrated, conversational manner using natural language dialog, and invokes external services when appropriate to obtain information or perform various actions.


According to various embodiments of the present invention, the intelligent automated assistant integrates a variety of capabilities provided by different software components (e.g., for supporting natural language recognition and dialog, multimodal input, personal information management, task flow management, orchestrating distributed services, and the like). Furthermore, to offer intelligent interfaces and useful functionality to users, the intelligent automated assistant of the present invention may, in at least some embodiments, coordinate these components and services. The conversation interface, and the ability to obtain information and perform follow-on task, are implemented, in at least some embodiments, by coordinating various components such as language components, dialog components, task management components, information management components and/or a plurality of external services.


According to various embodiments of the present invention, intelligent automated assistant systems may be configured, designed, and/or operable to provide various different types of operations, functionalities, and/or features, and/or to combine a plurality of features, operations, and applications of an electronic device on which it is installed. In some embodiments, the intelligent automated assistant systems of the present invention can perform any or all of: actively eliciting input from a user, interpreting user intent, disambiguating among competing interpretations, requesting and receiving clarifying information as needed, and performing (or initiating) actions based on the discerned intent. Actions can be performed, for example, by activating and/or interfacing with any applications or services that may be available on an electronic device, as well as services that are available over an electronic network such as the Internet. In various embodiments, such activation of external services can be performed via APIs or by any other suitable mechanism. In this manner, the intelligent automated assistant systems of various embodiments of the present invention can unify, simplify, and improve the user's experience with respect to many different applications and functions of an electronic device, and with respect to services that may be available over the Internet. The user can thereby be relieved of the burden of learning what functionality may be available on the device and on web-connected services, how to interface with such services to get what he or she wants, and how to interpret the output received from such services; rather, the assistant of the present invention can act as a go-between between the user and such diverse services.


In addition, in various embodiments, the assistant of the present invention provides a conversational interface that the user may find more intuitive and less burdensome than conventional graphical user interfaces. The user can engage in a form of conversational dialog with the assistant using any of a number of available input and output mechanisms, such as for example speech, graphical user interfaces (buttons and links), text entry, and the like. The system can be implemented using any of a number of different platforms, such as device APIs, the web, email, and the like, or any combination thereof. Requests for additional input can be presented to the user in the context of such a conversation. Short and long term memory can be engaged so that user input can be interpreted in proper context given previous events and communications within a given session, as well as historical and profile information about the user.


In addition, in various embodiments, context information derived from user interaction with a feature, operation, or application on a device can be used to streamline the operation of other features, operations, or applications on the device or on other devices. For example, the intelligent automated assistant can use the context of a phone call (such as the person called) to streamline the initiation of a text message (for example to determine that the text message should be sent to the same person, without the user having to explicitly specify the recipient of the text message). The intelligent automated assistant of the present invention can thereby interpret instructions such as “send him a text message”, wherein the “him” is interpreted according to context information derived from a current phone call, and/or from any feature, operation, or application on the device. In various embodiments, the intelligent automated assistant takes into account various types of available context data to determine which address book contact to use, which contact data to use, which telephone number to use for the contact, and the like, so that the user need not re-specify such information manually.


In various embodiments, the assistant can also take into account external events and respond accordingly, for example, to initiate action, initiate communication with the user, provide alerts, and/or modify previously initiated action in view of the external events. If input is required from the user, a conversational interface can again be used.


In one embodiment, the system is based on sets of interrelated domains and tasks, and employs additional functionally powered by external services with which the system can interact. In various embodiments, these external services include web-enabled services, as well as functionality related to the hardware device itself. For example, in an embodiment where the intelligent automated assistant is implemented on a smartphone, personal digital assistant, tablet computer, or other device, the assistant can control many operations and functions of the device, such as to dial a telephone number, send a text message, set reminders, add events to a calendar, and the like.


In various embodiments, the system of the present invention can be implemented to provide assistance in any of a number of different domains. Examples include:

    • Local Services (including location- and time-specific services such as restaurants, movies, automated teller machines (ATMs), events, and places to meet);
    • Personal and Social Memory Services (including action items, notes, calendar events, shared links, and the like);
    • E-commerce (including online purchases of items such as books, DVDs, music, and the like);
    • Travel Services (including flights, hotels, attractions, and the like).


One skilled in the art will recognize that the above list of domains is merely exemplary. In addition, the system of the present invention can be implemented in any combination of domains.


In various embodiments, the intelligent automated assistant systems disclosed herein may be configured or designed to include functionality for automating the application of data and services available over the Internet to discover, find, choose among, purchase, reserve, or order products and services. In addition to automating the process of using these data and services, at least one intelligent automated assistant system embodiment disclosed herein may also enable the combined use of several sources of data and services at once. For ex-ample, it may combine information about products from several review sites, check prices and availability from multiple distributors, and check their locations and time constraints, and help a user find a personalized solution to their problem. Additionally, at least one intelligent automated assistant system embodiment disclosed herein may be configured or designed to include functionality for automating the use of data and services available over the Internet to discover, investigate, select among, reserve, and otherwise learn about things to do (including but not limited to movies, events, performances, exhibits, shows and at-tractions); places to go (including but not limited to travel destinations, hotels and other places to stay, landmarks and other sites of interest, etc.); places to eat or drink (such as restaurants and bars), times and places to meet others, and any other source of entertainment or social interaction which may be found on the Internet. Additionally, at least one intelligent automated assistant system embodiment disclosed herein may be configured or designed to include functionality for enabling the operation of applications and services via natural language dialog that may be otherwise provided by dedicated applications with graphical user interfaces including search (including location-based search); navigation (maps and directions); database lookup (such as finding businesses or people by name or other properties); getting weather conditions and forecasts, checking the price of market items or status of financial transactions; monitoring traffic or the status of flights; accessing and updating calendars and schedules; managing reminders, alerts, tasks and projects; communicating over email or other messaging platforms; and operating devices locally or remotely (e.g., dialing telephones, controlling light and temperature, controlling home security devices, playing music or video, etc.). Further, at least one intelligent automated assistant system embodiment disclosed herein may be configured or designed to include functionality for identifying, generating, and/or providing personalized recommendations for activities, products, services, source of entertainment, time management, or any other kind of recommendation service that benefits from an interactive dialog in natural language and automated access to data and services.


In various embodiments, the intelligent automated assistant of the present invention can control many features and operations of an electronic device. For example, the intelligent automated assistant can call services that interface with functionality and applications on a device via APIs or by other means, to perform functions and operations that might otherwise be initiated using a conventional user interface on the device. Such functions and operations may include, for example, setting an alarm, making a telephone call, sending a text message or email message, adding a calendar event, and the like. Such functions and operations may be performed as add-on functions in the context of a conversational dialog between a user and the assistant. Such functions and operations can be specified by the user in the context of such a dialog, or they may be automatically performed based on the context of the dialog. One skilled in the art will recognize that the assistant can thereby be used as a control mechanism for initiating and controlling various operations on the electronic device, which may be used as an alternative to conventional mechanisms such as buttons or graphical user interfaces.





BRIEF DESCRIPTION OF THE DRAWINGS

The accompanying drawings illustrate several embodiments of the invention and, together with the description, serve to explain the principles of the invention according to the embodiments. One skilled in the art will recognize that the particular embodiments illustrated in the drawings are merely exemplary, and are not intended to limit the scope of the present invention.



FIG. 1 is a block diagram depicting an example of one embodiment of an intelligent automated assistant system.



FIG. 2 illustrates an example of an interaction between a user and an intelligent automated assistant according to at least one embodiment.



FIG. 3 is a block diagram depicting a computing device suitable for implementing at least a portion of an intelligent automated assistant according to at least one embodiment.



FIG. 4 is a block diagram depicting an architecture for implementing at least a portion of an intelligent automated assistant on a standalone computing system, according to at least one embodiment.



FIG. 5 is a block diagram depicting an architecture for implementing at least a portion of an intelligent automated assistant on a distributed computing network, according to at least one embodiment.



FIG. 6 is a block diagram depicting a system architecture illustrating several different types of clients and modes of operation.



FIG. 7 is a block diagram depicting a client and a server, which communicate with each other to implement the present invention according to one embodiment.



FIG. 8 is a block diagram depicting a fragment of an active ontology ac-cording to one embodiment.



FIG. 9 is a block diagram depicting an example of an alternative embodiment of an intelligent automated assistant system.



FIG. 10 is a flow diagram depicting a method of operation for active input elicitation component(s) according to one embodiment.



FIG. 11 is a flow diagram depicting a method for active typed-input elicitation according to one embodiment.



FIGS. 12 to 21 are screen shots illustrating some portions of some of the procedures for active typed-input elicitation according to one embodiment.



FIG. 22 is a flow diagram depicting a method for active input elicitation for voice or speech input according to one embodiment.



FIG. 23 is a flow diagram depicting a method for active input elicitation for GUI-based input according to one embodiment.



FIG. 24 is a flow diagram depicting a method for active input elicitation at the level of a dialog flow according to one embodiment.



FIG. 25 is a flow diagram depicting a method for active monitoring for relevant events according to one embodiment.



FIG. 26 is a flow diagram depicting a method for multimodal active input elicitation according to one embodiment.



FIG. 27 is a set of screen shots illustrating an example of various types of functions, operations, actions, and/or other features which may be provided by domain models component(s) and services orchestration according to one embodiment.



FIG. 28 is a flow diagram depicting an example of a method for natural language processing according to one embodiment.



FIG. 29 is a screen shot illustrating natural language processing according to one embodiment.



FIGS. 30 and 31 are screen shots illustrating an example of various types of functions, operations, actions, and/or other features which may be provided by dialog flow processor component(s) according to one embodiment.



FIG. 32 is a flow diagram depicting a method of operation for dialog flow processor component(s) according to one embodiment.



FIG. 33 is a flow diagram depicting an automatic call and response procedure, according to one embodiment.



FIG. 34 is a flow diagram depicting an example of task flow for a constrained selection task according to one embodiment.



FIGS. 35 and 36 are screen shots illustrating an example of the operation of constrained selection task according to one embodiment.



FIG. 37 is a flow diagram depicting an example of a procedure for executing a service orchestration procedure according to one embodiment.



FIG. 38 is a flow diagram depicting an example of a service invocation procedure according to one embodiment.



FIG. 39 is a flow diagram depicting an example of a multiphase output procedure according to one embodiment.



FIGS. 40 and 41 are screen shots depicting examples of output processing according to one embodiment.



FIG. 42 is a flow diagram depicting an example of multimodal output processing according to one embodiment.



FIGS. 43A and 43B are screen shots depicting an example of the use of short term personal memory component(s) to maintain dialog context while changing location, according to one embodiment.



FIGS. 44A through 44C are screen shots depicting an example of the use of long term personal memory component(s), according to one embodiment.



FIG. 45 depicts an example of an abstract model for a constrained selection task.



FIG. 46 depicts an example of a dialog flow model to help guide the user through a search process.



FIG. 47 is a flow diagram depicting a method of constrained selection according to one embodiment.





DETAILED DESCRIPTION OF THE EMBODIMENTS

Various techniques will now be described in detail with reference to a few example embodiments thereof as illustrated in the accompanying drawings. In the following description, numerous specific details are set forth in order to provide a thorough understanding of one or more aspects and/or features described or reference herein. It will be apparent, however, to one skilled in the art, that one or more aspects and/or features described or reference herein may be practiced without some or all of these specific details. In other instances, well known process steps and/or structures have not been described in detail in order to not obscure some of the aspects and/or features described or reference herein.


One or more different inventions may be described in the present application. Further, for one or more of the invention(s) described herein, numerous embodiments may be described in this patent application, and are presented for illustrative purposes only. The described embodiments are not intended to be limiting in any sense. One or more of the invention(s) may be widely applicable to numerous embodiments, as is readily apparent from the disclosure. These embodiments are described in sufficient detail to enable those skilled in the art to practice one or more of the invention(s), and it is to be understood that other embodiments may be utilized and that structural, logical, software, electrical and other changes may be made without departing from the scope of the one or more of the invention(s). Accordingly, those skilled in the art will recognize that the one or more of the invention(s) may be practiced with various modifications and alterations. Particular features of one or more of the invention(s) may be described with reference to one or more particular embodiments or figures that form a part of the present disclosure, and in which are shown, by way of illustration, specific embodiments of one or more of the invention(s). It should be understood, however, that such features are not limited to usage in the one or more particular embodiments or figures with reference to which they are described. The present disclosure is neither a literal description of all embodiments of one or more of the invention(s) nor a listing of features of one or more of the invention(s) that must be present in all embodiments.


Headings of sections provided in this patent application and the title of this patent application are for convenience only, and are not to be taken as limiting the disclosure in any way.


Devices that are in communication with each other need not be in continuous communication with each other, unless expressly specified otherwise. In addition, devices that are in communication with each other may communicate directly or indirectly through one or more intermediaries.


A description of an embodiment with several components in communication with each other does not imply that all such components are required. To the contrary, a variety of optional components are described to illustrate the wide variety of possible embodiments of one or more of the invention(s).


Further, although process steps, method steps, algorithms or the like may be described in a sequential order, such processes, methods and algorithms may be configured to work in alternate orders. In other words, any sequence or order of steps that may be described in this patent application does not, in and of itself, indicate a requirement that the steps be performed in that order. The steps of described processes may be performed in any order practical. Further, some steps may be performed simultaneously despite being described or implied as occurring non-simultaneously (e.g., because one step is described after the other step). Moreover, the illustration of a process by its depiction in a drawing does not imply that the illustrated process is exclusive of other variations and modifications thereto, does not imply that the illustrated process or any of its steps are necessary to one or more of the invention(s), and does not imply that the illustrated process is preferred.


When a single device or article is described, it will be readily apparent that more than one device/article (whether or not they cooperate) may be used in place of a single device/article. Similarly, where more than one device or article is described (whether or not they cooperate), it will be readily apparent that a single device/article may be used in place of the more than one device or article.


The functionality and/or the features of a device may be alternatively embodied by one or more other devices that are not explicitly described as having such functionality/features. Thus, other embodiments of one or more of the invention(s) need not include the device itself.


Techniques and mechanisms described or reference herein will sometimes be described in singular form for clarity. However, it should be noted that particular embodiments include multiple iterations of a technique or multiple instantiations of a mechanism unless noted otherwise.


Although described within the context of intelligent automated assistant technology, it may be understood that the various aspects and techniques described herein (such as those associated with active ontologies, for example) may also be deployed and/or applied in other fields of technology involving human and/or computerized interaction with software.


Other aspects relating to intelligent automated assistant technology (e.g., which may be utilized by, provided by, and/or implemented at one or more intelligent automated assistant system embodiments described herein) are disclosed in one or more of the following references:

    • U.S. Provisional Patent Application Ser. No. 61/295,774 for “Intelligent Automated Assistant”, filed Jan. 18, 2010, the disclosure of which is incorporated herein by reference;
    • U.S. patent application Ser. No. 11/518,292 for “Method And Apparatus for Building an Intelligent Automated Assistant”, filed Sep. 8, 2006, the disclosure of which is incorporated herein by reference; and
    • U.S. Provisional Patent Application Ser. No. 61/186,414 for “System and Method for Semantic Auto-Completion”, filed Jun. 12, 2009, the disclosure of which is incorporated herein by reference.


Hardware Architecture

Generally, the intelligent automated assistant techniques disclosed herein may be implemented on hardware or a combination of software and hardware. For example, they may be implemented in an operating system kernel, in a separate user process, in a library package bound into network applications, on a specially constructed machine, or on a network interface card. In a specific embodiment, the techniques disclosed herein may be implemented in software such as an operating system or in an application running on an operating system.


Software/hardware hybrid implementation(s) of at least some of the intelligent automated assistant embodiment(s) disclosed herein may be implemented on a programmable machine selectively activated or reconfigured by a computer program stored in memory. Such network devices may have multiple network interfaces which may be configured or designed to utilize different types of network communication protocols. A general architecture for some of these machines may appear from the descriptions disclosed herein. According to specific embodiments, at least some of the features and/or functionalities of the various intelligent automated assistant embodiments disclosed herein may be implemented on one or more general-purpose network host machines such as an end-user computer system, computer, network server or server system, mobile computing device (e.g., personal digital assistant, mobile phone, smartphone, laptop, tablet computer, or the like), consumer electronic device, music player, or any other suitable electronic device, router, switch, or the like, or any combination thereof. In at least some embodiments, at least some of the features and/or functionalities of the various intelligent automated assistant embodiments disclosed herein may be implemented in one or more virtualized computing environments (e.g., network computing clouds, or the like).


Referring now to FIG. 3, there is shown a block diagram depicting a computing device 60 suitable for implementing at least a portion of the intelligent automated assistant features and/or functionalities disclosed herein. Computing device 60 may be, for example, an end-user computer system, network server or server system, mobile computing device (e.g., personal digital assistant, mobile phone, smartphone, laptop, tablet computer, or the like), consumer electronic device, music player, or any other suitable electronic device, or any combination or portion thereof. Computing device 60 may be adapted to communicate with other computing devices, such as clients and/or servers, over a communications network such as the Internet, using known protocols for such communication, whether wireless or wired.


In one embodiment, computing device 60 includes central processing unit (CPU) 62, interfaces 68, and a bus 67 (such as a peripheral component inter-connect (PCI) bus). When acting under the control of appropriate software or firmware, CPU 62 may be responsible for implementing specific functions associated with the functions of a specifically configured computing device or machine. For example, in at least one embodiment, a user's personal digital assistant (PDA) may be configured or designed to function as an intelligent automated assistant system utilizing CPU 62, memory 61, 65, and interface(s) 68. In at least one embodiment, the CPU 62 may be caused to perform one or more of the different types of intelligent automated assistant functions and/or operations under the control of software modules/components, which for example, may include an operating system and any appropriate applications software, drivers, and the like.


CPU 62 may include one or more processor(s) 63 such as, for example, a processor from the Motorola or Intel family of microprocessors or the MIPS family of microprocessors. In some embodiments, processor(s) 63 may include specially designed hardware (e.g., application-specific integrated circuits (ASICs), electrically erasable programmable read-only memories (EEPROMs), field-programmable gate arrays (FPGAs), and the like) for controlling the operations of computing device 60. In a specific embodiment, a memory 61 (such as non-volatile random access memory (RAM) and/or read-only memory (ROM)) also forms part of CPU 62. However, there are many different ways in which memory may be coupled to the system. Memory block 61 may be used for a variety of purposes such as, for example, caching and/or storing data, programming instructions, and the like.


As used herein, the term “processor” is not limited merely to those integrated circuits referred to in the art as a processor, but broadly refers to a microcontroller, a microcomputer, a programmable logic controller, an application-specific integrated circuit, and any other programmable circuit.


In one embodiment, interfaces 68 are provided as interface cards (sometimes referred to as “line cards”). Generally, they control the sending and receiving of data packets over a computing network and sometimes support other peripherals used with computing device 60. Among the interfaces that may be provided are Ethernet interfaces, frame relay interfaces, cable interfaces, DSL interfaces, token ring interfaces, and the like. In addition, various types of interfaces may be provided such as, for example, universal serial bus (USB), Serial, Ethernet, Firewire, PCI, parallel, radio frequency (RF), Bluetooth™, near-field communications (e.g., using near-field magnetics), 802.11 (WiFi), frame relay, TCP/IP, ISDN, fast Ethernet interfaces, Gigabit Ethernet interfaces, asynchronous transfer mode (ATM) interfaces, high-speed serial interface (HSSI) interfaces, Point of Sale (POS) interfaces, fiber data distributed interfaces (FDDIs), and the like. Generally, such interfaces 68 may include ports appropriate for communication with the appropriate media. In some cases, they may also include an independent processor and, in some instances, volatile and/or nonvolatile memory (e.g., RAM).


Although the system shown in FIG. 3 illustrates one specific architecture for a computing device 60 for implementing the techniques of the invention described herein, it is by no means the only device architecture on which at least a portion of the features and techniques described herein may be implemented. For example, architectures having one or any number of processors 63 can be used, and such processors 63 can be present in a single device or distributed among any number of devices. In one embodiment, a single processor 63 handles communications as well as routing computations. In various embodiments, different types of intelligent automated assistant features and/or functionalities may be implemented in an intelligent automated assistant system which includes a client device (such as a personal digital assistant or smartphone running client software) and server system(s) (such as a server system described in more detail below).


Regardless of network device configuration, the system of the present invention may employ one or more memories or memory modules (such as, for example, memory block 65) configured to store data, program instructions for the general-purpose network operations and/or other information relating to the functionality of the intelligent automated assistant techniques described herein. The program instructions may control the operation of an operating system and/or one or more applications, for example. The memory or memories may also be configured to store data structures, keyword taxonomy information, advertisement information, user click and impression information, and/or other specific non-program information described herein.


Because such information and program instructions may be employed to implement the systems/methods described herein, at least some network device embodiments may include nontransitory machine-readable storage media, which, for example, may be configured or designed to store program instructions, state information, and the like for performing various operations described herein. Examples of such nontransitory machine-readable storage media include, but are not limited to, magnetic media such as hard disks, floppy disks, and magnetic tape; optical media such as CD-ROM disks; magneto-optical media such as floptical disks, and hardware devices that are specially configured to store and perform program instructions, such as read-only memory devices (ROM), flash memory, memristor memory, random access memory (RAM), and the like. Examples of program instructions include both machine code, such as produced by a compiler, and files containing higher level code that may be executed by the computer using an interpreter.


In one embodiment, the system of the present invention is implemented on a standalone computing system. Referring now to FIG. 4, there is shown a block diagram depicting an architecture for implementing at least a portion of an intelligent automated assistant on a standalone computing system, according to at least one embodiment. Computing device 60 includes processor(s) 63 which run software for implementing intelligent automated assistant 1002. Input device 1206 can be of any type suitable for receiving user input, including for example a keyboard, touch screen, microphone (for example, for voice input), mouse, touchpad, trackball, five-way switch, joystick, and/or any combination thereof. Output device 1207 can be a screen, speaker, printer, and/or any combination thereof. Memory 1210 can be random-access memory having a structure and architecture as are known in the art, for use by processor(s) 63 in the course of running software. Storage device 1208 can be any magnetic, optical, and/or electrical storage device for storage of data in digital form; examples include flash memory, magnetic hard drive, CD-ROM, and/or the like.


In another embodiment, the system of the present invention is implemented on a distributed computing network, such as one having any number of clients and/or servers. Referring now to FIG. 5, there is shown a block diagram depicting an architecture for implementing at least a portion of an intelligent automated assistant on a distributed computing network, according to at least one embodiment.


In the arrangement shown in FIG. 5, any number of clients 1304 are provided; each client 1304 may run software for implementing client-side portions of the present invention. In addition, any number of servers 1340 can be provided for handling requests received from clients 1304. Clients 1304 and servers 1340 can communicate with one another via electronic network 1361, such as the Internet. Network 1361 may be implemented using any known net-work protocols, including for example wired and/or wireless protocols.


In addition, in one embodiment, servers 1340 can call external services 1360 when needed to obtain additional information or refer to store data concerning previous interactions with particular users. Communications with external services 1360 can take place, for example, via network 1361. In various embodiments, external services 1360 include web-enabled services and/or functionality related to or installed on the hardware device itself. For example, in an embodiment where assistant 1002 is implemented on a smartphone or other electronic device, assistant 1002 can obtain information stored in a calendar application (“app”), contacts, and/or other sources.


In various embodiments, assistant 1002 can control many features and operations of an electronic device on which it is installed. For example, assistant 1002 can call external services 1360 that interface with functionality and applications on a device via APIs or by other means, to perform functions and operations that might otherwise be initiated using a conventional user interface on the device. Such functions and operations may include, for example, setting an alarm, making a telephone call, sending a text message or email message, adding a calendar event, and the like. Such functions and operations may be performed as add-on functions in the context of a conversational dialog between a user and assistant 1002. Such functions and operations can be specified by the user in the context of such a dialog, or they may be automatically performed based on the context of the dialog. One skilled in the art will recognize that assistant 1002 can thereby be used as a control mechanism for initiating and controlling various operations on the electronic device, which may be used as an alternative to conventional mechanisms such as buttons or graphical user interfaces.


For example, the user may provide input to assistant 1002 such as “I need to wake tomorrow at 8 am.” Once assistant 1002 has determined the user's intent, using the techniques described herein, assistant 1002 can call external services 1340 to interface with an alarm clock function or application on the device. Assistant 1002 sets the alarm on behalf of the user. In this manner, the user can use assistant 1002 as a replacement for conventional mechanisms for setting the alarm or performing other functions on the device. If the user's requests are ambiguous or need further clarification, assistant 1002 can use the various techniques described herein, including active elicitation, paraphrasing, suggestions, and the like, to obtain the needed information so that the correct services 1340 are called and the intended action taken. In one embodiment, assistant 1002 may prompt the user for confirmation before calling a service 1340 to perform a function. In one embodiment, a user can selectively disable assistant's 1002 ability to call particular services 1340, or can disable all such service-calling if desired.


The system of the present invention can be implemented with many different types of clients 1304 and modes of operation. Referring now to FIG. 6, there is shown a block diagram depicting a system architecture illustrating several different types of clients 1304 and modes of operation. One skilled in the art will recognize that the various types of clients 1304 and modes of operation shown in FIG. 6 are merely exemplary, and that the system of the present invention can be implemented using clients 1304 and/or modes of operation other than those depicted. Additionally, the system can include any or all of such clients 1304 and/or modes of operation, alone or in any combination. Depicted examples include:

    • Computer devices with input/output devices and/or sensors 1402. A client component may be deployed on any such computer device 1402. At least one embodiment may be implemented using a web browser 1304A or other software application for enabling communication with servers 1340 via network 1361. Input and output channels may of any type, including for example visual and/or auditory channels. For example, in one embodiment, the system of the invention can be implemented using voice-based communication methods, allowing for an embodiment of the assistant for the blind whose equivalent of a web browser is driven by speech and uses speech for output.
    • Mobile Devices with I/O and sensors 1406, for which the client may be implemented as an application on the mobile device 1304B. This includes, but is not limited to, mobile phones, smartphones, personal digital assistants, tablet devices, networked game consoles, and the like.
    • Consumer Appliances with I/O and sensors 1410, for which the client may be implemented as an embedded application on the appliance 1304C.
    • Automobiles and other vehicles with dashboard interfaces and sensors 1414, for which the client may be implemented as an embedded system application 1304 D. This includes, but is not limited to, car navigation systems, voice control systems, in-car entertainment systems, and the like.
    • Networked computing devices such as routers 1418 or any other device that resides on or interfaces with a network, for which the client may be implemented as a device-resident application 1304E.
    • Email clients 1424, for which an embodiment of the assistant is connected via an Email Modality Server 1426. Email Modality server 1426 acts as a communication bridge, for example taking input from the user as email messages sent to the assistant and sending output from the assistant to the user as replies.
    • Instant messaging clients 1428, for which an embodiment of the assistant is connected via a Messaging Modality Server 1430. Messaging Modality server 1430 acts as a communication bridge, taking input from the user as messages sent to the assistant and sending output from the assistant to the user as messages in reply.
    • Voice telephones 1432, for which an embodiment of the assistant is connected via a Voice over Internet Protocol (VoIP) Modality Server 1430. VoIP Modality server 1430 acts as a communication bridge, taking input from the user as voice spoken to the assistant and sending output from the assistant to the user, for example as synthesized speech, in reply.


For messaging platforms including but not limited to email, instant messaging, discussion forums, group chat sessions, live help or customer support sessions and the like, assistant 1002 may act as a participant in the conversations. Assistant 1002 may monitor the conversation and reply to individuals or the group using one or more the techniques and methods described herein for one-to-one interactions.


In various embodiments, functionality for implementing the techniques of the present invention can be distributed among any number of client and/or server components. For example, various software modules can be implemented for performing various functions in connection with the present invention, and such modules can be variously implemented to run on server and/or client components. Referring now to FIG. 7, there is shown an example of a client 1304 and a server 1340, which communicate with each other to implement the present invention according to one embodiment. FIG. 7 depicts one possible arrangement by which software modules can be distributed among client 1304 and server 1340. One skilled in the art will recognize that the depicted arrangement is merely exemplary, and that such modules can be distributed in many different ways. In addition, any number of clients 1304 and/or servers 1340 can be provided, and the modules can be distributed among these clients 1304 and/or servers 1340 in any of a number of different ways.


In the example of FIG. 7, input elicitation functionality and output processing functionality are distributed among client 1304 and server 1340, with client part of input elicitation 1094a and client part of output processing 1092a located at client 1304, and server part of input elicitation 1094b and server part of output processing 1092b located at server 1340. The following components are located at server 1340:

    • complete vocabulary 1058b;
    • complete library of language pattern recognizers 1060b;
    • master version of short term personal memory 1052b;
    • master version of long term personal memory 1054b.


In one embodiment, client 1304 maintains subsets and/or portions of these components locally, to improve responsiveness and reduce dependence on network communications. Such subsets and/or portions can be maintained and updated according to well known cache management techniques. Such subsets and/or portions include, for example:

    • subset of vocabulary 1058a;
    • subset of library of language pattern recognizers 1060a;
    • cache of short term personal memory 1052a;
    • cache of long term personal memory 1054a.


Additional components may be implemented as part of server 1340, including for example:

    • language interpreter 1070;
    • dialog flow processor 1080;
    • output processor 1090;
    • domain entity databases 1072;
    • task flow models 1086;
    • services orchestration 1082;
    • service capability models 1088.


Each of these components will be described in more detail below. Server 1340 obtains additional information by interfacing with external services 1360 when needed.


Conceptual Architecture

Referring now to FIG. 1, there is shown a simplified block diagram of a specific example embodiment of an intelligent automated assistant 1002. As described in greater detail herein, different embodiments of intelligent automated assistant systems may be configured, designed, and/or operable to provide various different types of operations, functionalities, and/or features generally relating to intelligent automated assistant technology. Further, as described in greater detail herein, many of the various operations, functionalities, and/or features of the intelligent automated assistant system(s) disclosed herein may provide may enable or provide different types of advantages and/or benefits to different entities interacting with the intelligent automated assistant system(s). The embodiment shown in FIG. 1 may be implemented using any of the hardware architectures described above, or using a different type of hardware architecture.


For example, according to different embodiments, at least some intelligent automated assistant system(s) may be configured, designed, and/or operable to provide various different types of operations, functionalities, and/or features, such as, for example, one or more of the following (or combinations thereof):

    • automate the application of data and services available over the Internet to discover, find, choose among, purchase, reserve, or order products and services. In addition to automating the process of using these data and services, intelligent automated assistant 1002 may also enable the combined use of several sources of data and services at once. For example, it may combine information about products from several review sites, check prices and availability from multiple distributors, and check their locations and time constraints, and help a user find a personalized solution to their problem.
    • automate the use of data and services available over the Internet to discover, investigate, select among, reserve, and otherwise learn about things to do (including but not limited to movies, events, performances, exhibits, shows and attractions); places to go (including but not limited to travel destinations, hotels and other places to stay, landmarks and other sites of interest, and the like); places to eat or drink (such as restaurants and bars), times and places to meet others, and any other source of entertainment or social interaction which may be found on the Internet.
    • enable the operation of applications and services via natural language dialog that are otherwise provided by dedicated applications with graphical user interfaces including search (including location-based search); navigation (maps and directions); database lookup (such as finding businesses or people by name or other properties); getting weather conditions and forecasts, checking the price of market items or status of financial transactions; monitoring traffic or the status of flights; accessing and updating calendars and schedules; managing reminders, alerts, tasks and projects; communicating over email or other messaging platforms; and operating devices locally or remotely (e.g., dialing telephones, controlling light and temperature, controlling home security devices, playing music or video, and the like). In one embodiment, assistant 1002 can be used to initiate, operate, and control many functions and apps available on the device.
    • offer personal recommendations for activities, products, services, source of entertainment, time management, or any other kind of recommendation service that benefits from an interactive dialog in natural language and automated access to data and services.


According to different embodiments, at least a portion of the various types of functions, operations, actions, and/or other features provided by intelligent automated assistant 1002 may be implemented at one or more client systems(s), at one or more server systems (s), and/or combinations thereof.


According to different embodiments, at least a portion of the various types of functions, operations, actions, and/or other features provided by assistant 1002 may implement by at least one embodiment of an automated call and response procedure, such as that illustrated and described, for example, with respect to FIG. 33.


Additionally, various embodiments of assistant 1002 described herein may include or provide a number of different advantages and/or benefits over currently existing intelligent automated assistant technology such as, for example, one or more of the following (or combinations thereof):

    • The integration of speech-to-text and natural language understanding technology that is constrained by a set of explicit models of domains, tasks, services, and dialogs. Unlike assistant technology that attempts to implement a general-purpose artificial intelligence system, the embodiments described herein may apply the multiple sources of constraints to reduce the number of solutions to a more tractable size. This results in fewer ambiguous interpretations of language, fewer relevant domains or tasks, and fewer ways to operationalize the intent in services. The focus on specific domains, tasks, and dialogs also makes it feasible to achieve coverage over domains and tasks with human-managed vocabulary and mappings from intent to services parameters.
    • The ability to solve user problems by invoking services on their behalf over the Internet, using APIs. Unlike search engines which only return links and content, some embodiments of automated assistants 1002 described herein may automate research and problem-solving activities. The ability to invoke multiple services for a given request also provides broader functionality to the user than is achieved by visiting a single site, for instance to produce a product or service or find something to do.
    • The application of personal information and personal interaction history in the interpretation and execution of user requests. Unlike conventional search engines or question answering services, the embodiments described herein use information from personal interaction history (e.g., dialog history, previous selections from results, and the like), personal physical context (e.g., user's location and time), and personal information gathered in the context of interaction (e.g., name, email addresses, physical addresses, phone numbers, account numbers, preferences, and the like). Using these sources of information enables, for example,
      • better interpretation of user input (e.g., using personal history and physical context when interpreting language);
      • more personalized results (e.g., that bias toward preferences or recent selections);
      • improved efficiency for the user (e.g., by automating steps involving the signing up to services or filling out forms).
    • The use of dialog history in interpreting the natural language of user inputs. Because the embodiments may keep personal history and apply natural language understanding on user inputs, they may also use dialog context such as current location, time, domain, task step, and task parameters to interpret the new inputs. Conventional search engines and command processors interpret at least one query independent of a dialog history. The ability to use dialog history may make a more natural interaction possible, one which resembles normal human conversation.
    • Active input elicitation, in which assistant 1002 actively guides and constrains the input from the user, based on the same models and information used to interpret their input. For example, assistant 1002 may apply dialog models to suggest next steps in a dialog with the user in which they are refining a request; offer completions to partially typed input based on domain and context specific possibilities; or use semantic interpretation to select from among ambiguous interpretations of speech as text or text as intent.
    • The explicit modeling and dynamic management of services, with dynamic and robust services orchestration. The architecture of embodiments described enables assistant 1002 to interface with many external services, dynamically determine which services may provide information for a specific user request, map parameters of the user request to different service APIs, call multiple services at once, integrate results from multiple services, fail over gracefully on failed services, and/or efficiently maintain the implementation of services as their APIs and capabilities evolve.
    • The use of active ontologies as a method and apparatus for building assistants 1002, which simplifies the software engineering and data maintenance of automated assistant systems. Active ontologies are an integration of data modeling and execution environments for assistants. They provide a framework to tie together the various sources of models and data (domain concepts, task flows, vocabulary, language pattern recognizers, dialog context, user personal information, and mappings from domain and task requests to external services. Active ontologies and the other architectural innovations described herein make it practical to build deep functionality within domains, unifying multiple sources of information and services, and to do this across a set of domains.


In at least one embodiment, intelligent automated assistant 1002 may be operable to utilize and/or generate various different types of data and/or other types of information when performing specific tasks and/or operations. This may include, for example, input data/information and/or output data/information. For example, in at least one embodiment, intelligent automated assistant 1002 may be operable to access, process, and/or otherwise utilize information from one or more different types of sources, such as, for example, one or more local and/or remote memories, devices and/or systems. Additionally, in at least one embodiment, intelligent automated assistant 1002 may be operable to generate one or more different types of output data/information, which, for example, may be stored in memory of one or more local and/or remote devices and/or systems.


Examples of different types of input data/information which may be accessed and/or utilized by intelligent automated assistant 1002 may include, but are not limited to, one or more of the following (or combinations thereof):

    • Voice input: from mobile devices such as mobile telephones and tablets, computers with microphones, Bluetooth headsets, automobile voice control systems, over the telephone system, recordings on answering services, audio voicemail on integrated messaging services, consumer applications with voice input such as clock radios, telephone station, home entertainment control systems, and game consoles.
    • Text input from keyboards on computers or mobile devices, keypads on remote controls or other consumer electronics devices, email messages sent to the assistant, instant messages or similar short messages sent to the assistant, text received from players in multiuser game environments, and text streamed in message feeds.
    • Location information coming from sensors or location-based systems. Examples include Global Positioning System (GPS) and Assisted GPS (A-GPS) on mobile phones. In one embodiment, location information is combined with explicit user input. In one embodiment, the system of the present invention is able to detect when a user is at home, based on known address information and current location determination. In this manner, certain inferences may be made about the type of information the user might be interested in when at home as opposed to outside the home, as well as the type of services and actions that should be invoked on behalf of the user depending on whether or not he or she is at home.
    • Time information from clocks on client devices. This may include, for example, time from telephones or other client devices indicating the local time and time zone. In addition, time may be used in the context of user requests, such as for instance, to interpret phrases such as “in an hour” and “tonight”.
    • Compass, accelerometer, gyroscope, and/or travel velocity data, as well as other sensor data from mobile or handheld devices or embedded systems such as automobile control systems. This may also include device positioning data from remote controls to appliances and game consoles.
    • Clicking and menu selection and other events from a graphical user interface (GUI) on any device having a GUI. Further examples include touches to a touch screen.
    • Events from sensors and other data-driven triggers, such as alarm clocks, calendar alerts, price change triggers, location triggers, push notification onto a device from servers, and the like.


The input to the embodiments described herein also includes the context of the user interaction history, including dialog and request history.


Examples of different types of output data/information which may be generated by intelligent automated assistant 1002 may include, but are not limited to, one or more of the following (or combinations thereof):

    • Text output sent directly to an output device and/or to the user interface of a device
    • Text and graphics sent to a user over email
    • Text and graphics send to a user over a messaging service
    • Speech output, may include one or more of the following (or combinations thereof):
      • Synthesized speech
      • Sampled speech
      • Recorded messages
    • Graphical layout of information with photos, rich text, videos, sounds, and hyperlinks. For instance, the content rendered in a web browser.
    • Actuator output to control physical actions on a device, such as causing it to turn on or off, make a sound, change color, vibrate, control a light, or the like.
    • Invoking other applications on a device, such as calling a mapping application, voice dialing a telephone, sending an email or instant message, playing media, making entries in calendars, task managers, and note applications, and other applications.
    • Actuator output to control physical actions to devices attached or controlled by a device, such as operating a remote camera, controlling a wheelchair, playing music on remote speakers, playing videos on remote displays, and the like.


It may be appreciated that the intelligent automated assistant 1002 of FIG. 1 is but one example from a wide range of intelligent automated assistant system embodiments which may be implemented. Other embodiments of the intelligent automated assistant system (not shown) may include additional, fewer and/or different components/features than those illustrated, for example, in the example intelligent automated assistant system embodiment of FIG. 1.


User Interaction

Referring now to FIG. 2, there is shown an example of an interaction between a user and at least one embodiment of an intelligent automated assistant 1002. The example of FIG. 2 assumes that a user is speaking to intelligent automated assistant 1002 using input device 1206, which may be a speech input mechanism, and the output is graphical layout to output device 1207, which may be a scrollable screen. Conversation screen 101 A features a conversational user interface showing what the user said 1018 (“I'd like a romantic place for Italian food near my office”) and assistant's 1002 response, which is a summary of its findings 101C (“OK, I found these Italian restaurants which reviews say are romantic close to your work:”) and a set of results 101 D (the first three of a list of restaurants are shown). In this example, the user clicks on the first result in the list, and the result automatically opens up to reveal more information about the restaurant, shown in information screen 101E. Information screen 101E and conversation screen 101A may appear on the same output device, such as a touch-screen or other display device; the examples depicted in FIG. 2 are two different output states for the same output device.


In one embodiment, information screen 101E shows information gathered and combined from a variety of services, including for example, any or all of the following:

    • Addresses and geolocations of businesses;
    • Distance from user's current location;
    • Reviews from a plurality of sources;


In one embodiment, information screen 101E also includes some examples of services that assistant 1002 might offer on behalf of the user, including:

    • Dial a telephone to call the business (“call”);
    • Remember this restaurant for future reference (“save”);
    • Send an email to someone with the directions and information about this restaurant (“share”);
    • Show the location of and directions to this restaurant on a map (“map it”);
    • Save personal notes about this restaurant (“my notes”).


As shown in the example of FIG. 2, in one embodiment, assistant 1002 includes intelligence beyond simple database applications, such as, for example,

    • Processing a statement of intent in a natural language 101B, not just keywords;
    • Inferring semantic intent from that language input, such as interpreting “place for Italian food” as “Italian restaurants”;
    • Operationalizing semantic intent into a strategy for using online services and executing that strategy on behalf of the user (e.g., operationalizing the desire for a romantic place into the strategy of checking on-line review sites for reviews that describe a place as “romantic”).


Intelligent Automated Assistant Components

According to various embodiments, intelligent automated assistant 1002 may include a plurality of different types of components, devices, modules, processes, systems, and the like, which, for example, may be implemented and/or instantiated via the use of hardware and/or combinations of hardware and software. For example, as illustrated in the example embodiment of FIG. 1, assistant 1002 may include one or more of the following types of systems, components, devices, processes, and the like (or combinations thereof):

    • One or more active ontologies 1050;
    • Active input elicitation component(s) 1094 (may include client part 1094a and server part 1094b);
    • Short term personal memory component(s) 1052 (may include master version 1052b and cache 1052a);
    • Long-term personal memory component(s) 1054 (may include master version 1052b and cache 1052a);
    • Domain models component(s) 1056;
    • Vocabulary component(s) 1058 (may include complete vocabulary 1058b and subset 1058a);
    • Language pattern recognizer(s) component(s) 1060 (may include full library 1060b and subset 1560a);
    • Language interpreter component(s) 1070;
    • Domain entity database(s) 1072;
    • Dialog flow processor component(s) 1080;
    • Services orchestration component(s) 1082;
    • Services component(s) 1084;
    • Task flow models component(s) 1086;
    • Dialog flow models component(s) 1087;
    • Service models component(s) 1088;
    • Output processor component(s) 1090.


As described in connection with FIG. 7, in certain client/server-based embodiments, some or all of these components may be distributed between client 1304 and server 1340.


For purposes of illustration, at least a portion of the different types of components of a specific example embodiment of intelligent automated assistant 1002 will now be described in greater detail with reference to the example intelligent automated assistant 1002 embodiment of FIG. 1.


Active Ontologies 1050

Active ontologies 1050 serve as a unifying infrastructure that integrates models, components, and/or data from other parts of embodiments of intelligent automated assistants 1002. In the field of computer and information science, ontologies provide structures for data and knowledge representation such as classes/types, relations, attributes/properties and their instantiation in instances. Ontologies are used, for example, to build models of data and knowledge. In some embodiments of the intelligent automated system 1002, ontologies are part of the modeling framework in which to build models such as domain models.


Within the context of the present invention, an “active ontology” 1050 may also serve as an execution environment, in which distinct processing elements are arranged in an ontology-like manner (e.g., having distinct attributes and relations with other processing elements). These processing elements carry out at least some of the tasks of intelligent automated assistant 1002. Any number of active ontologies 1050 can be provided.


In at least one embodiment, active ontologies 1050 may be operable to perform and/or implement various types of functions, operations, actions, and/or other features such as, for example, one or more of the following (or combinations thereof):

    • Act as a modeling and development environment, integrating models and data from various model and data components, including but not limited to
      • Domain models 1056
      • Vocabulary 1058
      • Domain entity databases 1072
      • Task flow models 1086
      • Dialog flow models 1087
      • Service capability models 1088
    • Act as a data-modeling environment on which ontology-based editing tools may operate to develop new models, data structures, database schemata, and representations.
    • Act as a live execution environment, instantiating values for elements of domain 1056, task 1086, and/or dialog models 1087, language pattern recognizers, and/or vocabulary 1058, and user-specific information such as that found in short term personal memory 1052, long term personal memory 1054, and/or the results of service orchestration 1182. For example, some nodes of an active ontology may correspond to domain concepts such as restaurant and its property restaurant name. During live execution, these active ontology nodes may be instantiated with the identity of a particular restaurant entity and its name, and how its name corresponds to words in a natural language input utterance. Thus, in this embodiment, the active ontology is serving as both a modeling environment specifying the concept that restaurants are entities with identities that have names, and for storing dynamic bindings of those modeling nodes with data from entity databases and parses of natural language.
    • Enable the communication and coordination among components and processing elements of an intelligent automated assistant, such as, for example, one or more of the following (or combinations thereof):
      • Active input elicitation component(s) 1094
      • Language interpreter component(s) 1070
      • Dialog flow processor component(s) 1080
      • Services orchestration component(s) 1082
      • Services component(s) 1084


In one embodiment, at least a portion of the functions, operations, actions, and/or other features of active ontologies 1050 described herein may be implemented, at least in part, using various methods and apparatuses described in U.S. patent application Ser. No. 11/518,292 for “Method and Apparatus for Building an Intelligent Automated Assistant”, filed Sep. 8, 2006.


In at least one embodiment, a given instance of active ontology 1050 may access and/or utilize information from one or more associated databases. In at least one embodiment, at least a portion of the database information may be accessed via communication with one or more local and/or remote memory devices. Examples of different types of data which may be accessed by active ontologies 1050 may include, but are not limited to, one or more of the following (or combinations thereof):

    • Static data that is available from one or more components of intelligent automated assistant 1002;
    • Data that is dynamically instantiated per user session, for example, but not limited to, maintaining the state of the user-specific inputs and outputs exchanged among components of intelligent automated assistant 1002, the contents of short term personal memory, the inferences made from previous states of the user session, and the like.


In this manner, active ontologies 1050 are used to unify elements of various components in intelligent automated assistant 1002. An active ontology 1050 allows an author, designer, or system builder to integrate components so that the elements of one component are identified with elements of other components. The author, designer, or system builder can thus combine and integrate the components more easily.


Referring now to FIG. 8, there is shown an example of a fragment of an active ontology 1050 according to one embodiment. This example is intended to help illustrate some of the various types of functions, operations, actions, and/or other features that may be provided by active ontologies 1050.


Active ontology 1050 in FIG. 8 includes representations of a restaurant and meal event. In this example, a restaurant is a concept 1610 with properties such as its name 1612, cuisines served 1615, and its location 1613, which in turn might be modeled as a structured node with properties for street address 1614. The concept of a meal event might be modeled as a node 1616 including a dining party 1617 (which has a size 1619) and time period 1618.

    • Active ontologies may include and/or make reference to domain models 1056. For example, FIG. 8 depicts a dining out domain model 1622 linked to restaurant concept 1610 and meal event concept 1616. In this instance, active ontology 1050 includes dining out domain model 1622; specifically, at least two nodes of active ontology 1050, namely restaurant 1610 and meal event 1616, are also included in and/or referenced by dining out domain model 1622. This domain model represents, among other things, the idea that dining out involves meal event that occur at restaurants. The active ontology nodes restaurant 1610 and meal event 1616 are also included and/or referenced by other components of the intelligent automated assistant, a shown by dotted lines in FIG. 8.
    • Active ontologies may include and/or make reference to task flow models 1086. For example, FIG. 8 depicts an event planning task flow model 1630, which models the planning of events independent of domains, applied to a domain-specific kind of event: meal event 1616. Here, active ontology 1050 includes general event planning task flow model 1630, which comprises nodes representing events and other concepts involved in planning them. Active ontology 1050 also includes the node meal event 1616, which is a particular kind of event. In this example, meal event 1616 is included or made reference to by both domain model 1622 and task flow model 1630, and both of these models are included in and/or referenced by active ontology 1050. Again, meal event 1616 is an example of how active ontologies can unify elements of various components included and/or referenced by other components of the intelligent automated assistant, a shown by dotted lines in FIG. 8.
    • Active ontologies may include and/or make reference to dialog flow models 1087. For example, FIG. 8 depicts a dialog flow model 1642 for getting the values of constraints required for a transaction instantiated on the constraint party size as represented in concept 1619. Again, active ontology 1050 provides a framework for relating and unifying various components such as dialog flow models 1087. In this case, dialog flow model 1642 has a general concept of a constraint that is instantiated in this particular example to the active ontology node party size 1619. This particular dialog flow model 1642 operates at the abstraction of constraints, independent of domain. Active ontology 1050 represents party size property 1619 of party node 1617, which is related to meal event node 1616. In such an embodiment, intelligent automated assistant 1002 uses active ontology 1050 to unify the concept of constraint in dialog flow model 1642 with the property of party size 1619 as part of a cluster of nodes representing meal event concept 1616, which is part of the domain model 1622 for dining out.
    • Active ontologies may include and/or make reference to service models 1088. For example, FIG. 8 depicts a model of a restaurant reservation service 1672 associated with the dialog flow step for getting values required for that service to perform a transaction. In this instance, service model 1672 for a restaurant reservation service specifies that a reservation requires a value for party size 1619 (the number of people sitting at a table to reserve). The concept party size 1619, which is part of active ontology 1050, also is linked or related to a general dialog flow model 1642 for asking the user about the constraints for a transaction; in this instance, the party size is a required constraint for dialog flow model 1642.
    • Active ontologies may include and/or make reference to domain entity databases 1072. For example, FIG. 8 depicts a domain entity database of restaurants 1652 associated with restaurant node 1610 in active ontology 1050. Active ontology 1050 represents the general concept of restaurant 1610, as may be used by the various components of intelligent automated assistant 1002, and it is instantiated by data about specific restaurants in restaurant database 1652.
    • Active ontologies may include and/or make reference to vocabulary databases 1058. For example, FIG. 8 depicts a vocabulary database of cuisines 1662, such as Italian, French, and the like, and the words associated with each cuisine such as “French”, “continental”, “provincial”, and the like. Active ontology 1050 includes restaurant node 1610, which is related to cuisines served node 1615, which is associated with the representation of cuisines in cuisines database 1662. A specific entry in database 1662 for a cuisine, such as “French”, is thus related through active ontology 1050 as an instance of the concept of cuisines served 1615.
    • Active ontologies may include and/or make reference to any database that can be mapped to concepts or other representations in ontology 1050. Domain entity databases 1072 and vocabulary databases 1058 are merely two examples of how active ontology 1050 may integrate databases with each other and with other components of automated assistant 1002. Active ontologies allow the author, designer, or system builder to specify a nontrivial mapping between representations in the database and representations in ontology 1050. For example, the database schema for restaurants database 1652 may represent a restaurant as a table of strings and numbers, or as a projection from a larger database of business, or any other representation suitable for database 1652. In this example active ontology 1050, restaurant 1610 is a concept node with properties and relations, organized differently from the database tables. In this example, nodes of ontology 1050 are associated with elements of database schemata. The integration of database and ontology 1050 provides a unified representation for interpreting and acting on specific data entries in databases in terms of the larger sets of models and data in active ontology 1050. For instance, the word “French” may be an entry in cuisines database 1662. Because, in this example, database 1662 is integrated in active ontology 1050, that same word “French” also has an interpretation as a possible cuisine served at a restaurant, which is involved in planning meal events, and this cuisine serves as a constraint to use when using restaurants reservation services, and so forth. Active ontologies can thus integrate databases into the modeling and execution environment to inter-operate with other components of automated assistant 1002.


As described above, active ontology 1050 allows the author, designer, or system builder to integrate components; thus, in the example of FIG. 8, the elements of a component such as constraint in dialog flow model 1642 can be identified with elements of other components such as required parameter of restaurant reservation service 1672.


Active ontologies 1050 may be embodied as, for example, configurations of models, databases, and components in which the relationships among models, databases, and components are any of:

    • containership and/or inclusion;
    • relationship with links and/or pointers;
    • interface over APis, both internal to a program and between programs.


For example, referring now to FIG. 9, there is shown an example of an alternative embodiment of intelligent automated assistant system 1002, wherein domain models 1056, vocabulary 1058, language pattern recognizers 1060, short term personal memory 1052, and long term personal memory 1054 components are organized under a common container associated with active ontology 1050, and other components such as active input elicitation component(s) 1094, language interpreter 1070 and dialog flow processor 1080 are associated with active ontology 1050 via API relationships.


Active Input Elicitation Component(s) 1094

In at least one embodiment, active input elicitation component(s) 1094 (which, as described above, may be implemented in a stand-alone configuration or in a configuration including both server and client components) may be operable to perform and/or implement various types of functions, operations, actions, and/or other features such as, for example, one or more of the following (or combinations thereof):

    • Elicit, facilitate and/or process input from the user or the user's environment, and/or information about their need(s) or request(s). For example, if the user is looking to find a restaurant, the input elicitation module may get information about the user's constraints or preferences for location, time, cuisine, price, and so forth.
    • Facilitate different kinds of input from various sources, such as for example, one or more of the following (or combinations thereof):
      • input from keyboards or any other input device that generates text
      • input from keyboards in user interfaces that offer dynamic suggested completions of partial input
      • input from voice or speech input systems
      • input from Graphical User Interfaces (GUUs) in which users click, select, or otherwise directly manipulate graphical objects to indicate choices
      • input from other applications that generate text and send it to the automated assistant, including email, text messaging, or other text communication platforms


By performing active input elicitation, assistant 1002 is able to disambiguate intent at an early phase of input processing. For example, in an embodiment where input is provided by speech, the waveform might be sent to a server 1340 where words are extracted, and semantic interpretation performed. The results of such semantic interpretation can then be used to drive active input elicitation, which may offer the user alternative candidate words to choose among based on their degree of semantic fit as well as phonetic match.


In at least one embodiment, active input elicitation component(s) 1094 actively, automatically, and dynamically guide the user toward inputs that may be acted upon by one or more of the services offered by embodiments of assistant 1002. Referring now to FIG. 10, there is shown a flow diagram depicting a method of operation for active input elicitation component(s) 1094 according to one embodiment.


The procedure begins 20. In step 21, assistant 1002 may offer interfaces on one or more input channels. For example, a user interface may offer the user options to speak or type or tap at any stage of a conversational interaction. In step 22, the user selects an input channel by initiating input on one modality, such as pressing a button to start recording speech or to bring up an interface for typing.


In at least one embodiment, assistant 1002 offers default suggestions for the selected modality 23. That is, it offers options 24 that are relevant in the current context prior to the user entering any input on that modality. For example, in a text input modality, assistant 1002 might offer a list of common words that would begin textual requests or commands such as, for example, one or more of the following (or combinations thereof): imperative verbs (e.g., find, buy, reserve, get, call, check, schedule, and the like), nouns (e.g., restaurants, movies, events, businesses, and the like), or menu-like options naming domains of discourse (e.g., weather, sports, news, and the like).


If the user selects one of the default options in 25, and a preference to autosubmit 30 is set, the procedure may return immediately. This is similar to the operation of a conventional menu selection.


However, the initial option may be taken as a partial input, or the user may have started to enter a partial input 26. At any point of input, in at least one embodiment, the user may choose to indicate that the partial input is complete 22, which causes the procedure to return.


In 28, the latest input, whether selected or entered, is added to the cumulative input.


In 29, the system suggestions next possible inputs that are relevant given the current input and other sources of constraints on what constitutes relevant and/or meaningful input.


In at least one embodiment, the sources of constraints on user input (for example, which are used in steps 23 and 29) are one or more of the various models and data sources that may be included in assistant 1002, which may include, but are not limited to, one or more of the following (or combinations thereof):

    • Vocabulary 1058. For example, words or phrases that match the current input may be suggested. In at least one embodiment, vocabulary may be associated with any or one or more nodes of active ontologies, domain models, task models, dialog models, and/or service models.
    • Domain models 1056, which may constrain the inputs that may instantiate or otherwise be consistent with the domain model. For example, in at least one embodiment, domain models 1056 may be used to suggest concepts, relations, properties, and/or instances that would be consistent with the current input.
    • Language pattern recognizers 1060, which may be used to recognize idioms, phrases, grammatical constructs, or other patterns in the current input and be used to suggest completions that fill out the pattern.
    • Domain entity databases 1072, which may be used to suggest possible entities in the domain that match the input (e.g., business names, movie names, event names, and the like).
    • Short term memory 1052, which may be used to match any prior input or portion of prior input, and/or any other property or fact about the history of interaction with a user. For example, partial input may be matched against cities that the user has encountered in a session, whether hypothetically (e.g., mentioned in queries) and/or physically (e.g., as determined from location sensors).
    • In at least one embodiment, semantic paraphrases of recent inputs, request, or results may be matched against the current input. For example, if the user had previously request “live music” and obtained concert listing, and then typed “music” in an active input elicitation environment, suggestions may include “live music” and/or “concerts”.
    • Long term personal memory 1054, which may be used to suggest matching items from long term memory. Such matching items may include, for example, one or more or any combination of: domain entities that are saved (e.g., “favorite” restaurants, movies, theaters, venues, and the like), to-do items, list items, calendar entries, people names in contacts/address books, street or city names mentioned in contact/address books, and the like.
    • Task flow models 1086, which may be used to suggest inputs based on the next possible steps of in a task flow.
    • Dialog flow models 1087, which may be used to suggest inputs based on the next possible steps of in a dialog flow.
    • Service capability models 1088, which may be used to suggest possible services to employ, by name, category, capability, or any other property in the model. For example, a user may type part of the name of a preferred review site, and assistant 1002 may suggest a complete command for querying that review site for review.


In at least one embodiment, active input elicitation component(s) 1094 present to the user a conversational interface, for example, an interface in which the user and assistant communicate by making utterances back and forth in a conversational manner. Active input elicitation component(s) 1094 may be operable to perform and/or implement various types of conversational interfaces.


In at least one embodiment, active input elicitation component(s) 1094 may be operable to perform and/or implement various types of conversational interfaces in which assistant 1002 uses plies of the conversation to prompt for information from the user according to dialog models. Dialog models may represent a procedure for executing a dialog, such as, for example, a series of steps required to elicit the information needed to perform a service.


In at least one embodiment, active input elicitation component(s) 1094 offer constraints and guidance to the user in real time, while the user is in the midst of typing, speaking, or otherwise creating input. For example, active elicitation may guide the user to type text inputs that are recognizable by an embodiment of assistant 1002 and/or that may be serviced by one or more services offered by embodiments of assistant 1002. This is an advantage over passively waiting for unconstrained input from a user because it enables the user's efforts to be focused on inputs that may or might be useful, and/or it enables embodiments of assistant 1002 to apply its interpretations of the input in real time as the user is inputting it.


At least a portion of the functions, operations, actions, and/or other features of active input elicitation described herein may be implemented, at least in part, using various methods and apparatuses described in U.S. patent application Ser. No. 11/518,292 for “Method and Apparatus for Building an Intelligent Automated Assistant”, filed Sep. 8, 2006.


According to specific embodiments, multiple instances or threads of active input elicitation component(s) 1094 may be concurrently implemented and/or initiated via the use of one or more processors 63 and/or other combinations of hardware and/or hardware and software.


According to different embodiments, one or more different threads or instances of active input elicitation component(s) 1094 may be initiated in response to detection of one or more conditions or events satisfying one or more different types of minimum threshold criteria for triggering initiation of at least one instance of active input elicitation component(s) 1094. Various examples of conditions or events which may trigger initiation and/or implementation of one or more different threads or instances of active input elicitation component(s) 1094 may include, but are not limited to, one or more of the following (or combinations thereof):

    • Start of user session. For example, when the user session starts up an application that is an embodiment of assistant 1002, the interface may offer the opportunity for the user to initiate input, for example, by pressing a button to initiate a speech input system or clicking on a text field to initiate a text input session.
    • User input detected.
    • When assistant 1002 explicitly prompts the user for input, as when it requests a response to a question or offers a menu of next steps from which to choose.
    • When assistant 1002 is helping the user perform a transaction and is gathering data for that transaction, e.g., filling in a form.


In at least one embodiment, a given instance of active input elicitation component(s) 1094 may access and/or utilize information from one or more associated databases. In at least one embodiment, at least a portion of the database information may be accessed via communication with one or more local and/or remote memory devices. Examples of different types of data which may be accessed by active input elicitation component(s) 1094 may include, but are not limited to, one or more of the following (or combinations thereof):

    • database of possible words to use in a textual input;
    • grammar of possible phrases to use in a textual input utterance;
    • database of possible interpretations of speech input;
    • database of previous inputs from a user or from other users;
    • data from any of the various models and data sources that may be part of embodiments of assistant 1002, which may include, but are not limited to, one or more of the following (or combinations thereof):
    • Domain models 1056;
    • Vocabulary 1058;
    • Language pattern recognizers 1060;
    • Domain entity databases 1072;
    • Short term memory 1052;
    • Long term personal memory 1054;
    • Task flow models 1086;
    • Dialog flow models 1087;
    • Service capability models 1088.


According to different embodiments, active input elicitation component(s) 1094 may apply active elicitation procedures to, for example, one or more of the following (or combinations thereof):

    • typed input;
    • speech input;
    • input from graphical user interfaces (GUIs), including gestures;
    • input from suggestions offered in a dialog; and
    • events from the computational and/or sensed environments.


Active Typed Input Elicitation

Referring now to FIG. 11, there is shown a flow diagram depicting a method for active typed input elicitation according to one embodiment.


The method begins 110. Assistant 1002 receives 111 partial text input, for example via input device 1206. Partial text input may include, for example, the characters that have been typed so far in a text input field. At any time, a user may indicate that the typed input is complete 112, as, for example, by pressing an Enter key. If not complete, a suggestion generator generates 114 candidate suggestions 116. These suggestions may be syntactic, semantic, and/or other kinds of suggestion based any of the sources of information or constraints described herein. If the suggestion is selected 118, the input is transformed 117 to include the selected suggestion.


In at least one embodiment, the suggestions may include extensions to the current input. For example, a suggestion for “rest” may be “restaurants.”


In at least one embodiment, the suggestions may include replacements of parts of the current input. For example, a suggestion for “rest” may be “places to eat”.


In at least one embodiment, the suggestions may include replacing and rephrasing of parts of the current input. For example, if the current input is “find restaurants of style” a suggestion may be “italian” and when the suggestion is chosen, the entire input may be rewritten as “find Italian restaurants”.


In at least one embodiment, the resulting input that is returned is annotated 119, so that information about which choices were made in 118 is preserved along with the textual input. This enables, for example, the semantic concepts or entities underlying a string to be associated with the string when it is returned, which improves accuracy of subsequent language interpretation.


Referring now to FIGS. 12 to 21, there are shown screen shots illustrating some portions of some of the procedures for active typed-input elicitation according to one embodiment. The screen shots depict an example of an embodiment of assistant 1002 as implemented on a smartphone such as the iPhone available from Apple Inc. of Cupertino, Calif. Input is provided to such device via a touch screen, including on-screen keyboard functionality. One skilled in the art will recognize that the screen shots depict an embodiment that is merely exemplary, and that the techniques of the present invention can be implemented on other devices and using other layouts and arrangements.


In FIG. 12, screen 1201 includes a top-level set of suggestions 1202 shown when no input has been provided in field 1203. This corresponds to no-input step 23 of FIG. 10 applied to step 114 of FIG. 11 where there is no input.


In FIG. 13, screen 1301 depicts an example of the use of vocabulary to offer suggested completions 1303 of partial user input 1305 entered in field 1203 using on-screen keyboard 1304. These suggested completions 1303 may be part of the function of active input elicitation 1094. The user has entered partial user input 1305 including the string “comm.” Vocabulary component 1058 has provided a mapping of this string into three different kinds of instances, which are listed as suggested completions 1303: the phrase “community & local events” is a category of the events domain; “chambers of commerce” is a category of the local business search domain, and “Jewish Community Center” is the name of an instance of local businesses. Vocabulary component 1058 may provide the data lookup and management of name spaces like these. The user can tap Go button 1306 to indicate that he or she has finished entering input; this causes assistant 1002 to proceed with the completed text string as a unit of user input.


In FIG. 14, screen 1401 depicts an example in which suggested semantic completions 1303 for a partial string “wh” 1305 include entire phrases with typed parameters. These kinds of suggestions may be enabled by the use of one or more of the various models and sources of input constraints described herein. For example, in one embodiment shown in FIG. 14, “what is happening in city” is an active elicitation of the location parameter of the Local Events domain; “where is business name” is an active elicitation of the Business Name constraint of the Local Business Search domain; “what is showing at the venue name” is an active elicitation of the Venue Name constraint of the Local Events domain; and “what is playing at the movie theater” is an active elicitation of the Movie Theater Name constraint of the Local Events domain. These examples illustrate that the suggested completions are generated by models rather than simply drawn from a database of previously entered queries.


In FIG. 15, screen 1501 depicts a continuation of the same example, after the user has entered additional text 1305 in field 1203. Suggested completions 1303 are updated to match the additional text 1305. In this example, data from a domain entity database 1072 were used: venues whose name starts with “f.” Note that this is a significantly smaller and more semantically relevant set of suggestions than all words that begin with “f.” Again, the suggestions are generated by applying a model, in this case the domain model that represents Local Events as happening at Venues, which are Businesses with Names. The suggestions actively elicit inputs that would make potentially meaningful entries when using a Local Events service.


In FIG. 16, screen 1601 depicts a continuation of the same example, after the user has selected one of suggested completions 1303. Active elicitation continues by prompting the user to further specify the type of information desired, here by presenting a number of specifiers 1602 from which the user can select. In this example, these specifiers are generated by the domain, task flow, and dialog flow models. The Domain is Local Events, which includes Categories of events that happen on Dates in Locations and have Event Names and Feature Performers. In this embodiment, the fact that these five options are offered to the user is generated from the Dialog Flow model that indicates that users should be asked for Constraints that they have not yet entered and from the Service Model that indicates that these five Constraints are parameters to Local Event services available to the assistant. Even the choice of preferred phrases to use as specifiers, such as “by category” and “featured”, are generated from the Domain Vocabulary databases.


In FIG. 17, screen 1701 depicts a continuation of the same example, after the user has selected one of specifiers 1602.


In FIG. 18, screen 1801 depicts a continuation of the same example, wherein the selected specifier 1602 has been added to field 1203, and additional specifiers 1602 are presented. The user can select one of specifiers 1602 and/or provide additional text input via keyboard 1304.


In FIG. 19, screen 1901 depicts a continuation of the same example, wherein the selected specifier 1602 has been added to field 1203, and yet more specifiers 1602 are presented. In this example, previously entered constraints are not actively elicited redundantly.


In FIG. 20, screen 2001 depicts a continuation of the same example, wherein the user has tapped the Go button 1306. The user's input is shown in box 2002, and a message is shown in box 2003, providing feedback to the user as to the query being performed in response to the user's input.


In FIG. 21, screen 2101 depicts a continuation of the same example, wherein results have been found. Message is shown in box 2102. Results 2103, including input elements allowing the user to view further details, save the identified event, buy tickets, add notes, or the like.


In one screen 2101, and other displayed screens, are scrollable, allowing the user to scroll upwards to see screen 2001 or other previously presented screens, and to make changes to the query if desired.


Active Speech Input Elicitation

Referring now to FIG. 22, there is shown a flow diagram depicting a method for active input elicitation for voice or speech input according to one embodiment.


The method begins 221. Assistant 1002 receives 121 voice or speech input in the form of an auditory signal. A speech-to-text service 122 or processor generates a set of candidate text interpretations 124 of the auditory signal. In one embodiment, speech-to-text service 122 is implemented using, for example, Nuance Recognizer, available from Nuance Communications, Inc. of Burlington, Mass.


In one embodiment, assistant 1002 employs statistical language models to generate candidate text interpretations 124 of speech input 121.


In addition, in one embodiment, the statistical language models are tuned to look for words, names, and phrases that occur in the various models of assistant 1002 shown in FIG. 8. For example, in at least one embodiment the statistical language models are given words, names, and phrases from some or all of: domain models 1056 (e.g., words and phrases relating to restaurant and meal events), task flow models 1086 (e.g., words and phrases relating to planning an event), dialog flow models 1087 (e.g., words and phrases related to the constraints that are needed to gather the inputs for a restaurant reservation), domain entity databases 1072 (e.g., names of restaurants), vocabulary databases 1058 (e.g., names of cuisines), service models 1088 (e.g., names of service provides such as OpenTable), and/or any words, names, or phrases associated with any node of active ontology 1050.


In one embodiment, the statistical language models are also tuned to look for words, names, and phrases from long-term personal memory 1054. For example, statistical language models can be given text from to-do items, list items, personal notes, calendar entries, people names in contacts/address books, email addresses, street or city names mentioned in contact/address books, and the like.


A ranking component analyzes the candidate interpretations 124 and ranks 126 them according to how well they fit syntactic and/or semantic models of intelligent automated assistant 1002. Any sources of constraints on user input may be used. For example, in one embodiment, assistant 1002 may rank the output of the speech-to-text interpreter according to how well the interpretations parse in a syntactic and/or semantic sense, a domain model, task flow model, and/or dialog model, and/or the like: it evaluates how well various combinations of words in the text interpretations 124 would fit the concepts, relations, entities, and properties of active ontology 1050 and its associated models. For example, if speech-to-text service 122 generates the two candidate interpretations “italian food for lunch” and “italian shoes for lunch”, the ranking by semantic relevance 126 might rank “italian food for lunch” higher if it better matches the nodes assistant's 1002 active ontology 1050 (e.g., the words “italian”, “food” and “lunch” all match nodes in ontology 1050 and they are all connected by relationships in ontology 1050, whereas the word “shoes” does not match ontology 1050 or matches a node that is not part of the dining out domain network).


In various embodiments, algorithms or procedures used by assistant 1002 for interpretation of text inputs, including any embodiment of the natural language processing procedure shown in FIG. 28, can be used to rank and score candidate text interpretations 124 generated by speech-to-text service 122.


In one embodiment, if ranking component 126 determines 128 that the highest-ranking speech interpretation from interpretations 124 ranks above a specified threshold, The highest-ranking interpretation may be automatically selected 130. If no interpretation ranks above a specified threshold, possible candidate interpretations of speech 134 are presented 132 to the user. The user can then select 136 among the displayed choices.


In various embodiments, user selection 136 among the displayed choices can be achieved by any mode of input, including for example any of the modes of multimodal input described in connection with FIG. 16. Such input modes include, without limitation, actively elicited typed input 2610, actively elicited speech input 2620, actively presented GUI for input 2640, and/or the like. In one embodiment, the user can select among candidate interpretations 134, for example by tapping or speaking. In the case of speaking, the possible interpretation of the new speech input is highly constrained by the small set of choices offered 134. For example, if offered “Did you mean italian food or italian shoes?” the user can just say “food” and the assistant can match this to the phrase “italian food” and not get it confused with other global interpretations of the input.


Whether input is automatically selected 130 or selected 136 by the user, the resulting input 138 is returned. In at least one embodiment, the returned input is annotated 138, so that information about which choices were made in step 136 is preserved along with the textual input. This enables, for example, the semantic concepts or entities underlying a string to be associated with the string when it is returned, which improves accuracy of subsequent language interpretation. For example, if “Italian food” was offered as one of the candidate interpretations 134 based on a semantic interpretation of Cuisine=ItalianFood, then the machine-readable semantic interpretation can be sent along with the user's selection of the string “Italian food” as annotated text input 138.


In at least one embodiment, candidate text interpretations 124 are generated based on speech interpretations received as output of speech-to-text service 122.


In at least one embodiment, candidate text interpretations 124 are generated by paraphrasing speech interpretations in terms of their semantic meaning. In some embodiments, there can be multiple paraphrases of the same speech interpretation, offering different word sense or homonym alternatives. For example, if speech-to-text service 122 indicates “place for meet”, the candidate interpretations presented to the user could be paraphrased as “place to meet (local businesses)” and “place for meat (restaurants)”.


In at least one embodiment, candidate text interpretations 124 include offers to correct substrings.


In at least one embodiment, candidate text interpretations 124 include offers to correct substrings of candidate interpretations using syntactic and semantic analysis as described herein.


In at least one embodiment, when the user selects a candidate interpretation, it is returned.


In at least one embodiment, the user is offered an interface to edit the interpretation before it is returned.


In at least one embodiment, the user is offered an interface to continue with more voice input before input is returned. This enables one to incrementally build up an input utterance, getting syntactic and semantic connections, suggestions, and guidance at one iteration.


In at least one embodiment, the user is offered an interface to proceed directly from 136 to step 111 of a method of active typed input elicitation (described above in connection with FIG. 11). This enables one to interleave typed and spoken input, getting syntactic and semantic corrections, suggestions, and guidance at one step.


In at least one embodiment, the user is offered an interface to proceed directly from step 111 of an embodiment of active typed input elicitation to an embodiment of active speech input elicitation. This enables one to interleave typed and spoken input, getting syntactic and semantic corrections, suggestions, and guidance at one step.


Active GUI-Based Input Elicitation

Referring now to FIG. 23, there is shown a flow diagram depicting a method for active input elicitation for GUI-based input according to one embodiment.


The method begins 140. Assistant 1002 presents 141 graphical user interface (GUI) on output device 1207, which may include, for example, links and buttons. The user interacts 142 with at least one GUI element. Data 144 is received, and converted 146 to a uniform format. The converted data is then returned.


In at least one embodiment, some of the elements of the GUI are generated dynamically from the models of the active ontology, rather than written into a computer program. For example, assistant 1002 can offer a set of constraints to guide a restaurant reservation service as regions for tapping on a screen, with each region representing the name of the constraint and/or a value. For instance, the screen could have rows of a dynamically generated GUI layout with regions for the constraints Cuisine, Location, and Price Range. If the models of the active ontology change, the GUI screen would automatically change without reprogramming.


Active Dialog Suggestion Input Elicitation


FIG. 24 is a flow diagram depicting a method for active input elicitation at the level of a dialog flow according to one embodiment. Assistant 1002 suggests 151 possible responses 152. The user selects 154 a suggested response. The received input is converted 154 to a uniform format. The converted data is then returned.


In at least one embodiment, the suggestions offered in step 151 are offered as follow-up steps in a dialog and/or task flow.


In at least one embodiment, the suggestions offer options to refine a query, for example using parameters from a domain and/or task model. For example, one may be offered to change the assumed location or time of a request.


In at least one embodiment, the suggestions offer options to choose among ambiguous alternative interpretations given by a language interpretation procedure or component.


In at least one embodiment, the suggestions offer options to choose among ambiguous alternative interpretations given by a language interpretation procedure or component.


In at least one embodiment, the suggestions offer options to choose among next steps in a workflow associated dialog flow model 1087. For example, dialog flow model 1087 may suggest that after gathering the constrained for one domain (e.g., restaurant dining), assistant 1002 should suggest other related domains (e.g., a movie nearby).


Active Monitoring for Relevant Events

In at least one embodiment, asynchronous events may be treated as inputs in an analogous manner to the other modalities of active elicited input. Thus, such events may be provided as inputs to assistant 1002. Once interpreted, such events can be treated in a manner similar to any other input.


For example, a flight status change may initiate an alert notification to be sent to a user. If a flight is indicated as being late, assistant 1002 may continue the dialog by presenting alternative flights, making other suggestions, and the like, based on the detected event.


Such events can be of any type. For example, assistant 1002 might detect that the user just got home, or is lost (off a specified route), or that a stock price hit a threshold value, or that a television show the user is interested in is starting, or that a musician of interest is touring in the area. In any of these situations, assistant 1002 can proceed with a dialog in substantially the same manner as if the user had him- or herself initiated the inquiry. In one embodiment, events can even be based on data provided from other devices, for example to tell the user when a coworker has returned from lunch (the coworker's device can signal such an event to the user's device, at which time assistant 1002 installed on the user's device responds accordingly).


In one embodiment, the events can be notifications or alerts from a calendar, clock, reminder, or to-do application. For example, an alert from a calendar application about a dinner date can initiate a dialog with assistant 1002 about the dining event. The dialog can proceed as if the user had just spoken or typed the information about the upcoming dinner event, such as “dinner for 2 in San Francisco”.


In one embodiment, the context of possible event trigger 162 can include information about people, places, times, and other data. These data can be used as part of the input to assistant 1002 to use in various steps of processing.


In one embodiment, these data from the context of event trigger 162 can be used to disambiguate speech or text inputs from the user. For example, if a calendar event alert includes the name of a person invited to the event, that information can help disambiguate input which might match several people with the same or similar name.


Referring now to FIG. 25, there is shown a flow diagram depicting a method for active monitoring for relevant events according to one embodiment. In this example, event trigger events are sets of input 162. Assistant 1002 monitors 161 for such events. Detected events may be filtered and sorted 164 for semantic relevance using models, data and information available from other components in intelligent automated assistant 1002. For example, an event that reports a change in flight status may be given higher relevance if the short-term or long-term memory records for a user indicate that the user is on that flight and/or have made inquiries about it to assistant 1002. This sorting and filtering may then present only the top events for review by the user, who may then choose to pick one or more and act on them.


Event data is converted 166 to a uniform input format, and returned.


In at least one embodiment, assistant 1002 may proactively offer services associated with events that were suggested for user attention. For example, if a flight status alert indicates a flight may be missed, assistant 1002 may suggest to the user a task flow for replanning the itinerary or booking a hotel.


Input Elicitation Component(s) Example

The following example is intended to help illustrate some of the various types of functions, operations, actions, and/or other features which may be provided by active input elicitation component(s) 1094. Example: Command completion (what can the user say to assistant 1002?)


The user is facing a text input box with the general instruction to enter “what do you want to do?” Depending on the context and the user input, any of several system responses are provided. Examples are shown below














User Input
System Response
Comment















Case: Null input









With an empty field
Find restaurants,
Black text would be


and no dialog context,
hotels, movies, . . .
inserted into the


type a question or
Book a table, a room,
input field. Italicized


space character, or
a seat, . . .
text would be the


enter nothing for
Order food, flowers, . . .
follow-up suggestions


some period of time.
Buy a ticket, a book,
once the text was



a DVD, . . .
inserted.



Schedule a meeting,




an event, . . .




Remember to a thing




to do . . .




Explain results








Case: First word input









With empty dialog

Find restaurants,

Black text would be


context If the user
hotels, movies, . . .
inserted into the


types the first

input would be the


letter of any

follow-up suggestions


command, it is

once the text was


suggested. For

inserted


example











F |







Case: Key word input









With empty dialog

Remember to a thing,

Black text would be


context If the user
to do . . .
inserted into the


types the first two
Find restaurants by
input field. Italicized


letters of any
location, cuisine,
text would be the


keyword, it is

follow-up suggestions


suggested as well

once the text was


as command. For

inserted.


example











F_|







Case: Prompting for arguments









The user has entered
restaurants by location,
Offer not only the


or selected a
cuisine, . . .
selection class but


“command” verb
hotels by location,
advertise the con-


and nothing else. For
availability, . . .
straint options.


example
movies by location,
Note that name of











Find_|
genre, . . .
place is a just a










name of place
prompt, and would




not insert text.







Case: Suggesting criteria









The user has already
in city, zip code
Black text would be


entered enough to
near home, office,
inserted into the


establish a task and
place name
input field. Italicized


domain, and now is
named restaurant
text would be the


prompted for
name
follow-up suggestions


constraints in order.

once the text was


find restaurants_|

inserted.







Case: Adding Criteria









The user has said “in”
in city, zip code
Until they enter the


and now is prompted
Palo Alto, CA
next word, the


for locations
Menlo Park, CA
suggestions are a


Find restaurants in_|

prompt for what kind


The user has said
my home
of thing to type. The


“near” and now
my work
Places are cities from


is prompted for
Palo Alto, CA
personal memory..


locations
Menlo Park, CA
The Places are none


Find restaurants

or more places from


near_|

personal memory







Case: Adding location or other constraints









Find restaurants in
serving food type or
Prompt for other


Palo Alto_|
cuisine
constraints


Find restaurants in
with availability tonight,
The 7:00 and 9:00


Palo Alto with
tomorrow, . . .
are our suggestions


availability_|
described as romantic,
based on current time



good service




tonight




tomorrow




at 7 pm




at 9 pm




other time or date








Case: Starting from constraint, unknown task or domain









romantic_|
restaurants by location,
Constraint value from



cuisine, . . .
ontology tells you



hotels by location,
which selection



availability, . . .
classes to use



movies by location,




genre, . . .



comedy_|
movies by location,
“comedy” is a



genre, . . .
constraint value for



events by location, . . .
genre in movies, a



clubs by location
genre in events, and




“comedy clubs” is a




local directory busi-




ness category









Example: Name Completion

Here, the user has typed some text without accepting any of the commands, or he or she is just extending a command with an entity name. The system may attempt to complete the names, depending on context. It also disambiguates the domain.












Case: words without context









User Input
System Response
Comment










Case: words without context









il for
Il Fornaio (restaurant)
May require entity name




lookup



Ill Forgotten Gains
Notice multi-word completion



(movie)
Show domain as a suggestion.


tom cruise
movies
May require entity name


romantic
movies
lookup



restaurants
Based on ontology only







Case: name with context









Find restaurants i|
Il Fornaio (restaurant)
May require entity name


for

lookup




Uses selection class and




location context from current




and past queries to constrain




completion. Show domain as




a suggestion.


tom cruise
movies
May require entity name




lookup


Find movies rom
romantic
Based on ontology only



Roman Holiday




(movie)



g-rated
movies









Example: Choosing Values from a Set

Here, the user is responding to a system request to enter a value for a specific parameter, such as location, time, cuisine, or genre. The user may either select from a list or enter a value. As she types, matching items from the list are shown as options. Examples are shown below.












Case: valueless selection









User Input
System Response
Comment





Restaurants
burgers
User may type anything else and


serving
Ice cream
doesn't have to pick from the menu



Hot dogs



Restaurants
Hamburgers



serving h
Hot dogs




Hot sauce



Movies playing
today




tonight




Friday night









Example: Reusing Previous Commands

Previous queries are also options to complete on in an autocomplete interface. They may be just matched as strings (when the input field is empty and there are no known constraints) or they may be suggested as relevant when in certain situations.












Case: completion on previous queries









User Input
System Response
Comment





Intel

Italian restaurants

Using string matching



(normal completion)
to retrieve previous



Films starring Italian
queries



actors (recent query)



Lunch
lunch places in marin




(recent query)




buy the book naked lunch









Example: Retrieving Personal Memory Items

Assistant 1002 may remember certain events and/or entities in personal memory associated with the user. Autocomplete can be performed based on such remembered items. Examples appear below.


Case: Completion on Events and Entities in Personal Memory













User Input
System Response
Comment
















Mary
lunch with Mary on Saturday



(from My Events)



film called “Something about Mary


Lunch
lunch with Mary on Saturday



(from My Events)



buy the book naked lunch (from My Todos)


Hob
Hobee's Restaurant in Palo Alto



(from My Restaurants)









Multimodal Active Input Elicitation

In at least one embodiment, active input elicitation component(s) 1094 may process input from a plurality of input modalities. At least one modality might be implemented with an active input elicitation procedure that takes advantages of the particular kinds of inputs and methods for selecting from suggested options. A described herein, they may be embodiments of procedures for active input elicitation for text input, speech input, GUI-based input, input in the context of a dialog, and/or input resulting from event triggers.


In at least one embodiment, for a single instance of intelligent automated assistant 1002, there may be support for one or more (or any combination of) typed input, speech input, GUI input, dialog input, and/or event input.


Referring now to FIG. 26, there is shown a flow diagram depicting a method for multimodal active input elicitation according to one embodiment. The method begins 100. Inputs may be received concurrently from one or more or any combination of the input modalities, in any sequence. Thus, the method includes actively eliciting typed input 2610, speech input 2620, GUI-based input 2640, input in the context of a dialog 2650, and/or input resulting from event triggers 2660. Any or all of these input sources are unified into unified input format 2690 and returned. Unified input format 2690 enables the other components of intelligent automated assistant 1002 to be designed and to operate independently of the particular modality of the input.


Offering active guidance for multiple modalities and levels enables constraint and guidance on the input beyond those available to isolated modalities. For example, the kinds of suggestions offered to choose among speech, text, and dialog steps are independent, so their combination is a significant improvement over adding active elicitation techniques to individual modalities or levels.


Combining multiple sources of constraints as described herein (syntactic/linguistic, vocabulary, entity databases, domain models, task models, service models, and the like) and multiple places where these constraints may be actively applied (speech, text, GUI, dialog, and asynchronous events) provides a new level of functionality for human-machine interaction.


Domain Models Component(s) 1056

Domain models 1056 component(s) include representations of the concepts, entities, relations, properties, and instances of a domain. For example, dining out domain model 1622 might include the concept of a restaurant as a business with a name and an address and phone number, the concept of a meal event with a party size and date and time associated with the restaurant.


In at least one embodiment, domain models component(s) 1056 of assistant 1002 may be operable to perform and/or implement various types of functions, operations, actions, and/or other features such as, for example, one or more of the following (or combinations thereof):

    • Domain model component(s) 1056 may be used by automated assistant 1002 for several processes, including: eliciting input 100, interpreting natural language 200, dispatching to services 400, and generating output 600.
    • Domain model component(s) 1056 may provide lists of words that might match a domain concept or entity, such as names of restaurants, which may be used for active elicitation of input 100 and natural language processing 200.
    • Domain model component(s) 1056 may classify candidate words in processes, for instance, to determine that a word is the name of a restaurant.
    • Domain model component(s) 1056 may show the relationship between partial information for interpreting natural language, for example that cuisine may be associated with business entities (e.g., “local Mexican food” may be interpreted as “find restaurants with style=Mexican”, and this inference is possible because of the information in domain model 1056).
    • Domain model component(s) 1056 may organize information about services used in service orchestration 1082, for example, that a particular web service may provide reviews of restaurants.
    • Domain model component(s) 1056 may provide the information for generating natural language paraphrases and other output formatting, for example, by providing canonical ways of describing concepts, relations, properties and instances.


According to specific embodiments, multiple instances or threads of the domain models component(s) 1056 may be concurrently implemented and/or initiated via the use of one or more processors 63 and/or other combinations of hardware and/or hardware and software. For example, in at least some embodiments, various aspects, features, and/or functionalities of domain models component(s) 1056 may be performed, implemented and/or initiated by one or more of the following types of systems, components, systems, devices, procedures, processes, and the like (or combinations thereof):

    • Domain models component(s) 1056 may be implemented as data structures that represent concepts, relations, properties, and instances. These data structures may be stored in memory, files, or databases.
    • Access to domain model component(s) 1056 may be implemented through direct APIs, network APIs, database query interfaces, and/or the like.
    • Creation and maintenance of domain models component(s) 1056 may be achieved, for example, via direct editing of files, database transactions, and/or through the use of domain model editing tools.
    • Domain models component(s) 1056 may be implemented as part of or in association with active ontologies 1050, which combine models with instantiations of the models for servers and users.


According to various embodiments, one or more different threads or instances of domain models component(s) 1056 may be initiated in response to detection of one or more conditions or events satisfying one or more different types of minimum threshold criteria for triggering initiation of at least one instance of domain models component(s) 1056. For example, trigger initiation and/or implementation of one or more different threads or instances of domain models component(s) 1056 may be triggered when domain model information is required, including during input elicitation, input interpretation, task and domain identification, natural language processing, service orchestration, and/or formatting output for users.


In at least one embodiment, a given instance of domain models component(s) 1056 may access and/or utilize information from one or more associated databases. In at least one embodiment, at least a portion of the database information may be accessed via communication with one or more local and/or remote memory devices. For example, data from domain model component(s) 1056 may be associated with other model modeling components including vocabulary 1058, language pattern recognizers 1060, dialog flow models 1087, task flow models 1086, service capability models 1088, domain entity databases 1072, and the like. For example, businesses in domain entity databases 1072 that are classified as restaurants might be known by type identifiers which are maintained in the dining out domain model components.


Domain Models Component(s) Example

Referring now to FIG. 27, there is shown a set of screen shots illustrating an example of various types of functions, operations, actions, and/or other features which may be provided by domain models component(s) 1056 according to one embodiment.


In at least one embodiment, domain models component(s) 1056 are the unifying data representation that enables the presentation of information shown in screens 103A and 103B about a restaurant, which combines data from several distinct data sources and services and which includes, for example: name, address, business categories, phone number, identifier for saving to long term personal memory, identifier for sharing over email, reviews from multiple sources, map coordinates, personal notes, and the like.


Language Interpreter Component(s) 1070

In at least one embodiment, language interpreter component(s) 1070 of assistant 1002 may be operable to perform and/or implement various types of functions, operations, actions, and/or other features such as, for example, one or more of the following (or combinations thereof):

    • Analyze user input and identify a set of parse results.
      • User input can include any information from the user and his/her device context that can contribute to understanding the user's intent, which can include, for example one or more of the following (or combinations thereof): sequences of words, the identity of gestures or GUI elements involved in eliciting the input, current context of the dialog, current device application and its current data objects, and/or any other personal dynamic data obtained about the user such as location, time, and the like. For example, in one embodiment, user input is in the form of the uniform annotated input format 2690 resulting from active input elicitation 1094.
      • Parse results are associations of data in the user input with concepts, relationships, properties, instances, and/or other nodes and/or data structures in models, databases, and/or other representations of user intent and/context. Parse result associations can be complex mappings from sets and sequences of words, signals, and other elements of user input to one or more associated concepts, relations, properties, instances, other nodes, and/or data structures described herein.
    • Analyze user input and identify a set of syntactic parse results, which are parse results that associate data in the user input with structures that represent syntactic parts of speech, clauses and phrases including multiword names, sentence structure, and/or other grammatical graph structures. Syntactic parse results are described in element 212 of natural language processing procedure described in connection with FIG. 28.
    • Analyze user input and identify a set of semantic parse results, which are parse results that associate data in the user input with structures that represent concepts, relationships, properties, entities, quantities, propositions, and/or other representations of meaning and user intent. In one embodiment, these representations of meaning and intent are represented by sets of and/or elements of and/or instances of models or databases and/or nodes in ontologies, as described in element 220 of natural language processing procedure described in connection with FIG. 28.
    • Disambiguate among alternative syntactic or semantic parse results as described in element 230 of natural language processing procedure described in connection with FIG. 28.
    • Determine whether a partially typed input is syntactically and/or semantically meaningful in an autocomplete procedure such as one described in connection with FIG. 11.
    • Help generate suggested completions 114 in an autocomplete procedure such as one described in connection with FIG. 11.
    • Determine whether interpretations of spoken input are syntactically and/or semantically meaningful in a speech input procedure such as one described in connection with FIG. 22.


According to specific embodiments, multiple instances or threads of language interpreter component(s) 1070 may be concurrently implemented and/or initiated via the use of one or more processors 63 and/or other combinations of hardware and/or hardware and software.


According to different embodiments, one or more different threads or instances of language interpreter component(s) 1070 may be initiated in response to detection of one or more conditions or events satisfying one or more different types of minimum threshold criteria for triggering initiation of at least one instance of language interpreter component(s) 1070. Various examples of conditions or events which may trigger initiation and/or implementation of one or more different threads or instances of language interpreter component(s) 1070 may include, but are not limited to, one or more of the following (or combinations thereof):

    • while eliciting input, including but not limited to
      • Suggesting possible completions of typed input 114 (FIG. 11);
      • Ranking interpretations of speech 126 (FIG. 22);
      • When offering ambiguities as suggested responses in dialog 152 (FIG. 24);
    • when the result of eliciting input is available, including when input is elicited by any mode of active multimodal input elicitation 100.


In at least one embodiment, a given instance of language interpreter component(s) 1070 may access and/or utilize information from one or more associated databases. In at least one embodiment, at least a portion of such data-base information may be accessed via communication with one or more local and/or remote memory devices. Examples of different types of data which may be accessed by the Language Interpreter component(s) may include, but are not limited to, one or more of the following (or combinations thereof):

    • Domain models 1056;
    • Vocabulary 1058;
    • Domain entity databases 1072;
    • Short term memory 1052;
    • Long term personal memory 1054;
    • Task flow models 1086;
    • Dialog flow models 1087;
    • Service capability models 1088.


Referring now also to FIG. 29, there is shown a screen shot illustrating natural language processing according to one embodiment. The user has entered (via voice or text) language input 2902 consisting of the phrase “who is playing this weekend at the fillmore.” This phrase is echoed back to the user on screen 2901. Language interpreter component(s) 1070 component process input 2902 and generates a parse result. The parse result associates that input with a request to show the local events that are scheduled for any of the upcoming weekend days at any event venue whose name matches “fillmore.” A paraphrase of the parse results is shown as 2903 on screen 2901.


Referring now also to FIG. 28, there is shown a flow diagram depicting an example of a method for natural language processing according to one embodiment.


The method begins 200. Language input 202 is received, such as the string “who is playing this weekend at the fillmore” in the example of FIG. 29. In one embodiment, the input is augmented by current context information, such as the current user location and local time. In word/phrase matching 210, language interpreter component(s) 1070 find associations between user input and concepts. In this example, associations are found between the string “playing” and the concept of listings at event venues; the string “this weekend” (along with the current local time of the user) and an instantiation of an approximate time period that represents the upcoming weekend; and the string “fillmore” with the name of a venue. Word/phrase matching 210 may use data from, for example, language pattern recognizers 1060, vocabulary database 1058, active ontology 1050, short term personal memory 1052, and long term personal memory 1054.


Language interpreter component(s) 1070 generate candidate syntactic parses 212 which include the chosen parse result but may also include other parse results. For example, other parse results may include those wherein “playing” is associated with other domains such as games or with a category of event such as sporting events.


Short- and/or long-term memory 1052, 1054 can also be used by language interpreter component(s) 1070 in generating candidate syntactic parses 212. Thus, input that was provided previously in the same session, and/or known information about the user, can be used, to improve performance, reduce ambiguity, and reinforce the conversational nature of the interaction. Data from active ontology 1050, domain models 1056, and task flow models 1086 can also be used, to implement evidential reasoning in determining valid candidate syntactic parses 212.


In semantic matching 220, language interpreter component(s) 1070 consider combinations of possible parse results according to how well they fit semantic models such as domain models and databases. In this case, the parse includes the associations (1) “playing” (a word in the user input) as “Local Event At Venue” (part of a domain model 1056 represented by a cluster of nodes in active ontology 1050) and (2) “fillmore” (another word in the input) as a match to an entity name in a domain entity database 1072 for Local Event Venues, which is represented by a domain model element and active ontology node (Venue Name).


Semantic matching 220 may use data from, for example, active ontology 1050, short term personal memory 1052, and long term personal memory 1054. For example, semantic matching 220 may use data from previous references to venues or local events in the dialog (from short term personal memory 1052) or personal favorite venues (from long term personal memory 1054).


A set of candidate, or potential, semantic parse results is generated 222.


In disambiguation step 230, language interpreter component(s) 1070 weigh the evidential strength of candidate semantic parse results 222. In this example, the combination of the parse of “playing” as “Local Event At Venue” and the match of “fillmore” as a Venme Name is a stronger match to a domain model than alternative combinations where, for instance, “playing” is associated with a domain model for sports but there is no association in the sports domain for “fillmore”.


Disambiguation 230 may use data from, for example, the structure of active ontology 1050. In at least one embodiment, the connections between nodes in an active ontology provide evidential support for disambiguating among candidate semantic parse results 222. For example, in one embodiment, if three active ontology nodes are semantically matched and are all connected in active ontology 1050, this indicates higher evidential strength of the semantic parse than if these matching nodes were not connected or connected by longer paths of connections in active ontology 1050. For example, in one embodiment of semantic matching 220, the parse that matches both local Event At Venue and Venue Name is given increased evidential support because the combined representations of these aspects of the user intent are connected by links and/or relations in active ontology 1050: in this instance, the Local Event node is connected to the Venue node which is connected to the Venue Name node which is connected to the entity name in the database of venue names.


In at least one embodiment, the connections between nodes in an active ontology that provide evidential support for disambiguating among candidate semantic parse results 222 are directed arcs, forming an inference lattice, in which matching nodes provide evidence for nodes to which they are connected by directed arcs.


In 232, language interpreter component(s) 1070 sort and select 232 the top semantic parses as the representation of user intent 290.


Domain Entity Database(s) 1072

In at least one embodiment, domain entity database(s) 1072 may be operable to perform and/or implement various types of functions, operations, actions, and/or other features such as, for example, one or more of the following (or combinations thereof):

    • Store data about domain entities. Domain entities are things in the world or computing environment that may be modeled in domain models. Examples may include, but are not limited to, one or more of the following (or combinations thereof):
      • Businesses of any kind;
      • Movies, videos, songs and/or other musical products, and/or any other named entertainment products;
      • Products of any kind;
      • Events;
      • Calendar entries;
      • Cities, states, countries, neighborhoods, and/or other geographic, geopolitical, and/or geospatial points or regions;
      • Named places such as landmarks, airports, and the like;
    • Provide database services on these databases, including but not limited to simple and complex queries, transactions, triggered events, and the like.


According to specific embodiments, multiple instances or threads of domain entity database(s) 1072 may be concurrently implemented and/or initiated via the use of one or more processors 63 and/or other combinations of hardware and/or hardware and software. For example, in at least some embodiments, various aspects, features, and/or functionalities of domain entity database(s) 1072 may be performed, implemented and/or initiated by database software and/or hardware residing on client(s) 1304 and/or on server(s) 1340.


One example of a domain entity database 1072 that can be used in connection with the present invention according to one embodiment is a database of one or more businesses storing, for example, their names and locations. The database might be used, for example, to look up words contained in an input request for matching businesses and/or to look up the location of a business whose name is known. One skilled in the art will recognize that many other arrangements and implementations are possible.


Vocabulary Component(s) 1058

In at least one embodiment, vocabulary component(s) 1058 may be operable to perform and/or implement various types of functions, operations, actions, and/or other features such as, for example, one or more of the following (or combinations thereof):

    • Provide databases associating words and strings with concepts, properties, relations, or instances of domain models or task models;
    • Vocabulary from vocabulary components may be used by automated assistant 1002 for several processes, including for example: eliciting input, interpreting natural language, and generating output.


According to specific embodiments, multiple instances or threads of vocabulary component(s) 1058 may be concurrently implemented and/or initiated via the use of one or more processors 63 and/or other combinations of hardware and/or hardware and software. For example, in at least some embodiments, various aspects, features, and/or functionalities of vocabulary component(s) 1058 may be implemented as data structures that associate strings with the names of concepts, relations, properties, and instances. These data structures may be stored in memory, files, or databases. Access to vocabulary component(s) 1058 may be implemented through direct APIs, network APIs, and/or database query interfaces. Creation and maintenance of vocabulary component(s) 1058 may be achieved via direct editing of files, database transactions, or through the use of domain model editing tools. Vocabulary component(s) 1058 may be implemented as part of or in association with active ontologies 1050. One skilled in the art will recognize that many other arrangements and implementations are possible.


According to different embodiments, one or more different threads or instances of vocabulary component(s) 1058 may be initiated in response to detection of one or more conditions or events satisfying one or more different types of minimum threshold criteria for triggering initiation of at least one instance of vocabulary component(s) 1058. In one embodiment, vocabulary component(s) 1058 are accessed whenever vocabulary information is required, including, for example, during input elicitation, input interpretation, and formatting output for users. One skilled in the art will recognize that other conditions or events may trigger initiation and/or implementation of one or more different threads or instances of vocabulary component(s) 1058.


In at least one embodiment, a given instance of vocabulary component(s) 1058 may access and/or utilize information from one or more associated databases. In at least one embodiment, at least a portion of the database information may be accessed via communication with one or more local and/or remote memory devices. In one embodiment, vocabulary component(s) 1058 may access data from external databases, for instance, from a data warehouse or dictionary.


Language Pattern Recognizer Component(s) 1060

In at least one embodiment, language pattern recognizer component(s) 1060 may be operable to perform and/or implement various types of functions, operations, actions, and/or other features such as, for example, looking for patterns in language or speech input that indicate grammatical, idiomatic, and/or other composites of input tokens. These patterns correspond to, for example, one or more of the following (or combinations thereof): words, names, phrases, data, parameters, commands, and/or signals of speech acts.


According to specific embodiments, multiple instances or threads of pattern recognizer component(s) 1060 may be concurrently implemented and/or initiated via the use of one or more processors 63 and/or other combinations of hardware and/or hardware and software. For example, in at least some embodiments, various aspects, features, and/or functionalities of language pattern recognizer component(s) 1060 may be performed, implemented and/or initiated by one or more files, databases, and/or programs containing expressions in a pattern matching language. In at least one embodiment, language pattern recognizer component(s) 1060 are represented declaratively, rather than as program code; this enables them to be created and maintained by editors and other tools other than programming tools. Examples of declarative representations may include, but are not limited to, one or more of the following (or combinations thereof): regular expressions, pattern matching rules, natural language grammars, parsers based on state machines and/or other parsing models.


One skilled in the art will recognize that other types of systems, components, systems, devices, procedures, processes, and the like (or combinations thereof) can be used for implementing language pattern recognizer component(s) 1060.


According to different embodiments, one or more different threads or instances of language pattern recognizer component(s) 1060 may be initiated in response to detection of one or more conditions or events satisfying one or more different types of minimum threshold criteria for triggering initiation of at least one instance of language pattern recognizer component(s) 1060. Various examples of conditions or events which may trigger initiation and/or implementation of one or more different threads or instances of language pattern recognizer component(s) 1060 may include, but are not limited to, one or more of the following (or combinations thereof):

    • during active elicitation of input, in which the structure of the language pattern recognizers may constrain and guide the input from the user;
    • during natural language processing, in which the language pattern recognizers help interpret input as language;
    • during the identification of tasks and dialogs, in which the language pattern recognizers may help identify tasks, dialogs, and/or steps therein.


In at least one embodiment, a given instance of language pattern recognizer component(s) 1060 may access and/or utilize information from one or more associated databases. In at least one embodiment, at least a portion of the database information may be accessed via communication with one or more local and/or remote memory devices. Examples of different types of data which may be accessed by language pattern recognizer component(s) 1060 may include, but are not limited to, data from any of the models various models and data sources that may be part of embodiments of assistant 1002, which may include, but are not limited to, one or more of the following (or combinations thereof):

    • Domain models 1056;
    • Vocabulary 1058;
    • Domain entity databases 1072;
    • Short term memory 1052;
    • Long term personal memory 1054;
    • Task flow models 1086;
    • Dialog flow models 1087;
    • Service capability models 1088.


In one embodiment, access of data from other parts of embodiments of assistant 1002 may be coordinated by active ontologies 1050.


Referring again to FIG. 14, there is shown an example of some of the various types of functions, operations, actions, and/or other features which may be provided by language pattern recognizer component(s) 1060. FIG. 14 illustrates language patterns that language pattern recognizer component(s) 1060 may recognize. For example, the idiom “what is happening” (in a city) may be associated with the task of event planning and the domain of local events.


Dialog Flow Processor Component(s) 1080

In at least one embodiment, dialog flow processor component(s) 1080 may be operable to perform and/or implement various types of functions, operations, actions, and/or other features such as, for example, one or more of the following (or combinations thereof):

    • Given a representation of the user intent 290 from language interpretation 200, identify the task a user wants performed and/or a problem the user wants solved. For example, a task might be to find a restaurant.
    • For a given problem or task, given a representation of user intent 290, identify parameters to the task or problem. For example, the user might be looking for a recommended restaurant that serves Italian food near the user's home. The constraints that a restaurant be recommended, serving Italian food, and near home are parameters to the task of finding a restaurant.
    • Given the task interpretation and current dialog with the user, such as that which may be represented in personal short term memory 1052, select an appropriate dialog flow model and determine a step in the flow model corresponding to the current state.


According to specific embodiments, multiple instances or threads of dialog flow processor component(s) 1080 may be concurrently implemented and/or initiated via the use of one or more processors 63 and/or other combinations of hardware and/or hardware and software.


In at least one embodiment, a given instance of dialog flow processor component(s) 1080 may access and/or utilize information from one or more associated databases. In at least one embodiment, at least a portion of the database information may be accessed via communication with one or more local and/or remote memory devices. Examples of different types of data which may be accessed by dialog flow processor component(s) 1080 may include, but are not limited to, one or more of the following (or combinations thereof):

    • task flow models 1086;
    • domain models 1056;
    • dialog flow models 1087.


Referring now to FIGS. 30 and 31, there are shown screen shots illustrating an example of various types of functions, operations, actions, and/or other features which may be provided by dialog flow processor component(s) according to one embodiment.


As shown in screen 3001, user requests a dinner reservation by providing speech or text input “book me a table for dinner.” Assistant 1002 generates a prompt 3003 asking the user to specify time and party size.


Once these parameters have been provided, screen 3101 is shown. Assistant 1002 outputs a dialog box 3102 indicating that results are being presented, and a prompt 3103 asking the user to click a time. Listings 3104 are also displayed.


In one embodiment, such a dialog is implemented as follows. Dialog flow processor component(s) 1080 are given a representation of user intent from language interpreter component 1070 and determine that the appropriate response is to ask the user for information required to perform the next step in a task flow. In this case, the domain is restaurants, the task is getting a reservation, and the dialog step is to ask the user for information required to accomplish the next step in the task flow. This dialog step is exemplified by prompt 3003 of screen 3001.


Referring now also to FIG. 32, there is shown a flow diagram depicting a method of operation for dialog flow processor component(s) 1080 according to one embodiment. The flow diagram of FIG. 32 is described in connection with the example shown in FIGS. 30 and 31.


The method begins 200. Representation of user intent 290 is received. As described in connection with FIG. 28, in one embodiment, representation of user intent 290 is a set of semantic parses. For the example shown in FIGS. 30 and 31, the domain is restaurants, the verb is “book” associated with restaurant reservations, and the time parameter is the evening of the current day.


In 310, dialog flow processor component(s) 1080 determine whether this interpretation of user intent is supported strongly enough to proceed, and/or if it is better supported than alternative ambiguous parses. In the current example, the interpretation is strongly supported, with no competing ambiguous parses. If, on the other hand, there are competing ambiguities or sufficient uncertainty, then step 322 is performed, to set the dialog flow step so that the execution phase causes the dialog to output a prompt for more information from the user.


In 312, the dialog flow processor component(s) 1080 determine the preferred interpretation of the semantic parse with other information to determine the task to perform and its parameters. Information may be obtained, for example, from domain models 1056, task flow models 1086, and/or dialog flow models 1087, or any combination thereof. In the current example, the task is identified as getting a reservation, which involves both finding a place that is reservable and available, and effecting a transaction to reserve a table. Task parameters are the time constraint along with others that are inferred in step 312.


In 320, the task flow model is consulted to determine an appropriate next step. Information may be obtained, for example, from domain models 1056, task flow models 1086, and/or dialog flow models 1087, or any combination thereof. In the example, it is determined that in this task flow the next step is to elicit missing parameters to an availability search for restaurants, resulting in prompt 3003 illustrated in FIG. 30, requesting party size and time for a reservation.


As described above, FIG. 31 depicts screen 3101 is shown including dialog element 3102 that is presented after the user answers the request for the party size and reservation time. In one embodiment, screen 3101 is presented as the result of another iteration through an automated call and response procedure, as described in connection with FIG. 33, which leads to another call to the dialog and flow procedure depicted in FIG. 32. In this instantiation of the dialog and flow procedure, after receiving the user preferences, dialog flow processor component(s) 1080 determines a different task flow step in step 320: to do an availability search. When request 390 is constructed, it includes the task parameters sufficient for dialog flow processor component(s) 1080 and services orchestration component(s) 1082 to dispatch to a restaurant booking service.


Dialog Flow Models Component(s) 1087

In at least one embodiment, dialog flow models component(s) 1087 may be operable to provide dialog flow models, which represent the steps one takes in a particular kind of conversation between a user and intelligent automated assistant 1002. For example, the dialog flow for the generic task of performing a transaction includes steps for getting the necessary data for the transaction and confirming the transaction parameters before committing it.


Task Flow Models Component(s) 1086

In at least one embodiment, task flow models component(s) 1086 may be operable to provide task flow models, which represent the steps one takes to solve a problem or address a need. For example, the task flow for getting a dinner reservation involves finding a desirable restaurant, checking availability, and doing a transaction to get a reservation for a specific time with the restaurant.


According to specific embodiments, multiple instances or threads of task flow models component(s) 1086 may be concurrently implemented and/or initiated via the use of one or more processors 63 and/or other combinations of hardware and/or hardware and software. For example, in at least some embodiments, various aspects, features, and/or functionalities of task flow models component(s) 1086 may be implemented as programs, state machines, or other ways of identifying an appropriate step in a flow graph.


In at least one embodiment, task flow models component(s) 1086 may use a task modeling framework called generic tasks. Generic tasks are abstractions that model the steps in a task and their required inputs and generated outputs, without being specific to domains. For example, a generic task for transactions might include steps for gathering data required for the transaction, executing the transaction, and outputting results of the transaction—all without reference to any particular transaction domain or service for implementing it. It might be instantiated for a domain such as shopping, but it is independent of the shopping domain and might equally well apply to domains of reserving, scheduling, and the like.


At least a portion of the functions, operations, actions, and/or other features associated with task flow models component(s) 1086 and/or procedure(s) described herein may be implemented, at least in part, using concepts, features, components, processes, and/or other aspects disclosed herein in connection with generic task modeling framework.


Additionally, at least a portion of the functions, operations, actions, and/or other features associated with task flow models component(s) 1086 and/or procedure(s) described herein may be implemented, at least in part, using concepts, features, components, processes, and/or other aspects relating to constrained selection tasks, as described herein. For example, one embodiment of generic tasks may be implemented using a constrained selection task model.


In at least one embodiment, a given instance of task flow models component(s) 1086 may access and/or utilize information from one or more associated databases. In at least one embodiment, at least a portion of the database information may be accessed via communication with one or more local and/or remote memory devices. Examples of different types of data which may be accessed by task flow models component(s) 1086 may include, but are not limited to, one or more of the following (or combinations thereof):

    • Domain models 1056;
    • Vocabulary 1058;
    • Domain entity databases 1072;
    • Short term memory 1052;
    • Long term personal memory 1054;
    • Dialog flow models 1087;
    • Service capability models 1088.


Referring now to FIG. 34, there is shown a flow diagram depicting an example of task flow for a constrained selection task 351 according to one embodiment.


Constrained selection is a kind of generic task in which the goal is to select some item from a set of items in the world based on a set of constraints. For example, a constrained selection task 351 may be instantiated for the domain of restaurants. Constrained selection task 351 starts by soliciting criteria and constraints from the user 352. For example, the user might be interested in Asian food and may want a place to eat near his or her office.


In step 353, assistant 1002 presents items that meet the stated criteria and constraints for the user to browse. In this example, it may be a list of restaurants and their properties which may be used to select among them.


In step 354, the user is given an opportunity to refine criteria and constraints. For example, the user might refine the request by saying “near my office.” The system would then present a new set of results in step 353.


Referring now also to FIG. 35, there is shown an example of screen 3501 including list 3502 of items presented by constrained selection task 351 according to one embodiment.


In step 355, the user can select among the matching items. Any of a number of follow-on tasks 359 may then be made available, such as for example book 356, remember 357, or share 358. In various embodiments, follow-on tasks 359 can involve interaction with web-enabled services, and/or with functionality local to the device (such as setting a calendar appointment, making a telephone call, sending an email or text message, setting an alarm, and the like).


In the example of FIG. 35, the user can select an item within list 3502 to see more details and to perform additional actions. Referring now also to FIG. 36, there is shown an example of screen 3601 after the user has selected an item from list 3502. Additional information and options corresponding to follow-on tasks 359 concerning the selected item are displayed.


In various embodiments, the flow steps may be offered to the user in any of several input modalities, including but not limited to any combination of explicit dialog prompts and GUI links.


Services Component(s) 1084

Services component(s) 1084 represent the set of services that intelligent automated assistant 1002 might call on behalf of the user. Any service that can be called may be offered in a services component 1084.


In at least one embodiment, services component(s) 1084 may be operable to perform and/or implement various types of functions, operations, actions, and/or other features such as, for example, one or more of the following (or combinations thereof):

    • Provide the functions over an API that would normally be provided by a web-based user interface to a service. For example, a review website might provide a service API that would return reviews of a given entity automatically when called by a program. The API offers to intelligent automated assistant 1002 the services that a human would otherwise obtain by operating the user interface of the website.
    • Provide the functions over an API that would normally be provided by a user interface to an application. For example, a calendar application might provide a service API that would return calendar entries automatically when called by a program. The API offers to intelligent automated assistant 1002 the services that a human would otherwise obtain by operating the user interface of the application. In one embodiment, assistant 1002 is able to initiate and control any of a number of different functions available on the device. For example, if assistant 1002 is installed on a smartphone, personal digital assistant, tablet computer, or other device, assistant 1002 can perform functions such as: initiate applications, make calls, send emails and/or text messages, add calendar events, set alarms, and the like. In one embodiment, such functions are activated using services component(s) 1084.
    • Provide services that are not currently implemented in a user interface, but that are available through an API to assistant in larger tasks. For example, in one embodiment, an API to take a street address and return machine-readable geocoordinates might be used by assistant 1002 as a service component 1084 even if it has no direct user interface on the web or a device.


According to specific embodiments, multiple instances or threads of services component(s) 1084 may be concurrently implemented and/or initiated via the use of one or more processors 63 and/or other combinations of hardware and/or hardware and software. For example, in at least some embodiments, various aspects, features, and/or functionalities of services component(s) 1084 may be performed, implemented and/or initiated by one or more of the following types of systems, components, systems, devices, procedures, processes, and the like (or combinations thereof):

    • implementation of an API exposed by a service, locally or remotely or any combination;
    • inclusion of a database within automated assistant 1002 or a database service available to assistant 1002.


For example, a website that offers users an interface for browsing movies might be used by an embodiment of intelligent automated assistant 1002 as a copy of the database used by the website. Services component(s) 1084 would then offer an internal API to the data, as if it were provided over a network API, even though the data is kept locally.


As another example, services component(s) 1084 for an intelligent automated assistant 1002 that helps with restaurant selection and meal planning might include any or all of the following set of services which are available from third parties over the network:

    • a set of restaurant listing services which lists restaurants matching name, location, or other constraints;
    • a set of restaurant rating services which return rankings for named restaurants;
    • a set of restaurant reviews services which returns written reviews for named restaurants;
    • a geocoding service to locate restaurants on a map;
    • a reservation service that enables programmatic reservation of tables at restaurants.


Services Orchestration Component(s) 1082

Services orchestration component(s) 1082 of intelligent automated assistant 1002 executes a service orchestration procedure.


In at least one embodiment, services orchestration component(s) 1082 may be operable to perform and/or implement various types of functions, operations, actions, and/or other features such as, for example, one or more of the following (or combinations thereof):

    • Dynamically and automatically determine which services may meet the user's request and/or specified domain(s) and task(s);
    • Dynamically and automatically call multiple services, in any combination of concurrent and sequential ordering;
    • Dynamically and automatically transform task parameters and constraints to meet input requirements of service APIs;
    • Dynamically and automatically monitor for and gather results from multiple services;
    • Dynamically and automatically merge service results data from various services into to a unified result model;
    • Orchestrate a plurality of services to meet the constraints of a request;
    • Orchestrate a plurality of services to annotate an existing result set with auxiliary information;
    • Output the result of calling a plurality of services in a uniform, service independent representation that unifies the results from the various services (for example, as a result of calling several restaurant services that return lists of restaurants, merge the data on at least one restaurant from the several services, removing redundancy).


For example, in some situations, there may be several ways to accomplish a particular task. For example, user input such as “remind me to leave for my meeting across town at 2 pm” specifies an action that can be accomplished in at least three ways: set alarm clock; create a calendar event; or call a to-do manager. In one embodiment, services orchestration component(s) 1082 makes the determination as to which way to best satisfy the request.


Services orchestration component(s) 1082 can also make determinations as to which combination of several services would be best to invoke in order to perform a given overall task. For example, to find and reserve a table for dinner, services orchestration component(s) 1082 would make determinations as to which services to call in order to perform such functions as looking up reviews, getting availability, and making a reservation. Determination of which services to use may depend on any of a number of different factors. For example, in at least one embodiment, information about reliability, ability of service to handle certain types of requests, user feedback, and the like, can be used as factors in determining which service(s) is/are appropriate to invoke.


According to specific embodiments, multiple instances or threads of services orchestration component(s) 1082 may be concurrently implemented and/or initiated via the use of one or more processors and/or other combinations of hardware and/or hardware and software.


In at least one embodiment, a given instance of services orchestration component(s) 1082 may use explicit service capability models 1088 to represent the capabilities and other properties of external services, and reason about these capabilities and properties while achieving the features of services orchestration component(s) 1082. This affords advantages over manually programming a set of services that may include, for example, one or more of the following (or combinations thereof):

    • Ease of development;
    • Robustness and reliability in execution;
    • The ability to dynamically add and remove services without disrupting code;
    • The ability to implement general distributed query optimization algorithms that are driven by the properties and capabilities rather than hard coded to specific services or APIs.


In at least one embodiment, a given instance of services orchestration component(s) 1082 may access and/or utilize information from one or more associated databases. In at least one embodiment, at least a portion of the database information may be accessed via communication with one or more local and/or remote memory devices. Examples of different types of data which may be accessed by services orchestration component(s) 1082 may include, but are not limited to, one or more of the following (or combinations thereof):

    • Instantiations of domain models;
    • Syntactic and semantic parses of natural language input;
    • Instantiations of task models (with values for parameters);
    • Dialog and task flow models and/or selected steps within them;
    • Service capability models 1088;
    • Any other information available in an active ontology 1050.


Referring now to FIG. 37, there is shown an example of a procedure for executing a service orchestration procedure according to one embodiment.


In this particular example, it is assumed a single user is interesting in finding a good place for dinner at a restaurant, and is engaging intelligent automated assistant 1002 in a conversation to help provide this service.


Consider the task of finding restaurants that are of high quality, are well reviewed, near a particular location, available for reservation at a particular time, and serve a particular kind of food. These domain and task parameters are given as input 390.


The method begins 400. At 402, it is determined whether the given request may require any services. In some situations, services delegation may not be required, for example if assistant 1002 is able to perform the desired task itself. For example, in one embodiment, assistant 1002 may be able to answer a factual question without invoking services delegation. Accordingly, if the request does not require services, then standalone flow step is executed in 403 and its result 490 is returned. For example, if the task request was to ask for information about automated assistant 1002 itself, then the dialog response may be handled without invoking any external services.


If, in step 402, it is determined that services delegation is required, services orchestration component(s) 1082 proceed to step 404. In 404, services orchestration component(s) 1082 may match up the task requirements with declarative descriptions of the capabilities and properties of services in service capability models 1088. At least one service provider that might support the instantiated operation provides declarative, qualitative metadata detailing, for example, one or more of the following (or combinations thereof):

    • the data fields that are returned with results;
    • which classes of parameters the service provider is statically known to support;
    • policy functions for parameters the service provider might be able to support after dynamic inspection of the parameter values;
    • a performance rating defining how the service performs (e.g. relational DB, web service, triple store, full-text index, or some combination thereof);
    • property quality ratings statically defining the expected quality of property values returned with the result object;
    • an overall quality rating of the results the service may expect to return.


For example, reasoning about the classes of parameters that service may support, a service model may state that services 1, 2, 3, and 4 may provide restaurants that are near a particular location (a parameter), services 2 and 3 may filter or rank restaurants by quality (another parameter), services 3, 4, and 5 may return reviews for restaurants (a data field returned), service 6 may list the food types served by restaurants (a data field returned), and service 7 may check availability of restaurants for particular time ranges (a parameter). Services 8 through 99 offer capabilities that are not required for this particular domain and task.


Using this declarative, qualitative metadata, the task, the task parameters, and other information available from the runtime environment of the assistant, services orchestration component(s) 1082 determines 404 an optimal set of service providers to invoke. The optimal set of service providers may support one or more task parameters (returning results that satisfy one or more parameters) and also considers the performance rating of at least one service provider and the overall quality rating of at least one service provider.


The result of step 404 is a dynamically generated list of services to call for this particular user and request.


In at least one embodiment, services orchestration component(s) 1082 considers the reliability of services as well as their ability to answer specific information requests.


In at least one embodiment, services orchestration component(s) 1082 hedges against unreliability by calling overlapping or redundant services.


In at least one embodiment, services orchestration component(s) 1082 considers personal information about the user (from the short term personal memory component) to select services. For example, the user may prefer some rating services over others.


In step 450, services orchestration component(s) 1082 dynamically and automatically invokes multiple services on behalf of a user. In at least one embodiment, these are called dynamically while responding to a user's request. According to specific embodiments, multiple instances or threads of the services may be concurrently called. In at least one embodiment, these are called over a network using APIs, or over a network using web service APIs, or over the Internet using web service APIs, or any combination thereof.


In at least one embodiment, the rate at which services are called is programmatically limited and/or managed.


Referring now also to FIG. 38, there is shown an example of a service invocation procedure 450 according to one embodiment. Service invocation is used, for example, to obtain additional information or to perform tasks by the use of external services. In one embodiment, request parameters are transformed as appropriate for the service's API. Once results are received from the service, the results are transformed to a results representation for presentation to the user within assistant 1002.


In at least one embodiment, services invoked by service invocation procedure 450 can be a web service, application running on the device, operating system function, or the like.


Representation of request 390 is provided, including for example task parameters and the like. For at least one service available from service capability models 1088, service invocation procedure 450 performs transformation 452, calling 454, and output-mapping 456 steps.


In transformation step 452, the current task parameters from request representation 390 are transformed into a form that may be used by at least one service. Parameters to services, which may be offered as APIs or databases, may differ from the data representation used in task requests, and also from at least one other. Accordingly, the objective of step 452 is to map at least one task parameter in the one or more corresponding formats and values in at least one service being called.


For example, the names of businesses such as restaurants may vary across services that deal with such businesses. Accordingly, step 452 would involve transforming any names into forms that are best suited for at least one service.


As another example, locations are known at various levels of precision and using various units and conventions across services. Service I might may require ZIP codes, service 2 GPS coordinates, and service 3 postal street addresses.


The service is called 454 over an API and its data gathered. In at least one embodiment, the results are cached. In at least one embodiment, the services that do not return within a specified level performance (e.g., as specified in Service Level Agreement or SLA) are dropped.


In output mapping step 456, the data returned by a service is mapped back onto unified result representation 490. This step may include dealing with different formats, units, and so forth.


In step 412, results from multiple services are validated and merged. In one embodiment, if validated results are collected, an equality policy function—defined on a per-domain basis—is then called pair-wise across one or more results to determine which results represent identical concepts in the real world. When a pair of equal results is discovered, a set of property policy functions—also defined on a per-domain basis—are used to merge property values into a merged result. The property policy function may use the property quality ratings from the service capability models, the task parameters, the domain context, and/or the long-term personal memory 1054 to decide the optimal merging strategy.


For example, lists of restaurants from different providers of restaurants might be merged and duplicates removed. In at least one embodiment, the criteria for identifying duplicates may include fuzzy name matching, fuzzy location matching, fuzzy matching against multiple properties of domain entities, such as name, location, phone number, and/or website address, and/or any combination thereof.


In step 414, the results are sorted and trimmed to return a result list of the desired length.


In at least one embodiment, a request relaxation loop is also applied. If, in step 416, services orchestration component(s) 1082 determines that the current result list is not sufficient (e.g., it has fewer than the desired number of matching items), then task parameters may be relaxed 420 to allow for more results. For example, if the number of restaurants of the desired sort found within N miles of the target location is too small, then relaxation would run the request again, looking in an area larger than N miles away, and/or relaxing some other parameter of the search.


In at least one embodiment, the service orchestration method is applied in a second pass to “annotate” results with auxiliary data that is useful to the task.


In step 418, services orchestration component(s) 1082 determines whether annotation is required. It may be required if, for example, if the task may require a plot of the results on a map, but the primary services did not return geocoordinates required for mapping.


In 422, service capability models 1088 are consulted again to find services that may return the desired extra information. In one embodiment, the annotation process determines if additional or better data may be annotated to a merged result. It does this by delegating to a property policy function—defined on a per-domain basis—for at least one property of at least one merged result. The property policy function may use the merged property value and property quality rating, the property quality ratings of one or more other service providers, the domain context, and/or the user profile to decide if better data may be obtained. If it is determined that one or more service providers may annotate one or more properties for a merged result, a cost function is invoked to determine the optimal set of service providers to annotate.


At least one service provider in the optimal set of annotation service providers is then invoked 450 with the list of merged results, to obtain results 424. The changes made to at least one merged result by at least one service provider are tracked during this process, and the changes are then merged using the same property policy function process as was used in step 412. Their results are merged 426 into the existing result set.


The resulting data is sorted 428 and unified into a uniform representation 490.


It may be appreciated that one advantage of the methods and systems described above with respect to services orchestration component(s) 1082 is that they may be advantageously applied and/or utilized in various fields of technology other than those specifically relating to intelligent automated assistants. Examples of such other areas of technologies where aspects and/or features of service orchestration procedures include, for example, one or more of the following:

    • Dynamic “mash ups” on websites and web-based applications and services;
    • Distributed database query optimization;
    • Dynamic service oriented architecture configuration.


Service Capability Models Component(s) 1088

In at least one embodiment, service capability models component(s) 1088 may be operable to perform and/or implement various types of functions, operations, actions, and/or other features such as, for example, one or more of the following (or combinations thereof):

    • Provide machine readable information about the capabilities of services to perform certain classes of computation;
    • Provide machine readable information about the capabilities of services to answer certain classes of queries;
    • Provide machine readable information about which classes of transactions are provided by various services;
    • Provide machine readable information about the parameters to APIs exposed by various services;
    • Provide machine readable information about the parameters that may be used in database queries on databases provided by various services.


Output Processor Component(s) 1090

In at least one embodiment, output processor component(s) 1090 may be operable to perform and/or implement various types of functions, operations, actions, and/or other features such as, for example, one or more of the following (or combinations thereof):

    • Format output data that is represented in a uniform internal data structure into forms and layouts that render it appropriately on different modalities. Output data may include, for example, communication in natural language between the intelligent automated assistant and the user; data about domain entities, such as properties of restaurants, movies, products, and the like; domain specific data results from information services, such as weather reports, flight status checks, prices, and the like; and/or interactive links and buttons that enable the user to respond by directly interacting with the output presentation.
    • Render output data for modalities that may include, for example, any combination of: graphical user interfaces; text messages; email messages; sounds; animations; and/or speech output.
    • Dynamically render data for different graphical user interface display engines based on the request. For example, use different output processing layouts and formats depending on which web browser and/or device is being used.
    • Render output data in different speech voices dynamically.
    • Dynamically render to specified modalities based on user preferences.
    • Dynamically render output using user-specific “skins” that customize the look and feel.
    • Send a stream of output packages to a modality, showing intermediate status, feedback, or results throughout phases of interaction with assistant 1002.


According to specific embodiments, multiple instances or threads of output processor component(s) 1090 may be concurrently implemented and/or initiated via the use of one or more processor(s) 63 and/or other combinations of hardware and/or hardware and software. For example, in at least some embodiments, various aspects, features, and/or functionalities of output processor component(s) 1090 may be performed, implemented and/or initiated by one or more of the following types of systems, components, systems, devices, procedures, processes, and the like (or combinations thereof):

    • software modules within the client or server of an embodiment of an intelligent automated assistant;
    • remotely callable services;
    • using a mix of templates and procedural code.


Referring now to FIG. 39, there is shown a flow diagram depicting an example of a multiphase output procedure according to one embodiment. The multiphase output procedure includes automated assistant 1002 processing steps 702 and multiphase output steps 704.


In step 710, a speech input utterance is obtained and a speech-to-text component (such as component described in connection with FIG. 22) interprets the speech to produce a set of candidate speech interpretations 712. In one embodiment, speech-to-text component is implemented using, for example, Nuance Recognizer, available from Nuance Communications, Inc. of Burlington, Mass. Candidate speech interpretations 712 may be shown to the user in 730, for example in paraphrased form. For example, the interface might show “did you say?” alternatives listing a few possible alternative textual interpretations of the same speech sound sample.


In at least one embodiment, a user interface is provided to enable the user to interrupt and choose among the candidate speech interpretations.


In step 714, the candidate speech interpretations 712 are sent to a language interpreter 1070, which may produce representations of user intent 716 for at least one candidate speech interpretation 712. In step 732, paraphrases of these representations of user intent 716 are generated and presented to the user. (See related step 132 of procedure 120 in FIG. 22).


In at least one embodiment, the user interface enables the user to interrupt and choose among the paraphrases of natural language interpretations 732.


In step 718, task and dialog analysis is performed. In step 734, task and domain interpretations are presented to the user using an intent paraphrasing algorithm.


Referring now also to FIG. 40, there is shown a screen shot depicting an example of output processing according to one embodiment. Screen 4001 includes echo 4002 of the user's speech input, generated by step 730. Screen 4001 further includes paraphrase 4003 of the user's intent, generated by step 734. In one embodiment, as depicted in the example of FIG. 40, special formatting/highlighting is used for key words such as “events”, which may be used to facilitate training of the user for interaction with intelligent automated assistant 1002. For example, by visually observing the formatting of the displayed text, the user may readily identify and interpret back the intelligent automated assistant recognizes keywords such as “events”, “next Wednesday”, “San Francisco”, and the like.


Returning to FIG. 39, as requests are dispatched 720 to services and results are dynamically gathered, intermediate results may be displayed in the form of real-time progress 736. For example, a list of restaurants may be returned and then their reviews may be populated dynamically as the results from the reviews services arrive. Services can include web-enabled services and/or services that access information stored locally on the device and/or from any other source.


A uniform representation of response 722 is generated and formatted 724 for the appropriate output modality. After the final output format is completed, a different kind of paraphrase may be offered in 738. In this phase, the entire result set may be analyzed and compared against the initial request. A summary of results or answer to a question may then be offered.


Referring also to FIG. 41, there is shown another example of output processing according to one embodiment. Screen 4101 depicts paraphrase 4102 of the text interpretation, generated by step 732, real-time progress 4103 generated by step 736, and paraphrased summary 7104 generated by step 738. Also included are detailed results 4105.


In one embodiment, assistant 1002 is capable of generating output in multiple modes. Referring now to FIG. 42, there is shown a flow diagram depicting an example of multimodal output processing according to one embodiment.


The method begins 600. Output processor 1090 takes uniform representation of response 490 and formats 612 the response according to the device and modality that is appropriate and applicable. Step 612 may include information from device and modality models 610 and/or domain data models 614.


Once response 490 has been formatted 612, any of a number of different output mechanisms can be used, in any combination. Examples depicted in FIG. 42 include:

    • Generating 620 text message output, which is sent 630 to a text message channel;
    • Generating 622 email output, which is sent 632 as an email message;
    • Generating 624 GUI output, which is sent 634 to a device or web browser for rendering;
    • Generating 626 speech output, which is sent 636 to a speech generation module.


One skilled in the art will recognize that many other output mechanisms can be used.


In one embodiment, the content of output messages generated by mul-tiphase output procedure 700 is tailored to the mode of multimodal output processing 600. For example, if the output modality is speech 626, the language of used to paraphrase user input 730, text interpretations 732, task and domain interpretations 734, progress 736, and/or result summaries 738 may be more or less verbose or use sentences that are easier to comprehend in audible form than in written form. In one embodiment, the language is tailored in the steps of the multiphase output procedure 700; in other embodiments, the multiphase output procedure 700 produces an intermediate result that is further refined into specific language by multimodal output processing 600.


Short Term Personal Memory Component(s) 1052

In at least one embodiment, short term personal memory component(s) 1052 may be operable to perform and/or implement various types of functions, operations, actions, and/or other features such as, for example, one or more of the following (or combinations thereof):

    • Keep a history of the recent dialog between the embodiment of the assistant and the user, including the history of user inputs and their interpretations;
    • Keep a history of recent selections by the user in the GUI, such as which items were opened or explored, which phone numbers were called, which items were mapped, which movie trailers where played, and the like;
    • Store the history of the dialog and user interactions in a database on the client, the server in a user-specific session, or in client session state such as web browser cookies or RAM used by the client;
    • Store the list of recent user requests;
    • Store the sequence of results of recent user requests;
    • Store the click-stream history of UI events, including button presses, taps, gestures, voice activated triggers, and/or any other user input.
    • Store device sensor data (such as location, time, positional orientation, motion, light level, sound level, and the like) which might be correlated with interactions with the assistant.


According to specific embodiments, multiple instances or threads of short term personal memory component(s) 1052 may be concurrently implemented and/or initiated via the use of one or more processors 63 and/or other combinations of hardware and/or hardware and software.


According to different embodiments, one or more different threads or instances of short term personal memory component(s) 1052 may be initiated in response to detection of one or more conditions or events satisfying one or more different types of minimum threshold criteria for triggering initiation of at least one instance of short term personal memory component(s) 1052. For example, short term personal memory component(s) 1052 may be invoked when there is a user session with the embodiment of assistant 1002, on at least one input form or action by the user or response by the system.


In at least one embodiment, a given instance of short term personal memory component(s) 1052 may access and/or utilize information from one or more associated databases. In at least one embodiment, at least a portion of the database information may be accessed via communication with one or more local and/or remote memory devices. For example, short term personal memory component(s) 1052 may access data from long-term personal memory components(s) 1054 (for example, to obtain user identity and personal preferences) and/or data from the local device about time and location, which may be included in short term memory entries.


Referring now to FIGS. 43A and 43B, there are shown screen shots depicting an example of the use of short term personal memory component(s) 1052 to maintain dialog context while changing location, according to one embodiment. In this example, the user has asked about the local weather, then just says “in new york.” Screen 4301 shows the initial response, including local weather. When the user says “in new york”, assistant 1002 uses short term personal memory component(s) 1052 to access the dialog context and thereby determine that the current domain is weather forecasts. This enables assistant 1002 to interpret the new utterance “in new york” to mean “what is the weather forecast in New York this coming?”. Screen 4302 shows the appropriate response, including weather forecasts for New York.


In the example of FIGS. 43A and 43B, what was stored in short term memory was not only the words of the input “is it going to rain the day after tomorrow?” but the system's semantic interpretation of the input as the weather domain and the time parameter set to the day after tomorrow.


Long-Term Personal Memory Component(s) 1054

In at least one embodiment, long-term personal memory component(s) 1054 may be operable to perform and/or implement various types of functions, operations, actions, and/or other features such as, for example, one or more of the following (or combinations thereof):

    • To persistently store the personal information and data about a user, including for example his or her preferences, identities, authentication credentials, accounts, addresses, and the like;
    • To store information that the user has collected by using the embodiment of assistant 1002, such as the equivalent of bookmarks, favorites, clippings, and the like;
    • To persistently store saved lists of business entities including restaurants, hotels, stores, theaters and other venues. In one embodiment, long-term personal memory component(s) 1054 saves more than just the names or URLs, but also saves the information sufficient to bring up a full listing on the entities including phone numbers, locations on a map, photos, and the like;
    • To persistently store saved movies, videos, music, shows, and other items of entertainment;
    • To persistently store the user's personal calendar(s), to do list(s), reminders and alerts, contact databases, social network lists, and the like;
    • To persistently store shopping lists and wish lists for products and services, coupons and discount codes acquired, and the like;
    • To persistently store the history and receipts for transactions including reservations, purchases, tickets to events, and the like.


According to specific embodiments, multiple instances or threads of long-term personal memory component(s) 1054 may be concurrently implemented and/or initiated via the use of one or more processors 63 and/or other combinations of hardware and/or hardware and software. For example, in at least some embodiments, various aspects, features, and/or functionalities of long-term personal memory component(s) 1054 may be performed, implemented and/or initiated using one or more databases and/or files on (or associated with) clients 1304 and/or servers 1340, and/or residing on storage devices.


According to different embodiments, one or more different threads or instances of long-term personal memory component(s) 1054 may be initiated in response to detection of one or more conditions or events satisfying one or more different types of minimum threshold criteria for triggering initiation of at least one instance of long-term personal memory component(s) 1054. Various examples of conditions or events which may trigger initiation and/or implementation of one or more different threads or instances of long-term personal memory component(s) 1054 may include, but are not limited to, one or more of the following (or combinations thereof):

    • Long term personal memory entries may be acquired as a side effect of the user interacting with an embodiment of assistant 1002. Any kind of interaction with the assistant may produce additions to the long term personal memory, including browsing, searching, finding, shopping, scheduling, purchasing, reserving, communicating with other people via an assistant.
    • Long term personal memory may also be accumulated as a consequence of users signing up for an account or service, enabling assistant 1002 access to accounts on other services, using an assistant 1002 service on a client device with access to other personal information databases such as calendars, to-do lists, contact lists, and the like.


In at least one embodiment, a given instance of long-term personal memory component(s) 1054 may access and/or utilize information from one or more associated databases. In at least one embodiment, at least a portion of the database information may be accessed via communication with one or more local and/or remote memory devices, which may be located, for example, at client(s) 1304 and/or server(s) 1340. Examples of different types of data which may be accessed by long-term personal memory component(s) 1054 may include, but are not limited to data from other personal information databases such as contact or friend lists, calendars, to-do lists, other list managers, personal account and wallet managers provided by external services 1360, and the like.


Referring now to FIGS. 44A through 44C, there are shown screen shots depicting an example of the use of long term personal memory component(s) 1054, according to one embodiment. In the example, a feature is provided (named “My Stuff”), which includes access to saved entities such as restaurants, movies, and businesses that are found via interactive sessions with an embodiment of assistant 1002. In screen 4401 of FIG. 44A, the user has found a restaurant. The user taps on Save to My Stuff 4402, which saves information about the restaurant in long-term personal memory component(s) 1054.


Screen 4403 of FIG. 44B depicts user access to My Stuff. In one embodiment, the user can select among categories to navigate to the desired item.


Screen 4404 of FIG. 44C depicts the My Restaurant category, including items previously stored in My Stuff.


Automated Call and Response Procedure

Referring now to FIG. 33, there is shown a flow diagram depicting an automatic call and response procedure, according to one embodiment. The procedure of FIG. 33 may be implemented in connection with one or more embodiments of intelligent automated assistant 1002. It may be appreciated that intelligent automated assistant 1002 as depicted in FIG. 1 is merely one example from a wide range of intelligent automated assistant system embodiments which may be implemented. Other embodiments of intelligent automated assistant systems (not shown) may include additional, fewer and/or different components/features than those illustrated, for example, in the example intelligent automated assistant 1002 depicted in FIG. 1.


In at least one embodiment, the automated call and response procedure of FIG. 33 may be operable to perform and/or implement various types of functions, operations, actions, and/or other features such as, for example, one or more of the following (or combinations thereof):

    • The automated call and response procedure of FIG. 33 may provide an interface control flow loop of a conversational interface between the user and intelligent automated assistant 1002. At least one iteration of the automated call and response procedure may serve as a ply in the conversation. A conversational interface is an interface in which the user and assistant 1002 communicate by making utterances back and forth in a conversational manner.
    • The automated call and response procedure of FIG. 33 may provide the executive control flow for intelligent automated assistant 1002. That is, the procedure controls the gathering of input, processing of input, generation of output, and presentation of output to the user.
    • The automated call and response procedure of FIG. 33 may coordinate communications among components of intelligent automated assistant 1002. That is, it may direct where the output of one component feeds into another, and where the overall input from the environment and action on the environment may occur.


In at least some embodiments, portions of the automated call and response procedure may also be implemented at other devices and/or systems of a computer network.


According to specific embodiments, multiple instances or threads of the automated call and response procedure may be concurrently implemented and/or initiated via the use of one or more processors 63 and/or other combinations of hardware and/or hardware and software. In at least one embodiment, one or more or selected portions of the automated call and response procedure may be implemented at one or more client(s) 1304, at one or more server(s) 1340, and/or combinations thereof.


For example, in at least some embodiments, various aspects, features, and/or functionalities of the automated call and response procedure may be performed, implemented and/or initiated by software components, network services, databases, and/or the like, or any combination thereof.


According to different embodiments, one or more different threads or instances of the automated call and response procedure may be initiated in response to detection of one or more conditions or events satisfying one or more different types of criteria (such as, for example, minimum threshold criteria) for triggering initiation of at least one instance of automated call and response procedure. Examples of various types of conditions or events which may trigger initiation and/or implementation of one or more different threads or instances of the automated call and response procedure may include, but are not limited to, one or more of the following (or combinations thereof):

    • a user session with an instance of intelligent automated assistant 1002, such as, for example, but not limited to, one or more of:
      • a mobile device application starting up, for instance, a mobile device application that is implementing an embodiment of intelligent automated assistant 1002;
      • a computer application starting up, for instance, an application that is implementing an embodiment of intelligent automated assistant 1002;
      • a dedicated button on a mobile device pressed, such as a “speech input button”;
      • a button on a peripheral device attached to a computer or mobile device, such as a headset, telephone handset or base station, a GPS navigation system, consumer appliance, remote control, or any other device with a button that might be associated with invoking assistance;
      • a web session started from a web browser to a website implementing intelligent automated assistant 1002;
      • an interaction started from within an existing web browser session to a website implementing intelligent automated assistant 1002, in which, for example, intelligent automated assistant 1002 service is requested;
      • an email message sent to a modality server 1426 that is mediating communication with an embodiment of intelligent automated assistant 1002;
      • a text message is sent to a modality server 1426 that is mediating communication with an embodiment of intelligent automated assistant 1002;
      • a phone call is made to a modality server 1434 that is mediating communication with an embodiment of intelligent automated assistant 1002;
      • an event such as an alert or notification is sent to an application that is providing an embodiment of intelligent automated assistant 1002.
    • when a device that provides intelligent automated assistant 1002 is turned on and/or started.


According to different embodiments, one or more different threads or instances of the automated call and response procedure may be initiated and/or implemented manually, automatically, statically, dynamically, concurrently, and/or combinations thereof. Additionally, different instances and/or embodiments of the automated call and response procedure may be initiated at one or more different time intervals (e.g., during a specific time interval, at regular periodic intervals, at irregular periodic intervals, upon demand, and the like).


In at least one embodiment, a given instance of the automated call and response procedure may utilize and/or generate various different types of data and/or other types of information when performing specific tasks and/or operations. This may include, for example, input data/information and/or output data/information. For example, in at least one embodiment, at least one instance of the automated call and response procedure may access, process, and/or otherwise utilize information from one or more different types of sources, such as, for example, one or more databases. In at least one embodiment, at least a portion of the database information may be accessed via communication with one or more local and/or remote memory devices. Additionally, at least one instance of the automated call and response procedure may generate one or more different types of output data/information, which, for example, may be stored in local memory and/or remote memory devices.


In at least one embodiment, initial configuration of a given instance of the automated call and response procedure may be performed using one or more different types of initialization parameters. In at least one embodiment, at least a portion of the initialization parameters may be accessed via communication with one or more local and/or remote memory devices. In at least one embodiment, at least a portion of the initialization parameters provided to an instance of the automated call and response procedure may correspond to and/or may be derived from the input data/information.


In the particular example of FIG. 33, it is assumed that a single user is accessing an instance of intelligent automated assistant 1002 over a network from a client application with speech input capabilities. The user is interested in finding a good place for dinner at a restaurant, and is engaging intelligent automated assistant 1002 in a conversation to help provide this service.


In step 100, the user is prompted to enter a request. The user interface of the client offers several modes of input, as described in connection with FIG. 26. These may include, for example:

    • an interface for typed input, which may invoke an active typed-input elicitation procedure as illustrated in FIG. 11;
    • an interface for speech input, which may invoke an active speech input elicitation procedure as illustrated in FIG. 22.
    • an interface for selecting inputs from a menu, which may invoke active GUI-based input elicitation as illustrated in FIG. 23.


One skilled in the art will recognize that other input modes may be provided.


In one embodiment, step 100 may include presenting options remaining from a previous conversation with assistant 1002, for example using the techniques described in the active dialog suggestion input elicitation procedure described in connection with FIG. 24.


For example, by one of the methods of active input elicitation in step 100, the user might say to assistant 1002, “where may 1 get some good Italian around here?” For example, the user might have spoken this into a speech input component. An embodiment of an active input elicitation component 1094 calls a speech-to-text service, asks the user for confirmation, and then represents the confirmed user input as a uniform annotated input format 2690.


An embodiment of language interpreter component 1070 is then called in step 200, as described in connection with FIG. 29. Language interpreter component 1070 parses the text input and generates a list of possible interpretations of the user's intent 290. In one parse, the word “italian” is associated with restaurants of style Italian; “good” is associated with the recommendation property of restaurants; and “around here” is associated with a location parameter describing a distance from a global sensor reading (for example, the user's location as given by GPS on a mobile device).


In step 300, the representation of the user's intent 290 is passed to dialog flow processor 1080, which implements an embodiment of a dialog and flow analysis procedure as described in connection with FIG. 32. Dialog flow processor 1080 determines which interpretation of intent is most likely, maps this interpretation to instances of domain models and parameters of a task model, and determines the next flow step in a dialog flow. In the current example, a restaurant domain model is instantiated with a constrained selection task to find a restaurant by constraints (the cuisine style, recommendation level, and proximity constraints). The dialog flow model indicates that the next step is to get some examples of restaurants meeting these constraints and present them to the user.


In step 400, an embodiment of the flow and service orchestration procedure 400 is invoked, via services orchestration component 1082. It invokes a set of services 1084 on behalf of the user's request to find a restaurant. In one embodiment, these services 1084 contribute some data to a common result. Their data are merged and the resulting list of restaurants is represented in a uniform, service-independent form.


In step 500, output processor 1092 generates a dialog summary of the results, such as, “I found some recommended Italian restaurants near here.” Output processor 1092 combines this summary with the output result data, and then sends the combination to a module that formats the output for the user's particular mobile device in step 600.


In step 700, this device-specific output package is sent to the mobile device, and the client software on the device renders it on the screen (or other output device) of the mobile device.


The user browses this presentation, and decides to explore different options. If the user is done 790, the method ends. If the user is not done 490, another iteration of the loop is initiated by returning to step 100.


The automatic call and response procedure may be applied, for example to a user's query “how about mexican food?” Such input may be elicited in step 100. In step 200, the input is interpreted as restaurants of style Mexican, and combined with the other state (held in short term personal memory 1052) to support the interpretation of the same intent as the last time, with one change in the restaurant style parameter. In step 300, this updated intent produces a refinement of the request, which is given to service orchestration component(s) 1082 in step 400.


In step 400 the updated request is dispatched to multiple services 1084, resulting in a new set of restaurants which are summarized in dialog in 500, formatted for the device in 600, and sent over the network to show new information on the user's mobile device in step 700.


In this case, the user finds a restaurant of his or her liking, shows it on a map, and sends directions to a friend.


One skilled in the art will recognize that different embodiments of the automated call and response procedure (not shown) may include additional features and/or operations than those illustrated in the specific embodiment of FIG. 33, and/or may omit at least a portion of the features and/or operations of automated call and response procedure illustrated in the specific embodiment of FIG. 33.


Constrained Selection

In one embodiment, intelligent automated assistant 1002 uses constrained selection in its interactions with the user, so as to more effectively identify and present items that are likely to be of interest to the user.


Constrained selection is a kind of generic task. Generic tasks are abstractions that characterize the kinds of domain objects, inputs, outputs, and control flow that are common among a class of tasks. A constrained selection task is performed by selecting items from a choice set of domain objects (such as restaurants) based on selection constraints (such as a desired cuisine or location). In one embodiment, assistant 1002 helps the user explore the space of possible choices, eliciting the user's constraints and preferences, presenting choices, and offering actions to perform on those choices such as to reserve, buy, remember, or share them. The task is complete when the user selects one or more items on which to perform the action.


Constrained selection is useful in many contexts: for example, picking a movie to see, a restaurant for dinner, a hotel for the night, a place to buy a book, or the like. In general, constrained selection is useful when one knows the category and needs to select an instance of the category with some desired properties.


One conventional approach to constrained selection is a directory service. The user picks a category and the system offers a list of choices. In a local directory, one may constrain the directory to a location, such as a city. For instance, in a “yellow pages” service, users select the book for a city and then look up the category, and the book shows one or more items for that category. The main problem with a directory service is that the number of possibly relevant choices is large (e.g., restaurants in a given city).


Another conventional approach is a database application, which provides a way to generate a choice set by eliciting a query from the user, retrieving matching items, and presenting the items in some way that highlights salient features. The user browses the rows and columns of the result set, possibly sorting the results or changing the query until he or she finds some suitable candidates. The problem with the database service is that it may require the user to operationalize their human need as a formal query and to use the abstract machinery of sort, filter, and browse to explore the resulting data. These are difficult for most people to do, even with graphical user interfaces.


A third conventional approach is open-ended search, such as “local search.” Search is easy to do, but there are several problems with search services that make them difficult for people to accomplish the task of constrained selection. Specifically:

    • As with directory search, the user may not just enter a category and look at one or more possible choice, but must narrow down the list.
    • If the user can narrow the selection by constraints, it is not obvious what constraints may be used (e.g., may 1 search for places that are within walking distance or are open late?)
    • It is not clear how to state constraints (e.g., is it called cuisine or restaurant type, and what are the possible values?)
    • Multiple preferences conflict; there is usually no objectively “best” answer to a given situation (e.g., I want a place that is close by and cheap serving gourmet food with excellent service and which is open until midnight).
    • Preferences are relative, and they depend on what is available. For example, if the user may get a table at a highly rated restaurant, he or she might choose it even though it is expensive. In general, though, the user would prefer less expensive options.


In various embodiments, assistant 1002 of the present invention helps streamline the task of constrained selection. In various embodiments, assistant 1002 employs database and search services, as well as other functionality, to reduce the effort, on the part of the user, of stating what he or she is looking for, considering what is available, and deciding on a satisfactory solution.


In various embodiments, assistant 1002 helps to make constrained selection simpler for humans in any of a number of different ways.


For example, in one embodiment, assistant 1002 may operationalize properties into constraints. The user states what he or she wants in terms of properties of the desired outcome. Assistant 1002 operationalizes this input into formal constraints. For example, instead of saying “find one or more restaurants less than 2 miles from the center of Palo Alto whose cuisine includes Italian food” the user may just say “Italian restaurants in palo alto.” Assistant 1002 may also operationalize qualities requested by the user that are not parameters to a database. For example, if the user requests romantic restaurants, the system may operationalize this as a text search or tag matching constraint. In this manner, assistant 1002 helps overcome some of the problems users may otherwise have with constrained selection. It is easier, for a user, to imagine and describe a satisfactory solution than to describe conditions that would distinguish suitable from unsuitable solutions.


In one embodiment, assistant 1002 may suggest useful selection criteria, and the user need only say which criteria are important at the moment. For example, assistant 1002 may ask “which of these matter: price (cheaper is better), location (closer is better), rating (higher rated is better)?” Assistant 1002 may also suggest criteria that may require specific values; for example, “you can say what kind of cuisine you would like or a food item you would like”.


In one embodiment, assistant 1002 may help the user make a decision among choices that differ on a number of competing criteria (for example, price, quality, availability, and convenience).


By providing such guidance, assistant 1002 may help users in making multi-parametric decisions in any of several ways:

    • One is to reduce the dimensionality of the space, combining raw data such as ratings from multiple sources into a composite “recommendation” score. The composite score may take into account domain knowledge about the sources of data (e.g., Zagat ratings may be more predictive of quality than Yelp).
    • Another approach is to focus on a subset of criteria, turning a problem of “what are all the possible criteria to consider and how to they combine?” into a selection of the most important criteria in a given situation (e.g., “which is more important, price or proximity?”).
    • Another way to simply the decision making is to assume default values and preference orders (e.g., all things being equal, higher rated and closer and cheaper are better). The system may also remember users' previous responses that indicate their default values and preferences.
    • Fourth, the system may offer salient properties of items in the choice set that were not mentioned in the original request. For example, the user may have asked for local Italian food. The system may offer a choice set of restaurants, and with them, a list of popular tags used by reviewers or a tag line from a guide book (e.g., “a nice spot for a date” “great pasta”). This could let people pick out a specific item and complete the task. Research shows that most people make decisions by evaluating specific instances rather than deciding on criteria and rationally accepting the one that pops to the top. It also shows that people learn about features from concrete cases. For example, when choosing among cars, buyers may not care about navigation systems until they see that some of the cars have them (and then the navigation system may become an important criterion). Assistant 1002 may present salient properties of listed items that help people pick a winner or that suggest a dimension along which to optimize.


Conceptual Data Model

In one embodiment, assistant 1002 offers assistance with the constrained selection task by simplifying the conceptual data model. The conceptual data model is the abstraction presented to users in the interface of assistant 1002. To overcome the psychological problems described above, in one embodiment assistant 1002 provides a model that allows users to describe what they want in terms of a few easily recognized and recalled properties of suitable choices rather than constraint expressions. In this manner, properties can be made easy to compose in natural language requests (e.g., adjectives modifying keyword markers) and be recognizable in prompts (“you may also favor recommended restaurants . . . ”). In one embodiment, a data model is used that allows assistant 1002 to determine the domain of interest (e.g., restaurants versus hotels) and a general approach to guidance that may be instantiated with domain-specific properties.


In one embodiment, the conceptual data model used by assistant 1002 includes a selection class. This is a representation of the space of things from which to choose. For example, in the find-a-restaurant application, the selection class is the class of restaurants. The selection class may be abstract and have subclasses, such as “things to do while in a destination.” In one embodiment, the conceptual data model assumes that, in a given problem solving situation, the user is interested in choosing from a single selection class. This assumption simplifies the interaction and also allows assistant 1002 to declare its boundaries of competence (“I know about restaurants, hotels, and movies” as opposed to “I know about life in the city”).


Given a selection class, in one embodiment the data model presented to the user for the constrained selection task includes, for example: items; item features; selection criteria; and constraints.


Items are instances of the selection class.


Item features are properties, attributes, or computed values that may be presented and/or associated with at least one item. For example, the name and phone number of a restaurant are item features. Features may be intrinsic (the name or cuisine of a restaurant) or relational (e.g., the distance from one's current location of interest). They may be static (e.g., restaurant name) or dynamic (rating). They may be composite values computed from other data (e.g., a “value for money” score). Item features are abstractions for the user made by the domain modeler; they do not need to correspond to underlying data from back-end services.


Selection criteria are item features that may be used to compare the value or relevance of items. That is, they are ways to say which items are preferred. Selection criteria are modeled as features of the items themselves, whether they are intrinsic properties or computed. For example, proximity (defined as distance from the location of interest) is a selection criterion. Location in space-time is a property, not a selection criterion, and it is used along with the location of interest to compute the distance from the location of interest.


Selection criteria may have an inherent preference order. That is, the values of any particular criterion may be used to line up items in a best first order. For example, the proximity criterion has an inherent preference that closer is better. Location, on the other hand, has no inherent preference value. This restriction allows the system to make default assumptions and guide the selection if the user only mentions the criterion. For example, the user interface might offer to “sort by rating” and assume that higher rated is better.


One or more selection criteria are also item features; they are those features related to choosing among possible items. However, item features are not necessarily related to a preference (e.g., the names and phone numbers of restaurants are usually irrelevant to choosing among them).


In at least one embodiment, constraints are restrictions on the desired values of the selection criteria. Formally, constraints might be represented as set membership (e.g., cuisine type includes Italian), pattern matches (e.g., restaurant review text includes “romantic”), fuzzy inequalities (e.g., distance less than a few miles), qualitative thresholds (e.g., highly rated), or more complex functions (e.g., a good value for money). To make things simple enough for normal humans, this data model reduces at least one or more constraints to symbolic values that may be matched as words. Time and distance may be excluded from this reduction. In one embodiment, the operators and threshold values used for implementing constraints are hidden from the user. For example, a constraint on the selection criteria called “cuisine” may be represented as a symbolic value such as “Italian” or “Chinese.” A constraint on rating is “recommended” (a binary choice). For time and distance, in one embodiment assistant 1002 uses proprietary representations that handle a range of inputs and constraint values. For example, distance might be “walking distance” and time might be “tonight”; in one embodiment, assistant 1002 uses special processing to match such input to more precise data.


In at least one embodiment, some constraints may be required constraints. This means that the task simply cannot be completed without this data. For example, it is hard to pick a restaurant without some notion of desired location, even if one knows the name.


To summarize, a domain is modeled as selection classes with item features that are important to users. Some of the features are used to select and order items offered to the user—these features are called selection criteria. Constraints are symbolic limits on the selection criteria that narrow the set of items to those that match.


Often, multiple criteria may compete and constraints may match partially. The data model reduces the selection problem from an optimization (finding the best solution) to a matching problem (finding items that do well on a set of specified criteria and match a set of symbolic constraints). The algorithms for selecting criteria and constraints and determining an ordering are described in the next section.


Methodology for Constrained Selection

In one embodiment, assistant 1002 performs constrained selection by taking as input an ordered list of criteria, with implicit or explicit constraints on at least one, and generating a set of candidate items with salient features. Computationally, the selection task may be characterized as a nested search: first, identify a selection class, then identify the important selection criteria, then specify constraints (the boundaries of acceptable solutions), and search through instances in order of best fit to find acceptable items.


Referring now to FIG. 45, there is shown an example of an abstract model 4500 for a constrained selection task as a nested search. In the example assistant 1002 identifies 4505 a selection call among all local search types 4501. The identified class is restaurant. Within the set of all restaurants 4502, assistant 1002 selects 4506 criteria. In the example, the criterion is identified as distance. Within the set of restaurants in PA 4503, assistant 1002 specifies 4507 constraints for the search. In the example, the identified constraint is “Italian cuisine”). Within the set of Italian restaurants in PA 4504, assistant 4508 selects items for presentation to the user.


In one embodiment, such a nested search is what assistant 1002 does once it has the relevant input data, rather than the flow for eliciting the data and presenting results. In one embodiment, such control flow is governed via a dialog between assistant 1002 and the user which operates by other procedures, such as dialog and task flow models. Constrained selection offers a framework for building dialog and task flow models at this level of abstraction (that is, suitable for constrained selection tasks regardless of domain).


Referring now to FIG. 46, there is shown an example of a dialog 4600 to help guide the user through a search process, so that the relevant input data can be obtained.


In the example dialog 4600, the first step is for the user to state the kind of thing they are looking for, which is the selection class. For example, the user might do this by saying “dining in palo alto.” This allows assistant 1002 to infer 4601 the task and domain.


Once assistant 1002 has understood the task and domain binding (selection class=restaurants), the next step is to understand which selection criteria are important to this user, for example by soliciting 4603 criteria and/or constraints. In the example above, “in palo alto” indicates a location of interest. In the context of restaurants, the system may interpret a location as a proximity constraint (technically, a constraint on the proximity criterion). Assistant 1002 explains what is needed, receives input. If there is enough information to constrain the choice set to a reasonable size, then assistant 1002 paraphrases the input and presents 4605 one or more restaurants that meet the proximity constraint, sorted in some useful order. The user can then select 4607 from this list, or refine 4606 the criteria and constraints. Assistant 1002 reasons about the constraints already stated, and uses domain-specific knowledge to suggest other criteria that might help, soliciting constraints on these criteria as well. For example, assistant 1002 may reason that, when recommending restaurants within walking distance of a hotel, the useful criteria to solicit would be cuisine and table availability.


The constrained selection task is complete when the user selects 4607 an instance of the selection class. In one embodiment, additional follow-on tasks 4602 are enabled by assistant 1002. Thus, assistant 1002 can offer services that indicate selection while providing some other value. Examples 4608 booking a restaurant, setting a reminder on a calendar, and/or sharing the selection with others by sending an invitation. For example, booking a restaurant certainly indicates that it was selected; other options might be to put the restaurant on a calendar or send in invitation with directions to friends.


Referring now to FIG. 47, there is shown a flow diagram depicting a method of constrained selection according to one embodiment. In one embodiment, assistant 1002 operates in an opportunistic and mixed-initiative manner, permitting the user to jump to the inner loop, for instance, by stating task, domain, criteria, and constraints one or more at once in the input.


The method begins 4701. Input is received 4702 from the user, according to any of the modes described herein. If, based on the input, the task not known, assistant 1002 requests 4705 clarifying input from the user.


In step 4717, assistant 1002 determines whether the user provides additional input. If so, assistant 1002 returns to step 4702. Otherwise the method ends 4799.


If, in step 4703, the task is known, assistant 1002 determines 4704 whether the task is constrained selection. If not, assistant 1002 proceeds 4706 to the specified task flow.


If, in step 4704, the task is constrained selection, assistant 1002 determines 4707 whether the selection class can be determined. If not, assistant 1002 offers 4708 a choice of known selection classes, and returns to step 4717.


If, in step 4707, the selection class can be determined, assistant 1002 determines 4709 whether all required constraints can be determined. If not, assistant 1002 prompts 4710 for required information, and returns to step 4717.


If, in step 4709, all required constants can be determined, assistant 1002 determines 4711 whether any result items can be found, given the constraints. If there are no items that meet the constraints, assistant 1002 offers 4712 ways to relax the constraints. For example, assistant 1002 may relax the constraints from lowest to highest precedence, using a filter/sort algorithm. In one embodiment, if there are items that meet some of the constraints, then assistant 1002 may paraphrase the situation (outputting, for example, “I could not find Recommended Greek restaurants that deliver on Sundays in San Carlos. However, I found 3 Greek restaurants and 7 Recommend restaurants in San Carlos.”). In one embodiment, if there are no items that match any constraints, then assistant 1002 may paraphrase this situation and prompt for different constraints (outputting, for example, “Sorry, I could not find any restaurants in Anytown, Tex. You may pick a different location.”). Assistant 1002 returns to step 4717.


If, in step 4711, result items can be found, assistant 1002 offers 4713 a list of items. In one embodiment, assistant 1002 paraphrases the currently specified criteria and constraints (outputting, for example, “Here are some recommended Italian restaurants in San Jose.” (recommended=yes, cuisine=Italian, proximity=<in San Jose>)). In one embodiment, assistant 1002 presents a sorted, paginated list of items that meet the known constraints. If an item only shows some of the constraints, such a condition can be shown as part of the item display. In one embodiment, assistant 1002 offers the user ways to select an item, for example by initiating another task on that item such as booking, remembering, scheduling, or sharing. In one embodiment, on any given item, assistant 1002 presents item features that are salient for picking instances of the selection class. In one embodiment, assistant 1002 shows how the item meets a constraint; for example, Zagat rating of 5 meets the Recommended=yes constraint, and “1 mile away” meets the “within walking distance of an address” constraint. In one embodiment, assistant 1002 allows the user to drill down for more detail on an item, which results in display of more item features.


Assistant 1002 determines 4714 whether the user has selected an item. If the user selects an item, the task is complete. Any follow-on task is performed 4715, if there is one, and the method ends 4799.


If, in step 4714, the user does not select an item, assistant 1002 offers 4716 the user ways to select other criteria and constraints and returns to step 4717. For example, given the currently specified criteria and constraints, assistant 1002 may offer criteria that are most likely to constrain the choice set to a desired size. If the user selects a constraint value, that constraint value is added to the previously determined constraints when steps 4703 to 4713 are repeated.


Since one or more criteria may have an inherent preference value, selecting the criteria may add information to the request. For example, allowing the user to indicate that positive reviews are valued allows assistant 1002 to sort by this criterion. Such information can be taken into account when steps 4703 to 4713 are repeated.


In one embodiment, assistant 1002 allows the user to raise the importance of a criterion that is already specified, so that it would be higher in the precedence order. For example, if the user asked for fast, cheap, highly recommended restaurants within one block of their location, assistant 1002 may request that the user chooses which of these criteria are more important. Such information can be taken into account when steps 4703 to 4713 are repeated.


In one embodiment, the user can provide additional input at any point while the method of FIG. 47 is being performed. In one embodiment, assistant 1002 checks periodically or continuously for such input, and, in response, loops back to step 4703 to process it.


In one embodiment, when outputting an item or list of items, assistant 1002 indicates, in the presentation of items, the features that were used to select and order them. For example, if the user asked for nearby Italian restaurants, such item features for distance and cuisine may be shown in the presentation of the item. This may include highlighting matches, as well as listing selection criteria that were involved in the presentation of an item.


Example Domains

Table 1 provides an example of constrained selection domains that may be handled by assistant 1002 according to various embodiments.











TABLE 1









Based on these criteria
























special
general


Select a
Location
Price
Availability
Type
Quality
Name
Services
search
search





Restaurant
proximity
affordability
open
cuisine
rating by
restaurant
delivery
menu
keywords





tables

guide,
name

items







review


Hotel
proximity
price range
available
motel,
rating by
hotel name
amenities

keywords





rooms
hotel,
guide,






B&B, . . .
review


Movie
theatre

show
genre
rating by
movie title

actors,



proximity

times

review


etc


Local
proximity


business
rating by
business


keywords


Business



category
review
name


Local
venue

by date


event title


keywords


event
proximity


concert
venue

by tour
music

band name

band
keywords



proximity

schedule
genre



members


CD, book,

price range
online, in
download,
popularity
album or

artist
keywords


DVD to


store, etc.
physical

song name

title, etc.


buy









Filtering and Sorting Results

In one embodiment, when presenting items that meet currently specified criteria and constraints, a filter/sort methodology can be employed. In one embodiment selection constraints may serve as both filter and sort parameters to the underlying services. Thus, any selection criterion can be used to determine which items are in the list, and to compute the order in which to paginate and show them. Sort order for this task is akin to relevance rank in search. For example, proximity is a criterion with symbolic constraint values such as “within driving distance” and a general notion of sorting by distance. The “driving distance” constraint might be used to select a group of candidate items. Within that group, closer items might be sorted higher in the list.


In one embodiment, selection constraints and associated filtering and sorting are at discrete “levels”, which are functions of both the underlying data and the input from the user. For example, proximity is grouped into levels such as “walking distance”, “taxi distance”, “driving distance.” When sorting, one or more items within walking distance are treated as if they were the same distance. The input from the user may come into play in the way he or she specifies a constraint. If the user enters “in palo alto”, for example, then one or more items within the Palo Alto city limits are perfect matches and are equivalent. If the user enters, “near the University Avenue train station” then the match would depend on a distance from that address, with the degree of match dependent on the selection class (e.g., near for restaurants is different than near for hotels). Even within a constraint that may be specified with a continuous value, a discretization may be applied. This may be important for sorting operations, so that multiple criteria may participate in determining the best-first ordering.


In one embodiment, the item list—those items that are considered “matching” or “good enough”—may be shorter or longer than the number of items shown on one “page” of the output. Generally, items in the first page are given the most attention, but conceptually there is a longer list, and pagination is simply a function of the form factor of the output medium. This means, for instance, that if the user is offered a way to sort or browse the items by some criterion, then it is the entire set of items (more than one page worth) that is sorted or browsed.


In one embodiment, there is a precedence ordering among selection criteria. That is, some criteria may matter more than others in the filter and sort. In one embodiment, those criteria selected by the user are given higher precedence than others, and there is a default ordering over one or more criteria. This allows for a general lexicographic sort. The assumption is that there is a meaningful a priori precedence. For example, unless the user states otherwise, it may be more important for a restaurant to be close than to be inexpensive. In one embodiment, the a priori precedence ordering is domain-specific. The model allows for user-specific preferences to override the domain defaults, if that is desired.


Since the values of constraints can represent several internal data types, there are different ways for constraints to match, and they may be specific to the constraint. For example, in one embodiment:

    • Binary constraints match one or more or none. For example, whether a restaurant is “Fast” might be either true or not.
    • Set membership constraints match one or more or none based on a property value. For example, cuisine=Greek means the set of cuisines for a restaurant includes Greek.
    • Enumeration constraints match at a threshold. For example, a rating criterion might have constraint values rated, highly-rated, or top-rated. Constraining to highly-rated would also match top-rated.
    • Numeric constraints match at a threshold that may be criterion specific. For example, “open late” might be a criterion, and the user might ask for places open after 10:00 pm. This kind of constraint may be slightly out of scope for the constrained selection task, since it is not a symbolic constraint value. However, in one embodiment, assistant 1002 recognizes some cases of numeric constraints like this, and maps them to threshold values with symbolic constraints (e.g., “restaurants in palo alto open now”→“here are 2 restaurants in palo alto that are open late”).
    • Location and time are handled specially. A constraint on proximity might be a location of interest specified at some level of granularity, and that determines the match. If the user specifies a city, then city-level matching is appropriate; a ZIP code may allow for a radius. Assistant 1002 may also understand locations that are “near” other locations of interest, also based on special processing. Time is relevant as a constraint value of criteria that have threshold value based on a service call, such as table availability or flights within a given time range.


In one embodiment, constraints can be modeled so that there is a single threshold value for selection and a small set of discrete values for sorting. For example, the affordability criterion might be modeled as a roughly binary constraint, where affordable restaurants are any under some threshold price range. When the data justify multiple discrete levels for selection, constraints can be modeled using a gradient of matching. In one embodiment two levels of matching (such as strong and weak matching) may be provided; however, one skilled in the art will recognize that in other embodiments, any number of levels of matching can be provided. For example, proximity may be matched with a fuzzy boundary, so that things that are near the location of interest may match weakly. The operational consequence of a strong or weak match is in the filter/sort algorithm as described below.


For at least one criterion, an approach to matching and default thresholds can be established, if relevant. The user may be able to say just the name of the constraint, a symbolic constraint value, or a precise constraint expression if it is handled specially (such as time and location).


An ideal situation for constrained selection occurs when the user states constraints that result in a short list of candidates, one or more of which meet the constraints. The user then chooses among winners based on item features. In many cases, however, the problem is over- or under-constrained. When it is over-constrained, there are few or no items that meet the constraints. When it is under-constrained, there are so many candidates that examining the list is not expedient. In one embodiment, the general constrained selection model of the present invention is able to handle multiple constraints with robust matching and usually produce something to choose from. Then the user may elect to refine their criteria and constraints or just complete the task with a “good enough” solution.


Method

In one embodiment, the following method is used for filtering and sorting results:


1. Given an ordered list of selection criteria selected by the user, determine constraints on at least one.

    • a. If the user specified a constraint value, use it. For example, if the user said “greek food” the constraint is cuisine=Greek. If the user said “san Francisco” the constraint is In the City of San Francisco. If the user said “south of market” then the constraint is In the Neighborhood of SoMa.
    • b. Otherwise use a domain- and criteria-specific default. For example, if the user said “a table at some thai place” he or she is indicating that the availability criterion is relevant, but he or she did not specify a constraint value. The default constraint values for availability might be some range of date times such as tonight and a default party size of 2.


2. Select a minimum of N results by specified constraints.

    • a. Try to get N results at strong match.
    • b. If that fails, try to relax constraints, in reverse precedence order. That is, match at strong level for one or more of the criteria except the last, which may match at a weak level. If there is no weak match for that constraint, then try weak matches up the line from lowest to highest precedence.
    • c. Then repeat the loop allowing failure to match on constraints, from lowest to highest precedence.


3. After getting a minimum choice set, sort lexicographically over one or more criteria (which may include user-specified criteria as well as other criteria) in precedence order.

    • a. Consider the set of user-specified criteria as highest precedence, then one or more remaining criteria in their a priori precedence. For example, if the a priori precedence is (availability, cuisine, proximity, rating), and the user gives constraints on proximity and cuisine, then the sort precedence is (cuisine, proximity, availability, rating).
    • b. Sort on criteria using discrete match levels (strong, weak, none), using the same approach as in relaxing constraints, this time applied the full criteria list.
      • i. If a choice set was obtained without relaxing constraints, then one or more of the choice set may “tie” in the sort because they one or more match at strong levels. Then, the next criteria in the precedence list may kick in to sort them. For example, if the user says cuisine=Italian, proximity=In San Francisco, and the sort precedence is (cuisine, proximity, availability, rating), then one or more the places on the list have equal match values for cuisine and proximity. So the list would be sorted on availability (places with tables available bubble to the top). Within the available places, the highest rated ones would be at the top.
      • ii. If the choice set was obtained by relaxing constraints, then one or more of the fully matching items are at the top of the list, then the partially matching items. Within the matching group, they are sorted by the remaining criteria, and the same for the partially matching group. For example, if there were only two Italian restaurants in San Francisco, then the available one would be shown first, then the unavailable one. Then the rest of the restaurants in San Francisco would be shown, sorted by availability and rating.


Precedence Ordering

The techniques described herein allow assistant 1002 to be extremely robust in the face of partially specified constraints and incomplete data. In one embodiment, assistant 1002 uses these techniques to generate a user list of items in best-first order, i.e. according to relevance.


In one embodiment, such relevance sorting is based on an a priori precedence ordering. That is, of the things that matter about a domain, a set of criteria is chosen and placed in order of importance. One or more things being equal, criteria higher in the precedence order may be more relevant to a constrained selection among items than those lower in the order. Assistant 1002 may operate on any number of criteria. In addition, criteria may be modified over time without breaking existing behaviors.


In one embodiment, the precedence order among criteria may be tuned with domain-specific parameters, since the way criteria interact may depend on the selection class. For example, when selecting among hotels, availability and price may be dominant constraints, whereas for restaurants, cuisine and proximity may be more important.


In one embodiment, the user may override the default criteria ordering in the dialog. This allows the system to guide the user when searches are over-constrained, by using the ordering to determine which constraints should be relaxed. For example, if the user gave constraints on cuisine, proximity, recommendation, and food item, and there were no fully matching items, the user could say that food item was more important than recommendation level and change the mix so the desired food item matches were sorted to the top.


In one embodiment, when precedence order is determined, user-specified constraints take precedence over others. For example, in one embodiment, proximity is a required constraint and so is always specified, and further has precedence over other unselected constraints. Therefore it does not have to be the highest precedence constraint in order to be fairly dominant. Also, many criteria may not match at one or more unless a constraint is given by the user, and so the precedence of these criteria only matters within user-selected criteria.


For example, when the user specifies a cuisine it is important to them, and otherwise is not relevant to sorting items.


For example, the following is a candidate precedence sorting paradigm for the restaurant domain:

    • 1. cuisine* (not sortable unless a constraint value is given)
    • 2. availability* (sortable using a default constraint value, e.g., time)
    • 3. recommended
    • 4. proximity* (a constraint value is always given)
    • 5. affordability
    • 6. may deliver
    • 7. food item (not sortable unless a constraint value, e.g., a keyword, is given)
    • 8. keywords (not sortable unless a constraint value, e.g., a keyword, is given)
    • 9. restaurant name


The following is an example of a design rationale for the above sorting paradigm:

    • If a user specifies a cuisine, he or she wants it to stick.
    • One or more things being equal, sort by rating level (it is the highest precedence among criteria than may be used to sort without a constraint).
    • In at least one embodiment, proximity may be more important than most things. However, since it matches at discrete levels (in a city, within a radius for walking and the like), and it is always specified, then most of the time most matching items may “tie” on proximity.
    • Availability (as determined by a search on a website such as open-table.com, for instance) is a valuable sort criterion, and may be based on a default value for sorting when not specified. If the user indicates a time for booking, then only available places may be in the list and the sort may be based on recommendation.
    • If the user says they want highly recommended places, then it may sort above proximity and availability, and these criteria may be relaxed before recommendation. The assumption is that if someone is looking for nice place, they may be willing to drive a bit farther and it is more important than a default table availability. If a specific time for availability is specified, and the user requests recommended places, then places that are both recommended and available may come first, and recommendation may relax to a weak match before availability fails to match at one or more.
    • The remaining constraints except for name are one or more based on incomplete data or matching. So they are weak sort heuristics by default, and when they are specified the match one or more-or-none.
    • Name may be used as a constraint to handle the case where someone mentions the restaurant by name, e.g., find one or more Hobee's restaurants near Palo Alto. In this case, one or more items may match the name, and may be sorted by proximity (the other specified constraint in this example).


Domain Modeling: Mapping Selection Criteria to Underlying Data

It may be desirable to distinguish between the data that are available for computation by assistant 1002 and the data used for making selections. In one embodiment, assistant 1002 uses a data model that reduces the complexity for the user by folding one or more kinds of data used to distinguish among items into a simple selection criteria model. Internally, these data may take several forms. Instances of the selection class can have intrinsic properties and attributes (such as cuisine of a restaurant), may be compared along dimensions (such as the distance from some location), and may be discovered by some query (such as whether it matches a text pattern or is available at a given time). They may also be computed from other data which are not exposed to the user as selection criteria (e.g., weighted combinations of ratings from multiple sources). These data are one or more relevant to the task, but the distinctions among these three kinds of data are not relevant to the user. Since the user thinks in terms of features of the desired choice rather than in properties and dimensions, assistant 1002 operationalizes these various criteria into features of the items. Assistant 1002 provides a user-facing domain data model and maps it to data found in web services.


One type of mapping is an isomorphism from underlying data to user-facing criteria. For example, the availability of tables for reservations as seen by the user could be exactly what an online reservation website, such as opentable.com, offers, using the same granularity for time and party size.


Another type of mapping is a normalization of data from one or more services to a common value set, possibly with a unification of equivalent values. For example, cuisines of one or more restaurants may be represented as a single ontology in assistant 1002, and mapped to various vocabularies used in different services. That ontology might be hierarchical, and have leaf nodes pointing to specific values from at least one service. For example, one service might have a cuisine value for “Chinese”, another for “Szechuan”, and a third for “Asian.” The ontology used by assistant 1002 would cause references to “Chinese food” or “Szechuan” to semantically match one or more of these nodes, with confidence levels reflecting the degree of match.


Normalization might also be involved when resolving differences in precision. For example, the location of a restaurant may be given to the street level in one service but only to city in another. In one embodiment, assistant 1002 uses a deep structural representation of locations and times that may be mapped to different surface data values.


In one embodiment, assistant 1002 uses a special kind of mapping for open-ended qualifiers (e.g., romantic, quiet) which may be mapped to matches in full text search, tags, or other open-textured features. The name of the selection constraint in this case would be something like “is described as”.


In at least one embodiment, constraints may be mapped to operational preference orderings. That is, given the name of a selection criterion and its constraint value, assistant 1002 is able to interpret the criterion as an ordering over possible items. There are several technical issues to address in such a mapping. For example:

    • Preference orderings may conflict. The ordering given by one constraint may be inconsistent or even inversely correlated with the ordering given by another. For example, price and quality tend to be in opposition. In one embodiment, assistant 1002 interprets constraints chosen by the user in a weighted or otherwise combined ordering that reflects the user's desires but is true to the data. For example, the user may ask for “cheap fast food French restaurants within walking distance rated highly.” In many locations, there may not be any such restaurant. However, in one embodiment, assistant 1002 may show a list of items that tries to optimize for at least one constraint, and explain why at least one is listed. For example, item one might be “highly rated French cuisine” and another “cheap fast food within walking distance”.
    • Data may be used as either hard or soft constraints. For example, the price range of a restaurant may be important to choosing one, but it may be difficult to state a threshold value for price up-front. Even seemingly hard constraints like cuisine may be, in practice, soft constraints because of partial matching. Since, in one embodiment, assistant 1002 using a data modeling strategy that seeks to flatten one or more criteria into symbolic values (such as “cheap” or “close”), these constraints may be mapped into a function that gets the criteria and order right, without being strict about matching specific threshold values. For symbolic criteria with clear objective truth values, assistant 1002 may weigh the objective criteria higher than other criteria, and make it clear in the explanation that it knows that some of the items do not strictly match the requested criteria.
    • Items may match some but not one or more constraints, and the “best fitting” items may be shown.
    • In general, assistant 1002 determines which item features are salient for a domain, and which may serve as selection criteria, and for at least one criteria, possible constraint values. Such information can be provided, for example, via operational data and API calls.


Paraphrase and Prompt Text

As described above, in one embodiment assistant 1002 provides feedback to show it understands the user's intent and is working toward the user's goal by producing paraphrases of its current understanding. In the conversational dialog model of the present invention, the paraphrase is what assistant 1002 outputs after the user's input, as a preface (for example, paraphrase 4003 in FIG. 40) or summary of the results to follow (for example, list 3502 in FIG. 35).


The prompt is a suggestion to the user about what else they can do to refine their request or explore the selection space along some dimensions.


In one embodiment, the purposes of paraphrase and prompt text include, for example:

    • to show that assistant 1002 understands the concepts in the user's input, not just the text;
    • to indicate the boundaries of assistant's 1002 understanding;
    • to guide the user to enter text that is required for the assumed task;
    • to help the user explore the space of possibilities in constrained selection;
    • to explain the current results obtained from services in terms of the user's stated criteria and assistant's 1002 assumptions (for example, to explain the results of under- and over-constrained requests).


For example, the following paraphrase and prompt illustrates several of these goals:

    • User input: indonesian food in menlo park
    • System interpretation:
    • Task=constrainedSelection
    • SelectionClass=restaurant
    • Constraints:
      • Location=Menlo Park, Calif.
      • Cuisine=Indonesian (known in ontology)
    • Results from Services: no strong matches
    • Paraphrase: Sorry, I can't find any Indonesian restaurants near Menlo Park.
    • Prompt: You could try other cuisines or locations.
    • Prompt under hypertext links:
    • Indonesian: You can try other food categories such as Chinese, or a favorite food item such as steak.
    • Menlo Park: Enter a location such as a city, neighborhood, street address, or “near” followed by a landmark.
    • Cuisines: Enter a food category such as Chinese or Pizza.
    • Locations: Enter a location: a city, zip code, or “near” followed by the name of a place.


In one embodiment, assistant 1002 responds to user input relatively quickly with the paraphrase. The paraphrase is then updated after results are known. For example, an initial response may be “Looking for Indonesian restaurants near Menlo Park . . . ” Once results are obtained, assistant 1002 would update the text to read, “Sorry, I can't find any Indonesian restaurants near Menlo Park. You could try other cuisines or locations.” Note that certain items are highlighted (indicated here by underline), indicating that those items represent constraints that can be relaxed or changed.


In one embodiment, special formatting/highlighting is used for key words in the paraphrase. This can be helpful to facilitate training of the user for interaction with intelligent automated assistant 1002, by indicating to the user which words are most important to, and more likely to be recognized by, assistant 1002. User may then be more likely to use such words in the future.


In one embodiment, paraphrase and prompt are generated using any relevant context data. For example, any of the following data items can be used, alone or in combination:

    • The parse—a tree of ontology nodes bound to their matching input tokens, with annotations and exceptions. For each node in the parse, this may include the node's metadata and/or any tokens in the input that provide evidence for the node's value.
    • The task, if known
    • The selection class.
    • The location constraint, independent of selection class.
    • Which required parameters are unknown for the given selection class (e.g., location is a required constraint on restaurants).
    • The name of a named entity in the parse that is an instance of the selection class, if there is one (e.g., a specific restaurant or movie name.)
    • Is this a follow-up refinement or the beginning of a conversation? (Reset starts a new conversation.)
    • Which constraints in the parse are bound to values in the input that changed their values? In other words, which constraints were just changed by the latest input?
    • Is the selection class inferred or directly stated?
    • Sorted by quality, relevance, or proximity?
    • For each constraint specified, how well was it matched?
    • Was refinement entered as text or clicking?


In one embodiment, the paraphrase algorithm accounts for the query, domain model 1056, and the service results. Domain model 1056 contains classes and features including metadata that is used to decide how to generate text. Examples of such metadata for paraphrase generation include:

    • OsConstraint={trueIfalse}
    • IsMultiValued={trueIfalse}
    • ConstraintType={EntityName, Location, Time, CategoryConstraint, AvailabilityConstraint, BinaryConstraint, SearchQualifier, Guessed-Qualifier}
    • DisplayName=string
    • DisplayTemplateSingular=string
    • DisplayTemplatePlural=string
    • Grammatical Role={AdjectiveBeforeNoun,Noun,ThatClauseModifer}


For example, a parse might contain these elements:

    • Class: Restaurant
    • IsConstraint=false
    • DisplayTemplateSingular=“restaurant”
    • DisplayTemplatePlural=“restaurants”
    • GrammaticalRole=Noun
    • Feature: RestaurantName (example: “Il Fornaio”)
    • IsConstraint=true
    • IsMultiValued=false
    • ConstraintType=EntityName
    • DisplayTemplateSingular=“named $1”
    • DisplayTemplatePlural=“named $1”
    • GrammaticalRole=Noun
    • Feature: RestaurantCuisine (example: “Chinese”)
    • IsConstraint=true
    • IsMultiValued=false
      • ConstraintType=CategoryConstraint
    • GrammaticalRole=AdjectiveBeforeNoun
    • Feature: RestaurantSubtype (example: “café”)
    • IsConstraint=true
    • IsMultiValued=false
    • ConstraintType=CategoryConstraint
    • DisplayTemplateSingular=“$1”
    • DisplayTemplatePlural=“$Is”
    • GrammaticalRole=Noun
    • Feature: RestaurantQualifiers (example: “romantic”)
    • IsConstraint=true
    • IsMultiValued=true
    • ConstraintType=SearchQualifier
    • DisplayTemplateSingular=“is described as $1”
    • DisplayTemplatePlural=“are described as $1”
    • DisplayTemplateCompact=“matching $1”
    • GrammaticalRole=Noun
    • Feature: FoodType (example: “burritos”)
    • IsConstraint=true
    • IsMultiValued=false
    • ConstraintType=SearchQualifier
    • DisplayTemplateSingular=“serves $1”
    • DisplayTemplatePlural=“serve $1′”
    • DisplayTemplateCompact=“serving $1”
    • GrammaticalRole=ThatClauseModifer
    • Feature: IsRecommended (example: true)
    • IsConstraint=true
    • IsMultiValued=false
    • ConstraintType=BinaryConstraint
    • DisplayTemplateSingular=“recommended”
    • DisplayTemplatePlural=“recommended”
    • GrammaticalRole=AdjectiveBeforeNoun
    • Feature: RestaurantGuessedQualifiers (example: “spectacular”)
    • IsConstraint=true
    • IsMultiValued=false
    • ConstraintType=GuessedQualifier
    • DisplayTemplateSingular=“matches $1 in reviews”
    • DisplayTemplatePlural=“match $1 in reviews”
    • DisplayTemplateCompact=“matching $1”
    • GrammaticalRole=ThatClauseModifer


In one embodiment, assistant 1002 is able to handle unmatched input. To handle such input, domain model 1056 can provide for nodes of type GuessedQualifier for each selection class, and rules that match otherwise unmatched words if they are in the right grammatical context. That is, GuessedQualifiers are treated as miscellaneous nodes in the parse which match when there are words that are not found in the ontology but which are in the right context to indicate that that are probably qualifiers of the selection class. The difference between GuessedQualifiers and SearchQualifiers is that the latter are matched to vocabulary in the ontology. This distinction allows us to paraphrase that assistant 1002 identified the intent solidly on the SearchQualifiers and can be more hesitant when echoing back the GuessedQualifiers.


In one embodiment, assistant 1002 performs the following steps when generating paraphrase text:

    • 1. If the task is unknown, explain what assistant 1002 can do and prompt for more input.
    • 2. If the task is a constrained selection task and the location is known, then explain the domains that assistant 1002 knows and prompt for the selection class.
    • 3. If the selection class is known but a required constraint is missing, then prompt for that constraint. (for example, location is required for constrained selection on restaurants)
    • 4. If the input contains an EntityName of the selection class, then output “looking up”<name> in <location>.
    • 5. If this is the initial request in a conversation, then output “looking for” followed by the complex noun phrase that describes the constraints.
    • 6. If this is a follow-up refinement step in the dialog,
      • a. If the user just completed a required input, then output “thanks” and then paraphrase normally. (This happens when there is a required constraint that is mapped to the user input.)
      • b. If the user is changing a constraint, acknowledge this and then paraphrase normally.
      • c. If the user typed in the proper name of an instance of the selection class, handle this specially.
      • d. If the user just added an unrecognized phrase, then indicate how it will be folded in as search. If appropriate, the input may be dispatched to a search service.
      • e. If the user is just adding a normal constraint, then output “OK”, and paraphrase normally.
    • 7. To explain results, use the same approach for paraphrase. However, when the results are surprising or unexpected, then explain the results using knowledge about the data and service. Also, when the query is over- or underconstrained, prompt for more input.


Grammar for Constructing Complex Noun Phrases

In one embodiment, when paraphrasing 734 a constrained selection task query, the foundation is a complex noun phrase around the selection class that refers to the current constraints. Each constraint has a grammatical position, based on its type. For example, in one embodiment, assistant 1002 may construct a paraphrase such as:

















recommended romantic Italian restaurants near Menlo Park



with open tables for 2 that serve osso buco and are described as “quiet”



A grammar to construct this is







<paraphraseNounClause> :== <binaryConstraint> <searchQualifier> <categoryConstraint>









<itemNoun> <locationConstraint> <availabiltyConstraint> <adjectivalClauses>







<binaryConstraint> :== single adjective that indicates the presence or absence of a









BinaryConstraint (e.g., recommended (best), affordable (cheap))



It is possible to list more than one in the same query.







<searchQualifier> :== a word or words that match the ontology for a qualifier of the selection









class, which would be passed into a search engine service. (e.g., romantic restaurants,



funny movies).



Use when ConstraintType= Search custom character  ualifier.







<categoryConstraint> :== an adjective that identifies the genre, cuisine, or category of the









selection class (e.g., Chinese restaurant or R-rated file). It is the last prefix adjective



because it is the most intrinsic. Use for features of type CategoryConstraint and



GrammaticalRole=AdjectiveBeforeNoun.







<itemNoun> :== <namedEntityPhrase> | <selectionClass> | <selectionClassSubType > find









the most specific way to display the noun. NamedEntity < SubType < Class







<selectionClass > :== a noun that is the generic name for the selection class (e.g., restaurant,









movie, place)







<selectionClassSubType> :== a noun phrase that is the subtype of the selection class if it is









known (e.g., diner, museum, store, bar for the selection class local business). Use for



features in which ConstraintType =CategoryConstraint and



GrammaticalRole=AdjectiveBeforeNoun.







<namedEntityPhrase> :== <entityName> |









“the” (<selection Class> | <selectionClassSubType>)







<entityName> :== the proper name of an instance of the selection class (e.g., “Il Fornaio”









“Animal House” “Harry's Bar”)







<locationConstraint> :== <locationPreposition> <locationName>


<locationPreposition> :== “in”, “near”, “at”, and the like


<locationName> :== city, street address, landmark, or something for OPS like “your current









location”







<availabilityConstraint> :== the availability constraint expressed as a prepositional phrase that









comes after the noun (e.g., “with open tables”, “with seats available”, “available online”).



It comes right after the noun to give it salience.







<adjectivalClauses>:== <modiferVerbPhrase > I “that” <modiferVerbPhrase> “and”









<modiferVerbPhrase>







<modiferVerbPhrase> := a verb phrase that expresses a search-keyword style constraint on the









selection class (e.g., restaurants that “are described as quiet”, “serve meat after 11”,



“match ‘tragically hip’ in reviews”; movies that “contain violence”, “star Billy Bob



Thornton”). Include all constraints in the parse whose



GrammaticalRole=ThatClauseModifer, using the “that...and” variant if there are more



than one. Use the DisplayTemplatePlural to generate the “that” clauses, putting the



GuessedQualifter last. If there is only one such constraint, use the



DisplayTemplateCompact variant.










Table 2 provides some examples of paraphrases that may be provided in response to the first input for a task, according to one embodiment.









TABLE 2







Paraphrases in response to first input








Input
Initial Paraphrase





tie house
Sorry, I don't understand “tie house.” I know



about restaurants, hotels, and other local




businesses, flights, weather, and buying things




online. What are you looking for, and where?


palo alto
I can help you find restaurants, businesses, events, and



things to do in Palo Alto. What are you looking for?


food
Looking for a place to eat? Where? (examples)


Italian food
I can tell you about Italian restaurants in your area.



Where would you like to eat?


burrito
I can help you find places that serve burritos in



your area. Where would you like to eat?


best mexican food
I can help you find good Mexican restaurants in



your area. Where are you?


restaurants in palo alto
Looking for restaurants near Palo Alto.


Italian palo alto
Looking for Italian restaurants near Palo Alto.


thai food in menlo park
Looking for Thai restaurants near Menlo Park


Indonesian food in menlo park
Looking for Indonesian restaurants near Menlo Park


best mexican food in Palo Alto
Looking for recommendedMexican restaurants



near Palo Alto.


fast food menlo park
Looking for fast food restaurants near Menlo Park


healthy food in menlo park
Looking for places near Menlo Park that serve




healthy food.



dive bar in menlo park
Looking for dive bars near Menlo Park.


pool room in menlo park
Looking for pool rooms near Menlo Park.


hookah room in menlo park
Looking for places near Menlo Park described as



“hookah room”.


spicy food in sf
Looking for places near Menlo Park that serve




spicy food.



burgers in Menlo park
Looking for places near Menlo Park that serve




burgers.



belly dancing place in sf
Looking for places near San Francisco described



as “belly dancing”.


belly dancing place in menlo park
Looking for places near Menlo Park described as



“belly dancing”.


juke joint in sf
Looking for joints near San Francisco described as



“juke”.


tie house Menlo park
Looking for places near Menlo Park described as



“tie house”.


thai house palo alto
Looking up Thai House in Palo Alto


ii fornaio menlo park
Looking up Il Fornaio in Palo Alto


ii fornao in Menlo park
Looking for places near Palo Alto described as



“il fornao”.


cliff house in Menlo park
Looking up Cliff House in Palo Alto


romantic restaurant in palo alto
Looking for romantic restaurants in Palo Alto


romantic restaurant in palo alto
Looking for romantic restaurants in Palo Alto


quiet romantic restaurant in palo alto
Looking for romantic restaurants in Palo Alto



described as “quiet”


quiet romantic restaurant in palo alto
Looking for romantic restaurants in Palo Alto



described as “quiet


tragically hip restaurant in palo alto
Looking for restaurants in Palo Alto described as



“tragically hip”


tragically hip restaurant in palo alto
Looking for restaurants in Palo Alto described as



“tragically hip”


table for two tonight in palo alto
Checking availability for tonight at restaurants



near Palo Alto.


table for two italian food tonight in
Checking availability for tonight at Italian


Palo alto
restaurants near Palo Alto.


il fornaio palo alto 6 pm for 2
Checking availability for tables tonight at




Il Fornaio in Palo Alto.



table for 2 at thai house in PA
Checking availability for tables tonight at Thai




House in Palo Alto.



Pizza delivery in menlo park



I want the best quiet romantic
OK, looking for recommendedromanticItalian


italian restaurant for osso buco in
restaurants near Menlo Park that serve osso buco


or near menlo park
and are described as “quiet”.


Book me a table for 2 at the best
OK, looking for recommendedromanticitalian


quiet romantic italian restaurant for
restaurants near Menlo Parkwith open tables for 2


osso buco in or near menlo park
that serve osso buco and are described as “quiet”.










Refining a Query about Places to Eat


Table 3 provides some examples of paraphrases in response to a situation where user's intent to find a place to eat is known, but they have not selected a particular place to eat. They are facing a list of restaurants, and they provide refinements.









TABLE 3





Paraphrases in response to refinements


Refinements
















menlo park
Thanks, now looking for restaurants in


(was un-known)

Menlo Park.



cheapest
OK, looking for affordable restaurants near




Menlo Park.



Chinese
OK, changing cuisine to Chinese. Looking for


(was italian)

Chinese restaurants near





Menlo Park



pizza (adding
OK, looking for Italian restaurants near


food item)

Menlo Park that serve pizza.



san francisco
OK, changing location to San Francisco. Looking


(was menlo park)
for Italian restaurants near San Francisco that



serve pizza.


tragically hip
OK, I'll search reviews for “tragically hip”.


quiet romantic
OK. looking for romantic restaurants in Palo Alto



described as “quiet”


cliff house
Cliff House sounds familiar. I'll look it up



in Palo Alto.









Table 4 provides some examples of results summaries that are provided once results are obtained.









TABLE 4







Results Summaries









Input
#Results
Results Summary





tie house
N/A
N/A (no call to services)


palo alto
N/A
N/A (no call to services)


food
N/A
N/A (no call to services)


Italian food
N/A
N/A (no call to services)


burrito
N/A
N/A (no call to services)


best mexican food
N/A
N/A (no call to services)


restaurants palo alto
many
Here are some recommended restaurants




near Palo Alto.




Do you prefer any particular food type?




Would you like a reservation?


Italian palo alto
some
Here are some Italian restaurants near Palo Alto.




To reserve a table, click on available times.


thai food in menlo park
some
Here are some Thai restaurants near Menlo Park.




To reserve a table, click on available times.


indonesian food in menlo
0
Sorry I can't find any Indonesian restaurants near


park


Menlo Park. You could try other cuisines or






locations.



best mexican food in Palo
some
Here are some recommendedMexican restaurants


Alto

near Palo Alto.


fast food menlo park
some
OK, here are some fast food restaurants




near Menlo Park.


healthy food in menlo
some
Here are some places near Menlo Park that might


park

sene healthy food, based on reviews.


dive bar in menlo park
some
Here are some bars near Menlo Park. I don't see




anything specific to “dive bars,” Are there other




ways of saying it?


pool room in menlo park
some
Here are some places in Menlo Park that are




described as pool rooms. You can add other words




to describe what you want.


hookah room in menlo
0
I can't find places Menlo Park matching “hookah


park

room”. Interested in restaurants, hotels,




or localbusinesses?


spicy food in sf
weak
Here are some places to eat in San Francisco. I



match
don't know which serve spicy food. Could it go by




another name?


burgers in Menlo park
some
You might find burgers at these places to eat near





Menlo Park.



belly dancing place in sf
some
Here are some places in Menlo Park that are




described as “belly dancing”. You can add other




words to describe what you want


belly dancing place in
0
I can help you find restaurants, businesses, events,


menlo park

and things to do in San Francisco, What are some




other words for “belly dancing place”?


juke joint in sf
0
I can help you find restaurants, businesses, events,




and things to do in San Francisco. What are some




other words for “juke joint”?


tie house Menlo park
0
Sorry, I don't know about “tie house” in Menlo





Park. Any other names for it?



thai house palo alto
1
Got it: Thai House restaurant in Palo Alto, CA.




Want to reserve a table? When and for how many?


il fornaio menlo park
weak
There is a Il Fornaio in Palo Alto, which is near



match
Menlo Park.


il fornao in Menlo park
spell
Did you mean Il Fornaio in Palo Alto? If not, try



match
different words.


cliff house in Menlo park
0
I couldn't find Cliff House in Palo Alto. Could it




go by different name or be in a different city?


romantic restaurant in
some
Here are some restaurants near Palo Alto that are


palo alto

described in reviews as romantic.


romantic restaurant in
0
Here are restaurants near Palo Alto. Searching


palo alto

reviews did not find any described as romantic.




Any other preferences?


quiet romantic restaurant
some
Here are some restaurants near Palo Alto that match


in palo alto

“quiet romantic” in reviews.


quiet romantic restaurant
0
Here are some restaurants near Palo Alto.


in palo alto

Searching reviews did find any matching “quiet




romantic”. Any other preferences?


tragically hip restaurant
some
Here are some restaurants near Palo Alto that match


in palo alto

“tragically hip” in reviews.


tragically hip restaurant
0
Here are some restaurants near Palo Alto.


in palo alto

Searching reviews did not find any matching




“tragically hip”. Any other preferences?


table for two italian food
some
Here are restaurants with open tables from 6pm to


tonight in palo alto


8pm tonight for a party of two





in Palo Alto, CA,


table for two italian food
some
Here are restaurants with open tables from 6pm to


tonight in palo alto


8pm tonight for a party of two





in Palo Alto, CA.


il fornaio palo alto 6pm
1
Here are table options at Il Fornaio restaurant in


for 2


Palo Alto, CA at 6pm today for





a party of 2.


table for 2 at thai house
1
Here is information for Thai House in Palo Alto,


in PA


CA. You can call them at the phone number listed.



pizza delivery in menlo

Here are places that serve pizza in menlo park. I do


park

not have delivery options at this time. Click on




restaurant phone number to call for delivery.


I want the best quiet
weak
Here are the best matches for recommended


romantic italian
match,

romantic italian restaurant near Menlo Park that



restaurant for osso buco
soiled by
serve osso buco and are described as “quiet”. Click


in or near menlo park
availability
on available times to reserve a table.


Book me a table for 2 at
weak
Here are the best matches for recommended


the best quiet romantic
match,

romantic italian restaurants near Menlo Park with



italian restaurant for osso
sorted by

open tables for 2 that serve osso buco and are



buco in or near menlo
availability
described as “quiet”. Click on available times to


park

reserve a table.


refinements




menlo park (was un-
some
Here are some recommended restaurants near


known)


Menlo Park. Do you prefer any particular food type?



cheapest
some
I found 4 affordable restaurants near Menlo Park.


Chinese (was Italian)
some
I found 4 Chinese restaurants near Menlo Park.


pizza (adding food item)
some
I found 4 Italian restaurants near Menlo Park that




serve pizza.


san Francisco (was menlo
some
I found 4 Italian restaurants near San Francisco.


park)




tragically hip
some
I found 4 restaurants near Palo Alto that match




“tragically hip” in reviews.


quiet romantic
some
Here are some restaurants near Palo Alto that match




“quiet romantic” in reviews.


cliff house
0
I couldn't find Cliff House in Palo Alto. Could it




go by a different name or be in a different city?









Table 5 provides some examples of prompts that are provided when users click on active links.


Prompts when Users Click on Active Links









TABLE 5







Prompts when users click on active links









Anchor Text
Prompt Text
Notes





Location, where
Enter a location: a city, zip code, or
This prompt might be used when



“near” followed by the name of a
the user has not specified a



place.
location yet


Palo Alto
Enter a location such as a city,
This prompt might be used when



neighborhood, street address, or
the user is changing locations.



“near” followed by a landmark.



food type
Enter a food category such as
Merge food type and cuisine can



Chinese or Pizza.
be merged


Italian
You can try other food categories
User already said Italian.



such as Chinese, or a favorite food
Assistant 1002 is helping the



item such as stake.
user explore alter-natives. If it is




a food item, if dominates over




cuisine.


reservation
Enter the day and time to reserve a
Prompting for a reservation



table, such as “tomorrow at 8”.



healthy food
You can also enter menu items or
Known food type



cuisines



spicy food
You can also enter menu items or
Unknown food type



cuisines



restaurants
What kind of restaurant? (e.g.,
Clicking on the restaurants link



Chinese, Pizza)
should insert the wood




“restaurant” on the end of the




text input.


businesses
You can find local florists, ATMs,
Clicking on the businesses link



doctors, drug stores, and the like
should add to the machine



What kind of business are you
readable tag that this is a local



looking for?
search


events
You can discover upcoming




converts, shows and the like What




interests you?



things to do
Music, art, theater, sports, and the




like What kind of thing would you




like to do in this area?



hotels
I can help you find an available




hotel room. Any preferences for




amenities or location?



weather
Enter a city, and I'll tell you what
If location is known, just show



the weather is like there.
the weather data


buying things
I can help you find music, movies,




books, electronics, toys and more -




and buy it from Amazon. What are




you looking for?









Suggesting Possible Responses in a Dialog

In one embodiment, assistant 1002 provides contextual suggestions. Suggestions a way for assistant 1002 to offer the user options to move forward from his or her current situation in the dialog. The set of suggestions offered by assistant 1002 depends on context, and the number of suggestions offered may depend on the medium and form factor. For example, in one embodiment, the most salient suggestions may be offered in line in the dialog, an extended list of suggestions (“more”) may be offered in a scrollable menu, and even more suggestions are reachable by typing a few characters and picking from autocomplete options. One skilled in the art will recognize that other mechanisms may be used for providing suggestions.


In various embodiments, different types of suggestions may be provided. Examples of suggestion types include:

    • options to refine a query, including adding or removing or changing constraint values;
    • options to repair or recover from bad situations, such as “not what I mean” or “start over” or “search the web”;
    • options to disambiguate among;
    • interpretations of speech;
    • interpretations of text, including spell correction and semantic ambiGUIty;
    • context-specific commands, such as “show these on a map” or “send directions to my date” or “explain these results”;
    • suggested cross-selling offers, such as next steps in meal or event planning scenarios;
    • options to reuse previous commands, or parts of them.


In various embodiments, the context that determines the most relevant suggestions may be derived from, for example:

    • dialog state
    • user state, including, for example:
      • static properties (name, home address, etc)
      • dynamic properties (location, time, network speed)
    • interaction history, including, for example:
      • query history
      • results history
      • the text that has been entered so far into autocomplete.


In various embodiments, suggestions may be generated by any mechanism, such as for example:

    • paraphrasing a domain, task, or constraint based on the ontology model;
    • prompting in autocomplete based on the current domain and constraints;
    • paraphrasing ambiguous alternative interpretations;
    • alternative interpretations of speech-to-text;
    • hand authoring, based on special dialog conditions.


According to one embodiment, suggestions are generated as operations on commands in some state of completion. Commands are explicit, canonical representations of requests, including assumptions and inferences, based on attempted interpretations on user input. In situations where the user input is incomplete or ambiguous, suggestions are an attempt to help the user adjust the input to clarify the command.


In one embodiment, each command is an imperative sentence having some combination of a

    • command verb (imperative such as “find” or “where is”);
    • domain (selection class such as “restaurants”);
    • constraint(s) such as location=Palo Alto and cuisine=Italian.


These parts of a command (verb, domain, constraints) correspond to nodes in the ontology.


A suggestion, then, may be thought of as operations on a command, such as setting it, changing it, or declaring that it is relevant or not relevant. Examples include:

    • setting a command verb or domain (“find restaurants”)
    • changing a command verb (“book it”, “map it”, “save it”)
    • changing a domain (“looking for a restaurant, not a local business”)
    • stating that a constraint is relevant (“try refining by cuisine”)
    • choosing a value for a constraint (“Italian”, “French”, and the like)
    • choosing a constraint and value together (“near here”, “tables for 2”)
    • stating that a constraint value is wrong (“not that Boston”)
    • stating that a constraint is not relevant (“ignore the expense”)
    • stating the intent to change a constraint value (“try a different location”)
    • changing a constraint value (“Italian, not Chinese”)
    • adding to a constraint value (“and with a pool, too”)
    • snapping a value to grid (“Los Angeles, not los angelos”)
    • initiating a new command, reusing context ([after movies] “find nearby restaurants”, “send directions to my friend”)
    • initiating a command that is “meta” to context (“explain these results”)
    • initiating a new command, resetting or ignoring context (“start over”, “help with speech”)


A suggestion may also involve some combination of the above. For example:

    • “the movie Milk not [restaurants serving] the food item milk”
    • “restaurants serving pizza, not just pizza joints”
    • “The place called Costco in Mountain View, I don't care whether you think it is a restaurant or local business”
    • “Chinese in mountain view” [a recent query]


In one embodiment, assistant 1002 includes a general mechanism to maintain a list of suggestions, ordered by relevance. The format in which a suggestion is offered may differ depending on current context, mode, and form factor of the device.


In one embodiment, assistant 1002 determines which constraints to modify by considering any or all of the following factors:

    • Consider whether the constraint has a value;
    • Consider whether the constraint was inferred or explicitly stated;
    • Consider its salience (suggestionIndex).


In one embodiment, assistant 1002 determines an output format for the suggestion. Examples of output formats include:

    • change domain:
      • if autocomplete option “find restaurants”, then “try something different”
      • else [was inferred] “not looking for restaurants”
    • change name constraint:
      • if name was inferred, offer alterative ambiguous interpretation”
      • stuff into autocomplete the entity names from current results
      • different name
      • consider that it wasn't a name lookup (remove constraint)—maybe offer category in place of it
    • “not named”
    • “not in Berkeley”
    • “some other day”
    • not that sense of (use ambiguity alternatives)
    • inferred date: “any day, I don't need a reservation”


In one embodiment, assistant 1002 attempts to resolve ambiguities via suggestions. For example, if the set of current interpretations of user intent is too ambiguous 310, then suggestions are one way to prompt for more information 322. In one embodiment, for constrained selection tasks, assistant 1002 factors out common constraints among ambiguous interpretations of intent 290 and presents the differences among them to the user. For example, if the user input includes the word “café” and this word could match the name of a restaurant or the type of restaurant, then assistant 102 can ask “did you mean restaurants named ‘café’ or ‘café restaurants’?”


In one embodiment, assistant 1002 infers constraints under certain situations. That is, for constrained selection tasks, not all constraints need be mentioned explicitly in the user input; some can be inferred from other information available in active ontology 1050, short term memory 1052, and/or other sources of information available to assistant 1002. For example:

    • Inferring domain or location
    • Default assumption, like location
    • Weakly matched constraint (fuzzy, low salience location, etc)
    • Ambiguous criteria (match to constraint value without prefix (name vs. category, often ambiguous)


In cases where the assistant 1002 infers constraint values, it may also offer these assumptions as suggestions for the user to overrule. For example, it might tell the user “I assumed you meant around here. Would you like to look at a different location?”


The present invention has been described in particular detail with respect to possible embodiments. Those of skill in the art will appreciate that the invention may be practiced in other embodiments. First, the particular naming of the components, capitalization of terms, the attributes, data structures, or any other programming or structural aspect is not mandatory or significant, and the mechanisms that implement the invention or its features may have different names, formats, or protocols. Further, the system may be implemented via a combination of hardware and software, as described, or entirely in hardware elements, or entirely in software elements. Also, the particular division of functionality between the various system components described herein is merely exemplary, and not mandatory; functions performed by a single system component may instead be performed by multiple components, and functions performed by multiple components may instead be performed by a single component.


In various embodiments, the present invention can be implemented as a system or a method for performing the above-described techniques, either singly or in any combination. In another embodiment, the present invention can be implemented as a computer program product comprising a nontransitory computer-readable storage medium and computer program code, encoded on the medium, for causing a processor in a computing device or other electronic device to perform the above-described techniques.


Reference in the specification to “one embodiment” or to “an embodiment” means that a particular feature, structure, or characteristic described in connection with the embodiments is included in at least one embodiment of the invention. The appearances of the phrase “in one embodiment” in various places in the specification are not necessarily all referring to the same embodiment.


Some portions of the above are presented in terms of algorithms and symbolic representations of operations on data bits within a memory of a computing device. These algorithmic descriptions and representations are the means used by those skilled in the data processing arts to most effectively convey the substance of their work to others skilled in the art. An algorithm is here, and generally, conceived to be a self-consistent sequence of steps (instructions) leading to a desired result. The steps are those requiring physical manipulations of physical quantities. Usually, though not necessarily, these quantities take the form of electrical, magnetic or optical signals capable of being stored, transferred, combined, compared and otherwise manipulated. It is convenient at times, principally for reasons of common usage, to refer to these signals as bits, values, elements, symbols, characters, terms, numbers, or the like. Furthermore, it is also convenient at times, to refer to certain arrangements of steps requiring physical manipulations of physical quantities as modules or code devices, without loss of generality.


It should be borne in mind, however, that all of these and similar terms are to be associated with the appropriate physical quantities and are merely convenient labels applied to these quantities. Unless specifically stated otherwise as apparent from the following discussion, it is appreciated that throughout the description, discussions utilizing terms such as “processing” or “computing” or “calculating” or “displaying” or “determining” or the like, refer to the action and processes of a computer system, or similar electronic computing module and/or device, that manipulates and transforms data represented as physical (electronic) quantities within the computer system memories or registers or other such information storage, transmission or display devices.


Certain aspects of the present invention include process steps and instructions described herein in the form of an algorithm. It should be noted that the process steps and instructions of the present invention can be embodied in software, firmware and/or hardware, and when embodied in software, can be downloaded to reside on and be operated from different platforms used by a variety of operating systems.


The present invention also relates to an apparatus for performing the operations herein. This apparatus may be specially constructed for the required purposes, or it may comprise a general-purpose computing device selectively activated or reconfigured by a computer program stored in the computing device. Such a computer program may be stored in a computer readable storage medium, such as, but is not limited to, any type of disk including floppy disks, optical disks, CD-ROMs, magnetic-optical disks, read-only memories (ROMs), random access memories (RAMs), EPROMs, EEPROMs, magnetic or optical cards, application specific integrated circuits (ASICs), or any type of media suitable for storing electronic instructions, and each coupled to a computer system bus. Further, the computing devices referred to herein may include a single processor or may be architectures employing multiple processor designs for increased computing capability.


The algorithms and displays presented herein are not inherently related to any particular computing device, virtualized system, or other apparatus. Various general-purpose systems may also be used with programs in accordance with the teachings herein, or it may prove convenient to construct more specialized apparatus to perform the required method steps. The required structure for a variety of these systems will be apparent from the description provided herein. In addition, the present invention is not described with reference to any particular programming language. It will be appreciated that a variety of programming languages may be used to implement the teachings of the present invention as described herein, and any references above to specific languages are provided for disclosure of enablement and best mode of the present invention.


Accordingly, in various embodiments, the present invention can be implemented as software, hardware, and/or other elements for controlling a computer system, computing device, or other electronic device, or any combination or plurality thereof. Such an electronic device can include, for example, a processor, an input device (such as a keyboard, mouse, touchpad, trackpad, joy-stick, trackball, microphone, and/or any combination thereof), an output device (such as a screen, speaker, and/or the like), memory, long-term storage (such as magnetic storage, optical storage, and/or the like), and/or network connectivity, according to techniques that are well known in the art. Such an electronic device may be portable or nonportable. Examples of electronic devices that may be used for implementing the invention include: a mobile phone, personal digital assistant, smartphone, kiosk, desktop computer, laptop computer, tablet computer, consumer electronic device, consumer entertainment device; music player; camera; television; set-top box; electronic gaming unit; or the like. An electronic device for implementing the present invention may use any operating system such as, for example, iOS or MacOS, available from Apple Inc. of Cupertino, Calif., or any other operating system that is adapted for use on the device.


While the invention has been described with respect to a limited number of embodiments, those skilled in the art, having benefit of the above description, will appreciate that other embodiments may be devised which do not depart from the scope of the present invention as described herein. In addition, it should be noted that the language used in the specification has been principally selected for readability and instructional purposes, and may not have been selected to delineate or circumscribe the inventive subject matter. Accordingly, the disclosure of the present invention is intended to be illustrative, but not limiting, of the scope of the invention, which is set forth in the claims.

Claims
  • 1. An electronic device, comprising: one or more processors;a memory; andone or more programs, wherein the one or more programs are stored in the memory and configured to be executed by the one or more processors, the one or more programs including instructions for: receiving input from a user;determining an intent corresponding to the received input;performing a first task based on the determined intent;providing a first output associated with the performed task;in accordance with a detection of a user selection corresponding to the first output: providing a second output including at least one additional task corresponding to the performed task; andin accordance with a detection that no user selection corresponding to the first output has occurred: providing a third output including at least one option to select a task parameter associated with the first task.
  • 2. The device of claim 1, the one or more programs further including instructions for: receiving a second input from the user, wherein the second input corresponds to a selection of a task from the at least one provided additional task; andperforming a second task based on the second input.
  • 3. The device of claim 1, wherein the at least one additional task includes an interaction with a remote source over a network connection.
  • 4. The device of claim 1, wherein the at least one additional task includes an interaction with information stored on the electronic device.
  • 5. The device of claim 1, wherein the at least one additional task includes a task to save information corresponding to the first task.
  • 6. The device of claim 1, wherein the at least one additional task includes a task to send information to another user, wherein the information corresponds to the first task.
  • 7. The device of claim 1, wherein the at least one additional task includes a task to display map information corresponding to the first task.
  • 8. The device of claim 1, wherein the at least one additional task includes a task to initiate a phone call to a contact associated with the first task.
  • 9. The device of claim 1, wherein the at least one additional task includes a task to set an alarm associated with the first task.
  • 10. The device of claim 1, wherein the at least one additional task includes a task to initiate a reservation procedure associated with the first task.
  • 11. The device of claim 1, wherein the at least one additional task includes a task to create a note file associated with the first task.
  • 12. The device of claim 1, wherein the second output includes an audible representation of at least one additional task corresponding to the performed task.
  • 13. The device of claim 1, the one or more programs further including instructions for: receiving a second user input including a speech input; anddetermining a user intent of the second speech input based on the second output including at least one additional task corresponding to the performed task.
  • 14. The device of claim 1, wherein at least one of the first task and the at least one additional task includes performing a task on a secondary device.
  • 15. The device of claim 1, wherein the task parameter is associated with a domain corresponding to the first task.
  • 16. The device of claim 1, wherein determining an intent corresponding to the received input comprises: obtaining context information including a history of interactions between the user and the electronic device; anddetermining the intent based on the context information.
  • 17. The device of claim 16, the one or more programs further including instructions for: prior to receiving the input from the user, receiving a speech input from the user within a predetermined time of the received input; andprocessing the received speech input to obtain the context information.
  • 18. The device of claim 16, the one or more programs further including instructions for: prior to receiving the input from the user, receiving a non-speech input from the user within a predetermined time of the received input; andprocessing the received non-speech input to obtain the context information.
  • 19. A non-transitory computer readable storage medium storing one or more programs, the one or more programs comprising instructions, which when executed by one or more processors of an electronic device, cause the device to: receive input from a user;determine an intent corresponding to the received input;perform a first task based on the determined intent;provide a first output associated with the performed task;in accordance with a detection of a user selection corresponding to the first output: provide a second output including at least one additional task corresponding to the performed task; andin accordance with a detection that no user selection corresponding to the first output has occurred: provide a third output including at least one option to select a task parameter associated with the first task.
  • 20. The computer readable storage medium of claim 19, wherein the one or more programs cause the device to: receive a second input from the user, wherein the second input corresponds to a selection of a task from the at least one provided additional task; andperform a second task based on the second input.
  • 21. The computer readable storage medium of claim 19, wherein the at least one additional task includes an interaction with a remote source over a network connection.
  • 22. The computer readable storage medium of claim 19, wherein the at least one additional task includes an interaction with information stored on the electronic device.
  • 23. The computer readable storage medium of claim 19, wherein the at least one additional task includes a task to save information corresponding to the first task.
  • 24. The computer readable storage medium of claim 19, wherein the at least one additional task includes a task to send information to another user, wherein the information corresponds to the first task.
  • 25. The computer readable storage medium of claim 19, wherein the at least one additional task includes a task to display map information corresponding to the first task.
  • 26. The computer readable storage medium of claim 19, wherein the at least one additional task includes a task to initiate a phone call to a contact associated with the first task.
  • 27. The computer readable storage medium of claim 19, wherein the at least one additional task includes a task to set an alarm associated with the first task.
  • 28. The computer readable storage medium of claim 19, wherein the at least one additional task includes a task to initiate a reservation procedure associated with the first task.
  • 29. The computer readable storage medium of claim 19, wherein the at least one additional task includes a task to create a note file associated with the first task.
  • 30. The computer readable storage medium of claim 19, wherein the second output includes an audible representation of at least one additional task corresponding to the performed task.
  • 31. The computer readable storage medium of claim 19, wherein the one or more programs cause the device to: receive a second user input including a speech input; anddetermine a user intent of the second speech input based on the second output including at least one additional task corresponding to the performed task.
  • 32. The computer readable storage medium of claim 19, wherein at least one of the first task and the at least one additional task includes performing a task on a secondary device.
  • 33. The computer readable storage medium of claim 19, wherein the task parameter is associated with a domain corresponding to the first task.
  • 34. The computer readable storage medium of claim 19, wherein determining an intent corresponding to the received input comprises: obtaining context information including a history of interactions between the user and the electronic device; anddetermining the intent based on the context information.
  • 35. The computer readable storage medium of claim 34, wherein the one or more programs cause the device to: prior to receiving the input from the user, receiving a speech input from the user within a predetermined time of the received input; andprocessing the received speech input to obtain the context information.
  • 36. The computer readable storage medium of claim 34, wherein the one or more programs cause the device to: prior to receiving the input from the user, receiving a non-speech input from the user within a predetermined time of the received input; andprocessing the received non-speech input to obtain the context information.
  • 37. A computer-implemented method, comprising: at an electronic device with one or more processors and memory: receiving input from a user;determining an intent corresponding to the received input;performing a first task based on the determined intent;providing a first output associated with the performed task;in accordance with a detection of a user selection corresponding to the first output: providing a second output including at least one additional task corresponding to the performed task; andin accordance with a detection that no user selection corresponding to the first output has occurred: providing a third output including at least one option to select a task parameter associated with the first task.
  • 38. The method of claim 37, comprising: receiving a second input from the user, wherein the second input corresponds to a selection of a task from the at least one provided additional task; andperforming a second task based on the second input.
  • 39. The method of claim 37, wherein the at least one additional task includes an interaction with a remote source over a network connection.
  • 40. The method of claim 37, wherein the at least one additional task includes an interaction with information stored on the electronic device.
  • 41. The method of claim 37, wherein the at least one additional task includes a task to save information corresponding to the first task.
  • 42. The method of claim 37, wherein the at least one additional task includes a task to send information to another user, wherein the information corresponds to the first task.
  • 43. The method of claim 37, wherein the at least one additional task includes a task to display map information corresponding to the first task.
  • 44. The method of claim 37, wherein the at least one additional task includes a task to initiate a phone call to a contact associated with the first task.
  • 45. The method of claim 37, wherein the at least one additional task includes a task to set an alarm associated with the first task.
  • 46. The method of claim 37, wherein the at least one additional task includes a task to initiate a reservation procedure associated with the first task.
  • 47. The method of claim 37, wherein the at least one additional task includes a task to create a note file associated with the first task.
  • 48. The method of claim 37, wherein the second output includes an audible representation of at least one additional task corresponding to the performed task.
  • 49. The method of claim 37, comprising: receiving a second user input including a speech input; anddetermining a user intent of the second speech input based on the second output including at least one additional task corresponding to the performed task.
  • 50. The method of claim 37, wherein at least one of the first task and the at least one additional task includes performing a task on a secondary device.
  • 51. The method of claim 37, wherein the task parameter is associated with a domain corresponding to the first task.
  • 52. The method of claim 37, wherein determining an intent corresponding to the received input comprises: obtaining context information including a history of interactions between the user and the electronic device; anddetermining the intent based on the context information.
  • 53. The method of claim 52, comprising: prior to receiving the input from the user, receiving a speech input from the user within a predetermined time of the received input; andprocessing the received speech input to obtain the context information.
  • 54. The method of claim 52, comprising: prior to receiving the input from the user, receiving a non-speech input from the user within a predetermined time of the received input; andprocessing the received non-speech input to obtain the context information.
CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. application Ser. No. 15/394,162, entitled “Task Flow Identification Based on User Intent,” filed Dec. 29, 2016 (now granted as U.S. Pat. No. 10,706,841), which is a continuation of U.S. application Ser. No. 13/492,809, entitled “Intelligent Automated Assistant,” filed Jun. 9, 2012 (now granted as U.S. Pat. No. 9,548,050), which is a continuation of U.S. application Ser. No. 12/987,982, entitled “Intelligent Automated Assistant,” filed Jan. 10, 2011 (now granted as U.S. Pat. No. 9,318,108), which claims the benefit of U.S. Provisional Patent Application Ser. No. 61/295,774, entitled “Intelligent Automated Assistant”, filed Jan. 18, 2010, each of which are hereby incorporated by reference in their entirety for all purposes. This application is further related to U.S. patent application Ser. No. 11/518,292 for “Method and Apparatus for Building an Intelligent Automated Assistant”, filed Sep. 8, 2006, which is incorporated herein by reference. This application is further related to U.S. Provisional Patent Application Ser. No. 61/186,414 for “System and Method for Semantic Auto-Completion”, filed Jun. 12, 2009, which is incorporated herein by reference.

US Referenced Citations (6429)
Number Name Date Kind
1559320 Hirsh Oct 1925 A
2180522 Henne Nov 1939 A
2495222 Bierig Jan 1950 A
3704345 Coker et al. Nov 1972 A
3710321 Rubenstein Jan 1973 A
3787542 Gallagher et al. Jan 1974 A
3828132 Flanagan et al. Aug 1974 A
3979557 Schulman et al. Sep 1976 A
4013085 Wright Mar 1977 A
4081631 Feder Mar 1978 A
4090216 Constable May 1978 A
4107784 Van Bemmelen Aug 1978 A
4108211 Tanaka Aug 1978 A
4159536 Kehoe et al. Jun 1979 A
4181821 Pirz et al. Jan 1980 A
4204089 Key et al. May 1980 A
4241286 Gordon Dec 1980 A
4253477 Eichman Mar 1981 A
4278838 Antonov Jul 1981 A
4282405 Taguchi Aug 1981 A
4310721 Manley et al. Jan 1982 A
4332464 Bartulis et al. Jun 1982 A
4348553 Baker et al. Sep 1982 A
4384169 Mozer et al. May 1983 A
4386345 Narveson et al. May 1983 A
4433377 Eustis et al. Feb 1984 A
4451849 Fuhrer May 1984 A
4485439 Rothstein Nov 1984 A
4495644 Parks et al. Jan 1985 A
4513379 Wilson et al. Apr 1985 A
4513435 Sakoe et al. Apr 1985 A
4555775 Pike Nov 1985 A
4577343 Oura Mar 1986 A
4586158 Brandle Apr 1986 A
4587670 Levinson et al. May 1986 A
4589022 Prince et al. May 1986 A
4611346 Bednar et al. Sep 1986 A
4615081 Lindahl Oct 1986 A
4618984 Das et al. Oct 1986 A
4642790 Minshull et al. Feb 1987 A
4653021 Takagi Mar 1987 A
4654875 Srihari et al. Mar 1987 A
4655233 Laughlin Apr 1987 A
4658425 Julstrom Apr 1987 A
4670848 Schramm Jun 1987 A
4677570 Taki Jun 1987 A
4680429 Murdock et al. Jul 1987 A
4680805 Scott Jul 1987 A
4686522 Hernandez et al. Aug 1987 A
4688195 Thompson et al. Aug 1987 A
4692941 Jacks et al. Sep 1987 A
4698625 McCaskill et al. Oct 1987 A
4709390 Atal et al. Nov 1987 A
4713775 Scott et al. Dec 1987 A
4718094 Bahl et al. Jan 1988 A
4724542 Williford Feb 1988 A
4726065 Froessl Feb 1988 A
4727354 Lindsay Feb 1988 A
RE32632 Atkinson Mar 1988 E
4736296 Katayama et al. Apr 1988 A
4750122 Kaji et al. Jun 1988 A
4754489 Bokser Jun 1988 A
4755811 Slavin et al. Jul 1988 A
4759070 Voroba et al. Jul 1988 A
4776016 Hansen Oct 1988 A
4783804 Juang et al. Nov 1988 A
4783807 Marley Nov 1988 A
4785413 Atsumi Nov 1988 A
4790028 Ramage Dec 1988 A
4797930 Goudie Jan 1989 A
4802223 Lin et al. Jan 1989 A
4803729 Baker Feb 1989 A
4807752 Chodorow Feb 1989 A
4811243 Racine Mar 1989 A
4813074 Marcus Mar 1989 A
4819271 Bahl et al. Apr 1989 A
4827518 Feustel et al. May 1989 A
4827520 Zeinstra May 1989 A
4829576 Porter May 1989 A
4829583 Monroe et al. May 1989 A
4831551 Schalk et al. May 1989 A
4833712 Bahl et al. May 1989 A
4833718 Sprague May 1989 A
4837798 Cohen et al. Jun 1989 A
4837831 Gillick et al. Jun 1989 A
4839853 Deerwester et al. Jun 1989 A
4852168 Sprague Jul 1989 A
4862504 Nomura Aug 1989 A
4875187 Smith Oct 1989 A
4878230 Murakami et al. Oct 1989 A
4887212 Zamora et al. Dec 1989 A
4896359 Yamamoto et al. Jan 1990 A
4903305 Gillick et al. Feb 1990 A
4905163 Garber et al. Feb 1990 A
4908867 Silverman Mar 1990 A
4914586 Swinehart et al. Apr 1990 A
4914590 Loatman et al. Apr 1990 A
4914704 Cole et al. Apr 1990 A
4918723 Iggulden et al. Apr 1990 A
4926491 Maeda et al. May 1990 A
4928307 Lynn May 1990 A
4931783 Atkinson Jun 1990 A
4935954 Thompson et al. Jun 1990 A
4939639 Lee et al. Jul 1990 A
4941488 Marxer et al. Jul 1990 A
4944013 Gouvianakis et al. Jul 1990 A
4945504 Nakama et al. Jul 1990 A
4953106 Gansner et al. Aug 1990 A
4955047 Morganstein et al. Sep 1990 A
4965763 Zamora Oct 1990 A
4972462 Shibata Nov 1990 A
4974191 Amirghodsi et al. Nov 1990 A
4975975 Filipski Dec 1990 A
4977598 Doddington et al. Dec 1990 A
4980916 Zinser Dec 1990 A
4985924 Matsuura Jan 1991 A
4992972 Brooks et al. Feb 1991 A
4994966 Hutchins Feb 1991 A
4994983 Landell et al. Feb 1991 A
5001774 Lee Mar 1991 A
5003577 Ertz et al. Mar 1991 A
5007095 Nara et al. Apr 1991 A
5007098 Kumagai Apr 1991 A
5010574 Wang Apr 1991 A
5016002 Levanto May 1991 A
5020112 Chou May 1991 A
5021971 Lindsay Jun 1991 A
5022081 Hirose et al. Jun 1991 A
5027110 Chang et al. Jun 1991 A
5027406 Roberts et al. Jun 1991 A
5027408 Kroeker et al. Jun 1991 A
5029211 Ozawa Jul 1991 A
5031217 Nishimura Jul 1991 A
5032989 Tornetta Jul 1991 A
5033087 Bahl et al. Jul 1991 A
5040218 Vitale et al. Aug 1991 A
5046099 Nishimura Sep 1991 A
5047614 Bianco Sep 1991 A
5047617 Shepard et al. Sep 1991 A
5050215 Nishimura Sep 1991 A
5053758 Cornett et al. Oct 1991 A
5054084 Tanaka et al. Oct 1991 A
5057915 Von Kohorn Oct 1991 A
5062143 Schmitt Oct 1991 A
5067158 Arjmand Nov 1991 A
5067503 Stile Nov 1991 A
5072452 Brown et al. Dec 1991 A
5075896 Wilcox et al. Dec 1991 A
5079723 Herceg et al. Jan 1992 A
5083119 Trevett et al. Jan 1992 A
5083268 Hemphill et al. Jan 1992 A
5086792 Chodorow Feb 1992 A
5090012 Kajiyama et al. Feb 1992 A
5091790 Silverberg Feb 1992 A
5091945 Kleijn Feb 1992 A
5103498 Lanier et al. Apr 1992 A
5109509 Katayama et al. Apr 1992 A
5111423 Kopec, Jr. et al. May 1992 A
5119079 Hube et al. Jun 1992 A
5122951 Kamiya Jun 1992 A
5123103 Ohtaki et al. Jun 1992 A
5125022 Hunt et al. Jun 1992 A
5125030 Nomura et al. Jun 1992 A
5127043 Hunt et al. Jun 1992 A
5127053 Koch Jun 1992 A
5127055 Larkey Jun 1992 A
5128672 Kaehler Jul 1992 A
5133011 McKiel, Jr. Jul 1992 A
5133023 Bokser Jul 1992 A
5142584 Ozawa Aug 1992 A
5144875 Nakada Sep 1992 A
5148541 Lee et al. Sep 1992 A
5153913 Kandefer et al. Oct 1992 A
5157610 Asano et al. Oct 1992 A
5157779 Washburn et al. Oct 1992 A
5161102 Griffin et al. Nov 1992 A
5163809 Akgun et al. Nov 1992 A
5164900 Bernath Nov 1992 A
5164982 Davis Nov 1992 A
5165007 Bahl et al. Nov 1992 A
5167004 Netsch et al. Nov 1992 A
5175536 Aschliman et al. Dec 1992 A
5175803 Yeh Dec 1992 A
5175814 Anick et al. Dec 1992 A
5179627 Sweet et al. Jan 1993 A
5179652 Rozmanith et al. Jan 1993 A
5194950 Murakami et al. Mar 1993 A
5195034 Garneau et al. Mar 1993 A
5195167 Bahl et al. Mar 1993 A
5197005 Shwartz et al. Mar 1993 A
5199077 Wilcox et al. Mar 1993 A
5201034 Matsuura et al. Apr 1993 A
5202952 Gillick et al. Apr 1993 A
5208862 Ozawa May 1993 A
5210689 Baker et al. May 1993 A
5212638 Bernath May 1993 A
5212821 Gorin et al. May 1993 A
5216747 Hardwick et al. Jun 1993 A
5218700 Beechick Jun 1993 A
5220629 Kosaka et al. Jun 1993 A
5220639 Lee Jun 1993 A
5220657 Bly et al. Jun 1993 A
5222146 Bahl et al. Jun 1993 A
5230036 Akamine et al. Jul 1993 A
5231670 Goldhor et al. Jul 1993 A
5235680 Bijnagte Aug 1993 A
5237502 White et al. Aug 1993 A
5241619 Schwartz et al. Aug 1993 A
5252951 Tannenbaum et al. Oct 1993 A
5253325 Clark Oct 1993 A
5255386 Prager Oct 1993 A
5257387 Richek et al. Oct 1993 A
5260697 Barrett et al. Nov 1993 A
5266931 Tanaka Nov 1993 A
5266949 Rossi Nov 1993 A
5267345 Brown et al. Nov 1993 A
5268990 Cohen et al. Dec 1993 A
5274771 Hamilton et al. Dec 1993 A
5274818 Vasilevsky et al. Dec 1993 A
5276616 Kuga et al. Jan 1994 A
5276794 Lamb, Jr. Jan 1994 A
5278980 Pedersen et al. Jan 1994 A
5282265 Rohra Suda et al. Jan 1994 A
5283818 Klausner et al. Feb 1994 A
5287448 Nicol et al. Feb 1994 A
5289562 Mizuta et al. Feb 1994 A
RE34562 Murakami et al. Mar 1994 E
5291286 Murakami et al. Mar 1994 A
5293254 Eschbach Mar 1994 A
5293448 Honda Mar 1994 A
5293452 Picone et al. Mar 1994 A
5296642 Konishi Mar 1994 A
5297170 Eyuboglu et al. Mar 1994 A
5297194 Hunt et al. Mar 1994 A
5299125 Baker et al. Mar 1994 A
5299284 Roy Mar 1994 A
5301109 Landauer et al. Apr 1994 A
5303406 Hansen et al. Apr 1994 A
5305205 Weber et al. Apr 1994 A
5305421 Li et al. Apr 1994 A
5305768 Gross et al. Apr 1994 A
5309359 Katz et al. May 1994 A
5315689 Kanazawa et al. May 1994 A
5317507 Gallant May 1994 A
5317647 Pagallo May 1994 A
5325297 Bird et al. Jun 1994 A
5325298 Gallant Jun 1994 A
5325462 Farrett Jun 1994 A
5326270 Ostby et al. Jul 1994 A
5327342 Roy Jul 1994 A
5327498 Hamon Jul 1994 A
5329608 Bocchieri et al. Jul 1994 A
5333236 Bahl et al. Jul 1994 A
5333266 Boaz et al. Jul 1994 A
5333275 Wheatley et al. Jul 1994 A
5335011 Addeo et al. Aug 1994 A
5335276 Thompson et al. Aug 1994 A
5341293 Vertelney et al. Aug 1994 A
5341466 Perlin et al. Aug 1994 A
5345536 Hoshimi et al. Sep 1994 A
5349645 Zhao Sep 1994 A
5353374 Wilson et al. Oct 1994 A
5353376 Oh et al. Oct 1994 A
5353377 Kuroda et al. Oct 1994 A
5353408 Kato et al. Oct 1994 A
5353432 Richek et al. Oct 1994 A
5357431 Nakada et al. Oct 1994 A
5367640 Hamilton et al. Nov 1994 A
5369575 Lamberti et al. Nov 1994 A
5369577 Kadashevich et al. Nov 1994 A
5371853 Kao et al. Dec 1994 A
5371901 Reed et al. Dec 1994 A
5373566 Murdock Dec 1994 A
5377103 Lamberti et al. Dec 1994 A
5377301 Rosenberg et al. Dec 1994 A
5377303 Firman Dec 1994 A
5384671 Fisher Jan 1995 A
5384892 Strong Jan 1995 A
5384893 Hutchins Jan 1995 A
5386494 White Jan 1995 A
5386556 Hedin et al. Jan 1995 A
5390236 Klausner et al. Feb 1995 A
5390279 Strong Feb 1995 A
5390281 Luciw et al. Feb 1995 A
5392419 Walton Feb 1995 A
5396625 Parkes Mar 1995 A
5400434 Pearson Mar 1995 A
5404295 Katz et al. Apr 1995 A
5406305 Shimomura et al. Apr 1995 A
5408060 Muurinen Apr 1995 A
5412756 Bauman et al. May 1995 A
5412804 Krishna May 1995 A
5412806 Du et al. May 1995 A
5418951 Damashek May 1995 A
5422656 Allard et al. Jun 1995 A
5424947 Nagao et al. Jun 1995 A
5425108 Hwang et al. Jun 1995 A
5428731 Powers, III Jun 1995 A
5434777 Luciw Jul 1995 A
5440615 Caccuro et al. Aug 1995 A
5442598 Haikawa et al. Aug 1995 A
5442780 Takanashi et al. Aug 1995 A
5444823 Nguyen Aug 1995 A
5449368 Kuzmak Sep 1995 A
5450523 Zhao Sep 1995 A
5455888 Iyengar et al. Oct 1995 A
5457768 Tsuboi et al. Oct 1995 A
5459488 Geiser Oct 1995 A
5463696 Beernink et al. Oct 1995 A
5463725 Henckel et al. Oct 1995 A
5465401 Thompson Nov 1995 A
5469529 Bimbot et al. Nov 1995 A
5471611 McGregor Nov 1995 A
5473728 Luginbuhl et al. Dec 1995 A
5475587 Anick et al. Dec 1995 A
5475796 Iwata Dec 1995 A
5477447 Luciw et al. Dec 1995 A
5477448 Golding et al. Dec 1995 A
5477451 Brown et al. Dec 1995 A
5479488 Lennig et al. Dec 1995 A
5481739 Staats Jan 1996 A
5483261 Yasutake Jan 1996 A
5485372 Golding et al. Jan 1996 A
5485543 Aso Jan 1996 A
5488204 Mead et al. Jan 1996 A
5488727 Agrawal et al. Jan 1996 A
5490234 Narayan Feb 1996 A
5491758 Bellegarda et al. Feb 1996 A
5491772 Hardwick et al. Feb 1996 A
5493677 Balogh et al. Feb 1996 A
5495604 Harding et al. Feb 1996 A
5497319 Chong et al. Mar 1996 A
5500903 Gulli Mar 1996 A
5500905 Martin et al. Mar 1996 A
5500937 Thompson-Rohrlich Mar 1996 A
5502774 Bellegarda et al. Mar 1996 A
5502790 Yi Mar 1996 A
5502791 Nishimura et al. Mar 1996 A
5515475 Gupta et al. May 1996 A
5521816 Roche et al. May 1996 A
5524140 Klausner et al. Jun 1996 A
5530861 Diamant et al. Jun 1996 A
5530950 Medan et al. Jun 1996 A
5533182 Bates et al. Jul 1996 A
5535121 Roche et al. Jul 1996 A
5536902 Serra et al. Jul 1996 A
5537317 Schabes et al. Jul 1996 A
5537618 Boulton et al. Jul 1996 A
5537647 Hermansky et al. Jul 1996 A
5543588 Bisset et al. Aug 1996 A
5543897 Altrieth, III Aug 1996 A
5544264 Bellegarda et al. Aug 1996 A
5548507 Martino et al. Aug 1996 A
5551049 Kaplan et al. Aug 1996 A
5555343 Luther Sep 1996 A
5555344 Zunkler Sep 1996 A
5559301 Bryan, Jr. et al. Sep 1996 A
5559945 Beaudet et al. Sep 1996 A
5564446 Wiltshire Oct 1996 A
5565888 Selker Oct 1996 A
5568536 Tiller et al. Oct 1996 A
5568540 Greco et al. Oct 1996 A
5570324 Geil Oct 1996 A
5572576 Klausner et al. Nov 1996 A
5574823 Hassanein et al. Nov 1996 A
5574824 Slyh et al. Nov 1996 A
5577135 Grajski et al. Nov 1996 A
5577164 Kaneko et al. Nov 1996 A
5577241 Spencer Nov 1996 A
5578808 Taylor Nov 1996 A
5579037 Tahara et al. Nov 1996 A
5579436 Chou et al. Nov 1996 A
5581484 Prince Dec 1996 A
5581652 Abe et al. Dec 1996 A
5581655 Cohen et al. Dec 1996 A
5583993 Foster et al. Dec 1996 A
5584024 Shwartz Dec 1996 A
5586540 Marzec et al. Dec 1996 A
5594641 Kaplan et al. Jan 1997 A
5596260 Moravec et al. Jan 1997 A
5596676 Swaminathan et al. Jan 1997 A
5596994 Bro Jan 1997 A
5608624 Luciw Mar 1997 A
5608698 Yamanoi et al. Mar 1997 A
5608841 Tsuboka Mar 1997 A
5610812 Schabes et al. Mar 1997 A
5613036 Strong Mar 1997 A
5613122 Burnard et al. Mar 1997 A
5615378 Nishino et al. Mar 1997 A
5615384 Allard et al. Mar 1997 A
5616876 Cluts Apr 1997 A
5617386 Choi Apr 1997 A
5617507 Lee et al. Apr 1997 A
5617539 Ludwig et al. Apr 1997 A
5619583 Page et al. Apr 1997 A
5619694 Shimazu Apr 1997 A
5621859 Schwartz et al. Apr 1997 A
5621903 Luciw et al. Apr 1997 A
5627939 Huang et al. May 1997 A
5634084 Malsheen et al. May 1997 A
5636325 Farrett Jun 1997 A
5638425 Meador, III et al. Jun 1997 A
5638489 Tsuboka Jun 1997 A
5638523 Mullet et al. Jun 1997 A
5640487 Lau et al. Jun 1997 A
5642464 Yue et al. Jun 1997 A
5642466 Narayan Jun 1997 A
5642519 Martin Jun 1997 A
5644656 Akra et al. Jul 1997 A
5644727 Atkins Jul 1997 A
5644735 Luciw et al. Jul 1997 A
5649060 Ellozy et al. Jul 1997 A
5652828 Silverman Jul 1997 A
5652884 Palevich Jul 1997 A
5652897 Linebarger et al. Jul 1997 A
5661787 Pocock Aug 1997 A
5664055 Kroon Sep 1997 A
5664206 Murow et al. Sep 1997 A
5670985 Cappels, Sr. et al. Sep 1997 A
5675704 Juang et al. Oct 1997 A
5675819 Schuetze Oct 1997 A
5678039 Hinks et al. Oct 1997 A
5678053 Anderson Oct 1997 A
5680511 Baker et al. Oct 1997 A
5682475 Johnson et al. Oct 1997 A
5682539 Conrad et al. Oct 1997 A
5684513 Decker Nov 1997 A
5687077 Gough, Jr. Nov 1997 A
5689287 Mackinlay et al. Nov 1997 A
5689616 Li Nov 1997 A
5689618 Gasper et al. Nov 1997 A
5692205 Berry et al. Nov 1997 A
5696962 Kupiec Dec 1997 A
5697793 Huffman et al. Dec 1997 A
5699082 Marks et al. Dec 1997 A
5701400 Amado Dec 1997 A
5706442 Anderson et al. Jan 1998 A
5708659 Rostoker et al. Jan 1998 A
5708822 Wical Jan 1998 A
5710886 Christensen et al. Jan 1998 A
5710922 Alley et al. Jan 1998 A
5712949 Kato et al. Jan 1998 A
5712957 Waibel et al. Jan 1998 A
5715468 Budzinski Feb 1998 A
5717877 Orton et al. Feb 1998 A
5721827 Logan et al. Feb 1998 A
5721949 Smith et al. Feb 1998 A
5724406 Juster Mar 1998 A
5724985 Snell et al. Mar 1998 A
5726672 Hernandez et al. Mar 1998 A
5727950 Cook et al. Mar 1998 A
5729694 Holzrichter et al. Mar 1998 A
5729704 Stone et al. Mar 1998 A
5732216 Logan et al. Mar 1998 A
5732390 Katayanagi et al. Mar 1998 A
5732395 Silverman Mar 1998 A
5734750 Arai et al. Mar 1998 A
5734791 Acero et al. Mar 1998 A
5736974 Selker Apr 1998 A
5737487 Bellegarda et al. Apr 1998 A
5737609 Reed et al. Apr 1998 A
5737734 Schultz Apr 1998 A
5739451 Winksy et al. Apr 1998 A
5740143 Suetomi Apr 1998 A
5742705 Parthasarathy Apr 1998 A
5742736 Haddock Apr 1998 A
5745116 Pisutha-Arnond Apr 1998 A
5745843 Wetters et al. Apr 1998 A
5745873 Braida et al. Apr 1998 A
5748512 Vargas May 1998 A
5748974 Johnson May 1998 A
5749071 Silverman May 1998 A
5749081 Whiteis May 1998 A
5751906 Silverman May 1998 A
5757358 Osga May 1998 A
5757979 Hongo et al. May 1998 A
5758024 Alleva May 1998 A
5758079 Ludwig et al. May 1998 A
5758083 Singh et al. May 1998 A
5758314 McKenna May 1998 A
5758318 Kojima et al. May 1998 A
5759101 Von Kohorn Jun 1998 A
5761640 Kalyanswamy et al. Jun 1998 A
5761687 Hon et al. Jun 1998 A
5764852 Williams Jun 1998 A
5765131 Stentiford et al. Jun 1998 A
5765168 Burrows Jun 1998 A
5771276 Wolf Jun 1998 A
5774834 Visser Jun 1998 A
5774855 Foti et al. Jun 1998 A
5774859 Houser et al. Jun 1998 A
5777614 Ando et al. Jul 1998 A
5778405 Ogawa Jul 1998 A
5790978 Olive et al. Aug 1998 A
5794050 Dahlgren et al. Aug 1998 A
5794182 Manduchi et al. Aug 1998 A
5794189 Gould Aug 1998 A
5794207 Walker et al. Aug 1998 A
5794237 Gore, Jr. Aug 1998 A
5797008 Burrows Aug 1998 A
5799268 Boguraev Aug 1998 A
5799269 Schabes et al. Aug 1998 A
5799276 Komissarchik et al. Aug 1998 A
5799279 Gould et al. Aug 1998 A
5801692 Muzio et al. Sep 1998 A
5802466 Gallant et al. Sep 1998 A
5802526 Fawcett et al. Sep 1998 A
5806021 Chen et al. Sep 1998 A
5812697 Sakai et al. Sep 1998 A
5812698 Platt et al. Sep 1998 A
5815142 Allard et al. Sep 1998 A
5815225 Nelson Sep 1998 A
5818142 Edleblute et al. Oct 1998 A
5818451 Bertram et al. Oct 1998 A
5818924 King et al. Oct 1998 A
5822288 Shinada Oct 1998 A
5822720 Bookman et al. Oct 1998 A
5822730 Roth et al. Oct 1998 A
5822743 Gupta et al. Oct 1998 A
5825349 Meier et al. Oct 1998 A
5825352 Bisset et al. Oct 1998 A
5825881 Colvin, Sr. Oct 1998 A
5826261 Spencer Oct 1998 A
5828768 Eatwell et al. Oct 1998 A
5828999 Bellegarda et al. Oct 1998 A
5832428 Chow et al. Nov 1998 A
5832433 Yashchin et al. Nov 1998 A
5832435 Silverman Nov 1998 A
5833134 Ho et al. Nov 1998 A
5835077 Dao et al. Nov 1998 A
5835079 Shieh Nov 1998 A
5835721 Donahue et al. Nov 1998 A
5835732 Kikinis et al. Nov 1998 A
5835893 Ushioda Nov 1998 A
5839106 Bellegarda Nov 1998 A
5841902 Tu Nov 1998 A
5842165 Raman et al. Nov 1998 A
5845255 Mayaud Dec 1998 A
5848410 Walls et al. Dec 1998 A
5850480 Scanlon Dec 1998 A
5850629 Holm et al. Dec 1998 A
5852801 Hon et al. Dec 1998 A
5854893 Ludwig et al. Dec 1998 A
5855000 Waibel et al. Dec 1998 A
5857184 Lynch Jan 1999 A
5859636 Pandit Jan 1999 A
5860063 Gorin et al. Jan 1999 A
5860064 Henton Jan 1999 A
5860075 Hashizume et al. Jan 1999 A
5862223 Walker et al. Jan 1999 A
5862233 Poletti Jan 1999 A
5864806 Mokbel et al. Jan 1999 A
5864815 Rozak et al. Jan 1999 A
5864844 James et al. Jan 1999 A
5864855 Ruocco et al. Jan 1999 A
5867799 Lang et al. Feb 1999 A
5870710 Ozawa et al. Feb 1999 A
5873056 Liddy et al. Feb 1999 A
5873064 De Armas et al. Feb 1999 A
5875427 Yamazaki Feb 1999 A
5875429 Douglas Feb 1999 A
5875437 Atkins Feb 1999 A
5875448 Boys et al. Feb 1999 A
5876396 Lo et al. Mar 1999 A
5877751 Kanemitsu et al. Mar 1999 A
5877757 Baldwin et al. Mar 1999 A
5878393 Hata et al. Mar 1999 A
5878394 Muhling Mar 1999 A
5878396 Henton Mar 1999 A
5880411 Gillespie et al. Mar 1999 A
5880731 Liles et al. Mar 1999 A
5884039 Ludwig et al. Mar 1999 A
5884262 Wise et al. Mar 1999 A
5884323 Hawkins et al. Mar 1999 A
5890117 Silverman Mar 1999 A
5890122 Van et al. Mar 1999 A
5891180 Greeninger et al. Apr 1999 A
5893126 Drews et al. Apr 1999 A
5893132 Huffman et al. Apr 1999 A
5895448 Vysotsky et al. Apr 1999 A
5895464 Bhandari et al. Apr 1999 A
5895466 Goldberg et al. Apr 1999 A
5896321 Miller et al. Apr 1999 A
5896500 Ludwig et al. Apr 1999 A
5899972 Miyazawa et al. May 1999 A
5905498 Diament et al. May 1999 A
5907597 Mark May 1999 A
5909666 Gould et al. Jun 1999 A
5909667 Leontiades et al. Jun 1999 A
5912951 Checchio et al. Jun 1999 A
5912952 Brendzel Jun 1999 A
5913185 Martino et al. Jun 1999 A
5913193 Huang et al. Jun 1999 A
5915001 Uppaluru et al. Jun 1999 A
5915236 Gould et al. Jun 1999 A
5915238 Tjaden Jun 1999 A
5915249 Spencer Jun 1999 A
5917487 Ulrich Jun 1999 A
5918303 Yamaura et al. Jun 1999 A
5920327 Seidensticker, Jr. Jul 1999 A
5920836 Gould et al. Jul 1999 A
5920837 Gould et al. Jul 1999 A
5923757 Hocker et al. Jul 1999 A
5924068 Richard et al. Jul 1999 A
5926769 Valimaa et al. Jul 1999 A
5926789 Barbara et al. Jul 1999 A
5930408 Seto Jul 1999 A
5930751 Cohrs et al. Jul 1999 A
5930754 Karaali et al. Jul 1999 A
5930769 Rose Jul 1999 A
5930783 Li et al. Jul 1999 A
5933477 Wu Aug 1999 A
5933806 Beyerlein et al. Aug 1999 A
5933822 Braden-Harder et al. Aug 1999 A
5936926 Yokouchi et al. Aug 1999 A
5937163 Lee et al. Aug 1999 A
5940811 Norris Aug 1999 A
5940841 Schmuck et al. Aug 1999 A
5941944 Messerly Aug 1999 A
5943043 Furuhata et al. Aug 1999 A
5943049 Matsubara et al. Aug 1999 A
5943052 Allen et al. Aug 1999 A
5943429 Haendel et al. Aug 1999 A
5943443 Itonori et al. Aug 1999 A
5943670 Prager Aug 1999 A
5946647 Miller et al. Aug 1999 A
5946648 Halstead et al. Aug 1999 A
5948040 DeLorme et al. Sep 1999 A
5949961 Sharman Sep 1999 A
5950123 Schwelb et al. Sep 1999 A
5952992 Helms Sep 1999 A
5953541 King et al. Sep 1999 A
5956021 Kubota et al. Sep 1999 A
5956699 Wong et al. Sep 1999 A
5960385 Skiena et al. Sep 1999 A
5960394 Gould et al. Sep 1999 A
5960422 Prasad Sep 1999 A
5963208 Dolan et al. Oct 1999 A
5963924 Williams et al. Oct 1999 A
5963964 Nielsen Oct 1999 A
5966126 Szabo Oct 1999 A
5970446 Goldberg et al. Oct 1999 A
5970451 Lewis et al. Oct 1999 A
5970460 Bunce et al. Oct 1999 A
5970474 LeRoy et al. Oct 1999 A
5973612 Deo et al. Oct 1999 A
5973676 Kawakura Oct 1999 A
5974146 Randle et al. Oct 1999 A
5977950 Rhyne Nov 1999 A
5982352 Pryor Nov 1999 A
5982370 Kamper Nov 1999 A
5982891 Ginter et al. Nov 1999 A
5982902 Terano Nov 1999 A
5983179 Gould et al. Nov 1999 A
5983184 Noguchi Nov 1999 A
5983216 Kirsch et al. Nov 1999 A
5987132 Rowney Nov 1999 A
5987140 Rowney et al. Nov 1999 A
5987401 Trudeau Nov 1999 A
5987404 Della Pietra et al. Nov 1999 A
5987440 O'Neil et al. Nov 1999 A
5990887 Redpath et al. Nov 1999 A
5991441 Jourjine Nov 1999 A
5995460 Takagi et al. Nov 1999 A
5995590 Brunet et al. Nov 1999 A
5995918 Kendall et al. Nov 1999 A
5998972 Gong Dec 1999 A
5999169 Lee Dec 1999 A
5999895 Forest Dec 1999 A
5999908 Abelow Dec 1999 A
5999927 Tukey et al. Dec 1999 A
6005495 Connolly et al. Dec 1999 A
6006274 Hawkins et al. Dec 1999 A
6009237 Hirabayashi et al. Dec 1999 A
6011585 Anderson Jan 2000 A
6014428 Wolf Jan 2000 A
6016471 Kuhn et al. Jan 2000 A
6017219 Adams, Jr. et al. Jan 2000 A
6018705 Gaudet Jan 2000 A
6018711 French-St. George et al. Jan 2000 A
6020881 Naughton et al. Feb 2000 A
6023536 Visser Feb 2000 A
6023676 Erell Feb 2000 A
6023684 Pearson Feb 2000 A
6024288 Gottlich et al. Feb 2000 A
6026345 Shah et al. Feb 2000 A
6026375 Hall et al. Feb 2000 A
6026388 Liddy et al. Feb 2000 A
6026393 Gupta et al. Feb 2000 A
6029132 Kuhn et al. Feb 2000 A
6029135 Krasle Feb 2000 A
6035267 Watanabe et al. Mar 2000 A
6035303 Baer et al. Mar 2000 A
6035336 Lu et al. Mar 2000 A
6038533 Buchsbaum et al. Mar 2000 A
6040824 Maekawa et al. Mar 2000 A
6041023 Lakhansingh Mar 2000 A
6047255 Williamson Apr 2000 A
6047300 Walfish et al. Apr 2000 A
6052654 Gaudet et al. Apr 2000 A
6052656 Suda et al. Apr 2000 A
6054990 Tran Apr 2000 A
6055514 Wren Apr 2000 A
6055531 Bennett et al. Apr 2000 A
6061646 Martino et al. May 2000 A
6064767 Muir et al. May 2000 A
6064951 Park et al. May 2000 A
6064959 Young et al. May 2000 A
6064960 Bellegarda et al. May 2000 A
6064963 Gainsboro May 2000 A
6067519 Lowry May 2000 A
6069648 Suso et al. May 2000 A
6070138 Iwata May 2000 A
6070139 Miyazawa et al. May 2000 A
6070140 Tran May 2000 A
6070147 Harms et al. May 2000 A
6073033 Campo Jun 2000 A
6073036 Heikkinen et al. Jun 2000 A
6073091 Kanevsky et al. Jun 2000 A
6073097 Gould et al. Jun 2000 A
6076051 Messerly et al. Jun 2000 A
6076060 Lin et al. Jun 2000 A
6076088 Paik et al. Jun 2000 A
6078885 Beutnagel Jun 2000 A
6078914 Redfern Jun 2000 A
6081750 Hoffberg et al. Jun 2000 A
6081774 de Hita et al. Jun 2000 A
6081780 Lumelsky Jun 2000 A
6085204 Chijiwa et al. Jul 2000 A
6088671 Gould et al. Jul 2000 A
6088731 Kiraly et al. Jul 2000 A
6092036 Hamann et al. Jul 2000 A
6092038 Kanevsky et al. Jul 2000 A
6092043 Squires et al. Jul 2000 A
6094649 Bowen et al. Jul 2000 A
6097391 Wilcox Aug 2000 A
6101468 Gould et al. Aug 2000 A
6101470 Eide et al. Aug 2000 A
6105865 Hardesty Aug 2000 A
6108627 Sabourin Aug 2000 A
6108640 Slotznick Aug 2000 A
6111562 Downs et al. Aug 2000 A
6111572 Blair et al. Aug 2000 A
6115686 Chung et al. Sep 2000 A
6116907 Baker et al. Sep 2000 A
6119101 Peckover Sep 2000 A
6121960 Carroll et al. Sep 2000 A
6122340 Darley et al. Sep 2000 A
6122614 Kahn et al. Sep 2000 A
6122616 Henton Sep 2000 A
6122647 Horowitz et al. Sep 2000 A
6125284 Moore et al. Sep 2000 A
6125346 Nishimura et al. Sep 2000 A
6125356 Brockman et al. Sep 2000 A
6129582 Wilhite et al. Oct 2000 A
6138098 Shieber et al. Oct 2000 A
6138158 Boyle et al. Oct 2000 A
6141642 Oh Oct 2000 A
6141644 Kuhn et al. Oct 2000 A
6144377 Oppermann et al. Nov 2000 A
6144380 Shwarts et al. Nov 2000 A
6144938 Surace et al. Nov 2000 A
6144939 Pearson et al. Nov 2000 A
6151401 Annaratone Nov 2000 A
6154551 Frenkel Nov 2000 A
6154720 Onishi et al. Nov 2000 A
6157935 Tran et al. Dec 2000 A
6161084 Messerly et al. Dec 2000 A
6161087 Wightman et al. Dec 2000 A
6161944 Leman Dec 2000 A
6163769 Acero et al. Dec 2000 A
6163809 Buckley Dec 2000 A
6167369 Schulze Dec 2000 A
6169538 Nowlan et al. Jan 2001 B1
6172948 Keller et al. Jan 2001 B1
6173194 Vanttila Jan 2001 B1
6173251 Ito et al. Jan 2001 B1
6173261 Arai et al. Jan 2001 B1
6173263 Conkie Jan 2001 B1
6173279 Levin et al. Jan 2001 B1
6177905 Welch Jan 2001 B1
6177931 Alexander et al. Jan 2001 B1
6179432 Zhang et al. Jan 2001 B1
6182028 Karaali et al. Jan 2001 B1
6182099 Nakasato Jan 2001 B1
6185533 Holm et al. Feb 2001 B1
6188391 Seely et al. Feb 2001 B1
6188967 Kurtzberg et al. Feb 2001 B1
6188999 Moody Feb 2001 B1
6191939 Burnett Feb 2001 B1
6192253 Charlier et al. Feb 2001 B1
6192340 Abecassis Feb 2001 B1
6195641 Loring et al. Feb 2001 B1
6199076 Logan et al. Mar 2001 B1
6205456 Nakao Mar 2001 B1
6208044 Viswanadham et al. Mar 2001 B1
6208932 Ohmura et al. Mar 2001 B1
6208956 Motoyama Mar 2001 B1
6208964 Sabourin Mar 2001 B1
6208967 Pauws et al. Mar 2001 B1
6208971 Bellegarda et al. Mar 2001 B1
6212564 Harter et al. Apr 2001 B1
6216102 Martino et al. Apr 2001 B1
6216131 Liu et al. Apr 2001 B1
6217183 Shipman Apr 2001 B1
6222347 Gong Apr 2001 B1
6226403 Parthasarathy May 2001 B1
6226533 Akahane May 2001 B1
6226614 Mizuno et al. May 2001 B1
6226655 Borman et al. May 2001 B1
6230322 Saib et al. May 2001 B1
6232539 Looney et al. May 2001 B1
6232966 Kurlander May 2001 B1
6233545 Datig May 2001 B1
6233547 Denber et al. May 2001 B1
6233559 Balakrishnan, Sr. May 2001 B1
6233578 Machihara et al. May 2001 B1
6237025 Ludwig et al. May 2001 B1
6240303 Katzur May 2001 B1
6243681 Guji et al. Jun 2001 B1
6246981 Papineni et al. Jun 2001 B1
6249606 Kiraly et al. Jun 2001 B1
6259436 Moon et al. Jul 2001 B1
6259826 Pollard et al. Jul 2001 B1
6260011 Heckerman et al. Jul 2001 B1
6260013 Sejnoha Jul 2001 B1
6260016 Holm et al. Jul 2001 B1
6260024 Shkedy Jul 2001 B1
6266098 Cove et al. Jul 2001 B1
6266637 Donovan et al. Jul 2001 B1
6268859 Andresen et al. Jul 2001 B1
6269712 Zentmyer Aug 2001 B1
6271835 Hoeksma Aug 2001 B1
6272456 De Campos Aug 2001 B1
6272464 Kiraz et al. Aug 2001 B1
6275795 Tzirkel-Hancock Aug 2001 B1
6275824 O'Flaherty et al. Aug 2001 B1
6278443 Amro et al. Aug 2001 B1
6278970 Milner Aug 2001 B1
6282507 Horiguchi et al. Aug 2001 B1
6282511 Mayer Aug 2001 B1
6285785 Bellegarda et al. Sep 2001 B1
6285786 Seni et al. Sep 2001 B1
6289085 Miyashita et al. Sep 2001 B1
6289124 Okamoto Sep 2001 B1
6289301 Higginbotham et al. Sep 2001 B1
6289353 Hazlehurst et al. Sep 2001 B1
6292772 Kantrowitz Sep 2001 B1
6292778 Sukkar Sep 2001 B1
6295390 Kobayashi et al. Sep 2001 B1
6295391 Rudd et al. Sep 2001 B1
6295541 Bodnar et al. Sep 2001 B1
6297818 Ulrich et al. Oct 2001 B1
6298314 Blackadar et al. Oct 2001 B1
6298321 Karlov et al. Oct 2001 B1
6300947 Kanevsky Oct 2001 B1
6304844 Pan et al. Oct 2001 B1
6304846 George et al. Oct 2001 B1
6307548 Flinchem et al. Oct 2001 B1
6308149 Gaussier et al. Oct 2001 B1
6310610 Beaton et al. Oct 2001 B1
6311152 Bai et al. Oct 2001 B1
6311157 Strong Oct 2001 B1
6311189 deVries et al. Oct 2001 B1
6314397 Lewis et al. Nov 2001 B1
6317237 Nakao et al. Nov 2001 B1
6317594 Gossman et al. Nov 2001 B1
6317707 Bangalore et al. Nov 2001 B1
6317831 King Nov 2001 B1
6321092 Fitch et al. Nov 2001 B1
6321179 Glance et al. Nov 2001 B1
6323846 Westerman et al. Nov 2001 B1
6324499 Lewis et al. Nov 2001 B1
6324502 Handel et al. Nov 2001 B1
6324512 Junqua et al. Nov 2001 B1
6324514 Matulich et al. Nov 2001 B2
6330538 Breen Dec 2001 B1
6331867 Eberhard et al. Dec 2001 B1
6332175 Birrell et al. Dec 2001 B1
6334103 Surace et al. Dec 2001 B1
6335722 Tani et al. Jan 2002 B1
6336365 Blackadar et al. Jan 2002 B1
6336727 Kim Jan 2002 B1
6340937 Stepita-Klauco Jan 2002 B1
6341316 Kloba et al. Jan 2002 B1
6343267 Kuhn et al. Jan 2002 B1
6345240 Havens Feb 2002 B1
6345250 Martin Feb 2002 B1
6347296 Friedland Feb 2002 B1
6347315 Kiyoki et al. Feb 2002 B1
6351522 Vitikainen Feb 2002 B1
6351762 Ludwig et al. Feb 2002 B1
6353442 Masui Mar 2002 B1
6353794 Davis et al. Mar 2002 B1
6356287 Ruberry et al. Mar 2002 B1
6356854 Schubert et al. Mar 2002 B1
6356864 Foltz et al. Mar 2002 B1
6356905 Gershman et al. Mar 2002 B1
6357147 Darley et al. Mar 2002 B1
6359572 Vale Mar 2002 B1
6359970 Burgess Mar 2002 B1
6360227 Aggarwal et al. Mar 2002 B1
6360237 Schulz et al. Mar 2002 B1
6363347 Rozak Mar 2002 B1
6363348 Besling et al. Mar 2002 B1
6366883 Campbell et al. Apr 2002 B1
6366884 Bellegarda et al. Apr 2002 B1
6374217 Bellegarda Apr 2002 B1
6374226 Hunt et al. Apr 2002 B1
6377530 Burrows Apr 2002 B1
6377925 Greene, Jr. et al. Apr 2002 B1
6377928 Saxena et al. Apr 2002 B1
6381593 Yano et al. Apr 2002 B1
6385586 Dietz May 2002 B1
6385662 Moon et al. May 2002 B1
6389114 Dowens et al. May 2002 B1
6397183 Baba et al. May 2002 B1
6397186 Bush et al. May 2002 B1
6400806 Uppaluru Jun 2002 B1
6400996 Hoffberg et al. Jun 2002 B1
6401065 Kanevsky et al. Jun 2002 B1
6401085 Gershman et al. Jun 2002 B1
6405169 Kondo et al. Jun 2002 B1
6405238 Votipka Jun 2002 B1
6408272 White et al. Jun 2002 B1
6411924 De Hita et al. Jun 2002 B1
6411932 Molnar et al. Jun 2002 B1
6415250 Van Den Akker Jul 2002 B1
6417873 Fletcher et al. Jul 2002 B1
6418431 Mahajan et al. Jul 2002 B1
6421305 Gioscia et al. Jul 2002 B1
6421672 McAllister et al. Jul 2002 B1
6421707 Miller et al. Jul 2002 B1
6424944 Hikawa Jul 2002 B1
6430531 Polish Aug 2002 B1
6430551 Thelen et al. Aug 2002 B1
6434522 Tsuboka Aug 2002 B1
6434524 Weber Aug 2002 B1
6434529 Walker et al. Aug 2002 B1
6434604 Harada et al. Aug 2002 B1
6437818 Ludwig et al. Aug 2002 B1
6438523 Oberteuffer et al. Aug 2002 B1
6442518 Van Thong et al. Aug 2002 B1
6442523 Siegel Aug 2002 B1
6446076 Burkey et al. Sep 2002 B1
6448485 Barile Sep 2002 B1
6448986 Smith Sep 2002 B1
6449620 Draper et al. Sep 2002 B1
6453281 Walters et al. Sep 2002 B1
6453292 Ramaswamy et al. Sep 2002 B2
6453312 Goiffon et al. Sep 2002 B1
6453315 Weissman et al. Sep 2002 B1
6456616 Rantanen Sep 2002 B1
6456972 Gladstein et al. Sep 2002 B1
6460015 Hetherington et al. Oct 2002 B1
6460029 Fries et al. Oct 2002 B1
6462778 Abram et al. Oct 2002 B1
6463128 Elwin Oct 2002 B1
6463413 Applebaum et al. Oct 2002 B1
6466654 Cooper et al. Oct 2002 B1
6467924 Shipman Oct 2002 B2
6469712 Hilpert, Jr. et al. Oct 2002 B1
6469722 Kinoe et al. Oct 2002 B1
6469732 Chang et al. Oct 2002 B1
6470347 Gillam Oct 2002 B1
6473630 Baranowski et al. Oct 2002 B1
6473754 Matsubayashi et al. Oct 2002 B1
6477488 Bellegarda Nov 2002 B1
6477494 Hyde-Thomson et al. Nov 2002 B2
6487533 Hyde-Thomson et al. Nov 2002 B2
6487534 Thelen et al. Nov 2002 B1
6487663 Jaisimha et al. Nov 2002 B1
6489951 Wong et al. Dec 2002 B1
6490547 Atkin et al. Dec 2002 B1
6490560 Ramaswamy et al. Dec 2002 B1
6493006 Gourdol et al. Dec 2002 B1
6493428 Hillier Dec 2002 B1
6493652 Ohlenbusch et al. Dec 2002 B1
6493667 De Souza et al. Dec 2002 B1
6499013 Weber Dec 2002 B1
6499014 Chihara Dec 2002 B1
6499016 Anderson et al. Dec 2002 B1
6501937 Ho et al. Dec 2002 B1
6502194 Berman et al. Dec 2002 B1
6505158 Conkie Jan 2003 B1
6505175 Silverman et al. Jan 2003 B1
6505183 Loofbourrow et al. Jan 2003 B1
6507829 Richards et al. Jan 2003 B1
6510406 Marchisio Jan 2003 B1
6510412 Sasai et al. Jan 2003 B1
6510417 Woods et al. Jan 2003 B1
6513006 Howard et al. Jan 2003 B2
6513008 Pearson et al. Jan 2003 B2
6513063 Julia et al. Jan 2003 B1
6519565 Clements et al. Feb 2003 B1
6519566 Boyer et al. Feb 2003 B1
6523026 Gillis Feb 2003 B1
6523061 Halverson et al. Feb 2003 B1
6523172 Martinez-Guerra et al. Feb 2003 B1
6526351 Whitham Feb 2003 B2
6526382 Yuschik Feb 2003 B1
6526395 Morris Feb 2003 B1
6529592 Khan Mar 2003 B1
6529608 Gersabeck et al. Mar 2003 B2
6532444 Weber Mar 2003 B1
6532446 King Mar 2003 B1
6535610 Stewart Mar 2003 B1
6535852 Eide Mar 2003 B2
6535983 McCormack et al. Mar 2003 B1
6536139 Darley et al. Mar 2003 B2
6538665 Crow et al. Mar 2003 B2
6542171 Satou et al. Apr 2003 B1
6542584 Sherwood et al. Apr 2003 B1
6542868 Badt et al. Apr 2003 B1
6546262 Freadman Apr 2003 B1
6546367 Otsuka Apr 2003 B2
6546388 Edlund et al. Apr 2003 B1
6549497 Miyamoto et al. Apr 2003 B2
6553343 Kagoshima et al. Apr 2003 B1
6553344 Bellegarda et al. Apr 2003 B2
6556971 Rigsby et al. Apr 2003 B1
6556983 Altschuler et al. Apr 2003 B1
6560903 Darley May 2003 B1
6563769 Van Der Meulen May 2003 B1
6564186 Kiraly et al. May 2003 B1
6567549 Marianetti et al. May 2003 B1
6570557 Westerman et al. May 2003 B1
6570596 Frederiksen May 2003 B2
6582342 Kaufman Jun 2003 B2
6583806 Ludwig et al. Jun 2003 B2
6584464 Warthen Jun 2003 B1
6587403 Keller et al. Jul 2003 B1
6587404 Keller et al. Jul 2003 B1
6590303 Austin et al. Jul 2003 B1
6591379 LeVine et al. Jul 2003 B1
6594673 Smith et al. Jul 2003 B1
6594688 Ludwig et al. Jul 2003 B2
6597345 Hirshberg Jul 2003 B2
6598021 Shambaugh et al. Jul 2003 B1
6598022 Yuschik Jul 2003 B2
6598039 Livowsky Jul 2003 B1
6598054 Schuetze et al. Jul 2003 B2
6601026 Appelt et al. Jul 2003 B2
6601234 Bowman-Amuah Jul 2003 B1
6603837 Kesanupalli et al. Aug 2003 B1
6604059 Strubbe et al. Aug 2003 B2
6606101 Malamud et al. Aug 2003 B1
6606388 Townsend et al. Aug 2003 B1
6606632 Saulpaugh et al. Aug 2003 B1
6611789 Darley Aug 2003 B1
6615172 Bennett et al. Sep 2003 B1
6615175 Gazdzinski Sep 2003 B1
6615176 Lewis et al. Sep 2003 B2
6615220 Austin et al. Sep 2003 B1
6621768 Keller et al. Sep 2003 B1
6621892 Banister et al. Sep 2003 B1
6622121 Crepy et al. Sep 2003 B1
6622136 Russell Sep 2003 B2
6623529 Lakritz Sep 2003 B1
6625583 Silverman et al. Sep 2003 B1
6628808 Bach et al. Sep 2003 B1
6631186 Adams et al. Oct 2003 B1
6631346 Karaorman et al. Oct 2003 B1
6633741 Posa et al. Oct 2003 B1
6633846 Bennett et al. Oct 2003 B1
6633932 Bork et al. Oct 2003 B1
6640098 Roundtree Oct 2003 B1
6642940 Dakss et al. Nov 2003 B1
6643401 Kashioka et al. Nov 2003 B1
6643824 Bates et al. Nov 2003 B1
6647260 Dusse et al. Nov 2003 B2
6650735 Burton et al. Nov 2003 B2
6651042 Field et al. Nov 2003 B1
6651218 Adler et al. Nov 2003 B1
6654740 Tokuda et al. Nov 2003 B2
6658389 Alpdemir Dec 2003 B1
6658408 Yano et al. Dec 2003 B2
6658577 Huppi et al. Dec 2003 B2
6661438 Shiraishi et al. Dec 2003 B1
6662023 Helle Dec 2003 B1
6665639 Mozer et al. Dec 2003 B2
6665640 Bennett et al. Dec 2003 B1
6665641 Coorman et al. Dec 2003 B1
6671672 Heck Dec 2003 B1
6671683 Kanno Dec 2003 B2
6671856 Gillam Dec 2003 B1
6675169 Bennett et al. Jan 2004 B1
6675233 Du et al. Jan 2004 B1
6677932 Westerman Jan 2004 B1
6680675 Suzuki Jan 2004 B1
6684187 Conkie Jan 2004 B1
6684376 Kerzman et al. Jan 2004 B1
6690387 Zimmerman et al. Feb 2004 B2
6690800 Resnick Feb 2004 B2
6690828 Meyers Feb 2004 B2
6691064 Vroman Feb 2004 B2
6691090 Laurila et al. Feb 2004 B1
6691111 Lazaridis et al. Feb 2004 B2
6691151 Cheyer et al. Feb 2004 B1
6694295 Lindholm et al. Feb 2004 B2
6694297 Sato Feb 2004 B2
6697780 Beutnagel et al. Feb 2004 B1
6697824 Bowman-Amuah Feb 2004 B1
6701294 Ball et al. Mar 2004 B1
6701305 Holt et al. Mar 2004 B1
6701318 Fox et al. Mar 2004 B2
6704015 Bovarnick et al. Mar 2004 B1
6704034 Rodriguez et al. Mar 2004 B1
6704698 Paulsen, Jr. et al. Mar 2004 B1
6704710 Strong Mar 2004 B2
6708153 Brittan et al. Mar 2004 B2
6711585 Copperman et al. Mar 2004 B1
6714221 Christie et al. Mar 2004 B1
6716139 Hosseinzadeh-Dolkhani et al. Apr 2004 B1
6718324 Edlund et al. Apr 2004 B2
6718331 Davis et al. Apr 2004 B2
6720980 Lui et al. Apr 2004 B1
6721728 McGreevy Apr 2004 B2
6721734 Subasic et al. Apr 2004 B1
6724370 Dutta et al. Apr 2004 B2
6725197 Wuppermann et al. Apr 2004 B1
6728675 Maddalozzo, Jr. et al. Apr 2004 B1
6728681 Whitham Apr 2004 B2
6728729 Jawa et al. Apr 2004 B1
6731312 Robbin May 2004 B2
6732142 Bates et al. May 2004 B1
6735562 Zhang et al. May 2004 B1
6735632 Kiraly et al. May 2004 B1
6738738 Henton May 2004 B2
6738742 Badt et al. May 2004 B2
6741264 Lesser May 2004 B1
6742021 Halverson et al. May 2004 B1
6751592 Shiga Jun 2004 B1
6751595 Busayapongchai et al. Jun 2004 B2
6751621 Calistri-Yeh et al. Jun 2004 B1
6754504 Reed Jun 2004 B1
6757362 Cooper et al. Jun 2004 B1
6757365 Bogard Jun 2004 B1
6757646 Marchisio Jun 2004 B2
6757653 Buth et al. Jun 2004 B2
6757718 Halverson et al. Jun 2004 B1
6760412 Loucks Jul 2004 B1
6760700 Lewis et al. Jul 2004 B2
6760754 Isaacs et al. Jul 2004 B1
6762692 Mingot et al. Jul 2004 B1
6762741 Weindorf Jul 2004 B2
6762777 Carroll Jul 2004 B2
6763089 Feigenbaum Jul 2004 B2
6766294 MacGinite et al. Jul 2004 B2
6766295 Murveit et al. Jul 2004 B1
6766320 Wang et al. Jul 2004 B1
6766324 Carlson et al. Jul 2004 B2
6768979 Menendez-Pidal et al. Jul 2004 B1
6771982 Toupin Aug 2004 B1
6772123 Cooklev et al. Aug 2004 B2
6772195 Hatlelid et al. Aug 2004 B1
6772394 Kamada Aug 2004 B1
6775358 Breitenbach et al. Aug 2004 B1
6778951 Contractor Aug 2004 B1
6778952 Bellegarda Aug 2004 B2
6778962 Kasai et al. Aug 2004 B1
6778970 Au Aug 2004 B2
6778979 Grefenstette et al. Aug 2004 B2
6782510 Gross et al. Aug 2004 B1
6784901 Harvey et al. Aug 2004 B1
6789094 Rudoff et al. Sep 2004 B2
6789231 Reynar et al. Sep 2004 B1
6790704 Doyle et al. Sep 2004 B2
6792082 Levine Sep 2004 B1
6792083 Dams et al. Sep 2004 B2
6792086 Saylor et al. Sep 2004 B1
6792407 Kibre et al. Sep 2004 B2
6794566 Pachet Sep 2004 B2
6795059 Endo Sep 2004 B2
6799162 Goronzy et al. Sep 2004 B1
6799226 Robbin et al. Sep 2004 B1
6801604 Maes et al. Oct 2004 B2
6801964 Mahdavi Oct 2004 B1
6803905 Capps et al. Oct 2004 B1
6804649 Miranda Oct 2004 B2
6804677 Shadmon et al. Oct 2004 B2
6807536 Achlioptas et al. Oct 2004 B2
6807574 Partovi et al. Oct 2004 B1
6809724 Shiraishi et al. Oct 2004 B1
6810379 Vermeulen et al. Oct 2004 B1
6813218 Antonelli et al. Nov 2004 B1
6813491 McKinney Nov 2004 B1
6813607 Faruquie et al. Nov 2004 B1
6816578 Kredo et al. Nov 2004 B1
6820055 Saindon et al. Nov 2004 B2
6829018 Lin et al. Dec 2004 B2
6829603 Chai et al. Dec 2004 B1
6832194 Mozer et al. Dec 2004 B1
6832381 Mathur et al. Dec 2004 B1
6836537 Zirngibl et al. Dec 2004 B1
6836651 Segal et al. Dec 2004 B2
6836760 Bellegarda et al. Dec 2004 B1
6839464 Hawkins et al. Jan 2005 B2
6839667 Reich Jan 2005 B2
6839669 Gould et al. Jan 2005 B1
6839670 Stammler et al. Jan 2005 B1
6839742 Dyer et al. Jan 2005 B1
6842767 Partovi et al. Jan 2005 B1
6847966 Sommer et al. Jan 2005 B1
6847979 Allemang et al. Jan 2005 B2
6850775 Berg Feb 2005 B1
6850887 Epstein et al. Feb 2005 B2
6851115 Cheyer et al. Feb 2005 B1
6856259 Sharp Feb 2005 B1
6857800 Zhang et al. Feb 2005 B2
6859931 Cheyer et al. Feb 2005 B1
6862568 Case Mar 2005 B2
6862710 Marchisio Mar 2005 B1
6862713 Kraft et al. Mar 2005 B1
6865533 Addison et al. Mar 2005 B2
6868045 Schroder Mar 2005 B1
6868385 Gerson Mar 2005 B1
6870529 Davis Mar 2005 B1
6871346 Kumbalimutt et al. Mar 2005 B1
6873953 Lennig Mar 2005 B1
6873986 McConnell et al. Mar 2005 B2
6876947 Darley et al. Apr 2005 B1
6877003 Ho et al. Apr 2005 B2
6879957 Pechter et al. Apr 2005 B1
6882335 Saarinen Apr 2005 B2
6882337 Shetter Apr 2005 B2
6882747 Thawonmas et al. Apr 2005 B2
6882955 Ohlenbusch et al. Apr 2005 B1
6882971 Craner Apr 2005 B2
6885734 Eberle et al. Apr 2005 B1
6889361 Bates et al. May 2005 B1
6895084 Saylor et al. May 2005 B1
6895257 Boman et al. May 2005 B2
6895380 Sepe, Jr. May 2005 B2
6895558 Loveland May 2005 B1
6898550 Blackadar et al. May 2005 B1
6901364 Nguyen et al. May 2005 B2
6901399 Corston et al. May 2005 B1
6904405 Suominen Jun 2005 B2
6907112 Guedalia et al. Jun 2005 B1
6907140 Matsugu et al. Jun 2005 B2
6910004 Tarbouriech et al. Jun 2005 B2
6910007 Stylianou et al. Jun 2005 B2
6910012 Hartley et al. Jun 2005 B2
6910186 Kim Jun 2005 B2
6911971 Suzuki et al. Jun 2005 B2
6912407 Clarke et al. Jun 2005 B1
6912498 Stevens et al. Jun 2005 B2
6912499 Sabourin et al. Jun 2005 B1
6915138 Kraft Jul 2005 B2
6915246 Gusler et al. Jul 2005 B2
6915294 Singh et al. Jul 2005 B1
6917373 Vong et al. Jul 2005 B2
6918677 Shipman Jul 2005 B2
6924828 Hirsch Aug 2005 B1
6925438 Mohamed et al. Aug 2005 B2
6928149 Panjwani et al. Aug 2005 B1
6928614 Everhart Aug 2005 B1
6931255 Mekuria Aug 2005 B2
6931384 Horvitz et al. Aug 2005 B1
6932708 Yamashita et al. Aug 2005 B2
6933928 Lilienthal et al. Aug 2005 B1
6934394 Anderson Aug 2005 B1
6934684 Alpdemir et al. Aug 2005 B2
6934756 Maes Aug 2005 B2
6934812 Robbin et al. Aug 2005 B1
6937975 Elworthy Aug 2005 B1
6937986 Denenberg et al. Aug 2005 B2
6944593 Kuzunuki et al. Sep 2005 B2
6944846 Ryzhov Sep 2005 B2
6948094 Schultz et al. Sep 2005 B2
6950087 Knox et al. Sep 2005 B2
6950502 Jenkins Sep 2005 B1
6952799 Edwards et al. Oct 2005 B2
6954755 Reisman Oct 2005 B2
6954899 Anderson Oct 2005 B1
6956845 Baker et al. Oct 2005 B2
6957076 Hunzinger Oct 2005 B2
6957183 Malayath et al. Oct 2005 B2
6960734 Park Nov 2005 B1
6961699 Kahn et al. Nov 2005 B1
6961912 Aoki et al. Nov 2005 B2
6963759 Gerson Nov 2005 B1
6963841 Handal et al. Nov 2005 B2
6964023 Maes et al. Nov 2005 B2
6965376 Tani et al. Nov 2005 B2
6965863 Zuberec et al. Nov 2005 B1
6968311 Knockeart et al. Nov 2005 B2
6970820 Junqua et al. Nov 2005 B2
6970881 Mohan et al. Nov 2005 B1
6970915 Partovi et al. Nov 2005 B1
6970935 Maes Nov 2005 B1
6976090 Ben-Shaul et al. Dec 2005 B2
6978127 Bulthuis et al. Dec 2005 B1
6978239 Chu et al. Dec 2005 B2
6980949 Ford Dec 2005 B2
6980953 Kanevsky et al. Dec 2005 B1
6980955 Okutani et al. Dec 2005 B2
6983251 Umemoto et al. Jan 2006 B1
6985858 Frey et al. Jan 2006 B2
6985865 Packingham et al. Jan 2006 B1
6985958 Zwiegincew et al. Jan 2006 B2
6988063 Tokuda et al. Jan 2006 B2
6988071 Gazdzinski Jan 2006 B1
6990450 Case et al. Jan 2006 B2
6996520 Levin Feb 2006 B2
6996531 Korall et al. Feb 2006 B2
6996575 Cox et al. Feb 2006 B2
6999066 Litwiller Feb 2006 B2
6999914 Boerner et al. Feb 2006 B1
6999925 Fischer et al. Feb 2006 B2
6999927 Mozer et al. Feb 2006 B2
7000189 Dutta et al. Feb 2006 B2
7002556 Tsukada et al. Feb 2006 B2
7003099 Zhang et al. Feb 2006 B1
7003463 Maes et al. Feb 2006 B1
7003522 Reynar et al. Feb 2006 B1
7006969 Atal Feb 2006 B2
7006973 Genly et al. Feb 2006 B1
7007026 Wilkinson et al. Feb 2006 B2
7007239 Hawkins et al. Feb 2006 B1
7010581 Brown et al. Mar 2006 B2
7013289 Horn et al. Mar 2006 B2
7013308 Tunstall-Pedoe Mar 2006 B1
7013429 Fujimoto et al. Mar 2006 B2
7015894 Morohoshi Mar 2006 B2
7020685 Chen et al. Mar 2006 B1
7024363 Comerford et al. Apr 2006 B1
7024364 Guerra et al. Apr 2006 B2
7024366 Deyoe et al. Apr 2006 B1
7024460 Koopmas et al. Apr 2006 B2
7027568 Simpson et al. Apr 2006 B1
7027974 Busch et al. Apr 2006 B1
7027990 Sussman Apr 2006 B2
7028252 Baru et al. Apr 2006 B1
7030861 Westerman et al. Apr 2006 B1
7031530 Driggs et al. Apr 2006 B2
7031909 Mao et al. Apr 2006 B2
7035794 Sirivara Apr 2006 B2
7035801 Jimenez-Feltstrom Apr 2006 B2
7035807 Brittain et al. Apr 2006 B1
7036128 Julia et al. Apr 2006 B1
7036681 Suda et al. May 2006 B2
7038659 Rajkowski May 2006 B2
7039588 Okutani et al. May 2006 B2
7043420 Ratnaparkhi May 2006 B2
7043422 Gao et al. May 2006 B2
7046230 Zadesky et al. May 2006 B2
7046850 Braspenning et al. May 2006 B2
7047193 Bellegarda May 2006 B1
7050550 Steinbiss et al. May 2006 B2
7050976 Packingham May 2006 B1
7050977 Bennett May 2006 B1
7051096 Krawiec et al. May 2006 B1
7054419 Culliss May 2006 B2
7054888 LaChapelle et al. May 2006 B2
7057607 Mayoraz et al. Jun 2006 B2
7058569 Coorman et al. Jun 2006 B2
7058888 Gjerstad et al. Jun 2006 B1
7058889 Trovato et al. Jun 2006 B2
7062223 Gerber et al. Jun 2006 B2
7062225 White Jun 2006 B2
7062428 Hogenhout et al. Jun 2006 B2
7062438 Kobayashi et al. Jun 2006 B2
7065185 Koch Jun 2006 B1
7065485 Chong-White et al. Jun 2006 B1
7069213 Thompson Jun 2006 B2
7069220 Coffman et al. Jun 2006 B2
7069560 Cheyer et al. Jun 2006 B1
7072686 Schrager Jul 2006 B1
7072941 Griffin et al. Jul 2006 B2
7076527 Bellegarda et al. Jul 2006 B2
7079713 Simmons Jul 2006 B2
7082322 Harano Jul 2006 B2
7084758 Cole Aug 2006 B1
7084856 Huppi Aug 2006 B2
7085716 Even et al. Aug 2006 B1
7085723 Ross et al. Aug 2006 B2
7085960 Bouat et al. Aug 2006 B2
7088345 Robinson et al. Aug 2006 B2
7089292 Roderick et al. Aug 2006 B1
7092370 Jiang et al. Aug 2006 B2
7092887 Mozer et al. Aug 2006 B2
7092928 Elad et al. Aug 2006 B1
7092950 Wong et al. Aug 2006 B2
7093693 Gazdzinski Aug 2006 B1
7095733 Yarlagadda et al. Aug 2006 B1
7096183 Junqua Aug 2006 B2
7100117 Chwa et al. Aug 2006 B1
7103548 Squibbs et al. Sep 2006 B2
7107204 Liu et al. Sep 2006 B1
7110998 Bhandari et al. Sep 2006 B1
7111248 Mulvey et al. Sep 2006 B2
7111774 Song Sep 2006 B2
7112827 Hayakawa et al. Sep 2006 B2
7113803 Dehlin Sep 2006 B2
7113943 Bradford et al. Sep 2006 B2
7115035 Tanaka Oct 2006 B2
7117231 Fischer et al. Oct 2006 B2
7120865 Horvitz et al. Oct 2006 B1
7123696 Lowe Oct 2006 B2
7124081 Bellegarda Oct 2006 B1
7124082 Freedman Oct 2006 B2
7124164 Chemtob Oct 2006 B1
7127046 Smith et al. Oct 2006 B1
7127394 Strong et al. Oct 2006 B2
7127396 Chu et al. Oct 2006 B2
7127403 Saylor et al. Oct 2006 B1
7129932 Klarlund et al. Oct 2006 B1
7133900 Szeto Nov 2006 B1
7136710 Hoffberg et al. Nov 2006 B1
7136818 Cosatto et al. Nov 2006 B1
7137126 Coffman et al. Nov 2006 B1
7139697 Häkkinen et al. Nov 2006 B2
7139714 Bennett et al. Nov 2006 B2
7139722 Perrella et al. Nov 2006 B2
7143028 Hillis et al. Nov 2006 B2
7143038 Katae Nov 2006 B2
7143040 Durston et al. Nov 2006 B2
7146319 Hunt Dec 2006 B2
7146437 Robbin et al. Dec 2006 B2
7149319 Roeck Dec 2006 B2
7149695 Bellegarda Dec 2006 B1
7149964 Cottrille et al. Dec 2006 B1
7152070 Musick et al. Dec 2006 B1
7152093 Ludwig et al. Dec 2006 B2
7154526 Foote et al. Dec 2006 B2
7155668 Holland et al. Dec 2006 B2
7158647 Azima et al. Jan 2007 B2
7159174 Johnson et al. Jan 2007 B2
7162412 Yamada et al. Jan 2007 B2
7162482 Dunning Jan 2007 B1
7165073 Vandersluis Jan 2007 B2
7166791 Robbin et al. Jan 2007 B2
7171350 Lin et al. Jan 2007 B2
7171360 Huang et al. Jan 2007 B2
7174042 Simmons et al. Feb 2007 B1
7174295 Kivimaki Feb 2007 B1
7174297 Guerra et al. Feb 2007 B2
7174298 Sharma Feb 2007 B2
7177794 Mani et al. Feb 2007 B2
7177798 Hsu et al. Feb 2007 B2
7177817 Khosla et al. Feb 2007 B1
7181386 Mohri et al. Feb 2007 B2
7181388 Tian Feb 2007 B2
7184064 Zimmerman et al. Feb 2007 B2
7185276 Keswa Feb 2007 B2
7188085 Pelletier Mar 2007 B2
7190351 Goren Mar 2007 B1
7190794 Hinde Mar 2007 B2
7191118 Bellegarda Mar 2007 B2
7191131 Nagao Mar 2007 B1
7193615 Kim et al. Mar 2007 B2
7194186 Strub et al. Mar 2007 B1
7194413 Mahoney et al. Mar 2007 B2
7194471 Nagatsuka et al. Mar 2007 B1
7194611 Bear et al. Mar 2007 B2
7194699 Thomson et al. Mar 2007 B2
7197120 Luehrig et al. Mar 2007 B2
7197460 Gupta et al. Mar 2007 B1
7200550 Menezes et al. Apr 2007 B2
7200558 Kato et al. Apr 2007 B2
7200559 Wang Apr 2007 B2
7203297 Vitikainen et al. Apr 2007 B2
7203646 Bennett Apr 2007 B2
7206809 Ludwig et al. Apr 2007 B2
7212827 Veschl May 2007 B1
7216008 Sakata May 2007 B2
7216066 Di et al. May 2007 B2
7216073 Lavi et al. May 2007 B2
7216080 Tsiao et al. May 2007 B2
7218920 Hyon May 2007 B2
7218943 Klassen et al. May 2007 B2
7219063 Schalk et al. May 2007 B2
7219123 Fiechter et al. May 2007 B1
7225125 Bennett et al. May 2007 B2
7228278 Nguyen et al. Jun 2007 B2
7231343 Treadgold et al. Jun 2007 B1
7231597 Braun et al. Jun 2007 B1
7233790 Kjellberg et al. Jun 2007 B2
7233904 Luisi Jun 2007 B2
7234026 Robbin et al. Jun 2007 B2
7236932 Grajski Jun 2007 B1
7240002 Minamino et al. Jul 2007 B2
7243130 Horvitz et al. Jul 2007 B2
7243305 Schabes et al. Jul 2007 B2
7246118 Chastain et al. Jul 2007 B2
7246151 Isaacs et al. Jul 2007 B2
7248900 Deeds et al. Jul 2007 B2
7251313 Miller et al. Jul 2007 B1
7251454 White Jul 2007 B2
7254773 Bates et al. Aug 2007 B2
7257537 Ross et al. Aug 2007 B2
7259752 Simmons Aug 2007 B1
7260529 Lengen Aug 2007 B1
7260567 Parikh et al. Aug 2007 B2
7263373 Mattisson Aug 2007 B2
7266189 Day Sep 2007 B1
7266495 Beaufays et al. Sep 2007 B1
7266496 Wang et al. Sep 2007 B2
7266499 Surace et al. Sep 2007 B2
7269544 Simske Sep 2007 B2
7269556 Kiss et al. Sep 2007 B2
7272224 Normile et al. Sep 2007 B1
7275063 Horn Sep 2007 B2
7277088 Robinson et al. Oct 2007 B2
7277854 Bennett et al. Oct 2007 B2
7277855 Acker et al. Oct 2007 B1
7280958 Pavlov et al. Oct 2007 B2
7283072 Plachta et al. Oct 2007 B1
7289102 Hinckley et al. Oct 2007 B2
7290039 Lisitsa et al. Oct 2007 B1
7292579 Morris Nov 2007 B2
7292979 Karas et al. Nov 2007 B2
7292980 August et al. Nov 2007 B1
7293015 Zhou Nov 2007 B2
7296019 Chandrasekar et al. Nov 2007 B1
7296230 Fukatsu et al. Nov 2007 B2
7299033 Kjellberg et al. Nov 2007 B2
7302392 Thenthiruperai et al. Nov 2007 B1
7302394 Baray et al. Nov 2007 B1
7302686 Togawa Nov 2007 B2
7308404 Venkataraman et al. Dec 2007 B2
7308408 Stifelman et al. Dec 2007 B1
7310329 Vieri et al. Dec 2007 B2
7310600 Garner et al. Dec 2007 B1
7310605 Janakiraman et al. Dec 2007 B2
7313523 Bellegarda et al. Dec 2007 B1
7315809 Xun Jan 2008 B2
7315818 Stevens et al. Jan 2008 B2
7318020 Kim Jan 2008 B1
7319957 Robinson et al. Jan 2008 B2
7321783 Kim, II Jan 2008 B2
7322023 Shulman et al. Jan 2008 B2
7324833 White et al. Jan 2008 B2
7324947 Jordan et al. Jan 2008 B2
7328155 Endo et al. Feb 2008 B2
7328250 Wang et al. Feb 2008 B2
7345670 Armstrong Mar 2008 B2
7345671 Robbin et al. Mar 2008 B2
7349953 Lisitsa et al. Mar 2008 B2
7353139 Burrell et al. Apr 2008 B1
7359493 Wang et al. Apr 2008 B1
7359671 Richenstein et al. Apr 2008 B2
7359851 Tong et al. Apr 2008 B2
7360158 Beeman Apr 2008 B1
7362738 Taube et al. Apr 2008 B2
7363227 Mapes-Riordan et al. Apr 2008 B2
7363586 Briggs et al. Apr 2008 B1
7365260 Kawashima Apr 2008 B2
7366461 Brown Apr 2008 B1
7373291 Garst May 2008 B2
7373612 Risch et al. May 2008 B2
7376556 Bennett May 2008 B2
7376632 Sadek et al. May 2008 B1
7376645 Bernard May 2008 B2
7378963 Begault et al. May 2008 B1
7379874 Schmid et al. May 2008 B2
7380203 Keely et al. May 2008 B2
7383170 Mills et al. Jun 2008 B2
7386438 Franz et al. Jun 2008 B1
7386449 Sun et al. Jun 2008 B2
7386799 Clanton et al. Jun 2008 B1
7389224 Elworthy Jun 2008 B1
7389225 Jensen et al. Jun 2008 B1
7392185 Bennett Jun 2008 B2
7394947 Li et al. Jul 2008 B2
7398209 Kennewick et al. Jul 2008 B2
7401300 Nurmi Jul 2008 B2
7403938 Harrison et al. Jul 2008 B2
7403941 Bedworth et al. Jul 2008 B2
7404143 Freelander et al. Jul 2008 B2
7409337 Potter et al. Aug 2008 B1
7409347 Bellegarda Aug 2008 B1
7412389 Yang Aug 2008 B2
7412470 Masuno et al. Aug 2008 B2
7415100 Cooper et al. Aug 2008 B2
7415469 Singh et al. Aug 2008 B2
7418389 Chu et al. Aug 2008 B2
7418392 Mozer et al. Aug 2008 B1
7426467 Nashida et al. Sep 2008 B2
7426468 Coifman et al. Sep 2008 B2
7427024 Gazdzinski et al. Sep 2008 B1
7428541 Houle Sep 2008 B2
7433869 Gollapudi, Sr. Oct 2008 B2
7433921 Ludwig et al. Oct 2008 B2
7436947 Wadler et al. Oct 2008 B2
7441184 Frerebeau et al. Oct 2008 B2
7443316 Lim Oct 2008 B2
7444589 Zellner Oct 2008 B2
7447360 Li et al. Nov 2008 B2
7447624 Fuhrmann et al. Nov 2008 B2
7447635 Konopka et al. Nov 2008 B1
7447637 Grant et al. Nov 2008 B1
7451081 Gajic et al. Nov 2008 B1
7454351 Jeschke et al. Nov 2008 B2
7460652 Chang Dec 2008 B2
7461043 Hess Dec 2008 B2
7467087 Gillick et al. Dec 2008 B1
7467164 Marsh Dec 2008 B2
7472061 Alewine et al. Dec 2008 B1
7472065 Aaron et al. Dec 2008 B2
7475010 Chao Jan 2009 B2
7475015 Epstein et al. Jan 2009 B2
7475063 Datta et al. Jan 2009 B2
7477238 Fux et al. Jan 2009 B2
7477240 Yanagisawa Jan 2009 B2
7478037 Strong Jan 2009 B2
7478091 Mojsilovic et al. Jan 2009 B2
7478129 Chemtob Jan 2009 B1
7479948 Kim et al. Jan 2009 B2
7479949 Jobs et al. Jan 2009 B2
7483832 Tischer Jan 2009 B2
7483894 Cao Jan 2009 B2
7487089 Mozer Feb 2009 B2
7487093 Mutsuno et al. Feb 2009 B2
7490034 Finnigan et al. Feb 2009 B2
7490039 Shaffer et al. Feb 2009 B1
7493560 Kipnes et al. Feb 2009 B1
7496498 Chu et al. Feb 2009 B2
7496512 Zhao et al. Feb 2009 B2
7499923 Kawatani Mar 2009 B2
7502738 Kennewick et al. Mar 2009 B2
7505795 Lim et al. Mar 2009 B1
7508324 Suraqui Mar 2009 B2
7508373 Lin et al. Mar 2009 B2
7516123 Betz et al. Apr 2009 B2
7519327 White Apr 2009 B2
7519398 Hirose Apr 2009 B2
7522927 Fitch et al. Apr 2009 B2
7523036 Akabane et al. Apr 2009 B2
7523108 Cao Apr 2009 B2
7526466 Au Apr 2009 B2
7526738 Ording et al. Apr 2009 B2
7528713 Singh et al. May 2009 B2
7529671 Rockenbeck et al. May 2009 B2
7529676 Koyama May 2009 B2
7535997 McQuaide, Jr. et al. May 2009 B1
7536029 Choi et al. May 2009 B2
7536565 Girish et al. May 2009 B2
7538685 Cooper et al. May 2009 B1
7539619 Seligman et al. May 2009 B1
7539656 Fratkina et al. May 2009 B2
7541940 Upton Jun 2009 B2
7542967 Hurst-Hiller et al. Jun 2009 B2
7542971 Thione et al. Jun 2009 B2
7543232 Easton, Jr. et al. Jun 2009 B2
7546382 Healey et al. Jun 2009 B2
7546529 Reynar et al. Jun 2009 B2
7548895 Pulsipher Jun 2009 B2
7552045 Barliga et al. Jun 2009 B2
7552055 Lecoeuche Jun 2009 B2
7555431 Bennett Jun 2009 B2
7555496 Lantrip et al. Jun 2009 B1
7558381 Ali et al. Jul 2009 B1
7558730 Davis et al. Jul 2009 B2
7559026 Girish et al. Jul 2009 B2
7561069 Horstemeyer Jul 2009 B2
7562007 Hwang Jul 2009 B2
7562032 Abbosh et al. Jul 2009 B2
7562082 Zhou Jul 2009 B2
7565104 Brown et al. Jul 2009 B1
7565380 Venkatachary Jul 2009 B1
7571092 Nieh Aug 2009 B1
7571106 Cao et al. Aug 2009 B2
7577522 Rosenberg Aug 2009 B2
7580551 Srihari et al. Aug 2009 B1
7580576 Wang et al. Aug 2009 B2
7580839 Tamura et al. Aug 2009 B2
7584093 Potter et al. Sep 2009 B2
7584278 Rajarajan et al. Sep 2009 B2
7584429 Fabritius Sep 2009 B2
7593868 Margiloff et al. Sep 2009 B2
7596269 King et al. Sep 2009 B2
7596499 Anguera et al. Sep 2009 B2
7596606 Codignotto Sep 2009 B2
7596765 Almas Sep 2009 B2
7599918 Shen et al. Oct 2009 B2
7603349 Kraft et al. Oct 2009 B1
7603381 Burke et al. Oct 2009 B2
7606444 Erol et al. Oct 2009 B1
7609179 Diaz-Gutierrez et al. Oct 2009 B2
7610258 Yuknewicz et al. Oct 2009 B2
7613264 Wells et al. Nov 2009 B2
7614008 Ording Nov 2009 B2
7617094 Aoki et al. Nov 2009 B2
7620407 Donald et al. Nov 2009 B1
7620549 Di Cristo et al. Nov 2009 B2
7620894 Kahn Nov 2009 B1
7623119 Autio et al. Nov 2009 B2
7624007 Bennett Nov 2009 B2
7627481 Kuo et al. Dec 2009 B1
7630901 Omi Dec 2009 B2
7633076 Huppi et al. Dec 2009 B2
7634409 Kennewick et al. Dec 2009 B2
7634413 Kuo et al. Dec 2009 B1
7634718 Nakajima Dec 2009 B2
7634732 Blagsvedt et al. Dec 2009 B1
7636657 Ju et al. Dec 2009 B2
7640158 Detlef et al. Dec 2009 B2
7640160 Di Cristo et al. Dec 2009 B2
7643990 Bellegarda Jan 2010 B1
7647225 Bennett et al. Jan 2010 B2
7649454 Singh et al. Jan 2010 B2
7649877 Vieri et al. Jan 2010 B2
7653883 Hotelling et al. Jan 2010 B2
7656393 King et al. Feb 2010 B2
7657424 Bennett Feb 2010 B2
7657430 Ogawa Feb 2010 B2
7657828 Lucas Feb 2010 B2
7657844 Gibson et al. Feb 2010 B2
7657849 Chaudhri et al. Feb 2010 B2
7660715 Thambiratnam Feb 2010 B1
7663607 Hotelling et al. Feb 2010 B2
7664558 Lindahl et al. Feb 2010 B2
7664638 Cooper et al. Feb 2010 B2
7668710 Doyle Feb 2010 B2
7669134 Christie et al. Feb 2010 B1
7672841 Bennett Mar 2010 B2
7672952 Isaacson et al. Mar 2010 B2
7673238 Girish et al. Mar 2010 B2
7673251 Wibisono Mar 2010 B1
7673340 Cohen et al. Mar 2010 B1
7676026 Baxter, Jr. Mar 2010 B1
7676365 Hwang et al. Mar 2010 B2
7676463 Thompson et al. Mar 2010 B2
7679534 Kay et al. Mar 2010 B2
7680649 Park Mar 2010 B2
7681126 Roose Mar 2010 B2
7683886 Willey Mar 2010 B2
7683893 Kim Mar 2010 B2
7684985 Dominach et al. Mar 2010 B2
7684990 Caskey et al. Mar 2010 B2
7684991 Stohr et al. Mar 2010 B2
7689245 Cox et al. Mar 2010 B2
7689408 Chen et al. Mar 2010 B2
7689409 Heinecke Mar 2010 B2
7689412 Wu et al. Mar 2010 B2
7689421 Li et al. Mar 2010 B2
7689916 Goel et al. Mar 2010 B1
7693715 Hwang et al. Apr 2010 B2
7693717 Kahn et al. Apr 2010 B2
7693719 Chu et al. Apr 2010 B2
7693720 Kennewick et al. Apr 2010 B2
7698131 Bennett Apr 2010 B2
7698136 Nguyen et al. Apr 2010 B1
7702500 Blaedow Apr 2010 B2
7702508 Bennett Apr 2010 B2
7703091 Martin et al. Apr 2010 B1
7706510 Ng Apr 2010 B2
7707026 Liu Apr 2010 B2
7707027 Balchandran et al. Apr 2010 B2
7707032 Wang et al. Apr 2010 B2
7707221 Dunning et al. Apr 2010 B1
7707226 Tonse Apr 2010 B1
7707267 Lisitsa et al. Apr 2010 B2
7710262 Ruha May 2010 B2
7711129 Lindahl et al. May 2010 B2
7711550 Feinberg et al. May 2010 B1
7711565 Gazdzinski May 2010 B1
7711672 Au May 2010 B2
7712053 Bradford et al. May 2010 B2
7716056 Weng et al. May 2010 B2
7716077 Mikurak May 2010 B1
7716216 Harik et al. May 2010 B1
7720674 Kaiser et al. May 2010 B2
7720683 Vermeulen et al. May 2010 B1
7721226 Barabe et al. May 2010 B2
7721301 Wong et al. May 2010 B2
7724242 Hillis et al. May 2010 B2
7724696 Parekh May 2010 B1
7725307 Bennett May 2010 B2
7725318 Gavalda et al. May 2010 B2
7725320 Bennett May 2010 B2
7725321 Bennett May 2010 B2
7725419 Lee et al. May 2010 B2
7725838 Williams May 2010 B2
7729904 Bennett Jun 2010 B2
7729916 Coffman et al. Jun 2010 B2
7734461 Kwak et al. Jun 2010 B2
7735012 Naik Jun 2010 B2
7739588 Reynar et al. Jun 2010 B2
7742953 King et al. Jun 2010 B2
7743188 Haitani et al. Jun 2010 B2
7747616 Yamada et al. Jun 2010 B2
7752152 Paek et al. Jul 2010 B2
7756707 Garner et al. Jul 2010 B2
7756708 Cohen et al. Jul 2010 B2
7756868 Lee Jul 2010 B2
7756871 Yacoub et al. Jul 2010 B2
7757173 Beaman Jul 2010 B2
7757176 Vakil et al. Jul 2010 B2
7757182 Elliott et al. Jul 2010 B2
7761296 Bakis et al. Jul 2010 B1
7763842 Hsu et al. Jul 2010 B2
7770104 Scopes Aug 2010 B2
7774202 Spengler et al. Aug 2010 B2
7774204 Mozer et al. Aug 2010 B2
7774388 Runchey Aug 2010 B1
7774753 Reilly et al. Aug 2010 B1
7777717 Fux et al. Aug 2010 B2
7778432 Larsen Aug 2010 B2
7778595 White et al. Aug 2010 B2
7778632 Kurlander et al. Aug 2010 B2
7778830 Davis et al. Aug 2010 B2
7779069 Frid-Nielsen et al. Aug 2010 B2
7779353 Grigoriu et al. Aug 2010 B2
7779356 Griesmer Aug 2010 B2
7779357 Naik Aug 2010 B2
7783283 Kuusinen et al. Aug 2010 B2
7783486 Rosser et al. Aug 2010 B2
7788590 Taboada et al. Aug 2010 B2
7788663 Illowsky et al. Aug 2010 B2
7796980 McKinney et al. Sep 2010 B1
7797265 Brinker et al. Sep 2010 B2
7797269 Rieman et al. Sep 2010 B2
7797331 Theimer et al. Sep 2010 B2
7797338 Feng et al. Sep 2010 B2
7797629 Fux et al. Sep 2010 B2
7801721 Rosart et al. Sep 2010 B2
7801728 Ben-David et al. Sep 2010 B2
7801729 Mozer Sep 2010 B2
7805299 Coifman Sep 2010 B2
7809550 Barrows Oct 2010 B1
7809565 Coifman Oct 2010 B2
7809569 Attwater et al. Oct 2010 B2
7809570 Kennewick et al. Oct 2010 B2
7809610 Cao Oct 2010 B2
7809744 Nevidomski et al. Oct 2010 B2
7813729 Lee et al. Oct 2010 B2
7818165 Carlgren et al. Oct 2010 B2
7818176 Freeman et al. Oct 2010 B2
7818215 King et al. Oct 2010 B2
7818291 Ferguson et al. Oct 2010 B2
7818672 Mccormack et al. Oct 2010 B2
7822608 Cross, Jr. et al. Oct 2010 B2
7823123 Sabbouh Oct 2010 B2
7826945 Zhang et al. Nov 2010 B2
7827047 Anderson et al. Nov 2010 B2
7831246 Smith et al. Nov 2010 B1
7831423 Schubert Nov 2010 B2
7831426 Bennett Nov 2010 B2
7831432 Bodin et al. Nov 2010 B2
7835504 Donald et al. Nov 2010 B1
7836437 Kacmarcik et al. Nov 2010 B2
7840348 Kim et al. Nov 2010 B2
7840400 Lavi et al. Nov 2010 B2
7840447 Kleinrock et al. Nov 2010 B2
7840581 Ross et al. Nov 2010 B2
7840912 Elias et al. Nov 2010 B2
7844394 Kim Nov 2010 B2
7848924 Nurminen et al. Dec 2010 B2
7848926 Goto et al. Dec 2010 B2
7853444 Wang et al. Dec 2010 B2
7853445 Bachenko et al. Dec 2010 B2
7853574 Kraenzel et al. Dec 2010 B2
7853577 Sundaresan et al. Dec 2010 B2
7853664 Wang et al. Dec 2010 B1
7853900 Nguyen et al. Dec 2010 B2
7861164 Qin Dec 2010 B2
7865817 Ryan et al. Jan 2011 B2
7869998 Fabbrizio et al. Jan 2011 B1
7869999 Amato et al. Jan 2011 B2
7870118 Jiang et al. Jan 2011 B2
7870133 Krishnamoorthy et al. Jan 2011 B2
7873149 Schultz et al. Jan 2011 B2
7873519 Bennett Jan 2011 B2
7873523 Potter et al. Jan 2011 B2
7873654 Bernard Jan 2011 B2
7877705 Chambers et al. Jan 2011 B2
7880730 Robinson et al. Feb 2011 B2
7881283 Cormier et al. Feb 2011 B2
7881936 Longe et al. Feb 2011 B2
7885390 Chaudhuri et al. Feb 2011 B2
7885844 Cohen et al. Feb 2011 B1
7886233 Rainisto et al. Feb 2011 B2
7889101 Yokota Feb 2011 B2
7889184 Blumenberg et al. Feb 2011 B2
7889185 Blumenberg et al. Feb 2011 B2
7890329 Wu et al. Feb 2011 B2
7890330 Ozkaragoz et al. Feb 2011 B2
7890652 Bull et al. Feb 2011 B2
7895039 Braho et al. Feb 2011 B2
7895531 Radtke et al. Feb 2011 B2
7899666 Varone Mar 2011 B2
7904297 Mirkovic et al. Mar 2011 B2
7908287 Katragadda Mar 2011 B1
7912289 Kansal et al. Mar 2011 B2
7912699 Saraclar et al. Mar 2011 B1
7912702 Bennett Mar 2011 B2
7912720 Hakkani-Tur et al. Mar 2011 B1
7912828 Bonnet et al. Mar 2011 B2
7913185 Benson et al. Mar 2011 B1
7916979 Simmons Mar 2011 B2
7917364 Yacoub Mar 2011 B2
7917367 Di Cristo et al. Mar 2011 B2
7917497 Harrison et al. Mar 2011 B2
7920678 Cooper et al. Apr 2011 B2
7920682 Byrne et al. Apr 2011 B2
7920857 Lau et al. Apr 2011 B2
7925525 Chin Apr 2011 B2
7925610 Elbaz et al. Apr 2011 B2
7929805 Wang et al. Apr 2011 B2
7930168 Weng et al. Apr 2011 B2
7930183 Odell et al. Apr 2011 B2
7930197 Ozzie et al. Apr 2011 B2
7933399 Knott et al. Apr 2011 B2
7936339 Marggraff et al. May 2011 B2
7936861 Martin et al. May 2011 B2
7936863 John et al. May 2011 B2
7937075 Zellner May 2011 B2
7941009 Li et al. May 2011 B2
7945294 Zhang et al. May 2011 B2
7945470 Cohen et al. May 2011 B1
7949529 Weider et al. May 2011 B2
7949534 Davis et al. May 2011 B2
7949752 White et al. May 2011 B2
7953679 Chidlovskii et al. May 2011 B2
7957975 Burns et al. Jun 2011 B2
7958136 Curtis et al. Jun 2011 B1
7962179 Huang Jun 2011 B2
7974835 Balchandran et al. Jul 2011 B2
7974844 Sumita Jul 2011 B2
7974972 Cao Jul 2011 B2
7975216 Woolf et al. Jul 2011 B2
7983478 Liu et al. Jul 2011 B2
7983915 Knight et al. Jul 2011 B2
7983917 Kennewick et al. Jul 2011 B2
7983919 Conkie Jul 2011 B2
7983997 Allen et al. Jul 2011 B2
7984062 Dunning et al. Jul 2011 B2
7986431 Emori et al. Jul 2011 B2
7987151 Schott et al. Jul 2011 B2
7987176 Latzina et al. Jul 2011 B2
7987244 Lewis et al. Jul 2011 B1
7991614 Washio et al. Aug 2011 B2
7992085 Wang-Aryattanwanich et al. Aug 2011 B2
7996228 Miller et al. Aug 2011 B2
7996589 Schultz et al. Aug 2011 B2
7996769 Fux et al. Aug 2011 B2
7996792 Anzures et al. Aug 2011 B2
7999669 Singh et al. Aug 2011 B2
8000453 Cooper et al. Aug 2011 B2
8001125 Magdalin et al. Aug 2011 B1
8005664 Hanumanthappa Aug 2011 B2
8005679 Jordan et al. Aug 2011 B2
8006180 Tunning et al. Aug 2011 B2
8010367 Muschett et al. Aug 2011 B2
8010614 Musat et al. Aug 2011 B1
8014308 Gates et al. Sep 2011 B2
8015006 Kennewick et al. Sep 2011 B2
8015011 Nagano et al. Sep 2011 B2
8015144 Zheng et al. Sep 2011 B2
8018431 Zehr et al. Sep 2011 B1
8019271 Izdepski Sep 2011 B1
8019604 Ma Sep 2011 B2
8020104 Robarts et al. Sep 2011 B2
8024195 Mozer et al. Sep 2011 B2
8024415 Horvitz et al. Sep 2011 B2
8027836 Baker et al. Sep 2011 B2
8031943 Chen et al. Oct 2011 B2
8032383 Bhardwaj et al. Oct 2011 B1
8032409 Mikurak Oct 2011 B1
8036901 Mozer Oct 2011 B2
8037034 Plachta et al. Oct 2011 B2
8041557 Liu Oct 2011 B2
8041570 Mirkovic et al. Oct 2011 B2
8041611 Kleinrock et al. Oct 2011 B2
8042053 Darwish et al. Oct 2011 B2
8046231 Hirota et al. Oct 2011 B2
8046363 Cha et al. Oct 2011 B2
8046374 Bromwich et al. Oct 2011 B1
8050500 Batty et al. Nov 2011 B1
8050919 Das Nov 2011 B2
8054180 Scofield et al. Nov 2011 B1
8055296 Persson et al. Nov 2011 B1
8055502 Clark et al. Nov 2011 B2
8055708 Chitsaz et al. Nov 2011 B2
8056070 Goller Nov 2011 B2
8060824 Brownrigg, Jr. et al. Nov 2011 B2
8064753 Freeman Nov 2011 B2
8065143 Yanagihara Nov 2011 B2
8065155 Gazdzinski Nov 2011 B1
8065156 Gazdzinski Nov 2011 B2
8068604 Leeds et al. Nov 2011 B2
8069046 Kennewick et al. Nov 2011 B2
8069422 Sheshagiri et al. Nov 2011 B2
8073681 Baldwin et al. Dec 2011 B2
8073695 Hendricks et al. Dec 2011 B1
8077153 Benko et al. Dec 2011 B2
8078473 Gazdzinski Dec 2011 B1
8078978 Perry et al. Dec 2011 B2
8082153 Coffman et al. Dec 2011 B2
8082498 Salamon et al. Dec 2011 B2
8090571 Elshishiny et al. Jan 2012 B2
8095364 Longe et al. Jan 2012 B2
8099289 Mozer et al. Jan 2012 B2
8099395 Pabla et al. Jan 2012 B2
8099418 Inoue et al. Jan 2012 B2
8103510 Sato Jan 2012 B2
8103947 Lunt et al. Jan 2012 B2
8107401 John et al. Jan 2012 B2
8112275 Kennewick et al. Feb 2012 B2
8112280 Lu Feb 2012 B2
8117026 Lee et al. Feb 2012 B2
8117037 Gazdzinski Feb 2012 B2
8117542 Radtke et al. Feb 2012 B2
8121413 Hwang et al. Feb 2012 B2
8121837 Agapi et al. Feb 2012 B2
8122094 Kotab Feb 2012 B1
8122353 Bouta Feb 2012 B2
8130929 Wilkes et al. Mar 2012 B2
8131557 Davis et al. Mar 2012 B2
8135115 Hogg, Jr. et al. Mar 2012 B1
8138912 Singh et al. Mar 2012 B2
8140330 Cevik et al. Mar 2012 B2
8140335 Kennewick et al. Mar 2012 B2
8140368 Eggenberger et al. Mar 2012 B2
8140567 Padovitz et al. Mar 2012 B2
8145489 Freeman et al. Mar 2012 B2
8150694 Kennewick et al. Apr 2012 B2
8150700 Shin et al. Apr 2012 B2
8155956 Cho et al. Apr 2012 B2
8156005 Vieri Apr 2012 B2
8160877 Nucci et al. Apr 2012 B1
8160883 Lecoeuche Apr 2012 B2
8165321 Paquier et al. Apr 2012 B2
8165886 Gagnon et al. Apr 2012 B1
8166019 Lee et al. Apr 2012 B1
8166032 Sommer et al. Apr 2012 B2
8170790 Lee et al. May 2012 B2
8170966 Musat et al. May 2012 B1
8171137 Parks et al. May 2012 B1
8175872 Kristjansson et al. May 2012 B2
8175876 Bou-ghazale et al. May 2012 B2
8179370 Yamasani et al. May 2012 B1
8188856 Singh et al. May 2012 B2
8190359 Bourne May 2012 B2
8190596 Nambiar et al. May 2012 B2
8194827 Jaiswal et al. Jun 2012 B2
8195460 Degani et al. Jun 2012 B2
8195467 Mozer et al. Jun 2012 B2
8195468 Kennewick et al. Jun 2012 B2
8200489 Baggenstoss Jun 2012 B1
8200495 Braho et al. Jun 2012 B2
8201109 Van Os et al. Jun 2012 B2
8204238 Mozer Jun 2012 B2
8205788 Gazdzinski et al. Jun 2012 B1
8209183 Patel et al. Jun 2012 B1
8213911 Williams et al. Jul 2012 B2
8219115 Nelissen Jul 2012 B1
8219406 Yu et al. Jul 2012 B2
8219407 Roy et al. Jul 2012 B1
8219555 Mianji Jul 2012 B1
8219608 alsafadi et al. Jul 2012 B2
8224649 Chaudhari et al. Jul 2012 B2
8224757 Bohle Jul 2012 B2
8228299 Maloney et al. Jul 2012 B1
8233919 Haag et al. Jul 2012 B2
8234111 Lloyd et al. Jul 2012 B2
8239206 LeBeau et al. Aug 2012 B1
8239207 Seligman et al. Aug 2012 B2
8244545 Paek et al. Aug 2012 B2
8244712 Serlet et al. Aug 2012 B2
8250071 Killalea et al. Aug 2012 B1
8254829 Kindred et al. Aug 2012 B1
8255216 White Aug 2012 B2
8255217 Stent et al. Aug 2012 B2
8260117 Xu et al. Sep 2012 B1
8260247 Lazaridis et al. Sep 2012 B2
8260617 Dhanakshirur et al. Sep 2012 B2
8260619 Bansal et al. Sep 2012 B1
8270933 Riemer et al. Sep 2012 B2
8271287 Kermani Sep 2012 B1
8275621 Alewine et al. Sep 2012 B2
8275736 Guo et al. Sep 2012 B2
8279171 Hirai et al. Oct 2012 B2
8280438 Barbera Oct 2012 B2
8285546 Reich Oct 2012 B2
8285551 Gazdzinski Oct 2012 B2
8285553 Gazdzinski Oct 2012 B2
8285737 Lynn et al. Oct 2012 B1
8290777 Nguyen et al. Oct 2012 B1
8290778 Gazdzinski Oct 2012 B2
8290781 Gazdzinski Oct 2012 B2
8296124 Holsztynska et al. Oct 2012 B1
8296145 Clark et al. Oct 2012 B2
8296146 Gazdzinski Oct 2012 B2
8296153 Gazdzinski Oct 2012 B2
8296380 Kelly et al. Oct 2012 B1
8296383 Lindahl Oct 2012 B2
8300776 Davies et al. Oct 2012 B2
8300801 Sweeney et al. Oct 2012 B2
8301456 Gazdzinski Oct 2012 B2
8311189 Champlin et al. Nov 2012 B2
8311834 Gazdzinski Nov 2012 B1
8311835 Lecoeuche Nov 2012 B2
8311838 Lindahl et al. Nov 2012 B2
8312017 Martin et al. Nov 2012 B2
8321786 Lunati et al. Nov 2012 B2
8326627 Kennewick et al. Dec 2012 B2
8332205 Krishnan et al. Dec 2012 B2
8332218 Cross, Jr. Dec 2012 B2
8332224 Di Cristo et al. Dec 2012 B2
8332748 Karam Dec 2012 B1
8335689 Wittenstein et al. Dec 2012 B2
8340975 Rosenberger Dec 2012 B1
8345665 Vieri et al. Jan 2013 B2
8346563 Hjelm et al. Jan 2013 B1
8346757 Lamping et al. Jan 2013 B1
8352183 Thota et al. Jan 2013 B2
8352268 Naik et al. Jan 2013 B2
8352272 Rogers et al. Jan 2013 B2
8355919 Silverman et al. Jan 2013 B2
8359234 Vieri Jan 2013 B2
8370145 Endo et al. Feb 2013 B2
8370158 Gazdzinski Feb 2013 B2
8371503 Gazdzinski Feb 2013 B2
8374871 Ehsani et al. Feb 2013 B2
8375320 Kotler et al. Feb 2013 B2
8380504 Peden et al. Feb 2013 B1
8380507 Herman et al. Feb 2013 B2
8381107 Rottler et al. Feb 2013 B2
8381135 Hotelling et al. Feb 2013 B2
8386485 Kerschberg et al. Feb 2013 B2
8386926 Matsuoka Feb 2013 B1
8391844 Lamiraux et al. Mar 2013 B2
8396714 Rogers et al. Mar 2013 B2
8396715 Odell et al. Mar 2013 B2
8401163 Kirchhoff et al. Mar 2013 B1
8406745 Upadhyay et al. Mar 2013 B1
8407239 Dean et al. Mar 2013 B2
8423288 Stahl et al. Apr 2013 B2
8428758 Naik et al. Apr 2013 B2
8433572 Caskey et al. Apr 2013 B2
8433778 Shreesha et al. Apr 2013 B1
8434133 Kulkarni et al. Apr 2013 B2
8442821 Vanhoucke May 2013 B1
8447612 Gazdzinski May 2013 B2
8452597 Bringert et al. May 2013 B2
8452602 Bringert et al. May 2013 B1
8453058 Coccaro et al. May 2013 B1
8457959 Kaiser Jun 2013 B2
8458115 Cai et al. Jun 2013 B2
8458278 Christie et al. Jun 2013 B2
8463592 Lu et al. Jun 2013 B2
8464150 Davidson et al. Jun 2013 B2
8473289 Jitkoff et al. Jun 2013 B2
8477323 Low et al. Jul 2013 B2
8478816 Parks et al. Jul 2013 B2
8479122 Hotelling et al. Jul 2013 B2
8484027 Murphy Jul 2013 B1
8489599 Bellotti Jul 2013 B2
8498857 Kopparapu et al. Jul 2013 B2
8514197 Shahraray et al. Aug 2013 B2
8515736 Duta Aug 2013 B1
8515750 Lei et al. Aug 2013 B1
8521513 Millett et al. Aug 2013 B2
8521526 Lloyd et al. Aug 2013 B1
8521531 Kim Aug 2013 B1
8527276 Senior et al. Sep 2013 B1
8533266 Koulomzin et al. Sep 2013 B2
8537033 Gueziec Sep 2013 B2
8539342 Lewis Sep 2013 B1
8543375 Hong Sep 2013 B2
8543397 Nguyen Sep 2013 B1
8543398 Strope et al. Sep 2013 B1
8560229 Park et al. Oct 2013 B1
8560366 Mikurak Oct 2013 B2
8571528 Channakeshava Oct 2013 B1
8571851 Tickner et al. Oct 2013 B1
8577683 Dewitt Nov 2013 B2
8583416 Huang et al. Nov 2013 B2
8583511 Hendrickson Nov 2013 B2
8583638 Donelli Nov 2013 B2
8589156 Burke et al. Nov 2013 B2
8589161 Kennewick et al. Nov 2013 B2
8589374 Chaudhari Nov 2013 B2
8589869 Wolfram Nov 2013 B2
8589911 Sharkey et al. Nov 2013 B1
8595004 Koshinaka Nov 2013 B2
8595642 Lagassey Nov 2013 B1
8600743 Lindahl et al. Dec 2013 B2
8600746 Lei et al. Dec 2013 B1
8600930 Sata et al. Dec 2013 B2
8606090 Eyer Dec 2013 B2
8606568 Tickner et al. Dec 2013 B1
8606576 Barr et al. Dec 2013 B1
8606577 Stewart et al. Dec 2013 B1
8615221 Cosenza et al. Dec 2013 B1
8620659 Di Cristo et al. Dec 2013 B2
8620662 Bellegarda Dec 2013 B2
8626681 Jurca et al. Jan 2014 B1
8630841 Van Caldwell et al. Jan 2014 B2
8635073 Chang Jan 2014 B2
8638363 King et al. Jan 2014 B2
8639516 Lindahl et al. Jan 2014 B2
8645128 Agiomyrgiannakis Feb 2014 B1
8645137 Bellegarda et al. Feb 2014 B2
8645138 Weinstein et al. Feb 2014 B1
8654936 Tofighbakhsh et al. Feb 2014 B1
8655646 Lee et al. Feb 2014 B2
8655901 Li et al. Feb 2014 B1
8660843 Falcon et al. Feb 2014 B2
8660849 Gruber et al. Feb 2014 B2
8660924 Hoch et al. Feb 2014 B2
8660970 Fiedorowicz Feb 2014 B1
8661112 Creamer et al. Feb 2014 B2
8661340 Goldsmith et al. Feb 2014 B2
8670979 Gruber et al. Mar 2014 B2
8675084 Bolton et al. Mar 2014 B2
8676904 Lindahl et al. Mar 2014 B2
8677377 Cheyer et al. Mar 2014 B2
8681950 Vlack et al. Mar 2014 B2
8682667 Haughay et al. Mar 2014 B2
8687777 Lavian et al. Apr 2014 B1
8688446 Yanagihara et al. Apr 2014 B2
8688453 Joshi et al. Apr 2014 B1
8689135 Portele et al. Apr 2014 B2
8694322 Snitkovskiy et al. Apr 2014 B2
8695074 Saraf et al. Apr 2014 B2
8696364 Cohen Apr 2014 B2
8706472 Ramerth et al. Apr 2014 B2
8706474 Blume et al. Apr 2014 B2
8706503 Cheyer et al. Apr 2014 B2
8707195 Fleizach et al. Apr 2014 B2
8712778 Thenthiruperai Apr 2014 B1
8713119 Lindahl et al. Apr 2014 B2
8713418 King et al. Apr 2014 B2
8719006 Bellegarda et al. May 2014 B2
8719014 Wagner et al. May 2014 B2
8719039 Sharifi May 2014 B1
8731610 Appaji May 2014 B2
8731912 Tickner et al. May 2014 B1
8731942 Cheyer et al. May 2014 B2
8739208 Rodriguez et al. May 2014 B2
8744852 Seymour et al. Jun 2014 B1
8751971 Fleizach et al. Jun 2014 B2
8760537 Johnson et al. Jun 2014 B2
8762145 Ouchi et al. Jun 2014 B2
8762156 Chen et al. Jun 2014 B2
8762469 Lindahl et al. Jun 2014 B2
8768693 Lempel et al. Jul 2014 B2
8768702 Boettcher et al. Jul 2014 B2
8775154 Clinchant et al. Jul 2014 B2
8775177 Heigold et al. Jul 2014 B1
8775931 Fux et al. Jul 2014 B2
8781456 Prociw Jul 2014 B2
8781841 Wang Jul 2014 B1
8793301 Wegenkittl et al. Jul 2014 B2
8798255 Lubowich et al. Aug 2014 B2
8798995 Edara et al. Aug 2014 B1
8799000 Guzzoni et al. Aug 2014 B2
8805690 LeBeau et al. Aug 2014 B1
8812299 Su Aug 2014 B1
8812302 Xiao et al. Aug 2014 B2
8812321 Gilbert et al. Aug 2014 B2
8823507 Touloumtzis Sep 2014 B1
8831947 Wasserblat et al. Sep 2014 B2
8831949 Smith et al. Sep 2014 B1
8838457 Cerra et al. Sep 2014 B2
8855915 Furuhata et al. Oct 2014 B2
8861925 Ohme Oct 2014 B1
8862252 Rottier et al. Oct 2014 B2
8868111 Kahn et al. Oct 2014 B1
8868409 Mengibar et al. Oct 2014 B1
8868469 Xu et al. Oct 2014 B2
8868529 Lerenc Oct 2014 B2
8880405 Cerra et al. Nov 2014 B2
8886534 Nakano et al. Nov 2014 B2
8886540 Cerra et al. Nov 2014 B2
8886541 Friedlander Nov 2014 B2
8892446 Cheyer Nov 2014 B2
8893023 Perry et al. Nov 2014 B2
8897822 Martin Nov 2014 B2
8898064 Thomas et al. Nov 2014 B1
8898568 Bull et al. Nov 2014 B2
8903716 Chen et al. Dec 2014 B2
8909693 Frissora et al. Dec 2014 B2
8918321 Czahor Dec 2014 B2
8922485 Lloyd Dec 2014 B1
8930176 Li et al. Jan 2015 B2
8930191 Gruber et al. Jan 2015 B2
8938394 Faaborg et al. Jan 2015 B1
8938450 Spivack et al. Jan 2015 B2
8938688 Bradford et al. Jan 2015 B2
8942986 Cheyer et al. Jan 2015 B2
8943423 Merrill et al. Jan 2015 B2
8964947 Noolu et al. Feb 2015 B1
8972240 Brockett et al. Mar 2015 B2
8972432 Shaw et al. Mar 2015 B2
8972878 Mohler et al. Mar 2015 B2
8976063 Hawkins et al. Mar 2015 B1
8976108 Hawkins et al. Mar 2015 B2
8977255 Freeman et al. Mar 2015 B2
8983383 Haskin Mar 2015 B1
8989713 Doulton Mar 2015 B2
8990235 King et al. Mar 2015 B2
8994660 Neels et al. Mar 2015 B2
8995972 Cronin Mar 2015 B1
8996350 Dub et al. Mar 2015 B1
8996376 Fleizach et al. Mar 2015 B2
8996381 Mozer et al. Mar 2015 B2
8996639 Faaborg et al. Mar 2015 B1
9002714 Kim et al. Apr 2015 B2
9009046 Stewart Apr 2015 B1
9015036 Karov Zangvil et al. Apr 2015 B2
9020804 Barbaiani et al. Apr 2015 B2
9026425 Nikoulina et al. May 2015 B2
9026426 Wu et al. May 2015 B2
9031834 Coorman et al. May 2015 B2
9031970 Das et al. May 2015 B1
9037967 Al-Jefri et al. May 2015 B1
9043208 Koch et al. May 2015 B2
9043211 Haiut et al. May 2015 B2
9046932 Medlock et al. Jun 2015 B2
9049255 MacFarlane et al. Jun 2015 B2
9049295 Cooper et al. Jun 2015 B1
9053706 Jitkoff et al. Jun 2015 B2
9058105 Drory et al. Jun 2015 B2
9058332 Darby et al. Jun 2015 B1
9058811 Wang et al. Jun 2015 B2
9063979 Chiu et al. Jun 2015 B2
9064495 Torok et al. Jun 2015 B1
9065660 Ellis et al. Jun 2015 B2
9070247 Kuhn et al. Jun 2015 B2
9070366 Mathias et al. Jun 2015 B1
9071701 Donaldson et al. Jun 2015 B2
9075435 Noble et al. Jul 2015 B1
9076448 Bennett et al. Jul 2015 B2
9076450 Sadek et al. Jul 2015 B1
9081411 Kalns et al. Jul 2015 B2
9081482 Zhai et al. Jul 2015 B1
9082402 Yadgar et al. Jul 2015 B2
9083581 Addepalli et al. Jul 2015 B1
9094636 Sanders et al. Jul 2015 B1
9098467 Blanksteen et al. Aug 2015 B1
9101279 Ritchey et al. Aug 2015 B2
9112984 Sejnoha et al. Aug 2015 B2
9117447 Gruber et al. Aug 2015 B2
9123338 Sanders et al. Sep 2015 B1
9143907 Caidwell et al. Sep 2015 B1
9159319 Hoffmeister Oct 2015 B1
9164983 Liu et al. Oct 2015 B2
9171541 Kennewick et al. Oct 2015 B2
9171546 Pike Oct 2015 B1
9183845 Gopalakrishnan et al. Nov 2015 B1
9190062 Haughay Nov 2015 B2
9208153 Zaveri et al. Dec 2015 B1
9213754 Zhan et al. Dec 2015 B1
9218122 Thoma et al. Dec 2015 B2
9218809 Bellegarda Dec 2015 B2
9218819 Stekkelpa et al. Dec 2015 B1
9223537 Brown et al. Dec 2015 B2
9236047 Rasmussen Jan 2016 B2
9241073 Rensburg et al. Jan 2016 B1
9251713 Giovanniello et al. Feb 2016 B1
9255812 Maeoka et al. Feb 2016 B2
9258604 Bilobrov et al. Feb 2016 B1
9262412 Yang et al. Feb 2016 B2
9262612 Cheyer Feb 2016 B2
9263058 Huang et al. Feb 2016 B2
9280535 Varma et al. Mar 2016 B2
9282211 Osawa Mar 2016 B2
9286910 Li et al. Mar 2016 B1
9292487 Weber Mar 2016 B1
9292489 Sak et al. Mar 2016 B1
9292492 Sarikaya et al. Mar 2016 B2
9299344 Braho et al. Mar 2016 B2
9300718 Khanna Mar 2016 B2
9301256 Mohan et al. Mar 2016 B2
9305543 Fleizach et al. Apr 2016 B2
9305548 Kennewick et al. Apr 2016 B2
9311308 Sankarasubramaniam et al. Apr 2016 B2
9311912 Swietlinski et al. Apr 2016 B1
9313317 LeBeau et al. Apr 2016 B1
9318108 Gruber Apr 2016 B2
9325809 Barros et al. Apr 2016 B1
9325842 Siddiqi et al. Apr 2016 B1
9330659 Ju et al. May 2016 B2
9330668 Nanavati et al. May 2016 B2
9330720 Lee May 2016 B2
9335983 Breiner et al. May 2016 B2
9338493 Van Os et al. May 2016 B2
9349368 LeBeau et al. May 2016 B1
9355472 Kocienda et al. May 2016 B2
9361084 Costa Jun 2016 B1
9367541 Servan et al. Jun 2016 B1
9368114 Larson et al. Jun 2016 B2
9377871 Waddell et al. Jun 2016 B2
9378456 White et al. Jun 2016 B2
9378740 Rosen et al. Jun 2016 B1
9380155 Reding et al. Jun 2016 B1
9383827 Faaborg et al. Jul 2016 B1
9384185 Medlock et al. Jul 2016 B2
9390726 Smus et al. Jul 2016 B1
9396722 Chung et al. Jul 2016 B2
9401147 Jitkoff et al. Jul 2016 B2
9406224 Sanders et al. Aug 2016 B1
9406299 Gollan et al. Aug 2016 B2
9408182 Hurley et al. Aug 2016 B1
9412392 Lindahl Aug 2016 B2
9418650 Bharadwaj et al. Aug 2016 B2
9423266 Clark et al. Aug 2016 B2
9424246 Spencer et al. Aug 2016 B2
9424840 Hart et al. Aug 2016 B1
9431021 Scalise et al. Aug 2016 B1
9432499 Hajdu et al. Aug 2016 B2
9436918 Pantel et al. Sep 2016 B2
9437186 Liu et al. Sep 2016 B1
9437189 Epstein et al. Sep 2016 B2
9442687 Park et al. Sep 2016 B2
9443527 Watanabe et al. Sep 2016 B1
9454599 Golden et al. Sep 2016 B2
9454957 Mathias et al. Sep 2016 B1
9465798 Lin Oct 2016 B2
9465833 Aravamudan et al. Oct 2016 B2
9465864 Hu et al. Oct 2016 B2
9466027 Byrne et al. Oct 2016 B2
9466294 Tunstall-pedoe et al. Oct 2016 B1
9471566 Zhang et al. Oct 2016 B1
9472196 Wang et al. Oct 2016 B1
9483388 Sankaranarasimhan et al. Nov 2016 B2
9483461 Fleizach et al. Nov 2016 B2
9484021 Mairesse et al. Nov 2016 B1
9495129 Fleizach et al. Nov 2016 B2
9501741 Cheyer et al. Nov 2016 B2
9502025 Kennewick et al. Nov 2016 B2
9508028 Bannister et al. Nov 2016 B2
9510044 Pereira et al. Nov 2016 B1
9514470 Topatan et al. Dec 2016 B2
9516014 Zafiroglu et al. Dec 2016 B2
9519453 Perkuhn et al. Dec 2016 B2
9524355 Forbes et al. Dec 2016 B2
9531862 Vadodaria Dec 2016 B1
9535906 Lee et al. Jan 2017 B2
9536527 Carlson Jan 2017 B1
9547647 Badaskar Jan 2017 B2
9548050 Gruber Jan 2017 B2
9548979 Johnson et al. Jan 2017 B1
9569549 Jenkins et al. Feb 2017 B1
9575964 Yadgar et al. Feb 2017 B2
9578173 Sanghavi et al. Feb 2017 B2
9607612 Deleeuw Mar 2017 B2
9619200 Chakladar et al. Apr 2017 B2
9620113 Kennewick et al. Apr 2017 B2
9620126 Chiba Apr 2017 B2
9626955 Fleizach et al. Apr 2017 B2
9633004 Giuli et al. Apr 2017 B2
9633191 Fleizach et al. Apr 2017 B2
9633660 Haughay Apr 2017 B2
9652453 Mathur et al. May 2017 B2
9658746 Cohn et al. May 2017 B2
9659002 Medlock et al. May 2017 B2
9659298 Lynch et al. May 2017 B2
9665567 Li et al. May 2017 B2
9665662 Gautam et al. May 2017 B1
9668121 Naik et al. May 2017 B2
9672725 Dotan-Cohen et al. Jun 2017 B2
9691378 Meyers et al. Jun 2017 B1
9697822 Naik et al. Jul 2017 B1
9697827 Lilly et al. Jul 2017 B1
9698999 Mutagi Jul 2017 B2
9720907 Bangalore et al. Aug 2017 B2
9721566 Newendorp et al. Aug 2017 B2
9721570 Beal et al. Aug 2017 B1
9723130 Rand Aug 2017 B2
9734817 Putrycz Aug 2017 B1
9734839 Adams Aug 2017 B1
9741343 Miles et al. Aug 2017 B1
9747083 Roman et al. Aug 2017 B1
9747093 Latino et al. Aug 2017 B2
9755605 Li et al. Sep 2017 B1
9760566 Heck et al. Sep 2017 B2
9767710 Lee et al. Sep 2017 B2
9772994 Karov et al. Sep 2017 B2
9786271 Combs et al. Oct 2017 B1
9792907 Bocklet et al. Oct 2017 B2
9798719 Karov et al. Oct 2017 B2
9812128 Mixter et al. Nov 2017 B2
9813882 Masterman Nov 2017 B1
9818400 Paulik et al. Nov 2017 B2
9823811 Brown et al. Nov 2017 B2
9823828 Zambetti et al. Nov 2017 B2
9830044 Brown et al. Nov 2017 B2
9830449 Wagner Nov 2017 B1
9842168 Heck et al. Dec 2017 B2
9842584 Hart et al. Dec 2017 B1
9846685 Li Dec 2017 B2
9858925 Gruber et al. Jan 2018 B2
9858927 Williams et al. Jan 2018 B2
9886953 Lemay et al. Feb 2018 B2
9887949 Shepherd et al. Feb 2018 B2
9916839 Scalise et al. Mar 2018 B1
9922642 Pitschel et al. Mar 2018 B2
9934777 Joseph et al. Apr 2018 B1
9934785 Hulaud Apr 2018 B1
9946862 Yun et al. Apr 2018 B2
9948728 Linn et al. Apr 2018 B2
9959129 Kannan et al. May 2018 B2
9966065 Gruber et al. May 2018 B2
9966068 Cash et al. May 2018 B2
9967381 Kashimba et al. May 2018 B1
9971495 Shetty et al. May 2018 B2
9984686 Mutagi et al. May 2018 B1
9986419 Naik et al. May 2018 B2
9990129 Yang et al. Jun 2018 B2
9990176 Gray Jun 2018 B1
9998552 Ledet Jun 2018 B1
10001817 Zambetti et al. Jun 2018 B2
10013416 Bhardwaj et al. Jul 2018 B1
10013654 Levy et al. Jul 2018 B1
10013979 Roma et al. Jul 2018 B1
10019436 Huang Jul 2018 B2
10032451 Mamkina et al. Jul 2018 B1
10032455 Newman et al. Jul 2018 B2
10037758 Jing et al. Jul 2018 B2
10043516 Saddler et al. Aug 2018 B2
10049161 Kaneko Aug 2018 B2
10049663 Orr et al. Aug 2018 B2
10049668 Huang et al. Aug 2018 B2
10055390 Sharifi et al. Aug 2018 B2
10055681 Brown et al. Aug 2018 B2
10074360 Kim Sep 2018 B2
10074371 Wang et al. Sep 2018 B1
10083213 Podgorny et al. Sep 2018 B1
10083690 Giuli et al. Sep 2018 B2
10088972 Brown et al. Oct 2018 B2
10089072 Piersol et al. Oct 2018 B2
10096319 Jin et al. Oct 2018 B1
10101887 Bernstein et al. Oct 2018 B2
10102359 Cheyer Oct 2018 B2
10127901 Zhao et al. Nov 2018 B2
10127908 Deller et al. Nov 2018 B1
10134425 Johnson, Jr. Nov 2018 B1
10169329 Futrell et al. Jan 2019 B2
10170123 Orr et al. Jan 2019 B2
10170135 Pearce et al. Jan 2019 B1
10175879 Missig et al. Jan 2019 B2
10176167 Evermann Jan 2019 B2
10176802 Ladhak et al. Jan 2019 B1
10185542 Carson et al. Jan 2019 B2
10186254 Williams et al. Jan 2019 B2
10186266 Raj et al. Jan 2019 B1
10191627 Cieplinski et al. Jan 2019 B2
10191646 Zambetti et al. Jan 2019 B2
10191718 Rhee et al. Jan 2019 B2
10192546 Piersol et al. Jan 2019 B1
10192552 Raitio et al. Jan 2019 B2
10192557 Lee et al. Jan 2019 B2
10199051 Binder et al. Feb 2019 B2
10200824 Gross et al. Feb 2019 B2
10216351 Yang Feb 2019 B2
10216832 Bangalore et al. Feb 2019 B2
10223066 Martel et al. Mar 2019 B2
10225711 Parks et al. Mar 2019 B2
10229356 Liu et al. Mar 2019 B1
10237711 Linn et al. Mar 2019 B2
10248308 Karunamuni et al. Apr 2019 B2
10255922 Sharifi et al. Apr 2019 B1
10269345 Castillo Sanchez et al. Apr 2019 B2
10296160 Shah et al. May 2019 B2
10297253 Walker, II et al. May 2019 B2
10303772 Hosn et al. May 2019 B2
10304463 Mixter et al. May 2019 B2
10311482 Baldwin Jun 2019 B2
10311871 Newendorp et al. Jun 2019 B2
10325598 Basye et al. Jun 2019 B2
10332513 D'souza et al. Jun 2019 B1
10332518 Garg et al. Jun 2019 B2
10346540 Karov et al. Jul 2019 B2
10346753 Soon-Shiong et al. Jul 2019 B2
10353975 Oh et al. Jul 2019 B2
10354677 Mohamed et al. Jul 2019 B2
10356243 Sanghavi et al. Jul 2019 B2
10366692 Adams et al. Jul 2019 B1
10372814 Gliozzo et al. Aug 2019 B2
10389876 Engelke et al. Aug 2019 B2
10402066 Kawana Sep 2019 B2
10403283 Schramm et al. Sep 2019 B1
10409454 Kagan et al. Sep 2019 B2
10410637 Paulik et al. Sep 2019 B2
10417037 Gruber et al. Sep 2019 B2
10417344 Futrell et al. Sep 2019 B2
10417554 Scheffler Sep 2019 B2
10446142 Lim et al. Oct 2019 B2
10469665 Bell et al. Nov 2019 B1
10474961 Brigham et al. Nov 2019 B2
10496364 Yao Dec 2019 B2
10496705 Irani et al. Dec 2019 B1
10497365 Gruber et al. Dec 2019 B2
10504518 Irani et al. Dec 2019 B1
10521946 Roche et al. Dec 2019 B1
10528386 Yu Jan 2020 B2
10568032 Freeman et al. Feb 2020 B2
10585957 Heck et al. Mar 2020 B2
10630795 Aoki et al. Apr 2020 B2
10659851 Lister et al. May 2020 B2
10706841 Gruber et al. Jul 2020 B2
10757499 Vautrin et al. Aug 2020 B1
10769385 Evermann Sep 2020 B2
10795944 Brown et al. Oct 2020 B2
10796100 Bangalore et al. Oct 2020 B2
10803255 Dubyak et al. Oct 2020 B2
10811013 Seeker-walker et al. Oct 2020 B1
10957311 Solomon et al. Mar 2021 B2
20010005859 Okuyama et al. Jun 2001 A1
20010020259 Sekiguchi et al. Sep 2001 A1
20010027394 Theimer Oct 2001 A1
20010027396 Sato Oct 2001 A1
20010029455 Chin et al. Oct 2001 A1
20010030660 Zainoulline Oct 2001 A1
20010032080 Fukada Oct 2001 A1
20010041021 Boyle et al. Nov 2001 A1
20010042107 Palm Nov 2001 A1
20010044724 Hon et al. Nov 2001 A1
20010047264 Roundtree Nov 2001 A1
20010049275 Pierry et al. Dec 2001 A1
20010049277 Meyer et al. Dec 2001 A1
20010055963 Cloutier Dec 2001 A1
20010056342 Piehn et al. Dec 2001 A1
20010056347 Chazan et al. Dec 2001 A1
20020001395 Davis et al. Jan 2002 A1
20020002039 Qureshey et al. Jan 2002 A1
20020002413 Tokue Jan 2002 A1
20020002461 Tetsumoto Jan 2002 A1
20020002465 Maes Jan 2002 A1
20020002548 Roundtree et al. Jan 2002 A1
20020002575 Eisler et al. Jan 2002 A1
20020002594 Roundtree et al. Jan 2002 A1
20020004703 Gaspard, II Jan 2002 A1
20020004736 Roundtree et al. Jan 2002 A1
20020010581 Euler et al. Jan 2002 A1
20020010584 Schultz et al. Jan 2002 A1
20020010589 Nashida et al. Jan 2002 A1
20020010726 Rogson Jan 2002 A1
20020010798 Ben-Shaul et al. Jan 2002 A1
20020013707 Shaw et al. Jan 2002 A1
20020013784 Swanson Jan 2002 A1
20020013852 Janik Jan 2002 A1
20020015024 Westerman et al. Feb 2002 A1
20020015064 Robotham et al. Feb 2002 A1
20020021278 Hinckley et al. Feb 2002 A1
20020026315 Miranda Feb 2002 A1
20020026456 Bradford Feb 2002 A1
20020031254 Lantrip et al. Mar 2002 A1
20020031262 Imagawa et al. Mar 2002 A1
20020032048 Kitao et al. Mar 2002 A1
20020032564 Ehsani et al. Mar 2002 A1
20020032591 Mahaffy et al. Mar 2002 A1
20020032751 Bharadwaj Mar 2002 A1
20020035467 Morimoto et al. Mar 2002 A1
20020035469 Holzapfel Mar 2002 A1
20020035474 Alpdemir Mar 2002 A1
20020040297 Tsiao et al. Apr 2002 A1
20020040359 Green et al. Apr 2002 A1
20020042707 Zhao et al. Apr 2002 A1
20020045438 Tagawa et al. Apr 2002 A1
20020045961 Gibbs et al. Apr 2002 A1
20020046025 Hain Apr 2002 A1
20020046032 Wutte Apr 2002 A1
20020046315 Miller et al. Apr 2002 A1
20020049587 Miyazawa Apr 2002 A1
20020052730 Nakao May 2002 A1
20020052740 Charlesworth et al. May 2002 A1
20020052746 Handelman May 2002 A1
20020052747 Sarukkai May 2002 A1
20020052913 Yamada et al. May 2002 A1
20020054094 Matsuda May 2002 A1
20020055844 L'Esperance et al. May 2002 A1
20020055934 Lipscomb et al. May 2002 A1
20020057293 Liao May 2002 A1
20020059066 O'hagan May 2002 A1
20020059068 Rose et al. May 2002 A1
20020065659 Isono et al. May 2002 A1
20020065797 Meidan et al. May 2002 A1
20020067308 Robertson Jun 2002 A1
20020069063 Buchner et al. Jun 2002 A1
20020069071 Knockeart et al. Jun 2002 A1
20020069220 Tran Jun 2002 A1
20020072816 Shdema et al. Jun 2002 A1
20020072908 Case et al. Jun 2002 A1
20020072914 Alshawi et al. Jun 2002 A1
20020072915 Bower Jun 2002 A1
20020073177 Clark et al. Jun 2002 A1
20020077082 Cruickshank Jun 2002 A1
20020077817 Atal Jun 2002 A1
20020078041 Wu Jun 2002 A1
20020080163 Morey Jun 2002 A1
20020083068 Quass et al. Jun 2002 A1
20020085037 Leavitt et al. Jul 2002 A1
20020086680 Hunzinger Jul 2002 A1
20020087306 Lee et al. Jul 2002 A1
20020087508 Hull et al. Jul 2002 A1
20020087974 Sprague et al. Jul 2002 A1
20020091511 Hellwig et al. Jul 2002 A1
20020091529 Whitham Jul 2002 A1
20020095286 Ross et al. Jul 2002 A1
20020095290 Kahn et al. Jul 2002 A1
20020099547 Chu et al. Jul 2002 A1
20020099552 Rubin et al. Jul 2002 A1
20020101447 Carro Aug 2002 A1
20020103641 Kuo et al. Aug 2002 A1
20020103644 Brocious et al. Aug 2002 A1
20020103646 Kochanski et al. Aug 2002 A1
20020107684 Gao Aug 2002 A1
20020109709 Sagar Aug 2002 A1
20020110248 Kovales et al. Aug 2002 A1
20020111198 Heie et al. Aug 2002 A1
20020111810 Khan et al. Aug 2002 A1
20020116082 Gudorf Aug 2002 A1
20020116171 Russell Aug 2002 A1
20020116185 Cooper et al. Aug 2002 A1
20020116189 Yeh et al. Aug 2002 A1
20020116420 Allam et al. Aug 2002 A1
20020117384 Marchant Aug 2002 A1
20020120697 Generous et al. Aug 2002 A1
20020120925 Logan Aug 2002 A1
20020122053 Dutta et al. Sep 2002 A1
20020123804 Gwon et al. Sep 2002 A1
20020123891 Epstein et al. Sep 2002 A1
20020123894 Woodward Sep 2002 A1
20020126097 Savolainen Sep 2002 A1
20020128821 Ehsani et al. Sep 2002 A1
20020128827 Bu et al. Sep 2002 A1
20020128840 Hinde et al. Sep 2002 A1
20020129057 Spielberg Sep 2002 A1
20020133341 Gillick et al. Sep 2002 A1
20020133347 Schoneburg et al. Sep 2002 A1
20020133348 Pearson et al. Sep 2002 A1
20020133355 Ross et al. Sep 2002 A1
20020135565 Gordon et al. Sep 2002 A1
20020135618 Maes et al. Sep 2002 A1
20020137505 Eiche et al. Sep 2002 A1
20020138254 Isaka et al. Sep 2002 A1
20020138265 Stevens et al. Sep 2002 A1
20020138270 Bellegarda et al. Sep 2002 A1
20020138616 Basson et al. Sep 2002 A1
20020140679 Wen Oct 2002 A1
20020143533 Lucas et al. Oct 2002 A1
20020143542 Eide Oct 2002 A1
20020143551 Sharma et al. Oct 2002 A1
20020143826 Day et al. Oct 2002 A1
20020151297 Remboski et al. Oct 2002 A1
20020152045 Dowling et al. Oct 2002 A1
20020152255 Smith et al. Oct 2002 A1
20020154160 Hosokawa Oct 2002 A1
20020156771 Frieder et al. Oct 2002 A1
20020161865 Nguyen Oct 2002 A1
20020163544 Baker et al. Nov 2002 A1
20020164000 Cohen et al. Nov 2002 A1
20020165918 Bettis Nov 2002 A1
20020166123 Schrader et al. Nov 2002 A1
20020167534 Burke Nov 2002 A1
20020169592 Aityan Nov 2002 A1
20020169605 Damiba et al. Nov 2002 A1
20020173273 Spurgat et al. Nov 2002 A1
20020173889 Odinak et al. Nov 2002 A1
20020173955 Reich Nov 2002 A1
20020173961 Guerra Nov 2002 A1
20020173962 Tang et al. Nov 2002 A1
20020173966 Henton Nov 2002 A1
20020177993 Veditz et al. Nov 2002 A1
20020184003 Hakkinen et al. Dec 2002 A1
20020184015 Li et al. Dec 2002 A1
20020184027 Brittan et al. Dec 2002 A1
20020184189 Hay et al. Dec 2002 A1
20020188454 Sauber Dec 2002 A1
20020189426 Hirade et al. Dec 2002 A1
20020191029 Gillespie et al. Dec 2002 A1
20020193996 Squibbs et al. Dec 2002 A1
20020196911 Gao et al. Dec 2002 A1
20020198714 Zhou Dec 2002 A1
20020198715 Belrose Dec 2002 A1
20030001881 Mannheimer et al. Jan 2003 A1
20030002632 Bhogal et al. Jan 2003 A1
20030003609 Sauer et al. Jan 2003 A1
20030003897 Hyon Jan 2003 A1
20030004968 Romer et al. Jan 2003 A1
20030005174 Coffman et al. Jan 2003 A1
20030009459 Chastain et al. Jan 2003 A1
20030013483 Ausems et al. Jan 2003 A1
20030016770 Trans et al. Jan 2003 A1
20030018475 Basu et al. Jan 2003 A1
20030020760 Takatsu et al. Jan 2003 A1
20030023420 Goodman et al. Jan 2003 A1
20030023426 Pun et al. Jan 2003 A1
20030025676 Cappendijk Feb 2003 A1
20030026392 Brown et al. Feb 2003 A1
20030026402 Clapper Feb 2003 A1
20030028380 Freeland et al. Feb 2003 A1
20030030645 Ribak et al. Feb 2003 A1
20030033148 Silverman et al. Feb 2003 A1
20030033152 Cameron Feb 2003 A1
20030033153 Olson et al. Feb 2003 A1
20030033214 Mikkelsen et al. Feb 2003 A1
20030036909 Kato Feb 2003 A1
20030037073 Tokuda et al. Feb 2003 A1
20030037077 Brill et al. Feb 2003 A1
20030037254 Fischer et al. Feb 2003 A1
20030038786 Nguyen et al. Feb 2003 A1
20030040908 Yang et al. Feb 2003 A1
20030046075 Stone Mar 2003 A1
20030046401 Abbott et al. Mar 2003 A1
20030046434 Flanagin et al. Mar 2003 A1
20030048881 Trajkovic et al. Mar 2003 A1
20030050781 Tamura et al. Mar 2003 A1
20030051136 Curtis et al. Mar 2003 A1
20030055537 Odinak et al. Mar 2003 A1
20030055623 Epstein et al. Mar 2003 A1
20030061317 Brown et al. Mar 2003 A1
20030061570 Hatori et al. Mar 2003 A1
20030063073 Geaghan et al. Apr 2003 A1
20030069893 Kanai et al. Apr 2003 A1
20030074195 Bartosik et al. Apr 2003 A1
20030074198 Sussman Apr 2003 A1
20030074457 Kluth Apr 2003 A1
20030076301 Tsuk et al. Apr 2003 A1
20030078766 Appelt et al. Apr 2003 A1
20030078778 Emam et al. Apr 2003 A1
20030078779 Desai et al. Apr 2003 A1
20030078780 Kochanski et al. Apr 2003 A1
20030078969 Sprague et al. Apr 2003 A1
20030079024 Hough et al. Apr 2003 A1
20030079038 Robbin et al. Apr 2003 A1
20030080991 Crow et al. May 2003 A1
20030083113 Chua et al. May 2003 A1
20030083878 Lee et al. May 2003 A1
20030083884 Odinak et al. May 2003 A1
20030084350 Eibach et al. May 2003 A1
20030085870 Hinckley May 2003 A1
20030086699 Benyamin et al. May 2003 A1
20030088414 Huang et al. May 2003 A1
20030088421 Maes et al. May 2003 A1
20030090467 Hohl et al. May 2003 A1
20030090474 Schaefer May 2003 A1
20030095096 Robbin et al. May 2003 A1
20030097210 Horst et al. May 2003 A1
20030097379 Ireton May 2003 A1
20030097407 Litwin et al. May 2003 A1
20030097408 Kageyama et al. May 2003 A1
20030098892 Hiipakka May 2003 A1
20030099335 Tanaka et al. May 2003 A1
20030101045 Moffatt et al. May 2003 A1
20030101054 Davis May 2003 A1
20030115060 Junqua et al. Jun 2003 A1
20030115064 Gusler et al. Jun 2003 A1
20030115186 Wilkinson et al. Jun 2003 A1
20030115289 Chinn et al. Jun 2003 A1
20030115552 Jahnke et al. Jun 2003 A1
20030117365 Shteyn Jun 2003 A1
20030120494 Jost et al. Jun 2003 A1
20030122652 Himmelstein et al. Jul 2003 A1
20030122787 Zimmerman et al. Jul 2003 A1
20030125927 Seme Jul 2003 A1
20030125945 Doyle Jul 2003 A1
20030125955 Arnold et al. Jul 2003 A1
20030126559 Fuhrmann Jul 2003 A1
20030128819 Lee et al. Jul 2003 A1
20030130847 Case et al. Jul 2003 A1
20030131320 Kumhyr et al. Jul 2003 A1
20030133694 Yeo Jul 2003 A1
20030134678 Tanaka Jul 2003 A1
20030135501 Frerebeau et al. Jul 2003 A1
20030135740 Talmor et al. Jul 2003 A1
20030140088 Robinson et al. Jul 2003 A1
20030144846 Denenberg et al. Jul 2003 A1
20030145285 Miyahira et al. Jul 2003 A1
20030147512 Abburi Aug 2003 A1
20030149557 Cox et al. Aug 2003 A1
20030149567 Schmitz et al. Aug 2003 A1
20030149978 Plotnick Aug 2003 A1
20030152203 Berger et al. Aug 2003 A1
20030152894 Townshend Aug 2003 A1
20030154079 Ota et al. Aug 2003 A1
20030154081 Chu et al. Aug 2003 A1
20030154116 Lofton Aug 2003 A1
20030157968 Boman et al. Aug 2003 A1
20030158732 Pi et al. Aug 2003 A1
20030158735 Yamada et al. Aug 2003 A1
20030158737 Csicsatka Aug 2003 A1
20030160702 Tanaka Aug 2003 A1
20030160830 Degross Aug 2003 A1
20030163316 Addison et al. Aug 2003 A1
20030164848 Dutta et al. Sep 2003 A1
20030167167 Gong Sep 2003 A1
20030167318 Robbin et al. Sep 2003 A1
20030167335 Alexander Sep 2003 A1
20030171928 Falcon et al. Sep 2003 A1
20030171936 Sall et al. Sep 2003 A1
20030174830 Boyer et al. Sep 2003 A1
20030177046 Socha-Leialoha et al. Sep 2003 A1
20030179222 Noma et al. Sep 2003 A1
20030182115 Malayath et al. Sep 2003 A1
20030182131 Arnold et al. Sep 2003 A1
20030187655 Dunsmuir Oct 2003 A1
20030187659 Cho et al. Oct 2003 A1
20030187775 Du et al. Oct 2003 A1
20030187844 Li et al. Oct 2003 A1
20030187925 Inala et al. Oct 2003 A1
20030188005 Yoneda et al. Oct 2003 A1
20030188192 Tang et al. Oct 2003 A1
20030190074 Loudon et al. Oct 2003 A1
20030191625 Gorin et al. Oct 2003 A1
20030191645 Zhou Oct 2003 A1
20030193481 Sokolsky Oct 2003 A1
20030194080 Michaelis et al. Oct 2003 A1
20030195741 Mani et al. Oct 2003 A1
20030197736 Murphy Oct 2003 A1
20030197744 Irvine Oct 2003 A1
20030200085 Nguyen et al. Oct 2003 A1
20030200452 Tagawa et al. Oct 2003 A1
20030200858 Xie Oct 2003 A1
20030202697 Simard et al. Oct 2003 A1
20030204392 Finnigan et al. Oct 2003 A1
20030204492 Wolf et al. Oct 2003 A1
20030206199 Pusa et al. Nov 2003 A1
20030208756 Macrae et al. Nov 2003 A1
20030210266 Cragun et al. Nov 2003 A1
20030212543 Epstein et al. Nov 2003 A1
20030212961 Soin et al. Nov 2003 A1
20030214519 Smith et al. Nov 2003 A1
20030216919 Roushar Nov 2003 A1
20030221198 Sloo et al. Nov 2003 A1
20030224760 Day Dec 2003 A1
20030228863 Vander Veen et al. Dec 2003 A1
20030228909 Tanaka et al. Dec 2003 A1
20030229490 Etter Dec 2003 A1
20030229616 Wong Dec 2003 A1
20030233230 Ammicht et al. Dec 2003 A1
20030233237 Garside et al. Dec 2003 A1
20030233240 Kaatrasalo Dec 2003 A1
20030234824 Litwiller Dec 2003 A1
20030236663 Dimitrova et al. Dec 2003 A1
20040001396 Keller et al. Jan 2004 A1
20040006467 Anisimovich et al. Jan 2004 A1
20040008277 Nagaishi et al. Jan 2004 A1
20040010484 Foulger et al. Jan 2004 A1
20040012556 Yong et al. Jan 2004 A1
20040013252 Craner Jan 2004 A1
20040015342 Garst et al. Jan 2004 A1
20040021676 Chen et al. Feb 2004 A1
20040022369 Vitikainen et al. Feb 2004 A1
20040022373 Suder et al. Feb 2004 A1
20040023643 Vander Veen et al. Feb 2004 A1
20040024834 Alegria et al. Feb 2004 A1
20040030551 Marcu et al. Feb 2004 A1
20040030554 Boxberger-Oberoi et al. Feb 2004 A1
20040030556 Bennett Feb 2004 A1
20040030559 Payne et al. Feb 2004 A1
20040030996 Van Liempd et al. Feb 2004 A1
20040036715 Warren Feb 2004 A1
20040044516 Kennewick et al. Mar 2004 A1
20040048627 Olvera-Hernandez Mar 2004 A1
20040049388 Roth et al. Mar 2004 A1
20040049391 Polanyi et al. Mar 2004 A1
20040051729 Borden, IV Mar 2004 A1
20040052338 Celi, Jr. et al. Mar 2004 A1
20040054530 Davis et al. Mar 2004 A1
20040054533 Bellegarda Mar 2004 A1
20040054534 Junqua Mar 2004 A1
20040054535 Mackie et al. Mar 2004 A1
20040054541 Kryze et al. Mar 2004 A1
20040054690 Hillerbrand et al. Mar 2004 A1
20040055446 Robbin et al. Mar 2004 A1
20040056899 Sinclair, II et al. Mar 2004 A1
20040059577 Pickering Mar 2004 A1
20040059790 Austin-Lane et al. Mar 2004 A1
20040061717 Menon et al. Apr 2004 A1
20040062367 Fellenstein et al. Apr 2004 A1
20040064593 Sinclair et al. Apr 2004 A1
20040069122 Wilson Apr 2004 A1
20040070567 Longe et al. Apr 2004 A1
20040070612 Sinclair et al. Apr 2004 A1
20040073427 Moore Apr 2004 A1
20040073428 Zlokarnik et al. Apr 2004 A1
20040076086 Keller et al. Apr 2004 A1
20040078382 Mercer et al. Apr 2004 A1
20040085162 Agarwal et al. May 2004 A1
20040085368 Johnson, Jr. et al. May 2004 A1
20040086120 Akins, III et al. May 2004 A1
20040093213 Conkie May 2004 A1
20040093215 Gupta et al. May 2004 A1
20040093328 Damle May 2004 A1
20040094018 Ueshima et al. May 2004 A1
20040096105 Holtsberg May 2004 A1
20040098250 Kimchi et al. May 2004 A1
20040100479 Nakano et al. May 2004 A1
20040106432 Kanamori et al. Jun 2004 A1
20040107169 Lowe Jun 2004 A1
20040111266 Coorman et al. Jun 2004 A1
20040111332 Baar et al. Jun 2004 A1
20040114731 Gillett et al. Jun 2004 A1
20040120476 Harrison et al. Jun 2004 A1
20040122656 Abir Jun 2004 A1
20040122664 Lorenzo et al. Jun 2004 A1
20040122673 Park et al. Jun 2004 A1
20040124583 Landis Jul 2004 A1
20040125088 Zimmerman et al. Jul 2004 A1
20040125922 Specht Jul 2004 A1
20040127198 Roskind et al. Jul 2004 A1
20040127241 Shostak Jul 2004 A1
20040128137 Bush et al. Jul 2004 A1
20040128614 Andrews et al. Jul 2004 A1
20040133817 Choi Jul 2004 A1
20040135701 Yasuda et al. Jul 2004 A1
20040135774 La Monica Jul 2004 A1
20040136510 Vander Veen Jul 2004 A1
20040138869 Heinecke Jul 2004 A1
20040138890 Ferrans et al. Jul 2004 A1
20040145607 Alderson Jul 2004 A1
20040148154 Acero et al. Jul 2004 A1
20040152054 Gleissner et al. Aug 2004 A1
20040153306 Tanner et al. Aug 2004 A1
20040155869 Robinson et al. Aug 2004 A1
20040160419 Padgitt Aug 2004 A1
20040162741 Flaxer et al. Aug 2004 A1
20040170379 Yao et al. Sep 2004 A1
20040174399 Wu et al. Sep 2004 A1
20040174434 Walker et al. Sep 2004 A1
20040176958 Salmenkaita et al. Sep 2004 A1
20040177319 Horn Sep 2004 A1
20040178994 Kairls, Jr. Sep 2004 A1
20040181392 Parikh et al. Sep 2004 A1
20040183833 Chua Sep 2004 A1
20040186713 Gomas et al. Sep 2004 A1
20040186714 Baker Sep 2004 A1
20040186777 Margiloff et al. Sep 2004 A1
20040186857 Serlet et al. Sep 2004 A1
20040193398 Chu et al. Sep 2004 A1
20040193420 Kennewick et al. Sep 2004 A1
20040193421 Blass Sep 2004 A1
20040193426 Maddux et al. Sep 2004 A1
20040196256 Wobbrock et al. Oct 2004 A1
20040198436 Alden Oct 2004 A1
20040199375 Ehsani et al. Oct 2004 A1
20040199387 Wang et al. Oct 2004 A1
20040199663 Horvitz et al. Oct 2004 A1
20040203520 Schirtzinger et al. Oct 2004 A1
20040205151 Sprigg et al. Oct 2004 A1
20040205671 Sukehiro et al. Oct 2004 A1
20040208302 Urban et al. Oct 2004 A1
20040210442 Glynn et al. Oct 2004 A1
20040210634 Ferrer et al. Oct 2004 A1
20040213419 Varma et al. Oct 2004 A1
20040215731 Tzann-en Szeto Oct 2004 A1
20040216049 Lewis et al. Oct 2004 A1
20040218451 Said et al. Nov 2004 A1
20040220798 Chi et al. Nov 2004 A1
20040220809 Wang et al. Nov 2004 A1
20040221235 Marchisio et al. Nov 2004 A1
20040223485 Arellano et al. Nov 2004 A1
20040223599 Bear et al. Nov 2004 A1
20040224638 Fadell et al. Nov 2004 A1
20040225501 Cutaia et al. Nov 2004 A1
20040225504 Junqua et al. Nov 2004 A1
20040225650 Cooper et al. Nov 2004 A1
20040225746 Niell et al. Nov 2004 A1
20040230420 Kadambe et al. Nov 2004 A1
20040230637 Lecoueche et al. Nov 2004 A1
20040236778 Junqua et al. Nov 2004 A1
20040242286 Benco et al. Dec 2004 A1
20040243412 Gupta et al. Dec 2004 A1
20040243415 Commarford et al. Dec 2004 A1
20040243419 Wang Dec 2004 A1
20040249629 Webster Dec 2004 A1
20040249637 Baker et al. Dec 2004 A1
20040249667 Oon Dec 2004 A1
20040252119 Hunleth et al. Dec 2004 A1
20040252604 Johnson et al. Dec 2004 A1
20040252966 Holloway et al. Dec 2004 A1
20040254791 Coifman et al. Dec 2004 A1
20040254792 Busayapongchai et al. Dec 2004 A1
20040257432 Girish et al. Dec 2004 A1
20040259536 Keskar et al. Dec 2004 A1
20040260438 Chernetsky et al. Dec 2004 A1
20040260547 Cohen et al. Dec 2004 A1
20040260718 Fedorov et al. Dec 2004 A1
20040261023 Bier Dec 2004 A1
20040262051 Carro Dec 2004 A1
20040263636 Cutler et al. Dec 2004 A1
20040267825 Novak et al. Dec 2004 A1
20040268253 Demello et al. Dec 2004 A1
20040268262 Gupta et al. Dec 2004 A1
20050002507 Timmins et al. Jan 2005 A1
20050010409 Hull et al. Jan 2005 A1
20050012723 Pallakoff Jan 2005 A1
20050015254 Beaman Jan 2005 A1
20050015751 Grassens Jan 2005 A1
20050015772 Saare et al. Jan 2005 A1
20050021330 Mano et al. Jan 2005 A1
20050021424 Lewis et al. Jan 2005 A1
20050022114 Shanahan et al. Jan 2005 A1
20050024341 Gillespie et al. Feb 2005 A1
20050024345 Eastty et al. Feb 2005 A1
20050027385 Yueh Feb 2005 A1
20050030175 Wolfe Feb 2005 A1
20050031106 Henderson Feb 2005 A1
20050033582 Gadd et al. Feb 2005 A1
20050033771 Schmitter et al. Feb 2005 A1
20050034164 Sano et al. Feb 2005 A1
20050038657 Roth et al. Feb 2005 A1
20050039141 Burke et al. Feb 2005 A1
20050042591 Bloom et al. Feb 2005 A1
20050043946 Ueyama et al. Feb 2005 A1
20050043949 Roth et al. Feb 2005 A1
20050043974 Vassilev et al. Feb 2005 A1
20050044569 Marcus Feb 2005 A1
20050045373 Born Mar 2005 A1
20050049862 Choi et al. Mar 2005 A1
20050049870 Zhang et al. Mar 2005 A1
20050049880 Roth et al. Mar 2005 A1
20050055212 Nagao Mar 2005 A1
20050055403 Brittan Mar 2005 A1
20050058438 Hayashi Mar 2005 A1
20050060155 Chu et al. Mar 2005 A1
20050071165 Hofstader et al. Mar 2005 A1
20050071332 Ortega et al. Mar 2005 A1
20050071437 Bear et al. Mar 2005 A1
20050074113 Mathew et al. Apr 2005 A1
20050075881 Rigazio et al. Apr 2005 A1
20050080613 CoIledge et al. Apr 2005 A1
20050080620 Rao et al. Apr 2005 A1
20050080625 Bennett et al. Apr 2005 A1
20050080632 Endo et al. Apr 2005 A1
20050080780 Colledge et al. Apr 2005 A1
20050086059 Bennett Apr 2005 A1
20050086255 Schran et al. Apr 2005 A1
20050086605 Ferrer et al. Apr 2005 A1
20050091118 Fano Apr 2005 A1
20050094475 Naoi May 2005 A1
20050099398 Garside et al. May 2005 A1
20050100214 Zhang et al. May 2005 A1
20050102144 Rapoport May 2005 A1
20050102614 Brockett et al. May 2005 A1
20050102625 Lee et al. May 2005 A1
20050105712 Williams et al. May 2005 A1
20050108001 Aarskog May 2005 A1
20050108017 Esser et al. May 2005 A1
20050108074 Bloechl et al. May 2005 A1
20050108338 Simske et al. May 2005 A1
20050108344 Tafoya et al. May 2005 A1
20050108642 Sinclair et al. May 2005 A1
20050114124 Liu et al. May 2005 A1
20050114140 Brackett et al. May 2005 A1
20050114306 Shu et al. May 2005 A1
20050114791 Bollenbacher et al. May 2005 A1
20050119890 Hirose Jun 2005 A1
20050119897 Bennett et al. Jun 2005 A1
20050125216 Chitrapura et al. Jun 2005 A1
20050125226 Magee Jun 2005 A1
20050125235 Lazay et al. Jun 2005 A1
20050131951 Zhang et al. Jun 2005 A1
20050132301 Ikeda Jun 2005 A1
20050136949 Barnes, Jr. Jun 2005 A1
20050138305 Zellner Jun 2005 A1
20050140504 Marshall et al. Jun 2005 A1
20050143972 Gopalakrishnan et al. Jun 2005 A1
20050144003 Iso-Sipila Jun 2005 A1
20050144070 Cheshire Jun 2005 A1
20050144568 Gruen et al. Jun 2005 A1
20050148356 Ferguson et al. Jul 2005 A1
20050149214 Yoo et al. Jul 2005 A1
20050149330 Katae Jul 2005 A1
20050149332 Kuzunuki et al. Jul 2005 A1
20050149510 Shafrir Jul 2005 A1
20050152558 Van Tassel Jul 2005 A1
20050152602 Chen et al. Jul 2005 A1
20050154578 Tong et al. Jul 2005 A1
20050154580 Horowitz et al. Jul 2005 A1
20050154591 Lecoeuche Jul 2005 A1
20050159939 Mohler et al. Jul 2005 A1
20050159957 Roth et al. Jul 2005 A1
20050162395 Unruh Jul 2005 A1
20050165015 Ncube et al. Jul 2005 A1
20050165607 Di Fabbrizio et al. Jul 2005 A1
20050166153 Eytchison et al. Jul 2005 A1
20050171779 Joublin Aug 2005 A1
20050177445 Church Aug 2005 A1
20050181770 Helferich Aug 2005 A1
20050182616 Kotipalli Aug 2005 A1
20050182627 Tanaka et al. Aug 2005 A1
20050182628 Choi Aug 2005 A1
20050182629 Coorman et al. Aug 2005 A1
20050182630 Miro et al. Aug 2005 A1
20050182765 Liddy Aug 2005 A1
20050184958 Gnanamgari et al. Aug 2005 A1
20050187770 Kompe et al. Aug 2005 A1
20050187773 Filoche et al. Aug 2005 A1
20050190970 Griffin Sep 2005 A1
20050192801 Lewis et al. Sep 2005 A1
20050192807 Emam et al. Sep 2005 A1
20050192812 Buchholz et al. Sep 2005 A1
20050195077 Mcculloch et al. Sep 2005 A1
20050195429 Archbold Sep 2005 A1
20050196733 Budra et al. Sep 2005 A1
20050201572 Lindahl et al. Sep 2005 A1
20050202854 Kortum et al. Sep 2005 A1
20050203738 Hwang Sep 2005 A1
20050203747 Lecoeuche Sep 2005 A1
20050203782 Smith Sep 2005 A1
20050203991 Kawamura et al. Sep 2005 A1
20050209848 Ishii Sep 2005 A1
20050210394 Crandall et al. Sep 2005 A1
20050216331 Ahrens et al. Sep 2005 A1
20050222843 Kahn et al. Oct 2005 A1
20050222973 Kaiser Oct 2005 A1
20050228665 Kobayashi et al. Oct 2005 A1
20050245243 Zuniga Nov 2005 A1
20050246350 Canaran Nov 2005 A1
20050246365 Lowles et al. Nov 2005 A1
20050246686 Seshadri et al. Nov 2005 A1
20050246726 Labrou et al. Nov 2005 A1
20050251572 McMahan et al. Nov 2005 A1
20050254481 Vishik et al. Nov 2005 A1
20050261901 Davis et al. Nov 2005 A1
20050262440 Stanciu et al. Nov 2005 A1
20050267738 Wilkinson et al. Dec 2005 A1
20050267757 Iso-Sipila et al. Dec 2005 A1
20050268247 Baneth Dec 2005 A1
20050271216 Lashkari Dec 2005 A1
20050273332 Scott et al. Dec 2005 A1
20050273337 Erell et al. Dec 2005 A1
20050273626 Pearson et al. Dec 2005 A1
20050278297 Nelson Dec 2005 A1
20050278643 Ukai et al. Dec 2005 A1
20050278647 Leavitt et al. Dec 2005 A1
20050283363 Weng et al. Dec 2005 A1
20050283364 Longe et al. Dec 2005 A1
20050283726 Lunati Dec 2005 A1
20050283729 Morris et al. Dec 2005 A1
20050288934 Omi Dec 2005 A1
20050288936 Busayapongchai et al. Dec 2005 A1
20050289458 Kylmanen Dec 2005 A1
20050289463 Wu et al. Dec 2005 A1
20060001652 Chiu et al. Jan 2006 A1
20060004570 Ju et al. Jan 2006 A1
20060004640 Swierczek Jan 2006 A1
20060004744 Nevidomski et al. Jan 2006 A1
20060007174 Shen Jan 2006 A1
20060009973 Nguyen et al. Jan 2006 A1
20060013414 Shih Jan 2006 A1
20060013446 Stephens Jan 2006 A1
20060015326 Mori et al. Jan 2006 A1
20060015341 Baker Jan 2006 A1
20060015484 Weng et al. Jan 2006 A1
20060015819 Hawkins et al. Jan 2006 A1
20060018446 Schmandt et al. Jan 2006 A1
20060018492 Chiu et al. Jan 2006 A1
20060020890 Kroll et al. Jan 2006 A1
20060025999 Feng et al. Feb 2006 A1
20060026233 Tenembaum et al. Feb 2006 A1
20060026521 Hotelling et al. Feb 2006 A1
20060026535 Hotelling et al. Feb 2006 A1
20060026536 Hotelling et al. Feb 2006 A1
20060033724 Chaudhri et al. Feb 2006 A1
20060035632 Sorvari et al. Feb 2006 A1
20060036946 Radtke et al. Feb 2006 A1
20060041424 Todhunter et al. Feb 2006 A1
20060041431 Maes Feb 2006 A1
20060041590 King et al. Feb 2006 A1
20060047632 Zhang Mar 2006 A1
20060050865 Kortum et al. Mar 2006 A1
20060052141 Suzuki Mar 2006 A1
20060053007 Niemisto et al. Mar 2006 A1
20060053014 Yoshizawa Mar 2006 A1
20060053365 Hollander et al. Mar 2006 A1
20060053379 Henderson et al. Mar 2006 A1
20060053387 Ording Mar 2006 A1
20060058999 Barker et al. Mar 2006 A1
20060059424 Petri et al. Mar 2006 A1
20060059437 Conklin Mar 2006 A1
20060060762 Chan et al. Mar 2006 A1
20060061488 Dunton Mar 2006 A1
20060064693 Messer et al. Mar 2006 A1
20060067535 Culbert et al. Mar 2006 A1
20060067536 Culbert et al. Mar 2006 A1
20060069567 Tischer et al. Mar 2006 A1
20060069664 Ling et al. Mar 2006 A1
20060072248 Watanabe et al. Apr 2006 A1
20060072716 Pham Apr 2006 A1
20060074628 Elbaz et al. Apr 2006 A1
20060074651 Arun et al. Apr 2006 A1
20060074660 Waters et al. Apr 2006 A1
20060074674 Zhang et al. Apr 2006 A1
20060074750 Clark et al. Apr 2006 A1
20060074898 Gavalda et al. Apr 2006 A1
20060075429 Istvan et al. Apr 2006 A1
20060077055 Basir Apr 2006 A1
20060080098 Campbell Apr 2006 A1
20060085187 Barquilla Apr 2006 A1
20060085465 Nori et al. Apr 2006 A1
20060085757 Andre et al. Apr 2006 A1
20060093998 Vertegaal May 2006 A1
20060095265 Chu et al. May 2006 A1
20060095790 Nguyen et al. May 2006 A1
20060095846 Nurmi May 2006 A1
20060095848 Naik May 2006 A1
20060097991 Hotelling et al. May 2006 A1
20060100848 Cozzi et al. May 2006 A1
20060100849 Chan May 2006 A1
20060100876 Nishizaki et al. May 2006 A1
20060101354 Hashimoto et al. May 2006 A1
20060103633 Gioeli May 2006 A1
20060106592 Brockett et al. May 2006 A1
20060106594 Brockett et al. May 2006 A1
20060106595 Brockett et al. May 2006 A1
20060111906 Cross et al. May 2006 A1
20060111909 Maes et al. May 2006 A1
20060116874 Samuelsson et al. Jun 2006 A1
20060116877 Pickering et al. Jun 2006 A1
20060117002 Swen Jun 2006 A1
20060119582 Ng et al. Jun 2006 A1
20060122834 Bennett Jun 2006 A1
20060122836 Cross et al. Jun 2006 A1
20060129379 Ramsey et al. Jun 2006 A1
20060129929 Weber et al. Jun 2006 A1
20060130006 Chitale Jun 2006 A1
20060132812 Barnes et al. Jun 2006 A1
20060135214 Zhang et al. Jun 2006 A1
20060136213 Hirose et al. Jun 2006 A1
20060136280 Cho et al. Jun 2006 A1
20060136352 Brun et al. Jun 2006 A1
20060141990 Zak et al. Jun 2006 A1
20060142576 Meng et al. Jun 2006 A1
20060142993 Menendez-Pidal et al. Jun 2006 A1
20060143007 Koh et al. Jun 2006 A1
20060143559 Spielberg et al. Jun 2006 A1
20060143576 Gupta et al. Jun 2006 A1
20060148520 Baker et al. Jul 2006 A1
20060149557 Kaneko et al. Jul 2006 A1
20060149558 Kahn et al. Jul 2006 A1
20060150087 Cronenberger et al. Jul 2006 A1
20060152496 Knaven Jul 2006 A1
20060153040 Girish et al. Jul 2006 A1
20060156252 Sheshagiri et al. Jul 2006 A1
20060156307 Kunjithapatham et al. Jul 2006 A1
20060161870 Hotelling et al. Jul 2006 A1
20060161871 Hotelling et al. Jul 2006 A1
20060161872 Rytivaara et al. Jul 2006 A1
20060165105 Shenfield et al. Jul 2006 A1
20060167676 Plumb Jul 2006 A1
20060168150 Naik et al. Jul 2006 A1
20060168507 Hansen Jul 2006 A1
20060168539 Hawkins et al. Jul 2006 A1
20060172720 Islam et al. Aug 2006 A1
20060173683 Roth et al. Aug 2006 A1
20060173684 Fischer et al. Aug 2006 A1
20060174207 Deshpande Aug 2006 A1
20060178868 Billerey-Mosier Aug 2006 A1
20060181519 Vernier et al. Aug 2006 A1
20060183466 Lee et al. Aug 2006 A1
20060184886 Chung et al. Aug 2006 A1
20060187073 Lin et al. Aug 2006 A1
20060190169 Kawai Aug 2006 A1
20060190269 Tessel et al. Aug 2006 A1
20060190436 Richardson et al. Aug 2006 A1
20060190577 Yamada Aug 2006 A1
20060193518 Dong Aug 2006 A1
20060194181 Rosenberg Aug 2006 A1
20060195206 Moon et al. Aug 2006 A1
20060195323 Monne et al. Aug 2006 A1
20060195516 Beaupre Aug 2006 A1
20060197753 Hotelling Sep 2006 A1
20060197755 Bawany Sep 2006 A1
20060200253 Hoffberg et al. Sep 2006 A1
20060200342 Corston-Oliver et al. Sep 2006 A1
20060200347 Kim et al. Sep 2006 A1
20060205432 Hawkins et al. Sep 2006 A1
20060206313 Xu et al. Sep 2006 A1
20060206454 Forstall et al. Sep 2006 A1
20060206724 Schaufele et al. Sep 2006 A1
20060212415 Backer et al. Sep 2006 A1
20060217967 Goertzen et al. Sep 2006 A1
20060218244 Rasmussen et al. Sep 2006 A1
20060221738 Park et al. Oct 2006 A1
20060221788 Lindahl et al. Oct 2006 A1
20060224570 Quiroga et al. Oct 2006 A1
20060229802 Vertelney et al. Oct 2006 A1
20060229870 Kobal Oct 2006 A1
20060229876 Aaron et al. Oct 2006 A1
20060230350 Baluja Oct 2006 A1
20060230410 Kurganov et al. Oct 2006 A1
20060234680 Doulton Oct 2006 A1
20060235550 Csicsatka et al. Oct 2006 A1
20060235690 Tomasic et al. Oct 2006 A1
20060235700 Wong et al. Oct 2006 A1
20060235841 Betz et al. Oct 2006 A1
20060236262 Bathiche et al. Oct 2006 A1
20060239419 Joseph et al. Oct 2006 A1
20060239471 Mao et al. Oct 2006 A1
20060240866 Eilts et al. Oct 2006 A1
20060241948 Abrash et al. Oct 2006 A1
20060242190 Wnek Oct 2006 A1
20060246955 Nirhamo et al. Nov 2006 A1
20060247931 Caskey et al. Nov 2006 A1
20060252457 Schrager Nov 2006 A1
20060253210 Rosenberg Nov 2006 A1
20060253787 Fogg Nov 2006 A1
20060256934 Mazor Nov 2006 A1
20060258376 Ewell et al. Nov 2006 A1
20060262876 LaDue Nov 2006 A1
20060265208 Assadollahi Nov 2006 A1
20060265503 Jones et al. Nov 2006 A1
20060265648 Rainisto et al. Nov 2006 A1
20060271627 Szczepanek Nov 2006 A1
20060274051 Longe et al. Dec 2006 A1
20060274905 Lindahl et al. Dec 2006 A1
20060277031 Ramsey et al. Dec 2006 A1
20060277058 J'maev et al. Dec 2006 A1
20060282264 Denny et al. Dec 2006 A1
20060282415 Shibata et al. Dec 2006 A1
20060282455 Lee et al. Dec 2006 A1
20060286527 Morel Dec 2006 A1
20060287864 Pusa et al. Dec 2006 A1
20060288024 Braica Dec 2006 A1
20060291666 Ball et al. Dec 2006 A1
20060293876 Kamatani et al. Dec 2006 A1
20060293880 Elshishiny et al. Dec 2006 A1
20060293886 Odell et al. Dec 2006 A1
20060293889 Kiss et al. Dec 2006 A1
20070003026 Hodge et al. Jan 2007 A1
20070004451 C. Anderson Jan 2007 A1
20070005849 Oliver Jan 2007 A1
20070006098 Krumm et al. Jan 2007 A1
20070011154 Musgrove et al. Jan 2007 A1
20070014280 Cormier et al. Jan 2007 A1
20070016563 Omoigui Jan 2007 A1
20070016865 Johnson et al. Jan 2007 A1
20070021956 Qu et al. Jan 2007 A1
20070022380 Swartz et al. Jan 2007 A1
20070025704 Tsukazaki et al. Feb 2007 A1
20070026852 Logan et al. Feb 2007 A1
20070027732 Hudgens Feb 2007 A1
20070028009 Robbin et al. Feb 2007 A1
20070030824 Ribaudo et al. Feb 2007 A1
20070032247 Shaffer et al. Feb 2007 A1
20070033003 Morris Feb 2007 A1
20070033005 Cristo et al. Feb 2007 A1
20070033026 Bartosik et al. Feb 2007 A1
20070033054 Snitkovskiy et al. Feb 2007 A1
20070036117 Taube et al. Feb 2007 A1
20070036286 Champlin et al. Feb 2007 A1
20070036294 Chaudhuri et al. Feb 2007 A1
20070038436 Cristo et al. Feb 2007 A1
20070038609 Wu Feb 2007 A1
20070040813 Kushler et al. Feb 2007 A1
20070041361 Iso-Sipila Feb 2007 A1
20070042812 Basir et al. Feb 2007 A1
20070043568 Dhanakshirur et al. Feb 2007 A1
20070043687 Bodart et al. Feb 2007 A1
20070043820 George et al. Feb 2007 A1
20070044038 Horentrup et al. Feb 2007 A1
20070046641 Lim Mar 2007 A1
20070047719 Dhawan et al. Mar 2007 A1
20070050184 Drucker et al. Mar 2007 A1
20070050191 Weider et al. Mar 2007 A1
20070050393 Vogel et al. Mar 2007 A1
20070050712 Hull et al. Mar 2007 A1
20070052586 Horstemeyer Mar 2007 A1
20070055493 Lee Mar 2007 A1
20070055508 Zhao et al. Mar 2007 A1
20070055514 Beattie et al. Mar 2007 A1
20070055525 Kennewick et al. Mar 2007 A1
20070055529 Kanevsky et al. Mar 2007 A1
20070058832 Hug et al. Mar 2007 A1
20070060107 Day Mar 2007 A1
20070060118 Guyette Mar 2007 A1
20070061152 Doi Mar 2007 A1
20070061487 Moore et al. Mar 2007 A1
20070061712 Bodin et al. Mar 2007 A1
20070061754 Ardhanari et al. Mar 2007 A1
20070067173 Bellegarda Mar 2007 A1
20070067272 Flynt et al. Mar 2007 A1
20070073540 Hirakawa et al. Mar 2007 A1
20070073541 Tian Mar 2007 A1
20070073745 Scott et al. Mar 2007 A1
20070074131 Assadollahi et al. Mar 2007 A1
20070075965 Huppi et al. Apr 2007 A1
20070079027 Marriott et al. Apr 2007 A1
20070080936 Tsuk et al. Apr 2007 A1
20070083366 Peters Apr 2007 A1
20070083467 Lindahl et al. Apr 2007 A1
20070083623 Nishimura et al. Apr 2007 A1
20070088556 Andrew Apr 2007 A1
20070089132 Qureshey et al. Apr 2007 A1
20070089135 Qureshey et al. Apr 2007 A1
20070093277 Cavacuiti et al. Apr 2007 A1
20070094026 Ativanichayaphong et al. Apr 2007 A1
20070098195 Holmes May 2007 A1
20070100206 Lin et al. May 2007 A1
20070100602 Kim May 2007 A1
20070100619 Purho et al. May 2007 A1
20070100624 Weng et al. May 2007 A1
20070100635 Mahajan et al. May 2007 A1
20070100709 Lee et al. May 2007 A1
20070100790 Cheyer et al. May 2007 A1
20070100814 Lee et al. May 2007 A1
20070100883 Rose et al. May 2007 A1
20070106491 Carter et al. May 2007 A1
20070106497 Ramsey et al. May 2007 A1
20070106512 Acero et al. May 2007 A1
20070106513 Boillot et al. May 2007 A1
20070106657 Brzeski et al. May 2007 A1
20070106674 Agrawal et al. May 2007 A1
20070106685 Houh et al. May 2007 A1
20070112562 Vainio et al. May 2007 A1
20070116195 Thompson et al. May 2007 A1
20070118351 Sumita May 2007 A1
20070118377 Badino et al. May 2007 A1
20070118378 Skuratovsky May 2007 A1
20070121846 Altberg et al. May 2007 A1
20070124131 Chino et al. May 2007 A1
20070124132 Takeuchi et al. May 2007 A1
20070124149 Shen et al. May 2007 A1
20070124289 Imielinski May 2007 A1
20070124291 Hassan et al. May 2007 A1
20070124676 Amundsen et al. May 2007 A1
20070127888 Hayashi et al. Jun 2007 A1
20070128777 Yin et al. Jun 2007 A1
20070129059 Nadarajah et al. Jun 2007 A1
20070130014 Altberg et al. Jun 2007 A1
20070130128 Garg et al. Jun 2007 A1
20070132738 Lowles et al. Jun 2007 A1
20070133771 Stifelman et al. Jun 2007 A1
20070135187 Kreiner et al. Jun 2007 A1
20070135949 Snover et al. Jun 2007 A1
20070136064 Carroll Jun 2007 A1
20070136778 Birger et al. Jun 2007 A1
20070143163 Weiss et al. Jun 2007 A1
20070143376 McIntosh Jun 2007 A1
20070149252 Jobs et al. Jun 2007 A1
20070150403 Mock et al. Jun 2007 A1
20070150444 Chesnais et al. Jun 2007 A1
20070150842 Chaudhri et al. Jun 2007 A1
20070152978 Kocienda et al. Jul 2007 A1
20070152980 Kocienda et al. Jul 2007 A1
20070155346 Mijatovic et al. Jul 2007 A1
20070156410 Stohr et al. Jul 2007 A1
20070156627 D'Alicandro Jul 2007 A1
20070157089 Van Os et al. Jul 2007 A1
20070157268 Girish et al. Jul 2007 A1
20070162274 Ruiz et al. Jul 2007 A1
20070162296 Altberg et al. Jul 2007 A1
20070162414 Horowitz et al. Jul 2007 A1
20070165003 Fux et al. Jul 2007 A1
20070167136 Groth Jul 2007 A1
20070168922 Kaiser et al. Jul 2007 A1
20070173233 Vander Veen et al. Jul 2007 A1
20070173267 Klassen et al. Jul 2007 A1
20070174057 Genly Jul 2007 A1
20070174188 Fish Jul 2007 A1
20070174350 Pell et al. Jul 2007 A1
20070174396 Kumar et al. Jul 2007 A1
20070179776 Segond et al. Aug 2007 A1
20070179778 Gong et al. Aug 2007 A1
20070180383 Naik Aug 2007 A1
20070182595 Ghasabian Aug 2007 A1
20070185551 Meadows et al. Aug 2007 A1
20070185754 Schmidt Aug 2007 A1
20070185831 Churcher Aug 2007 A1
20070185917 Prahlad et al. Aug 2007 A1
20070188901 Heckerman et al. Aug 2007 A1
20070192026 Lee et al. Aug 2007 A1
20070192027 Lee et al. Aug 2007 A1
20070192105 Neeracher et al. Aug 2007 A1
20070192179 Van et al. Aug 2007 A1
20070192293 Swen Aug 2007 A1
20070192403 Heine et al. Aug 2007 A1
20070192744 Reponen Aug 2007 A1
20070198267 Jones et al. Aug 2007 A1
20070198269 Braho et al. Aug 2007 A1
20070198273 Hennecke Aug 2007 A1
20070198566 Sustik Aug 2007 A1
20070203955 Pomerantz Aug 2007 A1
20070207785 Chatterjee et al. Sep 2007 A1
20070208555 Blass et al. Sep 2007 A1
20070208569 Subramanian et al. Sep 2007 A1
20070208579 Peterson Sep 2007 A1
20070208726 Krishnaprasad et al. Sep 2007 A1
20070211071 Slotznick et al. Sep 2007 A1
20070213099 Bast Sep 2007 A1
20070213857 Bodin et al. Sep 2007 A1
20070213984 Ativanichayaphong et al. Sep 2007 A1
20070213986 Bodin et al. Sep 2007 A1
20070214122 Bala Sep 2007 A1
20070217693 Kretzschmar, Jr. Sep 2007 A1
20070219645 Thomas et al. Sep 2007 A1
20070219777 Chu et al. Sep 2007 A1
20070219801 Sundaram et al. Sep 2007 A1
20070219803 Chiu et al. Sep 2007 A1
20070219983 Fish Sep 2007 A1
20070225980 Sumita Sep 2007 A1
20070225984 Milstein et al. Sep 2007 A1
20070226652 Kikuchi et al. Sep 2007 A1
20070229323 Plachta et al. Oct 2007 A1
20070230729 Naylor et al. Oct 2007 A1
20070233484 Coelho et al. Oct 2007 A1
20070233487 Cohen et al. Oct 2007 A1
20070233490 Yao Oct 2007 A1
20070233497 Paek et al. Oct 2007 A1
20070233692 Lisa et al. Oct 2007 A1
20070233725 Michmerhuizen et al. Oct 2007 A1
20070238488 Scott Oct 2007 A1
20070238489 Scott Oct 2007 A1
20070238520 Kacmarcik Oct 2007 A1
20070239429 Johnson et al. Oct 2007 A1
20070239453 Paek et al. Oct 2007 A1
20070240043 Fux et al. Oct 2007 A1
20070240044 Fux et al. Oct 2007 A1
20070240045 Fux et al. Oct 2007 A1
20070241885 Clipsham et al. Oct 2007 A1
20070244702 Kahn et al. Oct 2007 A1
20070244976 Carroll et al. Oct 2007 A1
20070247441 Kim et al. Oct 2007 A1
20070255435 Cohen et al. Nov 2007 A1
20070255979 Deily et al. Nov 2007 A1
20070257890 Hotelling et al. Nov 2007 A1
20070258642 Thota Nov 2007 A1
20070260460 Hyatt Nov 2007 A1
20070260595 Beatty et al. Nov 2007 A1
20070260822 Adams Nov 2007 A1
20070261080 Saetti Nov 2007 A1
20070265831 Dinur et al. Nov 2007 A1
20070265847 Ross et al. Nov 2007 A1
20070265850 Kennewick et al. Nov 2007 A1
20070271104 McKay Nov 2007 A1
20070271510 Grigoriu et al. Nov 2007 A1
20070274468 Cai Nov 2007 A1
20070276651 Bliss et al. Nov 2007 A1
20070276714 Beringer Nov 2007 A1
20070276810 Rosen Nov 2007 A1
20070277088 Bodin et al. Nov 2007 A1
20070282595 Tunning et al. Dec 2007 A1
20070285958 Platchta et al. Dec 2007 A1
20070286363 Burg et al. Dec 2007 A1
20070286399 Ramamoorthy et al. Dec 2007 A1
20070288238 Hetherington et al. Dec 2007 A1
20070288241 Cross et al. Dec 2007 A1
20070288449 Datta et al. Dec 2007 A1
20070291108 Huber et al. Dec 2007 A1
20070294077 Narayanan et al. Dec 2007 A1
20070294083 Bellegarda et al. Dec 2007 A1
20070294199 Nelken et al. Dec 2007 A1
20070294263 Punj et al. Dec 2007 A1
20070299664 Peters et al. Dec 2007 A1
20070299831 Williams et al. Dec 2007 A1
20070300140 Makela et al. Dec 2007 A1
20080001785 Elizarov et al. Jan 2008 A1
20080010355 Vieri et al. Jan 2008 A1
20080010605 Frank et al. Jan 2008 A1
20080012950 Lee et al. Jan 2008 A1
20080013751 Hiselius Jan 2008 A1
20080015863 Agapi et al. Jan 2008 A1
20080015864 Ross Jan 2008 A1
20080016575 Vincent et al. Jan 2008 A1
20080021708 Bennett et al. Jan 2008 A1
20080021886 Wang-Aryattanwanich et al. Jan 2008 A1
20080022208 Morse Jan 2008 A1
20080027726 Hansen et al. Jan 2008 A1
20080031475 Goldstein Feb 2008 A1
20080033719 Hall et al. Feb 2008 A1
20080034032 Healey et al. Feb 2008 A1
20080034044 Bhakta et al. Feb 2008 A1
20080036743 Westerman et al. Feb 2008 A1
20080040339 Zhou et al. Feb 2008 A1
20080042970 Liang et al. Feb 2008 A1
20080043936 Liebermann Feb 2008 A1
20080043943 Sipher et al. Feb 2008 A1
20080046239 Boo Feb 2008 A1
20080046250 Agapi et al. Feb 2008 A1
20080046422 Lee et al. Feb 2008 A1
20080046820 Lee et al. Feb 2008 A1
20080046948 Verosub Feb 2008 A1
20080048908 Sato Feb 2008 A1
20080052063 Bennett et al. Feb 2008 A1
20080052073 Goto et al. Feb 2008 A1
20080052077 Bennett et al. Feb 2008 A1
20080052080 Narayanan et al. Feb 2008 A1
20080052262 Kosinov et al. Feb 2008 A1
20080055194 Baudino et al. Mar 2008 A1
20080056459 Vallier et al. Mar 2008 A1
20080056579 Guha Mar 2008 A1
20080057922 Kokes et al. Mar 2008 A1
20080059190 Chu et al. Mar 2008 A1
20080059200 Puli Mar 2008 A1
20080059876 Hantler et al. Mar 2008 A1
20080062141 Chaudhri Mar 2008 A1
20080065382 Gerl et al. Mar 2008 A1
20080065387 Cross et al. Mar 2008 A1
20080071529 Silverman et al. Mar 2008 A1
20080071544 Beaufays et al. Mar 2008 A1
20080072143 Assadollahi Mar 2008 A1
20080075296 Lindahl et al. Mar 2008 A1
20080076972 Dorogusker et al. Mar 2008 A1
20080077310 Murlidar et al. Mar 2008 A1
20080077384 Agapi et al. Mar 2008 A1
20080077386 Gao et al. Mar 2008 A1
20080077391 Chino et al. Mar 2008 A1
20080077393 Gao et al. Mar 2008 A1
20080077406 Ganong, III Mar 2008 A1
20080077859 Schabes et al. Mar 2008 A1
20080079566 Singh et al. Apr 2008 A1
20080080411 Cole Apr 2008 A1
20080082332 Mallett et al. Apr 2008 A1
20080082338 O'Neil et al. Apr 2008 A1
20080082390 Hawkins et al. Apr 2008 A1
20080082576 Bodin et al. Apr 2008 A1
20080082651 Singh et al. Apr 2008 A1
20080084974 Dhanakshirur Apr 2008 A1
20080091406 Baldwin et al. Apr 2008 A1
20080091426 Rempel et al. Apr 2008 A1
20080091428 Bellegarda Apr 2008 A1
20080091443 Strope et al. Apr 2008 A1
20080096531 Mcquaide et al. Apr 2008 A1
20080096726 Riley et al. Apr 2008 A1
20080097937 Hadjarian Apr 2008 A1
20080098302 Roose Apr 2008 A1
20080098480 Henry et al. Apr 2008 A1
20080100579 Robinson et al. May 2008 A1
20080101584 Gray et al. May 2008 A1
20080103774 White May 2008 A1
20080109222 Liu May 2008 A1
20080109402 Wang et al. May 2008 A1
20080114480 Harb May 2008 A1
20080114598 Prieto et al. May 2008 A1
20080114604 Wei et al. May 2008 A1
20080114841 Lambert May 2008 A1
20080115084 Scott et al. May 2008 A1
20080118143 Gordon et al. May 2008 A1
20080119953 Reed May 2008 A1
20080120102 Rao May 2008 A1
20080120112 Jordan et al. May 2008 A1
20080120196 Reed et al. May 2008 A1
20080120311 Reed May 2008 A1
20080120312 Reed May 2008 A1
20080120330 Reed May 2008 A1
20080120342 Reed et al. May 2008 A1
20080122796 Jobs et al. May 2008 A1
20080124695 Myers et al. May 2008 A1
20080126075 Thorn et al. May 2008 A1
20080126077 Thorn May 2008 A1
20080126091 Clark et al. May 2008 A1
20080126093 Sivadas May 2008 A1
20080126100 Grost et al. May 2008 A1
20080126491 Portele et al. May 2008 A1
20080129520 Lee Jun 2008 A1
20080130867 Bowen Jun 2008 A1
20080131006 Oliver Jun 2008 A1
20080132221 Willey et al. Jun 2008 A1
20080132295 Horowitz Jun 2008 A1
20080133215 Sarukkai Jun 2008 A1
20080133228 Rao Jun 2008 A1
20080133230 Herforth et al. Jun 2008 A1
20080133241 Baker et al. Jun 2008 A1
20080133956 Fadell Jun 2008 A1
20080140413 Millman et al. Jun 2008 A1
20080140416 Shostak Jun 2008 A1
20080140652 Millman et al. Jun 2008 A1
20080140657 Azvine et al. Jun 2008 A1
20080140702 Reed et al. Jun 2008 A1
20080141125 Ghassabian et al. Jun 2008 A1
20080141180 Reed et al. Jun 2008 A1
20080141182 Barsness et al. Jun 2008 A1
20080146245 Appaji Jun 2008 A1
20080146290 Sreeram et al. Jun 2008 A1
20080147408 Da Palma et al. Jun 2008 A1
20080147411 Dames et al. Jun 2008 A1
20080147874 Yoneda et al. Jun 2008 A1
20080150900 Han Jun 2008 A1
20080154577 Kim et al. Jun 2008 A1
20080154600 Tian et al. Jun 2008 A1
20080154612 Evermann et al. Jun 2008 A1
20080154828 Antebi et al. Jun 2008 A1
20080157867 Krah Jul 2008 A1
20080161113 Hansen et al. Jul 2008 A1
20080162120 Mactavish et al. Jul 2008 A1
20080163119 Kim et al. Jul 2008 A1
20080163131 Hirai et al. Jul 2008 A1
20080165144 Forstall et al. Jul 2008 A1
20080165980 Pavlovic et al. Jul 2008 A1
20080165994 Caren et al. Jul 2008 A1
20080167013 Novick et al. Jul 2008 A1
20080167858 Christie et al. Jul 2008 A1
20080167876 Bakis et al. Jul 2008 A1
20080168052 Ott et al. Jul 2008 A1
20080168366 Kocienda et al. Jul 2008 A1
20080183473 Nagano et al. Jul 2008 A1
20080186960 Kocheisen et al. Aug 2008 A1
20080189099 Friedman et al. Aug 2008 A1
20080189106 Low et al. Aug 2008 A1
20080189110 Freeman et al. Aug 2008 A1
20080189114 Fail et al. Aug 2008 A1
20080189606 Rybak Aug 2008 A1
20080195312 Aaron et al. Aug 2008 A1
20080195388 Bower et al. Aug 2008 A1
20080195391 Marple et al. Aug 2008 A1
20080195601 Ntoulas et al. Aug 2008 A1
20080195630 Exartier et al. Aug 2008 A1
20080195940 Gail et al. Aug 2008 A1
20080200142 Abdel-Kader et al. Aug 2008 A1
20080201306 Cooper et al. Aug 2008 A1
20080201375 Khedouri et al. Aug 2008 A1
20080204379 Perez-Noguera Aug 2008 A1
20080207176 Brackbill et al. Aug 2008 A1
20080208585 Ativanichayaphong et al. Aug 2008 A1
20080208587 Ben-David et al. Aug 2008 A1
20080208864 Cucerzan et al. Aug 2008 A1
20080212796 Denda Sep 2008 A1
20080219641 Sandrew et al. Sep 2008 A1
20080221866 Katragadda et al. Sep 2008 A1
20080221879 Cerra et al. Sep 2008 A1
20080221880 Cerra et al. Sep 2008 A1
20080221887 Rose et al. Sep 2008 A1
20080221889 Cerra et al. Sep 2008 A1
20080221903 Kanevsky et al. Sep 2008 A1
20080222118 Scian et al. Sep 2008 A1
20080226130 Kansal et al. Sep 2008 A1
20080228463 Mori et al. Sep 2008 A1
20080228485 Owen Sep 2008 A1
20080228490 Fischer et al. Sep 2008 A1
20080228495 Cross et al. Sep 2008 A1
20080228496 Yu et al. Sep 2008 A1
20080228928 Donelli et al. Sep 2008 A1
20080229185 Lynch Sep 2008 A1
20080229218 Maeng Sep 2008 A1
20080235017 Satomura et al. Sep 2008 A1
20080235024 Goldberg et al. Sep 2008 A1
20080235027 Cross Sep 2008 A1
20080240569 Tonouchi Oct 2008 A1
20080242280 Shapiro et al. Oct 2008 A1
20080242322 Scott et al. Oct 2008 A1
20080243834 Rieman et al. Oct 2008 A1
20080244390 Fux et al. Oct 2008 A1
20080244446 Lefevre et al. Oct 2008 A1
20080247519 Abella et al. Oct 2008 A1
20080247529 Barton et al. Oct 2008 A1
20080248797 Freeman et al. Oct 2008 A1
20080249770 Kim et al. Oct 2008 A1
20080249778 Barton et al. Oct 2008 A1
20080253577 Eppolito Oct 2008 A1
20080254425 Cohen et al. Oct 2008 A1
20080255837 Kahn et al. Oct 2008 A1
20080255842 Simhi et al. Oct 2008 A1
20080255845 Bennett Oct 2008 A1
20080255972 Ulrich Oct 2008 A1
20080256613 Grover Oct 2008 A1
20080259022 Mansfield et al. Oct 2008 A1
20080262828 Och et al. Oct 2008 A1
20080262838 Nurminen et al. Oct 2008 A1
20080262846 Burns et al. Oct 2008 A1
20080263139 Martin Oct 2008 A1
20080270118 Kuo et al. Oct 2008 A1
20080270138 Knight et al. Oct 2008 A1
20080270139 Shi et al. Oct 2008 A1
20080270140 Hertz et al. Oct 2008 A1
20080270151 Mahoney et al. Oct 2008 A1
20080273672 Didcock et al. Nov 2008 A1
20080277473 Kotlarsky et al. Nov 2008 A1
20080281510 Shahine Nov 2008 A1
20080281582 Hsu et al. Nov 2008 A1
20080288259 Chambers et al. Nov 2008 A1
20080288460 Poniatowski et al. Nov 2008 A1
20080292112 Valenzuela et al. Nov 2008 A1
20080294418 Cleary et al. Nov 2008 A1
20080294517 Hill Nov 2008 A1
20080294651 Masuyama et al. Nov 2008 A1
20080294981 Balzano et al. Nov 2008 A1
20080298563 Rondeau et al. Dec 2008 A1
20080298766 Wen et al. Dec 2008 A1
20080299523 Chai et al. Dec 2008 A1
20080300871 Gilbert Dec 2008 A1
20080300878 Bennett Dec 2008 A1
20080303645 Seymour et al. Dec 2008 A1
20080306727 Thurmair et al. Dec 2008 A1
20080312909 Hermansen et al. Dec 2008 A1
20080312928 Goebel et al. Dec 2008 A1
20080313335 Jung et al. Dec 2008 A1
20080316183 Westerman et al. Dec 2008 A1
20080319738 Liu et al. Dec 2008 A1
20080319753 Hancock Dec 2008 A1
20080319763 Di Fabbrizio et al. Dec 2008 A1
20080319783 Yao et al. Dec 2008 A1
20090003115 Lindahl et al. Jan 2009 A1
20090005012 Van Heugten Jan 2009 A1
20090005891 Batson et al. Jan 2009 A1
20090006097 Etezadi et al. Jan 2009 A1
20090006099 Sharpe et al. Jan 2009 A1
20090006100 Badger et al. Jan 2009 A1
20090006343 Platt et al. Jan 2009 A1
20090006345 Platt et al. Jan 2009 A1
20090006488 Lindahl et al. Jan 2009 A1
20090006671 Batson et al. Jan 2009 A1
20090007001 Morin et al. Jan 2009 A1
20090011709 Akasaka et al. Jan 2009 A1
20090012748 Beish et al. Jan 2009 A1
20090012775 El Hady et al. Jan 2009 A1
20090018828 Nakadai et al. Jan 2009 A1
20090018829 Kuperstein Jan 2009 A1
20090018834 Cooper et al. Jan 2009 A1
20090018835 Cooper et al. Jan 2009 A1
20090018839 Cooper et al. Jan 2009 A1
20090018840 Lutz et al. Jan 2009 A1
20090022329 Mahowald Jan 2009 A1
20090024595 Chen Jan 2009 A1
20090028435 Wu et al. Jan 2009 A1
20090030800 Grois Jan 2009 A1
20090030978 Johnson et al. Jan 2009 A1
20090043580 Mozer et al. Feb 2009 A1
20090043583 Agapi et al. Feb 2009 A1
20090043763 Peng Feb 2009 A1
20090044094 Rapp et al. Feb 2009 A1
20090048821 Yam et al. Feb 2009 A1
20090048845 Burckart et al. Feb 2009 A1
20090049067 Murray Feb 2009 A1
20090055168 Wu et al. Feb 2009 A1
20090055175 Terrell et al. Feb 2009 A1
20090055179 Cho et al. Feb 2009 A1
20090055186 Lance et al. Feb 2009 A1
20090055381 Wu et al. Feb 2009 A1
20090055648 Kim et al. Feb 2009 A1
20090058823 Kocienda Mar 2009 A1
20090058860 Fong et al. Mar 2009 A1
20090060351 Li et al. Mar 2009 A1
20090060472 Bull et al. Mar 2009 A1
20090063974 Bull et al. Mar 2009 A1
20090064031 Bull et al. Mar 2009 A1
20090070097 Wu et al. Mar 2009 A1
20090070102 Maegawa Mar 2009 A1
20090070109 Didcock et al. Mar 2009 A1
20090070114 Staszak Mar 2009 A1
20090074214 Bradford et al. Mar 2009 A1
20090076792 Lawson-Tancred Mar 2009 A1
20090076796 Daraselia Mar 2009 A1
20090076819 Wouters et al. Mar 2009 A1
20090076821 Brenner et al. Mar 2009 A1
20090076825 Bradford et al. Mar 2009 A1
20090077165 Rhodes et al. Mar 2009 A1
20090079622 Seshadri et al. Mar 2009 A1
20090083034 Hernandez et al. Mar 2009 A1
20090083035 Huang et al. Mar 2009 A1
20090083036 Zhao et al. Mar 2009 A1
20090083037 Gleason et al. Mar 2009 A1
20090083047 Lindahl et al. Mar 2009 A1
20090089058 Bellegarda Apr 2009 A1
20090092239 Macwan et al. Apr 2009 A1
20090092260 Powers Apr 2009 A1
20090092261 Bard Apr 2009 A1
20090092262 Costa et al. Apr 2009 A1
20090094029 Koch et al. Apr 2009 A1
20090094033 Mozer et al. Apr 2009 A1
20090097634 Nambiar et al. Apr 2009 A1
20090097637 Boscher et al. Apr 2009 A1
20090100049 Cao Apr 2009 A1
20090100454 Weber Apr 2009 A1
20090104898 Harris Apr 2009 A1
20090106026 Ferrieux Apr 2009 A1
20090106376 Tom et al. Apr 2009 A1
20090106397 O'Keefe Apr 2009 A1
20090112572 Thorn Apr 2009 A1
20090112576 Jackson et al. Apr 2009 A1
20090112592 Candelore et al. Apr 2009 A1
20090112677 Rhett Apr 2009 A1
20090112892 Cardie et al. Apr 2009 A1
20090119587 Allen et al. May 2009 A1
20090123021 Jung et al. May 2009 A1
20090123071 Iwasaki May 2009 A1
20090125477 Lu et al. May 2009 A1
20090128505 Partridge et al. May 2009 A1
20090132253 Bellegarda May 2009 A1
20090132255 Lu May 2009 A1
20090137286 Luke et al. May 2009 A1
20090138736 Chin May 2009 A1
20090138828 Schultz et al. May 2009 A1
20090144049 Haddad et al. Jun 2009 A1
20090144428 Bowater et al. Jun 2009 A1
20090144609 Liang et al. Jun 2009 A1
20090146848 Ghassabian Jun 2009 A1
20090150147 Jacoby et al. Jun 2009 A1
20090150156 Kennewick et al. Jun 2009 A1
20090152349 Bonev et al. Jun 2009 A1
20090153288 Hope et al. Jun 2009 A1
20090154669 Wood et al. Jun 2009 A1
20090157382 Bar Jun 2009 A1
20090157384 Toutanova et al. Jun 2009 A1
20090157401 Bennett Jun 2009 A1
20090158200 Palahnuk et al. Jun 2009 A1
20090158323 Bober et al. Jun 2009 A1
20090158423 Orlassino et al. Jun 2009 A1
20090160803 Hashimoto Jun 2009 A1
20090164301 O'Sullivan et al. Jun 2009 A1
20090164441 Cheyer Jun 2009 A1
20090164655 Pettersson et al. Jun 2009 A1
20090164937 Alviar et al. Jun 2009 A1
20090167508 Fadell et al. Jul 2009 A1
20090167509 Fadell et al. Jul 2009 A1
20090171578 Kim et al. Jul 2009 A1
20090171662 Huang et al. Jul 2009 A1
20090171664 Kennewick et al. Jul 2009 A1
20090172108 Singh Jul 2009 A1
20090172542 Girish et al. Jul 2009 A1
20090174667 Kocienda et al. Jul 2009 A1
20090174677 Gehani et al. Jul 2009 A1
20090177300 Lee Jul 2009 A1
20090177461 Ehsani et al. Jul 2009 A1
20090177966 Chaudhri Jul 2009 A1
20090182445 Girish et al. Jul 2009 A1
20090183070 Robbins Jul 2009 A1
20090187402 Scholl Jul 2009 A1
20090187577 Reznik et al. Jul 2009 A1
20090187950 Nicas et al. Jul 2009 A1
20090191895 Singh et al. Jul 2009 A1
20090192782 Drewes Jul 2009 A1
20090192787 Roon Jul 2009 A1
20090198497 Kwon Aug 2009 A1
20090204409 Mozer et al. Aug 2009 A1
20090204478 Kaib et al. Aug 2009 A1
20090204596 Brun et al. Aug 2009 A1
20090204601 Grasset Aug 2009 A1
20090204620 Thione et al. Aug 2009 A1
20090210230 Schwarz et al. Aug 2009 A1
20090210232 Sanchez et al. Aug 2009 A1
20090213134 Stephanick et al. Aug 2009 A1
20090215503 Zhang et al. Aug 2009 A1
20090216396 Yamagata Aug 2009 A1
20090216540 Tessel et al. Aug 2009 A1
20090216704 Zheng et al. Aug 2009 A1
20090219166 MacFarlane et al. Sep 2009 A1
20090221274 Venkatakrishnan et al. Sep 2009 A1
20090222257 Sumita et al. Sep 2009 A1
20090222270 Likens et al. Sep 2009 A2
20090222488 Boerries et al. Sep 2009 A1
20090228126 Spielberg et al. Sep 2009 A1
20090228273 Wang et al. Sep 2009 A1
20090228277 Bonforte et al. Sep 2009 A1
20090228281 Singleton et al. Sep 2009 A1
20090228439 Manolescu et al. Sep 2009 A1
20090228792 Van Os et al. Sep 2009 A1
20090228842 Westerman et al. Sep 2009 A1
20090234638 Ranjan et al. Sep 2009 A1
20090234655 Kwon Sep 2009 A1
20090235280 Tannier et al. Sep 2009 A1
20090239202 Stone Sep 2009 A1
20090239552 Churchill et al. Sep 2009 A1
20090240485 Dalal et al. Sep 2009 A1
20090241054 Hendricks Sep 2009 A1
20090241760 Georges Oct 2009 A1
20090247237 Mittleman et al. Oct 2009 A1
20090248182 Logan et al. Oct 2009 A1
20090248395 Alewine et al. Oct 2009 A1
20090248402 Ito et al. Oct 2009 A1
20090248420 Basir et al. Oct 2009 A1
20090248422 Li et al. Oct 2009 A1
20090248456 Fahmy et al. Oct 2009 A1
20090249198 Davis et al. Oct 2009 A1
20090249247 Tseng et al. Oct 2009 A1
20090252350 Seguin Oct 2009 A1
20090253457 Seguin Oct 2009 A1
20090253463 Shin et al. Oct 2009 A1
20090254339 Seguin Oct 2009 A1
20090254345 Fleizach et al. Oct 2009 A1
20090254819 Song et al. Oct 2009 A1
20090254823 Barrett Oct 2009 A1
20090259969 Pallakoff Oct 2009 A1
20090265368 Crider et al. Oct 2009 A1
20090271109 Lee et al. Oct 2009 A1
20090271175 Bodin et al. Oct 2009 A1
20090271176 Bodin et al. Oct 2009 A1
20090271178 Bodin et al. Oct 2009 A1
20090271188 Agapi et al. Oct 2009 A1
20090271189 Agapi et al. Oct 2009 A1
20090274315 Carnes et al. Nov 2009 A1
20090281789 Waibel et al. Nov 2009 A1
20090284482 Chin Nov 2009 A1
20090286514 Lichorowic et al. Nov 2009 A1
20090287583 Holmes Nov 2009 A1
20090290718 Kahn et al. Nov 2009 A1
20090292987 Sorenson Nov 2009 A1
20090296552 Hicks et al. Dec 2009 A1
20090298474 George Dec 2009 A1
20090298529 Mahajan Dec 2009 A1
20090299745 Kennewick et al. Dec 2009 A1
20090299849 Cao et al. Dec 2009 A1
20090300391 Jessup et al. Dec 2009 A1
20090300488 Salamon et al. Dec 2009 A1
20090304198 Herre et al. Dec 2009 A1
20090306967 Nicolov et al. Dec 2009 A1
20090306969 Goud et al. Dec 2009 A1
20090306979 Jaiswal et al. Dec 2009 A1
20090306980 Shin Dec 2009 A1
20090306981 Cromack et al. Dec 2009 A1
20090306985 Roberts et al. Dec 2009 A1
20090306988 Chen et al. Dec 2009 A1
20090306989 Kaji Dec 2009 A1
20090307162 Bui et al. Dec 2009 A1
20090307201 Dunning et al. Dec 2009 A1
20090307584 Davidson et al. Dec 2009 A1
20090313014 Shin et al. Dec 2009 A1
20090313023 Jones Dec 2009 A1
20090313026 Coffman et al. Dec 2009 A1
20090313544 Wood et al. Dec 2009 A1
20090313564 Rottier et al. Dec 2009 A1
20090316943 Frigola Munoz et al. Dec 2009 A1
20090318119 Basir et al. Dec 2009 A1
20090318198 Carroll Dec 2009 A1
20090319266 Brown et al. Dec 2009 A1
20090326923 Yan et al. Dec 2009 A1
20090326936 Nagashima Dec 2009 A1
20090326938 Marila et al. Dec 2009 A1
20090326949 Douthitt et al. Dec 2009 A1
20090327263 Maghoul Dec 2009 A1
20090327977 Bachfischer et al. Dec 2009 A1
20100004918 Lee et al. Jan 2010 A1
20100004930 Strope et al. Jan 2010 A1
20100004931 Ma et al. Jan 2010 A1
20100005081 Bennett Jan 2010 A1
20100007569 Sim et al. Jan 2010 A1
20100010803 Ishikawa et al. Jan 2010 A1
20100010814 Patel Jan 2010 A1
20100010948 Ito et al. Jan 2010 A1
20100013760 Hirai et al. Jan 2010 A1
20100013796 Abileah et al. Jan 2010 A1
20100017212 Attwater et al. Jan 2010 A1
20100017382 Katragadda et al. Jan 2010 A1
20100017741 Karp et al. Jan 2010 A1
20100019834 Zerbe et al. Jan 2010 A1
20100020035 Ryu et al. Jan 2010 A1
20100023318 Lemoine Jan 2010 A1
20100023320 Di Cristo et al. Jan 2010 A1
20100023331 Duta et al. Jan 2010 A1
20100026526 Yokota Feb 2010 A1
20100030549 Lee et al. Feb 2010 A1
20100030562 Yoshizawa et al. Feb 2010 A1
20100030928 Conroy et al. Feb 2010 A1
20100031143 Rao et al. Feb 2010 A1
20100031150 Andrew Feb 2010 A1
20100036653 Kim et al. Feb 2010 A1
20100036655 Cecil et al. Feb 2010 A1
20100036660 Bennett Feb 2010 A1
20100036829 Leyba Feb 2010 A1
20100036928 Granito et al. Feb 2010 A1
20100037183 Miyashita et al. Feb 2010 A1
20100037187 Kondziela Feb 2010 A1
20100039495 Rahman et al. Feb 2010 A1
20100042400 Block et al. Feb 2010 A1
20100042576 Roettger et al. Feb 2010 A1
20100046842 Conwell et al. Feb 2010 A1
20100049498 Cao et al. Feb 2010 A1
20100049514 Kennewick et al. Feb 2010 A1
20100050064 Liu et al. Feb 2010 A1
20100050074 Nachmani et al. Feb 2010 A1
20100054512 Solum Mar 2010 A1
20100054601 Anbalagan et al. Mar 2010 A1
20100057435 Kent Mar 2010 A1
20100057443 Di Cristo et al. Mar 2010 A1
20100057457 Ogata et al. Mar 2010 A1
20100057461 Neubacher et al. Mar 2010 A1
20100057643 Yang Mar 2010 A1
20100058200 Jablokov et al. Mar 2010 A1
20100060646 Unsal et al. Mar 2010 A1
20100063804 Sato et al. Mar 2010 A1
20100063825 Williams et al. Mar 2010 A1
20100063961 Guiheneuf et al. Mar 2010 A1
20100064113 Lindahl et al. Mar 2010 A1
20100064218 Bull et al. Mar 2010 A1
20100064226 Stefaniak et al. Mar 2010 A1
20100066546 Aaron Mar 2010 A1
20100066684 Shahraray et al. Mar 2010 A1
20100067723 Bergmann et al. Mar 2010 A1
20100067867 Lin et al. Mar 2010 A1
20100070281 Conkie et al. Mar 2010 A1
20100070517 Ghosh et al. Mar 2010 A1
20100070521 Clinchant et al. Mar 2010 A1
20100070899 Hunt et al. Mar 2010 A1
20100071003 Bychkov et al. Mar 2010 A1
20100073201 Holcomb et al. Mar 2010 A1
20100076760 Kraenzel et al. Mar 2010 A1
20100076968 Boyns et al. Mar 2010 A1
20100076993 Klawitter et al. Mar 2010 A1
20100077350 Lim et al. Mar 2010 A1
20100077469 Furman et al. Mar 2010 A1
20100079501 Ikeda et al. Apr 2010 A1
20100079508 Hodge et al. Apr 2010 A1
20100080398 Waldmann Apr 2010 A1
20100080470 Deluca et al. Apr 2010 A1
20100081456 Singh et al. Apr 2010 A1
20100081487 Chen et al. Apr 2010 A1
20100082239 Hardy Apr 2010 A1
20100082286 Leung Apr 2010 A1
20100082327 Rogers et al. Apr 2010 A1
20100082328 Rogers et al. Apr 2010 A1
20100082329 Silverman et al. Apr 2010 A1
20100082333 Al-Shammari Apr 2010 A1
20100082343 Levit et al. Apr 2010 A1
20100082345 Wang et al. Apr 2010 A1
20100082346 Rogers et al. Apr 2010 A1
20100082347 Rogers et al. Apr 2010 A1
20100082348 Silverman et al. Apr 2010 A1
20100082349 Bellegarda et al. Apr 2010 A1
20100082376 Levitt Apr 2010 A1
20100082567 Rosenblatt et al. Apr 2010 A1
20100082653 Nair Apr 2010 A1
20100082970 Lindahl et al. Apr 2010 A1
20100086152 Rank et al. Apr 2010 A1
20100086153 Hagen et al. Apr 2010 A1
20100086156 Rank et al. Apr 2010 A1
20100088020 Sano et al. Apr 2010 A1
20100088093 Lee et al. Apr 2010 A1
20100088100 Lindahl Apr 2010 A1
20100094632 Davis et al. Apr 2010 A1
20100098231 Wohlert et al. Apr 2010 A1
20100099354 Johnson Apr 2010 A1
20100100080 Huculak et al. Apr 2010 A1
20100100212 Lindahl et al. Apr 2010 A1
20100100371 Yuezhong et al. Apr 2010 A1
20100100384 Ju et al. Apr 2010 A1
20100100385 Davis et al. Apr 2010 A1
20100100515 Bangalore et al. Apr 2010 A1
20100100816 Mccloskey et al. Apr 2010 A1
20100103776 Chan Apr 2010 A1
20100106486 Hua et al. Apr 2010 A1
20100106498 Morrison et al. Apr 2010 A1
20100106500 McKee et al. Apr 2010 A1
20100106503 Farrell et al. Apr 2010 A1
20100106975 Vandervort Apr 2010 A1
20100114856 Kuboyama May 2010 A1
20100114887 Conway et al. May 2010 A1
20100121637 Roy et al. May 2010 A1
20100122306 Pratt et al. May 2010 A1
20100125456 Weng et al. May 2010 A1
20100125458 Franco et al. May 2010 A1
20100125460 Mellott et al. May 2010 A1
20100125811 Moore et al. May 2010 A1
20100127854 Helvick et al. May 2010 A1
20100128701 Nagaraja May 2010 A1
20100131265 Liu et al. May 2010 A1
20100131269 Park et al. May 2010 A1
20100131273 Aley-Raz et al. May 2010 A1
20100131498 Linthicum et al. May 2010 A1
20100131899 Hubert May 2010 A1
20100138215 Williams Jun 2010 A1
20100138224 Bedingfield, Sr. Jun 2010 A1
20100138416 Bellotti Jun 2010 A1
20100138680 Brisebois et al. Jun 2010 A1
20100138759 Roy Jun 2010 A1
20100138798 Wilson et al. Jun 2010 A1
20100142740 Roerup Jun 2010 A1
20100145694 Ju et al. Jun 2010 A1
20100145700 Kennewick et al. Jun 2010 A1
20100145707 Ljolje et al. Jun 2010 A1
20100146442 Nagasaka et al. Jun 2010 A1
20100150321 Harris et al. Jun 2010 A1
20100153114 Shih et al. Jun 2010 A1
20100153115 Klee et al. Jun 2010 A1
20100153448 Harpur et al. Jun 2010 A1
20100153576 Wohlert et al. Jun 2010 A1
20100153968 Engel Jun 2010 A1
20100158207 Dhawan Jun 2010 A1
20100161311 Massuh Jun 2010 A1
20100161313 Karttunen Jun 2010 A1
20100161337 Pulz et al. Jun 2010 A1
20100161554 Datuashvili et al. Jun 2010 A1
20100164897 Morin et al. Jul 2010 A1
20100169075 Raffa et al. Jul 2010 A1
20100169093 Washio Jul 2010 A1
20100169097 Nachman et al. Jul 2010 A1
20100169098 Patch Jul 2010 A1
20100171713 Kwok et al. Jul 2010 A1
20100174544 Heifets Jul 2010 A1
20100175066 Paik Jul 2010 A1
20100179932 Yoon et al. Jul 2010 A1
20100179991 Lorch et al. Jul 2010 A1
20100180218 Boston et al. Jul 2010 A1
20100185434 Burvall et al. Jul 2010 A1
20100185448 Meisel Jul 2010 A1
20100185949 Jaeger Jul 2010 A1
20100191466 Deluca et al. Jul 2010 A1
20100191520 Gruhn et al. Jul 2010 A1
20100192221 Waggoner Jul 2010 A1
20100195865 Luff Aug 2010 A1
20100197359 Harris Aug 2010 A1
20100198821 Loritz et al. Aug 2010 A1
20100199180 Brichter et al. Aug 2010 A1
20100199215 Seymour et al. Aug 2010 A1
20100199340 Jonas et al. Aug 2010 A1
20100204986 Kennewick et al. Aug 2010 A1
20100211199 Naik et al. Aug 2010 A1
20100211379 Gorman et al. Aug 2010 A1
20100211644 Lavoie et al. Aug 2010 A1
20100215195 Harma et al. Aug 2010 A1
20100216509 Riemer et al. Aug 2010 A1
20100217581 Hong Aug 2010 A1
20100217604 Baldwin et al. Aug 2010 A1
20100222033 Scott et al. Sep 2010 A1
20100222098 Garg Sep 2010 A1
20100223055 Mclean Sep 2010 A1
20100223056 Kadirkamanathan et al. Sep 2010 A1
20100223131 Scott et al. Sep 2010 A1
20100225599 Danielsson et al. Sep 2010 A1
20100225809 Connors et al. Sep 2010 A1
20100227642 Kim et al. Sep 2010 A1
20100228540 Bennett Sep 2010 A1
20100228549 Herman et al. Sep 2010 A1
20100228691 Yang et al. Sep 2010 A1
20100229082 Karmarkar et al. Sep 2010 A1
20100229100 Miller et al. Sep 2010 A1
20100231474 Yamagajo et al. Sep 2010 A1
20100235167 Bourdon Sep 2010 A1
20100235341 Bennett Sep 2010 A1
20100235729 Kocienda et al. Sep 2010 A1
20100235732 Bergman Sep 2010 A1
20100235770 Ording et al. Sep 2010 A1
20100235780 Westerman et al. Sep 2010 A1
20100235793 Ording et al. Sep 2010 A1
20100241418 Maeda et al. Sep 2010 A1
20100246784 Frazier et al. Sep 2010 A1
20100250542 Fujimaki Sep 2010 A1
20100250599 Schmidt et al. Sep 2010 A1
20100255858 Juhasz Oct 2010 A1
20100257160 Cao Oct 2010 A1
20100257478 Longe et al. Oct 2010 A1
20100257490 Lyon et al. Oct 2010 A1
20100262599 Nitz Oct 2010 A1
20100263015 Pandey et al. Oct 2010 A1
20100268537 Al-Telmissani Oct 2010 A1
20100268539 Xu et al. Oct 2010 A1
20100269040 Lee Oct 2010 A1
20100274482 Feng Oct 2010 A1
20100274753 Liberty et al. Oct 2010 A1
20100277579 Cho et al. Nov 2010 A1
20100278320 Arsenault et al. Nov 2010 A1
20100278391 Hsu et al. Nov 2010 A1
20100278453 King Nov 2010 A1
20100280983 Cho et al. Nov 2010 A1
20100281034 Petrou et al. Nov 2010 A1
20100286984 Wandinger et al. Nov 2010 A1
20100286985 Kennewick et al. Nov 2010 A1
20100287241 Swanburg et al. Nov 2010 A1
20100287514 Cragun et al. Nov 2010 A1
20100290632 Lin Nov 2010 A1
20100293460 Budelli Nov 2010 A1
20100295645 Falldin et al. Nov 2010 A1
20100299133 Kopparapu et al. Nov 2010 A1
20100299138 Kim Nov 2010 A1
20100299142 Freeman et al. Nov 2010 A1
20100299444 Nilo et al. Nov 2010 A1
20100302056 Dutton et al. Dec 2010 A1
20100303254 Yoshizawa et al. Dec 2010 A1
20100304342 Zilber Dec 2010 A1
20100304705 Hursey et al. Dec 2010 A1
20100305807 Basir et al. Dec 2010 A1
20100305947 Schwarz et al. Dec 2010 A1
20100311395 Zheng et al. Dec 2010 A1
20100312547 Van Os et al. Dec 2010 A1
20100312566 Odinak et al. Dec 2010 A1
20100318293 Brush et al. Dec 2010 A1
20100318357 Istvan et al. Dec 2010 A1
20100318366 Sullivan et al. Dec 2010 A1
20100318570 Narasinghanallur et al. Dec 2010 A1
20100318576 Kim Dec 2010 A1
20100322438 Siotis Dec 2010 A1
20100324709 Starmen Dec 2010 A1
20100324895 Kurzweil et al. Dec 2010 A1
20100324896 Attwater et al. Dec 2010 A1
20100324905 Kurzweil et al. Dec 2010 A1
20100325131 Dumais et al. Dec 2010 A1
20100325158 Oral et al. Dec 2010 A1
20100325573 Estrada et al. Dec 2010 A1
20100325588 Reddy et al. Dec 2010 A1
20100330908 Maddern et al. Dec 2010 A1
20100332003 Yaguez Dec 2010 A1
20100332220 Hursey et al. Dec 2010 A1
20100332224 Mäkelä et al. Dec 2010 A1
20100332235 David Dec 2010 A1
20100332236 Tan Dec 2010 A1
20100332280 Bradley et al. Dec 2010 A1
20100332348 Cao Dec 2010 A1
20100332428 Mchenry et al. Dec 2010 A1
20100332976 Fux et al. Dec 2010 A1
20100333030 Johns Dec 2010 A1
20100333163 Daly Dec 2010 A1
20110002487 Panther et al. Jan 2011 A1
20110004475 Bellegarda Jan 2011 A1
20110006876 Moberg et al. Jan 2011 A1
20110009107 Guba et al. Jan 2011 A1
20110010178 Lee et al. Jan 2011 A1
20110010644 Merrill et al. Jan 2011 A1
20110015928 Odell et al. Jan 2011 A1
20110016150 Engstrom et al. Jan 2011 A1
20110016421 Krupka et al. Jan 2011 A1
20110018695 Bells et al. Jan 2011 A1
20110021211 Ohki Jan 2011 A1
20110021213 Carr Jan 2011 A1
20110022292 Shen et al. Jan 2011 A1
20110022388 Wu et al. Jan 2011 A1
20110022393 Waller et al. Jan 2011 A1
20110022394 Wide et al. Jan 2011 A1
20110022472 Zon et al. Jan 2011 A1
20110022952 Wu et al. Jan 2011 A1
20110028083 Soitis Feb 2011 A1
20110029616 Wang et al. Feb 2011 A1
20110029637 Morse Feb 2011 A1
20110030067 Wilson Feb 2011 A1
20110033064 Johnson et al. Feb 2011 A1
20110034183 Haag et al. Feb 2011 A1
20110035144 Okamoto et al. Feb 2011 A1
20110035434 Lockwood Feb 2011 A1
20110038489 Visser et al. Feb 2011 A1
20110039584 Merrett Feb 2011 A1
20110040707 Theisen et al. Feb 2011 A1
20110045841 Kuhlke et al. Feb 2011 A1
20110047072 Ciurea Feb 2011 A1
20110047149 Vaananen Feb 2011 A1
20110047161 Myaeng et al. Feb 2011 A1
20110047246 Frissora et al. Feb 2011 A1
20110047266 Yu et al. Feb 2011 A1
20110047605 Sontag et al. Feb 2011 A1
20110050591 Kim et al. Mar 2011 A1
20110050592 Kim et al. Mar 2011 A1
20110054647 Chipchase Mar 2011 A1
20110054894 Phillips et al. Mar 2011 A1
20110054901 Qin et al. Mar 2011 A1
20110055244 Donelli Mar 2011 A1
20110055256 Phillips et al. Mar 2011 A1
20110060584 Ferrucci et al. Mar 2011 A1
20110060587 Phillips et al. Mar 2011 A1
20110060589 Weinberg et al. Mar 2011 A1
20110060807 Martin et al. Mar 2011 A1
20110060812 Middleton Mar 2011 A1
20110064378 Gharaat et al. Mar 2011 A1
20110064387 Mendeloff et al. Mar 2011 A1
20110065456 Brennan et al. Mar 2011 A1
20110066366 Ellanti et al. Mar 2011 A1
20110066436 Bezar Mar 2011 A1
20110066468 Huang et al. Mar 2011 A1
20110066602 Studer et al. Mar 2011 A1
20110066634 Phillips et al. Mar 2011 A1
20110072033 White et al. Mar 2011 A1
20110072114 Hoffert et al. Mar 2011 A1
20110072492 Mohler et al. Mar 2011 A1
20110075818 Vance et al. Mar 2011 A1
20110076994 Kim et al. Mar 2011 A1
20110077943 Miki et al. Mar 2011 A1
20110080260 Wang et al. Apr 2011 A1
20110081889 Gao et al. Apr 2011 A1
20110082688 Kim et al. Apr 2011 A1
20110083079 Farrell et al. Apr 2011 A1
20110087491 Wittenstein et al. Apr 2011 A1
20110087685 Lin et al. Apr 2011 A1
20110090078 Kim et al. Apr 2011 A1
20110092187 Miller Apr 2011 A1
20110093261 Angott Apr 2011 A1
20110093265 Stent et al. Apr 2011 A1
20110093271 Bernard et al. Apr 2011 A1
20110093272 Isobe et al. Apr 2011 A1
20110099000 Rai et al. Apr 2011 A1
20110099157 LeBeau et al. Apr 2011 A1
20110102161 Heubel et al. May 2011 A1
20110103682 Chidlovskii et al. May 2011 A1
20110105097 Tadayon et al. May 2011 A1
20110106534 Lebeau et al. May 2011 A1
20110106536 Klappert May 2011 A1
20110106736 Aharonson et al. May 2011 A1
20110106878 Cho et al. May 2011 A1
20110106892 Nelson et al. May 2011 A1
20110110502 Daye et al. May 2011 A1
20110111724 Baptiste May 2011 A1
20110112825 Bellegarda May 2011 A1
20110112827 Kennewick et al. May 2011 A1
20110112837 Kurki-Suonio et al. May 2011 A1
20110112838 Adibi May 2011 A1
20110112921 Kennewick et al. May 2011 A1
20110116480 Li et al. May 2011 A1
20110116610 Shaw et al. May 2011 A1
20110119049 Ylonen May 2011 A1
20110119051 Li et al. May 2011 A1
20110119623 Kim May 2011 A1
20110119713 Chang et al. May 2011 A1
20110119715 Chang et al. May 2011 A1
20110123004 Chang et al. May 2011 A1
20110125498 Pickering et al. May 2011 A1
20110125540 Jang et al. May 2011 A1
20110125701 Nair et al. May 2011 A1
20110130958 Stahl et al. Jun 2011 A1
20110131036 DiCristo et al. Jun 2011 A1
20110131038 Oyaizu et al. Jun 2011 A1
20110131045 Cristo et al. Jun 2011 A1
20110137636 Srihari et al. Jun 2011 A1
20110137664 Kho et al. Jun 2011 A1
20110141141 Kankainen Jun 2011 A1
20110143718 Engelhart, Sr. Jun 2011 A1
20110143726 de Silva Jun 2011 A1
20110143811 Rodriguez Jun 2011 A1
20110144857 Wingrove et al. Jun 2011 A1
20110144901 Wang Jun 2011 A1
20110144973 Bocchieri et al. Jun 2011 A1
20110144999 Jang et al. Jun 2011 A1
20110145718 Ketola et al. Jun 2011 A1
20110151415 Darling et al. Jun 2011 A1
20110151830 Blanda et al. Jun 2011 A1
20110153209 Geelen Jun 2011 A1
20110153322 Kwak et al. Jun 2011 A1
20110153324 Ballinger et al. Jun 2011 A1
20110153325 Ballinger et al. Jun 2011 A1
20110153329 Moorer Jun 2011 A1
20110153330 Yazdani et al. Jun 2011 A1
20110153373 Dantzig et al. Jun 2011 A1
20110154193 Creutz et al. Jun 2011 A1
20110157029 Tseng Jun 2011 A1
20110161072 Terao et al. Jun 2011 A1
20110161076 Davis et al. Jun 2011 A1
20110161079 Gruhn et al. Jun 2011 A1
20110161309 Lung et al. Jun 2011 A1
20110161852 Vainio et al. Jun 2011 A1
20110166851 LeBeau et al. Jul 2011 A1
20110166855 Vermeulen et al. Jul 2011 A1
20110166862 Eshed et al. Jul 2011 A1
20110167350 Hoellwarth Jul 2011 A1
20110173003 Levanon et al. Jul 2011 A1
20110173537 Hemphill Jul 2011 A1
20110175810 Markovic et al. Jul 2011 A1
20110178804 Inoue et al. Jul 2011 A1
20110179002 Dumitru et al. Jul 2011 A1
20110179372 Moore et al. Jul 2011 A1
20110183627 Ueda et al. Jul 2011 A1
20110183650 Mckee et al. Jul 2011 A1
20110184721 Subramanian et al. Jul 2011 A1
20110184730 LeBeau et al. Jul 2011 A1
20110184736 Slotznick Jul 2011 A1
20110184737 Nakano et al. Jul 2011 A1
20110184768 Norton et al. Jul 2011 A1
20110184789 Kirsch Jul 2011 A1
20110185288 Gupta et al. Jul 2011 A1
20110191108 Friedlander Aug 2011 A1
20110191271 Baker et al. Aug 2011 A1
20110191344 Jin et al. Aug 2011 A1
20110195758 Damale et al. Aug 2011 A1
20110196670 Dang et al. Aug 2011 A1
20110197128 Assadollahi et al. Aug 2011 A1
20110199312 Okuta Aug 2011 A1
20110201385 Higginbotham et al. Aug 2011 A1
20110201387 Paek et al. Aug 2011 A1
20110202526 Lee et al. Aug 2011 A1
20110202594 Ricci Aug 2011 A1
20110202874 Ramer et al. Aug 2011 A1
20110205149 Tom et al. Aug 2011 A1
20110208511 Sikstrom et al. Aug 2011 A1
20110208524 Haughay Aug 2011 A1
20110209088 Hinckley et al. Aug 2011 A1
20110212717 Rhoads et al. Sep 2011 A1
20110216093 Griffin Sep 2011 A1
20110218806 Alewine et al. Sep 2011 A1
20110218855 Cao et al. Sep 2011 A1
20110219018 Bailey et al. Sep 2011 A1
20110223893 Lau et al. Sep 2011 A1
20110224972 Millett et al. Sep 2011 A1
20110228913 Cochinwala et al. Sep 2011 A1
20110231182 Weider et al. Sep 2011 A1
20110231184 Kerr Sep 2011 A1
20110231188 Kennewick et al. Sep 2011 A1
20110231189 Anastasiadis et al. Sep 2011 A1
20110231218 Tovar Sep 2011 A1
20110231432 Sata et al. Sep 2011 A1
20110231474 Locker et al. Sep 2011 A1
20110238191 Kristjansson et al. Sep 2011 A1
20110238407 Kent Sep 2011 A1
20110238408 Larcheveque et al. Sep 2011 A1
20110238676 Liu et al. Sep 2011 A1
20110239111 Grover Sep 2011 A1
20110242007 Gray et al. Oct 2011 A1
20110244888 Ohki Oct 2011 A1
20110246471 Rakib et al. Oct 2011 A1
20110249144 Chang Oct 2011 A1
20110250570 Mack et al. Oct 2011 A1
20110252108 Morris et al. Oct 2011 A1
20110257966 Rychlik Oct 2011 A1
20110258188 Abdalmageed et al. Oct 2011 A1
20110260829 Lee Oct 2011 A1
20110260861 Singh et al. Oct 2011 A1
20110264530 Santangelo et al. Oct 2011 A1
20110264643 Cao Oct 2011 A1
20110264999 Bells et al. Oct 2011 A1
20110270604 Qi et al. Nov 2011 A1
20110274303 Filson et al. Nov 2011 A1
20110276595 Kirkland et al. Nov 2011 A1
20110276598 Kozempel Nov 2011 A1
20110276944 Bergman et al. Nov 2011 A1
20110279368 Klein et al. Nov 2011 A1
20110280143 Li et al. Nov 2011 A1
20110282663 Talwar et al. Nov 2011 A1
20110282888 Koperski et al. Nov 2011 A1
20110282903 Zhang Nov 2011 A1
20110282906 Wong Nov 2011 A1
20110283189 McCarty Nov 2011 A1
20110283190 Poltorak Nov 2011 A1
20110288852 Dymetman et al. Nov 2011 A1
20110288855 Roy Nov 2011 A1
20110288861 Kurzweil et al. Nov 2011 A1
20110288863 Rasmussen Nov 2011 A1
20110288866 Rasmussen Nov 2011 A1
20110288917 Wanek et al. Nov 2011 A1
20110289530 Dureau et al. Nov 2011 A1
20110298585 Barry Dec 2011 A1
20110301943 Patch Dec 2011 A1
20110302162 Xiao et al. Dec 2011 A1
20110302645 Headley Dec 2011 A1
20110306426 Novak et al. Dec 2011 A1
20110307241 Waibel et al. Dec 2011 A1
20110307254 Hunt et al. Dec 2011 A1
20110307491 Fisk et al. Dec 2011 A1
20110307810 Hilerio et al. Dec 2011 A1
20110313775 Laligand et al. Dec 2011 A1
20110313803 Friend et al. Dec 2011 A1
20110314003 Ju et al. Dec 2011 A1
20110314032 Bennett et al. Dec 2011 A1
20110314404 Kotler et al. Dec 2011 A1
20110314539 Horton Dec 2011 A1
20110320187 Motik et al. Dec 2011 A1
20120002820 Leichter Jan 2012 A1
20120005602 Anttila et al. Jan 2012 A1
20120008754 Mukherjee et al. Jan 2012 A1
20120010886 Razavilar Jan 2012 A1
20120011138 Dunning et al. Jan 2012 A1
20120013609 Reponen et al. Jan 2012 A1
20120015629 Olsen et al. Jan 2012 A1
20120016658 Wu et al. Jan 2012 A1
20120016678 Gruber et al. Jan 2012 A1
20120019400 Patel et al. Jan 2012 A1
20120020490 Leichter Jan 2012 A1
20120020503 Endo et al. Jan 2012 A1
20120022787 LeBeau et al. Jan 2012 A1
20120022857 Baldwin et al. Jan 2012 A1
20120022860 Lloyd et al. Jan 2012 A1
20120022868 LeBeau et al. Jan 2012 A1
20120022869 Lloyd et al. Jan 2012 A1
20120022870 Kristjansson et al. Jan 2012 A1
20120022872 Gruber et al. Jan 2012 A1
20120022874 Lloyd et al. Jan 2012 A1
20120022876 LeBeau et al. Jan 2012 A1
20120022967 Bachman et al. Jan 2012 A1
20120023088 Cheng et al. Jan 2012 A1
20120023095 Wadycki et al. Jan 2012 A1
20120023462 Rosing et al. Jan 2012 A1
20120026395 Jin et al. Feb 2012 A1
20120029661 Jones et al. Feb 2012 A1
20120029910 Medlock et al. Feb 2012 A1
20120034904 LeBeau et al. Feb 2012 A1
20120035907 Lebeau et al. Feb 2012 A1
20120035908 Lebeau et al. Feb 2012 A1
20120035924 Jitkoff et al. Feb 2012 A1
20120035925 Friend et al. Feb 2012 A1
20120035926 Ambler Feb 2012 A1
20120035931 LeBeau et al. Feb 2012 A1
20120035932 Jitkoff et al. Feb 2012 A1
20120035935 Park et al. Feb 2012 A1
20120036556 LeBeau et al. Feb 2012 A1
20120039539 Boiman et al. Feb 2012 A1
20120039578 Issa et al. Feb 2012 A1
20120041752 Wang et al. Feb 2012 A1
20120041756 Hanazawa et al. Feb 2012 A1
20120041759 Barker et al. Feb 2012 A1
20120042014 Desai et al. Feb 2012 A1
20120042343 Laligand et al. Feb 2012 A1
20120052945 Miyamoto et al. Mar 2012 A1
20120053815 Montanari et al. Mar 2012 A1
20120053829 Agarwal et al. Mar 2012 A1
20120053945 Gupta et al. Mar 2012 A1
20120056815 Mehra Mar 2012 A1
20120059655 Cartales Mar 2012 A1
20120059813 Sejnoha et al. Mar 2012 A1
20120060052 White et al. Mar 2012 A1
20120062473 Xiao et al. Mar 2012 A1
20120064975 Gault et al. Mar 2012 A1
20120066212 Jennings Mar 2012 A1
20120066581 Spalink Mar 2012 A1
20120075054 Ge et al. Mar 2012 A1
20120075184 Madhvanath Mar 2012 A1
20120077479 Sabotta et al. Mar 2012 A1
20120078611 Soltani et al. Mar 2012 A1
20120078624 Yook et al. Mar 2012 A1
20120078627 Wagner Mar 2012 A1
20120078635 Rothkopf et al. Mar 2012 A1
20120078747 Chakrabarti et al. Mar 2012 A1
20120082317 Pance et al. Apr 2012 A1
20120083286 Kim et al. Apr 2012 A1
20120084086 Gilbert et al. Apr 2012 A1
20120084087 Yang et al. Apr 2012 A1
20120084089 Lloyd et al. Apr 2012 A1
20120084634 Wong et al. Apr 2012 A1
20120088219 Briscoe et al. Apr 2012 A1
20120089331 Schmidt et al. Apr 2012 A1
20120089659 Halevi et al. Apr 2012 A1
20120094645 Jeffrey Apr 2012 A1
20120101823 Weng et al. Apr 2012 A1
20120105257 Murillo et al. May 2012 A1
20120108166 Hymel May 2012 A1
20120108221 Thomas et al. May 2012 A1
20120109632 Sugiura et al. May 2012 A1
20120109753 Kennewick et al. May 2012 A1
20120109997 Sparks et al. May 2012 A1
20120110456 Larco et al. May 2012 A1
20120114108 Katis et al. May 2012 A1
20120116770 Chen et al. May 2012 A1
20120117499 Mori et al. May 2012 A1
20120117590 Agnihotri et al. May 2012 A1
20120124126 Alcazar et al. May 2012 A1
20120124177 Sparks May 2012 A1
20120124178 Sparks May 2012 A1
20120128322 Shaffer et al. May 2012 A1
20120130709 Bocchieri et al. May 2012 A1
20120130995 Risvik et al. May 2012 A1
20120135714 King, II May 2012 A1
20120136529 Curtis et al. May 2012 A1
20120136572 Norton May 2012 A1
20120136649 Freising et al. May 2012 A1
20120136855 Ni et al. May 2012 A1
20120136985 Popescu et al. May 2012 A1
20120137367 Dupont et al. May 2012 A1
20120149342 Cohen et al. Jun 2012 A1
20120149394 Singh et al. Jun 2012 A1
20120150532 Rowski et al. Jun 2012 A1
20120150544 McLoughlin et al. Jun 2012 A1
20120150580 Norton Jun 2012 A1
20120158293 Burnham Jun 2012 A1
20120158399 Tremblay et al. Jun 2012 A1
20120158422 Burnham et al. Jun 2012 A1
20120159380 Kocienda et al. Jun 2012 A1
20120163710 Skaff et al. Jun 2012 A1
20120166177 Beld et al. Jun 2012 A1
20120166196 Ju et al. Jun 2012 A1
20120166429 Moore et al. Jun 2012 A1
20120166942 Ramerth et al. Jun 2012 A1
20120166959 Hilerio et al. Jun 2012 A1
20120166998 Cotterill et al. Jun 2012 A1
20120173222 Wang et al. Jul 2012 A1
20120173244 Kwak et al. Jul 2012 A1
20120173464 Tur et al. Jul 2012 A1
20120174121 Treat et al. Jul 2012 A1
20120176255 Choi et al. Jul 2012 A1
20120179457 Newman et al. Jul 2012 A1
20120179467 Williams et al. Jul 2012 A1
20120179471 Newman et al. Jul 2012 A1
20120185237 Gajic et al. Jul 2012 A1
20120185480 Ni et al. Jul 2012 A1
20120185781 Guzman et al. Jul 2012 A1
20120191461 Lin et al. Jul 2012 A1
20120192096 Bowman et al. Jul 2012 A1
20120197743 Grigg et al. Aug 2012 A1
20120197995 Caruso Aug 2012 A1
20120197998 Kessel et al. Aug 2012 A1
20120201362 Crossan et al. Aug 2012 A1
20120203767 Williams et al. Aug 2012 A1
20120209454 Miller et al. Aug 2012 A1
20120209654 Romagnino et al. Aug 2012 A1
20120209853 Desai et al. Aug 2012 A1
20120209874 Wong et al. Aug 2012 A1
20120210266 Jiang et al. Aug 2012 A1
20120210378 Mccoy et al. Aug 2012 A1
20120214141 Raya et al. Aug 2012 A1
20120214517 Singh et al. Aug 2012 A1
20120215640 Ramer et al. Aug 2012 A1
20120215762 Hall et al. Aug 2012 A1
20120221339 Wang et al. Aug 2012 A1
20120221552 Reponen et al. Aug 2012 A1
20120223889 Medlock et al. Sep 2012 A1
20120223936 Aughey et al. Sep 2012 A1
20120232885 Barbosa et al. Sep 2012 A1
20120232886 Capuozzo et al. Sep 2012 A1
20120232906 Lindahl et al. Sep 2012 A1
20120233207 Mohajer Sep 2012 A1
20120233266 Hassan et al. Sep 2012 A1
20120233280 Ebara Sep 2012 A1
20120239403 Cano et al. Sep 2012 A1
20120239661 Giblin Sep 2012 A1
20120239761 Linner et al. Sep 2012 A1
20120242482 Elumalai et al. Sep 2012 A1
20120245719 Story, Jr. et al. Sep 2012 A1
20120245939 Braho et al. Sep 2012 A1
20120245941 Cheyer Sep 2012 A1
20120245944 Gruber et al. Sep 2012 A1
20120246064 Balkow Sep 2012 A1
20120250858 Iqbal et al. Oct 2012 A1
20120252367 Gaglio et al. Oct 2012 A1
20120252540 Kirigaya Oct 2012 A1
20120253785 Hamid et al. Oct 2012 A1
20120253791 Heck et al. Oct 2012 A1
20120254143 Varma et al. Oct 2012 A1
20120254152 Park et al. Oct 2012 A1
20120254290 Naaman Oct 2012 A1
20120259615 Morin et al. Oct 2012 A1
20120262296 Bezar Oct 2012 A1
20120265482 Grokop et al. Oct 2012 A1
20120265528 Gruber et al. Oct 2012 A1
20120265535 Bryant-Rich et al. Oct 2012 A1
20120265787 Hsu et al. Oct 2012 A1
20120265806 Blanchflower et al. Oct 2012 A1
20120271625 Bernard Oct 2012 A1
20120271634 Lenke Oct 2012 A1
20120271635 Ljolje Oct 2012 A1
20120271640 Basir Oct 2012 A1
20120271676 Aravamudan et al. Oct 2012 A1
20120275377 Lehane et al. Nov 2012 A1
20120278744 Kozitsyn Nov 2012 A1
20120278812 Wang Nov 2012 A1
20120284015 Drewes Nov 2012 A1
20120284027 Mallett et al. Nov 2012 A1
20120290291 Shelley et al. Nov 2012 A1
20120290300 Lee et al. Nov 2012 A1
20120290657 Parks et al. Nov 2012 A1
20120290680 Hwang Nov 2012 A1
20120295708 Hernandez-Abrego et al. Nov 2012 A1
20120296638 Patwa Nov 2012 A1
20120296649 Bansal et al. Nov 2012 A1
20120296654 Hendrickson et al. Nov 2012 A1
20120296891 Rangan Nov 2012 A1
20120297341 Glazer et al. Nov 2012 A1
20120297348 Santoro Nov 2012 A1
20120303369 Brush et al. Nov 2012 A1
20120303371 Labsky et al. Nov 2012 A1
20120304124 Chen et al. Nov 2012 A1
20120304239 Shahraray et al. Nov 2012 A1
20120309363 Gruber et al. Dec 2012 A1
20120310642 Cao et al. Dec 2012 A1
20120310649 Cannistraro et al. Dec 2012 A1
20120310652 O'Sullivan Dec 2012 A1
20120310922 Johnson et al. Dec 2012 A1
20120311478 Van Os et al. Dec 2012 A1
20120311583 Gruber et al. Dec 2012 A1
20120311584 Gruber et al. Dec 2012 A1
20120311585 Gruber et al. Dec 2012 A1
20120316774 Yariv et al. Dec 2012 A1
20120316862 Sultan et al. Dec 2012 A1
20120316875 Nyquist et al. Dec 2012 A1
20120316878 Singleton et al. Dec 2012 A1
20120316955 Panguluri et al. Dec 2012 A1
20120317194 Tian Dec 2012 A1
20120317498 Logan et al. Dec 2012 A1
20120321112 Schubert et al. Dec 2012 A1
20120323560 Perez Cortes et al. Dec 2012 A1
20120324391 Tocci et al. Dec 2012 A1
20120327009 Fleizach Dec 2012 A1
20120329529 van der Raadt Dec 2012 A1
20120330660 Jaiswal Dec 2012 A1
20120330661 Lindahl Dec 2012 A1
20120330990 Chen et al. Dec 2012 A1
20130002716 Walker et al. Jan 2013 A1
20130005405 Prociw Jan 2013 A1
20130006633 Grokop et al. Jan 2013 A1
20130006637 Kanevsky et al. Jan 2013 A1
20130006638 Lindahl Jan 2013 A1
20130007240 Qiu et al. Jan 2013 A1
20130007648 Gamon et al. Jan 2013 A1
20130009858 Lacey Jan 2013 A1
20130010575 He et al. Jan 2013 A1
20130013313 Shechtman et al. Jan 2013 A1
20130013319 Grant et al. Jan 2013 A1
20130014026 Beringer et al. Jan 2013 A1
20130018659 Chi Jan 2013 A1
20130018863 Regan et al. Jan 2013 A1
20130024277 Tuchman et al. Jan 2013 A1
20130024576 Dishneau et al. Jan 2013 A1
20130027875 Zhu et al. Jan 2013 A1
20130028404 Omalley et al. Jan 2013 A1
20130030787 Cancedda et al. Jan 2013 A1
20130030789 Dalce Jan 2013 A1
20130030804 Zavaliagko et al. Jan 2013 A1
20130030815 Madhvanath et al. Jan 2013 A1
20130030904 Aidasani et al. Jan 2013 A1
20130030913 Zhu et al. Jan 2013 A1
20130030955 David Jan 2013 A1
20130031162 Willis et al. Jan 2013 A1
20130031476 Coin et al. Jan 2013 A1
20130033643 Kim et al. Feb 2013 A1
20130035086 Chardon et al. Feb 2013 A1
20130035942 Kim et al. Feb 2013 A1
20130035961 Yegnanarayanan Feb 2013 A1
20130041647 Ramerth et al. Feb 2013 A1
20130041654 Walker et al. Feb 2013 A1
20130041661 Lee et al. Feb 2013 A1
20130041665 Jang et al. Feb 2013 A1
20130041667 Longe et al. Feb 2013 A1
20130041968 Cohen et al. Feb 2013 A1
20130046544 Kay et al. Feb 2013 A1
20130047178 Moon et al. Feb 2013 A1
20130050089 Neels et al. Feb 2013 A1
20130054550 Bolohan Feb 2013 A1
20130054609 Rajput et al. Feb 2013 A1
20130054613 Bishop Feb 2013 A1
20130054631 Govani et al. Feb 2013 A1
20130054675 Jenkins et al. Feb 2013 A1
20130054706 Graham et al. Feb 2013 A1
20130055099 Yao et al. Feb 2013 A1
20130055147 Vasudev et al. Feb 2013 A1
20130060571 Soemo et al. Mar 2013 A1
20130060807 Rambhia et al. Mar 2013 A1
20130061139 Mahkovec et al. Mar 2013 A1
20130063611 Papakipos et al. Mar 2013 A1
20130066832 Sheehan et al. Mar 2013 A1
20130067307 Tian et al. Mar 2013 A1
20130067312 Rose Mar 2013 A1
20130067421 Osman et al. Mar 2013 A1
20130069769 Pennington et al. Mar 2013 A1
20130073286 Bastea-Forte et al. Mar 2013 A1
20130073293 Jang et al. Mar 2013 A1
20130073346 Chun et al. Mar 2013 A1
20130073580 Mehanna et al. Mar 2013 A1
20130078930 Chen et al. Mar 2013 A1
20130080152 Brun et al. Mar 2013 A1
20130080162 Chang et al. Mar 2013 A1
20130080167 Mozer Mar 2013 A1
20130080177 Chen Mar 2013 A1
20130080178 Kang et al. Mar 2013 A1
20130080251 Dempski Mar 2013 A1
20130082967 Hillis et al. Apr 2013 A1
20130085755 Bringert et al. Apr 2013 A1
20130085761 Bringert et al. Apr 2013 A1
20130086609 Levy et al. Apr 2013 A1
20130090921 Liu et al. Apr 2013 A1
20130091090 Spivack et al. Apr 2013 A1
20130095805 Lebeau et al. Apr 2013 A1
20130096909 Brun et al. Apr 2013 A1
20130096911 Beaufort et al. Apr 2013 A1
20130096917 Edgar et al. Apr 2013 A1
20130097566 Berglund Apr 2013 A1
20130097682 Zeljkovic et al. Apr 2013 A1
20130100017 Papakipos et al. Apr 2013 A1
20130100268 Mihailidis et al. Apr 2013 A1
20130103391 Millmore et al. Apr 2013 A1
20130103405 Namba et al. Apr 2013 A1
20130106742 Lee et al. May 2013 A1
20130107053 Ozaki May 2013 A1
20130110505 Gruber et al. May 2013 A1
20130110515 Guzzoni et al. May 2013 A1
20130110518 Gruber et al. May 2013 A1
20130110519 Cheyer et al. May 2013 A1
20130110520 Cheyer et al. May 2013 A1
20130110943 Menon et al. May 2013 A1
20130111330 Staikos et al. May 2013 A1
20130111348 Gruber et al. May 2013 A1
20130111365 Chen et al. May 2013 A1
20130111487 Cheyer et al. May 2013 A1
20130111581 Griffin et al. May 2013 A1
20130115927 Gruber et al. May 2013 A1
20130117022 Chen et al. May 2013 A1
20130124189 Baldwin et al. May 2013 A1
20130124672 Pan May 2013 A1
20130125168 Agnihotri et al. May 2013 A1
20130132081 Ryu et al. May 2013 A1
20130132084 Stonehocker et al. May 2013 A1
20130132089 Fanty et al. May 2013 A1
20130132871 Zeng et al. May 2013 A1
20130138440 Strope et al. May 2013 A1
20130141551 Kim Jun 2013 A1
20130142317 Reynolds Jun 2013 A1
20130142345 Waldmann Jun 2013 A1
20130144594 Bangalore et al. Jun 2013 A1
20130144616 Bangalore et al. Jun 2013 A1
20130151339 Kim et al. Jun 2013 A1
20130152092 Yadgar et al. Jun 2013 A1
20130154811 Ferren et al. Jun 2013 A1
20130155948 Pinheiro et al. Jun 2013 A1
20130156198 Kim et al. Jun 2013 A1
20130157629 Lee et al. Jun 2013 A1
20130158977 Senior Jun 2013 A1
20130159847 Banke et al. Jun 2013 A1
20130159861 Rottier et al. Jun 2013 A1
20130165232 Nelson et al. Jun 2013 A1
20130166278 James et al. Jun 2013 A1
20130166303 Chang et al. Jun 2013 A1
20130166332 Hammad Jun 2013 A1
20130166442 Nakajima et al. Jun 2013 A1
20130167242 Paliwal Jun 2013 A1
20130170738 Capuozzo et al. Jul 2013 A1
20130172022 Seymour et al. Jul 2013 A1
20130173258 Liu et al. Jul 2013 A1
20130173268 Weng et al. Jul 2013 A1
20130173513 Chu et al. Jul 2013 A1
20130174034 Brown et al. Jul 2013 A1
20130176147 Anderson et al. Jul 2013 A1
20130176244 Yamamoto et al. Jul 2013 A1
20130176592 Sasaki Jul 2013 A1
20130179168 Bae et al. Jul 2013 A1
20130179172 Nakamura et al. Jul 2013 A1
20130179440 Gordon Jul 2013 A1
20130183942 Novick et al. Jul 2013 A1
20130183944 Mozer et al. Jul 2013 A1
20130185059 Riccardi et al. Jul 2013 A1
20130185066 Tzirkel-hancock et al. Jul 2013 A1
20130185074 Gruber et al. Jul 2013 A1
20130185081 Cheyer et al. Jul 2013 A1
20130185336 Singh et al. Jul 2013 A1
20130187850 Schulz et al. Jul 2013 A1
20130187857 Griffin et al. Jul 2013 A1
20130190021 Vieri et al. Jul 2013 A1
20130191117 Atti et al. Jul 2013 A1
20130191408 Volkert Jul 2013 A1
20130197911 Wei et al. Aug 2013 A1
20130197914 Yelvington et al. Aug 2013 A1
20130198159 Hendry Aug 2013 A1
20130198841 Poulson Aug 2013 A1
20130204813 Master et al. Aug 2013 A1
20130204897 McDougall Aug 2013 A1
20130204967 Seo et al. Aug 2013 A1
20130207898 Sullivan et al. Aug 2013 A1
20130210410 Xu Aug 2013 A1
20130210492 You et al. Aug 2013 A1
20130218553 Fujii et al. Aug 2013 A1
20130218560 Hsiao et al. Aug 2013 A1
20130218574 Falcon et al. Aug 2013 A1
20130218899 Raghavan et al. Aug 2013 A1
20130219333 Palwe et al. Aug 2013 A1
20130222249 Pasquero et al. Aug 2013 A1
20130225128 Gomar Aug 2013 A1
20130226935 Bai et al. Aug 2013 A1
20130231917 Naik Sep 2013 A1
20130234947 Kristensson et al. Sep 2013 A1
20130235987 Arroniz-Escobar et al. Sep 2013 A1
20130238326 Kim et al. Sep 2013 A1
20130238647 Thompson Sep 2013 A1
20130238729 Holzman et al. Sep 2013 A1
20130244615 Miller et al. Sep 2013 A1
20130246048 Nagase et al. Sep 2013 A1
20130246050 Yu et al. Sep 2013 A1
20130246329 Pasquero et al. Sep 2013 A1
20130253911 Petri et al. Sep 2013 A1
20130253912 Medlock et al. Sep 2013 A1
20130262168 Makanawala et al. Oct 2013 A1
20130268263 Park et al. Oct 2013 A1
20130268956 Recco Oct 2013 A1
20130275117 Winer Oct 2013 A1
20130275138 Gruber et al. Oct 2013 A1
20130275164 Gruber et al. Oct 2013 A1
20130275199 Proctor, Jr. et al. Oct 2013 A1
20130275625 Taivalsaari et al. Oct 2013 A1
20130275875 Gruber et al. Oct 2013 A1
20130275899 Schubert et al. Oct 2013 A1
20130279724 Stafford et al. Oct 2013 A1
20130282709 Zhu et al. Oct 2013 A1
20130283168 Brown et al. Oct 2013 A1
20130283199 Selig et al. Oct 2013 A1
20130283283 Wang et al. Oct 2013 A1
20130285913 Griffin et al. Oct 2013 A1
20130289991 War et al. Oct 2013 A1
20130289993 Rao et al. Oct 2013 A1
20130289994 Newman et al. Oct 2013 A1
20130291015 Pan Oct 2013 A1
20130297198 Velde et al. Nov 2013 A1
20130297317 Lee et al. Nov 2013 A1
20130297319 Kim Nov 2013 A1
20130297348 Cardoza et al. Nov 2013 A1
20130300645 Fedorov Nov 2013 A1
20130300648 Kim et al. Nov 2013 A1
20130303106 Martin Nov 2013 A1
20130304479 Teller et al. Nov 2013 A1
20130304758 Gruber et al. Nov 2013 A1
20130304815 Puente et al. Nov 2013 A1
20130305119 Kern et al. Nov 2013 A1
20130307855 Lamb et al. Nov 2013 A1
20130307997 O'Keefe et al. Nov 2013 A1
20130308922 Sano et al. Nov 2013 A1
20130311179 Wagner Nov 2013 A1
20130311184 Badavne et al. Nov 2013 A1
20130311487 Moore et al. Nov 2013 A1
20130311997 Gruber et al. Nov 2013 A1
20130315038 Ferren et al. Nov 2013 A1
20130316679 Miller et al. Nov 2013 A1
20130316746 Miller et al. Nov 2013 A1
20130317921 Havas Nov 2013 A1
20130318478 Ogura Nov 2013 A1
20130321267 Bhatti et al. Dec 2013 A1
20130322634 Bennett et al. Dec 2013 A1
20130322665 Bennett et al. Dec 2013 A1
20130325340 Forstall et al. Dec 2013 A1
20130325436 Wang et al. Dec 2013 A1
20130325443 Begeja et al. Dec 2013 A1
20130325447 Levien et al. Dec 2013 A1
20130325448 Levien et al. Dec 2013 A1
20130325480 Lee et al. Dec 2013 A1
20130325481 Van Os et al. Dec 2013 A1
20130325484 Chakladar et al. Dec 2013 A1
20130325967 Parks et al. Dec 2013 A1
20130325970 Roberts et al. Dec 2013 A1
20130325979 Mansfield et al. Dec 2013 A1
20130328809 Smith Dec 2013 A1
20130329023 Suplee, III et al. Dec 2013 A1
20130331127 Sabatelli et al. Dec 2013 A1
20130332159 Federighi et al. Dec 2013 A1
20130332162 Keen Dec 2013 A1
20130332164 Naik Dec 2013 A1
20130332168 Kim et al. Dec 2013 A1
20130332172 Prakash et al. Dec 2013 A1
20130332400 González Dec 2013 A1
20130332538 Clark et al. Dec 2013 A1
20130339256 Shroff Dec 2013 A1
20130339454 Walker et al. Dec 2013 A1
20130339991 Ricci Dec 2013 A1
20130342672 Gray et al. Dec 2013 A1
20130343584 Bennett et al. Dec 2013 A1
20130343721 Abecassis Dec 2013 A1
20130346065 Davidson et al. Dec 2013 A1
20130346068 Solem et al. Dec 2013 A1
20130346347 Patterson et al. Dec 2013 A1
20130347018 Limp et al. Dec 2013 A1
20130347029 Tang et al. Dec 2013 A1
20130347102 Shi Dec 2013 A1
20130347117 Parks et al. Dec 2013 A1
20140001255 Anthoine Jan 2014 A1
20140006012 Zhou et al. Jan 2014 A1
20140006025 Krishnan et al. Jan 2014 A1
20140006027 Kim et al. Jan 2014 A1
20140006030 Fleizach et al. Jan 2014 A1
20140006153 Thangam et al. Jan 2014 A1
20140006483 Garmark et al. Jan 2014 A1
20140006496 Dearman et al. Jan 2014 A1
20140006562 Handa et al. Jan 2014 A1
20140006947 Garmark et al. Jan 2014 A1
20140006955 Greenzeiger et al. Jan 2014 A1
20140008163 Mikonaho et al. Jan 2014 A1
20140012574 Pasupalak et al. Jan 2014 A1
20140012580 Ganong et al. Jan 2014 A1
20140012586 Rubin et al. Jan 2014 A1
20140012587 Park Jan 2014 A1
20140019116 Lundberg et al. Jan 2014 A1
20140019133 Bao et al. Jan 2014 A1
20140019460 Sambrani et al. Jan 2014 A1
20140028029 Jochman Jan 2014 A1
20140028477 Michalske Jan 2014 A1
20140028735 Williams et al. Jan 2014 A1
20140032453 Eustice et al. Jan 2014 A1
20140033071 Gruber et al. Jan 2014 A1
20140035823 Khoe et al. Feb 2014 A1
20140037075 Bouzid et al. Feb 2014 A1
20140039888 Taubman et al. Feb 2014 A1
20140039893 Weiner et al. Feb 2014 A1
20140039894 Shostak Feb 2014 A1
20140040274 Aravamudan et al. Feb 2014 A1
20140040748 Lemay et al. Feb 2014 A1
20140040754 Donelli Feb 2014 A1
20140040801 Patel et al. Feb 2014 A1
20140040918 Li et al. Feb 2014 A1
20140040961 Green, Sr. et al. Feb 2014 A1
20140046934 Zhou et al. Feb 2014 A1
20140047001 Phillips et al. Feb 2014 A1
20140052451 Cheong et al. Feb 2014 A1
20140052680 Nitz et al. Feb 2014 A1
20140052791 Chakra et al. Feb 2014 A1
20140053082 Park et al. Feb 2014 A1
20140053101 Buehler et al. Feb 2014 A1
20140053210 Cheong et al. Feb 2014 A1
20140057610 Olincy et al. Feb 2014 A1
20140059030 Hakkani-Tur et al. Feb 2014 A1
20140067361 Nikoulina et al. Mar 2014 A1
20140067371 Liensberger Mar 2014 A1
20140067402 Kim Mar 2014 A1
20140067738 Kingsbury Mar 2014 A1
20140068751 Last et al. Mar 2014 A1
20140074454 Brown et al. Mar 2014 A1
20140074466 Sharifi et al. Mar 2014 A1
20140074470 Jansche et al. Mar 2014 A1
20140074472 Lin et al. Mar 2014 A1
20140074483 Van Os Mar 2014 A1
20140074589 Nielsen et al. Mar 2014 A1
20140074815 Plimton Mar 2014 A1
20140075453 Bellessort et al. Mar 2014 A1
20140078065 Akkok et al. Mar 2014 A1
20140079195 Srivastava et al. Mar 2014 A1
20140080410 Jung et al. Mar 2014 A1
20140080428 Rhoads et al. Mar 2014 A1
20140081619 Solntseva et al. Mar 2014 A1
20140081633 Badaskar et al. Mar 2014 A1
20140081635 Yanagihara Mar 2014 A1
20140081829 Milne Mar 2014 A1
20140081941 Bai et al. Mar 2014 A1
20140082500 Wilensky et al. Mar 2014 A1
20140082501 Bae et al. Mar 2014 A1
20140082715 Grajek et al. Mar 2014 A1
20140086458 Rogers et al. Mar 2014 A1
20140087711 Geyer et al. Mar 2014 A1
20140088952 Fife et al. Mar 2014 A1
20140088961 Woodward et al. Mar 2014 A1
20140088964 Bellegarda Mar 2014 A1
20140088970 Kang Mar 2014 A1
20140095171 Lynch et al. Apr 2014 A1
20140095172 Cabaco et al. Apr 2014 A1
20140095173 Lynch et al. Apr 2014 A1
20140095601 Abuelsaad et al. Apr 2014 A1
20140095965 Li Apr 2014 A1
20140096209 Saraf et al. Apr 2014 A1
20140098247 Rao et al. Apr 2014 A1
20140100847 Ishii et al. Apr 2014 A1
20140101127 Simhon et al. Apr 2014 A1
20140104175 Ouyang et al. Apr 2014 A1
20140108017 Mason et al. Apr 2014 A1
20140108391 Volkert Apr 2014 A1
20140112556 Kalinli-akbacak Apr 2014 A1
20140114554 Lagassey Apr 2014 A1
20140115062 Liu et al. Apr 2014 A1
20140115114 Garmark et al. Apr 2014 A1
20140118155 Bowers et al. May 2014 A1
20140118624 Jang et al. May 2014 A1
20140122059 Patel et al. May 2014 A1
20140122085 Piety et al. May 2014 A1
20140122086 Kapur et al. May 2014 A1
20140122136 Jayanthi May 2014 A1
20140122153 Truitt May 2014 A1
20140129226 Lee et al. May 2014 A1
20140132935 Kim et al. May 2014 A1
20140134983 Jung et al. May 2014 A1
20140135036 Bonanni et al. May 2014 A1
20140136013 Wolverton et al. May 2014 A1
20140136187 Wolverton et al. May 2014 A1
20140136195 Abdossalami et al. May 2014 A1
20140136212 Kwon et al. May 2014 A1
20140136946 Matas May 2014 A1
20140136987 Rodriguez May 2014 A1
20140142922 Liang et al. May 2014 A1
20140142923 Jones et al. May 2014 A1
20140142935 Lindahl et al. May 2014 A1
20140142953 Kim et al. May 2014 A1
20140143550 Ganong, III et al. May 2014 A1
20140143721 Suzuki et al. May 2014 A1
20140146200 Scott et al. May 2014 A1
20140149118 Lee et al. May 2014 A1
20140152577 Yuen et al. Jun 2014 A1
20140153709 Byrd et al. Jun 2014 A1
20140155031 Lee et al. Jun 2014 A1
20140156262 Yuen et al. Jun 2014 A1
20140156279 Okamoto et al. Jun 2014 A1
20140157319 Kimura Jun 2014 A1
20140157422 Livshits et al. Jun 2014 A1
20140163951 Nikoulina et al. Jun 2014 A1
20140163953 Parikh Jun 2014 A1
20140163954 Joshi et al. Jun 2014 A1
20140163962 Castelli et al. Jun 2014 A1
20140163976 Park et al. Jun 2014 A1
20140163977 Hoffmeister et al. Jun 2014 A1
20140163981 Cook et al. Jun 2014 A1
20140163995 Burns et al. Jun 2014 A1
20140164305 Lynch et al. Jun 2014 A1
20140164312 Lynch et al. Jun 2014 A1
20140164476 Thomson Jun 2014 A1
20140164508 Lynch et al. Jun 2014 A1
20140164532 Lynch et al. Jun 2014 A1
20140164533 Lynch et al. Jun 2014 A1
20140164953 Lynch et al. Jun 2014 A1
20140169795 Clough Jun 2014 A1
20140171064 Das Jun 2014 A1
20140172878 Clark et al. Jun 2014 A1
20140173460 Kim Jun 2014 A1
20140176814 Ahn Jun 2014 A1
20140179295 Luebbers et al. Jun 2014 A1
20140180499 Cooper et al. Jun 2014 A1
20140180689 Kim et al. Jun 2014 A1
20140180697 Torok et al. Jun 2014 A1
20140181865 Koganei Jun 2014 A1
20140188460 Ouyang et al. Jul 2014 A1
20140188477 Zhang Jul 2014 A1
20140188478 Zhang Jul 2014 A1
20140188485 Kim et al. Jul 2014 A1
20140188835 Zhang et al. Jul 2014 A1
20140195226 Yun et al. Jul 2014 A1
20140195230 Han et al. Jul 2014 A1
20140195233 Bapat et al. Jul 2014 A1
20140195244 Cha et al. Jul 2014 A1
20140195251 Zeinstra et al. Jul 2014 A1
20140195252 Gruber et al. Jul 2014 A1
20140198048 Unruh et al. Jul 2014 A1
20140203939 Harrington et al. Jul 2014 A1
20140205076 Kumar et al. Jul 2014 A1
20140207439 Venkatapathy et al. Jul 2014 A1
20140207446 Klein et al. Jul 2014 A1
20140207447 Jiang et al. Jul 2014 A1
20140207466 Smadi Jul 2014 A1
20140207468 Bartnik Jul 2014 A1
20140207582 Flinn et al. Jul 2014 A1
20140211944 Hayward et al. Jul 2014 A1
20140214429 Pantel Jul 2014 A1
20140214537 Yoo et al. Jul 2014 A1
20140215513 Ramer et al. Jul 2014 A1
20140218372 Missig et al. Aug 2014 A1
20140222435 Li et al. Aug 2014 A1
20140222436 Binder et al. Aug 2014 A1
20140222678 Sheets et al. Aug 2014 A1
20140222967 Harrang et al. Aug 2014 A1
20140223377 Shaw et al. Aug 2014 A1
20140223481 Fundament Aug 2014 A1
20140226503 Cooper et al. Aug 2014 A1
20140229158 Zweig et al. Aug 2014 A1
20140229184 Shires Aug 2014 A1
20140230055 Boehl Aug 2014 A1
20140232570 Skinder et al. Aug 2014 A1
20140232656 Pasquero et al. Aug 2014 A1
20140236595 Gray Aug 2014 A1
20140236986 Guzman Aug 2014 A1
20140237042 Ahmed et al. Aug 2014 A1
20140237366 Poulos et al. Aug 2014 A1
20140244248 Arisoy et al. Aug 2014 A1
20140244249 Mohamed et al. Aug 2014 A1
20140244254 Ju et al. Aug 2014 A1
20140244257 Colibro et al. Aug 2014 A1
20140244258 Song et al. Aug 2014 A1
20140244263 Pontual et al. Aug 2014 A1
20140244266 Brown et al. Aug 2014 A1
20140244268 Abdelsamie et al. Aug 2014 A1
20140244270 Han et al. Aug 2014 A1
20140244271 Lindahl Aug 2014 A1
20140244712 Walters et al. Aug 2014 A1
20140245140 Brown et al. Aug 2014 A1
20140247383 Dave et al. Sep 2014 A1
20140247926 Gainsboro et al. Sep 2014 A1
20140249812 Bou-Ghazale et al. Sep 2014 A1
20140249816 Pickering et al. Sep 2014 A1
20140249817 Hart et al. Sep 2014 A1
20140249820 Hsu et al. Sep 2014 A1
20140249821 Kennewick et al. Sep 2014 A1
20140250046 Winn et al. Sep 2014 A1
20140257809 Goel et al. Sep 2014 A1
20140257815 Zhao et al. Sep 2014 A1
20140257902 Moore et al. Sep 2014 A1
20140258324 Mauro et al. Sep 2014 A1
20140258357 Singh et al. Sep 2014 A1
20140258857 Dykstra-Erickson et al. Sep 2014 A1
20140258905 Lee et al. Sep 2014 A1
20140267022 Kim Sep 2014 A1
20140267599 Drouin et al. Sep 2014 A1
20140267933 Young Sep 2014 A1
20140272821 Pitschel et al. Sep 2014 A1
20140273979 Van Os et al. Sep 2014 A1
20140274005 Luna et al. Sep 2014 A1
20140274203 Ganong et al. Sep 2014 A1
20140274211 Sejnoha et al. Sep 2014 A1
20140278051 Mcgavran et al. Sep 2014 A1
20140278343 Tran Sep 2014 A1
20140278349 Grieves et al. Sep 2014 A1
20140278379 Coccaro et al. Sep 2014 A1
20140278390 Kingsbury et al. Sep 2014 A1
20140278391 Braho et al. Sep 2014 A1
20140278394 Bastyr et al. Sep 2014 A1
20140278406 Tsumura et al. Sep 2014 A1
20140278413 Pitschel et al. Sep 2014 A1
20140278426 Jost et al. Sep 2014 A1
20140278429 Ganong, III Sep 2014 A1
20140278435 Ganong et al. Sep 2014 A1
20140278436 Khanna et al. Sep 2014 A1
20140278438 Hart et al. Sep 2014 A1
20140278443 Gunn et al. Sep 2014 A1
20140278444 Larson et al. Sep 2014 A1
20140278513 Prakash et al. Sep 2014 A1
20140279622 Lamoureux Sep 2014 A1
20140279739 Elkington et al. Sep 2014 A1
20140279787 Cheng et al. Sep 2014 A1
20140280072 Coleman Sep 2014 A1
20140280107 Heymans et al. Sep 2014 A1
20140280138 Li et al. Sep 2014 A1
20140280292 Skinder Sep 2014 A1
20140280353 Delaney et al. Sep 2014 A1
20140280450 Luna Sep 2014 A1
20140281944 Winer Sep 2014 A1
20140281983 Xian et al. Sep 2014 A1
20140281997 Fleizach et al. Sep 2014 A1
20140282003 Gruber et al. Sep 2014 A1
20140282007 Fleizach Sep 2014 A1
20140282045 Ayanam et al. Sep 2014 A1
20140282178 Borzello et al. Sep 2014 A1
20140282201 Pasquero et al. Sep 2014 A1
20140282203 Pasquero et al. Sep 2014 A1
20140282559 Verduzco et al. Sep 2014 A1
20140282586 Shear et al. Sep 2014 A1
20140282743 Howard et al. Sep 2014 A1
20140288990 Moore et al. Sep 2014 A1
20140289508 Wang Sep 2014 A1
20140297267 Spencer et al. Oct 2014 A1
20140297281 Togawa et al. Oct 2014 A1
20140297284 Gruber et al. Oct 2014 A1
20140297288 Yu et al. Oct 2014 A1
20140298395 Yang et al. Oct 2014 A1
20140304086 Dasdan et al. Oct 2014 A1
20140304605 Ohmura et al. Oct 2014 A1
20140309990 Gandrabur et al. Oct 2014 A1
20140309996 Zhang Oct 2014 A1
20140310001 Kains et al. Oct 2014 A1
20140310002 Nitz et al. Oct 2014 A1
20140310348 Keskitalo et al. Oct 2014 A1
20140310365 Sample et al. Oct 2014 A1
20140310595 Acharya et al. Oct 2014 A1
20140313007 Harding Oct 2014 A1
20140315492 Woods Oct 2014 A1
20140316585 Boesveld et al. Oct 2014 A1
20140317030 Shen et al. Oct 2014 A1
20140317502 Brown et al. Oct 2014 A1
20140324429 Weilhammer et al. Oct 2014 A1
20140324884 Lindahl et al. Oct 2014 A1
20140330569 Kolavennu et al. Nov 2014 A1
20140330951 Sukoff et al. Nov 2014 A1
20140335823 Heredia et al. Nov 2014 A1
20140337037 Chi Nov 2014 A1
20140337048 Brown et al. Nov 2014 A1
20140337266 Wolverton et al. Nov 2014 A1
20140337370 Aravamudan et al. Nov 2014 A1
20140337371 Li Nov 2014 A1
20140337438 Govande et al. Nov 2014 A1
20140337621 Nakhimov Nov 2014 A1
20140337751 Lim et al. Nov 2014 A1
20140337814 Kains et al. Nov 2014 A1
20140342762 Hajdu et al. Nov 2014 A1
20140343834 Demerchant et al. Nov 2014 A1
20140343943 Al-telmissani Nov 2014 A1
20140343946 Torok et al. Nov 2014 A1
20140344205 Luna et al. Nov 2014 A1
20140344627 Schaub et al. Nov 2014 A1
20140344687 Durham et al. Nov 2014 A1
20140347181 Luna et al. Nov 2014 A1
20140350847 Ichinokawa Nov 2014 A1
20140350924 Zurek et al. Nov 2014 A1
20140350933 Bak et al. Nov 2014 A1
20140351741 Medlock et al. Nov 2014 A1
20140351760 Skory et al. Nov 2014 A1
20140358519 Mirkin et al. Dec 2014 A1
20140358523 Sheth et al. Dec 2014 A1
20140358549 O'connor et al. Dec 2014 A1
20140359637 Yan Dec 2014 A1
20140359709 Nassar et al. Dec 2014 A1
20140361973 Raux et al. Dec 2014 A1
20140363074 Dolfing et al. Dec 2014 A1
20140364149 Marti et al. Dec 2014 A1
20140365209 Evermann Dec 2014 A1
20140365214 Bayley Dec 2014 A1
20140365216 Gruber et al. Dec 2014 A1
20140365226 Sinha Dec 2014 A1
20140365227 Cash et al. Dec 2014 A1
20140365407 Brown et al. Dec 2014 A1
20140365505 Clark et al. Dec 2014 A1
20140365880 Bellegarda Dec 2014 A1
20140365885 Carson et al. Dec 2014 A1
20140365895 Paulson et al. Dec 2014 A1
20140365922 Yang Dec 2014 A1
20140365945 Karunamuni Dec 2014 A1
20140370817 Luna Dec 2014 A1
20140370841 Roberts et al. Dec 2014 A1
20140372112 Xue et al. Dec 2014 A1
20140372356 Bilal et al. Dec 2014 A1
20140372468 Coilins et al. Dec 2014 A1
20140372931 Zhai et al. Dec 2014 A1
20140379334 Fry Dec 2014 A1
20140379341 Seo et al. Dec 2014 A1
20140379798 Bunner et al. Dec 2014 A1
20140380285 Gabel Dec 2014 A1
20150003797 Schmidt Jan 2015 A1
20150004958 Wang et al. Jan 2015 A1
20150006148 Goldszmit et al. Jan 2015 A1
20150006157 Silva et al. Jan 2015 A1
20150006167 Kato et al. Jan 2015 A1
20150006176 Pogue et al. Jan 2015 A1
20150006178 Peng et al. Jan 2015 A1
20150006184 Marti et al. Jan 2015 A1
20150006199 Snider et al. Jan 2015 A1
20150012271 Peng et al. Jan 2015 A1
20150019219 Tzirkel-Hancock et al. Jan 2015 A1
20150019221 Lee et al. Jan 2015 A1
20150019944 Kalgi Jan 2015 A1
20150019974 Doi et al. Jan 2015 A1
20150025405 Vairavan et al. Jan 2015 A1
20150026620 Kwon et al. Jan 2015 A1
20150027178 Scalisi Jan 2015 A1
20150031416 Labowicz et al. Jan 2015 A1
20150032443 Karov et al. Jan 2015 A1
20150033219 Breiner et al. Jan 2015 A1
20150033275 Natani et al. Jan 2015 A1
20150034855 Shen Feb 2015 A1
20150038161 Jakobson Feb 2015 A1
20150039292 Suleman et al. Feb 2015 A1
20150039295 Soschen Feb 2015 A1
20150039299 Weinstein et al. Feb 2015 A1
20150039305 Huang Feb 2015 A1
20150039606 Salaka et al. Feb 2015 A1
20150040012 Faaborg et al. Feb 2015 A1
20150045003 Vora et al. Feb 2015 A1
20150045007 Cash Feb 2015 A1
20150045068 Softer et al. Feb 2015 A1
20150046434 Lim et al. Feb 2015 A1
20150046537 Rakib Feb 2015 A1
20150046828 Desai et al. Feb 2015 A1
20150050633 Christmas et al. Feb 2015 A1
20150050923 Tu et al. Feb 2015 A1
20150051754 Kwon et al. Feb 2015 A1
20150053779 Adamek et al. Feb 2015 A1
20150053781 Nelson et al. Feb 2015 A1
20150055879 Yang Feb 2015 A1
20150058013 Pakhomov et al. Feb 2015 A1
20150058018 Georges et al. Feb 2015 A1
20150058720 Smadja et al. Feb 2015 A1
20150058785 Ookawara Feb 2015 A1
20150065149 Russell et al. Mar 2015 A1
20150065200 Namgung et al. Mar 2015 A1
20150066494 Salvador et al. Mar 2015 A1
20150066496 Deoras et al. Mar 2015 A1
20150066506 Romano et al. Mar 2015 A1
20150066516 Nishikawa et al. Mar 2015 A1
20150066817 Slayton et al. Mar 2015 A1
20150067485 Kim et al. Mar 2015 A1
20150067822 Randall Mar 2015 A1
20150071121 Patil et al. Mar 2015 A1
20150073788 Sak et al. Mar 2015 A1
20150073804 Senior et al. Mar 2015 A1
20150074524 Nicholson et al. Mar 2015 A1
20150074615 Han et al. Mar 2015 A1
20150081295 Yun et al. Mar 2015 A1
20150082229 Ouyang et al. Mar 2015 A1
20150086174 Abecassis et al. Mar 2015 A1
20150088511 Bharadwaj et al. Mar 2015 A1
20150088514 Typrin Mar 2015 A1
20150088518 Kim et al. Mar 2015 A1
20150088522 Hendrickson et al. Mar 2015 A1
20150088523 Schuster Mar 2015 A1
20150088998 Isensee et al. Mar 2015 A1
20150092520 Robison et al. Apr 2015 A1
20150094834 Vega et al. Apr 2015 A1
20150095031 Conkie et al. Apr 2015 A1
20150095268 Greenzeiger et al. Apr 2015 A1
20150095278 Flinn et al. Apr 2015 A1
20150100144 Lee et al. Apr 2015 A1
20150100313 Sharma Apr 2015 A1
20150100316 Williams et al. Apr 2015 A1
20150100537 Grieves et al. Apr 2015 A1
20150100983 Pan Apr 2015 A1
20150106093 Weeks et al. Apr 2015 A1
20150106737 Montoy-Wilson et al. Apr 2015 A1
20150113407 Hoffert et al. Apr 2015 A1
20150113435 Phillips Apr 2015 A1
20150120296 Stern et al. Apr 2015 A1
20150120641 Soon-Shiong et al. Apr 2015 A1
20150120723 Deshmukh et al. Apr 2015 A1
20150121216 Brown et al. Apr 2015 A1
20150123898 Kim et al. May 2015 A1
20150127337 Heigold et al. May 2015 A1
20150127348 Follis May 2015 A1
20150127350 Agiomyrgiannakis May 2015 A1
20150133049 Lee et al. May 2015 A1
20150133109 Freeman et al. May 2015 A1
20150134318 Cuthbert et al. May 2015 A1
20150134322 Cuthbert et al. May 2015 A1
20150134334 Sachidanandam et al. May 2015 A1
20150135085 Shoham et al. May 2015 A1
20150135123 Carr et al. May 2015 A1
20150140934 Abdurrahman et al. May 2015 A1
20150141150 Zha May 2015 A1
20150142420 Sarikaya et al. May 2015 A1
20150142438 Dai et al. May 2015 A1
20150142447 Kennewick et al. May 2015 A1
20150142851 Gupta et al. May 2015 A1
20150143419 Bhagwat et al. May 2015 A1
20150148013 Baldwin et al. May 2015 A1
20150149177 Kains et al. May 2015 A1
20150149182 Kains et al. May 2015 A1
20150149354 Mccoy May 2015 A1
20150149469 Xu et al. May 2015 A1
20150149899 Bernstein et al. May 2015 A1
20150149964 Bernstein et al. May 2015 A1
20150154001 Knox et al. Jun 2015 A1
20150154185 Waibel Jun 2015 A1
20150154976 Mutagi Jun 2015 A1
20150160855 Bi Jun 2015 A1
20150161291 Gur et al. Jun 2015 A1
20150161370 North et al. Jun 2015 A1
20150161521 Shah et al. Jun 2015 A1
20150161989 Hsu et al. Jun 2015 A1
20150162001 Kar et al. Jun 2015 A1
20150162006 Kummer Jun 2015 A1
20150163558 Wheatley Jun 2015 A1
20150169081 Neels et al. Jun 2015 A1
20150169284 Quast et al. Jun 2015 A1
20150169336 Harper et al. Jun 2015 A1
20150169696 Krishnappa et al. Jun 2015 A1
20150170073 Baker Jun 2015 A1
20150170664 Doherty et al. Jun 2015 A1
20150172262 Ortiz, Jr. et al. Jun 2015 A1
20150172463 Quast et al. Jun 2015 A1
20150178388 Winnemoeller et al. Jun 2015 A1
20150178785 Salonen Jun 2015 A1
20150179176 Ryu et al. Jun 2015 A1
20150181285 Zhang et al. Jun 2015 A1
20150185964 Stout Jul 2015 A1
20150185996 Brown et al. Jul 2015 A1
20150186012 Coleman et al. Jul 2015 A1
20150186110 Kannan Jul 2015 A1
20150186154 Brown et al. Jul 2015 A1
20150186155 Brown et al. Jul 2015 A1
20150186156 Brown et al. Jul 2015 A1
20150186351 Hicks et al. Jul 2015 A1
20150186538 Yan et al. Jul 2015 A1
20150186783 Byrne et al. Jul 2015 A1
20150187355 Parkinson et al. Jul 2015 A1
20150187369 Dadu et al. Jul 2015 A1
20150189362 Lee et al. Jul 2015 A1
20150193379 Mehta Jul 2015 A1
20150193391 Khvostichenko et al. Jul 2015 A1
20150193392 Greenblatt et al. Jul 2015 A1
20150194152 Katuri et al. Jul 2015 A1
20150194165 Faaborg et al. Jul 2015 A1
20150195379 Zhang et al. Jul 2015 A1
20150195606 McDevitt Jul 2015 A1
20150199077 Zuger et al. Jul 2015 A1
20150199960 Huo et al. Jul 2015 A1
20150199965 Leak et al. Jul 2015 A1
20150199967 Reddy et al. Jul 2015 A1
20150201064 Bells et al. Jul 2015 A1
20150201077 Konig et al. Jul 2015 A1
20150205425 Kuscher et al. Jul 2015 A1
20150205568 Matsuoka Jul 2015 A1
20150205858 Xie et al. Jul 2015 A1
20150206529 Kwon et al. Jul 2015 A1
20150208226 Kuusilinna et al. Jul 2015 A1
20150212791 Kumar et al. Jul 2015 A1
20150213140 Volkert Jul 2015 A1
20150213796 Waltermann et al. Jul 2015 A1
20150215258 Nowakowski et al. Jul 2015 A1
20150215350 Slayton et al. Jul 2015 A1
20150220264 Lewis Aug 2015 A1
20150220507 Mohajer et al. Aug 2015 A1
20150220715 Kim et al. Aug 2015 A1
20150220972 Subramanya et al. Aug 2015 A1
20150221304 Stewart Aug 2015 A1
20150221307 Shah et al. Aug 2015 A1
20150227505 Morimoto Aug 2015 A1
20150227633 Shapira Aug 2015 A1
20150228274 Leppanen et al. Aug 2015 A1
20150228275 Watanabe et al. Aug 2015 A1
20150228281 Raniere Aug 2015 A1
20150228283 Ehsani et al. Aug 2015 A1
20150228292 Goldstein et al. Aug 2015 A1
20150230095 Smith et al. Aug 2015 A1
20150234636 Barnes, Jr. Aug 2015 A1
20150234800 Patrick et al. Aug 2015 A1
20150237301 Shi et al. Aug 2015 A1
20150242091 Lu et al. Aug 2015 A1
20150242385 Bao et al. Aug 2015 A1
20150243278 Kibre et al. Aug 2015 A1
20150243279 Morse et al. Aug 2015 A1
20150243283 Halash et al. Aug 2015 A1
20150244665 Choi et al. Aug 2015 A1
20150245154 Dadu et al. Aug 2015 A1
20150248651 Akutagawa et al. Sep 2015 A1
20150248886 Sarikaya et al. Sep 2015 A1
20150253146 Annapureddy et al. Sep 2015 A1
20150253885 Kagan et al. Sep 2015 A1
20150254057 Klein et al. Sep 2015 A1
20150254058 Klein et al. Sep 2015 A1
20150254333 Fife et al. Sep 2015 A1
20150255071 Chiba Sep 2015 A1
20150256873 Klein et al. Sep 2015 A1
20150261298 Li Sep 2015 A1
20150261496 Faaborg et al. Sep 2015 A1
20150261850 Mittal Sep 2015 A1
20150269139 McAteer et al. Sep 2015 A1
20150269617 Mikurak Sep 2015 A1
20150269677 Milne Sep 2015 A1
20150269943 VanBlon et al. Sep 2015 A1
20150277574 Jain et al. Oct 2015 A1
20150278348 Paruchuri et al. Oct 2015 A1
20150278370 Stratvert et al. Oct 2015 A1
20150278737 Chen Huebscher et al. Oct 2015 A1
20150279358 Kingsbury et al. Oct 2015 A1
20150279360 Mengibar et al. Oct 2015 A1
20150279366 Krestnikov et al. Oct 2015 A1
20150281380 Wang et al. Oct 2015 A1
20150281401 Le et al. Oct 2015 A1
20150286627 Chang et al. Oct 2015 A1
20150286716 Snibbe et al. Oct 2015 A1
20150286937 Hildebrand Oct 2015 A1
20150287401 Lee et al. Oct 2015 A1
20150287409 Jang Oct 2015 A1
20150287411 Kojima et al. Oct 2015 A1
20150288629 Choi et al. Oct 2015 A1
20150294086 Kare et al. Oct 2015 A1
20150294377 Chow Oct 2015 A1
20150294516 Chiang Oct 2015 A1
20150295915 Xiu Oct 2015 A1
20150301796 Visser et al. Oct 2015 A1
20150302855 Kim et al. Oct 2015 A1
20150302856 Kim et al. Oct 2015 A1
20150302857 Yamada Oct 2015 A1
20150302870 Burke et al. Oct 2015 A1
20150309997 Lee et al. Oct 2015 A1
20150310114 Ryger et al. Oct 2015 A1
20150310858 Li et al. Oct 2015 A1
20150310862 Dauphin et al. Oct 2015 A1
20150310879 Buchanan et al. Oct 2015 A1
20150310888 Chen Oct 2015 A1
20150312182 Langholz Oct 2015 A1
20150312409 Czarnecki et al. Oct 2015 A1
20150314454 Breazeal et al. Nov 2015 A1
20150317069 Clements et al. Nov 2015 A1
20150317310 Eiche et al. Nov 2015 A1
20150319411 Kasmir et al. Nov 2015 A1
20150324041 Varley et al. Nov 2015 A1
20150324334 Lee et al. Nov 2015 A1
20150331664 Osawa et al. Nov 2015 A1
20150331711 Huang et al. Nov 2015 A1
20150332667 Mason Nov 2015 A1
20150334346 Cheatham, III et al. Nov 2015 A1
20150339049 Kasemset et al. Nov 2015 A1
20150339391 Kang et al. Nov 2015 A1
20150340033 Di Fabbrizio et al. Nov 2015 A1
20150340040 Mun et al. Nov 2015 A1
20150340042 Sejnoha et al. Nov 2015 A1
20150341717 Song et al. Nov 2015 A1
20150346845 Di Censo et al. Dec 2015 A1
20150347086 Liedholm et al. Dec 2015 A1
20150347381 Bellegarda Dec 2015 A1
20150347382 Dolfing et al. Dec 2015 A1
20150347383 Willmore et al. Dec 2015 A1
20150347385 Flor et al. Dec 2015 A1
20150347393 Futrell et al. Dec 2015 A1
20150347552 Habouzit et al. Dec 2015 A1
20150347733 Tsou et al. Dec 2015 A1
20150347985 Gross et al. Dec 2015 A1
20150348533 Saddler et al. Dec 2015 A1
20150348547 Paulik et al. Dec 2015 A1
20150348548 Piernot et al. Dec 2015 A1
20150348549 Giuli et al. Dec 2015 A1
20150348551 Gruber et al. Dec 2015 A1
20150348554 Orr et al. Dec 2015 A1
20150348555 Sugita Dec 2015 A1
20150348565 Rhoten et al. Dec 2015 A1
20150349934 Pollack et al. Dec 2015 A1
20150350031 Burks et al. Dec 2015 A1
20150350342 Thorpe et al. Dec 2015 A1
20150350594 Mate et al. Dec 2015 A1
20150352999 Bando et al. Dec 2015 A1
20150355879 Beckhardt et al. Dec 2015 A1
20150356410 Faith et al. Dec 2015 A1
20150363587 Ahn et al. Dec 2015 A1
20150364128 Zhao et al. Dec 2015 A1
20150364140 Thörn Dec 2015 A1
20150370531 Faaborg Dec 2015 A1
20150370780 Wang et al. Dec 2015 A1
20150370787 Akbacak et al. Dec 2015 A1
20150370884 Hurley et al. Dec 2015 A1
20150371215 Zhou et al. Dec 2015 A1
20150371529 Dolecki Dec 2015 A1
20150371639 Foerster et al. Dec 2015 A1
20150371663 Gustafson et al. Dec 2015 A1
20150371665 Naik et al. Dec 2015 A1
20150373183 Woolsey et al. Dec 2015 A1
20150379118 Wickenkamp et al. Dec 2015 A1
20150379414 Yeh et al. Dec 2015 A1
20150379993 Subhojit et al. Dec 2015 A1
20150381923 Wickenkamp et al. Dec 2015 A1
20150382047 Van Os et al. Dec 2015 A1
20150382079 Lister et al. Dec 2015 A1
20150382147 Clark et al. Dec 2015 A1
20160004690 Bangalore et al. Jan 2016 A1
20160005320 deCharms et al. Jan 2016 A1
20160012038 Edwards et al. Jan 2016 A1
20160014476 Caliendo, Jr. et al. Jan 2016 A1
20160018872 Tu et al. Jan 2016 A1
20160018900 Tu et al. Jan 2016 A1
20160018959 Yamashita et al. Jan 2016 A1
20160019886 Hong Jan 2016 A1
20160021414 Padi et al. Jan 2016 A1
20160026258 Ou et al. Jan 2016 A1
20160027431 Kurzweil et al. Jan 2016 A1
20160028666 Li Jan 2016 A1
20160029316 Mohan et al. Jan 2016 A1
20160034042 Joo Feb 2016 A1
20160034811 Paulik et al. Feb 2016 A1
20160036953 Lee et al. Feb 2016 A1
20160041809 Clayton et al. Feb 2016 A1
20160042735 Vibbert et al. Feb 2016 A1
20160042748 Jain et al. Feb 2016 A1
20160043905 Fiedler Feb 2016 A1
20160048666 Dey et al. Feb 2016 A1
20160050254 Rao et al. Feb 2016 A1
20160055422 Li Feb 2016 A1
20160062605 Agarwal et al. Mar 2016 A1
20160063094 Udupa et al. Mar 2016 A1
20160063998 Krishnamoorthy et al. Mar 2016 A1
20160070581 Soon-Shiong Mar 2016 A1
20160071516 Lee et al. Mar 2016 A1
20160071517 Beaver et al. Mar 2016 A1
20160071521 Haughay Mar 2016 A1
20160072940 Cronin Mar 2016 A1
20160077794 Kim et al. Mar 2016 A1
20160078860 Paulik et al. Mar 2016 A1
20160080165 Ehsani et al. Mar 2016 A1
20160080475 Singh et al. Mar 2016 A1
20160085295 Shimy et al. Mar 2016 A1
20160085827 Chadha et al. Mar 2016 A1
20160086116 Rao et al. Mar 2016 A1
20160086599 Kurata et al. Mar 2016 A1
20160088335 Zucchetta Mar 2016 A1
20160091967 Prokofieva et al. Mar 2016 A1
20160092434 Bellegarda Mar 2016 A1
20160092447 Venkataraman et al. Mar 2016 A1
20160092766 Sainath et al. Mar 2016 A1
20160093291 Kim Mar 2016 A1
20160093298 Naik et al. Mar 2016 A1
20160093301 Bellegarda et al. Mar 2016 A1
20160093304 Kim et al. Mar 2016 A1
20160094700 Lee et al. Mar 2016 A1
20160094889 Venkataraman et al. Mar 2016 A1
20160094979 Naik et al. Mar 2016 A1
20160098991 Luo et al. Apr 2016 A1
20160098992 Renard et al. Apr 2016 A1
20160099892 Palakovich et al. Apr 2016 A1
20160099984 Karagiannis et al. Apr 2016 A1
20160104480 Sharifi Apr 2016 A1
20160104486 Penilla et al. Apr 2016 A1
20160111091 Bakish Apr 2016 A1
20160112746 Zhang et al. Apr 2016 A1
20160117386 Ajmera et al. Apr 2016 A1
20160118048 Heide Apr 2016 A1
20160119338 Cheyer Apr 2016 A1
20160125048 Hamada May 2016 A1
20160125071 Gabbai May 2016 A1
20160132046 Beoughter et al. May 2016 A1
20160132484 Nauze et al. May 2016 A1
20160132488 Clark et al. May 2016 A1
20160133254 Vogel et al. May 2016 A1
20160139662 Dabhade May 2016 A1
20160140951 Agiomyrgiannakis et al. May 2016 A1
20160140962 Sharifi May 2016 A1
20160147725 Patten et al. May 2016 A1
20160148610 Kennewick, Jr. et al. May 2016 A1
20160150020 Farmer et al. May 2016 A1
20160154624 Son et al. Jun 2016 A1
20160154880 Hoarty Jun 2016 A1
20160155442 Kannan et al. Jun 2016 A1
20160155443 Khan et al. Jun 2016 A1
20160156574 Hum et al. Jun 2016 A1
20160162456 Munro et al. Jun 2016 A1
20160163311 Crook et al. Jun 2016 A1
20160163312 Naik et al. Jun 2016 A1
20160170966 Kolo Jun 2016 A1
20160173578 Sharma et al. Jun 2016 A1
20160173617 Allinson Jun 2016 A1
20160173960 Snibbe et al. Jun 2016 A1
20160179462 Bjorkengren Jun 2016 A1
20160179464 Reddy et al. Jun 2016 A1
20160179787 Deleeuw Jun 2016 A1
20160180840 Siddiq et al. Jun 2016 A1
20160180844 Vanblon et al. Jun 2016 A1
20160182410 Janakiraman et al. Jun 2016 A1
20160182709 Kim et al. Jun 2016 A1
20160188181 Smith Jun 2016 A1
20160188738 Gruber et al. Jun 2016 A1
20160189717 Kannan et al. Jun 2016 A1
20160196110 Yehoshua et al. Jul 2016 A1
20160198319 Huang et al. Jul 2016 A1
20160203002 Kannan et al. Jul 2016 A1
20160210551 Lee et al. Jul 2016 A1
20160210981 Lee Jul 2016 A1
20160212488 Os et al. Jul 2016 A1
20160217784 Gelfenbeyn et al. Jul 2016 A1
20160224540 Stewart et al. Aug 2016 A1
20160224774 Pender Aug 2016 A1
20160225372 Cheung et al. Aug 2016 A1
20160227107 Beaumont Aug 2016 A1
20160232500 Wang et al. Aug 2016 A1
20160239645 Heo et al. Aug 2016 A1
20160240187 Fleizach et al. Aug 2016 A1
20160240189 Lee et al. Aug 2016 A1
20160240192 Raghuvir Aug 2016 A1
20160247061 Trask et al. Aug 2016 A1
20160249319 Dotan-Cohen et al. Aug 2016 A1
20160253312 Rhodes Sep 2016 A1
20160253528 Gao et al. Sep 2016 A1
20160259623 Sumner et al. Sep 2016 A1
20160259656 Sumner et al. Sep 2016 A1
20160259779 Labský et al. Sep 2016 A1
20160260431 Newendorp et al. Sep 2016 A1
20160260433 Sumner et al. Sep 2016 A1
20160260434 Gelfenbeyn et al. Sep 2016 A1
20160260436 Lemay et al. Sep 2016 A1
20160266871 Schmid et al. Sep 2016 A1
20160267904 Biadsy et al. Sep 2016 A1
20160274938 Strinati et al. Sep 2016 A1
20160275941 Bellegarda et al. Sep 2016 A1
20160275947 Li et al. Sep 2016 A1
20160282824 Smallwood et al. Sep 2016 A1
20160282956 Ouyang et al. Sep 2016 A1
20160283185 Mclaren et al. Sep 2016 A1
20160284005 Daniel et al. Sep 2016 A1
20160284199 Dotan-Cohen et al. Sep 2016 A1
20160285808 Franklin et al. Sep 2016 A1
20160286045 Shaltiel et al. Sep 2016 A1
20160293157 Chen et al. Oct 2016 A1
20160293168 Chen Oct 2016 A1
20160294755 Prabhu Oct 2016 A1
20160299685 Zhai et al. Oct 2016 A1
20160299882 Hegerty et al. Oct 2016 A1
20160299883 Zhu et al. Oct 2016 A1
20160299977 Hreha Oct 2016 A1
20160300571 Foerster et al. Oct 2016 A1
20160301639 Liu et al. Oct 2016 A1
20160307566 Bellegarda Oct 2016 A1
20160308799 Schubert et al. Oct 2016 A1
20160313906 Kilchenko et al. Oct 2016 A1
20160314788 Jitkoff et al. Oct 2016 A1
20160314792 Alvarez et al. Oct 2016 A1
20160315996 Ha et al. Oct 2016 A1
20160317924 Tanaka et al. Nov 2016 A1
20160321239 Iso-Sipilä et al. Nov 2016 A1
20160321261 Spasojevic et al. Nov 2016 A1
20160321358 Kanani et al. Nov 2016 A1
20160322043 Bellegarda Nov 2016 A1
20160322044 Jung et al. Nov 2016 A1
20160322045 Hatfield et al. Nov 2016 A1
20160322048 Amano et al. Nov 2016 A1
20160322050 Wang et al. Nov 2016 A1
20160328147 Zhang et al. Nov 2016 A1
20160328205 Agrawal et al. Nov 2016 A1
20160328893 Cordova et al. Nov 2016 A1
20160329060 Ito et al. Nov 2016 A1
20160334973 Reckhow et al. Nov 2016 A1
20160335532 Sanghavi et al. Nov 2016 A1
20160336007 Hanazawa et al. Nov 2016 A1
20160336010 Lindahl Nov 2016 A1
20160336011 Koll et al. Nov 2016 A1
20160336024 Choi et al. Nov 2016 A1
20160337299 Lane et al. Nov 2016 A1
20160337301 Rollins et al. Nov 2016 A1
20160342317 Lim et al. Nov 2016 A1
20160342685 Basu et al. Nov 2016 A1
20160342781 Jeon Nov 2016 A1
20160350650 Leeman-Munk et al. Dec 2016 A1
20160351190 Piemot et al. Dec 2016 A1
20160352567 Robbins et al. Dec 2016 A1
20160357304 Hatori et al. Dec 2016 A1
20160357728 Bellegarda et al. Dec 2016 A1
20160357790 Elkington et al. Dec 2016 A1
20160357861 Carlhian et al. Dec 2016 A1
20160357870 Hentschel et al. Dec 2016 A1
20160358598 Williams et al. Dec 2016 A1
20160358600 Nallasamy et al. Dec 2016 A1
20160358619 Ramprashad et al. Dec 2016 A1
20160359771 Sridhar Dec 2016 A1
20160360039 Sanghavi et al. Dec 2016 A1
20160360336 Gross et al. Dec 2016 A1
20160360382 Gross et al. Dec 2016 A1
20160364378 Futrell et al. Dec 2016 A1
20160365101 Foy et al. Dec 2016 A1
20160371250 Rhodes Dec 2016 A1
20160372112 Miller et al. Dec 2016 A1
20160372119 Sak et al. Dec 2016 A1
20160378747 Orr et al. Dec 2016 A1
20160379091 Lin et al. Dec 2016 A1
20160379626 Deisher et al. Dec 2016 A1
20160379632 Hoffmeister et al. Dec 2016 A1
20160379633 Lehman et al. Dec 2016 A1
20160379639 Weinstein et al. Dec 2016 A1
20160379641 Liu et al. Dec 2016 A1
20170003931 Dvortsov et al. Jan 2017 A1
20170004824 Yoo et al. Jan 2017 A1
20170005818 Gould Jan 2017 A1
20170011091 Chehreghani Jan 2017 A1
20170011303 Annapureddy et al. Jan 2017 A1
20170011742 Jing et al. Jan 2017 A1
20170013124 Havelka et al. Jan 2017 A1
20170013331 Watanabe et al. Jan 2017 A1
20170018271 Khan et al. Jan 2017 A1
20170019987 Dragone et al. Jan 2017 A1
20170023963 Davis et al. Jan 2017 A1
20170025124 Mixter et al. Jan 2017 A1
20170026318 Daniel et al. Jan 2017 A1
20170026509 Rand Jan 2017 A1
20170031576 Saoji et al. Feb 2017 A1
20170032783 Lord et al. Feb 2017 A1
20170032787 Dayal Feb 2017 A1
20170032791 Elson et al. Feb 2017 A1
20170039283 Bennett et al. Feb 2017 A1
20170039475 Cheyer et al. Feb 2017 A1
20170040002 Basson et al. Feb 2017 A1
20170047063 Ohmura et al. Feb 2017 A1
20170053652 Choi et al. Feb 2017 A1
20170055895 Jardins et al. Mar 2017 A1
20170060853 Lee Mar 2017 A1
20170061423 Bryant et al. Mar 2017 A1
20170068423 Napolitano et al. Mar 2017 A1
20170068513 Stasior et al. Mar 2017 A1
20170068550 Zeitlin Mar 2017 A1
20170068670 Orr et al. Mar 2017 A1
20170069308 Aleksic et al. Mar 2017 A1
20170075653 Dawidowsky et al. Mar 2017 A1
20170076720 Gopalan et al. Mar 2017 A1
20170076721 Bargetzi et al. Mar 2017 A1
20170078490 Kaminsky et al. Mar 2017 A1
20170083179 Gruber et al. Mar 2017 A1
20170083285 Meyers et al. Mar 2017 A1
20170083504 Huang Mar 2017 A1
20170084277 Sharifi Mar 2017 A1
20170085547 De Aguiar et al. Mar 2017 A1
20170090569 Levesque Mar 2017 A1
20170091168 Bellegarda et al. Mar 2017 A1
20170091169 Bellegarda et al. Mar 2017 A1
20170091612 Gruber et al. Mar 2017 A1
20170092259 Jeon Mar 2017 A1
20170092270 Newendorp et al. Mar 2017 A1
20170092278 Evermann et al. Mar 2017 A1
20170093356 Cudak et al. Mar 2017 A1
20170102837 Toumpelis Apr 2017 A1
20170102915 Kuscher et al. Apr 2017 A1
20170103749 Zhao et al. Apr 2017 A1
20170105190 Logan et al. Apr 2017 A1
20170110117 Chakladar et al. Apr 2017 A1
20170116177 Walia Apr 2017 A1
20170116982 Gelfenbeyn et al. Apr 2017 A1
20170116989 Yadgar et al. Apr 2017 A1
20170124190 Wang et al. May 2017 A1
20170125016 Wang May 2017 A1
20170127124 Wilson et al. May 2017 A9
20170131778 Iyer May 2017 A1
20170132019 Karashchuk et al. May 2017 A1
20170132199 Vescovi et al. May 2017 A1
20170133007 Drewes May 2017 A1
20170140041 Dotan-Cohen et al. May 2017 A1
20170140644 Hwang et al. May 2017 A1
20170140760 Sachdev May 2017 A1
20170147841 Stagg et al. May 2017 A1
20170148044 Fukuda et al. May 2017 A1
20170154033 Lee Jun 2017 A1
20170154055 Dimson et al. Jun 2017 A1
20170155940 Jin et al. Jun 2017 A1
20170161018 Lemay et al. Jun 2017 A1
20170161268 Badaskar Jun 2017 A1
20170161293 Ionescu et al. Jun 2017 A1
20170161393 Oh et al. Jun 2017 A1
20170162191 Grost et al. Jun 2017 A1
20170162203 Huang et al. Jun 2017 A1
20170169818 Vanbion et al. Jun 2017 A1
20170169819 Mese et al. Jun 2017 A1
20170177547 Ciereszko et al. Jun 2017 A1
20170178619 Naik et al. Jun 2017 A1
20170178620 Fleizach et al. Jun 2017 A1
20170178626 Gruber et al. Jun 2017 A1
20170180499 Gelfenbeyn et al. Jun 2017 A1
20170185375 Martel et al. Jun 2017 A1
20170185581 Bojja et al. Jun 2017 A1
20170186429 Giuli et al. Jun 2017 A1
20170187711 Joo et al. Jun 2017 A1
20170193083 Bhatt et al. Jul 2017 A1
20170195493 Sudarsan et al. Jul 2017 A1
20170195636 Child et al. Jul 2017 A1
20170199870 Zheng et al. Jul 2017 A1
20170199874 Patel et al. Jul 2017 A1
20170200066 Wang et al. Jul 2017 A1
20170201609 Salmenkaita et al. Jul 2017 A1
20170201613 Engelke et al. Jul 2017 A1
20170206899 Bryant et al. Jul 2017 A1
20170215052 Koum et al. Jul 2017 A1
20170221486 Kurata et al. Aug 2017 A1
20170223189 Meredith et al. Aug 2017 A1
20170227935 Su et al. Aug 2017 A1
20170228367 Pasupalak et al. Aug 2017 A1
20170228382 Haviv et al. Aug 2017 A1
20170230429 Garmark et al. Aug 2017 A1
20170230497 Kim et al. Aug 2017 A1
20170230709 Van Os et al. Aug 2017 A1
20170235361 Rigazio et al. Aug 2017 A1
20170235618 Lin et al. Aug 2017 A1
20170235721 Almosallam et al. Aug 2017 A1
20170236512 Williams et al. Aug 2017 A1
20170236514 Nelson Aug 2017 A1
20170238039 Sabattini Aug 2017 A1
20170242653 Lang et al. Aug 2017 A1
20170242657 Jarvis et al. Aug 2017 A1
20170243468 Dotan-Cohen et al. Aug 2017 A1
20170243576 Millington et al. Aug 2017 A1
20170243586 Civelli et al. Aug 2017 A1
20170256256 Wang et al. Sep 2017 A1
20170263247 Kang et al. Sep 2017 A1
20170263248 Gruber et al. Sep 2017 A1
20170263249 Akbacak et al. Sep 2017 A1
20170264451 Yu et al. Sep 2017 A1
20170264711 Natarajan et al. Sep 2017 A1
20170270912 Levit et al. Sep 2017 A1
20170278514 Mathias et al. Sep 2017 A1
20170285915 Napolitano et al. Oct 2017 A1
20170286397 Gonzalez Oct 2017 A1
20170287472 Ogawa et al. Oct 2017 A1
20170289305 Liensberger et al. Oct 2017 A1
20170295446 Shivappa Oct 2017 A1
20170308609 Berkhin et al. Oct 2017 A1
20170311005 Lin Oct 2017 A1
20170316775 Le et al. Nov 2017 A1
20170316782 Haughay Nov 2017 A1
20170319123 Voss et al. Nov 2017 A1
20170323637 Naik Nov 2017 A1
20170329466 Krenkler et al. Nov 2017 A1
20170329490 Esinovskaya et al. Nov 2017 A1
20170329572 Shah et al. Nov 2017 A1
20170329630 Jann et al. Nov 2017 A1
20170330567 Van Wissen et al. Nov 2017 A1
20170337035 Choudhary et al. Nov 2017 A1
20170337478 Sarikaya et al. Nov 2017 A1
20170345411 Raitio et al. Nov 2017 A1
20170345420 Barnett, Jr. Nov 2017 A1
20170345429 Hardee et al. Nov 2017 A1
20170346949 Sanghavi et al. Nov 2017 A1
20170351487 Avilés-Casco et al. Dec 2017 A1
20170352346 Paulik et al. Dec 2017 A1
20170352350 Booker et al. Dec 2017 A1
20170357478 Piersol et al. Dec 2017 A1
20170357632 Pagallo et al. Dec 2017 A1
20170357633 Wang et al. Dec 2017 A1
20170357637 Nell et al. Dec 2017 A1
20170357640 Bellegarda et al. Dec 2017 A1
20170357716 Bellegarda et al. Dec 2017 A1
20170358300 Laurens et al. Dec 2017 A1
20170358301 Raitio et al. Dec 2017 A1
20170358302 Orr et al. Dec 2017 A1
20170358303 Walker, II et al. Dec 2017 A1
20170358304 Castillo et al. Dec 2017 A1
20170358305 Kudurshian et al. Dec 2017 A1
20170358317 James Dec 2017 A1
20170365251 Park et al. Dec 2017 A1
20170371509 Jung et al. Dec 2017 A1
20170371885 Aggarwal et al. Dec 2017 A1
20170374093 Dhar et al. Dec 2017 A1
20170374176 Agrawal et al. Dec 2017 A1
20180005112 Iso-Sipila et al. Jan 2018 A1
20180007060 Leblang et al. Jan 2018 A1
20180007096 Levin et al. Jan 2018 A1
20180007538 Naik et al. Jan 2018 A1
20180012596 Piernot et al. Jan 2018 A1
20180018248 Bhargava et al. Jan 2018 A1
20180024985 Asano Jan 2018 A1
20180033431 Newendorp et al. Feb 2018 A1
20180033436 Zhou Feb 2018 A1
20180047201 Filev et al. Feb 2018 A1
20180047406 Park Feb 2018 A1
20180052909 Sharifi et al. Feb 2018 A1
20180054505 Hart et al. Feb 2018 A1
20180060032 Boesen Mar 2018 A1
20180060301 Li et al. Mar 2018 A1
20180060312 Won Mar 2018 A1
20180061400 Carbune et al. Mar 2018 A1
20180061401 Sarikaya et al. Mar 2018 A1
20180062691 Barnett, Jr. Mar 2018 A1
20180063308 Crystal et al. Mar 2018 A1
20180063324 Van Meter, II Mar 2018 A1
20180063624 Boesen Mar 2018 A1
20180067904 Li Mar 2018 A1
20180067914 Chen et al. Mar 2018 A1
20180067918 Bellegarda et al. Mar 2018 A1
20180069743 Bakken et al. Mar 2018 A1
20180075847 Lee et al. Mar 2018 A1
20180088969 Vanblon et al. Mar 2018 A1
20180089166 Meyer et al. Mar 2018 A1
20180089588 Ravi et al. Mar 2018 A1
20180090143 Saddler et al. Mar 2018 A1
20180091847 Wu et al. Mar 2018 A1
20180096683 James et al. Apr 2018 A1
20180096690 Mixter et al. Apr 2018 A1
20180102914 Kawachi et al. Apr 2018 A1
20180107917 Hewavitharana et al. Apr 2018 A1
20180107945 Gao et al. Apr 2018 A1
20180108346 Paulik et al. Apr 2018 A1
20180113673 Sheynblat Apr 2018 A1
20180121432 Parson et al. May 2018 A1
20180122376 Kojima May 2018 A1
20180122378 Mixter et al. May 2018 A1
20180129967 Herreshoff May 2018 A1
20180130470 Lemay et al. May 2018 A1
20180130471 Trufinescu et al. May 2018 A1
20180137856 Gilbert May 2018 A1
20180137857 Zhou et al. May 2018 A1
20180137865 Ling May 2018 A1
20180143967 Anbazhagan et al. May 2018 A1
20180144615 Kinney et al. May 2018 A1
20180144746 Mishra et al. May 2018 A1
20180144748 Leong May 2018 A1
20180146089 Rauenbuehler et al. May 2018 A1
20180150744 Orr et al. May 2018 A1
20180157372 Kurabayashi Jun 2018 A1
20180157992 Susskind et al. Jun 2018 A1
20180158548 Taheri et al. Jun 2018 A1
20180166076 Higuchi et al. Jun 2018 A1
20180167884 Dawid et al. Jun 2018 A1
20180173403 Carbune et al. Jun 2018 A1
20180173542 Chan et al. Jun 2018 A1
20180174406 Arashi et al. Jun 2018 A1
20180174576 Soltau et al. Jun 2018 A1
20180174597 Lee et al. Jun 2018 A1
20180182376 Gysel et al. Jun 2018 A1
20180188840 Tamura et al. Jul 2018 A1
20180190273 Karimli et al. Jul 2018 A1
20180190279 Anderson et al. Jul 2018 A1
20180191670 Suyama Jul 2018 A1
20180196683 Radebaugh et al. Jul 2018 A1
20180210874 Fuxman et al. Jul 2018 A1
20180213448 Segal et al. Jul 2018 A1
20180218735 Hunt et al. Aug 2018 A1
20180225274 Tommy et al. Aug 2018 A1
20180232203 Gelfenbeyn et al. Aug 2018 A1
20180233140 Koishida et al. Aug 2018 A1
20180247065 Rhee et al. Aug 2018 A1
20180253209 Jaygarl et al. Sep 2018 A1
20180253652 Palzer et al. Sep 2018 A1
20180260680 Finkelstein et al. Sep 2018 A1
20180268106 Velaga Sep 2018 A1
20180270343 Rout et al. Sep 2018 A1
20180275839 Kocienda et al. Sep 2018 A1
20180276197 Nell et al. Sep 2018 A1
20180277113 Hartung et al. Sep 2018 A1
20180278740 Choi Sep 2018 A1
20180285056 Cutler et al. Oct 2018 A1
20180293984 Lindahl Oct 2018 A1
20180293988 Huang et al. Oct 2018 A1
20180308477 Nagasaka Oct 2018 A1
20180308480 Jang et al. Oct 2018 A1
20180308485 Kudurshian et al. Oct 2018 A1
20180308486 Saddler et al. Oct 2018 A1
20180314552 Kim et al. Nov 2018 A1
20180315416 Berthelsen et al. Nov 2018 A1
20180322112 Bellegarda et al. Nov 2018 A1
20180322881 Min et al. Nov 2018 A1
20180329677 Gruber et al. Nov 2018 A1
20180329957 Frazzingaro et al. Nov 2018 A1
20180329982 Patel et al. Nov 2018 A1
20180329998 Thomson et al. Nov 2018 A1
20180330714 Paulik et al. Nov 2018 A1
20180330721 Thomson et al. Nov 2018 A1
20180330722 Newendorp et al. Nov 2018 A1
20180330723 Acero et al. Nov 2018 A1
20180330729 Golipour et al. Nov 2018 A1
20180330730 Garg et al. Nov 2018 A1
20180330731 Zeitlin et al. Nov 2018 A1
20180330733 Orr et al. Nov 2018 A1
20180330737 Paulik et al. Nov 2018 A1
20180332118 Phipps et al. Nov 2018 A1
20180336184 Bellegarda et al. Nov 2018 A1
20180336197 Skilling et al. Nov 2018 A1
20180336275 Graham et al. Nov 2018 A1
20180336439 Kliger et al. Nov 2018 A1
20180336449 Adan et al. Nov 2018 A1
20180336892 Kim et al. Nov 2018 A1
20180336894 Graham et al. Nov 2018 A1
20180336904 Piercy et al. Nov 2018 A1
20180336905 Kim et al. Nov 2018 A1
20180336920 Bastian et al. Nov 2018 A1
20180341643 Alders et al. Nov 2018 A1
20180343557 Naik et al. Nov 2018 A1
20180349084 Nagasaka et al. Dec 2018 A1
20180349346 Hatori et al. Dec 2018 A1
20180349349 Bellegarda et al. Dec 2018 A1
20180349447 Maccartney et al. Dec 2018 A1
20180349472 Kohlschuetter et al. Dec 2018 A1
20180350345 Naik Dec 2018 A1
20180350353 Gruber et al. Dec 2018 A1
20180357073 Johnson et al. Dec 2018 A1
20180357308 Cheyer Dec 2018 A1
20180358015 Cash et al. Dec 2018 A1
20180358019 Mont-Reynaud Dec 2018 A1
20180365653 Cleaver et al. Dec 2018 A1
20180366105 Kim Dec 2018 A1
20180373487 Gruber et al. Dec 2018 A1
20180374484 Huang et al. Dec 2018 A1
20190012141 Piersol et al. Jan 2019 A1
20190012449 Cheyer Jan 2019 A1
20190013018 Rekstad Jan 2019 A1
20190013025 Alcorn et al. Jan 2019 A1
20190014450 Gruber et al. Jan 2019 A1
20190019077 Griffin et al. Jan 2019 A1
20190027152 Huang et al. Jan 2019 A1
20190034040 Shah et al. Jan 2019 A1
20190034826 Ahmad et al. Jan 2019 A1
20190035405 Haughay Jan 2019 A1
20190042059 Baer Feb 2019 A1
20190042627 Osotio et al. Feb 2019 A1
20190043507 Huang et al. Feb 2019 A1
20190045040 Lee et al. Feb 2019 A1
20190051309 Kim et al. Feb 2019 A1
20190057697 Giuli et al. Feb 2019 A1
20190065144 Sumner et al. Feb 2019 A1
20190065993 Srinivasan et al. Feb 2019 A1
20190066674 Jaygarl et al. Feb 2019 A1
20190068810 Okamoto et al. Feb 2019 A1
20190073998 Leblang et al. Mar 2019 A1
20190074009 Kim et al. Mar 2019 A1
20190074015 Orr et al. Mar 2019 A1
20190074016 Orr et al. Mar 2019 A1
20190079476 Funes Mar 2019 A1
20190080685 Johnson, Jr. Mar 2019 A1
20190080698 Miller Mar 2019 A1
20190087412 Seyed Ibrahim et al. Mar 2019 A1
20190087455 He et al. Mar 2019 A1
20190095050 Gruber et al. Mar 2019 A1
20190095171 Carson et al. Mar 2019 A1
20190102378 Piernot et al. Apr 2019 A1
20190102381 Futrell et al. Apr 2019 A1
20190103103 Ni et al. Apr 2019 A1
20190103112 Walker et al. Apr 2019 A1
20190116264 Sanghavi et al. Apr 2019 A1
20190122666 Raitio et al. Apr 2019 A1
20190122692 Binder et al. Apr 2019 A1
20190124019 Leon et al. Apr 2019 A1
20190129615 Sundar et al. May 2019 A1
20190132694 Hanes et al. May 2019 A1
20190139541 Andersen et al. May 2019 A1
20190141494 Gross et al. May 2019 A1
20190147880 Booker et al. May 2019 A1
20190149972 Parks et al. May 2019 A1
20190156830 Devaraj et al. May 2019 A1
20190158994 Gross et al. May 2019 A1
20190164546 Piernot et al. May 2019 A1
20190172467 Kim et al. Jun 2019 A1
20190179607 Thangarathnam et al. Jun 2019 A1
20190179890 Evermann Jun 2019 A1
20190180770 Kothari et al. Jun 2019 A1
20190182176 Niewczas Jun 2019 A1
20190187787 White et al. Jun 2019 A1
20190188326 Daianu et al. Jun 2019 A1
20190188328 Oyenan et al. Jun 2019 A1
20190189118 Piernot et al. Jun 2019 A1
20190189125 Van Os et al. Jun 2019 A1
20190197053 Graham et al. Jun 2019 A1
20190213999 Grupen et al. Jul 2019 A1
20190214024 Gruber et al. Jul 2019 A1
20190220245 Martel et al. Jul 2019 A1
20190220246 Orr et al. Jul 2019 A1
20190220247 Lemay et al. Jul 2019 A1
20190236130 Li et al. Aug 2019 A1
20190236459 Cheyer et al. Aug 2019 A1
20190244618 Newendorp et al. Aug 2019 A1
20190251339 Hawker Aug 2019 A1
20190251960 Maker et al. Aug 2019 A1
20190259386 Kudurshian et al. Aug 2019 A1
20190272825 O'Malley et al. Sep 2019 A1
20190272831 Kajarekar Sep 2019 A1
20190273963 Jobanputra Sep 2019 A1
20190278841 Pusateri et al. Sep 2019 A1
20190287522 Lambourne et al. Sep 2019 A1
20190295544 Garcia et al. Sep 2019 A1
20190303442 Peitz et al. Oct 2019 A1
20190310765 Napolitano et al. Oct 2019 A1
20190318739 Garg et al. Oct 2019 A1
20190339784 Lemay et al. Nov 2019 A1
20190341027 Vescovi et al. Nov 2019 A1
20190341056 Paulik et al. Nov 2019 A1
20190347063 Liu et al. Nov 2019 A1
20190348022 Park et al. Nov 2019 A1
20190354548 Orr et al. Nov 2019 A1
20190355346 Bellegarda Nov 2019 A1
20190361729 Gruber et al. Nov 2019 A1
20190369748 Hindi et al. Dec 2019 A1
20190369842 Dolbakian et al. Dec 2019 A1
20190370292 Irani et al. Dec 2019 A1
20190370323 Davidson et al. Dec 2019 A1
20190371315 Newendorp et al. Dec 2019 A1
20190371316 Weinstein et al. Dec 2019 A1
20190371317 Irani et al. Dec 2019 A1
20190371331 Schramm et al. Dec 2019 A1
20190372902 Piersol Dec 2019 A1
20190373102 Weinstein et al. Dec 2019 A1
20200019609 Yu et al. Jan 2020 A1
20200042334 Radebaugh et al. Feb 2020 A1
20200043482 Gruber et al. Feb 2020 A1
20200043489 Bradley et al. Feb 2020 A1
20200044485 Smith et al. Feb 2020 A1
20200053218 Gray Feb 2020 A1
20200058299 Lee et al. Feb 2020 A1
20200075018 Chen Mar 2020 A1
20200091958 Curtis et al. Mar 2020 A1
20200092625 Raffle Mar 2020 A1
20200098362 Piernot et al. Mar 2020 A1
20200098368 Lemay et al. Mar 2020 A1
20200104357 Bellegarda et al. Apr 2020 A1
20200104362 Yang et al. Apr 2020 A1
20200104369 Bellegarda Apr 2020 A1
20200104668 Sanghavi et al. Apr 2020 A1
20200105260 Piernot et al. Apr 2020 A1
20200118568 Kudurshian et al. Apr 2020 A1
20200125820 Kim et al. Apr 2020 A1
20200127988 Bradley et al. Apr 2020 A1
20200135209 Delfarah et al. Apr 2020 A1
20200137230 Spohrer Apr 2020 A1
20200143812 Walker, II et al. May 2020 A1
20200159579 Shear et al. May 2020 A1
20200160179 Chien et al. May 2020 A1
20200169637 Sanghavi et al. May 2020 A1
20200175566 Bender et al. Jun 2020 A1
20200184964 Myers et al. Jun 2020 A1
20200193997 Piernot et al. Jun 2020 A1
20200221155 Hansen et al. Jul 2020 A1
20200227034 Summa et al. Jul 2020 A1
20200227044 Lindahl Jul 2020 A1
20200249985 Zeitlin Aug 2020 A1
20200252508 Gray Aug 2020 A1
20200267222 Phipps et al. Aug 2020 A1
20200272485 Karashchuk et al. Aug 2020 A1
20200279576 Binder et al. Sep 2020 A1
20200279627 Nida et al. Sep 2020 A1
20200285327 Hindi et al. Sep 2020 A1
20200286472 Newendorp et al. Sep 2020 A1
20200286493 Orr et al. Sep 2020 A1
20200302356 Gruber et al. Sep 2020 A1
20200302919 Greborio et al. Sep 2020 A1
20200302925 Shah et al. Sep 2020 A1
20200302932 Schramm et al. Sep 2020 A1
20200304955 Gross et al. Sep 2020 A1
20200304972 Gross et al. Sep 2020 A1
20200305084 Freeman et al. Sep 2020 A1
20200312317 Kothari et al. Oct 2020 A1
20200314191 Madhavan et al. Oct 2020 A1
20200319850 Stasior et al. Oct 2020 A1
20200327895 Gruber et al. Oct 2020 A1
20200356243 Meyer et al. Nov 2020 A1
20200357391 Ghoshal et al. Nov 2020 A1
20200357406 York et al. Nov 2020 A1
20200357409 Sun et al. Nov 2020 A1
20200364411 Evermann Nov 2020 A1
20200365155 Milden Nov 2020 A1
20200372904 Vescovi et al. Nov 2020 A1
20200374243 Jina et al. Nov 2020 A1
20200379610 Ford et al. Dec 2020 A1
20200379640 Bellegarda et al. Dec 2020 A1
20200379726 Blatz et al. Dec 2020 A1
20200379727 Blatz et al. Dec 2020 A1
20200379728 Gada et al. Dec 2020 A1
20200380389 Eldeeb et al. Dec 2020 A1
20200380956 Rossi et al. Dec 2020 A1
20200380963 Chappidi et al. Dec 2020 A1
20200380966 Acero et al. Dec 2020 A1
20200380973 Novitchenko et al. Dec 2020 A1
20200380980 Shum et al. Dec 2020 A1
20200380985 Gada et al. Dec 2020 A1
20200382616 Vaishampayan et al. Dec 2020 A1
20200382635 Vora et al. Dec 2020 A1
Foreign Referenced Citations (1133)
Number Date Country
2014100581 Sep 2014 AU
2015203483 Jul 2015 AU
2015101171 Oct 2015 AU
2018100187 Mar 2018 AU
2017222436 Oct 2018 AU
2670562 Jan 2010 CA
2694314 Aug 2010 CA
2792412 Jul 2011 CA
2666438 Jun 2013 CA
681573 Apr 1993 CH
1263385 Aug 2000 CN
1274440 Nov 2000 CN
1369858 Sep 2002 CN
1378156 Nov 2002 CN
1383109 Dec 2002 CN
1407795 Apr 2003 CN
1125436 Oct 2003 CN
1471098 Jan 2004 CN
1494695 May 2004 CN
1535519 Oct 2004 CN
1640191 Jul 2005 CN
1673939 Sep 2005 CN
1757027 Apr 2006 CN
1864204 Nov 2006 CN
1898721 Jan 2007 CN
2865153 Jan 2007 CN
1959628 May 2007 CN
1975715 Jun 2007 CN
1995917 Jul 2007 CN
101008942 Aug 2007 CN
101162153 Apr 2008 CN
101179754 May 2008 CN
101183525 May 2008 CN
101188644 May 2008 CN
101228503 Jul 2008 CN
101233741 Jul 2008 CN
101246020 Aug 2008 CN
101271689 Sep 2008 CN
101292282 Oct 2008 CN
101297541 Oct 2008 CN
101427244 May 2009 CN
101499156 Aug 2009 CN
101535983 Sep 2009 CN
101632316 Jan 2010 CN
101636736 Jan 2010 CN
101667424 Mar 2010 CN
101673544 Mar 2010 CN
101751387 Jun 2010 CN
101833286 Sep 2010 CN
101847405 Sep 2010 CN
101855521 Oct 2010 CN
101894547 Nov 2010 CN
101910960 Dec 2010 CN
101923853 Dec 2010 CN
101930789 Dec 2010 CN
101939740 Jan 2011 CN
101951553 Jan 2011 CN
101958958 Jan 2011 CN
101971250 Feb 2011 CN
101992779 Mar 2011 CN
102056026 May 2011 CN
102122506 Jul 2011 CN
102124515 Jul 2011 CN
102137085 Jul 2011 CN
102137193 Jul 2011 CN
102160043 Aug 2011 CN
102201235 Sep 2011 CN
102214187 Oct 2011 CN
102237088 Nov 2011 CN
102246136 Nov 2011 CN
202035047 Nov 2011 CN
102282609 Dec 2011 CN
202092650 Dec 2011 CN
102340590 Feb 2012 CN
102346557 Feb 2012 CN
102368256 Mar 2012 CN
102402985 Apr 2012 CN
102405463 Apr 2012 CN
102498457 Jun 2012 CN
102510426 Jun 2012 CN
102629246 Aug 2012 CN
102651217 Aug 2012 CN
102681896 Sep 2012 CN
102682769 Sep 2012 CN
102682771 Sep 2012 CN
102685295 Sep 2012 CN
102693725 Sep 2012 CN
102694909 Sep 2012 CN
202453859 Sep 2012 CN
102722478 Oct 2012 CN
102737104 Oct 2012 CN
102750087 Oct 2012 CN
102792320 Nov 2012 CN
102801853 Nov 2012 CN
102820033 Dec 2012 CN
102844738 Dec 2012 CN
102866828 Jan 2013 CN
102870065 Jan 2013 CN
102882752 Jan 2013 CN
102917004 Feb 2013 CN
102917271 Feb 2013 CN
102918493 Feb 2013 CN
102955652 Mar 2013 CN
103035240 Apr 2013 CN
103035251 Apr 2013 CN
103038728 Apr 2013 CN
103093334 May 2013 CN
103135916 Jun 2013 CN
103198831 Jul 2013 CN
103209369 Jul 2013 CN
103226949 Jul 2013 CN
103236260 Aug 2013 CN
103246638 Aug 2013 CN
103268315 Aug 2013 CN
103280218 Sep 2013 CN
103292437 Sep 2013 CN
103327063 Sep 2013 CN
103365279 Oct 2013 CN
103366741 Oct 2013 CN
103390016 Nov 2013 CN
103412789 Nov 2013 CN
103426428 Dec 2013 CN
103455234 Dec 2013 CN
103456306 Dec 2013 CN
103533143 Jan 2014 CN
103533154 Jan 2014 CN
103543902 Jan 2014 CN
103562863 Feb 2014 CN
103608859 Feb 2014 CN
103645876 Mar 2014 CN
103716454 Apr 2014 CN
103727948 Apr 2014 CN
103744761 Apr 2014 CN
103760984 Apr 2014 CN
103765385 Apr 2014 CN
103792985 May 2014 CN
103794212 May 2014 CN
103795850 May 2014 CN
103841268 Jun 2014 CN
103902373 Jul 2014 CN
103930945 Jul 2014 CN
103959751 Jul 2014 CN
203721183 Jul 2014 CN
103971680 Aug 2014 CN
104007832 Aug 2014 CN
104038621 Sep 2014 CN
104090652 Oct 2014 CN
104113471 Oct 2014 CN
104125322 Oct 2014 CN
104144377 Nov 2014 CN
104169837 Nov 2014 CN
104180815 Dec 2014 CN
104243699 Dec 2014 CN
104281259 Jan 2015 CN
104284257 Jan 2015 CN
104335207 Feb 2015 CN
104335234 Feb 2015 CN
104374399 Feb 2015 CN
104423625 Mar 2015 CN
104427104 Mar 2015 CN
104463552 Mar 2015 CN
104487929 Apr 2015 CN
104516522 Apr 2015 CN
104573472 Apr 2015 CN
104575501 Apr 2015 CN
104584010 Apr 2015 CN
104604274 May 2015 CN
104679472 Jun 2015 CN
104769584 Jul 2015 CN
104854583 Aug 2015 CN
104869342 Aug 2015 CN
104951077 Sep 2015 CN
104967748 Oct 2015 CN
104969289 Oct 2015 CN
104978963 Oct 2015 CN
105025051 Nov 2015 CN
105027197 Nov 2015 CN
105093526 Nov 2015 CN
105100356 Nov 2015 CN
105190607 Dec 2015 CN
105247511 Jan 2016 CN
105264524 Jan 2016 CN
105278681 Jan 2016 CN
105320251 Feb 2016 CN
105320726 Feb 2016 CN
105379234 Mar 2016 CN
105430186 Mar 2016 CN
105471705 Apr 2016 CN
105472587 Apr 2016 CN
105556592 May 2016 CN
105808200 Jul 2016 CN
105830048 Aug 2016 CN
105869641 Aug 2016 CN
106030699 Oct 2016 CN
106062734 Oct 2016 CN
106415412 Feb 2017 CN
106462383 Feb 2017 CN
106463114 Feb 2017 CN
106465074 Feb 2017 CN
106534469 Mar 2017 CN
106776581 May 2017 CN
107450800 Dec 2017 CN
107480161 Dec 2017 CN
107491468 Dec 2017 CN
107545262 Jan 2018 CN
107608998 Jan 2018 CN
107615378 Jan 2018 CN
107871500 Apr 2018 CN
107919123 Apr 2018 CN
107924313 Apr 2018 CN
107978313 May 2018 CN
108647681 Oct 2018 CN
109447234 Mar 2019 CN
109657629 Apr 2019 CN
110135411 Aug 2019 CN
110531860 Dec 2019 CN
110598671 Dec 2019 CN
110647274 Jan 2020 CN
110825469 Feb 2020 CN
3837590 May 1990 DE
4126902 Feb 1992 DE
4334773 Apr 1994 DE
4445023 Jun 1996 DE
102004029203 Dec 2005 DE
19841541 Dec 2007 DE
102008024258 Nov 2009 DE
202016008226 May 2017 DE
30390 Jun 1981 EP
57514 Aug 1982 EP
59880 Sep 1982 EP
138061 Apr 1985 EP
140777 May 1985 EP
218859 Apr 1987 EP
262938 Apr 1988 EP
138061 Jun 1988 EP
283995 Sep 1988 EP
293259 Nov 1988 EP
299572 Jan 1989 EP
313975 May 1989 EP
314908 May 1989 EP
327408 Aug 1989 EP
389271 Sep 1990 EP
411675 Feb 1991 EP
441089 Aug 1991 EP
464712 Jan 1992 EP
476972 Mar 1992 EP
534410 Mar 1993 EP
558312 Sep 1993 EP
559349 Sep 1993 EP
570660 Nov 1993 EP
575146 Dec 1993 EP
578604 Jan 1994 EP
586996 Mar 1994 EP
609030 Aug 1994 EP
651543 May 1995 EP
679005 Oct 1995 EP
795811 Sep 1997 EP
476972 May 1998 EP
845894 Jun 1998 EP
852052 Jul 1998 EP
863453 Sep 1998 EP
863469 Sep 1998 EP
867860 Sep 1998 EP
869697 Oct 1998 EP
559349 Jan 1999 EP
889626 Jan 1999 EP
917077 May 1999 EP
691023 Sep 1999 EP
946032 Sep 1999 EP
981236 Feb 2000 EP
982732 Mar 2000 EP
984430 Mar 2000 EP
1001588 May 2000 EP
1014277 Jun 2000 EP
1028425 Aug 2000 EP
1028426 Aug 2000 EP
1047251 Oct 2000 EP
1052566 Nov 2000 EP
1076302 Feb 2001 EP
1091615 Apr 2001 EP
1094406 Apr 2001 EP
1107229 Jun 2001 EP
1229496 Aug 2002 EP
1233600 Aug 2002 EP
1245023 Oct 2002 EP
1246075 Oct 2002 EP
1280326 Jan 2003 EP
1291848 Mar 2003 EP
1311102 May 2003 EP
1315084 May 2003 EP
1315086 May 2003 EP
1345360 Sep 2003 EP
1347361 Sep 2003 EP
1368961 Dec 2003 EP
1379061 Jan 2004 EP
1432219 Jun 2004 EP
1435620 Jul 2004 EP
1480421 Nov 2004 EP
1517228 Mar 2005 EP
1536612 Jun 2005 EP
1566948 Aug 2005 EP
1588353 Oct 2005 EP
1650938 Apr 2006 EP
1675025 Jun 2006 EP
1693829 Aug 2006 EP
1699042 Sep 2006 EP
1739546 Jan 2007 EP
1181802 Feb 2007 EP
1818786 Aug 2007 EP
1892700 Feb 2008 EP
1912205 Apr 2008 EP
1939860 Jul 2008 EP
651543 Sep 2008 EP
1909263 Jan 2009 EP
1335620 Mar 2009 EP
2069895 Jun 2009 EP
2094032 Aug 2009 EP
2096840 Sep 2009 EP
2107553 Oct 2009 EP
2109295 Oct 2009 EP
2144226 Jan 2010 EP
2168399 Mar 2010 EP
1720375 Jul 2010 EP
2205010 Jul 2010 EP
2250640 Nov 2010 EP
2309491 Apr 2011 EP
2329348 Jun 2011 EP
2339576 Jun 2011 EP
2355093 Aug 2011 EP
2393056 Dec 2011 EP
2400373 Dec 2011 EP
2431842 Mar 2012 EP
2523109 Nov 2012 EP
2523188 Nov 2012 EP
2551784 Jan 2013 EP
2555536 Feb 2013 EP
2575128 Apr 2013 EP
2632129 Aug 2013 EP
2639792 Sep 2013 EP
2669889 Dec 2013 EP
2672229 Dec 2013 EP
2672231 Dec 2013 EP
2675147 Dec 2013 EP
2680257 Jan 2014 EP
2683147 Jan 2014 EP
2683175 Jan 2014 EP
2717259 Apr 2014 EP
2725577 Apr 2014 EP
2733598 May 2014 EP
2733896 May 2014 EP
2743846 Jun 2014 EP
2760015 Jul 2014 EP
2781883 Sep 2014 EP
2801890 Nov 2014 EP
2801972 Nov 2014 EP
2801974 Nov 2014 EP
2824564 Jan 2015 EP
2849177 Mar 2015 EP
2879402 Jun 2015 EP
2881939 Jun 2015 EP
2891049 Jul 2015 EP
2930715 Oct 2015 EP
2938022 Oct 2015 EP
2940556 Nov 2015 EP
2947859 Nov 2015 EP
2950307 Dec 2015 EP
2957986 Dec 2015 EP
2985984 Feb 2016 EP
2891049 Mar 2016 EP
3032532 Jun 2016 EP
3035329 Jun 2016 EP
3038333 Jun 2016 EP
3115905 Jan 2017 EP
3125097 Feb 2017 EP
3224708 Oct 2017 EP
3246916 Nov 2017 EP
3300074 Mar 2018 EP
2983065 Aug 2018 EP
3392876 Oct 2018 EP
3401773 Nov 2018 EP
2973002 Jun 2019 EP
3506151 Jul 2019 EP
3323058 Feb 2020 EP
2911201 Jul 2008 FR
2293667 Apr 1996 GB
2310559 Aug 1997 GB
2323694 Sep 1998 GB
2342802 Apr 2000 GB
2343285 May 2000 GB
2346500 Aug 2000 GB
2352377 Jan 2001 GB
2367399 Apr 2002 GB
2384399 Jul 2003 GB
2402855 Dec 2004 GB
2445436 Jul 2008 GB
2445667 Jul 2008 GB
2470585 Dec 2010 GB
FI20010199 Apr 2003 IT
55-80084 Jun 1980 JP
57-41731 Mar 1982 JP
59-57336 Apr 1984 JP
62-153326 Jul 1987 JP
01-010317 Jan 1989 JP
1-500631 Mar 1989 JP
1-254742 Oct 1989 JP
2-86397 Mar 1990 JP
2-153415 Jun 1990 JP
2-502149 Jul 1990 JP
3-113578 May 1991 JP
4-236624 Aug 1992 JP
5-79951 Mar 1993 JP
5-165459 Jul 1993 JP
5-204859 Aug 1993 JP
5-293126 Nov 1993 JP
6-19965 Jan 1994 JP
6-69954 Mar 1994 JP
6-208389 Jul 1994 JP
6-274586 Sep 1994 JP
6-332493 Dec 1994 JP
6-332617 Dec 1994 JP
7-199379 Aug 1995 JP
7-219961 Aug 1995 JP
7-320051 Dec 1995 JP
7-320079 Dec 1995 JP
8-63330 Mar 1996 JP
8-185265 Jul 1996 JP
8-223281 Aug 1996 JP
8-227341 Sep 1996 JP
9-18585 Jan 1997 JP
9-27000 Jan 1997 JP
9-55792 Feb 1997 JP
9-62293 Mar 1997 JP
9-116616 May 1997 JP
9-259063 Oct 1997 JP
9-265457 Oct 1997 JP
10-31497 Feb 1998 JP
10-69578 Mar 1998 JP
10-78952 Mar 1998 JP
10-105324 Apr 1998 JP
10-274997 Oct 1998 JP
10-312194 Nov 1998 JP
10-320169 Dec 1998 JP
11-06743 Jan 1999 JP
11-45241 Feb 1999 JP
11-136278 May 1999 JP
11-175553 Jul 1999 JP
11-231886 Aug 1999 JP
11-265400 Sep 1999 JP
2000-32140 Jan 2000 JP
2000-59497 Feb 2000 JP
2000-90119 Mar 2000 JP
2000-99225 Apr 2000 JP
2000-134407 May 2000 JP
2000-163031 Jun 2000 JP
2000-207167 Jul 2000 JP
2000-216910 Aug 2000 JP
2000-224663 Aug 2000 JP
2000-272349 Oct 2000 JP
2000-276471 Oct 2000 JP
2000-331004 Nov 2000 JP
2000-339137 Dec 2000 JP
2000-352988 Dec 2000 JP
2000-352989 Dec 2000 JP
2001-13978 Jan 2001 JP
2001-14319 Jan 2001 JP
2001-22498 Jan 2001 JP
2001-34289 Feb 2001 JP
2001-34290 Feb 2001 JP
2001-56233 Feb 2001 JP
2001-75775 Mar 2001 JP
2001-109493 Apr 2001 JP
2001-125896 May 2001 JP
2001-148899 May 2001 JP
2001-273283 Oct 2001 JP
2001-282813 Oct 2001 JP
2001-296880 Oct 2001 JP
2001-297174 Oct 2001 JP
2002-14954 Jan 2002 JP
2002-24212 Jan 2002 JP
2002-30676 Jan 2002 JP
2002-41276 Feb 2002 JP
2002-41624 Feb 2002 JP
2002-82748 Mar 2002 JP
2002-82893 Mar 2002 JP
2002-123295 Apr 2002 JP
2002-132804 May 2002 JP
2002-169588 Jun 2002 JP
2002-182679 Jun 2002 JP
2002-182680 Jun 2002 JP
2002-230021 Aug 2002 JP
2002-236029 Aug 2002 JP
2002-524806 Aug 2002 JP
2002-525690 Aug 2002 JP
2002-281562 Sep 2002 JP
2002-287793 Oct 2002 JP
2002-534716 Oct 2002 JP
2002-341892 Nov 2002 JP
2002-342033 Nov 2002 JP
2002-342212 Nov 2002 JP
2002-344880 Nov 2002 JP
2002-542501 Dec 2002 JP
2003-15682 Jan 2003 JP
2003-44091 Feb 2003 JP
2003-84877 Mar 2003 JP
2003-517158 May 2003 JP
2003-194547 Jul 2003 JP
2003-202897 Jul 2003 JP
2003-233568 Aug 2003 JP
2003-244317 Aug 2003 JP
2003-255991 Sep 2003 JP
2003-527656 Sep 2003 JP
2003-288356 Oct 2003 JP
2003-308079 Oct 2003 JP
2003-533909 Nov 2003 JP
2004-48804 Feb 2004 JP
2004-54080 Feb 2004 JP
2004-56226 Feb 2004 JP
2004-505322 Feb 2004 JP
2004-505525 Feb 2004 JP
2004-70504 Mar 2004 JP
2004-86356 Mar 2004 JP
2004-94936 Mar 2004 JP
2004-117905 Apr 2004 JP
2004-152063 May 2004 JP
2004-523004 Jul 2004 JP
2004-295837 Oct 2004 JP
2004-310034 Nov 2004 JP
2004-333870 Nov 2004 JP
2004-534268 Nov 2004 JP
2004-347786 Dec 2004 JP
2004-355003 Dec 2004 JP
2005-55782 Mar 2005 JP
2005-63257 Mar 2005 JP
2005-70645 Mar 2005 JP
2005-80094 Mar 2005 JP
2005-86624 Mar 2005 JP
2005-506602 Mar 2005 JP
2005-92441 Apr 2005 JP
2005-149481 Jun 2005 JP
2005-181386 Jul 2005 JP
2005-189454 Jul 2005 JP
2005-210362 Aug 2005 JP
2005-221678 Aug 2005 JP
2005-283843 Oct 2005 JP
2005-311864 Nov 2005 JP
2005-332212 Dec 2005 JP
2005-334363 Dec 2005 JP
2006-4274 Jan 2006 JP
2006-23860 Jan 2006 JP
2006-30447 Feb 2006 JP
2006-31092 Feb 2006 JP
2006-59094 Mar 2006 JP
2006-79427 Mar 2006 JP
2006-80617 Mar 2006 JP
2006-107438 Apr 2006 JP
2006-146008 Jun 2006 JP
2006-146182 Jun 2006 JP
2006-155368 Jun 2006 JP
2006-189394 Jul 2006 JP
2006-195637 Jul 2006 JP
2006-201870 Aug 2006 JP
2006-208696 Aug 2006 JP
2006-237735 Sep 2006 JP
2006-244296 Sep 2006 JP
2006-267328 Oct 2006 JP
2006-302091 Nov 2006 JP
2006-318373 Nov 2006 JP
2006-526185 Nov 2006 JP
2007-4633 Jan 2007 JP
2007-17990 Jan 2007 JP
2007-500903 Jan 2007 JP
2007-53796 Mar 2007 JP
2007-79690 Mar 2007 JP
2007-171534 Jul 2007 JP
2007-193794 Aug 2007 JP
2007-206317 Aug 2007 JP
2007-264471 Oct 2007 JP
2007-264792 Oct 2007 JP
2007-264892 Oct 2007 JP
2007-280179 Oct 2007 JP
2007-299352 Nov 2007 JP
2007-323612 Dec 2007 JP
2007-325089 Dec 2007 JP
2008-21002 Jan 2008 JP
2008-26381 Feb 2008 JP
2008-39928 Feb 2008 JP
2008-58813 Mar 2008 JP
2008-64687 Mar 2008 JP
2008-64885 Mar 2008 JP
2008-90545 Apr 2008 JP
2008-97003 Apr 2008 JP
2008-514983 May 2008 JP
2008-134949 Jun 2008 JP
2008-526101 Jul 2008 JP
2008-185693 Aug 2008 JP
2008-198022 Aug 2008 JP
2008-217468 Sep 2008 JP
2008-228129 Sep 2008 JP
2008-233678 Oct 2008 JP
2008-236448 Oct 2008 JP
2008-252161 Oct 2008 JP
2008-268684 Nov 2008 JP
2008-269480 Nov 2008 JP
2008-271481 Nov 2008 JP
2008-287697 Nov 2008 JP
2008-299221 Dec 2008 JP
2009-503623 Jan 2009 JP
2009-36999 Feb 2009 JP
2009-505142 Feb 2009 JP
2009-47920 Mar 2009 JP
2009-69062 Apr 2009 JP
2009-98490 May 2009 JP
2009-140444 Jun 2009 JP
2009-522861 Jun 2009 JP
2009-157951 Jul 2009 JP
2009-186989 Aug 2009 JP
2009-193448 Aug 2009 JP
2009-193457 Aug 2009 JP
2009-193532 Aug 2009 JP
2009-205367 Sep 2009 JP
2009-217611 Sep 2009 JP
2009-294913 Dec 2009 JP
2009-294946 Dec 2009 JP
2010-66519 Mar 2010 JP
2010-78602 Apr 2010 JP
2010-78979 Apr 2010 JP
2010-108378 May 2010 JP
2010-109789 May 2010 JP
2010-518475 May 2010 JP
2010-518526 May 2010 JP
2010-122928 Jun 2010 JP
2010-135976 Jun 2010 JP
2010-146347 Jul 2010 JP
2010-157207 Jul 2010 JP
2010-166478 Jul 2010 JP
2010-205111 Sep 2010 JP
2010-224236 Oct 2010 JP
2010-236858 Oct 2010 JP
4563106 Oct 2010 JP
2010-256392 Nov 2010 JP
2010-535377 Nov 2010 JP
2010-287063 Dec 2010 JP
2011-33874 Feb 2011 JP
2011-41026 Feb 2011 JP
2011-45005 Mar 2011 JP
2011-59659 Mar 2011 JP
2011-81541 Apr 2011 JP
2011-525045 Sep 2011 JP
2011-237621 Nov 2011 JP
2011-238022 Nov 2011 JP
2011-250027 Dec 2011 JP
2012-14394 Jan 2012 JP
2012-502377 Jan 2012 JP
2012-22478 Feb 2012 JP
2012-33997 Feb 2012 JP
2012-37619 Feb 2012 JP
2012-63536 Mar 2012 JP
2012-508530 Apr 2012 JP
2012-89020 May 2012 JP
2012-116442 Jun 2012 JP
2012-142744 Jul 2012 JP
2012-147063 Aug 2012 JP
2012-150804 Aug 2012 JP
2012-518847 Aug 2012 JP
2012-211932 Nov 2012 JP
2013-37688 Feb 2013 JP
2013-46171 Mar 2013 JP
2013-511214 Mar 2013 JP
2013-65284 Apr 2013 JP
2013-73240 Apr 2013 JP
2013-513315 Apr 2013 JP
2013-80476 May 2013 JP
2013-517566 May 2013 JP
2013-134430 Jul 2013 JP
2013-134729 Jul 2013 JP
2013-140520 Jul 2013 JP
2013-527947 Jul 2013 JP
2013-528012 Jul 2013 JP
2013-148419 Aug 2013 JP
2013-156349 Aug 2013 JP
2013-200423 Oct 2013 JP
2013-205999 Oct 2013 JP
2013-238936 Nov 2013 JP
2013-258600 Dec 2013 JP
2014-2586 Jan 2014 JP
2014-10688 Jan 2014 JP
20145-2445 Jan 2014 JP
2014-26629 Feb 2014 JP
2014-45449 Mar 2014 JP
2014-507903 Mar 2014 JP
2014-60600 Apr 2014 JP
2014-72586 Apr 2014 JP
2014-77969 May 2014 JP
2014-89711 May 2014 JP
2014-109889 Jun 2014 JP
2014-124332 Jul 2014 JP
2014-126600 Jul 2014 JP
2014-140121 Jul 2014 JP
2014-518409 Jul 2014 JP
2014-142566 Aug 2014 JP
2014-145842 Aug 2014 JP
2014-146940 Aug 2014 JP
2014-150323 Aug 2014 JP
2014-519648 Aug 2014 JP
2014-191272 Oct 2014 JP
2014-219614 Nov 2014 JP
2014-222514 Nov 2014 JP
2015-4928 Jan 2015 JP
2015-8001 Jan 2015 JP
2015-12301 Jan 2015 JP
2015-18365 Jan 2015 JP
2015-501022 Jan 2015 JP
2015-504619 Feb 2015 JP
2015-41845 Mar 2015 JP
2015-52500 Mar 2015 JP
2015-60423 Mar 2015 JP
2015-81971 Apr 2015 JP
2015-83938 Apr 2015 JP
2015-94848 May 2015 JP
2015-514254 May 2015 JP
2015-519675 Jul 2015 JP
2015-524974 Aug 2015 JP
2015-526776 Sep 2015 JP
2015-527683 Sep 2015 JP
2015-528140 Sep 2015 JP
2015-528918 Oct 2015 JP
2015-531909 Nov 2015 JP
2016-504651 Feb 2016 JP
2016-508007 Mar 2016 JP
2016-71247 May 2016 JP
2016-119615 Jun 2016 JP
2016-151928 Aug 2016 JP
2016-524193 Aug 2016 JP
2016-536648 Nov 2016 JP
2017-19331 Jan 2017 JP
2017-516153 Jun 2017 JP
2017-537361 Dec 2017 JP
6291147 Feb 2018 JP
2018-525950 Sep 2018 JP
10-1999-0073234 Oct 1999 KR
2001-0093654 Oct 2001 KR
10-2001-0102132 Nov 2001 KR
2002-0004931 Jan 2002 KR
2002-0013984 Feb 2002 KR
2002-0057262 Jul 2002 KR
2002-0064149 Aug 2002 KR
2002-0069952 Sep 2002 KR
2003-0016993 Mar 2003 KR
10-2004-0014835 Feb 2004 KR
10-2004-0044632 May 2004 KR
10-2005-0083561 Aug 2005 KR
10-2005-0090568 Sep 2005 KR
10-2006-0011603 Feb 2006 KR
10-2006-0012730 Feb 2006 KR
10-2006-0055313 May 2006 KR
10-2006-0073574 Jun 2006 KR
10-2006-0091469 Aug 2006 KR
10-2007-0022393 Feb 2007 KR
10-2007-0024262 Mar 2007 KR
10-2007-0071675 Jul 2007 KR
10-2007-0094767 Sep 2007 KR
10-0757496 Sep 2007 KR
10-2007-0100837 Oct 2007 KR
10-0776800 Nov 2007 KR
10-0801227 Feb 2008 KR
10-0810500 Mar 2008 KR
10-2008-0033070 Apr 2008 KR
10-0819928 Apr 2008 KR
10-2008-0049647 Jun 2008 KR
10-2008-0059332 Jun 2008 KR
10-2008-0109322 Dec 2008 KR
10-2009-0001716 Jan 2009 KR
10-2009-0028464 Mar 2009 KR
10-2009-0030117 Mar 2009 KR
10-2009-0086805 Aug 2009 KR
10-0920267 Oct 2009 KR
10-2009-0122944 Dec 2009 KR
10-2009-0127961 Dec 2009 KR
10-2009-0129192 Dec 2009 KR
10-2010-0015958 Feb 2010 KR
10-2010-0048571 May 2010 KR
10-2010-0053149 May 2010 KR
10-2010-0119519 Nov 2010 KR
10-2011-0005937 Jan 2011 KR
10-2011-0013625 Feb 2011 KR
10-2011-0043644 Apr 2011 KR
10-1032792 May 2011 KR
10-2011-0068490 Jun 2011 KR
10-2011-0072847 Jun 2011 KR
10-2011-0086492 Jul 2011 KR
10-2011-0100620 Sep 2011 KR
10-2011-0113414 Oct 2011 KR
10-2011-0115134 Oct 2011 KR
10-2012-0020164 Mar 2012 KR
10-2012-0031722 Apr 2012 KR
10-2012-0066523 Jun 2012 KR
10-2012-0082371 Jul 2012 KR
10-2012-0084472 Jul 2012 KR
10-1178310 Aug 2012 KR
10-2012-0120316 Nov 2012 KR
10-2012-0137424 Dec 2012 KR
10-2012-0137435 Dec 2012 KR
10-2012-0137440 Dec 2012 KR
10-2012-0138826 Dec 2012 KR
10-2012-0139827 Dec 2012 KR
10-1193668 Dec 2012 KR
10-2013-0035983 Apr 2013 KR
10-2013-0090947 Aug 2013 KR
10-2013-0108563 Oct 2013 KR
10-1334342 Nov 2013 KR
10-2013-0131252 Dec 2013 KR
10-2013-0133629 Dec 2013 KR
10-2014-0024271 Feb 2014 KR
10-2014-0031283 Mar 2014 KR
10-2014-0033574 Mar 2014 KR
10-2014-0042994 Apr 2014 KR
10-2014-0055204 May 2014 KR
10-2014-0068752 Jun 2014 KR
10-2014-0088449 Jul 2014 KR
10-2014-0106715 Sep 2014 KR
10-2014-0147557 Dec 2014 KR
10-2015-0013631 Feb 2015 KR
10-1506510 Mar 2015 KR
10-2015-0038375 Apr 2015 KR
10-2015-0039380 Apr 2015 KR
10-2015-0041974 Apr 2015 KR
10-2015-0043512 Apr 2015 KR
10-2015-0095624 Aug 2015 KR
10-1555742 Sep 2015 KR
10-2015-0113127 Oct 2015 KR
10-2015-0138109 Dec 2015 KR
10-2016-0004351 Jan 2016 KR
10-2016-0010523 Jan 2016 KR
10-2016-0040279 Apr 2016 KR
10-2016-0055839 May 2016 KR
10-2016-0065503 Jun 2016 KR
10-2016-0101198 Aug 2016 KR
10-2016-0105847 Sep 2016 KR
10-2016-0121585 Oct 2016 KR
10-2016-0140694 Dec 2016 KR
10-2017-0036805 Apr 2017 KR
10-2017-0107058 Sep 2017 KR
10-1776673 Sep 2017 KR
10-2018-0032632 Mar 2018 KR
10-2018-0034637 Apr 2018 KR
1014847 Oct 2001 NL
2273106 Mar 2006 RU
2349970 Mar 2009 RU
2353068 Apr 2009 RU
2364917 Aug 2009 RU
468323 Dec 2001 TW
200601264 Jan 2006 TW
200638337 Nov 2006 TW
200643744 Dec 2006 TW
200801988 Jan 2008 TW
I301373 Sep 2008 TW
M348993 Jan 2009 TW
200943903 Oct 2009 TW
201018258 May 2010 TW
201027515 Jul 2010 TW
201028996 Aug 2010 TW
201110108 Mar 2011 TW
201142823 Dec 2011 TW
201227715 Jul 2012 TW
201245989 Nov 2012 TW
201312548 Mar 2013 TW
1989003139 Apr 1989 WO
1993020640 Oct 1993 WO
1994016434 Jul 1994 WO
1994029788 Dec 1994 WO
1995002221 Jan 1995 WO
1995016950 Jun 1995 WO
1995017746 Jun 1995 WO
1996003741 Feb 1996 WO
1997010586 Mar 1997 WO
1997026612 Jul 1997 WO
1997029614 Aug 1997 WO
1997038488 Oct 1997 WO
1997049044 Dec 1997 WO
1998009270 Mar 1998 WO
1998033111 Jul 1998 WO
1998041956 Sep 1998 WO
1999001834 Jan 1999 WO
1999008238 Feb 1999 WO
1999016181 Apr 1999 WO
1999056227 Nov 1999 WO
2000014727 Mar 2000 WO
2000014728 Mar 2000 WO
2000019697 Apr 2000 WO
2000022820 Apr 2000 WO
2000029964 May 2000 WO
2000030070 May 2000 WO
2000038041 Jun 2000 WO
2000041065 Jul 2000 WO
2000044173 Jul 2000 WO
2000060435 Oct 2000 WO
2000060435 Oct 2000 WO
2000063766 Oct 2000 WO
2000068936 Nov 2000 WO
2001006489 Jan 2001 WO
2001030046 Apr 2001 WO
2001030047 Apr 2001 WO
2001033569 May 2001 WO
2001035391 May 2001 WO
2001044912 Jun 2001 WO
2001046946 Jun 2001 WO
2001065413 Sep 2001 WO
2001067753 Sep 2001 WO
2001071480 Sep 2001 WO
2002010900 Feb 2002 WO
2002025610 Mar 2002 WO
2002031814 Apr 2002 WO
2002037469 May 2002 WO
2002049253 Jun 2002 WO
2002071259 Sep 2002 WO
2002073603 Sep 2002 WO
2003003152 Jan 2003 WO
2003003765 Jan 2003 WO
2003023786 Mar 2003 WO
2003036457 May 2003 WO
2003041364 May 2003 WO
2003049494 Jun 2003 WO
2003056789 Jul 2003 WO
2003067202 Aug 2003 WO
2003084196 Oct 2003 WO
2003094489 Nov 2003 WO
2003105125 Dec 2003 WO
2003107179 Dec 2003 WO
2004008801 Jan 2004 WO
2004025938 Mar 2004 WO
2004047415 Jun 2004 WO
2004055637 Jul 2004 WO
2004057486 Jul 2004 WO
2004061850 Jul 2004 WO
2004064299 Jul 2004 WO
2004072846 Aug 2004 WO
2004084413 Sep 2004 WO
2005003920 Jan 2005 WO
2005008505 Jan 2005 WO
2005008899 Jan 2005 WO
2005010725 Feb 2005 WO
2005027472 Mar 2005 WO
2005027485 Mar 2005 WO
2005031737 Apr 2005 WO
2005034082 Apr 2005 WO
2005034085 Apr 2005 WO
2005041455 May 2005 WO
2005059895 Jun 2005 WO
2005064592 Jul 2005 WO
2005069171 Jul 2005 WO
2005101176 Oct 2005 WO
2006020305 Feb 2006 WO
2006037545 Apr 2006 WO
2006054724 May 2006 WO
2006056822 Jun 2006 WO
2006078246 Jul 2006 WO
2006084144 Aug 2006 WO
2006101649 Sep 2006 WO
2006129967 Dec 2006 WO
2006133571 Dec 2006 WO
2007002753 Jan 2007 WO
2007013521 Feb 2007 WO
2007036762 Apr 2007 WO
2007055766 May 2007 WO
2007080559 Jul 2007 WO
2007083894 Jul 2007 WO
2007125151 Nov 2007 WO
2008030970 Mar 2008 WO
2008071231 Jun 2008 WO
2008085742 Jul 2008 WO
2008098900 Aug 2008 WO
2008109835 Aug 2008 WO
2008120036 Oct 2008 WO
2008130095 Oct 2008 WO
2008140236 Nov 2008 WO
2008142472 Nov 2008 WO
2008153639 Dec 2008 WO
2009009240 Jan 2009 WO
2009016631 Feb 2009 WO
2009017280 Feb 2009 WO
2009075912 Jun 2009 WO
2009104126 Aug 2009 WO
2009156438 Dec 2009 WO
2009156978 Dec 2009 WO
2010013369 Feb 2010 WO
2010054373 May 2010 WO
2010075623 Jul 2010 WO
2010100937 Sep 2010 WO
2010141802 Dec 2010 WO
2010144651 Dec 2010 WO
2011028842 Mar 2011 WO
2011057346 May 2011 WO
2011060106 May 2011 WO
2011082521 Jul 2011 WO
2011088053 Jul 2011 WO
2011093025 Aug 2011 WO
2011100142 Aug 2011 WO
2011116309 Sep 2011 WO
2011123122 Oct 2011 WO
2011133543 Oct 2011 WO
2011133573 Oct 2011 WO
2011097309 Dec 2011 WO
2011150730 Dec 2011 WO
2011163350 Dec 2011 WO
2011088053 Jan 2012 WO
2012008434 Jan 2012 WO
2012019020 Feb 2012 WO
2012019637 Feb 2012 WO
2012063260 May 2012 WO
2012092562 Jul 2012 WO
2012112331 Aug 2012 WO
2012129231 Sep 2012 WO
2012063260 Oct 2012 WO
2012135157 Oct 2012 WO
2012154317 Nov 2012 WO
2012154748 Nov 2012 WO
2012155079 Nov 2012 WO
2012167168 Dec 2012 WO
2012173902 Dec 2012 WO
2013009578 Jan 2013 WO
2013022135 Feb 2013 WO
2013022223 Feb 2013 WO
2013048880 Apr 2013 WO
2013049358 Apr 2013 WO
2013057153 Apr 2013 WO
2013122310 Aug 2013 WO
2013137660 Sep 2013 WO
2013163113 Oct 2013 WO
2013163857 Nov 2013 WO
2013169842 Nov 2013 WO
2013173504 Nov 2013 WO
2013173511 Nov 2013 WO
2013176847 Nov 2013 WO
2013184953 Dec 2013 WO
2013184990 Dec 2013 WO
2014003138 Jan 2014 WO
2014004544 Jan 2014 WO
2014021967 Feb 2014 WO
2014022148 Feb 2014 WO
2014028735 Feb 2014 WO
2014028797 Feb 2014 WO
2014031505 Feb 2014 WO
2014032461 Mar 2014 WO
2014047047 Mar 2014 WO
2014066352 May 2014 WO
2014070872 May 2014 WO
2014078965 May 2014 WO
2014093339 Jun 2014 WO
2014096506 Jun 2014 WO
2014124332 Aug 2014 WO
2014137074 Sep 2014 WO
2014138604 Sep 2014 WO
2014143959 Sep 2014 WO
2014144395 Sep 2014 WO
2014144579 Sep 2014 WO
2014144949 Sep 2014 WO
2014151153 Sep 2014 WO
2014124332 Oct 2014 WO
2014159578 Oct 2014 WO
2014159581 Oct 2014 WO
2014162570 Oct 2014 WO
2014169269 Oct 2014 WO
2014173189 Oct 2014 WO
2013173504 Dec 2014 WO
2014197336 Dec 2014 WO
2014197635 Dec 2014 WO
2014197730 Dec 2014 WO
2014200728 Dec 2014 WO
2014204659 Dec 2014 WO
2014210392 Dec 2014 WO
2015018440 Feb 2015 WO
2015020942 Feb 2015 WO
2015029379 Mar 2015 WO
2015030796 Mar 2015 WO
2015041882 Mar 2015 WO
2015041892 Mar 2015 WO
2015047932 Apr 2015 WO
2015053485 Apr 2015 WO
2015084659 Jun 2015 WO
2015092943 Jun 2015 WO
2015094169 Jun 2015 WO
2015094369 Jun 2015 WO
2015098306 Jul 2015 WO
2015099939 Jul 2015 WO
2015116151 Aug 2015 WO
2015151133 Oct 2015 WO
2015153310 Oct 2015 WO
2015157013 Oct 2015 WO
2015183401 Dec 2015 WO
2015183699 Dec 2015 WO
2015184186 Dec 2015 WO
2015184387 Dec 2015 WO
2015200207 Dec 2015 WO
2016027933 Feb 2016 WO
2016028946 Feb 2016 WO
2016033257 Mar 2016 WO
2016039992 Mar 2016 WO
2016052164 Apr 2016 WO
2016054230 Apr 2016 WO
2016057268 Apr 2016 WO
2016075081 May 2016 WO
2016085775 Jun 2016 WO
2016085776 Jun 2016 WO
2016100139 Jun 2016 WO
2016111881 Jul 2016 WO
2016144840 Sep 2016 WO
2016144982 Sep 2016 WO
2016144983 Sep 2016 WO
2016175354 Nov 2016 WO
2016187149 Nov 2016 WO
2016190950 Dec 2016 WO
2016209444 Dec 2016 WO
2016209924 Dec 2016 WO
2017044160 Mar 2017 WO
2017044257 Mar 2017 WO
2017044260 Mar 2017 WO
2017044629 Mar 2017 WO
2017053311 Mar 2017 WO
2017058293 Apr 2017 WO
2017059388 Apr 2017 WO
2017071420 May 2017 WO
2017142116 Aug 2017 WO
2017160487 Sep 2017 WO
2017213682 Dec 2017 WO
2018009397 Jan 2018 WO
2018213401 Nov 2018 WO
2018213415 Nov 2018 WO
2019067930 Apr 2019 WO
2019078576 Apr 2019 WO
2019079017 Apr 2019 WO
2019147429 Aug 2019 WO
2019236217 Dec 2019 WO
2020010530 Jan 2020 WO
Non-Patent Literature Citations (1685)
Entry
Decision to Refuse received for European Patent Application No. 11707939.2, dated Dec. 16, 2020, 31 pages.
Minutes of the Oral Proceedings received for European Patent Application No. 11707939.2, mailed on Dec. 15, 2020, 9 pages.
Result of Consultation received for European Patent Application No. 11707939.2, dated Aug. 19, 2020, 4 pages.
Office Action received for Brazilian Patent Application No. BR122012028965-5, dated May 27, 2020, 6 pages (1 page of English Translation and 5 pages of Official Copy).
Office Action received for Brazilian Patent Application No. BR122012028966-3, dated May 27, 2020, 6 pages (1 page of English Translation and 5 pages of Official Copy).
Office Action received for Brazilian Patent Application No. BR122012028968-0, dated May 27, 2020, 6 pages (1 page of English Translation and 5 pages of Official Copy).
Office Action received for Brazilian Patent Application No. BR122012028969-8, dated May 27, 2020, 6 pages (1 page of English Translation and 5 pages of Official Copy).
Office Action received for Brazilian Patent Application No. BR122012028970-1, dated May 27, 2020, 6 pages (1 page of English Translation and 5 pages of Official Copy).
Office Action received for Brazilian Patent Application No. BR122012028971-0, dated May 27, 2020, 6 pages (1 page of English Translation and 5 pages of Official Copy).
Office Action received for Brazilian Patent Application No. BR122012028973-6, dated May 27, 2020, 6 pages (1 page of English Translation and 5 pages of Official Copy).
Office Action received for Brazilian Patent Application No. BR122012028974-4, dated May 27, 2020, 6 pages (1 page of English Translation and 5 pages of Official Copy).
Notice of Allowance received for Brazilian Patent Application No. 112012017826-1, dated Oct. 20, 2020, 2 pages (1 page of English Translation and 1 page of Official Copy).
Notice of Allowance received for Brazilian Patent Application No. BR122012028969-8, dated Oct. 20, 2020, 3 pages (1 page of English Translation and 2 pages of Official Copy).
Notice of Acceptance received for Australian Patent Application No. 2019283968, dated Jan. 25, 2021, 3 pages.
Notice of Allowance received for Brazilian Patent Application No. BR122012028968-0, dated Jan. 19, 2021, 3 pages (1 page of English Translation and 2 pages of Official Copy).
Notice of Allowance received for Brazilian Patent Application No. BR122012028970-1, dated Jan. 19, 2021, 2 pages (1 pages of English Translation and 1 pages of Official Copy).
Office Action received for Korean Patent Application No. 10-2020-7037138, dated Jan. 21, 2021, 13 pages (6 pages of English Translation and 7 pages of Official Copy).
Board Decision received for Chinese Patent Application No. 201480030811.4, dated Feb. 1, 2021, 44 pages (2 pages of English Translation and 42 pages of Official Copy).
Notice of Allowance received for Brazilian Patent Application No. BR122012028965-5, dated Jan. 19, 2021, 2 pages (1 page of English Translation and 1 page of Official Copy).
Notice of Allowance received for Brazilian Patent Application No. BR122012028966-3, dated Jan. 26, 2021, 2 pages (1 page of English Translation and 1 page of Official Copy).
Notice of Allowance received for Brazilian Patent Application No. BR122012028971-0, dated Jan. 26, 2021, 3 pages (1 page of English Translation and 2 pages of Official Copy).
Notice of Allowance received for Brazilian Patent Application No. BR122012028972-8, dated Jan. 26, 2021, 2 pages (1 page of English Translation and 1 page of Official Copy).
Notice of Allowance received for Brazilian Patent Application No. BR122012028973-6, dated Jan. 26, 2021, 2 pages (1 page of English Translation and 1 page of Official Copy).
Notice of Allowance received for Brazilian Patent Application No. BR122012028974-4, dated Jan. 26, 2021, 3 pages (1 page of English Translation and 2 pages of Official Copy).
“Alexa, Turn Up the Heat!”, Smartthings Samsung [online], Available online at https://web.archive.org/web/20160329142041/https://blog.smartthings.com/news/smartthingsupdates/alexa-turn-up-the-heat/, Mar. 3, 2016, 3 pages.
“SmartThings +Amazon Echo”, Smartthings Samsung [online], Available online at <https://web.archive.org/web/20160509231428/https://blog.smartthings.com/featured/alexa-turn-on-my-smartthings/>, Aug. 21, 2015, 3 pages.
“The world of Virtual Assistants—more SemTech . . . ”, End of Business as Usual—Glenn's External blog, Online Available at <https://web.archive.org/web/20091101840940/http://glennas.wordpress.com/2009/10/17/the-world-of-virtual-assistants-more-semtech/>, Oct. 17, 2009, 5 pages.
2004 Chrysler Pacifica: U-Connect Hands-Free Communication System, The Best and Brightest of 2004, Brief Article, Automotive Industries, Sep. 2003, 1 page.
2007 Lexus GS 450h 4dr Sedan (3.5L 6cyl Gas/Electric Hybrid CVT), available at <http://review.cnet.com/4505-10865_16-31833144.html>, retrieved on Aug. 3, 2006, 10 pages.
Abcom Pty. Ltd. “12.1 925 Candela Mobile PC”, LCDHardware.com, available at <http://www.lcdhardware.eom/panel/12_1_panel/default.asp.>, retrieved on Dec. 19, 2002, 2 pages.
ABF Software, “Lens-Magnifying Glass 1.5”, available at <http://download.com/3000-2437-10262078.html?tag=1st-0-1>, retrieved on Feb. 11, 2004, 1 page.
Abut et al., “Low-Rate Speech Encoding Using Vector Quantization and Subband Coding”, (Proceedings of the IEEE International Acoustics, Speech and Signal Processing Conference, Apr. 1986), as reprinted in Vector Quantization IEEE Press, 1990, pp. 312-315.
Abut et al., “Vector Quantization Of Speech and Speech-Like Waveforms”, (IEEE Transactions on Acoustics, Speech, and Signal Processing, Jun. 1982), as reprinted in Vector Quantization (IEEE Press, 1990), 1990, pp. 258-270.
Acero et al., “Environmental Robustness in Automatic Speech Recognition”, International Conference on Acoustics, Speech and Signal Processing (ICASSP'90), Apr. 1990, 4 pages.
Acero et al., “Robust Speech Recognition by Normalization of the Acoustic Space”, International Conference on Acoustics, Speech and Signal Processing, 1991, 4 pages.
Adium, “AboutAdium—Adium X—Trac”, available at <http://web.archive.org/web/20070819113247/http://trac.adiumx.com/wiki/AboutAdium>, retrieved on Nov. 25, 2011, 2 pages.
adobe.com, “Reading PDF Documents with Adobe Reader 6.0—A Guide for People with Disabilities”, Available online at “https://www.adobe.com/enterprise/accessibility/pdfs/acro6_cg_ue.pdf”, Jan. 2004, 76 pages.
Advisory Action received for U.S. Appl. No. 13/492,809, dated Nov. 10, 2014, 5 pages.
Advisory Action received for U.S. Appl. No. 13/913,336, dated Feb. 20, 2018, 3 pages.
Agnas et al., “Spoken Language Translator: First-Year Report”, SICS (ISSN 0283-3638), SRI and Telia Research AB, Jan. 1994, 161 pages.
Ahlberg et al., “The Alphaslider: A Compact and Rapid Selector”, CHI '94 Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, Apr. 1994, pp. 365-371.
Ahlberg et al., “Visual Information Seeking: Tight Coupling of Dynamic Query Filters with Starfield Displays”, Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, Apr. 24-28, 1994, pp. 313-317.
Ahlbom et al., Modeling Spectral Speech Transitions Using Temporal Decomposition Techniques, IEEE International Conference of Acoustics, Speech and Signal Processing (ICASSP'87), vol. 12, Apr. 1987, 4 pages.
Ahlstrom et al., “Overcoming Touchscreen User Fatigue by Workplace Design”, CHI '92 Posters and Short Talks of the 1992 SIGCHI Conference on Human Factors in Computing Systems, 1992, pp. 101-102.
Ahmed et al., “Intelligent Natural Language Query Processor”, TENCON '89, Fourth IEEE Region 10 International Conference, Nov. 22-24, 1989, pp. 47-49.
Ahuja et al., “A Comparison Of Application Sharing Mechanisms In Real-Time Desktop Conferencing Systems”, At&T Bell Laboratories, 1990, pp. 238-248.
Aikawa et al., “Generation for Multilingual MT”, available at <http://mtarchive.info/MTS-2001-Aikawa.pdf>, retrieved on Sep. 18, 2001, 6 pages.
Aikawa et al., “Speech Recognition Using Time-Warping Neural Networks”, Proceedings of the 1991, IEEE Workshop on Neural Networks for Signal Processing, 1991, 10 pages.
Aikawa, K. “Time-Warping Neural Network for Phoneme Recognition”, IEEE International Joint Conference on Neural Networks, vol. 3, Nov. 18-21, 1991, pp. 2122-2127.
Alfred App, “Alfred”, available at <http://www.alfredapp.com/>, retrieved on Feb. 8, 2012, 5 pages.
All Music Website, available at <http://www.allmusic.com/>, retrieved on Mar. 19, 2007, 2 pages.
Allen et al., “Automated Natural Spoken Dialog”, Computer, vol. 35, No. 4, Apr. 2002, pp. 51-56.
Allen, J., “Natural Language Understanding”, 2nd Edition, The Benjamin/Cummings Publishing Company, Inc., 1995, 671 pages.
Alleva et al., “Applying SPHINX-II to DARPA Wall Street Journal CSR Task”, Proceedings of Speech and Natural Language Workshop, Feb. 1992, pp. 393-398.
Alshawi et al., “CLARE: A Contextual Reasoning and Co-operative Response Framework for the Core Language Engine”, SRI International, Cambridge Computer Science Research Centre, Cambridge, Dec. 1992, 273 pages.
Alshawi et al., “Declarative Derivation of Database Queries from Meaning Representations”, Proceedings of the BANKAI Workshop on Intelligent Information Access, Oct. 1991, 12 pages.
Alshawi et al., “Logical Forms in the Core Language Engine”, Proceedings of the 27th Annual Meeting of the Association for Computational Linguistics, 1989, pp. 25-32.
Alshawi et al., “Overview of the Core Language Engine”, Proceedings of Future Generation Computing Systems,Tokyo, Sep. 1988, 13 pages.
Alshawi, H., “Translation and Monotonic Interpretation/Generation”, SRI International, Cambridge Computer Science Research Centre, Cambridge, available at <http://www.cam.sri.com/tr/crc024/paper.ps.Z1992>, Jul. 1992, 18 pages.
Amano et al., “A User-friendly Multimedia Book Authoring System”, The Institute of Electronics, Information and Communication Engineers Technical Report, vol. 103, No. 416, Nov. 2003, pp. 33-40.
Amano, Junko, “A User-Friendly Authoring System for Digital Talking Books”, IEICE Technical Report, The Institute of Electronics, Information and Communication Engineers, vol. 103 No. 418, Nov. 6, 2003, pp. 33-40.
Ambite et al., “Design and Implementation of the CALO Query Manager”, American Association for Artificial Intelligence, 2006, 8 pages.
Ambite et al., “Integration of Heterogeneous Knowledge Sources in the CALO Query Manager”, The 4th International Conference on Ontologies, Databases and Applications of Semantics (ODBASE), 2005, 18 pages.
Amrel Corporation, “Rocky Matrix BackLit Keyboard”, available at <http://www.amrel.com/asi_matrixkeyboard.html>, retrieved on Dec. 19, 2002, 1 page.
Anania, Peter, “Amazon Echo with Home Automation (Smartthings)”, Available online at https://www.youtube.com/watch?v=LMW6aXmsWNE, Dec. 20, 2015, 1 page.
Anastasakos et al., “Duration Modeling in Large Vocabulary Speech Recognition”, International Conference on Acoustics, Speech and Signal Processing (ICASSP'95), May 1995, pp. 628-631.
Anderson et al., “Syntax-Directed Recognition of Hand-Printed Two-Dimensional Mathematics”, Proceedings of Symposium on Interactive Systems for Experimental Applied Mathematics: Proceedings of the Association for Computing Machinery Inc. Symposium, 1967, 12 pages.
Anhui USTC IFL YTEK Co. Ltd., “Flytek Research Center Information Datasheet”, available at <http://www.iflttek.com/english/Research.htm>, retrieved on Oct. 15, 2004, 3 pages.
Ansari et al., “Pitch Modification of Speech using a Low-Sensitivity Inverse Filter Approach”, IEEE Signal Processing Letters, vol. 5, No. 3, Mar. 1998, pp. 60-62.
Anthony et al., “Supervised Adaption for Signature Verification System”, IBM Technical Disclosure, Jun. 1, 1978, 3 pages.
Api.ai, “Android App Review—Speaktoit Assistant”, Available at <https://www.youtube.com/watch?v=myE498nyfGw>, Mar. 30, 2011, 3 pages.
Appelt et al., “Fastus: A Finite-State Processor for Information Extraction from Real-world Text”, Proceedings of IJCAI, 1993, 8 pages.
Appelt et al., “SRI International Fastus System MUC-6 Test Results and Analysis”, SRI International, Menlo Park, California, 1995, 12 pages.
Appelt et al., “SRI: Description of the JV-FASTUS System used for MUC-5”, SRI International, Artificial Intelligence Center, 1993, 19 pages.
Apple Computer, “Guide Maker User's Guide”, Apple Computer, Inc., Apr. 27, 1994, 8 pages.
Apple Computer, “Introduction to Apple Guide”, Apple Computer, Inc., Apr. 28, 1994, 20 pages.
Apple Computer, “Knowledge Navigator”, published by Apple Computer no later than 2008, as depicted in Exemplary Screenshots from video entitled ‘Knowledge Navigator’, 2008, 7 pages.
Apple Computer, Inc., “Apple—iPod—Technical Specifications, iPod 20GB and 60GB Mac + PC”, available at <http://www.apple.com/ipod/color/specs.html>, 2005, 3 pages.
Apple Computer, Inc., “Apple Announces iTunes 2”, Press Release, Oct. 23, 2001, 2 pages.
Apple Computer, Inc., “Apple Introduces iTunes—World's Best and Easiest to Use Jukebox Software”, Macworld Expo, Jan. 9, 2001, 2 pages.
Apple Computer, Inc., “Apple's iPod Available in Stores Tomorrow”, Press Release, Nov. 9, 2001, 1 page.
Apple Computer, Inc., “Inside Macintosh”, vol. VI, 1985.
Apple Computer, Inc., “iTunes 2, Playlist Related Help Screens”, iTunes v2.0, 2000-2001, 8 pages.
Apple Computer, Inc., “iTunes 2: Specification Sheet”, 2001, 2 pages.
Apple Computer, Inc., “iTunes, Playlist Related Help Screens”, iTunes v1.0, 2000-2001, 8 pages.
Apple Computer, Inc., “QuickTime Movie Playback Programming Guide”, Aug. 11, 2005, pp. 1-58.
Apple Computer, Inc., “QuickTime Overview”, Aug. 11, 2005, pp. 1-34.
Apple Computer, Inc., “Welcome to Tiger”, available at <http://www.maths.dundee.ac.uk/software/Welcome_to_Mac_OS_X_v10.4_Tiger.pdf>, 2005, pp. 1-32.
Apple, “iPhone User's Guide”, Available at <http://mesnotices.20minutes.fr/manuel-notice-mode-emploi/APPLE/IPHONE%2D%5FE#>, Retrieved on Mar. 27, 2008, Jun. 2007, 137 pages.
Apple, “VoiceOver”, available at <http://www.apple.com/accessibility/voiceover/>, Feb. 2009, 5 pages.
Applebaum et al., “Enhancing the Discrimination of Speaker Independent Hidden Markov Models with Corrective Training”, International Conference on Acoustics, Speech, and Signal Processing, May 23, 1989, pp. 302-305.
AppleEvent Manager, which is described in the publication Inside Macintosh vol. VI, available from Addison-Wesley Publishing Company, 1985.
Arango et al., “Touring Machine: A Software Platform for Distributed Multimedia Applications”, 1992 IFIP International Conference on Upper Layer Protocols, Architectures, and Applications, May 1992, pp. 1-11.
Archbold et al., “A Team User's Guide”, SRI International, Dec. 21, 1981, 70 pages.
Arons, Barry M., “The Audio-Graphical Interface to a Personal Integrated Telecommunications System”, Thesis Submitted to the Department of Architecture at the Massachusetts Institute of Technology, Jun. 1984, 88 pages.
Asanovic et al., “Experimental Determination of Precision Requirements for Back-Propagation Training of Artificial Neural Networks”, Proceedings of the 2nd International Conference of Microelectronics for Neural Networks, 1991, www.ICSI.Berkelev.EDU, 1991, 7 pages.
Atal et al., “Efficient Coding of LPC Parameters by Temporal Decomposition”, IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP'83), Apr. 1983, 4 pages.
Badino et al., “Language Independent Phoneme Mapping for Foreign TTS”, 5th ISCA Speech Synthesis workshop, Pittsburgh, PA, Jun. 14-16, 2004, 2 pages.
Baechtle et al., “Adjustable Audio Indicator”, IBM Technical Disclosure Bulletin, Jul. 1, 1984, 2 pages.
Baeza-Yates, Ricardo, “Visualization of Large Answers in Text Databases”, AVI '96 Proceedings of the Workshop on Advanced Visual Interfaces, 1996, pp. 101-107.
Bahl et al., “A Maximum Likelihood Approach to Continuous Speech Recognition”, IEEE Transaction on Pattern Analysis and Machine Intelligence, vol. PAMI-5, No. 2, Mar. 1983, 13 pages.
Bahl et al., “A Tree-Based Statistical Language Model for Natural Language Speech Recognition”, IEEE Transactions on Acoustics, Speech and Signal Processing, vol. 37, No. 7, Jul. 1989, 8 pages.
Bahl et al., “Acoustic Markov Models Used in the Tangora Speech Recognition System”, Proceeding of International Conference on Acoustics, Speech and Signal Processing (ICASSP'88), vol. 1, Apr. 1988, 4 pages.
Bahl et al., “Large Vocabulary Natural Language Continuous Speech Recognition”, Proceedings of 1989 International Conference on Acoustics, Speech and Signal Processing, vol. 1, May 1989, 6 pages.
Bahl et al., “Multonic Markov Word Models for Large Vocabulary Continuous Speech Recognition”, IEEE Transactions on Speech and Audio Processing, vol. 1, No. 3, Jul. 1993, 11 pages.
Bahl et al., “Recognition of a Continuously Read Natural Corpus”, IEEE International Conference on Acoustics, Speech, and Signal Processing, vol. 3, Apr. 1978, pp. 422-424.
Bahl et al., “Speech Recognition with Continuous-Parameter Hidden Markov Models”, Proceeding of International Conference on Acoustics, Speech and Signal Processing (ICASSP'88), vol. 1, Apr. 1988, 8 pages.
Bajarin, Tim, “With Low End Launched, Apple Turns to Portable Future”, PC Week, vol. 7, Oct. 1990, p. 153(1).
Banbrook, M., “Nonlinear Analysis of Speech from a Synthesis Perspective”, A Thesis Submitted for the Degree of Doctor of Philosophy, The University of Edinburgh, Oct. 15, 1996, 35 pages.
Barrett et al., “How to Personalize the Web”, 1997 In proceddings of the ACM SIGCHI Conference on Human Factors in Computer Systems, Mar. 22-27, 1997, pp. 75-82.
Barthel, B., “Information Access for Visually Impaired Persons: Do We Still Keep a “Document” in “Documentation”?”, Professional Communication Conference, Sep. 1995, pp. 62-66.
Baudel et al., “2 Techniques for Improved HC Interaction: Toolglass & Magic Lenses: The See-Through Interface”, Apple Inc., Video Clip, CHI'94 Video Program on a CD, 1994.
Bear et al., “A System for Labeling Self-Repairs in Speech”, SRI International, Feb. 22, 1993, 9 pages.
Bear et al., “Detection and Correction of Repairs in Human-Computer Dialog”, SRI International, May 1992, 11 pages.
Bear et al., “Integrating Multiple Knowledge Sources for Detection and Correction of Repairs in Human-Computer Dialog”, Proceedings of the 30th Annual Meeting on Association for Computational Linguistics (ACL), 1992, 8 pages.
Bear et al., “Using Information Extraction to Improve Document Retrieval”, SRI International, Menlo Park, California, 1998, 11 pages.
Beck et al., “Integrating Natural Language, Query Processing, and Semantic Data Models”, COMCON Spring '90. IEEE Computer Society International Conference, 1990, Feb. 26-Mar. 2, 1990, pp. 538-543.
Bederson et al., “Pad++: A Zooming Graphical Interface for Exploring Alternate Interface Physics”, UIST' 94 Proceedings of the 7th Annual ACM symposium on User Interface Software and Technology, Nov. 1994, pp. 17-26.
Bederson et al., “The Craft of Information Visualization”, Elsevier Science, Inc., 2003, 435 pages.
Belaid et al., “A Syntactic Approach for Handwritten Mathematical Formula Recognition”, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. PAMI-6, No. 1, Jan. 1984, 7 pages.
Bellegarda et al., “A Latent Semantic Analysis Framework for Large-Span Language Modeling”, 5th European Conference on Speech, Communication and Technology (EUROSPEECH'97), Sep. 1997, 4 pages.
Bellegarda et al., “A Multispan Language Modeling Framework for Large Vocabulary Speech Recognition”, IEEE Transactions on Speech and Audio Processing, vol. 6, No. 5, Sep. 1998, 12 pages.
Bellegarda et al., “A Novel Word Clustering Algorithm Based on Latent Semantic Analysis”, Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP'96), vol. 1, 1996, 4 pages.
Bellegarda et al., “Experiments Using Data Augmentation for Speaker Adaptation”, International Conference on Acoustics, Speech and Signal Processing (ICASSP'95), May 1995, 4 pages.
Bellegarda et al., “On-Line Handwriting Recognition using Statistical Mixtures”, Advances in Handwriting and Drawings: A Multidisciplinary Approach, Europia, 6th International IGS Conference on Handwriting and Drawing, Paris, France, Jul. 1993, 11 pages.
Bellegarda et al., “Performance of the IBM Large Vocabulary Continuous Speech Recognition System on the ARPA Wall Street Journal Task”, Signal Processing VII: Theories and Applications, European Association for Signal Processing, 1994, 4 pages.
Bellegarda et al., “The Metamorphic Algorithm: A Speaker Mapping Approach to Data Augmentation”, IEEE Transactions on Speech and Audio Processing, vol. 2, No. 3, Jul. 1994, 8 pages.
Bellegarda et al., “Tied Mixture Continuous Parameter Modeling for Speech Recognition”, IEEE Transactions on Acoustics, Speech and Signal Processing, vol. 38, No. 12, Dec. 1990, pp. 2033-2045.
Bellegarda, Jerome R. “Latent Semantic Mapping”, IEEE Signal Processing Magazine, vol. 22, No. 5, Sep. 2005, pp. 70-80.
Bellegarda, Jerome R., “Exploiting both Local and Global Constraints for Multi-Span Statistical Language Modeling”, Proceeding of the 1998 IEEE International Conference on Acoustics, Speech and Signal Processing (1CASSP'98), vol. 2, May 1998, 5 pages.
Bellegarda, Jerome R., “Exploiting Latent Semantic Information in Statistical Language Modeling”, Proceedings of the IEEE, vol. 88, No. 8, Aug. 2000, 18 pages.
Bellegarda, Jerome R., “Interaction-Driven Speech Input—A Data-Driven Approach to the Capture of both Local and Global Language Constraints”, available at <http://old.sig.chi.ora/bulletin/1998.2/bellegarda.html>, 1992, 7 pages.
Bellegarda, Jerome R., “Large Vocabulary Speech Recognition with Multispan Statistical Language Models”, IEEE Transactions on Speech and Audio Processing, vol. 8, No. 1, Jan. 2000, 9 pages.
Belvin et al., “Development of the HRL Route Navigation Dialogue System”, Proceedings of the First International Conference on Human Language Technology Research, Paper, 2001, 5 pages.
Benel et al., “Optimal Size and Spacing of Touchscreen Input Areas”, Human-Computer Interaction—Interact, 1987, pp. 581-585.
Bergmann et al., “An adaptable man-machine interface using connected-word recognition”, 2nd European Conference on Speech Communication and Technology (Eurospeech 91), vol. 2, XP002176387, Sep. 24-26, 1991, pp. 467-470.
Beringer et al., “Operator Behavioral Biases Using High-Resolution Touch Input Devices”, Proceedings of the Human Factors and Ergonomics Society 33rd Annual Meeting, 1989, 3 pages.
Beringer, Dennis B., “Target Size, Location, Sampling Point and Instruction Set: More Effects on Touch Panel Operation”, Proceedings of the Human Factors and Ergonomics Society 34th Annual Meeting, 1990, 5 pages.
Bernabei et al., “Graphical I/O Devices for Medical Users”, 14th Annual International Conference of the IEEE on Engineering in Medicine and Biology Society, vol. 3, 1992, pp. 834-836.
Bernstein, Macrophone, “Speech Corpus”, IEEE/ICASSP, Apr. 22, 1994, pp. 1-81 to 1-84.
Berry et al., “PTIME: Personalized Assistance for Calendaring”, ACM Transactions on Intelligent Systems and Technology, vol. 2, No. 4, Article 40, Jul. 2011, pp. 1-22.
Berry et al., “Symantec”, New version of MORE.TM, Apr. 10, 1990, 1 page.
Berry et al., “Task Management under Change and Uncertainty Constraint Solving Experience with the CALO Project”, Proceedings of CP'05 Workshop on Constraint Solving under Change, 2005, 5 pages.
Bertulucci, Jeff, “Google Adds Voice Search to Chrome Browser”, PC World, Jun. 14, 2011, 5 pages.
Best Buy, “When it Comes to Selecting a Projection TV, Toshiba Makes Everything Perfectly Clear”, Previews of New Releases, available at <http://www.bestbuy.com/HomeAudioVideo/Specials/ToshibaTVFeatures.asp>, retrieved on Jan. 23, 2003, 5 pages.
Betts et al., “Goals and Objectives for User Interface Software”, Computer Graphics, vol. 21, No. 2, Apr. 1987, pp. 73-78.
Biemann et al., “Disentangling from Babylonian Confusion—Unsupervised Language Identification”, CICLing'05 Proceedings of the 6th international conference on Computational Linguistics and Intelligent Text Processing, vol. 3406, Feb. 2005, pp. 773-784.
Biemann, Chris, “Unsupervised Part-of-Speech Tagging Employing Efficient Graph Clustering”, Proceeding COLING ACL '06 Proceedings of the 21st International Conference on computational Linguistics and 44th Annual Meeting of the Association for Computational Linguistics: Student Research Workshop, 2006, pp. 7-12.
Bier et al., “Toolglass and Magic Lenses: The See-Through Interface”, Computer Graphics (SIGGRAPH '93 Proceedings), vol. 27, 1993, pp. 73-80.
Birrell, Andrew, “Personal Jukebox (PJB)”, available at <http://birrell.org/andrew/talks/pjb-overview.ppt>, Oct. 13, 2000, 6 pages.
Black et al., “Automatically Clustering Similar Units for Unit Selection in Speech Synthesis”, Proceedings of Eurospeech, vol. 2, 1997, 4 pages.
Black et al., “Multilingual Text-to-Speech Synthesis”, Acoustics, Speech and Signal Processing (ICASSP'04), Proceedings of the IEEE International Conference, vol. 3, May 17-21, 2004, pp. 761-764.
Blair et al., “An Evaluation of Retrieval Effectiveness for a Full-Text Document-Retrieval System”, Communications of the ACM, vol. 28, No. 3, Mar. 1985, 11 pages.
Bleher et al., “A Graphic Interactive Application Monitor”, IBM Systems Journal, vol. 19, No. 3, Sep. 1980, pp. 382-402.
BluePhoneElite: About, available at <http://www.reelintelligence.com/BluePhoneElite>, retrieved on Sep. 25, 2006, 2 pages.
BluePhoneElite: Features, available at <http://www.reelintelligence.com/BluePhoneElite/features.shtml,>, retrieved on Sep. 25, 2006, 2 pages.
Bluetooth PC Headsets, “‘Connecting’ Your Bluetooth Headset with Your Computer”, Enjoy Wireless VoIP Conversations, available at <http://www.bluetoothpcheadsets.com/connect.htm>, retrieved on Apr. 29, 2006, 4 pages.
Bobrow et al., “Knowledge Representation for Syntactic/Semantic Processing”, From: AAA-80 Proceedings, Copyright 1980, AAAI, 1980, 8 pages.
Bocchieri et al., “Use of Geographical Meta-Data in ASR Language and Acoustic Models”, IEEE International Conference on Acoustics Speech and Signal Processing, 2010, pp. 5118-5121.
Bociurkiw, Michael, “Product Guide: Vanessa Matz”, available at <http://www.forbes.com/asap/2000/1127/vmartz_print.html>, retrieved on Jan. 23, 2003, 2 pages.
Borden IV, G.R., “An Aural User Interface for Ubiquitous Computing”, Proceedings of the 6th International Symposium on Wearable Computers, IEEE, 2002, 2 pages.
Borenstein, Nathaniel S., “Cooperative Work in the Andrew Message System”, Information Technology Center and Computer Science Department, Carnegie Mellon University; Thyberg, Chris A. Academic Computing, Carnegie Mellon University, 1988, pp. 306-323.
Bouchou et al., “Using Transducers in Natural Language Database Query”, Proceedings of 4th International Conference on Applications of Natural Language to Information Systems, Austria, Jun. 1999, 17 pages.
Boy, Guy A., “Intelligent Assistant Systems”, Harcourt Brace Jovanovicy, 1991, 1 page.
Boyer et al., “A Fast String Searching Algorithm”, Communications of the ACM, vol. 20, 1977, pp. 762-772.
Brain, Marshall, “How MP3 Files Work”, available at <http://www.howstuffworks.com>, retrieved on Mar. 19, 2007, 4 pages.
Bratt et al., “The SRI Telephone-Based ATIS System”, Proceedings of ARPA Workshop on Spoken Language Technology, 1995, 3 pages.
Briner, L. L., “Identifying Keywords in Text Data Processing”, In Zelkowitz, Marvin V., ED, Directions and Challenges, 15th Annual Technical Symposium, Gaithersbury, Maryland, Jun. 17, 1976, 7 pages.
Brown et al., “Browing Graphs Using a Fisheye View”, Apple Inc., Video Clip, Systems Research Center, CHI '92 Continued Proceedings on a CD, 1992.
Brown et al., “Browsing Graphs Using a Fisheye View”, CHI '93 Proceedings of the INTERACT '93 and CHI '93 Conference on Human Factors in Computing Systems, 1993, p. 516.
Bulyko et al., “Error-Correction Detection and Response Generation in a Spoken Dialogue System”, Speech Communication, vol. 45, 2005, pp. 271-288.
Bulyko et al., “Joint Prosody Prediction and Unit Selection for Concatenative Speech Synthesis”, Electrical Engineering Department, University of Washington, Seattle, 2001, 4 pages.
Burger, D., “Improved Access to Computers for the Visually Handicapped: New Prospects and Principles”, IEEE Transactions on Rehabilitation Engineering, vol. 2, No. 3, Sep. 1994, pp. 111-118.
Burke et al., “Question Answering from Frequently Asked Question Files”, AI Magazine, vol. 18, No. 2, 1997, 10 pages.
Burns et al., “Development of a Web-Based Intelligent Agent for the Fashion Selection and Purchasing Process via Electronic Commerce”, Proceedings of the Americas Conference on Information System (AMCIS), Dec. 31, 1998, 4 pages.
Busemann et al., “Natural Language Diaglogue Service for Appointment Scheduling Agents”, Technical Report RR-97-02, Deutsches Forschungszentrum fur Kunstliche Intelligenz GmbH, 1997, 8 pages.
Bussey, et al., “Service Architecture, Prototype Description and Network Implications of a Personalized Information Grazing Service”, INFOCOM'90, Ninth Annual Joint Conference of the IEEE Computer and Communication Societies, Available at <http://slrohall.com/oublications/>, Jun. 1990, 8 pages.
Bussler et al., “Web Service Execution Environment (WSMX)”, retrieved from Internet on Sep. 17, 2012, available at <http://www.w3.org/Submission/WSMX>, Jun. 3, 2005, 29 pages.
Butcher, Mike, “EVI Arrives in Town to go Toe-to-Toe with Siri”, TechCrunch, Jan. 23, 2012, 2 pages.
Butler, Travis, “Archos Jukebox 6000 Challenges Nomad Jukebox”, available at <http://tidbits.com/article/6521>, Aug. 13, 2001, 5 pages.
Butler, Travis, “Portable MP3: The Nomad Jukebox”, available at <http://tidbits.com/article/6261>, Jan. 8, 2001, 4 pages.
Buxton et al., “EuroPARC's Integrated Interactive Intermedia Facility (IIIF): Early Experiences”, Proceedings of the IFIP WG 8.4 Conference on Multi-User Interfaces and Applications, 1990, pp. 11-34.
Buzo et al., “Speech Coding Based Upon Vector Quantization”, IEEE Transactions on Acoustics, Speech and Signal Processing, vol. Assp-28, No. 5, Oct. 1980, 13 pages.
CALL Centre, “Word Prediction”, The CALL Centre & Scottish Executive Education Dept., 1999, pp. 63-73.
Caminero-Gil et al., “Data-Driven Discourse Modeling for Semantic Interpretation”, Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing, May 1996, 6 pages.
Campbell et al., “An Expandable Error-Protected 4800 BPS CELP Coder (U.S. Federal Standard 4800 BPS Voice Coder)”, (Proceedings of IEEE Int'l Acoustics, Speech, and Signal Processing Conference, May 1983), as reprinted in Vector Quantization (IEEE Press, 1990), 1990, pp. 328-330.
Cao et al., “Adapting Ranking SVM to Document Retrieval”, SIGIR '06, Seattle, WA, Aug. 6-11, 2006, 8 pages.
Car Working Group, “Hands-Free Profile 1.5 HFP1.5_SPEC”, Bluetooth Doc, available at <www.bluetooth.org>, Nov. 25, 2005, 93 pages.
Caraballo et al., “Language Identification Based on a Discriminative Text Categorization Technique”, Iberspeech 2012—Vii Jornadas En Tecnologia Del Habla And Iii Iberiansl Tech Workshop, Nov. 21, 2012, pp. 1-10.
Card et al., “Readings in Information Visualization Using Vision to Think”, Interactive Technologies, 1999, 712 pages.
Carpendale et al., “3-Dimensional Pliable Surfaces: For the Effective Presentation of Visual Information”, UIST '95 Proceedings of the 8th Annual ACM Symposium on User Interface and Software Technology, Nov. 14-17, 1995, pp. 217-226.
Carpendale et al., “Extending Distortion Viewing from 2D to 3D”, IEEE Computer Graphics and Applications, Jul./Aug. 1997, pp. 42-51.
Carpendale et al., “Making Distortions Comprehensible”, IEEE Proceedings of Symposium on Visual Languages, 1997, 10 pages.
Carter et al., “The Speech-Language Interface in the Spoken Language Translator”, SRI International, Nov. 23, 1994, 9 pages.
Carter, D., “Lexical Acquisition in the Core Language Engine”, Proceedings of the Fourth Conference of the European Chapter of the Association for Computational Linguistics, 1989, 8 pages.
Casner et al., “N-Way Conferencing with Packet Video”, The Third International Workshop on Packet Video, Mar. 22-23, 1990, pp. 1-6.
Castleos, “Whole House Voice Control Demonstration”, available online at: https://www.youtube.com/watch?v=9SRCoxrZ_W4, Jun. 2, 2012, 26 pages.
Cawley, Gavin C. “The Application of Neural Networks to Phonetic Modelling”, PhD. Thesis, University of Essex, Mar. 1996, 13 pages.
Chai et al., “Comparative Evaluation of a Natural Language Dialog Based System and a Menu Driven System for Information Access: A Case Study”, Proceedings of the International Conference on Multimedia Information Retrieval (RIAO), Paris, Apr. 2000, 11 pages.
Chakarova et al., “Digital Still Cameras—Downloading Images to a Computer”, Multimedia Reporting and Convergence, available at <http://journalism.berkeley.edu/multimedia/tutorials/stillcams/downloading.html>, retrieved on May 9, 2005, 2 pages.
Chamberlain, Kim, “Quick Start Guide Natural Reader”, available online at <http://atrc.colostate.edu/files/quickstarts/Natural_Reader_Quick_Start_Guide.>, Apr. 2008, 5 pages.
Chang et al., “A Segment-Based Speech Recognition System for Isolated Mandarin Syllables”, Proceedings TEN CON '93, IEEE Region 10 Conference on Computer, Communication, Control and Power Engineering, vol. 3, Oct. 1993, 6 pages.
Chang et al., “Discriminative Training of Dynamic Programming based Speech Recognizers”, IEEE Transactions on Speech and Audio Processing, vol. 1, No. 2, Apr. 1993, pp. 135-143.
Chartier, David, “Using Multi-Network Meebo Chat Service on Your iPhone”, available at <http://www.tuaw.com/2007/07/04/using-multi-network-meebo-chat-service-on-your-iphone/>, Jul. 4, 2007, 5 pages.
Chelba et al., “Structured Language Modeling for Speech Recognition”, Available online at : http://arxiv.org/pdf/cs/0001023.pdf, Jan. 25, 2000, 7 pages.
Chen et al., “An Improved Method For Image Retrieval Using Speech Annotation”, The 9th International Conference on Multi-Media Modeling, Jan. 2003, pp. 1-17.
Chen, Yi, “Multimedia Siri Finds and Plays Whatever You Ask For”, PSFK Report, Feb. 9, 2012, 9 pages.
Cheyer et al., “Demonstration Video of Multimodal Maps Using an Agent Architecture”, published by SRI International no later than 1996, as depicted in Exemplary Screenshots from video entitled Demonstration Video of Multimodal Maps Using an Agent Architecture, 1996, 6 pages.
Cheyer et al., “Demonstration Video of Multimodal Maps Using an Open-Agent Architecture”, published by SRI International no later than 1996, as depicted in Exemplary Screenshots from video entitled Demonstration Video of Multimodal Maps Using an Open-Agent Architecture, 6 pages.
Cheyer et al., “Multimodal Maps: An Agent-Based Approach”, International Conference on Co-operative Multimodal Communication, 1995, 15 pages.
Cheyer et al., “Spoken Language and Multimodal Applications for Electronic Realties”, Virtual Reality, vol. 3, 1999, pp. 1-15.
Cheyer et al., “The Open Agent Architecture”, Autonomous Agents and Multi-Agent Systems, vol. 4, Mar. 1, 2001, 6 pages.
Cheyer et al., “The Open Agent Architecture: Building Communities of Distributed Software Agents”, Artificial Intelligence Center, SRI International, Power Point Presentation, Available online at <http://www.ai.sri.com/-oaa/>, retrieved on Feb. 21, 1998, 25 pages.
Cheyer, A., “Demonstration Video of Vanguard Mobile Portal”, published by SRI International no later than 2004, as depicted in ‘Exemplary Screenshots from video entitled Demonstration Video of Vanguard Mobile Portal’, 2004, 10 pages.
Cheyer, Adam, “A Perspective on AI & Agent Technologies for SCM”, VerticalNet Presentation, 2001, 22 pages.
Cheyer, Adam, “About Adam Cheyer”, available at <http://www.adam.cheyer.com/about.html>, retrieved on Sep. 17, 2012, 2 pages.
Choi et al., “Acoustic and Visual Signal based Context Awareness System for Mobile Application”, IEEE Transactions on Consumer Electronics, vol. 57, No. 2, May 2011, pp. 738-746.
Chomsky et al., “The Sound Pattern of English”, New York, Harper and Row, 1968, 242 pages.
Choularton et al., “User Responses to Speech Recognition Errors: Consistency of Behaviour Across Domains”, Proceedings of the 10th Australian International Conference on Speech Science & Technology, Dec. 8-10, 2004, pp. 457-462.
Church, Kenneth W., “Phonological Parsing in Speech Recognition”, Kluwer Academic Publishers, 1987.
Cisco Systems, Inc., “Cisco Unity Unified Messaging User Guide”, Release 4.0(5), Apr. 14, 2005, 152 pages.
Cisco Systems, Inc., “Installation Guide for Cisco Unity Unified Messaging with Microsoft Exchange 2003/2000 (With Failover Configured)”, Release 4.0(5), Apr. 14, 2005, 152 pages.
Cisco Systems, Inc., “Operations Manager Tutorial, Cisco's IPC Management Solution”, 2006, 256 pages.
Codd, E. F., “Databases: Improving Usability and Responsiveness—How About Recently”, Copyright 1978, Academic Press, Inc., 1978, 28 pages.
Cohen et al., “An Open Agent Architecture”, available at <http://citeseerx.ist.psu.edu/viewdoc/summary?doi=1 0.1.1.30.480>, 1994, 8 pages.
Cohen et al., “Voice User Interface Design,”, Excerpts from Chapter 1 and Chapter 10, 2004, 36 pages.
Coleman, David W., “Meridian Mail Voice Mail System Integrates Voice Processing and Personal Computing”, Speech Technology, vol. 4, No. 2, Mar./Apr. 1988, pp. 84-87.
Coles et al., “Chemistry Question-Answering”, SRI International, Jun. 1969, 15 pages.
Coles et al., “Techniques for Information Retrieval Using an Inferential Question-Answering System with Natural-Language Input”, SRI International, Nov. 1972, 198 Pages.
Coles et al., “The Application of Theorem Proving to Information Retrieval”, SRI International, Jan. 1971, 21 pages.
Colt, Sam, “Here's One Way Apple's Smartwatch Could Be Better Than Anything Else”, Business Insider, Aug. 21, 2014, pp. 1-4.
Combined Search Report and Examination Report under Sections 17 and 18(3) received for GB Patent Application No. 1009318.5, dated Oct. 8, 2010, 5 pages.
Combined Search Report and Examination Report under Sections 17 and 18(3) received for GB Patent Application No. 1217449.6, dated Jan. 17, 2013, 6 pages.
Compaq Inspiration Technology, “Personal Jukebox (PJB)—Systems Research Center and PAAD”, Oct. 13, 2000, 25 pages.
Compaq, “Personal Jukebox”, available at <http://research.compaq.com/SRC/pjb/>, 2001, 3 pages.
Conkie et al., “Preselection of Candidate Units in a Unit Selection-Based Text-to-Speech Synthesis System”, ISCA, 2000, 4 pages.
Conklin, Jeff, “Hypertext: An Introduction and Survey”, COMPUTER Magazine, Sep. 1987, 25 pages.
Conklin, Jeffrey, “A Survey of Hypertext”, MCC Software Technology Program, Dec. 1987, 40 pages.
Connolly et al., “Fast Algorithms for Complex Matrix Multiplication Using Surrogates”, IEEE Transactions on Acoustics, Speech and Signal Processing, vol. 37, No. 6, Jun. 1989, 13 pages.
Constantinides et al., “A Schema Based Approach to Dialog Control”, Proceedings of the International Conference on Spoken Language Processing, 1998, 4 pages.
Copperi et al., “CELP Coding for High Quality Speech at 8 kbits/s”, Proceedings of IEEE International Acoustics, Speech and Signal Processing Conference, Apr. 1986), as reprinted in Vector Quantization (IEEE Press), 1990, pp. 324-327.
Corporate Ladder, BLOC Publishing Corporation, 1991, 1 page.
Corr, Paul, “Macintosh Utilities for Special Needs Users”, available at <http://homepage.mac.com/corrp/macsupt/columns/specneeds.html>, Feb. 1994 (content updated Sep. 19, 1999), 4 pages.
Cox et al., “Speech and Language Processing for Next-Millennium Communications Services”, Proceedings of the IEEE, vol. 88, No. 8, Aug. 2000, 24 pages.
Craig et al., “Deacon: Direct English Access and Control”, AFIPS Conference Proceedings, vol. 19, San Francisco, Nov. 1966, 18 pages.
Creative Technology Ltd., “Creative NOMAD® II: Getting Started—User Guide (On Line Version)”, available at <http://ec1.images-amazon.com/media/i3d/01/A/man-migrate/MANUAL000026434.pdf>, Apr. 2000, 46 pages.
Creative Technology Ltd., “Creative NOMAD®: Digital Audio Player: User Guide (On-Line Version)”, available at <http://ec1.images-amazon.com/media/i3d/01/A/man-migrate/MANUAL000010757.pdf>, Jun. 1999, 40 pages.
Creative Technology Ltd., “Nomad Jukebox”, User Guide, Version 1.0, Aug. 2000, 52 pages.
Creative, “Creative NOMAD MuVo TX”, available at <http://web.archive.org/web/20041024175952/www.creative.com/products/pfriendly.asp?product=9672>, retrieved on Jun. 6, 2006, 1 page.
Creative, “Creative NOMAD MuVo”, available at <http://web.archive.org/web/20041024075901/www.creative.com/products/product.asp?category=213&subcategory=216&product=4983>, retrieved on Jun. 7, 2006, 1 page.
Creative, “Digital MP3 Player”, available at <http://web.archive.org/web/20041024074823/www.creative.com/products/product.asp?category=213&subcategory=216&product=4983, 2004, 1 page.
Croft et al., “Task Support in an Office System”, Proceedings of the Second ACM-SIGOA Conference on Office Information Systems, 1984, pp. 22-24.
Crowley et al., “MMConf: An Infrastructure for Building Shared Multimedia Applications”, CSCW 90 Proceedings, Oct. 1990, pp. 329-342.
Cucerzan et al., “Bootstrapping a Multilingual Part-of-Speech Tagger in One Person-Day”, In Proceedings of the 6th Conference on Natural Language Learning, vol. 20, 2002, pp. 1-7.
Cuperman et al., “Vector Predictive Coding of Speech at 16 kbit s/s”, (IEEE Transactions on Communications, Jul. 1985), as reprinted in Vector Quantization (IEEE Press, 1990), 1990, pp. 300-311.
Cutkosky et al., “PACT: An Experiment in Integrating Concurrent Engineering Systems”, Journal & Magazines, Computer, vol. 26, No. 1, Jan. 1993, 14 pages.
Dar et al., “DTL's DataSpot: Database Exploration Using Plain Language”, Proceedings of the 24th VLDB Conference, New York, 1998, 5 pages.
Database WPI Section Ch, Week 8733, Derwent Publications Ltd., London, GB; Class A17, AN 87-230826 & JP, A, 62 153 326 (Sanwa Kako KK (SANS) Sanwa Kako Co), Jul. 8, 1987, 6 pages.
Database WPI Section Ch, Week 8947, Derwent Publications Ltd., London, GB; Class A17, AN 89-343299 & JP, A, 1 254 742 (Sekisui Plastics KK), Oct. 11, 1989, 7 pages.
Davis et al., “A Personal Handheld Multi-Modal Shopping Assistant”, International Conference on Networking and Services, IEEE, 2006, 9 pages.
Davis et al., “Stone Soup Translation”, Department of Linguistics, Ohio State University, 2001, 11 pages.
De Herrera, Chris, “Microsoft ActiveSync 3.1”, Version 1.02, available at <http://www.cewindows.net/wce/activesync3.1.htm>, Oct. 13, 2000, 8 pages.
Decision on Appeal received for Korean Patent Application No. 10-2015-7035370, dated Jun. 7, 2019, 13 pages.
Decision to Grant received for Russian Patent Application No. 2012135502, dated Sep. 11, 2014, 15 pages.
Decision to Grant received for Russian Patent Application No. 2012144606, dated Nov. 19, 2014, 13 pages.
Decision to Grant received for Russian Patent Application No. 2012144639, dated Nov. 28, 2014, 10 pages.
Decision to Grant received for Russian Patent Application No. 2012144643, dated Nov. 20, 2014, 13 pages.
Decision to Grant received for Russian Patent Application No. 2012144647, dated Jan. 27, 2015, 16 pages.
Decision to Grant received for Russian Patent Application No. 2012144648, dated Nov. 19, 2014, 14 pages.
Decision to Grant received for Russian Patent Application No. 2015120954, dated Feb. 14, 2018, 20 pages.
Decision to Refuse received for European Patent Application No. 14737370.8, dated Jun. 26, 2019, 18 pages.
Decker et al., “Designing Behaviors for Information Agents”, The Robotics Institute, Carnegie-Mellon University, Paper, Jul. 1996, 15 pages.
Decker et al., “Matchmaking and Brokering”, The Robotics Institute, Carnegie-Mellon University, Paper, May 1996, 19 pages.
Deedeevuu, “Amazon Echo Alarm Feature”, Available online at https://www.youtube.com/watch?v=fdjU8eRLk7c, Feb. 16, 2015, 1 page.
Deerwester et al., “Indexing by Latent Semantic Analysis”, Journal of the American Society for Information Science, vol. 41, No. 6, Sep. 1990, 19 pages.
Degani et al., “‘Soft’ Controls for Hard Displays: Still a Challenge”, Proceedings of the 36th Annual Meeting of the Human Factors Society, 1992, pp. 52-56.
Del Strother, Jonathan, “Coverflow”, available at <http://www.steelskies.com/coverflow>, retrieved on Jun. 15, 2006, 14 pages.
Deller, Jr. et al., “Discrete-Time Processing of Speech Signals”, Prentice Hall, ISBN: 0-02-328301-7, 1987, 14 pages.
Diagrammaker, Action Software, 1989.
Diagram-Master, Ashton-Tate, 1989.
Diamond Multimedia Systems, Inc., “Rio PMP300: User's Guide”, available at <http://ec1.images-amazon.com/media/i3d/01/A/man-migrate/MANUAL000022854.pdf>, 1998, 28 pages.
Dickinson et al., “Palmtips: Tiny Containers for All Your Data”, PC Magazine, vol. 9, Mar. 1990, p. 218(3).
Digital Audio in the New Era, Electronic Design and Application, No. 6, Jun. 30, 2003, 3 pages.
Digital Equipment Corporation, “Open VMS Software Overview”, Software Manual, Dec. 1995, 159 pages.
Digital Equipment Corporation, “OpenVMS RTL DECtalk (DTK$) Manual”, May 1993, 56 pages.
Dittenbach et al., “A Natural Language Query Interface for Tourism Information”, In: Information and Communication Technologies in Tourism 2003, XP055114393, Feb. 14, 2003, pp. 152-162.
Dobrisek et al., “Evolution of the Information-Retrieval System for Blind and Visually-Impaired People”, International Journal of Speech Technology, Kluwer Academic Publishers, Bo, vol. 6, No. 3, pp. 301-309.
Domingue et al., “Web Service Modeling Ontology (WSMO)—An Ontology for Semantic Web Services”, Position Paper at the W3C Workshop on Frameworks for Semantics in Web Services, Innsbruck, Austria, Jun. 2005, 6 pages.
Donahue et al., “Whiteboards: A Graphical Database Tool”, ACM Transactions on Office Information Systems, vol. 4, No. 1, Jan. 1986, pp. 24-41.
Donovan, R. E., “A New Distance Measure for Costing Spectral Discontinuities in Concatenative Speech Synthesisers”, available at <http://citeseerx.ist.osu.edu/viewdoc/summarv?doi=1 0.1.1.21.6398>, 2001, 4 pages.
Dourish et al., “Portholes: Supporting Awareness in a Distributed Work Group”, CHI 1992;, May 1992, pp. 541-547.
Dowding et al., “Gemini: A Natural Language System for Spoken-Language Understanding”, Proceedings of the Thirty-First Annual Meeting of the Association for Computational Linguistics, 1993, 8 pages.
Dowding et al., “Interleaving Syntax and Semantics in An Efficient Bottom-Up Parser”, Proceedings of the 32nd Annual Meeting of the Association for Computational Linguistics, 1994, 7 pages.
Dragon Naturally Speaking Version 11 Users Guide, Nuance Communications, Inc., Copyright @2002-2010, 132 pages.
Dual Rate Speech Coder for Multimedia Communications Transmitting at 5.3 and 6.3 kbit/s, International Telecommunication Union Recommendation G.723, 7 pages.
Dusan et al., “Multimodal Interaction on PDA's Integrating Speech and Pen Inputs”, Eurospeech Geneva, 2003, 4 pages.
dyslexic.com, “AlphaSmart 3000 with CoWriter SmartApplet: Don Johnston Special Needs”, available at <http://www.dyslexic.com/procuts.php?catid-2&pid=465&PHPSESSID=2511b800000f7da>, retrieved on Dec. 6, 2005, 13 pages.
Eagle et al., “Social Serendipity: Proximity Sensing and Cueing”, MIT Media Laboratory Technical Note 580, May 2004, 18 pages.
Edwards, John R., “Q&A: Integrated Software with Macros and an Intelligent Assistant”, Byte Magazine, vol. 11, No. 1, Jan. 1986, pp. 120-122.
Egido, Carmen, “Video Conferencing as a Technology to Support Group Work: A Review of its Failures”, Bell Communications Research, 1988, pp. 13-24.
Elio et al., “On Abstract Task Models and Conversation Policies”, Proc. Workshop on Specifying and Implementing Conversation Policies, Autonomous Agents'99 Conference, 1999, pp. 1-10.
Elliot, Chip, “High-Quality Multimedia Conferencing Through a Long-Haul Packet Network”, BBN Systems and Technologies, 1993, pp. 91-98.
Elliott et al., “Annotation Suggestion and Search for Personal Multimedia Objects on the Web”, CIVR, Jul. 7-9, 2008, pp. 75-84.
Elofson et al., “Delegation Technologies: Environmental Scanning with Intelligent Agents”, Jour. of Management Info. Systems, Summer 1991, vol. 8, No. 1, 1991, pp. 37-62.
Eluminx, “Illuminated Keyboard”, available at <http://www.elumix.com/>, retrieved on Dec. 19, 2002, 1 page.
Engst, Adam C., “SoundJam Keeps on Jammin”, available at <http://db.tidbits.com/getbits.acgi?tbart=05988>, Jun. 19, 2000, 3 pages.
Epstein et al., “Natural Language Access to a Melanoma Data Base”, SRI International, Sep. 1978, 7 pages.
Ericsson et al., “Software Illustrating a Unified Approach to Multimodality and Multilinguality in the In-Home Domain”, Talk and Look: Tools for Ambient Linguistic Knowledge, Dec. 2006, 127 pages.
Ericsson Inc., “Cellular Phone with Integrated MP3 Player”, Research Disclosure Journal No. 41815, Feb. 1999, 2 pages.
Erol et al., “Multimedia Clip Generation From Documents for Browsing on Mobile Devices”, IEEE Transactions on Multimedia, vol. 10, No. 5, Aug. 2008, 13 pages.
Eslambolchilar et al., “Making Sense of Fisheye Views”, Second Dynamics and Interaction Workshop at University of Glasgow, Aug. 2005, 6 pages.
Eslambolchilar et al., “Multimodal Feedback for Tilt Controlled Speed Dependent Automatic Zooming”, UIST'04, Oct. 24-27, 2004, 2 pages.
European Search Report received for European Patent Application No. 01201774.5, dated Sep. 14, 2001, 3 pages.
European Search Report received for European Patent Application No. 99107544.1, dated Jul. 8, 1999, 4 pages.
European Search Report received for European Patent Application No. 99107545.8, dated Jul. 1, 1999, 3 pages.
Evermann et al., “Posterior Probability Decoding, Confidence Estimation and System Combination”, Proceedings Speech Transcription Workshop, 2000, 4 pages.
Evi, “Meet Evi: The One Mobile Application that Provides Solutions for your Everyday Problems”, Feb. 2012, 3 pages.
Ex Parte Quayle Action received for U.S. Appl. No. 13/725,713, mailed on Dec. 18, 2013, 5 pages.
Exhibit 1, “Natural Language Interface Using Constrained Intermediate Dictionary of Results”, List of Publications Manually Reviewed for the Search of U.S. Pat. No. 7,177,798, Mar. 22, 2013, 1 page.
Extended European Search Report (includes European Search Report and European Search Opinion) received for European Patent Application No. 06256215.2, dated Feb. 20, 2007, 6 pages.
Extended European Search Report (includes European Search Report and European Search Opinion) received for European Patent Application No. 12186113.2, dated Apr. 28, 2014, 14 pages.
Extended European Search Report (includes Partial European Search Report and European Search Opinion) received for European Patent Application No. 13169672.6, dated Aug. 14, 2013, 11 pages.
Extended European Search Report (includes Partial European Search Report and European Search Opinion) received for European Patent Application No. 15169349.6, dated Jul. 28, 2015, 8 pages.
Extended European Search Report (includes Partial European Search Report and European Search Opinion) received for European Patent Application No. 15196748.6, dated Apr. 4, 2016.
Extended European Search Report (includes Partial European Search Report and European Search Opinion) received for European Patent Application No. 16150079.8, dated Feb. 18, 2016, 7 pages.
Extended European Search Report (includes Supplementary European Search Report and Search Opinion) received for European Patent Application No. 07863218.9, dated Dec. 9, 2010, 7 pages.
Extended European Search Report (includes Supplementary European Search Report and Search Opinion) received for European Patent Application No. 12727027.0, dated Sep. 26, 2014, 7 pages.
Extended European Search Report (inclusive of the Partial European Search Report and European Search Opinion) received for European Patent Application No. 12729332.2, dated Oct. 31, 2014, 6 pages.
Extended European Search Report and Search Opinion received for European Patent Application No. 12185276.8, dated Dec. 18, 2012, 4 pages.
Extended European Search Report received for European Patent Application No. 11159884.3, dated May 20, 2011, 8 pages.
Extended European Search Report received for European Patent Application No. 11707939.2, dated Nov. 18, 2016, 13 pages.
Extended European Search Report received for European Patent Application No. 12186663.6, dated Jul. 16, 2013, 6 pages.
Extended European Search Report received for European Patent Application No. 13726938.7, dated Dec. 14, 2015, 8 pages.
Extended European Search Report received for European Patent Application No. 13770552.1, dated Jan. 7, 2016, 5 pages.
Extended European Search Report received for European Patent Application No. 14719914.5, dated Oct. 10, 2016, 7 pages.
Extended European Search Report received for European Patent Application No. 14737370.8, dated May 19, 2016, 12 pages.
Extended European Search Report received for European Patent Application No. 16188272.5, dated Nov. 18, 2016, 12 pages.
Extended European Search Report received for European Patent Application No. 18202474.5, dated Feb. 12, 2019, 9 pages.
Extended European Search Report received for European Patent Application No. 19195766.1, dated Oct. 8, 2019, 15 pages.
Extended Search Report received for European Patent Application No. 16188055.4, dated Dec. 22, 2016, 8 pages.
Fanty et al., “A Comparison of DFT, PLP and Cochleagram for Alphabet Recognition”, IEEE, Nov. 1991, pp. 326-329.
Feigenbaum et al., “Computer-Assisted Semantic Annotation of Scientific Life Works”, Oct. 15, 2007, 22 pages.
Ferguson et al., “TRIPS: An Integrated Intelligent Problem-Solving Assistant”, Proceedings of the Fifteenth National Conference on Artificial Intelligence (AAAI-98) and Tenth Conference on Innovative Applications of Artificial Intelligence (IAAI-98), 1998, 7 pages.
Fikes et al., “A Network-Based Knowledge Representation and its Natural Deduction System”, SRI International, Jul. 1977, 43 pages.
Final Office Action received for U.S. Appl. No. 12/987,982, dated Jul. 25, 2014, 21 pages.
Final Office Action received for U.S. Appl. No. 13/492,809, dated Feb. 9, 2016, 11 pages.
Final Office Action received for U.S. Appl. No. 13/492,809, dated May 22, 2014, 10 pages.
Final Office Action received for U.S. Appl. No. 13/725,481, dated Dec. 19, 2013, 16 pages.
Final Office Action received for U.S. Appl. No. 13/725,550, dated Nov. 13, 2013, 10 pages.
Final Office Action received for U.S. Appl. No. 13/725,616, dated Nov. 15, 2013, 8 pages.
Final Office Action received for U.S. Appl. No. 13/725,742, dated Nov. 18, 2013, 6 pages.
Final office action received for U.S. Appl. No. 13/725,761, dated Dec. 19, 2013, 13 pages.
Final office action received for U.S. Appl. No. 13/725,761, dated Jul. 11, 2014, 5 pages.
Final Office Action received for U.S. Appl. No. 13/784,707, dated Nov. 6, 2013, 12 pages.
Final Office Action received for U.S. Appl. No. 13/913,336, dated Oct. 24, 2017, 9 pages.
Final Office Action received for U.S. Appl. No. 15/394,162, dated Oct. 29, 2019, 17 pages.
Findlater et al., “Beyond QWERTY: Augmenting Touch-Screen Keyboards with Multi-Touch Gestures for Non-Alphanumeric Input”, CHI '12, Austin, Texas, USA, May 5-10, 2012, 4 pages.
Fiscus, J. G., “A Post-Processing System To Yield Reduced Word Error Rates: Recognizer Output Voting Error Reduction (ROVER)”, IEEE Proceedings, Automatic Speech Recognition and Understanding, Dec. 14-17, 1997, pp. 347-354.
Fisher et al., “Virtual Environment Display System”, Interactive 3D Graphics, Oct. 23- 24, 1986, pp. 77-87.
Forsdick, Harry, “Explorations into Real-Time Multimedia Conferencing”, Proceedings of the Ifip Tc 6 International Symposium on Computer Message Systems, 1986, 331 pages.
Frisse, M. E., “Searching for Information in a Hypertext Medical Handbook”, Communications of the ACM, vol. 31, No. 7, Jul. 1988, 8 pages.
Furnas et al., “Space-Scale Diagrams: Understanding Multiscale Interfaces”, CHI '95 Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, 1995, pp. 234-241.
Furnas, George W., “Effective View Navigation”, Proceedings of the ACM SIGCHI Conference on Human Factors in Computing Systems, Mar. 1997, pp. 367-374.
Furnas, George W., “Generalized Fisheye Views”, CHI '86 Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, vol. 17, No. 4, Apr. 1986, pp. 16-23.
Furnas, George W., “The Fisheye Calendar System”, Bellcore Technical Memorandum, Nov. 19, 1991, pp. 1-9.
Gamback et al., “The Swedish Core Language Engine”, NOTEX Conference, 1992, 17 pages.
Gannes, Liz, “Alfred App Gives Personalized Restaurant Recommendations”, AllThingsD, Jul. 18, 2011, pp. 1-3.
Gardner, Jr., P. C., “A System for the Automated Office Environment”, IBM Systems Journal, vol. 20, No. 3, 1981, pp. 321-345.
Garretson, R., “IBM Adds ‘Drawing Assistant’ Design Tool to Graphic Series”, PC Week, vol. 2, No. 32, Aug. 13, 1985, 1 page.
Gautier et al., “Generating Explanations of Device Behavior Using Compositional Modeling and Causal Ordering”, CiteSeerx, 1993, pp. 89-97.
Gaver et al., “One Is Not Enough: Multiple Views in a Media Space”, INTERCHI, Apr. 24-29, 1993, pp. 335-341.
Gaver et al., “Realizing a Video Environment: EuroPARC's RAVE System”, Rank Xerox Cambridge EuroPARC, 1992, pp. 27-35.
Gervasio et al., “Active Preference Learning for Personalized Calendar Scheduling Assistance”, CiteSeerx, Proceedings of IUI'05, Jan. 2005, pp. 90-97.
Giachin et al., “Word Juncture Modeling Using Inter-Word Context-Dependent Phone-Like Units”, Cselt Technical Reports, vol. 20, No. 1, Mar. 1992, pp. 43-47.
Gillespie, Kelly, “Adventures in Integration”, Data Based Advisor, vol. 9, No. 9, Sep. 1991, pp. 90-92.
Gillespie, Kelly, “Internationalize Your Applications with Unicode”, Data Based Advisor, vol. 10, No. 10, Oct. 1992, pp. 136-137.
Gilloire et al., “Innovative Speech Processing for Mobile Terminals: An Annotated Bibliography”, Signal Processing, vol. 80, No. 7, Jul. 2000, pp. 1149-1166.
Glass et al., “Multilingual Language Generation Across Multiple Domains”, International Conference on Spoken Language Processing, Japan, Sep. 1994, 5 pages.
Glass et al., “Multilingual Spoken-Language Understanding in the Mit Voyager System”, Available online at <http://groups.csail.mit.edu/SLS/publications/1995/speechcomm95-voyager.pdf>, Aug. 1995, 29 pages.
Glass, Alyssa, “Explaining Preference Learning”, CiteSeerx, 2006, pp. 1-5.
Glinert-Stevens, Susan, “Microsoft Publisher: Desktop Wizardry”, PC Sources, vol. 3, No. 2, Feb. 1992, 1 page.
Glossary of Adaptive Technologies: Word Prediction, available at <http://www.utoronto.ca/atrc/reference/techwordpred.html>, retrieved on Dec. 6, 2005, 5 pages.
Gmail, “About Group Chat”, available at <http://mail.google.com/support/bin/answer.py?answer=81090>, Nov. 26, 2007, 2 pages.
Goddeau et al., “A Form-Based Dialogue Manager for Spoken Language Applications”, Available online at <http://phasedance.com/pdf!icslp96.pdf>, Oct. 1996, 4 pages.
Goddeau et al., “Galaxy: A Human-Language Interface to On-Line Travel Information”, International Conference on Spoken Language Processing, Yokohama, 1994, pp. 707-710.
Goldberg et al., “Using Collaborative Filtering to Weave an Information Tapestry”, Communications of the ACM, vol. 35, No. 12, Dec. 1992, 10 pages.
Goldberg, Cheryl, “IBM Drawing Assistant: Graphics for the EGA”, PC Magazine, vol. 4, No. 26, Dec. 24, 1985, 1 page.
Gomez et al., “Mouth Gesture and Voice Command Based Robot Command Interface”, IEEE International Conference on Robotics and Automation, May 12-17, 2009, pp. 333-338.
Gong et al., “Guidelines for Handheld Mobile Device Interface Design”, Proceedings of DSI 2004 Annual Meeting, 2004, pp. 3751-3756.
Gonnet et al., “Handbook of Algorithms and Data Structures: in Pascal and C. (2nd ed.)”, Addison-Wesley Longman Publishing Co., 1991, 17 pages.
Good et al., “Building a User-Derived Interface”, Communications of the ACM; (Oct. 1984) vol. 27, No. 10, Oct. 1984, pp. 1032-1043.
Gorin et al., “On Adaptive Acquisition of Language”, International Conference on Acoustics, Speech and Signal Processing (ICASSP'90), vol. 1, Apr. 1990, 5 pages.
Gotoh et al., “Document Space Models Using Latent Semantic Analysis”, In Proceedings of Eurospeech, 1997, 4 pages.
Gray et al., “Rate Distortion Speech Coding with a Minimum Discrimination Information Distortion Measure”, (IEEE Transactions on Information Theory, Nov. 1981), as reprinted in Vector Quantization (IEEE Press), 1990, pp. 208-221.
Gray, R. M., “Vector Quantization”, IEEE ASSP Magazine, Apr. 1984, 26 pages.
Green, C., “The Application of Theorem Proving to Question-Answering Systems”, SRI Stanford Research Institute, Artificial Intelligence Group, Jun. 1969, 169 pages.
Greenberg, Saul, “A Fisheye Text Editor for Relaxed-WYSIWIS Groupware”, CHI '96 Companion, Vancouver, Canada, Apr. 13-18, 1996, 2 pages.
Gregg et al., “DSS Access on the WWW: An Intelligent Agent Prototype”, Proceedings of the Americas Conference on Information Systems, Association for Information Systems, 1998, 3 pages.
Griffin et al., “Signal Estimation From Modified Short-Time Fourier Transform”, IEEE Transactions on Acoustics, Speech and Signal Processing, vol. ASSP-32, No. 2, Apr. 1984, pp. 236-243.
Grishman et al., “Computational Linguistics: An Introduction”, Cambridge University Press, 1986, 172 pages.
Grosz et al., “Dialogic: A Core Natural-Language Processing System”, SRI International, Nov. 1982, 17 pages.
Grosz et al., “Research on Natural-Language Processing at SRI”, SRI International, Nov. 1981, 21 pages.
Grosz et al., “TEAM: An Experiment in the Design of Transportable Natural-Language Interfaces”, Artificial Intelligence, vol. 32, 1987, 71 pages.
Grosz, B., “Team: A Transportable Natural-Language Interface System”, Proceedings of the First Conference on Applied Natural Language Processing, 1983, 7 pages.
Gruber et al., “An Ontology for Engineering Mathematics”, Fourth International Conference on Principles of Knowledge Representation and Reasoning, Available online at <http://www-ksl.stanford.edu/knowledge-sharing/papers/engmath.html>, 1994, pp. 1-22.
Gruber et al., “Generative Design Rationale: Beyond the Record and Replay Paradigm”, Knowledge Systems Laboratory, Technical Report KSL 92-59, Dec. 1991, Updated Feb. 1993, 24 pages.
Gruber et al., “Machine-Generated Explanations of Engineering Models: A Compositional Modeling Approach”, Proceedings of International Joint Conference on Artificial Intelligence, 1993, 7 pages.
Gruber et al., “NIKE: A National Infrastructure for Knowledge Exchange”, A Whitepaper Advocating and ATP Initiative on Technologies for Lifelong Learning, Oct. 1994, pp. 1-10.
Gruber et al., “Toward a Knowledge Medium for Collaborative Product Development”, Proceedings of the Second International Conference on Artificial Intelligence in Design, Jun. 1992, pp. 1-19.
Gruber, Thomas R., “A Translation Approach to Portable Ontology Specifications”, Knowledge Acquisition, vol. 5, No. 2, Jun. 1993, pp. 199-220.
Gruber, Thomas R., “Automated Knowledge Acquisition for Strategic Knowledge”, Machine Learning, vol. 4, 1989, pp. 293-336.
Gruber, Thomas R., “Interactive Acquisition of Justifications: Learning “Why” by Being Told “What””, Knowledge Systems Laboratory, Technical Report KSL 91-17, Original Oct. 1990, Revised Feb. 1991, 24 pages.
Gruber, Thomas R., “Toward Principles for the Design of Ontologies used for Knowledge Sharing”, International Journal of Human-Computer Studies, vol. 43, No. 5-6, Nov. 1995, pp. 907-928.
Gruber, Thomas R., et al., U.S. Appl. No. 61/186,414, filed Jun. 12, 2009 titled “System and Method for Semantic Auto-Completion” 13 pages.
Gruber, Thomas R., et al., U.S. Appl. No. 61/493,201, filed Jun. 3, 2011 titled “Generating and Processing Data Items That Represent Tasks to Perform”, 68 pages.
Gruber, Thomas R., et al., U.S. Appl. No. 61/657,744, filed Jun. 9, 2012 titled “Automatically Adapting User Interfaces For Hands-Free Interaction”, 40 pages.
Gruber, Thomas R., et al., U.S. Appl. No. 07/976,970, filed Nov. 16, 1992 titled “Status Bar for Application Windows”.
Gruber, Tom, “(Avoiding) The Travesty of the Commons”, Presentation at NPUC, New Paradigms for User Computing, IBM Almaden Research Center, Jul. 24, 2006, 52 pages.
Gruber, Tom, “2021: Mass Collaboration and the Really New Economy”, TNTY Futures, vol. 1, No. 6, Available online at <http://tomgruber.org/writing/tnty2001.htm>, Aug. 2001, 5 pages.
Gruber, Tom, “Big Think Small Screen: How Semantic Computing in the Cloud will Revolutionize the Consumer Experience on the Phone”, Keynote Presentation at Web 3.0 Conference, Jan. 2010, 41 pages.
Gruber, Tom, “Collaborating Around Shared Content on the WWW, W3C Workshop on WWW and Collaboration”, available at <http://www.w3.org/Collaboration/Workshop/Proceedings/P9.html>, Sep. 1995, 1 page.
Gruber, Tom, “Collective Knowledge Systems: Where the Social Web Meets the Semantic Web”, Web Semantics: Science, Services and Agents on the World Wide Web, 2007, pp. 1-19.
Gruber, Tom, “Despite Our Best Efforts, Ontologies are not the Problem”, AAAI Spring Symposium, Available online at <http://tomgruber.org/writing/aaai-ss08.htm>, Mar. 2008, pp. 1-40.
Gruber, Tom, “Enterprise Collaboration Management with Intraspect”, Intraspect Technical White Paper, Jul. 2001, pp. 1-24.
Gruber, Tom, “Every Ontology is a Treaty—A Social Agreement-Among People with Some Common Motive in Sharing”, Official Quarterly Bulletin of AIS Special Interest Group on Semantic Web and Information Systems, vol. 1, No. 3, 2004, pp. 1-5.
Gruber, Tom, “Helping Organizations Collaborate, Communicate, and Learn”, Presentation to NASA Ames Research, Available online at <http://tomgruber.org/writing/organizational-intelligence-talk.htm>, Mar.-Oct. 2003, 30 pages.
Gruber, Tom, “Intelligence at the Interface: Semantic Technology and the Consumer Internet Experience”, Presentation at Semantic Technologies Conference, Available online at <http://tomgruber.org/writing/semtech08.htm>, May 20, 2008, pp. 1-40.
Gruber, Tom, “It Is What It Does: The Pragmatics of Ontology for Knowledge Sharing”, Proceedings of the International CIDOC CRM Symposium, Available online at <http://tomgruber.org/writing/cidoc-ontology.htm>, Mar. 26, 2003, 21 pages.
Gruber, Tom, “Ontologies, Web 2.0 and Beyond”, Ontology Summit, Available online at <http://tomgruber.org/writing/ontolog-social-web-keynote.htm>, Apr. 2007, 17 pages.
Gruber, Tom, “Ontology of Folksonomy: A Mash-Up of Apples and Oranges”, Int'l Journal on Semantic Web & Information Systems, vol. 3, No. 2, 2007, 7 pages.
Gruber, Tom, “Siri, A Virtual Personal Assistant-Bringing Intelligence to the Interface”, Semantic Technologies Conference, Jun. 16, 2009, 21 pages.
Gruber, Tom, “TagOntology”, Presentation to Tag Camp, Oct. 29, 2005, 20 pages.
Gruber, Tom, “Where the Social Web Meets the Semantic Web”, Presentation at the 5th International Semantic Web Conference, Nov. 2006, 38 pages.
Gruhn et al., “A Research Perspective on Computer-Assisted Office Work”, IBM Systems Journal, vol. 18, No. 3, 1979, pp. 432-456.
Guay, Matthew, “Location-Driven Productivity with Task Ave”, available at <http://iphone.appstorm.net/reviews/productivity/location-driven-productivity-with-task-ave/>, Feb. 19, 2011, 7 pages.
Guida et al., “NLI: A Robust Interface for Natural Language Person-Machine Communication”, International Journal of Man-Machine Studies, vol. 17, 1982, 17 pages.
Guim, Mark, “How to Set a Person-Based Reminder with Cortana”, available at <http://www.wpcentral.com/how-to-person-based-reminder-cortana>, Apr. 26, 2014, 15 pages.
Gurevych et al., “Semantic Coherence Scoring Using an Ontology”, North American Chapter of the Association for Computational Linguistics Archive, Proceedings of the 2003 Conference of the North American Chapter of the Association for Computational Linguistics on Human Language Technology, May 27, 2003, 8 pages.
Guzzoni et al., “A Unified Platform for Building Intelligent Web Interaction Assistants”, Proceedings of the 2006 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology, Computer Society, 2006, 4 pages.
Guzzoni et al., “Active, A Platform for Building Intelligent Operating Rooms”, Surgetica 2007 Computer-Aided Medical Interventions: Tools and Applications, 2007, pp. 191-198.
Guzzoni et al., “Active, A platform for Building Intelligent Software”, Computational Intelligence, available at <http://www.informatik.uni-trier.del-ley/pers/hd/g/Guzzoni:Didier >, 2006, 5 pages.
Guzzoni et al., “Active, A Tool for Building Intelligent User Interfaces”, ASC 2007, Palma de Mallorca, Aug. 2007, 6 pages.
Guzzoni et al., “Many Robots Make Short Work”, AAAI Robot Contest, SRI International, 1996, 9 pages.
Guzzoni et al., “Modeling Human-Agent Interaction with Active Ontologies”, AAAI Spring Symposium, Interaction Challenges for Intelligent Assistants, Stanford University, Palo Alto, California, 2007, 8 pages.
Guzzoni, D., “Active: A Unified Platform for Building Intelligent Assistant Applications”, Oct. 25, 2007, 262 pages.
Haas et al., “An Approach to Acquiring and Applying Knowledge”, SRI international, Nov. 1980, 22 pages.
Hadidi et al., “Student's Acceptance of Web-Based Course Offerings: An Empirical Assessment”, Proceedings of the Americas Conference on Information Systems(AMCIS), 1998, 4 pages.
Haga et al., “A Usability Survey of a Contents-Based Video Retrieval System by Combining Digital Video and an Electronic Bulletin Board”, The Internet and Higher Education, vol. 8, No. 3, 2005, pp. 251-262.
Hain et al., “The Papageno TTS System”, Siemens AG, Corporate Technology, Munich, Germany TC-STAR Workshop, 2006, 6 pages.
Haitsma et al., “A Highly Robust Audio Fingerprinting System”, In Proceedings of the International Symposium on Music Information Retrieval (ISMIR), 2002, 9 pages.
Halbert, D. C., “Programming by Example”, Dept. Electrical Engineering and Comp. Sciences, University of California, Berkley, Nov. 1984, pp. 1-76.
Hall, William S., “Adapt Your Program for Worldwide Use with Windows.TM. Internationalization Support”, Microsoft Systems Journal, vol. 6, No. 6, Nov./Dec. 1991, pp. 29-58.
Haoui et al., “Embedded Coding of Speech: A Vector Quantization Approach”, (Proceedings of the IEEE International Acoustics, Speech and Signal Processing Conference, Mar. 1985), as reprinted in Vector Quantization (IEEE Press, 1990), 1990, pp. 297-299.
Hardwar, Devindra, “Driving App Waze Builds its own Siri for Hands-Free Voice Control”, Available online at <http://venturebeat.com/2012/02/09/driving-app-waze-builds-its-own-siri-for-hands-free-voice-control/>, retrieved on Feb. 9, 2012, 4 pages.
Harris, F. J., “On the Use of Windows for Harmonic Analysis with the Discrete Fourier Transform”, In Proceedings of the IEEE, vol. 66, No. 1, Jan. 1978, 34 pages.
Hartson et al., “Advances in Human-Computer Interaction”, Chapters 1, 5, and 6, vol. 3, 1992, 121 pages.
Hashimoto, Yoshiyuki, “Simple Guide for iPhone Siri, Which Can Be Operated with Your Voice”, Shuwa System Co., Ltd., vol. 1, Jul. 5, 2012, pp. 8, 130, 131.
Hawkins et al., “Hierarchical Temporal Memory: Concepts, Theory and Terminology”, Numenta, Inc., Mar. 27, 2007, 20 pages.
Hayashi et al., “Internet Information Navigation Service TITAN”, NTT Technology Journal, JPN, vol. 8, No. 8, Aug. 1996, pp. 20-23.
He et al., “Personal Security Agent: KQML-Based PKI”, The Robotics Institute, Carnegie-Mellon University, Paper, 1997, 14 pages.
Headset Button Controller v7.3 APK Full APP Download for Android, Blackberry, iPhone, 11 pages.
Hear voice from Google translate, Available on URL:https://www.youtube.com/watch?v=18AvMhFqD28, Jan. 28, 2011, 1 page.
Heger et al., “KNOWBOT: An Adaptive Data Base Interface”, Nuclear Science and Engineering, V. 107, No. 2, Feb. 1991, pp. 142-157.
Helm et al., “Building Visual Language Parsers”, Proceedings of CHI'91, Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, 1991, 8 pages.
Hendrickson, Bruce, “Latent Semantic Analysis and Fiedler Retrieval”, Linear Algebra and its Applications, vol. 421, 2007, pp. 345-355.
Hendrix et al., “Developing a Natural Language Interface to Complex Data”, ACM Transactions on Database Systems, vol. 3, No. 2, Jun. 1978, pp. 105-147.
Hendrix et al., “The Intelligent Assistant: Technical Considerations Involved in Designing Q&A's Natural-Language Interface”, Byte Magazine, Issue 14, Dec. 1987, 1 page.
Hendrix et al., “Transportable Natural-Language Interfaces to Databases”, SRI International, Technical Note 228, Apr. 30, 1981, 18 pages.
Hendrix, Gary G., “Human Engineering for Applied Natural Language Processing”, SRI International, Technical Note 139, Feb. 1977, 27 pages.
Hendrix, Gary G., “Klaus: A System for Managing Information and Computational Resources”, SRI International, Technical Note 230, Oct. 1980, 34 pages.
Hendrix, Gary G., “Lifer: A Natural Language Interface Facility”, SRI Stanford Research Institute, Technical Note 135, Dec. 1976, 9 pages.
Hendrix, Gary G., “Natural-Language Interface”, American Journal of Computational Linguistics, vol. 8, No. 2, Apr.-Jun. 1982, pp. 56-61.
Hendrix, Gary G., “The Lifer Manual: A Guide to Building Practical Natural Language Interfaces”, SRI International, Technical Note 138, Feb. 1977, 76 pages.
Henrich et al., “Language Identification for the Automatic Grapheme-To-Phoneme Conversion of Foreign Words in a German Text-To-Speech System”, Proceedings of the European Conference on Speech Communication and Technology, vol. 2, Sep. 1989, pp. 220-223.
Hermansky, H., “Perceptual Linear Predictive (PLP) Analysis of Speech”, Journal of the Acoustical Society of America, vol. 87, No. 4, Apr. 1990, 15 pages.
Hermansky, H., “Recognition of Speech in Additive and Convolutional Noise Based on Rasta Spectral Processing”, Proceedings of IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP'93), Apr. 1993, 4 pages.
Heyer et al., “Exploring Expression Data: Identification and Analysis of Coexpressed Genes”, Genome Research, vol. 9, 1999, pp. 1106-1115.
Hill, R. D., “Some Important Features and Issues in User Interface Management System”, Dynamic Graphics Project, University of Toronto, CSRI, vol. 21, No. 2, Apr. 1987, pp. 116-120.
Hinckley et al., “A Survey of Design Issues in Spatial Input”, UIST '94 Proceedings of the 7th Annual ACM Symposium on User Interface Software and Technology, 1994, pp. 213-222.
Hiroshi, “TeamWork Station: Towards a Seamless Shared Workspace”, NTT Human Interface Laboratories, CSCW 90 Proceedings, Oct. 1990, pp. 13-26.
Hirschman et al., “Multi-Site Data Collection and Evaluation in Spoken Language Understanding”, Proceedings of the Workshop on Human Language Technology, 1993, pp. 19-24.
Hobbs et al., “Fastus: A System for Extracting Information from Natural-Language Text”, SRI International, Technical Note 519, Nov. 19, 1992, 26 pages.
Hobbs et al., “Fastus: Extracting Information from Natural-Language Texts”, SRI International, 1992, pp. 1-22.
Hobbs, Jerry R., “Sublanguage and Knowledge”, SRI International, Technical Note 329, Jun. 1984, 30 pages.
Hodjat et al., “Iterative Statistical Language Model Generation for use with an Agent-Oriented Natural Language Interface”, Proceedings of HCI International, vol. 4, 2003, pp. 1422-1426.
Hoehfeld et al., “Learning with Limited Numerical Precision Using the Cascade-Correlation Algorithm”, IEEE Transactions on Neural Networks, vol. 3, No. 4, Jul. 1992, 18 pages.
Holmes, “Speech System and Research”, 1955, pp. 129-135, 152-153.
Holmes, J. N., “Speech Synthesis and Recognition-Stochastic Models for Word Recognition”, Published by Chapman & Hall, London, ISBN 0 412 534304, 1998, 7 pages.
Hon et al., “CMU Robust Vocabulary-Independent Speech Recognition System”, IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP-91), Apr. 1991, 4 pages.
Hon et al., “Towards Large Vocabulary Mandarin Chinese Speech Recognition”, Conference on Acoustics, Speech, and Signal Processing, ICASSP-94, IEEE International, vol. 1, Apr. 1994, pp. 545-548.
Hopper, Andy, “Pandora—An Experimental System for Multimedia Applications”, Olivetti Research Laboratory, Apr. 1990, pp. 19-34.
Horvitz et al., “Handsfree Decision Support: Toward a Non-invasive Human-Computer Interface”, Proceedings of the Symposium on Computer Applications in Medical Care, IEEE Computer Society Press, 1995, p. 955.
Horvitz et al., “In Pursuit of Effective Handsfree Decision Support: Coupling Bayesian Inference, Speech Understanding, and User Models”, 1995, 8 pages.
Howard, John H., “(Abstract) An Overview of the Andrew File System”, Information Technology Center, Carnegie Mellon University; (CMU-ITC-88-062) To Appear in a future issue of the ACM Transactions on Computer Systems, 1988, pp. 1-6.
Huang et al., “A Novel Approach to Robust Speech Endpoint Detection in Car Environments”, Acoustics, Speech, And Signal Processing 2000, ICASSP '00, Proceeding S. 2000 IEEE International Conference on Jun. 5-9, 2000, vol. 3, Jun. 5, 2000, pp. 1751-1754.
Huang et al., “Real-Time Software-Based Video Coder for Multimedia Communication Systems”, Department of Computer Science and Information Engineering, 1993, 10 pages.
Huang et al., “The SPHINX-II Speech Recognition System: An Overview”, Computer, Speech and Language, vol. 7, No. 2, 1993, 14 pages.
Hukin, R. W., “Testing an Auditory Model by Resynthesis”, European Conference on Speech Communication and Technology, Sep. 26-29, 1989, pp. 243-246.
Hunt, “Unit Selection In A Concatenative Speech Synthesis System Using A Large Speech Database”, Copyright 1996 IEEE. “To appear in Proc. ICASSP-96, May 7-10, Atlanta, GA” ATR Interpreting Telecommunications Research Labs, Kyoto Japan, 1996, pp. 373-376.
IAP Sports Lingo 0x09 Protocol V1.00, May 1, 2006, 17 pages.
IBM Corporation, “Simon Says ‘Here’s How”, Users Manual, 1994, 3 pages.
IBM, “Integrated Audio-Graphics User Interface”, IBM Technical Disclosure Bulletin, vol. 33, No. 11, Apr. 1991, 4 pages.
IBM, “Speech Editor”, IBM Technical Disclosure Bulletin, vol. 29, No. 10, Mar. 10, 1987, 3 pages.
IBM, “Speech Recognition with Hidden Markov Models of Speech Waveforms”, IBM Technical Disclosure Bulletin, vol. 34, No. 1, Jun. 1991, 10 pages.
IBM, “Why Buy: ThinkPad”, available at <http://www.pc.ibm.com/us/thinkpad/easeofuse.html>, retrieved on Dec. 19, 2002, 2 pages.
IChat AV, “Video Conferencing for the Rest of US”, Apple—Mac OS X—iChat AV, available at <http://www.apple.com/macosx/features/ichat/>, retrieved on Apr. 13, 2006, 3 pages.
id3.org, “id3v2.4.0-Frames”, available at <http://id3.org/id3v2-4.0-frames?action=print>, retrieved on Jan. 22, 2015, 41 pages.
IEEE 1394 (Redirected from Firewire, Wikipedia, The Free Encyclopedia, available at <http://www.wikipedia.org/wiki/Firewire>, retrieved on Jun. 8, 2003, 2 pages.
Interactive Voice, available at <http://www.helloivee.com/company/>, retrieved on Feb. 10, 2014, 2 pages.
International Preliminary Report on Patentability received for PCT Patent Application No. PCT/GB2009/051684, dated Jun. 23, 2011, 10 pages.
International Preliminary Report on Patentability received for PCT Patent Application No. PCT/US1993/012637, dated Apr. 10, 1995, 7 pages.
International Preliminary Report on Patentability received for PCT Patent Application No. PCT/US1993/012666, dated Mar. 1, 1995, 5 pages.
International Preliminary Report on Patentability received for PCT Patent Application No. PCT/US1994/011011, dated Feb. 28, 1996, 4 pages.
International Preliminary Report on Patentability received for PCT Patent Application No. PCT/US1995/008369, dated Oct. 9, 1996, 4 pages.
International Preliminary Report on Patentability received for PCT Patent Application No. PCT/US2004/002873, dated Feb. 1, 2006, 5 pages.
International Preliminary report on Patentability received for PCT Patent Application No. PCT/US2004/016519, dated Jan. 23, 2006, 12 pages.
International Preliminary Report on Patentability received for PCT Patent Application No. PCT/US2005/030234, dated Mar. 20, 2007, 9 pages.
International Preliminary Report on Patentability received for PCT Patent Application No. PCT/US2008/000042, dated Jul. 7, 2009, 6 pages.
International Preliminary Report on Patentability received for PCT Patent Application No. PCT/US2008/000043, dated Jul. 7, 2009, 8 pages.
International Preliminary Report on Patentability received for PCT Patent Application No. PCT/US2008/000047, dated Jul. 7, 2009, 8 pages.
International Preliminary Report on Patentability received for PCT Patent Application No. PCT/US2009/051954, dated Mar. 24, 2011, 8 pages.
International Preliminary Report on Patentability received for PCT Patent Application No. PCT/US2009/055577, completed on Aug. 6, 2010, 12 pages.
International Preliminary Report on Patentability received for PCT Patent Application No. PCT/US2010/037378, dated Dec. 6, 2011, 9 pages.
International Preliminary Report on Patentability received for PCT Patent Application No. PCT/US2011/020350, dated Jul. 17, 2012, 12 pages.
International Preliminary Report on Patentability received for PCT Patent Application No. PCT/US2011/020825, dated Jan. 13, 2012, 17 pages.
International Preliminary Report on Patentability received for PCT Patent Application No. PCT/US2011/020861, dated Aug. 2, 2012, 11 pages.
International Preliminary Report on Patentability received for PCT Patent Application No. PCT/US2011/037014, dated Dec. 13, 2012, 10 pages.
International Preliminary Report on Patentability received for PCT Patent Application No. PCT/US2012/029810, dated Oct. 3, 2013, 9 pages.
International Preliminary Report on Patentability received for PCT Patent Application No. PCT/US2012/034028, dated Oct. 31, 2013, 7 pages.
International Preliminary Report on Patentability received for PCT Patent Application No. PCT/US2012/040571, dated Dec. 19, 2013, 10 pages.
International Preliminary Report on Patentability received for PCT Patent Application No. PCT/US2012/040801, dated Dec. 19, 2013, 16 pages.
International Preliminary Report on Patentability received for PCT Patent Application No. PCT/US2012/040931, dated Dec. 18, 2014, 9 pages.
International Preliminary Report on Patentability received for PCT Patent Application No. PCT/US2012/043098, dated Jan. 9, 2014, 8 pages.
International Preliminary Report on Patentability received for PCT Patent Application No. PCT/US2012/043100, dated Jan. 9, 2014, 7 pages.
International Preliminary Report on Patentability received for PCT Patent Application No. PCT/US2012/056382, dated Apr. 10, 2014, 9 pages.
International Preliminary Report on Patentability received for PCT Patent Application No. PCT/US2013/028412, dated Sep. 12, 2014, 12 pages.
International Preliminary Report on Patentability received for PCT Patent Application No. PCT/US2013/028920, dated Sep. 18, 2014, 11 pages.
International Preliminary Report on Patentability received for PCT Patent Application No. PCT/US2013/029156, dated Sep. 9, 2014, 7 pages.
International Preliminary Report on Patentability received for PCT Patent Application No. PCT/US2013/041225, dated Nov. 27, 2014, 9 pages.
International Preliminary Report on Patentability received for PCT Patent Application No. PCT/US2013/041233, dated Nov. 18, 2014, 8 pages.
International Preliminary Report on Patentability received for PCT Patent Application No. PCT/US2013/044574, dated Dec. 9, 2014, 8 pages.
International Preliminary Report on Patentability received for PCT Patent Application No. PCT/US2013/044834, dated Dec. 9, 2014, 9 pages.
International Preliminary Report on Patentability received for PCT Patent Application No. PCT/US2013/047659, dated Dec. 31, 2014, 15 pages.
International Preliminary Report on Patentability received for PCT Patent Application No. PCT/US2013/047668, dated Jan. 8, 2015, 13 pages.
International Preliminary Report on Patentability received for PCT Patent Application No. PCT/US2013/052558, dated Feb. 12, 2015, 12 pages.
International Preliminary Report on Patentability received for PCT Patent Application No. PCT/US2013/058916, dated Mar. 19, 2015, 8 pages.
International Preliminary Report on Patentability received for PCT Patent Application No. PCT/US2013/060121, dated Apr. 2, 2015, 6 pages.
International Preliminary Report on Patentability received for PCT Patent Application No. PCT/US2014/015418, dated Aug. 20, 2015, 12 pages.
International Preliminary Report on Patentability received for PCT Patent Application No. PCT/US2014/016988, dated Sep. 3, 2015, 8 pages.
International Preliminary Report on Patentability received for PCT Patent Application No. PCT/US2014/023822, dated Sep. 24, 2015, 12 pages.
International Preliminary Report on Patentability received for PCT Patent Application No. PCT/US2014/023826, dated Sep. 24, 2015, 9 pages.
International Preliminary Report on Patentability received for PCT Patent Application No. PCT/US2014/026871, dated Sep. 24, 2015, 7 pages.
International Preliminary Report on Patentability received for PCT Patent Application No. PCT/US2014/026873, dated Sep. 24, 2015, 9 pages.
International Preliminary Report on Patentability received for PCT Patent Application No. PCT/US2014/028785, dated Sep. 24, 2015, 15 pages.
International Preliminary Report on Patentability received for PCT Patent Application No. PCT/US2014/028950, dated Sep. 24, 2015, 8 pages.
International Preliminary Report on Patentability received for PCT Patent Application No. PCT/US2014/029050, dated Sep. 24, 2015, 7 pages.
International Preliminary Report on Patentability received for PCT Patent Application No. PCT/US2014/029562, dated Sep. 24, 2015, 16 pages.
International Preliminary Report on Patentability received for PCT Patent Application No. PCT/US2014/040393, dated Dec. 8, 2015, 15 pages.
International Preliminary Report on Patentability received for PCT Patent Application No. PCT/US2014/040394, dated Dec. 23, 2015, 7 pages.
International Preliminary Report on Patentability received for PCT Patent Application No. PCT/US2014/040397, dated Dec. 17, 2015, 8 pages.
International Preliminary Report on Patentability received for PCT Patent Application No. PCT/US2014/040401, dated Dec. 8, 2015, 6 pages.
International Preliminary Report on Patentability received for PCT Patent Application No. PCT/US2014/040403 dated Dec. 23, 2015, 7 pages.
International Preliminary Report on Patentability received for PCT Patent Application No. PCT/US2014/040961, dated Dec. 17, 2015, 20 pages.
International Preliminary Report on Patentability received for PCT Patent Application No. PCT/US2014/041159, dated Dec. 17, 2015, 8 pages.
International Preliminary Report on Patentability received for PCT Patent Application No. PCT/US2014/041173, dated Dec. 17, 2015, 9 pages.
International Preliminary Report on Patentability received for PCT Patent Application No. PCT/US2014/049568, dated Feb. 18, 2016, 10 pages.
International Preliminary Report on Patentability received for PCT Patent Application No. PCT/US2015/023593, dated Dec. 15, 2016, 12 pages.
International Preliminary Report on Patentability received for PCT Patent Application No. PCT/US2015/029554, dated Dec. 29, 2016, 8 pages.
International Preliminary Report on Patentability Received for PCT Patent Application No. PCT/US2015/032470, dated Dec. 15, 2016, 9 pages.
International Preliminary Report on Patentability received for PCT Patent Application No. PCT/US2015/032724, dated Dec. 15, 2016, 8 pages.
International Preliminary Report on Patentability received for PCT Patent Application No. PCT/US2015/033051, dated Dec. 15, 2016, 10 pages.
International Search Report & Written Opinion received for PCT Patent Application No. PCT/US2016/021410, dated Jul. 26, 2016, 19 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US16/23312, dated Jun. 27, 2016, 7 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US1994/011011, dated Feb. 8, 1995, 3 pages (International Search Report only).
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2004/002873, dated Oct. 13, 2005, 7 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2004/016519, dated Nov. 3, 2005, 6 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2005/030234, dated Mar. 17, 2006, 11 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2005/038819, dated Apr. 5, 2006, 12 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2006/048669, dated Jul. 2, 2007, 12 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2006/048670, dated May 21, 2007, 11 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2006/048753, dated Jun. 19, 2007, 15 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2007/026243, dated Mar. 31, 2008, 10 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2007/088872, dated May 8, 2008, 8 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2007/088873, dated May 8, 2008, 7 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2008/000032, dated Jun. 12, 2008, 7 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2008/000042, dated May 21, 2008, 7 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2008/000043, dated Oct. 10, 2008, 12 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2008/000045, dated Jun. 12, 2008, 7 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2008/000047, dated Sep. 11, 2008, 12 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2008/000059, dated Sep. 19, 2008, 18 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2008/000061, dated Jul. 1, 2008, 13 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2009/051954, dated Oct. 30, 2009, 10 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2009/055577, dated Jan. 26, 2010, 9 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2010/037378, dated Aug. 25, 2010, 14 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2011/020350, dated Jun. 30, 2011, 17 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2011/020825, dated Mar. 18, 2011, 9 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2011/020861, dated Nov. 29, 2011, 12 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2012/029810, dated Aug. 17, 2012, 11 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2012/034028, dated Jun. 11, 2012, 9 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2012/040571, dated Nov. 16, 2012, 14 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2012/040801, dated Oct. 22, 2012, 20 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2012/040931, dated Feb. 1, 2013, 4 pages (International Search Report only).
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2012/043098, dated Nov. 14, 2012, 9 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2012/043100, dated Nov. 15, 2012, 8 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2012/056382, dated Dec. 20, 2012, 11 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2013/028412, dated Sep. 26, 2013, 17 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2013/028920, dated Jun. 27, 2013, 14 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2013/029156, dated Jul. 15, 2013, 9 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2013/040971, dated Nov. 12, 2013, 11 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2013/041225, dated Aug. 23, 2013, 3 pages (International Search Report only).
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2013/044574, dated Sep. 27, 2013, 12 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2013/044834, dated Dec. 20, 2013, 13 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2013/047659, dated Jul. 7, 2014, 25 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2013/047668, dated Feb. 13, 2014, 17 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2013/052558, dated Jan. 30, 2014, 15 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2013/058916, dated Sep. 8, 2014, 10 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2013/060121, dated Dec. 6, 2013, 8 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2014/015418, dated Aug. 26, 2014, 17 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2014/016988, dated Apr. 29, 2014, 10 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2014/023822, dated Sep. 25, 2014, 14 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2014/023826, dated Oct. 9, 2014, 13 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2014/026871, dated Jul. 23, 2014, 9 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2014/026873, dated Jan. 5, 2015, 11 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2014/028785, dated Oct. 17, 2014, 23 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2014/028950, dated Nov. 25, 2014, 10 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2014/029050, dated Jul. 31, 2014, 9 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2014/029562, dated Sep. 18, 2014, 21 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2014/040393, dated Dec. 8, 2014, 23 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2014/040394, dated Aug. 8, 2014, 11 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2014/040397, dated Aug. 27, 2014, 12 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2014/040401, dated Sep. 4, 2014, 10 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2014/040403, dated Sep. 23, 2014, 9 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2014/040961, dated Mar. 10, 2015, 5 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2014/041159, dated Sep. 26, 2014, 10 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2014/041173, dated Sep. 10, 2014, 11 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2014/049568, dated Nov. 14, 2014, 12 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2014/053951, dated Dec. 8, 2014, 11 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2014/053957, dated Feb. 19, 2015, 11 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2014/053958, dated Feb. 19, 2015, 10 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2015/019320, dated Jul. 2, 2015, 14 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2015/019321, dated Jun. 3, 2015, 11 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2015/019322, dated Jun. 18, 2015, 16 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2015/023089, dated Aug. 20, 2015, 16 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2015/023097, dated Jul. 7, 2015, 15 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2015/023593, dated Aug. 14, 2015, 16 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2015/025188, dated Jun. 23, 2015, 11 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2015/029554, dated Jul. 16, 2015, 11 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2015/032470, dated Oct. 1, 2015, 13 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2015/032724, dated Jul. 27, 2015, 11 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2015/033051, dated Aug. 5, 2015, 14 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2015/047062, dated Jan. 13, 2016, 25 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2015/047064, dated Nov. 13, 2015, 13 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2015/047281, dated Dec. 17, 2015, 19 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2015/047553, dated Jan. 5, 2016, 10 pages.
International Search Report and Written opinion received for PCT Patent Application No. PCT/US2015/047583, dated Feb. 3, 2016, 11 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2015/047584, dated Nov. 9, 2015, 10 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2015/053365, dated Mar. 10, 2016, 20 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2015/053366, dated Apr. 26, 2016, 16 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2016/021103, dated Jun. 8, 2016, 15 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2016/021104, dated Jun. 8, 2016, 15 pages.
International Search Report and Written opinion received for PCT Patent Application No. PCT/US2016/021409, dated May 26, 2016, 22 pages.
International Search report and Written Opinion received for PCT Patent Application No. PCT/US2016/024666, dated Jun. 10, 2016, 13 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2016/025404, dated Jun. 24, 2016, 21 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2016/025407, dated Jun. 23, 2016, 18 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2016/025408, dated Aug. 11, 2016, 19 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2016/031059, dated Aug. 8, 2016, 11 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2016/031549, dated Aug. 5, 2016, 35 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2016/031550, dated Aug. 4, 2016, 13 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2016/035105, dated Aug. 29, 2016, 25 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2016/035107, dated Aug. 31, 2016, 26 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2016/035112, dated Aug. 22, 2016, 21 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2016/043005, dated Oct. 7, 2016, 17 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2016/047215, dated Oct. 24, 2016, 18 pages.
International Search Report and Written Opinion Received for PCT Patent Application No. PCT/US2016/051151, dated Nov. 22, 2016, 10 pages.
International Search Report and Written Opinion Received for PCT Patent Application No. PCT/US2016/051895, dated Nov. 18, 2016, 30 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2016/053313, dated Dec. 7, 2016, 23 pages.
International Search Report and Written Opinion received for PCT Patent Application No. PCT/US2016/053445, dated Dec. 6, 2016, 11 pages.
International Search Report received for PCT Patent Application No. PCT/GB2009/051684, dated Mar. 12, 2010, 4 pages.
International Search Report received for PCT Patent Application No. PCT/US1993/012666, dated Nov. 9, 1994, 8 pages.
International Search Report received for PCT Patent Application No. PCT/US1994/000687, dated Jun. 3, 1994, 1 page.
International Search Report received for PCT Patent Application No. PCT/US1994/00077, dated May 25, 1994, 2 pages.
International Search Report received for PCT Patent Application No. PCT/US1995/008369, dated Nov. 8, 1995, 6 pages.
International Search Report received for PCT Patent Application No. PCT/US1995/013076, dated Feb. 2, 1996, 1 page.
International Search Report received for PCT Patent Application No. PCT/US1996/01002, dated Oct. 30, 1996, 4 pages.
International Search Report received for PCT Patent Application No. PCT/US2002/024669, dated Nov. 5, 2002, 3 pages.
International Search Report received for PCT Patent Application No. PCT/US2002/024670, dated Sep. 26, 2002, 3 pages.
International Search Report received for PCT Patent Application No. PCT/US2002/033330, dated Feb. 4, 2003, 6 pages.
International Search Report received for PCT Patent Application No. PCT/US2005/046797, dated Nov. 24, 2006, 6 pages.
International Search Report received for PCT Patent Application No. PCT/US2011/037014, dated Oct. 4, 2011, 6 pages.
International Search Report received for PCT Patent Application No. PCT/US2013/041233, dated Nov. 22, 2013, 3 pages.
Intraspect Software, “The Intraspect Knowledge Management Solution: Technical Overview”, available at <http://tomgruber.org/writing/intraspect-whitepaper-1998.pdf>, 1998, 18 pages.
Invitation to Pay Additional Fee Received for PCT Patent Application No. PCT/US2016/047184, dated Dec. 6, 2016, 9 pages.
Invitation to Pay Additional Fee Received for PCT Patent Application No. PCT/US2016/051927, dated Nov. 15, 2016, 2 pages.
Invitation to Pay Additional Fee Received for PCT Patent Application No. PCT/US2016/052440, dated Nov. 15, 2016, 2 pages.
Invitation to Pay Additional Fee Received for PCT Patent Application No. PCT/US2016/059953, dated Dec. 29, 2016, 2pages.
Invitation to Pay Additional Fees and Partial International Search Report received for PCT Patent Application No. PCT/US2004/016519, dated Aug. 4, 2005, 6 pages.
Invitation to Pay Additional Fees and Partial International Search Report received for PCT Patent Application No. PCT/US2005/046797, dated Jul. 3, 2006, 6 pages.
Invitation to Pay Additional Fees and Partial International Search Report received for PCT Patent Application No. PCT/US2006/048738, dated Jul. 10, 2007, 4 pages.
Invitation to Pay Additional Fees and Partial International Search Report received for PCT Patent Application No. PCT/US2011/020350, dated Apr. 14, 2011, 5 pages.
Invitation to Pay Additional Fees and Partial International Search Report received for PCT Patent Application No. PCT/US2015/023089, dated Jun. 17, 2015, 7 pages.
Invitation to Pay Additional Fees received for PCT Application No. PCT/US2016/021410, dated Apr. 28, 2016, 2 pages.
Invitation to Pay Additional Fees received for PCT Patent Application No. PCT/US2008/000043, dated Jun. 27, 2008, 4 pages.
Invitation to Pay Additional Fees received for PCT Patent Application No. PCT/US2008/000047, dated Jul. 4, 2008, 4 pages.
Invitation to Pay Additional Fees received for PCT Patent Application No. PCT/US2011/037014, dated Aug. 2, 2011, 6 pages.
Invitation to Pay Additional Fees received for PCT Patent Application No. PCT/US2012/040801, dated Aug. 8, 2012, 2 pages.
Invitation to Pay Additional Fees received for PCT Patent Application No. PCT/US2013/047659, dated Feb. 27, 2014, 7 pages.
Invitation to Pay Additional Fees received for PCT Patent Application No. PCT/US2013/052558, dated Nov. 7, 2013, 6 pages.
Invitation to pay additional fees received for PCT Patent Application No. PCT/US2014/029562, dated Jul. 4, 2014, 7 pages.
Invitation to Pay Additional Fees received for PCT Patent Application No. PCT/US2014/040393, dated Sep. 17, 2014, 7 pages.
Invitation to Pay Additional Fees received for PCT Patent Application No. PCT/US2014/040961, dated Jan. 14, 2015, 3 pages.
Invitation to Pay Additional Fees received for PCT Patent Application No. PCT/US2015/047281, dated Oct. 8, 2015, 6 pages.
Invitation to Pay Additional Fees received for PCT Patent Application No. PCT/US2015/053366, dated Feb. 19, 2016, 8 pages.
Invitation to Pay Additional Fees received for PCT Patent Application No. PCT/US2016/025408, dated May 13, 2016, 2 pages.
Invitation to Pay Additional Fees received for PCT Patent Application No. PCT/US2014/028785, dated Jul. 4, 2014, 7 pages.
Invitation to pay additional fees received for the PCT Patent Application No. PCT/US2014/015418, dated May 26, 2014, 5 pages.
Iowegian International, “FIR Filter Properties, DSPGuru, Digital Signal Processing Central”, available at <http://www.dspguru.com/dsp/faq/fir/properties> retrieved on Jul. 28, 2010, 6 pages.
Iphone Hacks, “Native iPhone MMS Application Released”, available at <http://www.iphonehacks.com/2007/12/iphone-mms-app.html>, retrieved on Dec. 25, 2007, 5 pages.
Iphonechat, “iChat for iPhone in JavaScript”, available at <http://www.publictivity.com/iPhoneChat/>, retrieved on Dec. 25, 2007, 2 pages.
Iso-Sipila et al., “Multi-Lingual Speaker-Independent Voice User Interface for Mobile Devices”, ICASSP 2006 Proceedings, IEEE International Conference on Acoustics, Speech and Signal Processing May 14, 2006, pp. 1-1081.
Issar et al., “CMU's Robust Spoken Language Understanding System”, Proceedings of Eurospeech, 1993, 4 pages.
Issar, Sunil, “Estimation of Language Models for New Spoken Language Applications”, Proceedings of 4th International Conference on Spoken language Processing, Oct. 1996, 4 pages.
Jabra Corporation, “FreeSpeak: BT200 User Manual”, 2002, 42 pages.
Jabra, “Bluetooth Headset: User Manual”, 2005, 17 pages.
Jabra, “Bluetooth Introduction”, 2004, 15 pages.
Jacobs et al., “Scisor: Extracting Information from On-Line News”, Communications of the ACM, vol. 33, No. 11, Nov. 1990, 10 pages.
Janas, Jurgen M., “The Semantics-Based Natural Language Interface to Relational Databases”, Chapter 6, Cooperative Interfaces to Information Systems, 1986, pp. 143-188.
Jawaid et al., “Machine Translation with Significant Word Reordering and Rich Target-Side Morphology”, WDS'11 Proceedings of Contributed Papers, Part I, 2011, pp. 161-166.
Jaybird, “Everything Wrong with AIM: Because We've All Thought About It”, available at <http://www.psychonoble.com/archives/articles/82.html>, May 24, 2006, 3 pages.
Jeffay et al., “Kernel Support for Live Digital Audio and Video”, In Proc. of the Second Intl. Workshop on Network and Operating System Support for Digital Audio and Video, vol. 614, Nov. 1991, pp. 10-21.
Jelinek et al., “Interpolated Estimation of Markov Source Parameters from Sparse Data”, In Proceedings of the Workshop on Pattern Recognition in Practice,, May 1980, pp. 381-397.
Jelinek, F., “Self-Organized Language Modeling for Speech Recognition”, Readings in Speech Recognition, Edited by Alex Waibel and Kai-Fu Lee, Morgan Kaufmann Publishers, Inc., ISBN: 1-55860-124-4, 1990, 63 pages.
Jennings et al., “A Personal News Service Based on a User Model Neural Network”, IEICE Transactions on Information and Systems, vol. E75-D, No. 2, Mar. 1992, 12 pages.
Jensvoll, Maja Henriette, “The Acquisition of Past Tense in English/Norwegian Bilingual Children Single versus Dual Mechanisms”, Proceedings of the 19th Scandinavian Conference of Linguistics, vol. 31, No. 3, 2003, pp. 545-557.
Ji et al., “A Method for Chinese Syllables Recognition Based upon Sub-syllable Hidden Markov Model”, 1994 International Symposium on Speech, Image Processing and Neural Networks, Hong Kong, Apr. 1994, 4 pages.
Jiang et al., “A Syllable-based Name Transliteration System”, Proc. of the 2009 Named Entities Workshop, Aug. 7, 2009, pp. 96-99.
Johnson, Jeff A., “A Comparison of User Interfaces for Panning on a Touch-Controlled Display”, CHI '95 Proceedings, 1995, 8 pages.
Johnson, Julia Ann., “A Data Management Strategy for Transportable Natural Language Interfaces”, Doctoral Thesis Submitted to the Department of Computer Science, University of British Columbia, Canada, Jun. 1989, 285 pages.
Jones, J., “Speech Recognition for Cyclone”, Apple Computer, Inc., E.R.S. Revision 2.9, Sep. 10, 1992, 93 pages.
Jouvet et al., “Evaluating Grapheme-to-phoneme Converters in Automatic Speech Recognition Context”, IEEE,, 2012,, pp. 4821-4824.
Julia et al., “http://www.speech.sri.com/demos/atis.html”, Proceedings of AAAI, Spring Symposium, 1997, 5 pages.
Julia et al., “Un Editeur Interactif De Tableaux Dessines a Main Levee (An Interactive Editor for Hand-Sketched Tables)”, Traitement du Signal, vol. 12, No. 6, 1995, pp. 619-626.
Kaeppner et al., “Architecture of HeiPhone: A Testbed for Audio/Video Teleconferencing”, IBM European Networking Center, 1993.
Kahn et al., “CoABS Grid Scalability Experiments”, Autonomous Agents and MultiAgent Systems, vol. 7, 2003, pp. 171-178.
Kamba et al., “Using Small Screen Space More Efficiently”, CHI '96 Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, Apr. 13-18, 1996, pp. 383-390.
Kamel et al., “A Graph Based Knowledge Retrieval System”, IEEE International Conference on Systems, Man and Cybernetics, 1990, pp. 269-275.
Kanda et al., “Robust Domain Selection Using Dialogue History in Multi-domain Spoken Dialogue Systems”, Journal of Information Processing Society, vol. 48, No. 5, May 15, 2007, pp. 1980-1989. (English Abstract Submitted).
Kanda et al., “Spoken Language Understanding Using Dialogue Context in Database Search Task”, Journal of Information Processing Society of Japan, vol. 47, No. 6, Jun. 15, 2016, pp. 1802-1811. (English Abstract Submitted).
Kane et al., “Slide Rule: Making Mobile Touch Screens Accessible to Blind People Using Multi-Touch Interaction Techniques”, ASSETS, Oct. 13-15, 2008, pp. 73-80.
Kang et al., “Quality Improvement of LPC-Processed Noisy Speech by Using Spectral Subtraction”, IEEE Transactions on Acoustics, Speech and Signal Processing, vol. 37, No. 6, Jun. 1989, pp. 939-942.
Karp, P. D., “A Generic Knowledge-Base Access Protocol”, Available online at <http://lecture.cs.buu.ac.th/-f50353/Document/gfp.pdf>, May 12, 1994, 66 pages.
Katz et al., “Exploiting Lexical Regularities in Designing Natural Language Systems”, Proceedings of the 12th International Conference on Computational Linguistics, 1988, pp. 1-22.
Katz et al., “REXTOR: A System for Generating Relations from Natural Language”, Proceedings of the ACL Workshop on Natural Language Processing and Information Retrieval (NLP&IR), Oct. 2000, 11 pages.
Katz, Boris, “A Three-Step Procedure for Language Generation”, Massachusetts Institute of Technology, A.I. Memo No. 599, Dec. 1980, pp. 1-40.
Katz, Boris, “Annotating the World Wide Web Using Natural Language”, Proceedings of the 5th RIAO Conference on Computer Assisted Information Searching on the Internet, 1997, 7 pages.
Katz, Boris, “Using English for Indexing and Retrieving”, Proceedings of the 1st RIAO Conference on User-Oriented Content-Based Text and Image Handling, 1988, pp. 314-332.
Katz, S. M., “Estimation of Probabilities from Sparse Data for the Language Model Component of a Speech Recognizer”, IEEE Transactions on Acoustics, Speech and Signal Processing, vol. ASSP-35, No. 3, Mar. 1987, 3 pages.
Katzenmaier et al., “Identifying the Addressee in Human-Human-Robot Interactions based on Head Pose and Speech”, Proc. ICMI ' 04, ACM, 2004, pp. 144-151.
Kawamae et al., “Study on the Structure of Index Data for Metasearch System”, Material of 38th SIG of Artificial Intelligence Foundation & 45th SIG of Knowledge Base System, JPN, Sep. 29, 1999, pp. 37-42.
Kazemzadeh et al., “Acoustic Correlates of User Response to Error in Human-Computer Dialogues”, Automatic Speech Recognition and Understanding, 2003, pp. 215-220.
Kazmucha, Allyson, “How to Send Map Locations Using iMessage”, iMore.com, Available at <http://www.imore.com/how-use-imessage-share-your-location-your-iphone>, Aug. 2, 2012, 6 pages.
Keahey et al., “Non-Linear Image Magnification”, Apr. 24, 1996, 11 pages.
Keahey et al., “Nonlinear Magnification Fields”, Proceedings of the 1997 IEEE Symposium on Information Visualization, 1997, 12 pages.
Keahey et al., “Techniques for Non-Linear Magnification Transformations”, IEEE Proceedings of Symposium on Information Visualization, Oct. 1996, pp. 38-45.
Keahey et al., “Viewing Text With Non-Linear Magnification: An Experimental Study”, Department of Computer Science, Indiana University, Apr. 24, 1996, pp. 1-9.
Kennedy, P J., “Digital Data Storage Using Video Disc”, IBM Technical Disclosure Bulletin, vol. 24, No. 2, Jul. 1981, p. 1171.
Kerr, “An Incremental String Search in C: This Data Matching Algorithm Narrows the Search Space with each Keystroke”, Computer Language, vol. 6, No. 12, Dec. 1989, pp. 35-39.
Kickstarter, “Ivee Sleek: Wi-Fi Voice-Activated Assistant”, available at <https://www.kickstarter.com/projects/ivee/ivee-sleek-wi-fi-voice-activated-assistant>, retrieved on Feb. 10, 2014, 13 pages.
Kikui, Gen-Itiro, “Identifying the Coding System and Language of On-Line Documents on the Internet”, International Conference on Computational, Aug. 1996, pp. 652-657.
Kim, E.A. S., “The Structure and Processing of Fundamental Frequency Contours”, University of Cambridge, Doctoral Thesis, Apr. 1987, 378 pages.
Kirstein et al., “Piloting of Multimedia Integrated Communications for European Researchers”, Proc. INET '93, 1993, pp. 1-12.
Kitano, H., “PhiDM-Dialog, An Experimental Speech-to-Speech Dialog Translation System”, Computer, vol. 24, No. 6, Jun. 1991, 13 pages.
Kitaoka et al., “Detection and Recognition of Correction Utterances on Misrecognition of Spoken Dialog System”, Systems and Computers in Japan, vol. 36, No. Oct. 11, 2005, pp. 24-33.
Kjelldahl et al., “Multimedia—Principles, Systems, and Applications”, Proceedings of the 1991 Eurographics Workshop on Multimedia Systems, Applications, and Interaction, Apr. 1991.
Klabbers et al., “Reducing Audible Spectral Discontinuities”, IEEE Transactions on Speech and Audio Processing, vol. 9, No. 1, Jan. 2001, 13 pages.
Klatt et al., “Linguistic Uses of Segmental Duration in English: Acoustic and Perpetual Evidence”, Journal of the Acoustical Society of America, vol. 59, No. 5, May 1976, 16 pages.
Kline et al., “Improving GUI Accessibility for People with Low Vision”, CHI '95 Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, May 7-11, 1995, pp. 114-121.
Kline et al., “UnWindows 1.0: X Windows Tools for Low Vision Users”, ACM SIGCAPH Computers and the Physically Handicapped, No. 49, Mar. 1994, pp. 1-5.
Knight et al., “Heuristic Search”, Production Systems, Artificial Intelligence, 2nd ed., McGraw-Hill, Inc., 1983-1991.
Knownav, “Knowledge Navigator”, YouTube Video available at <http://www.youtube.com/watch?v=QRH8eimU_20>, Apr. 29, 2008, 1 page.
Kohler, Joachim, “Multilingual Phone Models for Vocabulary-Independent Speech Recognition Tasks”, Speech Communication, vol. 35, No. 1-2, Aug. 2001, pp. 21-30.
Komatani et al., “Multi-domain Spoken Dialogue System with Extensibility and Robustness Against Speech Recognition Errors”, Proceedings of the 7th SIGdial Workshop on Discourse and Dialogue, Association for Computational Linguistics, Jul. 2006, pp. 9-17.
Kominek et al., “Impact of Durational Outlier Removal from Unit Selection Catalogs”, 5th ISCA Speech Synthesis Workshop, Jun. 14-16, 2004, 6 pages.
Konolige, Kurt, “A Framework for a Portable Natural-Language Interface to Large Data Bases”, SRI International, Technical Note 197, Oct. 12, 1979, 54 pages.
Kroon et al., “Pitch Predictors with High Temporal Resolution”, IEEE, vol. 2, 1990, pp. 661-664.
Kroon et al., “Quantization Procedures for the Excitation in CELP Coders”, (Proceedings of IEEE International Acoustics, Speech, and Signal Processing Conference, Apr. 1987), as reprinted in Vector Quantization (IEEE Press, 1990), 1990, pp. 320-323.
Kubala et al., “Speaker Adaptation from a Speaker-Independent Training Corpus”, International Conference on Acoustics, Speech and Signal Processing (ICASSP'90), Apr. 1990, 4 pages.
Kubala et al., “The Hub and Spoke Paradigm for CSR Evaluation”, Proceedings of the Spoken Language Technology Workshop, Mar. 1994, 9 pages.
Külekci et al., “Turkish Word Segmentation Using Morphological Analyzer”, 7th European Conference on Speech Communication and Technology, 2nd Interspeech Event, 2001, 4 pages.
Kuo et al., “A Radical-Partitioned coded Block Adaptive Neural Network Structure for Large-Volume Chinese Characters Recognition”, International Joint Conference on Neural Networks, vol. 3, Jun. 1992, pp. 597-601.
Kuo et al., “A Radical-Partitioned Neural Network System Using a Modified Sigmoid Function and a Weight-Dotted Radical Selector for Large-Volume Chinese Character Recognition VLSI”, IEEE Int. Symp. Circuits and Systems, Jun. 1994, pp. 3862-3865.
Kurlander et al., “Comic Chat”, [Online], 1996 [Retrieved on: Feb. 4, 2013], SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques, [Retrieved from: http://delivery.acm.org/10.1145/240000/237260/p225-kurlander.pdf], 1996, pp. 225-236.
Ladefoged, Peter, “A Course in Phonetics”, New York, Harcourt, Brace, Jovanovich, Second Edition, 1982.
Laface et al., “A Fast Segmental Viterbi Algorithm For Large Vocabulary Recognition”, International Conference on Acoustics, Speech, and Signal Processing, vol. 1, May 1995, pp. 560-563.
Lafferty et al., “Conditional Random Fields: Probabilistic Models for Segmenting and Labeling Sequence Data”, Proceedings of the 18th International Conference on Machine Learning, 2001, 9 pages.
Laird et al., “SOAR: An Architecture for General Intelligence”, Artificial Intelligence, vol. 33, 1987, pp. 1-64.
Lamel et al., “Generation and synthesis of Broadcast Messages”, Proceedings of ESCA-NATO Workshop: Applications of Speech Technology, Sep. 1, 1993, 4 pages.
Lamping et al., “Laying Out and Visualizing Large Trees Using a Hyperbolic Space”, Proceedings of the ACM Symposium on User Interface Software and Technology, Nov. 1994, pp. 13-14.
Lamping et al., “Visualizing Large Trees Using the Hyperbolic Browser”, Apple Inc., Video Clip, MIT Media Library, on a CD, 1995.
Langley et al., “A Design for the ICARUS Architechture”, SIGART Bulletin, vol. 2, No. 4, 1991, pp. 104-109.
Lantz et al., “Towards a Universal Directory Service”, Departments of Computer Science and Electrical Engineering, Stanford University, 1985, pp. 250-260.
Lantz, Keith, “An Experiment in Integrated Multimedia Conferencing”, 1986, pp. 267-275.
Larks, “Intelligent Software Agents”, available at <http://www.cs.cmu.edu/˜softagents/larks.html> retrieved on Mar. 15, 2013, 2 pages.
Lau et al., “Trigger-Based Language Models: A Maximum Entropy Approach”, ICASSP'93 Proceedings of the 1993 IEEE international conference on Acoustics, speech, and signal processing: speech processing—vol. II, 1993, pp. 45-48.
Lauwers et al., “Collaboration Awareness in Support of Collaboration Transparency: Requirements for the Next Generation of Shared Window Systems”, CHI'90 Proceedings, 1990, pp. 303-311.
Lauwers et al., “Replicated Architectures for Shared Window Systems: A Critique”, COCS '90 Proceedings of the ACM SIGOIS and IEEE CS TC-OA conference on Office information systems, ACM SIGOIS Bulletin, 1990, pp. 249-260.
Lazzaro, Joseph J., “Adapting Desktop Computers to Meet the Needs of Disabled Workers is Easier Than You Might Think”, Computers for the Disabled, BYTE Magazine, Jun. 1993, 4 pages.
Leahy et al., “Effect of Touch Screen Target Location on User Accuracy”, Proceedings of the Human Factors Society 34th Annual Meeting, 1990, 5 pages.
Lee et al., “A Multi-Touch Three Dimensional Touch-Sensitive Tablet”, CHI '85 Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, Apr. 1985, pp. 21-25.
Lee et al., “A Real-Time Mandarin Dictation Machine for Chinese Language with Unlimited Texts and Very Large Vocabulary”, International Conference on Acoustics, Speech and Signal Processing, vol. 1, Apr. 1990, 5 pages.
Lee et al., “Golden Mandarin (II)—An Improved Single-Chip Real-Time Mandarin Dictation Machine for Chinese Language with Very Large Vocabulary”, IEEE International Conference of Acoustics, Speech and Signal Processing, vol. 2, 1993, 4 pages.
Lee et al., “Golden Mandarin (II)—An Intelligent Mandarin Dictation Machine for Chinese Character Input with Adaptation/Learning Functions”, International Symposium on Speech, Image Processing and Neural Networks, Hong Kong, Apr. 1994, 5 pages.
Lee et al., “On URL Normalization”, Proceedings of the International Conference on Computational Science and its Applications, ICCSA 2005, pp. 1076-1085.
Lee et al., “System Description of Golden Mandarin (I) Voice Input for Unlimited Chinese Characters”, International Conference on Computer Processing of Chinese & Oriental Languages, vol. 5, No. 3 & 4, Nov. 1991, 16 pages.
Lee, K. F., “Large-Vocabulary Speaker-Independent Continuous Speech Recognition: The SPHINX System”, Partial Fulfillment of the Requirements for the Degree of Doctorof Philosophy, Computer Science Department, Carnegie Mellon University, Apr. 1988, 195 pages.
Lee, Kai-Fu, “Automatic Speech Recognition”, 1989, 14 pages (Table of Contents).
Lemon et al., “Multithreaded Context for Robust Conversational Interfaces: Context-Sensitive Speech Recognition and Interpretation of Corrective Fragments”, ACM Transactions on Computer-Human Interaction, vol. 11, No. 3, Sep. 2004, pp. 241-267.
Leong et al., “CASIS: A Context-Aware Speech Interface System”, Proceedings of the 10th International Conference on Intelligent User Interfaces, Jan. 2005, pp. 231-238.
Leung et al., “A Review and Taxonomy of Distortion-Oriented Presentation Techniques”, ACM Transactions on Computer-Human Interaction (TOCHI), vol. 1, No. 2, Jun. 1994, pp. 126-160.
Leveseque et al., “A Fundamental Tradeoff in Knowledge Representation and Reasoning”, Readings in Knowledge Representation, 1985, 30 pages.
Levinson et al., “Speech synthesis in telecommunications”, IEEE Communications Magazine, vol. 31, No. 11, Nov. 1993, pp. 46-53.
Lewis, “Speech synthesis in a computer aided learning environment”, UK IT, Mar. 19-22, 1990, pp. 294-298.
Lewis, Cameron, “Task Ave for iPhone Review”, Mac Life, Available at <http://www.maclife.com/article/reviews/task_ave_iphone_review>, Mar. 3, 2011, 5 pages.
Lewis, Peter, “Two New Ways to Buy Your Bits”, CNN Money, available at <http://money.cnn.com/2003/12/30/commentary/ontechnology/download/>,, Dec. 31, 2003, 4 pages.
Li et al., “A Phonotactic Language model for Spoken Language Identification”, Proceedings of the 43rd Annual Meeting of the ACL, Jun. 25, 2005, pp. 515-522.
Lieberman et al., “Out of Context: Computer Systems that Adapt to, and Learn from, Context”, IBM Systems Journal, vol. 39, No. 3 & 4, 2000, pp. 617-632.
Lieberman, Henry, “A Multi-Scale, Multi-Layer, Translucent Virtual Space”, Proceedings of IEEE Conference on Information Visualization, Aug. 1997, pp. 124-131.
Lieberman, Henry, “Powers of Ten Thousand: Navigating in Large Information Spaces”, Proceedings of the ACM Symposium on User Interface Software and Technology, Nov. 1994, pp. 1-2.
Lin et al., “A Distributed Architecture for Cooperative Spoken Dialogue Agents with Coherent Dialogue State and History”, Available on line at <http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.42.272>, 1999, 4 pages.
Lin et al., “A New Framework for Recognition of Mandarin Syllables with Tones Using Sub-syllabic Unites”, IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP-93), Apr. 1993, 4 pages.
Linde et al., “An Algorithm for Vector Quantizer Design”, IEEE Transactions on Communications, vol. 28, No. 1, Jan. 1980, 12 pages.
Liu et al., “Efficient Joint Compensation of Speech for the Effects of Additive Noise and Linear Filtering”, IEEE International Conference of Acoustics, Speech and Signal Processing, ICASSP-92, Mar. 1992, 4 pages.
Logan et al., “Mel Frequency Cepstral Co-efficients for Music Modeling”, International Symposium on Music Information Retrieval, 2000, 2 pages.
Lowerre, B. T., “The-Harpy Speech Recognition System”, Doctoral Dissertation, Department of Computer Science, Carnegie Mellon University, Apr. 1976, 20 pages.
Lyon, R., “A Computational Model of Binaural Localization and Separation”, Proceedings of IEEE International Conference on Acoustics, Speech and Signal Processing, Apr. 1983, pp. 1148-1151.
Lyons et al., “Augmenting Conversations Using Dual-Purpose Speech”, Proceedings of the 17th Annual ACM Symposium on User interface Software and Technology, 2004, 10 pages.
Lyons, Richard F., “CCD Correlators for Auditory Models”, Proceedings of the Twenty-Fifth Asilomar Conference on Signals, Systems and Computers, Nov. 4-6, 1991, pp. 785-789.
Macchi, Marian, “Issues in Text-to-Speech Synthesis” Proceedings of IEEE International Joint Symposia on Intelligence and Systems, May 21, 1998, pp. 318-325.
Mackenzie et al., “Alphanumeric Entry on Pen-Based Computers”, International Journal of Human-Computer Studies, vol. 41, 1994, pp. 775-792.
Mackinlay et al., “The Perspective Wall: Detail and Context Smoothly Integrated”, ACM, 1991, pp. 173-179.
Macsimum News, “Apple Files Patent for an Audio Interface for the iPod”, available at <http://www.macsimumnews.com/index.php/archive/apple_files_patent_for_an_audio _interface_for_the_ipod>, retrieved on Jul. 13, 2006, 8 pages.
Mactech, “Keystrokes 3.5 for Mac OS X Boosts Word Prediction”, available at <http://www.mactech.com/news/?p=1007129>, retrieved on Jan. 7, 2008, 3 pages.
Maghbouleh, Arman, “An Empirical Comparison of Automatic Decision Tree and Linear Regression Models for Vowel Durations”, Revised Version of a Paper Presented at the Computational Phonology in Speech Technology Workshop, 1996 Annual Meeting of the Association for Computational Linguistics in Santa Cruz, California, 7 pages.
Mahedero et al., “Natural Language Processing of Lyrics”, In Proceedings of the 13th Annual ACM International Conference on Multimedia, ACM, Nov. 6-11, 2005, 4 pages.
Mangu et al., “Finding Consensus in Speech Recognition: Word Error Minimization and Other Applications of Confusion Networks”, Computer Speech and Language, vol. 14, No. 4, 2000, pp. 291-294.
Manning etal, “Foundations of Statistical Natural Language Processing”, The MIT Press, Cambridge Massachusetts, 1999, pp. 10-11.
Marcus et al., “Building a Large Annotated Corpus of English: The Penn Treebank”, Computational Linguistics, vol. 19, No. 2, 1993, pp. 313-330.
Markel et al., “Linear Prediction of Speech”, Springer-Verlag, Berlin, Heidelberg, New York, 1976, 12 pages.
Markel et al., “Linear Production of Speech”, Reviews, 1976, pp. xii, 288.
Martin et al., “Building and Using Practical Agent Applications”, SRI International, PAAM Tutorial, 1998, 78 pages.
Martin et al., “Building Distributed Software Systems with the Open Agent Architecture”, Proceedings of the Third International Conference on the Practical Application of Intelligent Agents and Multi-Agent Technology, Mar. 1998, pp. 355-376.
Martin et al., “Development Tools for the Open Agent Architecture”, Proceedings of the International Conference on the Practical Application of Intelligent Agents and Multi-Agent Technology, Apr. 1996, pp. 1-17.
Martin et al., “Information Brokering in an Agent Architecture”, Proceedings of the Second International Conference on the Practical Application of Intelligent Agents and Multi-Agent Technology, Apr. 1997, pp. 1-20.
Martin et al., “The Open Agent Architecture: A Framework for Building Distributed Software Systems”, Applied Artificial Intelligence: An International Journal, vol. 13, No. 1-2, available at <http://adam.cheyer.com/papers/oaa.pdf> >, retrieved from internet on Jan.-Mar. 1999.
Martin et al., “Transportability and Generality in a Natural-Language Interface System”, Proceedings of the Eighth International Joint Conference on Artificial Intelligence, Technical Note 293, Aug. 1983, 21 pages.
Martins et al., “Extracting and Exploring the Geo-Temporal Semantics of Textual Resources”, Semantic Computing, IEEE International Conference, 2008, pp. 1-9.
Masui, Toshiyuki, “POBox: An Efficient Text Input Method for Handheld and Ubiquitous Computers”, Proceedings of the 1st International Symposium on Handheld and Ubiquitous Computing, 1999, 12 pages.
Matiasek et al., “Tamic-P: A System for NL Access to Social Insurance Database”, 4th International Conference on Applications of Natural Language to Information Systems, Jun. 1999, 7 pages.
Matsui et al., “Speaker Adaptation of Tied-Mixture-Based Phoneme Models for Text-Prompted Speaker Recognition”, 1994 IEEE International Conference on Acoustics, Speech and Signal Processing, Apr. 19-22, 1994, pp. 1-125-1-128.
Matsuzawa, A, “Low-Voltage and Low-Power Circuit Design for Mixed Analog/Digital Systems in Portable Equipment”, IEEE Journal of Solid-State Circuits, vol. 29, No. 4, 1994, pp. 470-480.
Mcguire et al., “SHADE: Technology for Knowledge-Based Collaborative Engineering”, Journal of Concurrent Engineering Applications and Research (CERA), 1993, 18 pages.
Meet Ivee, Your Wi-Fi Voice Activated Assistant, available at <http://www.helloivee.com/>, retrieved on Feb. 10, 2014, 8 pages.
Mel Scale, Wikipedia the Free Encyclopedia, Last modified on Oct. 13, 2009 and retrieved on Jul. 28, 2010, available at <http://en.wikipedia.org/wiki/Mel_scale>, 2 pages.
Mellinger, David K., “Feature-Map Methods for Extracting Sound Frequency Modulation”, IEEE Computer Society Press, 1991, pp. 795-799.
Meng et al., “Generating Phonetic Cognates to Handle Named Entities in English-Chinese Cross-Language Spoken Document Retrieval”, Automatic Speech Recognition and Understanding, Dec. 2001, pp. 311-314.
Meng et al., “Wheels: A Conversational System in the Automobile Classified Domain”, Proceedings of Fourth International Conference on Spoken Language, ICSLP 96, vol. 1, Oct. 1996, 4 pages.
Menico, Costas, “Faster String Searches”, Dr. Dobb's Journal, vol. 14, No. 7, Jul. 1989, pp. 74-77.
Menta, Richard, “1200 Song MP3 Portable is a Milestone Player”, available at <http://www.mp3newswire.net/stories/personaljuke.html>, Jan. 11, 2000, 4 pages.
Merlin et al., “Non Directly Acoustic Process For Costless Speaker Recognition and Indexation”, International Workshop on Intelligent Communication Technologies and Applications, Jan. 1, 1999, 5 pages.
Meyer, Mike, “A Shell for Modern Personal Computers”, University of California, Aug. 1987, pp. 13-19.
Meyrowitz et al., “Bruwin: An Adaptable Design Strategy for Window Manager/Virtual Terminal Systems”, Department of Computer Science, Brown University, 1981, pp. 180-189.
Miastkowski, Stan, “paperWorks Makes Paper Intelligent”, Byte Magazine, Jun. 1992.
Michos et al., “Towards an Adaptive Natural Language Interface to Command Languages”, Natural Language Engineering, vol. 2, No. 3, 1996, pp. 191-209.
Microsoft Corporation, “Microsoft MS-DOS Operating System User's Guide”, Microsoft Corporation, 1982, pp. 4-1 to 4-16, 5-1 to 5-19.
Microsoft Corporation, Microsoft Office Word 2003 (SP2), Microsoft Corporation, SP3 as of 2005, pages MSWord 2003 Figures 1-5, 1983-2003.
Microsoft Press, “Microsoft Windows User's Guide for the Windows Graphical Environment”, version 3.0, 1985-1990, pp. 33-41 & 70-74.
Microsoft Windows XP, “Magnifier Utility”, Oct. 25, 2001, 2 pages.
Microsoft Word 2000 Microsoft Corporation, pages MSWord Figures 1-5, 1999.
Microsoft, “Turn On and Use Magnifier”, available at <http://www.microsoft.com/windowsxp/using/accessibility/magnifierturnon.mspx>, retrieved on Jun. 6, 2009.
Microsoft/Ford, “Basic Sync Commands”, www.SyncMyRide.com, Sep. 14, 2007, 1 page.
Miller, Chance, “Google Keyboard Updated with New Personalized Suggestions Feature”, available at <http://9to5google.com/2014/03/19/google-keyboard-updated-with-new-personalized-suggestions-feature/>, Mar. 19, 2014, 4 pages.
Milner, N. P., “A Review of Human Performance and Preferences with Different Input Devices to Computer Systems”, Proceedings of the Fourth Conference of the British Computer Society on People and Computers, Sep. 5-9, 1988, pp. 341-352.
Milstead et al., “Metadata: Cataloging by Any Other Name”, available at <http://www.iicm.tugraz.at/thesis/cguetl_diss/literatur/Kapitel06/References/Milstead_et_al._1999/metadata.html>, Jan. 1999, 18 pages.
Milward et al., “D2.2: Dynamic Multimodal Interface Reconfiguration, Talk and Look: Tools for Ambient Linguistic Knowledge”, available at <http://www.ihmc.us/users/nblaylock!Pubs/Files/talk d2.2.pdf>, Aug. 8, 2006, 69 pages.
Miniman, Jared, “Applian Software's Replay Radio and Player v1.02”, pocketnow.com—Review, available at <http://www.pocketnow.com/reviews/replay/replay.htm>, Jul. 31, 2001, 16 pages.
Minimum Phase, Wikipedia the free Encyclopedia, Last modified on Jan. 12, 2010 and retrieved on Jul. 28, 2010, available at <http://en.wikipedia.org/wiki/Minimum_phase>, 8 pages.
Minker et al., “Hidden Understanding Models for Machine Translation”, Proceedings of ETRW on Interactive Dialogue in Multi-Modal Systems, Jun. 1999, pp. 1-4.
Minutes of the Oral Proceedings received for European Patent Application No. 14737370.8, mailed on Jun. 26, 2019, 3 pages.
Mitra et al., “A Graph-Oriented Model for Articulation of Ontology Interdependencies”, Advances in Database Technology, Lecture Notes in Computer Science, vol. 1777, 2000, pp. 1-15.
Moberg et al., “Cross-Lingual Phoneme Mapping for Multilingual Synthesis Systems”, Proceedings of the 8th International Conference on Spoken Language Processing, Jeju Island, Korea, INTERSPEECH 2004, Oct. 4-8, 2004, 4 pages.
Moberg, M., “Contributions to Multilingual Low-Footprint TTS System for Hand-Held Devices”, Doctoral Thesis, Tampere University of Technology, Aug. 17, 2007, 82 pages.
Mobile Speech Solutions, Mobile Accessibility, SVOX AG Product Information Sheet, available at <http://www.svox.com/site/bra840604/con782768/mob965831936.aSQ?osLang=1>, Sep. 27, 2012, 1 page.
Mobile Tech News, “T9 Text Input Software Updated”, available at <http://www.mobiletechnews.com/info/2004/11/23/122155.html>, Nov. 23, 2004, 4 pages.
Modi et al., “CMRadar: A Personal Assistant Agent for Calendar Management”, AAAI, Intelligent Systems Demonstrations, 2004, pp. 1020-1021.
Mok et al., “Media Searching on Mobile Devices”, IEEE EIT 2007 Proceedings, 2007, pp. 126-129.
Moore et al., “Combining Linguistic and Statistical Knowledge Sources in Natural-Language Processing for ATIS”, SRI International, Artificial Intelligence Center, 1995, 4 pages.
Moore et al., “SRI's Experience with the ATIS Evaluation”, Proceedings of the Workshop on Speech and Natural Language, Jun. 1990, pp. 147-148.
Moore et al., “The Information Warfare Advisor: An Architecture for Interacting with Intelligent Agents Across the Web”, Proceedings of Americas Conference on Information Systems (AMCIS), Dec. 31, 1998, pp. 186-188.
Moore, Robert C., “Handling Complex Queries in a Distributed Data Base”, SRI International, Technical Note 170, Oct. 8, 1979, 38 pages.
Moore, Robert C., “Practical Natural-Language Processing by Computer”, SRI International, Technical Note 251, Oct. 1981, 34 pages.
Moore, Robert C., “The Role of Logic in Knowledge Representation and Commonsense Reasoning”, SRI International, Technical Note 264, Jun. 1982, 19 pages.
Moore, Robert C., “Using Natural-Language Knowledge Sources in Speech Recognition”, SRI International, Artificial Intelligence Center, Jan. 1999, pp. 1-24.
Moran et al., “Intelligent Agent-Based User Interfaces”, Proceedings of International Workshop on Human Interface Technology, Oct. 1995, pp. 1-4.
Moran et al., “Multimodal User Interfaces in the Open Agent Architecture”, International Conference on Intelligent User Interfaces (IUI97), 1997, 8 pages.
Moran, Douglas B., “Quantifier Scoping in the SRI Core Language Engine”, Proceedings of the 26th Annual Meeting on Association for Computational Linguistics, 1988, pp. 33-40.
Morgan, B., “Business Objects (Business Objects for Windows) Business Objects Inc.”, DBMS, vol. 5, No. 10, Sep. 1992, 3 pages.
Morland, D. V., “Human Factors Guidelines for Terminal Interface Design”, Communications ofthe ACM vol. 26, No. 7, Jul. 1983, pp. 484-494.
Morris et al., “Andrew: A Distributed Personal Computing Environment”, Communications of the ACM, (Mar. 1986); vol. 29 No. 3,, Mar. 1986, pp. 184-201.
Morrison, Jonathan, “iPhone 5 Siri Demo”, Online Available at <https://www.youtube.com/watch?v=_wHWwG5lhWc>, Sep. 21, 2012, 3 pages.
Morton, Philip, “Checking If An Element Is Hidden”, StackOverflow, Available at <http://stackoverflow.com/questions/178325/checking-if-an-element-is-hidden>, Oct. 7, 2008, 12 pages.
Motro, Amihai, “Flex: A Tolerant and Cooperative User Interface to Databases”, IEEE Transactions on Knowledge and Data Engineering, vol. 2, No. 2, Jun. 1990, pp. 231-246.
Mountford et al., “Talking and Listening to Computers”, The Art of Human-Computer Interface Design, Apple Computer, Inc., Addison-Wesley Publishing Company, Inc., 1990, 17 pages.
Mozer, Michael C., “An Intelligent Environment must be Adaptive”, IEEE Intelligent Systems, 1999, pp. 11-13.
Muller et al., “CSCW'92 Demonstrations”, 1992, pp. 11-14.
Murty et al., “Combining Evidence from Residual Phase and MFCC Features for Speaker Recognition”, IEEE Signal Processing Letters, vol. 13, No. 1, Jan. 2006, 4 pages.
Murveit et al., “Integrating Natural Language Constraints into HMM-Based Speech Recognition”, International Conference on Acoustics, Speech and Signal Processing, Apr. 1990, 5 pages.
Murveit et al., “Speech Recognition in SRI's Resource Management and ATIS Systems”, Proceedings of the Workshop on Speech and Natural Language, 1991, pp. 94-100.
Musicmatch, “Musicmatch and Xing Technology Introduce Musicmatch Jukebox”, Press Releases, available at <http://www.musicmatch.com/info/company/press/releases/?year= 1998&release=2>, May 18, 1998, 2 pages.
Muthusamy et al., “Speaker-Independent Vowel Recognition: Spectograms versus Cochleagrams”, IEEE, Apr. 1990, pp. 533-536.
My Cool Aids, “What's New”, available at <http://www.mycoolaids.com/>, 2012, 1 page.
Myers, Brad A., “Shortcutter for Palm”, available at <http://www.cs.cmu.edu/˜pebbles/v5/shortcutter/palm/index.html>, retrieved on Jun. 18, 2014, 10 pages.
N200 Hands-Free Bluetooth Car Kit, available at <www.wirelessground.com>, retrieved on Mar. 19, 2007, 3 pages.
Nadoli et al., “Intelligent Agents in the Simulation of Manufacturing Systems”, Proceedings of the SCS Multiconference on AI and Simulation, 1989, 1 page.
Nakagawa et al., “Speaker Recognition by Combining MFCC and Phase Information”, IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), Mar. 2010, 4 pages.
Nakagawa et al., “Unknown Word Guessing and Part-of-Speech Tagging Using Support Vector Machines”, Proceedings of the 6th NLPRS, 2001, pp. 325-331.
Naone, Erica, “TR10: Intelligent Software Assistant”, Technology Review, Mar.-Apr. 2009, 2 pages.
Navigli, Roberto, “Word Sense Disambiguation: A Survey”, ACM Computing Surveys, vol. 41, No. 2, Feb. 2009, 70 pages.
NCIP Staff, “Magnification Technology”, available at <http://www2.edc.org/ncip/library/vi/magnifi.htm>, 1994, 6 pages.
NCIP, “NCIP Library: Word Prediction Collection”, available at <http://www2.edc.org/ncip/library/wp/toc.htm>, 1998, 4 pages.
NCIP, “What is Word Prediction?”, available at <http://www2.edc.org/NCIP/library/wp/what_is.htm>, 1998, 2 pages.
NDTV, “Sony SmartWatch 2 Launched in India for Rs. 14,990”, available at <http://gadgets.ndtv.com/others/news/sony-smartwatch-2-launched-in-india-for-rs-14990-420319>, Sep. 18, 2013, 4 pages.
Neches et al., “Enabling Technology for Knowledge Sharing”, Fall, 1991, pp. 37-56.
Newton, Harry, “Newton's Telecom Dictionary”, Mar. 1998, pp. 62, 155, 610-611, 771.
Ng, Simon, “Google's Task List Now Comes to Iphone”, SimonBlog, Available at <http://www.simonblog.com/2009/02/04/googles-task-list-now-comes-to-iphone/>, Feb. 4, 2009, 33 pages.
Nguyen et al., “Generic Manager for Spoken Dialogue Systems”, In DiaBruck: 7th Workshop on the Semantics and Pragmatics of Dialogue, Proceedings, 2003, 2 pages.
Niesler et al., “A Variable-Length Category-Based N-Gram Language Model”, IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP'96), vol. 1, May 1996, 6 pages.
Nilsson, B. A., “Microsoft Publisher is an Honorable Start for DTP Beginners”, Computer Shopper, Feb. 1, 1992, 2 pages.
Noik, Emanuel G., “Layout-Independent Fisheye Views of Nested Graphs”, IEEE Proceedings of Symposium on Visual Languages, 1993, 6 pages.
Non Final Office Action received for U.S. Appl. No. 13/725,481, dated Jul. 5, 2013, 13 pages.
Non Final Office Action received for U.S. Appl. No. 13/725,550, dated Apr. 16, 2013, 8 pages.
Non Final Office Action received for U.S. Appl. No. 13/725,616, dated Jun. 28, 2013, 9 pages.
Non Final Office Action received for U.S. Appl. No. 13/725,713, dated Jul. 5, 2013, 14 pages.
Non Final Office Action received for U.S. Appl. No. 13/725,742, dated Jun. 27, 2013, 9 pages.
Non Final office action received for U.S. Appl. No. 13/725,761, dated Jul. 2, 2013, 12 pages.
Non Final Office Action received for U.S. Appl. No. 13/784,694, dated May 23, 2013, 7 pages.
Non Final Office Action received for U.S. Appl. No. 13/784,694, dated Oct. 10, 2013, 9 pages.
Non Final Office Action received for U.S. Appl. No. 13/784,707, dated Jul. 11, 2013, 9 pages.
Non-Final Office Action received for U.S. Appl. No. 12/987,982, dated Dec. 2, 2013, 18 pages.
Non-Final Office Action received for U.S. Appl. No. 12/987,982, dated Mar. 5, 2015, 24 pages.
Non-Final Office Action received for U.S. Appl. No. 12/987,982, dated Mar. 14, 2013, 28 pages.
Non-Final Office Action received for U.S. Appl. No. 13/492,809, dated Jun. 11, 2015, 9 pages.
Non-Final Office Action received for U.S. Appl. No. 13/492,809, dated Mar. 7, 2013, 7 pages.
Non-Final Office Action received for U.S. Appl. No. 13/492,809, dated Nov. 27, 2013, 8 pages.
Non-Final Office Action received for U.S. Appl. No. 13/725,512 , dated Jul. 26, 2013, 14 pages.
Non-Final Office Action received for U.S. Appl. No. 13/725,656, dated Mar. 27, 2013, 7 pages.
Non-Final Office Action received for U.S. Appl. No. 13/913,336, dated Jan. 30, 2017, 17 pages.
Non-Final Office Action received for U.S. Appl. No. 13/913,336, dated Jul. 2, 2018, 8 pages.
Non-Final Office Action received for U.S. Appl. No. 15/394,162, dated Feb. 28, 2019, 23 pages.
Nonhoff-Arps et al., “StraBenmusik: Portable MP3-Spieler mit USB Anschluss”, CT Magazin Fuer Computer Technik, Verlag Heinz Heise GMBH, Hannover DE, No. 25, 2000, pp. 166-175.
Northern Telecom, “Meridian Mail PC User Guide”, 1988, 17 Pages.
Notenboom, Leo A., “Can I Retrieve Old MSN Messenger Conversations?”, available at <http://ask-leo.com/can_i_retrieve_old_msn_messenger_conversations.html>, Mar. 11, 2004, 23 pages.
Noth et al., “Verbmobil: The Use of Prosody in the Linguistic Components of a Speech Understanding System”, IEEE Transactions On Speech and Audio Processing, vol. 8, No. 5, Sep. 2000, pp. 519-532.
Notice of Acceptance received for Australian Patent Application No. 2017204217, dated Oct. 8, 2018, 3 pages.
Notice of Acceptance received for Australian Patent application No. 2011205426, dated Jan. 6, 2014, 2 pages.
Notice of Acceptance received for Australian Patent application No. 2013205568, dated May 20, 2015, 2 pages.
Notice of Acceptance received for Australian Patent application No. 2013205569, dated Feb. 15, 2016, 2 pages.
Notice of Acceptance received for Australian Patent application No. 2013205571, dated Jun. 1, 2015, 2 pages.
Notice of Acceptance received for Australian Patent application No. 2013205586, dated Aug. 6, 2015, 2 pages.
Notice of Acceptance received for Australian Patent application No. 2013205588, dated Feb. 12, 2016, 2 pages.
Notice of Acceptance received for Australian Patent application No. 2013205590, dated May 20, 2015, 2 pages.
Notice of Acceptance received for Australian Patent application No. 2013205591, dated Feb. 12, 2016, 2 pages.
Notice of Acceptance received for Australian Patent application No. 2014274913, dated May 1, 2017, 3 pages.
Notice of Acceptance received for Australian Patent application No. 2016204262, dated Dec. 22, 2017, 3 pages.
Notice of Acceptance received for Australian Patent Application No. 2018202411, dated Sep. 18, 2019, 3 pages.
Notice of Acceptance received for Australian Patent Application No. 2019200296, dated Sep. 5, 2019, 3 pages.
Notice of Acceptance received for Canadian Patent application No. 2,793,118, dated May 12, 2017, 1 page.
Notice of Acceptance received for U.S. Patent Application No. 2013205584, dated Mar. 9, 2016, 2 pages.
Notice of Allowance received for Canadian Patent Application No. 2,787,351, dated Aug. 6, 2015, 1 page.
Notice of Allowance received for Canadian Patent Application No. 2,791,791, dated Aug. 9, 2016, 1 page.
Notice of Allowance received for Canadian Patent Application No. 2,792,412, dated Sep. 14, 2015, 1 page.
Notice of Allowance received for Canadian Patent Application No. 2,792,570, dated Sep. 16, 2015, 1 page.
Notice of Allowance received for Canadian Patent Application No. 2,793,002, dated Feb. 23, 2016, 1 page.
Notice of Allowance received for Canadian Patent Application No. 2,793,248, dated Aug. 24, 2016, 2 pages.
Notice of Allowance received for Canadian Patent Application No. 2,793,741, dated Sep. 16, 2015, 1 page.
Notice of Allowance received for Canadian Patent Application No. 2,793,743, dated May 20, 2015, 1 page.
Notice of Allowance received for Canadian Patent Application No. 2,954,559, dated Jun. 14, 2018, 1 page.
Notice of Allowance received for Canadian Patent Application No. 2,954,559, dated Oct. 20, 2017, 1 page.
Notice of Allowance received for Canadian Patent Application No. 3,000,109, dated Oct. 16, 2019, 1 page.
Notice of Allowance received for Chinese Patent Application No. 201610126045.2, dated Jul. 16, 2019, 2 pages.
Notice of Allowance received for Japanese Patent Application No. 2014-127579, dated Sep. 16, 2016, 3 pages.
Notice of Allowance received for Japanese Patent Application No. 2014-127580, dated Jun. 30, 2017, 3 pages.
Notice of Allowance received for Japanese Patent Application No. 2014-127581, dated May 21, 2018, 3 pages.
Notice of Allowance received for Japanese Patent Application No. 2014-127582, dated Jun. 24, 2016, 3 pages.
Notice of Allowance received for Japanese Patent Application No. 2014-127583, dated May 27, 2016, 3 pages.
Notice of Allowance received for Japanese Patent Application No. 2014-127584, dated May 30, 2016, 3 pages.
Notice of Allowance received for Japanese Patent Application No. 2014-127585, dated Jul. 10, 2017, 3 pages.
Notice of Allowance received for Japanese Patent Application No. 2014-127586, dated May 9, 2016, 3 pages.
Notice of Allowance received for Japanese Patent Application No. 2014-127587, dated May 21, 2018, 3 pages.
Notice of Allowance received for Japanese Patent Application No. 2017-117880, dated Feb. 12, 2019, 4 pages.
Notice of Allowance received for Korean Patent Application No. 10-2012-7021659, dated Jan. 20, 2016, 3 pages.
Notice of Allowance received for Korean Patent Application No. 10-2012-7028786, dated Feb. 27, 2015, 2 pages.
Notice of Allowance received for Korean Patent Application No. 10-2012-7028802, dated Feb. 27, 2015, 2 pages.
Notice of Allowance received for Korean Patent Application No. 10-2012-7028805, dated Aug. 28, 2015, 3 pages.
Notice of Allowance received for Korean Patent Application No. 10-2012-7029183, dated Dec. 16, 2015, 5 pages.
Notice of Allowance received for Korean Patent Application No. 10-2012-7029195, dated May 30, 2016, 3 pages.
Notice of Allowance received for Korean Patent Application No. 10-2012-7029197, dated Feb. 27, 2015, 2 pages.
Notice of Allowance received for Korean Patent Application No. 10-2012-7029381, dated Nov. 27, 2015, 3 pages.
Notice of Allowance received for Korean Patent Application No. 10-2012-7029382, dated Nov. 20, 2015, 3 pages.
Notice of Allowance received for Korean Patent Application No. 10-2012-7029385, dated Aug. 21, 2015, 3 pages.
Notice of Allowance received for Korean Patent Application No. 10-2016-7023962, dated May 31, 2017, 4 pages.
Notice of Allowance received for Korean Patent Application No. 10-2017-7024596, dated Dec. 19, 2018, 4 pages.
Notice of Allowance received for Korean Patent Application No. 10-2017-7035711, dated Mar. 28, 2019, 4 pages.
Notice of Allowance received for Korean Patent Application No. 10-2019-7007971, dated Dec. 26, 2019, 5 pages.
Notice of Allowance received for Mexican Patent Application No. MX/a/2012/011794, dated Nov. 19, 2014, 1 page.
Notice of Allowance received for Mexican Patent Application No. MX/a/2012/011795, dated Nov. 20, 2014, 1 page.
Notice of Allowance received for Mexican Patent Application No. MX/a/2012/011797, dated Nov. 20, 2014, 1 page.
Notice of Allowance received for Mexican Patent Application No. MX/a/2012/011798, dated Nov. 28, 2014, 1 page.
Notice of Allowance received for Mexican Patent Application No. MX/a/2012/011799, dated Nov. 27, 2014, 1 page.
Notice of Allowance received for Mexican Patent Application No. MX/a/2012/011800, dated Feb. 9, 2016, 2 pages.
Notice of Allowance received for Mexican Patent Application No. MX/a/2012/011803, dated Nov. 28, 2014, 1 page.
Notice of Allowance received for Mexican Patent Application No. MX/a/2012/011807, dated Nov. 28, 2014, 1 page.
Notice of Allowance received for Mexican Patent Application No. MX/a/2012/011808, dated Jan. 23, 2015, 1 page.
Notice of Allowance received for Mexican Patent Application No. MX/a/2015/004983, dated Dec. 16, 2015, 2 pages.
Notice of Allowance received for Mexican Patent Application No. MX/a/2015/004983, dated Jun. 10, 2016, 1 page.
Notice of Allowance received for Mexican Patent Application No. MX/a/2016/011562, dated Mar. 31, 2017, 1 page.
Notice of Allowance received for Russian Patent Application No. 2012144637, dated Oct. 17, 2014, 15 pages.
Notice of Allowance received for U.S. Appl. No. 12/987,982, dated Dec. 15, 2015, 9 pages.
Notice of Allowance received for U.S. Appl. No. 13/492,809, dated Sep. 8, 2016, 14 pages.
Notice of Allowance received for U.S. Appl. No. 13/725,481, dated Jul. 23, 2014, 7 pages.
Notice of Allowance received for U.S. Appl. No. 13/725,481, dated May 12, 2014, 7 pages.
Notice of Allowance received for U.S. Appl. No. 13/725,512 , dated Dec. 17, 2013, 9 pages.
Notice of Allowance received for U.S. Appl. No. 13/725,550, dated Jun. 11, 2014, 10 pages.
Notice of Allowance received for U.S. Appl. No. 13/725,550, dated Sep. 18, 2014, 10 pages.
Notice of Allowance received for U.S. Appl. No. 13/725,616, dated Apr. 3, 2014, 8 pages.
Notice of Allowance received for U.S. Appl. No. 13/725,616, dated Jul. 17, 2014, 8 pages.
Notice of Allowance received for U.S. Appl. No. 13/725,656, dated Dec. 4, 2013, 10 pages.
Notice of Allowance received for U.S. Appl. No. 13/725,656, dated Jul. 10, 2013, 10 pages.
Notice of Allowance received for U.S. Appl. No. 13/725,713, dated Jan. 30, 2014, 5 pages.
Notice of Allowance received for U.S. Appl. No. 13/725,742, dated Feb. 19, 2014, 7 pages.
Notice of Allowance received for U.S. Appl. No. 13/725,761, dated Apr. 10, 2015, 5 pages.
Notice of Allowance received for U.S. Appl. No. 13/784,694, dated Aug. 1, 2014, 8 pages.
Notice of Allowance received for U.S. Appl. No. 13/784,694, dated Feb. 21, 2014, 7 pages.
Notice of Allowance received for U.S. Appl. No. 13/784,694, dated Jun. 2, 2014, 8 pages.
Notice of Allowance received for U.S. Appl. No. 13/784,707, dated Feb. 20, 2014, 7 pages.
Notice of Allowance received for U.S. Appl. No. 13/784,707, dated Mar. 20, 2014, 2 pages.
Notice of Allowance received for U.S. Appl. No. 13/913,336, dated Dec. 14, 2018, 9 pages.
Notice of Allowance received for U.S. Appl. No. 15/394,162, dated Feb. 20, 2020, 6 pages.
Notification to Grant received for Chinese Patent Application No. 201180013559.2, dated Jan. 18, 2016, 3 pages.
O'Connor, Rory J., “Apple Banking on Newton's Brain”, San Jose Mercury News, Apr. 22, 1991.
Odubiyi et al., “SAIRE—A Scalable Agent-Based Information Retrieval Engine”, Proceedings of the First International Conference on Autonomous Agents, 1997, 12 pages.
Office Action received for Australian Patent Application No. 2013205568, dated Feb. 13, 2015, 3 pages.
Office Action received for Australian Patent application No. 2013205569, dated Feb. 16, 2015, 3 pages.
Office Action received for Australian Patent application No. 2013205571, dated Feb. 16, 2015, 3 pages.
Office Action received for Australian Patent Application No. 2013205584, dated Dec. 7, 2015, 3 pages.
Office Action received for Australian Patent Application No. 2013205584, dated Feb. 18, 2015, 3 pages.
Office Action received for Australian Patent Application No. 2013205585, dated Feb. 19, 2015, 3 pages.
Office Action received for Australian Patent Application No. 2013205586, dated Feb. 17, 2015, 3 pages.
Office Action received for Australian Patent Application No. 2013205588, dated Feb. 17, 2015, 3 pages.
Office Action received for Australian Patent Application No. 2013205590, dated Feb. 16, 2015, 3 pages.
Office Action received for Australian Patent Application No. 2013205591, dated Feb. 16, 2015, 3 pages.
Office Action received for Australian Patent Application No. 2014274913, dated Aug. 5, 2016, 3 pages.
Office Action received for Australian Patent Application No. 2016204262, dated Feb. 24, 2017, 3 pages.
Office Action received for Australian Patent Application No. 2017204217, dated Feb. 12, 2018, 3 pages.
Office Action received for Australian Patent Application No. 2018202411, dated Jan. 23, 2019, 2 pages.
Office Action received for Australian Patent Application No. 2019200296, dated Jul. 19, 2019, 2 pages.
Office Action received for Brazilian Patent Application No. 112012017826-1, dated Sep. 6, 2019, 5 pages.
Office Action received for Canadian Patent Application No. 2,787,351, dated May 28, 2014, 4 pages.
Office Action received for Canadian Patent Application No. 2,791,791, dated Aug. 13, 2014, 3 pages.
Office Action received for Canadian Patent Application No. 2,791,791, dated Aug. 25, 2015, 4 pages.
Office Action received for Canadian Patent Application No. 2,792,412, dated Aug. 21, 2014, 3 pages.
Office Action received for Canadian Patent Application No. 2,792,442, dated Aug. 25, 2015, 3 pages.
Office Action received for Canadian Patent Application No. 2,792,442, dated Feb. 4, 2016, 1 page.
Office Action received for Canadian Patent Application No. 2,792,570, dated Sep. 3, 2014, 3 pages.
Office Action received for Canadian Patent Application No. 2,793,002, dated Sep. 3, 2014, 3 pages.
Office Action received for Canadian Patent Application No. 2,793,002, dated Sep. 22, 2015, 3 pages.
Office Action received for Canadian Patent Application No. 2,793,118, dated Aug. 21, 2015, 4 pages.
Office Action received for Canadian Patent Application No. 2,793,118, dated Jul. 11, 2016, 4 pages.
Office Action received for Canadian Patent Application No. 2,793,118, dated Mar. 19, 2015, 3 pages.
Office Action received for Canadian Patent Application No. 2,793,248, dated Sep. 3, 2014, 3 pages.
Office Action received for Canadian Patent Application No. 2,793,248, dated Sep. 10, 2015, 3 pages.
Office Action received for Canadian Patent Application No. 2,793,741, dated Aug. 21, 2014, 2 pages.
Office Action received for Canadian Patent Application No. 2,793,743, dated May 20, 2014, 4 pages.
Office Action received for Canadian Patent Application No. 2,954,559, dated Mar. 27, 2017, 3 pages.
Office Action received for Canadian Patent Application No. 3,000,109, dated Jan. 14, 2019, 3 pages.
Office Action received for Chinese Patent Application No. 201180013559.2, dated Feb. 28, 2015, 14 pages.
Office Action received for Chinese Patent Application No. 201480030811.4, dated Jan. 28, 2019, 11 pages.
Office Action received for Chinese Patent Application No. 201480030811.4, dated Mar. 1, 2018, 17 pages.
Office Action received for Chinese Patent Application No. 201480030811.4, dated Mar. 3, 2017, 19 pages.
Office Action received for Chinese Patent Application No. 201480030811.4, dated Sep. 8, 2017, 17 pages.
Office Action received for Chinese Patent Application No. 201480030811.4, dated Sep. 30, 2018, 19 pages.
Office Action received for Chinese Patent Application No. 201610126045.2, dated May 8, 2018, 10 pages.
Office Action received for Chinese Patent Application No. 201610126045.2, dated Nov. 12, 2018, 5 pages.
Office Action received for European Patent Application No. 11707939.2 , dated Jan. 18, 2019, 8 pages.
Office Action received for European Patent Application No. 14737370.8, dated Dec. 21, 2017, 5 pages.
Office Action received for European Patent Application No. 16188272.5, dated May 10, 2019, 8 pages.
Office Action received for Indian Patent Application No. 6734/CHENP/2012, dated Oct. 30, 2018, 8 pages.
Office Action received for Indian Patent Application No. 8902/CHENP/2012, dated Oct. 30, 2018, 6 pages.
Office Action received for Indian Patent Application No. 8903/CHENP/2012, dated Aug. 9, 2018, 6 pages.
Office Action received for Indian Patent Application No. 8904/CHENP/2012, dated Oct. 23, 2018, 6 pages.
Office Action received for Indian Patent Application No. 8905/CHENP/2012, dated Oct. 8, 2018, 7 pages.
Office Action received for Indian Patent Application No. 8906/CHENP/2012, dated Oct. 24, 2018, 6 pages.
Office Action received for Indian Patent Application No. 8907/CHENP/2012, dated Oct. 24, 2018, 6 pages.
Office Action received for Indian Patent Application No. 8908/CHENP/2012, dated Oct. 24, 2018, 6 pages.
Office Action received for Indian Patent Application No. 8909/CHENP/2012, dated Oct. 25, 2018, 6 pages.
Office Action received for Indian Patent Application No. 8910/CHENP/2012, dated Oct. 25, 2018, 6 pages.
Office Action received for Japanese Patent Application No. 2012-549003, dated Dec. 20, 2013, 3 pages.
Office Action received for Japanese Patent Application No. 2012-549003, dated Feb. 22, 2016, 15 pages.
Office Action received for Japanese Patent Application No. 2012-549003, dated Jun. 26, 2017, 138 pages.
Office Action received for Japanese Patent Application No. 2012-549003, dated Mar. 2, 2015, 10 pages.
Office Action received for Japanese Patent Application No. 2012-549003, dated Oct. 21, 2016, 51 pages.
Office Action received for Japanese Patent Application No. 2014-127579, dated Apr. 4, 2016, 6 pages.
Office Action received for Japanese Patent Application No. 2014-127579, dated Sep. 14, 2015, 5 pages.
Office Action received for Japanese Patent Application No. 2014-127580, dated Jan. 20, 2017, 10 pages.
Office Action received for Japanese Patent Application No. 2014-127580, dated Jun. 21, 2016, 12 pages.
Office Action received for Japanese Patent Application No. 2014-127580, dated Sep. 28, 2015, 7 pages.
Office Action received for Japanese Patent Application No. 2014-127581, dated Aug. 31, 2015, 9 pages.
Office Action received for Japanese Patent Application No. 2014-127581, dated Jun. 24, 2016, 4 pages.
Office Action received for Japanese Patent Application No. 2014-127581, dated Nov. 24, 2016, 4 pages.
Office Action received for Japanese Patent Application No. 2014-127581, dated Oct. 2, 2017, 44 pages.
Office Action received for Japanese Patent Application No. 2014-127582, dated Aug. 31, 2015, 11 pages.
Office Action received for Japanese Patent Application No. 2014-127583, dated Sep. 7, 2015, 3 pages.
Office Action received for Japanese Patent Application No. 2014-127584, dated Sep. 4, 2015, 3 pages.
Office Action received for Japanese Patent Application No. 2014-127585, dated Feb. 17, 2017, 9 pages.
Office Action received for Japanese Patent Application No. 2014-127585, dated Jul. 15, 2016, 8 pages.
Office Action received for Japanese Patent Application No. 2014-127585, dated Sep. 10, 2015, 4 pages.
Office Action received for Japanese Patent Application No. 2014-127586, dated Sep. 14, 2015, 8 pages.
Office Action received for Japanese Patent Application No. 2014-127587, dated Aug. 23, 2017, 6 pages.
Office Action received for Japanese Patent Application No. 2014-127587, dated Jan. 27, 2017, 6 pages.
Office Action received for Japanese Patent Application No. 2014-127587, dated Jul. 4, 2016, 7 pages.
Office Action received for Japanese Patent Application No. 2014-127587, dated Mar. 19, 2018, 3 pages.
Office Action received for Japanese Patent Application No. 2014-127587, dated Sep. 14, 2015, 9 pages.
Office Action received for Japanese Patent Application No. 2017-117880, dated May 11, 2018, 9 pages.
Office Action received for Japanese Patent Application No. 2017-117880, dated Sep. 29, 2017, 6 pages.
Office Action received for Japanese Patent Application No. 2018-050944, dated Feb. 28, 2020, 6 pages.
Office Action received for Japanese Patent Application No. 2018-050944, dated Mar. 29, 2019, 8 pages.
Office Action received for Korean Patent Application No. 10-2012-7021659, dated Apr. 30, 2014, 8 pages.
Office Action received for Korean Patent Application No. 10-2012-7021659, dated Feb. 27, 2015, 15 pages.
Office Action received for Korean Patent Application No. 10-2012-7028786, dated Apr. 30, 2014, 15 pages.
Office Action received for Korean Patent Application No. 10-2012-7028802, dated Apr. 30, 2014, 10 pages.
Office Action received for Korean Patent Application No. 10-2012-7028805, dated Feb. 27, 2015, 14 pages.
Office Action received for Korean Patent Application No. 10-2012-7029183, dated Apr. 30, 2014, 11 pages.
Office Action received for Korean Patent Application No. 10-2012-7029183, dated Jan. 28, 2015, 10 pages.
Office Action received for Korean Patent Application No. 10-2012-7029183, dated Sep. 7, 2015, 7 pages.
Office Action received for Korean Patent Application No. 10-2012-7029195, dated Apr. 30, 2014, 11 pages.
Office Action received for Korean Patent Application No. 10-2012-7029195, dated Feb. 27, 2015, 16 pages.
Office Action received for Korean Patent Application No. 10-2012-7029195, dated Jan. 28, 2016, 6 pages.
Office Action received for Korean Patent Application No. 10-2012-7029197, dated Apr. 30, 2014, 10 pages.
Office Action received for Korean Patent Application No. 10-2012-7029381, dated Apr. 30, 2014, 12 pages.
Office Action received for Korean Patent Application No. 10-2012-7029381, dated Mar. 28, 2015, 5 pages.
Office Action received for Korean Patent Application No. 10-2012-7029382, dated Apr. 30, 2014, 9 pages.
Office Action received for Korean Patent Application No. 10-2012-7029382, dated Jan. 28, 2015, 7 pages.
Office Action received for Korean Patent Application No. 10-2012-7029382, dated Jul. 31, 2015, 12 pages.
Office Action received for Korean Patent Application No. 10-2012-7029385, dated Apr. 30, 2015, 13 pages.
Office Action received for Korean Patent Application No. 10-2012-7029385, dated Jun. 27, 2014, 13 pages.
Office Action received for Korean Patent Application No. 10-2015-7035370, dated Jul. 11, 2016, 12 pages.
Office Action received for Korean Patent Application No. 10-2015-7035370, dated May 31, 2017, 6 pages.
Office Action received for Korean Patent Application No. 10-2015-7035370, dated Oct. 11, 2017, 7 pages.
Office Action received for Korean Patent Application No. 10-2016-7023962, dated Oct. 20, 2016, 5 pages.
Office Action received for Korean Patent Application No. 10-2017-7024596, dated Feb. 22, 2018, 10 pages.
Office Action received for Korean Patent Application No. 10-2017-7035711, dated May 18, 2018, 14 pages.
Office Action received for Korean Patent Application No. 10-2019-7007971, dated May 17, 2019, 12 pages.
Office Action received for Korean Patent Application No. 10-2019-7018332, dated Mar. 12, 2020, 9 pages.
Office Action received for Korean Patent Application No. 10-2019-7018332, dated Sep. 10, 2019, 5 pages.
Office Action received for Mexican Patent Application No. MX/a/2012/008369, dated Oct. 21, 2013, 6 pages.
Office Action received for Mexican Patent Application No. MX/a/2012/011794, dated Jun. 13, 2014, 2 pages.
Office Action received for Mexican Patent Application No. MX/a/2012/011795, dated Feb. 19, 2014, 1 page.
Office Action received for Mexican Patent Application No. MX/a/2012/011795, dated Jun. 13, 2014, 2 pages.
Office Action received for Mexican Patent Application No. MX/a/2012/011797, dated Feb. 19, 2014, 1 page.
Office Action received for Mexican Patent Application No. MX/a/2012/011797, dated Jun. 13, 2014, 2 pages.
Office Action received for Mexican Patent Application No. MX/a/2012/011798, dated Feb. 19, 2014, 1 page.
Office Action received for Mexican Patent Application No. MX/a/2012/011798, dated Jun. 24, 2014, 3 pages.
Office Action received for Mexican Patent Application No. MX/a/2012/011799, dated Jun. 25, 2014, 2 pages.
Office Action received for Mexican Patent Application No. MX/a/2012/011800, dated Aug. 20, 2015, 9 pages.
Office Action received for Mexican Patent Application No. MX/a/2012/011800, dated Dec. 5, 2014, 5 pages.
Office Action received for Mexican Patent Application No. MX/a/2012/011803, dated Feb. 19, 2014, 1 page.
Office Action received for Mexican Patent Application No. MX/a/2012/011803, dated Jun. 25, 2014, 2 pages.
Office Action received for Mexican Patent Application No. MX/a/2012/011807, dated Feb. 19, 2014, 1 page.
Office Action received for Mexican Patent Application No. MX/a/2012/011807, dated Jun. 26, 2014, 2 pages.
Office Action received for Mexican Patent Application No. MX/a/2012/011808, dated Feb. 19, 2014, 1 page.
Office Action received for Mexican Patent Application No. MX/a/2012/011799, dated Feb. 1, 2014, 1 page.
Office Action received for Russian Patent Application No. 2012135502, dated Feb. 18, 2014, 8 pages.
Office Action received for Russian Patent Application No. 2012144605, dated Mar. 26, 2014, 7 pages.
Office Action received for Russian Patent Application No. 2012144606, dated Mar. 25, 2014, 7 pages.
Office Action received for Russian Patent Application No. 2012144637, dated Mar. 25, 2014, 8 pages.
Office Action received for Russian Patent Application No. 2012144640, dated Mar. 24, 2014, 9 pages.
Office Action received for Russian Patent Application No. 2012144640, dated Nov. 28, 2014, 8 pages.
Office Action received for Russian Patent Application No. 2012144644, dated Mar. 24, 2014, 8 pages.
Office Action received for Russian Patent Application No. 2012144647, dated Jun. 20, 2014, 8 pages.
Office Action received for United Kingdom Patent Application No. 1213633.9, dated Feb. 16, 2017, 5 pages.
Office Action received for United Kingdom Patent Application No. 1213633.9, dated Sep. 28, 2017, 5 pages.
Ohsawa et al., “A computational Model of an Intelligent Agent Who Talks with a Person”, Research Reports on Information Sciences, Series C, No. 92, Apr. 1989, pp. 1-18.
Ohtomo et al., “Two-Stage Recognition Method of Hand-Written Chinese Characters Using an Integrated Neural Network Model”, Denshi Joohoo Tsuushin Gakkai Ronbunshi, D-II, vol. J74, Feb. 1991, pp. 158-165.
Okazaki et al., “Multi-Fisheye Transformation Method for Large-Scale Network Maps”, IEEE Japan, vol. 44, No. 6, 1995, pp. 495-500.
Omologo et al., “Microphone Array Based Speech Recognition with Different Talker-Array Positions”, IEEE International Conference on Acoustics, Speech, and Signal Processing, vol. 1, Apr. 21-24, 1997, pp. 227-230.
Oregon Scientific, “512MB Waterproof MP3 Player with FM Radio & Built-in Pedometer”, available at <http://www2.oregonscientific.com/shop/product.asp?cid=4&scid=11 &pid=581 >, retrieved on Jul. 31, 2006, 2 pages.
Oregon Scientific, “Waterproof Music Player with FM Radio and Pedometer (MP121)—User Manual”, 2005, 24 pages.
Osxdaily, “Get a List of Siri Commands Directly from Siri”, Available at <http://osxdaily.com/2013/02/05/list-siri-commands/>, Feb. 5, 2013, 15 pages.
Owei et al., “Natural Language Query Filtration in the Conceptual Query Language”, IEEE, 1997, pp. 539-549.
Padilla, Alfredo, “Palm Treo 750 Cell Phone Review—Messaging”, available at <http://www.wirelessinfo.com/content/palm-Treo-750-Cell-Phone-Review/Messaging.htm>, Mar. 17, 2007, 6 pages.
Palay et al., “The Andrew Toolkit: An Overview”, Information Technology Center, Carnegie-Mellon University, 1988, pp. 1-15.
Palm, Inc., “User Guide: Your Palm® Treo.TM. 755p Smartphone”, 2005-2007, 304 pages.
Pan et al., “Natural Language Aided Visual Query Building for Complex Data Access”, In proceeding of: Proceedings of the Twenty-Second Conference on Innovative Applications of Artificial Intelligence, XP055114607, Jul. 11, 2010.
Panasonic, “Toughbook 28: Powerful, Rugged and Wireless”, Panasonic: Toughbook Models, available at <http://www.panasonic.com/computer/notebook/html/01a_s8.htm>, retrieved on Dec. 19, 2002, 3 pages.
Pannu et al., “A Learning Personal Agent for Text Filtering and Notification”, Proceedings of the International Conference of Knowledge Based Systems, 1996, pp. 1-11.
Papadimitriou et al., “Latent Semantic Indexing: A Probabilistic Analysis”, Available online at <http://citeseerx.ist.psu.edu/messaqes/downloadsexceeded.html>, Nov. 14, 1997, 21 pages.
Parks et al., “Classification of Whale and Ice Sounds with a cochlear Model”, IEEE, Mar. 1992.
Parson, T. W., “Voice and Speech Processing”, Pitch and Formant Estimation, McGraw-Hill, Inc., ISBN: 0-07-0485541-0, 1987, 15 pages.
Parsons, T. W., “Voice and Speech Processing”, Linguistics and Technical Fundamentals, Articulatory Phonetics and Phonemics, McGraw-Hill, Inc., ISBN: 0-07-0485541-0, 1987, 5 pages.
Patent Abstracts of Japan, vol. 014, No. 273 (E-0940)Jun. 13, 1990 (Jun. 13, 1990)-& JP 02 086057 A (Japan Storage Battery Co Ltd), Mar. 27, 1990 (Mar. 27, 1990), 3 pages.
Pathak et al., “Privacy-preserving Speech Processing: Cryptographic and String-matching Frameworks Show Promise”, In: IEEE signal processing magazine, retrieved from <http://www.merl.com/publications/docs/TR2013-063.pdf>, Feb. 13, 2013, 16 pages.
Patterson et al., “Rendezvous: An Architecture for Synchronous Multi-User Applications”, CSCW '90 Proceedings, 1990, pp. 317-328.
Pearl, Amy, “System Support for Integrated Desktop Video Conferencing”, Sunmicrosystems Laboratories, Dec. 1992, pp. 1-15.
Penn et al., “Ale for Speech: A Translation Prototype”, Bell Laboratories, 1999, 4 pages.
Pereira, Fernando, “Logic for Natural Language Analysis”, SRI International, Technical Note 275, Jan. 1983, 194 pages.
Perrault et al., “Natural-Language Interfaces”, SRI International, Technical Note 393, Aug. 22, 1986, 48 pages.
PhatNoise, Voice Index on Tap, Kenwood Music Keg, available at <http://www.phatnoise.com/kenwood/kenwoodssamail.html>, retrieved on Jul. 13, 2006, 1 page.
Phillipps, Ben, “Touchscreens are Changing the Face of Computers—Today's Users Have Five Types of Touchscreens to Choose from, Each with its Own Unique Characteristics”, Electronic Products, Nov. 1994, pp. 63-70.
Phillips, Dick, “The Multi-Media Workstation”, SIGGRAPH '89 Panel Proceedings, 1989, pp. 93-109.
Phoenix Solutions, Inc., “Declaration of Christopher Schmandt Regarding the MIT Galaxy System”, West Interactive Corp., A Delaware Corporation, Document 40, Jul. 2, 2010, 162 pages.
Pickering, J. A., “Touch-Sensitive Screens: The Technologies and Their Application”, International Journal of Man-Machine Studies, vol. 25, No. 3, Sep. 1986, pp. 249-269.
Picone, J., “Continuous Speech Recognition using Hidden Markov Models”, IEEE Assp Magazine, vol. 7, No. 3, Jul. 1990, 16 pages.
Pingali et al., “Audio-Visual Tracking for Natural Interactivity”, ACM Multimedia, Oct. 1999, pp. 373-382.
Plaisant et al., “Touchscreen Interfaces for Alphanumeric Data Entry”, Proceedings of the Human Factors and Ergonomics Society 36th Annual Meeting, 1992, pp. 293-297.
Plaisant et al., “Touchscreen Toggle Design”, CHI'92, May 3-7, 1992, pp. 667-668.
Pollock, Stephen, “A Rule-Based Message Filtering System”, Published in: Journal, ACM Transactions on Information Systems (TOIS), vol. 6, Issue 3, Jul. 1988, pp. 232-254.
Poly-Optical Products, Inc., “Poly-Optical Fiber Optic Membrane Switch Backlighting”, available at <http://www.poly-optical.com/membrane_switches.html>, retrieved on Dec. 19, 2002, 3 pages.
Poor, Alfred, “Microsoft Publisher”, PC Magazine, vol. 10, No. 20, Nov. 26, 1991, 1 page.
Potter et al., “An Experimental Evaluation of Three Touch Screen Strategies within a Hypertext Database”, International Journal of Human-Computer Interaction, vol. 1, No. 1, 1989, pp. 41-52.
Potter et al., “Improving the Accuracy of Touch Screens: An Experimental Evaluation of Three Strategies”, CHI '88 ACM, 1988, pp. 27-32.
Powell, Josh, “Now You See Me . . . Show/Hide Performance”, available at http://www.learningjquery.com/2010/05/now-you-see-me-showhide-performance, May 4, 2010, 3 pages.
Public Safety Technologies, “Tracer 2000 Computer”, available at <http://www.pst911.com/tracer.html>, retrieved on Dec. 19, 2002, 3 pages.
Pulman et al., “Clare: A Combined Language and Reasoning Engine”, Proceedings of JFIT Conference, available at <http://www.cam.sri.com/tr/crc042/paper.ps.Z>, 1993, 8 pages.
Quazza et al., “Actor: A Multilingual Unit-Selection Speech Synthesis System”, Proceedings of 4th ISCA Tutorial and Research Workshop on Speech Synthesis, Jan. 1, 2001, 6 pages.
Quick Search Algorithm, Communications of the ACM, 33(8), 1990, pp. 132-142.
Rabiner et al., “Digital Processing of Speech Signals”, Prentice Hall, 1978, pp. 274-277.
Rabiner et al., “Fundamental of Speech Recognition”, AT&T, Published by Prentice-Hall, Inc., ISBN: 0-13-285826-6, 1993, 17 pages.
Rabiner et al., “Note on the Properties of a Vector Quantizer for LPC Coefficients”, Bell System Technical Journal, vol. 62, No. 8, Oct. 1983, 9 pages.
Rampe et al., “SmartForm Designer and SmartForm Assistant”, News release, Claris Corp., Jan. 9, 1989, 1 page.
Rao et al., “Exploring Large Tables with the Table Lens”, Apple Inc., Video Clip, Xerox Corp., on a CD, 1994.
Rao et al., “Exploring Large Tables with the Table Lens”, CHI'95 Mosaic of Creativity, ACM, May 7-11, 1995, pp. 403-404.
Rao et al., “The Table Lens: Merging Graphical and Symbolic Representations in an Interactive Focus+Context Visualization for Tabular Information”, Proceedings of the ACM SIGCHI Conference on Human Factors in Computing Systems, Apr. 1994, pp. 1-7.
Raper, Larry K.,“The C-MU PC Server Project”, (CMU-ITC-86-051), Dec. 1986, pp. 1-30.
Ratcliffe et al., “Intelligent Agents Take U.S. Bows”, MacWeek, vol. 6, No. 9, Mar. 2, 1992, 1 page.
Ratcliffe, M., “ClearAccess 2.0 Allows SQL Searches Off-Line (Structured Query Language) (ClearAccess Corp. Preparing New Version of Data-Access Application with Simplified User Interface, New Features) (Product Announcement)”, MacWeek, vol. 6, No. 41, Nov. 16, 1992, 2 pages.
Ravishankar, Mosur K., “Efficient Algorithms for Speech Recognition”, Doctoral Thesis Submitted to School of Computer Science, Computer Science Division, Carnegie Mellon University, Pittsburgh, May 15, 1996, 146 pages.
Rayner et al., “Adapting the Core Language Engine to French and Spanish”, Cornell University Library, available at <http:l/arxiv.org/abs/cmp-Ig/9605015>, May 10, 1996, 9 pages.
Rayner et al., “Deriving Database Queries from Logical Forms by Abductive Definition Expansion”, Proceedings of the Third Conference on Applied Natural Language Processing, ANLC, 1992, 8 pages.
Rayner et al., “Spoken Language Translation with Mid-90's Technology: A Case Study”, Eurospeech, ISCA, Available online at <http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.54.8608>, 1993, 4 pages.
Rayner, M., “Abductive Equivalential Translation and its Application to Natural Language Database Interfacing”, Dissertation Paper, SRI International, Sep. 1993, 162 pages.
Rayner, Manny, “Linguistic Domain Theories: Natural-Language Database Interfacing from First Principles”, SRI International, Cambridge, 1993, 11 pages.
Reddy, D. R., “Speech Recognition by Machine: A Review”, Proceedings of the IEEE, Apr. 1976, pp. 501-531.
Reininger et al., “Speech and Speaker Independent Codebook Design in VQ Coding Schemes”, (Proceedings of the IEEE International Acoustics, Speech and Signal Processing Conference, Mar. 1985), as reprinted in Vector Quantization (IEEE Press, 1990), 1990, pp. 271-273.
Remde et al., “SuperBook: An Automatic Tool for Information Exploration-Hypertext?”, In Proceedings of Hypertext, 87 Papers, Nov. 1987, 14 pages.
Ren et al., “Efficient Strategies for Selecting Small Targets on Pen-Based Systems: An Evaluation Experiment for Selection Strategies and Strategy Classifications”, Proceedings of the IFIP TC2/TC13 WG2.7/WG13.4 Seventh Working Conference on Engineering for Human-Computer Interaction, vol. 150, 1998, pp. 19-37.
Ren et al., “Improving Selection Performance on Pen-Based Systems: A Study of Pen-Based Interaction for Selection Tasks”, ACM Transactions on Computer-Human Interaction, vol. 7, No. 3, Sep. 2000, pp. 384-416.
Ren et al., “The Best among Six Strategies for Selecting a Minute Target and the Determination of the Minute Maximum Size of the Targets on a Pen-Based Computer”, Human-Computer Interaction INTERACT, 1997, pp. 85-92.
Reynolds, C. F., “On-Line Reviews: A New Application of the HICOM Conferencing System”, IEEE Colloquium on Human Factors in Electronic Mail and Conferencing Systems, Feb. 3, 1989, 4 pages.
Rice et al., “Monthly Program: Nov. 14, 1995”, The San Francisco Bay Area Chapter of ACM SIGCHI, available at <http://www.baychi.org/calendar/19951114>, Nov. 14, 1995, 2 pages.
Rice et al., “Using the Web Instead of a Window System”, Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, CHI'96, 1996, pp. 1-14.
Ricker, Thomas, “Apple Patents Audio User Interface”, Engadget, available at <http://www.engadget.com/2006/05/04/apple-patents-audio-user-interface/>, May 4, 2006, 6 pages.
Riecken, R D., “Adaptive Direct Manipulation”, IEEE Xplore, 1991, pp. 1115-1120.
Rigoll, G., “Speaker Adaptation for Large Vocabulary Speech Recognition Systems Using Speaker Markov Models”, International Conference on Acoustics, Speech and Signal Processing (ICASSP'89), May 1989, 4 pages.
Riley, M D., “Tree-Based Modelling of Segmental Durations”, Talking Machines Theories, Models and Designs, Elsevier Science Publishers B.V., North-Holland, ISBN: 08-444-89115.3, 1992, 15 pages.
Rioport, “Rio 500: Getting Started Guide”, available at <http://ec1.images-amazon.com/media/i3d/01/A/man-migrate/MANUAL000023453.pdf>, 1999, 2 pages.
Rivlin et al., “Maestro: Conductor of Multimedia Analysis Technologies”, SRI International, 1999, 7 pages.
Rivoira et al., “Syntax and Semantics in a Word-Sequence Recognition System”, IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP'79), Apr. 1979, 5 pages.
Robbin et al., “MP3 Player and Encoder for Macintosh!”, SoundJam MP Plus, Version 2.0, 2000, 76 pages.
Robertson et al., “Information Visualization Using 3D Interactive Animation”, Communications of the ACM, vol. 36, No. 4, Apr. 1993, pp. 57-71.
Robertson et al., “The Document Lens”, UIST'93, Nov. 3-5, 1993, pp. 101-108.
Roddy et al., “Communication and Collaboration in a Landscape of B2B eMarketplaces”, VerticalNet Solutions, White Paper, Jun. 15, 2000, 23 pages.
Roddy et al., “Interface Issues in Text Based Chat Rooms”, SIGCHI Bulletin, vol. 30, No. 2, Apr. 1998, pp. 119-123.
Root, Robert, “Design of a Multi-Media Vehicle for Social Browsing”, Bell Communications Research, 1988, pp. 25-38.
Rose et al., “Inside Macintosh”, vols. I, II, and III, Addison-Wesley Publishing Company, Inc., Jul. 1988, 1284 pages.
Roseberry, Catherine, “How To Pair a Bluetooth Headset & Cell Phone”, available at <http://mobileoffice.about.com/od/usingyourphone/ht/blueheadset_p.htm>, retrieved on Apr. 29, 2006, 2 pages.
Rosenberg et al., “An Overview of the Andrew Message System”, Information Technology Center Carnegie-Mellon University, Jul. 1987, pp. 99-108.
Rosenfeld, R., “A Maximum Entropy Approach to Adaptive Statistical Language Modelling”, Computer Speech and Language, vol. 10, No. 3, Jul. 1996, 25 pages.
Rosner et al., “In Touch: A Graphical User Interface Development Tool”, IEEE Colloquium on Software Tools for Interface Design, Nov. 8, 1990, pp. 12/1-12/7.
Rossfrank, “Konstenlose Sprachmitteilungins Festnetz”, XP002234425, Dec. 10, 2000, pp. 1-4.
Roszkiewicz, A., “Extending your Apple”, Back Talk-Lip Service, A+ Magazine, The Independent Guide for Apple Computing, vol. 2, No. 2, Feb. 1984, 5 pages.
Roucos et al., “A Segment Vocoder at 150 B/S”, (Proceedings of the IEEE International Acoustics, Speech and Signal Processing Conference, Apr. 1983), as reprinted in Vector Quantization (IEEE Press, 1990), 1990, pp. 246-249.
Roucos et al., “High Quality Time-Scale Modification for Speech”, Proceedings of the 1985 IEEE Conference on Acoustics, Speech and Signal Processing, 1985, pp. 493-496.
Routines, “SmartThings Support”, Available online at <https://web.archive.org/web/20151207165701/https://support.smartthings.com/hc/en-us/articles/205380034-Routines>, 2015, 2 pages.
Rubine, Dean Harris, “Combining Gestures and Direct Manipulation”, CHI '92, May 3-7, 1992, pp. 659-660.
Rubine, Dean Harris, “The Automatic Recognition of Gestures”, CMU-CS-91-202, Thesis Submitted in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy in Computer Science at Carnegie Mellon University, Dec. 1991, 285 pages.
Ruch et al., “Using Lexical Disambiguation and Named-Entity Recognition to Improve Spelling Correction in the Electronic Patient Record”, Artificial Intelligence in Medicine, Sep. 2003, pp. 169-184.
Rudnicky et al., “Creating Natural Dialogs in the Carnegie Mellon Communicator System”, Proceedings of Eurospeech, vol. 4, 1999, pp. 1531-1534.
Russell et al., “Artificial Intelligence, A Modern Approach”, Prentice Hall, Inc., 1995, 121 pages.
Russo et al., “Urgency is a Non-Monotonic Function of Pulse Rate”, Journal of the Acoustical Society of America, vol. 122, No. 5, 2007, 6 pages.
Sabin et al., “Product Code Vector Quantizers for Waveform and Voice Coding”, (IEEE Transactions on Acoustics, Speech and Signal Processing, Jun. 1984), as reprinted in Vector Quantization (IEEE Press, 1990), 1990, pp. 274-288.
Sacerdoti et al., “A Ladder User's Guide (Revised)”, SRI International Artificial Intelligence Center, Mar. 1980, 39 pages.
Sagalowicz, D., “AD-Ladder User's Guide”, SRI International, Sep. 1980, 42 pages.
Sakoe et al., “Dynamic Programming Algorithm Optimization for Spoken Word Recognition”, IEEE Transactions on Acoustics, Speech and Signal Processing, vol. ASSP-26, No. 1, Feb. 1978, 8 pages.
Salton et al., “On the Application of Syntactic Methodologies in Automatic Text Analysis”, Information Processing and Management, vol. 26, No. 1, Great Britain, 1990, 22 pages.
Sameshima et al., “Authorization with Security Attributes and Privilege Delegation Access control beyond the ACL”, Computer Communications, vol. 20, 1997, 9 pages.
Sankar, Ananth, “Bayesian Model Combination (BAYCOM) for Improved Recognition”, IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP), Mar. 18-23, 2005, pp. 845-848.
San-Segundo et al., “Confidence Measures for Dialogue Management in the CU Communicator System”, Proceedings of Acoustics, Speech and Signal Processing (ICASSP'00), Jun. 2000, 4 pages.
Santaholma, Marianne E., “Grammar Sharing Techniques for Rule-based Multilingual NLP Systems”, Proceedings of the 16th Nordic Conference of Computational Linguistics, NODALIDA 2007, May 25, 2007, 8 pages.
Santen, Jan P., “Assignment of Segmental Duration in Text-to-Speech Synthesis”, Computer Speech and Language, vol. 8, No. 2, Apr. 1994, pp. 95-128.
Sarawagi, Sunita, “CRF Package Page”, available at <http://crf.sourceforge.net/>, retrieved on Apr. 6, 2011, 2 pages.
Sarkar et al., “Graphical Fisheye Views of Graphs”, CHI '92 Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, May 3-7, 1992, pp. 83-91.
Sarkar et al., “Graphical Fisheye Views of Graphs”, Systems Research Center, Digital Equipment Corporation,, Mar. 17, 1992, 31 pages.
Sarkar et al., “Graphical Fisheye Views”, Communications of the ACM, vol. 37, No. 12, Dec. 1994, pp. 73-83.
Sarkar et al., “Stretching the Rubber Sheet: A Metaphor for Viewing Large Layouts on Small Screens”, UIST'93, ACM, Nov. 3-5, 1993, pp. 81-91.
Sarvas et al., “Metadata Creation System for Mobile Images”, Conference Proceedings, The Second International Conference On Mobile Systems, Applications And Services, Jun. 6, 2004, pp. 36-48.
Sastry, Ravindra W., “A Need for Speed: A New Speedometer for Runners”, submitted to the Department of Electrical Engineering and Computer Science at the Massachusetts Institute of Technology, 1999, pp. 1-42.
Sato, H., “A Data Model, Knowledge Base and Natural Language Processing for Sharing a Large Statistical Database”, Statistical and Scientific Database Management, Lecture Notes in Computer Science, vol. 339, 1989, 20 pages.
Savoy, J., “Searching Information in Hypertext Systems Using Multiple Sources of Evidence”, International Journal of Man-Machine Studies, vol. 38, No. 6, Jun. 1996, 15 pages.
Scagliola, C., “Language Models and Search Algorithms for Real-Time Speech Recognition”, International Journal of Man-Machine Studies, vol. 22, No. 5, 1985, 25 pages.
Schafer et al., “Digital Representations of Speech Signals”, Proceedings of the IEEE, vol. 63, No. 4, Apr. 1975, pp. 662-677.
Schaffer et al., “Navigating Hierarchically Clustered Networks through Fisheye and Full-Zoom Methods”, ACM Transactions on Computer-Human Interaction, vol. 3, No. 2, Jun. 1996, pp. 162-188.
Scheifler, R. W., “The X Window System”, MIT Laboratory for Computer Science and Gettys, Jim Digital Equipment Corporation and MIT Project Athena; ACM Transactions on Graphics, vol. 5, No. 2, Apr. 1986, pp. 79-109.
Schluter et al., “Using Phase Spectrum Information for Improved Speech Recognition Performance”, IEEE International Conference on Acoustics, Speech, and Signal Processing, 2001, pp. 133-136.
Schmandt et al., “A Conversational Telephone Messaging System”, IEEE Transactions on Consumer Electronics, vol. CE-30, Aug. 1984, pp. xxi-xxiv.
Schmandt et al., “Augmenting a Window System with Speech Input”, IEEE Computer Society, Computer, vol. 23, No. 8, Aug. 1990, 8 pages.
Schmandt et al., “Phone Slave: A Graphical Telecommunications Interface”, Proceedings of the SID, vol. 26, No. 1, 1985, pp. 79-82.
Schmandt et al., “Phone Slave: A Graphical Telecommunications Interface”, Society for Information Display, International Symposium Digest of Technical Papers, Jun. 1984, 4 pages.
Schmid, H., “Part-of-speech tagging with neural networks”, COLING '94 Proceedings of the 15th conference on Computational linguistics—vol. 1, 1994, pp. 172-176.
Schnelle, Dirk, “Context Aware Voice User Interfaces for Workflow Support”, Dissertation paper, Aug. 27, 2007, 254 pages.
Schone et al., “Knowledge-Free Induction of Morphology Using Latent Semantic Analysis”, Proceedings of the 2nd Workshop on Learning Language in Logic and the 4th Conference on Computational Natural Language Learning, vol. 7, 2000, pp. 67-72.
Schooler et al., “A Packet-switched Multimedia Conferencing System”, By Eve Schooler, et al; ACM SIGOIS Bulletin, vol. I, No. 1, Jan. 1989, pp. 12-22.
Schooler et al., “An Architecture for Multimedia Connection Management”, Proceedings IEEE 4th Comsoc International Workshop on Multimedia Communications, Apr. 1992, pp. 271-274.
Schooler et al., “Multimedia Conferencing: Has it Come of Age?”, Proceedings 24th Hawaii International Conference on System Sciences, vol. 3, Jan. 1991, pp. 707-716.
Schooler et al., “The Connection Control Protocol: Architecture Overview”, USC/Information Sciences Institute, Jan. 28, 1992, pp. 1-6.
Schooler, Eve M., “Case Study: Multimedia Conference Control in a Packet-Switched Teleconferencing System”, Journal of Internetworking: Research and Experience, vol. 4, No. 2, Jun. 1993, pp. 99-120.
Schooler, Eve M., “The Impact of Scaling on a Multimedia Connection Architecture”, Multimedia Systems, vol. 1, No. 1, 1993, pp. 2-9.
Schooler, Eve, “A Distributed Architecture for Multimedia Conference Control”, ISI Research Report, Nov. 1991, pp. 1-18.
Schultz, Tanja, “Speaker Characteristics”, In: Speaker Classification I, retrieved from <http://ccc.inaoep.mx/˜villasen/bib/Speaker%20Characteristics.pdf>, 2007, pp. 47-74.
Schütze, H., “Dimensions of Meaning”, Proceedings of Supercomputing'92 Conference, Nov. 1992, 10 pages.
Schütze, H., “Distributional part-of-speech tagging”, EACL '95 Proceedings of the seventh conference on European chapter of the Association for Computational Linguistics, 1995, pp. 141-148.
Schütze, Hinrich, “Part-of-speech induction from scratch”, ACL '93 Proceedings of the 31st annual meeting on Association for Computational Linguistics, 1993, pp. 251-258.
Schwartz et al., “Context-Dependent Modeling for Acoustic-Phonetic Recognition of Continuous Speech”, IEEE International Conference on Acoustics, Speech, and Signal Processing, vol. 10, Apr. 1985, pp. 1205-1208.
Schwartz et al., “Improved Hidden Markov Modeling of Phonemes for Continuous Speech Recognition”, IEEE International Conference on Acoustics, Speech, and Signal Processing, vol. 9, 1984, pp. 21-24.
Schwartz et al., “The N-Best Algorithm: An Efficient And Exact Procedure For Finding The N Most Likely Sentence Hypotheses”, IEEE, 1990, pp. 81-84.
Scott et al., “Designing Touch Screen Numeric Keypads: Effects of Finger Size, Key Size, and Key Spacing”, Proceedings of the Human Factors and Ergonomics Society 41st Annual Meeting, Oct. 1997, pp. 360-364.
Seagrave, Jim, “A Faster Way to Search Text”, EXE, vol. 5, No. 3, Aug. 1990, pp. 50-52.
Sears et al., “High Precision Touchscreens: Design Strategies and Comparisons with a Mouse”, International Journal of Man-Machine Studies, vol. 34, No. 4, Apr. 1991, pp. 593-613.
Sears et al., “Investigating Touchscreen Typing: The Effect of Keyboard Size on Typing Speed”, Behavior & Information Technology, vol. 12, No. 1, 1993, pp. 17-22.
Sears et al., “Touchscreen Keyboards”, Apple Inc., Video Clip, Human-Computer Interaction Laboratory, on a CD, Apr. 1991.
Seide et al., “Improving Speech Understanding by Incorporating Database Constraints and Dialogue History”, Proceedings of Fourth International Conference on Philadelphia,, 1996, pp. 1017-1020.
Sen et al., “Indian Accent Text-to-Speech System for Web Browsing”, Sadhana, vol. 27, No. 1, Feb. 2002, pp. 113-126.
Seneff et al., “A New Restaurant Guide Conversational System: Issues in Rapid Prototyping for Specialized Domains”, Proceedings of Fourth International Conference on Spoken Language, vol. 2, 1996, 4 pages.
Sethy et al., “A Syllable Based Approach for Improved Recognition of Spoken Names”, ITRW on Pronunciation Modeling and Lexicon Adaptation for Spoken language Technology (PMLA2002), Sep. 14-15, 2002, pp. 30-35.
Sharoff et al., “Register-Domain Separation as a Methodology for Development of Natural Language Interfaces to Databases”, Proceedings of Human-Computer Interaction (INTERACT'99), 1999, 7 pages.
Sheth et al., “Evolving Agents for Personalized Information Filtering”, Proceedings of the Ninth Conference on Artificial Intelligence for Applications, Mar. 1993, 9 pages.
Sheth et al., “Relationships at the Heart of Semantic Web: Modeling, Discovering, and Exploiting Complex Semantic Relationships”, Enhancing the Power of the Internet: Studies in Fuzziness and Soft Computing, Oct. 13, 2002, pp. 1-38.
Shikano et al., “Speaker Adaptation through Vector Quantization”, IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP'86), vol. 11, Apr. 1986, 4 pages.
Shimazu et al., “CAPIT: Natural Language Interface Design Tool with Keyword Analyzer and Case-Based Parser”, NEG Research & Development, vol. 33, No. 4, Oct. 1992, 11 pages.
Shinkle, L., “Team User's Guide”, SRI International, Artificial Intelligence Center, Nov. 1984, 78 pages.
Shiraki et al., “LPC Speech Coding Based on Variable-Length Segment Quantization”, (IEEE Transactions on Acoustics, Speech and Signal Processing, Sep. 1988), as reprinted in Vector Quantization (IEEE Press, 1990), 1990, pp. 250-257.
Shklar et al., “InfoHarness: Use of Automatically Generated Metadata for Search and Retrieval of Heterogeneous Information”, Proceedings of CAiSE'95, Finland, 1995, 14 pages.
Shneiderman, Ben, “Designing the User Interface: Strategies for Effective Human-Computer Interaction”, Second Edition, 1992, 599 pages.
Shneiderman, Ben, “Designing the User Interface: Strategies for Effective Human-Computer Interaction”, Third Edition, 1998, 669 pages.
Shneiderman, Ben, “Direct Manipulation for Comprehensible, Predictable and Controllable User Interfaces”, Proceedings of the 2nd International Conference on Intelligent User Interfaces, 1997, pp. 33-39.
Shneiderman, Ben, “Sparks of Innovation in Human-Computer Interaction”, 1993, (Table of Contents, Title Page, Ch. 4, Ch. 6 and List of References).
Shneiderman, Ben, “The Eyes Have It: A Task by Data Type Taxonomy for Information Visualizations”, IEEE Proceedings of Symposium on Visual Languages, 1996, pp. 336-343.
Shneiderman, Ben, “Touch Screens Now Offer Compelling Uses”, IEEE Software, Mar. 1991, pp. 93-94.
Shoham et al., “Efficient Bit and Allocation for an Arbitrary Set of Quantizers”, (IEEE Transactions on Acoustics, Speech, and Signal Processing, Sep. 1988) as reprinted in Vector Quantization (IEEE Press, 1990), 1990, pp. 289-296.
Sigurdsson et al., “Mel Frequency Cepstral Co-efficients: An Evaluation of Robustness of MP3 Encoded Music”, Proceedings of the 7th International Conference on Music Information Retrieval, 2006, 4 pages.
Silverman et al., “Using a Sigmoid Transformation for Improved Modeling of Phoneme Duration”, Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing, Mar. 1999, 5 pages.
Simkovitz, Daniel, “LP-DOS Magnifies the PC Screen”, IEEE, 1992, pp. 203-204.
Simonite, Tom, “One Easy Way to Make Siri Smarter”, Technology Review, Oct. 18, 2011, 2 pages.
Singh et al., “Automatic Generation of Phone Sets and Lexical Transcriptions”, Acoustics, Speech and Signal Processing (ICASSP'00), 2000, 1 page.
Singh, N., “Unifying Heterogeneous Information Models”, Communications of the ACM, 1998, 13 pages.
Sinitsyn, Alexander, “A Synchronization Framework for Personal Mobile Servers”, Proceedings of the Second IEEE Annual Conference on Pervasive Computing and Communications Workshops, Piscataway, 2004, pp. 1, 3 and 5.
Slaney et al., “On the Importance of Time—A Temporal Representation of Sound”, Visual Representation of Speech Signals, 1993, pp. 95-116.
Smeaton, Alan F., “Natural Language Processing and Information Retrieval”, Information Processing and Management, vol. 26, No. 1, 1990, pp. 19-20.
Smith et al., “Guidelines for Designing User Interface Software”, User Lab, Inc., Aug. 1986, pp. 1-384.
Smith et al., “Relating Distortion to Performance in Distortion Oriented Displays”, Proceedings of Sixth Australian Conference on Computer-Human Interaction, Nov. 1996, pp. 6-11.
Sony Eiicsson Corporate, “Sony Ericsson to introduce Auto pairing.TM. to Improve Bluetooth.TM. Connectivity Between Headsets and Phones”, Press Release, available at <http://www.sonyericsson.com/spg.jsp?cc=global&lc=en&ver=4001&template=pc3_1_ 1&z . . . >, Sep. 28, 2005, 2 pages.
Soong et al., “A High Quality Subband Speech Coder with Backward Adaptive Predictor and Optimal Time-Frequency Bit Assignment”, (Proceedings of the IEEE International Acoustics, Speech, and Signal Processing Conference, Apr. 1986), as reprinted in Vector Quantization (IEEE Press, 1990), 1990, pp. 316-319.
Speaker Recognition, Wikipedia, The Free Enclyclopedia, Nov. 2, 2010, 4 pages.
Spiller, Karen, “Low-Decibel Earbuds Keep Noise at a Reasonable Level”, available at <http://www.nashuatelegraph.com/apps/pbcs.dll/article?Date=20060813&Cate . . . >, Aug. 13, 2006, 3 pages.
Spivack, Nova, “Sneak Preview of Siri—Part Two—Technical Foundations—Interview with Tom Gruber, CTO of Siri”, Online Available at <https://web.archive.org/web/20100114234454/http://www.twine.com/item/12vhy39k4-22m/interview-with-tom-gruber-of-siri>, Jan. 14, 2010, 5 pages.
SRI International, “The Open Agent Architecture TM 1.0 Distribution”, Open Agent Architecture (OAA), 1999, 2 pages.
SRI, “SRI Speech: Products: Software Development Kits: EduSpeak”, available at <http://web.archive.org/web/20090828084033/http://www.speechatsri.com/products/eduspeak>shtml, retrieved on Jun. 20, 2013, 2 pages.
Srihari, R. K.., “Use of Multimedia Input In Automated Image Annotation And Content-based Retrieval”, Proceedings Of Spie, International Society For Optical Engineering, vol. 2420, Feb. 9, 1995., pp. 249-260.
Srinivas et al., “Monet: A Multi-Media System for Conferencing and Application Sharing in Distributed Systems”, CERC Technical Report Series Research Note, Feb. 1992.
Starr et al., “Knowledge-Intensive Query Processing”, Proceedings of the 5th KRDB Workshop, Seattle, May 31, 1998, 6 pages.
Stealth Computer Corporation, “Peripherals for Industrial Keyboards & Pointing Devices”, available at <http://www.stealthcomputer.com/peripherals_oem.htm>, retrieved on Dec. 19, 2002, 6 pages.
Steinberg, Gene, “Sonicblue Rio Car (10 GB, Reviewed: 6 GB)”, available at <http://electronics.cnet.com/electronics/0-6342420-1304-4098389.htrnl>, Dec. 12, 2000, 2 pages.
Stent et al., “Geo-Centric Language Models for Local Business Voice Search”, AT&T Labs—Research, 2009, pp. 389-396.
Stent et al., “The CommandTalk Spoken Dialogue System”, SRI International, 1999, pp. 183-190.
Stern et al., “Multiple Approaches to Robust Speech Recognition”, Proceedings of Speech and Natural Language Workshop, 1992, 6 pages.
Stickel, Mark E., “A Nonclausal Connection-Graph Resolution Theorem-Proving Program”, Proceedings of AAAI'82, 1982, 5 pages.
Stifleman, L., “Not Just Another Voice Mail System”, Proceedings of 1991 Conference, American Voice, Atlanta GA, Sep. 24-26, 1991, pp. 21-26.
Stone et al., “The Movable Filter as a User Interface Tool”, CHI '94 Human Factors in Computing Systems, 1994, pp. 306-312.
Strom et al., “Intelligent Barge-In in Conversational Systems”, MIT laboratory for Computer Science, 2000, 4 pages.
Stuker et al., “Cross-System Adaptation and Combination for Continuous Speech Recognition: The Influence of Phoneme Set and Acoustic Front-End”, Influence of Phoneme Set and Acoustic Front-End, Interspeech, Sep. 17-21, 2006, pp. 521-524.
Su et al., “A Review of ZoomText Xtra Screen Magnification Program for Windows 95”, Journal of Visual Impairment & Blindness, Feb. 1998, pp. 116-119.
Su, Joseph C., “A Review of Telesensory's Vista PCI Screen Magnification System”, Journal of Visual Impairment & Blindness, Oct. 1998, pp. 705, 707-710.
Sugumaran, V., “A Distributed Intelligent Agent-Based Spatial Decision Support System”, Proceedings of the Americas Conference on Information systems (AMCIS), Dec. 31, 1998, 4 pages.
Sullivan, Danny, “How Google Instant's Autocomplete Suggestions Work”, available at <http://searchengineland.com/how-google-instant-autocomplete-suggestions-work-62592>, Apr. 6, 2011, 12 pages.
Summerfield et al., “ASIC Implementation of the Lyon Cochlea Model”, Proceedings of the 1992 International Conference on Acoustics, Speech and Signal Processing, IEEE, vol. V, 1992, pp. 673-676.
Summons to Attend Oral Proceedings received for European Patent Application No. 11707939.2, mailed on Mar. 20, 2020, 12 pages.
Summons to Attend Oral Proceedings received for European Patent Application No. 14737370.8, mailed on Jan. 21, 2019, 12 pages.
Sundaram et al., “Latent Perceptual Mapping with Data-Driven Variable-Length Acoustic Units for Template-Based Speech Recognition”, ICASSP 2012, Mar. 2012, pp. 4125-4128.
Supplemental Notice of Allowance received for U.S. Appl. No. 15/394,162, dated Apr. 9, 2020, 2 pages.
Susaki et al., “A New Decision Factor for IR System Extracted from Structure of Hypertexts”, Report of Information Processing Society of Japan, JPN, vol. 99, No. 57, Jul. 16, 1999, pp. 73-80.
Sycara et al., “Coordination of Multiple Intelligent Software Agents”, International Journal of Cooperative Information Systems (IJCIS), vol. 5, No. 2 & 3, 1996, 31 pages.
Sycara et al., “Distributed Intelligent Agents”, IEEE Expert, vol. 11, No. 6, Dec. 1996, 32 pages.
Sycara et al., “Dynamic Service Matchmaking among Agents in Open Information Environments”, SIGMOD Record, 1999, 7 pages.
Sycara et al., “The RETSINA MAS Infrastructure”, Autonomous Agents and Multi-Agent Systems, vol. 7, 2003, 20 pages.
T3 Magazine, “Creative MuVo TX 256MB”, available at <http://www.t3.co.uk/reviews/entertainment/mp3_player/creative_muvo_tx_256mb>, Aug. 17, 2004, 1 page.
Taos, “TAOS, Inc. Announces Industry's First Ambient Light Sensor to Convert Light Intensity to Digital Signals”, News Release, available at <http://www.taosinc.com/presssrelease_090902.htm>, Sep. 16, 2002, 3 pages.
Tatsuya et al., “Open-Source Speech Recognition Software Julius”, Journal of Japanese Society for Artificial Intelligence, vol. 20, No. 1, Jan. 2005, pp. 41-49.
Taylor et al., “Speech Synthesis by Phonological Structure Matching”, International Speech Communication Association, vol. 2, Section 3, 1999, 4 pages.
Tello, Ernest R., “Natural-Language Systems”, Mastering AI Tools and Techniques, Howard W. Sams & Company, 1988, pp. 25-64.
Tenenbaum et al., “Data Structure Using Pascal”, Prentice-Hall, Inc., 1981, 34 pages.
Textndrive, “Text'nDrive App Demo-Listen and Reply to your Messages by Voice while Driving!”, YouTube Video available at <http://www.youtube.com/watch?v=WaGfzoHsAMw>, Apr. 27, 2010, 1 page.
TG3 Electronics, Inc., “BL82 Series Backlit Keyboards”, available at <http://www.tg3electronics.com/products/backlit/backlit.htm>, retrieved on Dec. 19, 2002, 2 pages.
The HP 150, “Hardware: Compact, Powerful, and Innovative”, vol. 8, No. 10, Oct. 1983, pp. 36-50.
Tidwell, Jenifer, “Animated Transition”, Designing Interfaces, Patterns for effective Interaction Design, Nov. 2005, First Edition, 4 pages.
Timothy et al., “Speech-Based Annotation and Retrieval of Digital Photographs”, Interspeech. 8th Annual Conference Of The International Speech Communication Association, Aug. 27, 2007, pp. 2165-2168.
Tofel, Kevin C., “SpeakTolt: A Personal Assistant for Older iPhones, iPads”, Apple News, Tips and Reviews, Feb. 9, 2012, 7 pages.
Tombros et al., “Users' Perception of Relevance of Spoken Documents”, Journal of the American Society for Information Science, New York, Aug. 2000, pp. 929-939.
Tomita et al., “Multi-database Searching System Based on WWW: WebSENA”, NTT Technology Journal, JPN, vol. 10, No. 5 (serial No. 100), 1998, pp. 55-58.
Top 10 Best Practices for Voice User Interface Design available at <http://www.developer.com/voice/article.php/1567051/Top-10-Best-Practices-for-Voice-UserInterface-Design.htm>, Nov. 1, 2002, 4 pages.
Touch, Joseph, “Zoned Analog Personal Teleconferencing”, USC / Information Sciences Institute, 1993, pp. 1-19.
Toutanova et al., “Feature-Rich Part-of-Speech Tagging with a Cyclic Dependency Network”, Computer Science Dept., Stanford University, Stanford CA 94305-9040, 2003, 8 pages.
Trigg et al., “Hypertext Habitats: Experiences of Writers in NoteCards”, Hypertext '87 Papers; Intelligent Systems Laboratory, Xerox Palo Alto Research Center, 1987, pp. 89-108.
Trowbridge, David, “Using Andrew for Development of Educational Applications”, Center for Design of Educational Computing, Carnegie-Mellon University (CMU-ITC-85-065), Jun. 2, 1985, pp. 1-6.
Tsai et al., “Attributed Grammar—A Tool for Combining Syntactic and Statistical Approaches to Pattern Recognition”, IEEE Transactions on Systems, Man and Cybernetics, vol. SMC-10, No. 12, Dec. 1980, 13 pages.
Tsao et al., “Matrix Quantizer Design for LPC Speech Using the Generalized Lloyd Algorithm”, (IEEE Transactions on Acoustics, Speech and Signal Processing, Jun. 1985), as reprinted in Vector Quantization (IEEE Press, 1990), 1990, pp. 237-245.
Tucker, Joshua, “Too Lazy to Grab Your TV Remote? Use Siri Instead”, Engadget, Nov. 30, 2011, 8 pages.
Tur et al., “The CALO Meeting Assistant System”, IEEE Transactions on Audio, Speech and Language Processing, vol. 18, No. 6, Aug. 2010, pp. 1601-1611.
Tur et al., “The CALO Meeting Speech Recognition and Understanding System”, Proc. IEEE Spoken Language Technology Workshop, 2008, 4 pages.
Turletti, Thierry, “The INRIA Videoconferencing System (IVS)”, Oct. 1994, pp. 1-7.
Tyson et al., “Domain-Independent Task Specification in the TACITUS Natural Language System”, SRI International, Artificial Intelligence Center, May 1990, 16 pages.
Udell, J., “Computer Telephony”, BYTE, vol. 19, No. 7, Jul. 1994, 9 pages.
Ushida et al., “Spoken Dialogue Engine based on Autonomous Behavior Decision Model”, Omron Technics, vol. 40, No. 1, 2000, pp. 16-21. {See Communication under 37 CFR§ 1.98(a) (3)}.
Uslan et al., “A Review of Henter-Joyce's MAGic for Windows NT”, Journal of Visual Impairment and Blindness, Dec. 1999, pp. 666-668.
Uslan et al., “A Review of Supernova Screen Magnification Program for Windows”, Journal of Visual Impairment & Blindness, Feb. 1999, pp. 108-110.
Uslan et al., “A Review of Two Screen Magnification Programs for Windows 95: Magnum 95 and LP-Windows”, Journal of Visual Impairment & Blindness, Sep.-Oct. 1997, pp. 9-13.
Van Santen, J. P.H., “Contextual Effects on Vowel Duration”, Journal Speech Communication, vol. 11, No. 6, Dec. 1992, pp. 513-546.
Veiga, Alex, “AT&T Wireless Launching Music Service”, available at <http://bizyahoo.com/ap/041005/at_t_mobile_music_5.html?printer=1 >, Oct. 5, 2004, 2 pages.
Vepa et al., “New Objective Distance Measures for Spectral Discontinuities in Concatenative Speech Synthesis”, Proceedings of the IEEE 2002 Workshop on Speech Synthesis, 2002, 4 pages.
Verschelde, Jan, “MATLAB Lecture 8. Special Matrices in MATLAB”, UIC, Dept. of Math, Stat. & CS, MCS 320, Introduction to Symbolic Computation, 2007, 4 pages.
Viegas et al., “Chat Circles”, SIGCHI Conference on Human Factors in Computing Systems, May 15-20, 1999, pp. 9-16.
Viikki et al., “Speaker- and Language-Independent Speech Recognition in Mobile Communication Systems”, IEEE, vol. 1, 2001, pp. 5-8.
Vingron, Martin, “Near-Optimal Sequence Alignment”, Current Opinion in Structural Biology, vol. 6, No. 3, 1996, pp. 346-352.
Vlingo Incar, “Distracted Driving Solution with Vlingo InCar”, YouTube Video, Available online at <http://www.youtube.com/watch?v=Vqs8XfXxgz4>, Oct. 2010, 2 pages.
Vlingo, “Vlingo Launches Voice Enablement Application on Apple App Store”, Press Release, Dec. 3, 2008, 2 pages.
Vogel et al., “Shift: A Technique for Operating Pen-Based Interfaces Using Touch”, CHI '07 Proceedings, Mobile Interaction Techniques I, Apr. 28-May 3, 2007, pp. 657-666.
Voiceassist, “Send Text, Listen to and Send E-Mail by Voice”, YouTube Video, Available online at <http://www.youtube.com/watch?v=0tEU61nHHA4>, Jul. 30, 2009, 1 page.
Voiceonthego, “Voice on the Go (BlackBerry)”, YouTube Video, available online at <http://www.youtube.com/watch?v=pJqpWgQS98w>, Jul. 27, 2009, 1 page.
W3C Working Draft, “Speech Synthesis Markup Language Specification for the Speech Interface Framework”, available at <http://www.w3org./TR/speech-synthesis>, retrieved on Dec. 14, 2000, 42 pages.
Wadlow, M. G., “The Role of Human Interface Guidelines in the Design of Multimedia Applications”, Carnegie Mellon University (To be Published in Current Psychology: Research and Reviews, Summer 1990 (CMU-ITC-91-101), 1990, pp. 1-22.
Wahlster et al., “Smartkom: Multimodal Communication with a Life-Like Character”, Eurospeech-Scandinavia, 7th European Conference on Speech Communication and Technology, 2001, 5 pages.
Waibel, Alex, “Interactive Translation of Conversational Speech”, Computer, vol. 29, No. 7, Jul. 1996, pp. 41-48.
Waldinger et al., “Deductive Question Answering from Multiple Resources”, New Directions in Question Answering, Published by AAAI, Menlo Park, 2003, 22 pages.
Walker et al., “Natural Language Access to Medical Text”, SRI International, Artificial Intelligence Center, Mar. 1981, 23 pages.
Walker et al., “The LOCUS Distributed Operating System 1”, University of California Los Angeles, 1983, pp. 49-70.
Waltz, D., “An English Language Question Answering System for a Large Relational Database”, ACM, vol. 21, No. 7, 1978, 14 pages.
Wang et al., “An Industrial-Strength Audio Search Algorithm”, In Proceedings of the International Conference on Music Information Retrieval (ISMIR), 2003, 7 pages.
Wang et al., “An Initial Study on Large Vocabulary Continuous Mandarin Speech Recognition with Limited Training Data Based on Sub-Syllabic Models”, International Computer Symposium, vol. 2, 1994, pp. 1140-1145.
Wang et al., “Tone Recognition of Continuous Mandarin Speech Based on Hidden Markov Model”, International Journal of Pattern Recognition and Artificial Intelligence, vol. 8, 1994, pp. 233-245.
Ward et al., “A Class Based Language Model for Speech Recognition”, IEEE, 1996, 3 pages.
Ward et al., “Recent Improvements in the CMU Spoken Language Understanding System”, ARPA Human Language Technology Workshop, 1994, 4 pages.
Ward, Wayne, “The CMU Air Travel Information Service: Understanding Spontaneous Speech”, Proceedings of the Workshop on Speech and Natural Language, HLT '90, 1990, pp. 127-129.
Ware et al., “The DragMag Image Magnifier Prototype I”, Apple Inc., Video Clip, Marlon, on a CD, Applicant is not Certain about the Date for the Video Clip., 1995.
Ware et al., “The DragMag Image Magnifier”, CHI '95 Mosaic of Creativity, May 7-11, 1995, pp. 407-408.
Warren et al., “An Efficient Easily Adaptable System for Interpreting Natural Language Queries”, American Journal of Computational Linguistics, vol. 8, No. 3-4, 1982, 11 pages.
Watabe et al., “Distributed Multiparty Desktop Conferencing System: MERMAID”, CSCW 90 Proceedings, Oct. 1990, pp. 27-38.
Weizenbaum, J., “ELIZA—A Computer Program for the Study of Natural Language Communication Between Man and Machine”, Communications of the ACM, vol. 9, No. 1, Jan. 1966, 10 pages.
Werner et al., “Prosodic Aspects of Speech, Universite de Lausanne”, Fundamentals of Speech Synthesis and Speech Recognition: Basic Concepts, State of the Art and Future Challenges, 1994, 18 pages.
Westerman, Wayne, “Hand Tracking, Finger Identification and Chordic Manipulation on A Multi-Touch Surface”, Doctoral Dissertation, 1999, 363 Pages.
What is Fuzzy Logic?, available at <http://www.cs.cmu.edu>, retrieved on Apr. 15, 1993, 5 pages.
White, George M., “Speech Recognition, Neural Nets, and Brains”, Jan. 1992, pp. 1-48.
Wikipedia, “Acoustic Model”, available at <http://en.wikipedia.org/wiki/AcousticModel>, retrieved on Sep. 14, 2011, 2 pages.
Wikipedia, “Language Model”, available at <http://en.wikipedia.org/wiki/Language_model>, retrieved on Sep. 14, 2011, 3 pages.
Wikipedia, “Speech Recognition”, available at <http://en.wikipedia.org/wiki/Speech_recognition>, retrieved on Sep. 14, 2011, 10 pages.
Wilensky et al., “Talking to UNIX in English: An Overview of UC”, Communications of the ACM, vol. 27, No. 6, Jun. 1984, pp. 574-593.
Wilson, Mark, “New iPod Shuffle Moves Buttons to Headphones, Adds Text to Speech”, available at <http://gizmodo.com/5167946/new-ipod-shuffle-moves-buttons-to-headphones-adds-text-to-speech>, Mar. 11, 2009, 13 pages.
Windows XP: A Big Surprise!—Experiencing Amazement from Windows XP, New Computer, No. 2, Feb. 28, 2002, 8 pages.
Winiwarter et al., “Adaptive Natural Language Interfaces to FAQ Knowledge Bases”, Proceedings of 4th International Conference on Applications of Natural Language to Information Systems, Austria, Jun. 1999, 22 pages.
Wirelessinfo, “SMS/MMS Ease of Use (8.0)”, available at <http://www.wirelessinfo.com/content/palm-Treo-750-Cell-Phone-Review/Messaging.htm>, Mar. 2007, 3 pages.
Wolff, M., “Post Structuralism and the ARTFUL Database: Some Theoretical Considerations”, Information Technology and Libraries, vol. 13, No. 1, Mar. 1994, 10 pages.
Wong et al., “An 800 Bit/s Vector Quantization LPC Vocoder”, (IEEE Transactions on Acoustics, Speech and Signal Processing, Oct. 1982), as reprinted in Vector Quantization (IEEE Press, 1990), 1990, pp. 222-232.
Wong et al., “Very Low Data Rate Speech Compression with LPC Vector and Matrix Quantization”, (Proceedings of the IEEE Int'l Acoustics, Speech and Signal Processing Conference, Apr. 1983), as reprinted in Vector Quantization (IEEE Press, 1990), 1990, pp. 233-236.
Worldwide Character Encoding, Version 2.0, vols. 1,2 by Unicode, Inc., 12 pages.
Written Opinion received for PCT Patent Application No. PCT/US2005/046797, dated Nov. 24, 2006, 9 pages.
Wu et al., “Automatic Generation of Synthesis Units and Prosodic Information for Chinese Concatenative Synthesis”, Speech Communication, vol. 35, No. 3-4, Oct. 2001, pp. 219-237.
Wu et al., “KDA: A Knowledge-Based Database Assistant”, Proceeding of the Fifth International Conference on Engineering (IEEE Cat.No. 89CH2695-5), 1989, 8 pages.
Wu, M., “Digital Speech Processing and Coding”, Multimedia Signal Processing, Lecture-2 Course Presentation, University of Maryland, College Park, 2003, 8 pages.
Wu, M., “Speech Recognition, Synthesis, and H.C.I.”, Multimedia Signal Processing, Lecture—3 Course Presentation, University of Maryland, College Park, 2003, 11 pages.
Wyle, M. F., “A Wide Area Network Information Filter”, Proceedings of First International Conference on Artificial Intelligence on Wall Street, Oct. 1991, 6 pages.
Xiang et al., “Correcting Phoneme Recognition Errors in Learning Word Pronunciation through Speech Interaction”, Speech Communication, vol. 55, No. 1, Jan. 1, 2013, pp. 190-203.
Xu et al., “Speech-Based Interactive Games for Language Learning: Reading, Translation, and Question-Answering”, Computational Linguistics and Chinese Language Processing, vol. 14, No. 2, Jun. 2009, pp. 133-160.
Yang et al., “Auditory Representations of Acoustic Signals”, IEEE Transactions of Information Theory, vol. 38, No. 2, Mar. 1992, pp. 824-839.
Yang et al., “Hidden Markov Model for Mandarin Lexical Tone Recognition”, IEEE Transactions on Acoustics, Speech and Signal Processing, vol. 36, No. 7, Jul. 1988, pp. 988-992.
Yang et al., “Smart Sight: A Tourist Assistant System”, Proceedings of Third International Symposium on Wearable Computers, 1999, 6 pages.
Yankelovich et al., “Intermedia: The Concept and the Construction of a Seamless Information Environment”, Computer Magazine, IEEE, Jan. 1988, 16 pages.
Yarowsky, David, “Homograph Disambiguation in Text-to-Speech Synthesis”, Chapter 12, Progress in Speech Synthesis, 1997, pp. 157-172.
Yiourgalis et al., “Text-to-Speech system for Greek”, ICASSP 91, vol. 1, May 14-17, 1991, pp. 525-528.
Yoon et al., “Letter-to-Sound Rules for Korean”, Department of Linguistics, The Ohio State University, 2002, 4 pages.
Young et al, “The HTK Book”, Version 3.4, Dec. 2006, 368 pages.
Youtube, “New bar search for Facebook”, Available at “https://www.youtube.com/watch?v=vwgN1WbvCas”, 1 page.
Yunker, John, “Beyond Borders: Web Globalization Strategies”, New Riders, Aug. 22, 2002, 11 pages.
Zainab, “Google Input Tools Shows Onscreen Keyboard in Multiple Languages [Chrome]”, available at <http://www.addictivetips.com/internet-tips/google-input-tools-shows-multiple-language-onscreen-keyboards-chrome/>, Jan. 3, 2012, 3 pages.
Zangerle et al., “Recommending #-Tag in Twitter”, Proceedings of the Workshop on Semantic Adaptive Socail Web, 2011, pp. 1-12.
Zelig, “A Review of the Palm Treo 750v”, available at <http://www.mtekk.com.au/Articles/tabid/54/articleType/ArticleView/articleId/769/A-Review-of-the-Palm-Treo-750v.aspx>, Feb. 5, 2007, 3 pages.
Zeng et al., “Cooperative Intelligent Software Agents”, The Robotics Institute, Carnegie-Mellon University, Mar. 1995, 13 pages.
Zhang et al., “Research of Text Classification Model Based on Latent Semantic Analysis and Improved HS-SVM”, Intelligent Systems and Applications (ISA), 2010 2nd International Workshop, May 22-23, 2010, 5 pages.
Zhao et al., “Intelligent Agents for Flexible Workflow Systems”, Proceedings of the Americas Conference on Information Systems (AMCIS), Oct. 1998, 4 pages.
Zhao, Y., “An Acoustic-Phonetic-Based Speaker Adaptation Technique for Improving Speaker-Independent Continuous Speech Recognition”, IEEE Transactions on Speech and Audio Processing, vol. 2, No. 3, Jul. 1994, pp. 380-394.
Zhong et al., “JustSpeak: Enabling Universal Voice Control on Android”, W4A'14, Proceedings of the 11th Web for All Conference, No. 36, Apr. 7-9, 2014, 8 pages.
Ziegler, K, “A Distributed Information System Study”, IBM Systems Journal, vol. 18, No. 3, 1979, pp. 374-401.
Zipnick et al., “U.S. Appl. No. 10/859,661, filed Jun. 2, 2004”.
Zovato et al., “Towards Emotional Speech Synthesis: A Rule based Approach”, Proceedings of 5th ISCA Speech Synthesis Workshop—Pittsburgh, 2004, pp. 219-220.
Zue et al., “From Interface to Content: Translingual Access and Delivery of On-Line Information”, Eurospeech, 1997, 4 pages.
Zue et al., “Jupiter: A Telephone-Based Conversational Interface for Weather Information”, IEEE Transactions on Speech and Audio Processing, Jan. 2000, 13 pages.
Zue et al., “Pegasus: A Spoken Dialogue Interface for On-Line Air Travel Planning”, Speech Communication, vol. 15, 1994, 10 pages.
Zue et al., “The Voyager Speech Understanding System: Preliminary Development and Evaluation”, Proceedings of IEEE, International Conference on Acoustics, Speech and Signal Processing, 1990, 4 pages.
Zue, Victor W., “Toward Systems that Understand Spoken Language”, ARPA Strategic Computing Institute, Feb. 1994, 9 pages.
Zue, Victor, “Conversational Interfaces: Advances and Challenges”, Spoken Language System Group, Sep. 1997, 10 pages.
Applicant-Initiated Interview Summary received for U.S. Appl. No. 16/352,410, dated Mar. 18, 2020, 3 pages.
Non-Final Office Action received for U.S. Appl. No. 16/352,410, dated Dec. 2, 2019, 9 pages.
Notice of Allowance received for U.S. Appl. No. 16/352,410, dated Mar. 26, 2020, 8 pages.
Office Action received for Australian Patent Application No. 2019283968, dated Jul. 24, 2020, 3 pages.
AAAAPLAY, “Sony Media Remote for iOS and Android”, Online available at <https://www.youtube.com/watch?v=W8QoeQhlGok>, Feb. 4, 2012, 3 pages.
Android Authority, “How to use Tasker: A Beginner's Guide”, Online available at:—<https://youtube.com/watch?v= rDpdS_YWzFc>, May 1, 2013, 1 page.
Asakura et al., “What LG thinks; How the TV should be in the Living Room”, HiVi, vol. 31, No. 7, Stereo Sound Publishing, Inc., Jun. 17, 2013, pp. 68-71 (Official Copy Only). {See communication under 37 CFR § 1.98(a) (3)}.
Ashbrook, Daniel L., “Enabling Mobile Microinteractions”, May 2010, 186 pages.
Ashingtondctech & Gaming, “SwipeStatusBar—Reveal the Status Bar in a Fullscreen App”, Online Available at: <https://www.youtube.com/watch?v=wA_tT9IAreQ>, Jul. 1, 2013, 3 pages.
“Ask Alexa—Things That Are Smart Wiki”, Online available at:—<http://thingsthataresmart.wiki/index.php?title=Ask_Alexa&oldid=4283>, Jun. 8, 2016, pp. 1-31.
Automate Your Life, “How to Setup Google Home Routines—A Google Home Routines Walkthrough”, Online Available at: <https://www.youtube.com/watch?v=pXokZHP9kZg>, Aug. 12, 2018, 1 page.
Bell, Jason, “Machine Learning Hands-On for Developers and Technical Professionals”, Wiley, 2014, 82 pages.
Bellegarda, Jeromer, “Chapter 1: Spoken Language Understanding for Natural Interaction: The Siri Experience”, Natural Interaction with Robots, Knowbots and Smartphones, 2014, pp. 3-14.
Bellegarda, Jeromer, “Spoken Language Understanding for Natural Interaction: The Siri Experience”, Slideshow retrieved from : <https://www.uni-ulm.de/fileadmin/website_uni_ulm/iui.iwsds2012/files/Bellegarda.pdf>, International Workshop on Spoken Dialog Systems (IWSDS), May 2012, pp. 1-43.
beointegration.com, “BeoLink Gateway—Programming Example”, Online Available at: <https:/ /www.youtube.com/watch?v=TXDaJFm5UH4>, Mar. 4, 2015, 3 pages.
Burgess, Brian, “Amazon Echo Tip: Enable the Wake Up Sound”, Online available at:13 <https://www.groovypost.com/howto/amazon-echo-tip-enable-wake-up-sound/>, Jun. 30, 2015, 4 pages.
Cambria et al., “Jumping NLP curves: A Review of Natural Language Processing Research.”, IEEE Computational Intelligence magazine, 2014, vol. 9, May 2014, pp. 48-57.
Chang et al., “Monaural Multi-Talker Speech Recognition with Attention Mechanism and Gated Convolutional Networks”, Interspeech 2018, Sep. 2-6, 2018, pp. 1586-1590.
Chen et al., “A Convolutional Neural Network with Dynamic Correlation Pooling”, 13th International Conference on Computational Intelligence and Security, IEEE, 2017, pp. 496-499.
Chen, Yi, “Multimedia Siri Finds and Plays Whatever You Ask For”, PSFK Report, Feb. 9, 2012, pp. 1-9.
Conneau et al., “Supervised Learning of Universal Sentence Representations from Natural Language Inference Data”, Proceedings of the 2017 Conference on Empirical Methods in Natural Language Processing, Copenhagen, Denmark, Sep. 7-11, 2017, pp. 670-680.
Coulouris et al., “Distributed Systems: Concepts and Design (Fifth Edition)”, Addison-Wesley, 2012, 391 pages.
Czech Lucas, “A System for Recognizing Natural Spelling of English Words”, Diploma Thesis, Karlsruhe Institute of Technology, May 7, 2014, 107 pages.
Delcroix et al., “Context Adaptive Deep Neural Networks For Fast Acoustic Model Adaptation”, ICASSP, 2015, pp. 4535-4539.
Delcroix et al., “Context Adaptive Neural Network for Rapid Adaptation of Deep CNN Based Acoustic Models”, Interspeech 2016, Sep. 8-12, 2016, pp. 1573-1577.
“DIRECTV™ Voice”, Now Part of the DIRECTTV Mobile App for Phones, Sep. 18, 2013, 5 pages.
Derrick, Amanda, “How to Set Up Google Home for Multiple Users”, Lifewire, Online available at:—<https://www.lifewire.com/set-up-google-home-multiple-users-4685691>, Jun. 8, 2020, 9 pages.
Detroitborg, “Apple Remote App (iPhone & iPod Touch): Tutorial and Demo”, Online Available at:—<https://www.youtube.com/watch?v=M_jzeEevKql>, Oct. 13, 2010, 4 pages.
Dihelson, “How Can I Use Voice or Phrases as Triggers to Macrodroid?”, Macrodroid Forums, Online Available at:—<https://www.tapatalk.com/groups/macrodroid/how-can-i-use-voice-or-phrases-as-triggers-to-macr-t4845.html>, May 9, 2018, 5 pages.
Earthling1984, “Samsung Galaxy Smart Stay Feature Explained”, Online available at:—<https://www.youtube.com/watch?v=RpjBNtSjupl>, May 29, 2013, 1 page.
Eder et al., “At the Lower End of Language—Exploring the Vulgar and Obscene Side of German”, Proceedings of the Third Workshop on Abusive Language Online, Florence, Italy, Aug. 1, 2019, pp. 119-128.
Filipowicz, Luke, “How to use the QuickType keyboard in iOS 8”, Online available at:—<https://www.imore.com/comment/568232>, Oct. 11, 2014, pp. 1-17.
Gadget Hacks, “Tasker Too Complicated?Give MacroDroid a Try [How-To]”, Online available at: <https://www.youtube.com/watch?v=8YL9cWCykKc>, May 27, 2016, 1 page.
“Galaxy S7: How to Adjust Screen Timeout & Lock Screen Timeout”, Online available at:—<https://www.youtube.com/watch?v=n6e1WKUS2ww>, Jun. 9, 2016, 1 page.
Gasic et al., “Effective Handling of Dialogue State in the Hidden Information State POMDP-based Dialogue Manager”, ACM Transactions on Speech and Language Processing, May 2011, pp. 1-25.
Ghauth et al., “Text Censoring System for Filtering Malicious Content Using Approximate String Matching and Bayesian Filtering”, Proc. 4th INNS Symposia Series on Computational Intelligence in Information Systems, Bandar Seri Begawan, Brunei, 2015, pp. 149-158.
Google Developers, “Voice search in your app”, Online available at:—<https://www.youtube.com/watch?v=PS1FbB5qWEI>, Nov. 12, 2014, 1 page.
Gupta et al., “I-vector-based Speaker Adaptation of Deep Neurai Networks For French Broadcast Audio Transcription”, ICASSP, 2014, 2014, pp. 6334-6338.
Gupta, Naresh, “Inside Bluetooth Low Energy”, Artech House, 2013, 274 pages.
“Hey Google: How to Create a Shopping List with Your Google Assistant”, Online available at:—<https://www.youtube.com/watch?v=w9NCsElax1Y>, May 25, 2018, 1 page.
“How To Enable Google Assistant on Galaxy S7 and Other Android Phones (No Root)”, Online available at:—<https://www.youtube.com/watch?v=HeklQbWyksE>, Mar. 20, 2017, 1 page.
“How to Use Ok Google Assistant Even Phone is Locked”, Online available at:—<https://www.youtube.com/watch?v=9B_gP4j_SP8>, Mar. 12, 2018, 1 page.
Hershey et al., “Deep Clustering: Discriminative Embeddings For Segmentation And Separation”, Proc. ICASSP, Mar. 2016, 6 pages.
Hutsko et al., “iPhone All-in-One for Dummies”, 3rd Edition, 2013, 98 pages.
Ikeda, Masaru, “beGLOBAL SEOUL 2015 Startup Battle: Talkey”, YouTube Publisher, Online Available at:—<https://www.youtube.com/watch?v=4Wkp7sAAIdg>, May 14, 2015, 1 page.
Inews and Tech, “How To Use The QuickType Keyboard In IOS 8”, Online available at:—<http://www.inewsandtech.com/how-to-use-the-quicktype-keyboard-in-ios-8/>, Sep. 17, 2014, 6 pages.
Internet Services and Social Net, “How to Search for Similar Websites”, Online available at:—<https://www.youtube.com/watch?v=nLf2uirpt5s>, see from 0:17 to 1:06, Jul. 4, 2013, 1 page.
“IPhone 6 Smart Guide Full Version for SoftBank”, Gijutsu-Hyohron Co., Ltd., vol. 1, Dec. 1, 2014, 4 pages (Official Copy Only). {See communication under 37 CFR § 1.98(a) (3)}.
Isik et al., “Single-Channel Multi-Speaker Separation using Deep Clustering”, Interspeech 2016, Sep. 8-12, 2016, pp. 545-549.
Jonsson et al., “Proximity-based Reminders Using Bluetooth”, 2014 IEEE International Conference on Pervasive Computing and Communications Demonstrations, 2014, pp. 151-153.
Karn, Ujjwal, “An Intuitive Explanation of Convolutional Neural Networks”, The Data Science Blog, Aug. 11, 2016, 23 pages.
Kastrenakes, Jacob, “Siri's creators will unveil their new AI bot on Monday”, The Verge, Online available at:—<https://web.archive.org/web/20160505090418/https://www.theverge.com/2016/5/4/11593564/viv-labs-unveiling-monday-new-ai-from-siri-creators>, May 4, 2016, 3 pages.
King et al., “Robust Speech Recognition Via Anchor Word Representations”, Interspeech 2017, Aug. 20-24, 2017, pp. 2471-2475.
Lee, Sungjin, “Structured Discriminative Model For Dialog State Tracking”, Proceedings of the SIGDIAL 2013 Conference, Aug. 22-24, 2013, pp. 442-451.
“Link Your Voice to Your Devices with Voice Match, Google Assistant Help”, Online available at:—<https://support.googie.com/assistant/answer/9071681?co=GENIE.Platform%3DAndroid&hl=en>, Retrieved on Jul. 1, 2020, 2 pages.
Liou et al., “Autoencoder for Words”, Neurocomputing, vol. 139, Sep. 2014, pp. 84-96.
Liu et al., “Accurate Endpointing with Expected Pause Duration”, Sep. 6-10, 2015, pp. 2912-2916.
Loukides et al., “What Is the Internet of Things?”, O'Reilly Media, Inc., Online Available at: <https://www.oreilly.com/iibrary/view/what-is-the/9781491975633/>, 2015, 31 pages.
Luo et al., “Speaker-Independent Speech Separation With Deep Attractor Network”, IEEE/ACM Transactions On Audio, Speech, And Language Processing, vol. 26, No. 4, Apr. 2018, pp. 787-796.
Majerus Wesley, “Cell Phone Accessibility for Your Blind Child”, Online available at:—<https://web.archive.org/web/20100210001100/https://nfb.org/images/nfb/publications/fr/fr28/3/fr280314.htm>, 2010, pp. 1-5.
Malcangi Mario, “Text-driven Avatars Based on Artificial Neural Networks and Fuzzy Logic”, International Journal of Computers, vol. 4, No. 2, Dec. 31, 2010, pp. 61-69.
Marketing Land, “Amazon Echo: Play music”, Online Available at:—<https://www.youtube.com/watch?v=A7V5NPbsXi4>, April 27, 2015, 3 pages.
Mhatre et al., “Donna Interactive Chat-bot acting as a Personal Assistant”, International Journal of Computer Applications (0975-8887), vol. 140, No. 10, Apr. 2016, 6 pages.
Mikolov et al., “Linguistic Regularities in Continuous Space Word Representations”, Proceedings of NAACL-HLT, Jun. 9-14, 2013, pp. 746-751.
Modern Techies, “Braina-Artificial Personal Assistant for PC(like Cortana,Siri)!!!!”, Online available at: <https://www.youtube.com/watch?v=_Coo2P8ilqQ>, Feb. 24, 2017, 3 pages.
Nakamura et al., “Realization of a Browser to Filter Spoilers Dynamically”, vol. No.67, 2010, 8 pages (Official Copy Only). {See communication under 37 CFR § 1.98(a) (3)}.
Nakamura et al., “Study of Information Clouding Methods to Prevent Spoilers of Sports Match”, Proceedings of the International Working Conference on Advanced Visual Interfaces (AVI' 12), ISBN: 978-1-4503-1287-5, May 2012, pp. 661-664.
Nakamura et al., “Study of Methods to Diminish Spoilers of Sports Match: Potential of a Novel Concept “Information Clouding””, vol. 54, No. 4, ISSN: 1882-7764. Online available at: <https://ipsj.ixsq.nii.ac.jp/ej/index.php?active_action=repository_view_main_item_detail&page_id=13&block_id=8&item_id=91589&item_no=1>, Apr. 2013, pp. 1402-1412 (Official Copy Only). {See communication under 37 CFR § 1.98(a) (3)}.
Nakamura Satoshi, “Antispoiler: An Web Browser to Filter Spoiler”, vol. 2010-HCL-139 No.17, Online available at:—<https://ipsj.ixsq.nii.ac.jp/ej/index.php?active_action=repository_view_main_item_detail&page_id=13&block_id=8&item_id=70067&item_no=1>, Jul. 31, 2010, 8 pages (Official Copy Only). {See communication under 37 CFR § 1.98(a) (3)}.
Nakazawa et al., “Detection and Labeling of Significant Scenes from TV program based on Twitter Analysis”, Proceedings of the 3rd Forum on Data Engineering and Information Management (deim 2011 proceedings), IEICE Data Engineering Technical Group, Feb. 28, 2011, 11 pages (Official Copy Only). {See communication under 37 CFR § 1.98(a) (3)}.
Nozawa et al., “iPhone 4S Perfect Manual”, vol. 1, First Edition, Nov. 11, 2011, 4 pages (Official Copy Only). {See communication under 37 CFR § 1.98(a) (3)}.
Office Action received for Brazilian Patent Application No. BR122012028965-5, dated Oct. 9, 2020, 5 pages (2 pages of English Translation and 3 pages of Official Copy).
Office Action received for Brazilian Patent Application No. BR122012028966-3, dated Oct. 9, 2020, 5 pages (2 pages of English Translation and 3 pages of Official Copy).
Office Action received for Brazilian Patent Application No. BR122012028968-0, dated Oct. 9, 2020, 5 pages (2 pages of English Translation and 3 pages of Official Copy).
Office Action received for Brazilian Patent Application No. BR122012028970-1, dated Oct. 9, 2020, 5 pages (2 pages of English Translation and 3 pages of Official Copy).
Office Action received for Brazilian Patent Application No. BR122012028971-0, dated Oct. 9, 2020, 5 pages (2 pages of English Translation and 3 pages of Official Copy).
Office Action received for Brazilian Patent Application No. BR122012028973-6, dated Oct. 9, 2020, 5 pages (2 pages of English Translation and 3 pages of Official Copy).
Office Action received for Brazilian Patent Application No. BR122012028974-4, dated Oct. 9, 2020, 5 pages (2 pages of English Translation and 3 pages of Official Copy).
Office Action received for Korean Patent Application No. 10-2020-7023927, dated Nov. 18, 2020, 10 pages (4 pages of English Translation and 6 pages of Official Copy).
Pak, Gamerz, “Braina: Artificially Intelligent Assistant Software for Windows PC in (urdu / hindhi)”, Online available at: <https://www.youtube.com/watch?v=JH_rMjw8lqc>, Jul. 24, 2018, 3 pages.
Patra et al., “A Kernel-Based Approach for Biomedical Named Entity Recognition”, Scientific World Journal, vol. 2013, 2013, pp. 1-7.
PC MAG, “How to Voice Train Your Google Home Smart Speaker”, Online available at: <https://in.pcmag.com/google-home/126520/how-to-voice-train-your-google-home-smart-speaker>, Oct. 25, 2018, 12 pages.
Pennington et al., “GloVe: Global Vectors for Word Representation”, Proceedings of the Conference on Empirical Methods Natural Language Processing (EMNLP), Doha, Qatar, Oct. 25-29, 2014, pp. 1532-1543.
Perlow, Jason, “Alexa Loop Mode with Playlist for Sleep Noise”, Online Available at: <https://www.youtube.com/watch?v=nSkSuXziJSg>, Apr. 11, 2016, 3 pages.
“Phoenix Solutions, Inc. v. West Interactive Corp.”, Document 40, Declaration of Christopher Schmandt Regarding the MIT Galaxy System, Jul. 2, 2010, 162 pages.
pocketables.com,“AutoRemote example profile”, Online available at: https://www.youtube.com/watch?v=kC_zhUnNZj8, Jun. 25, 2013, 1 page.
Qian et al., “Single-channel Multi-talker Speech Recognition With Permutation Invariant Training”, Speech Communication, Issue 104, 2018, pp. 1-11.
“Quick Type Keyboard on iOS 8 Makes Typing Easier”, Online available at:—<https://www.youtube.com/watch?v=0CIdLR4fhVU>, Jun. 3, 2014, 3 pages.
Rasch, Katharina, “Smart Assistants for Smart Homes”, Doctoral Thesis in Electronic and Computer Systems, 2013, 150 pages.
Ritchie, Rene, “QuickType keyboard in iOS 8: Explained”, Online Available at:—<https://www.imore.com/quicktype-keyboards-ios-8-explained>, Jun. 21, 2014, pp. 1-19.
Rowland et al., “Designing Connected Products: UX for the Consumer Internet of Things”, O'Reilly, May 2015, 452 pages.
Samsung Support, “Create a Quick Command in Bixby to Launch Custom Settings by at Your Command”, Online Available at:—<https://www.facebook.com/samsungsupport/videos/10154746303151213>, Nov. 13, 2017, 1 page.
Santos et al., “Fighting Offensive Language on Social Media with Unsupervised Text Style Transfer”, Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics (vol. 2: Short Papers), May 20, 2018, 6 pages.
Seehafer Brent, “Activate Google Assistant on Galaxy S7 with Screen off”, Online available at:—<https://productforums.google.com/forum/#!topic/websearch/lp3qlGBHLVI>, Mar. 8, 2017, 4 pages.
Selfridge et al., “Interact: Tightly-coupling Multimodal Dialog with an Interactive Virtual Assistant”, International Conference on Multimodal Interaction, ACM, Nov. 9, 2015, pp. 381-382.
Senior et al., “Improving DNN Speaker Independence With I-Vector Inputs”, ICASSP, 2014, pp. 225-229.
Seroter et al., “SOA Patterns with BizTalk Server 2013 and Microsoft Azure”, Packt Publishing, Jun. 2015, 454 pages.
Settle et al., “End-to-End Multi-Speaker Speech Recognition”, Proc. ICASSP, Apr. 2018, 6 pages.
Shen et al., “Style Transfer from Non-Parallel Text by Cross-Alignment”, 31st Conference on Neural Information Processing Systems (NIPS 2017), 2017, 12 pages.
Siou, Serge, “How to Control Apple TV 3rd Generation Using Remote app”, Online available at: <https://www.youtube.com/watch?v=PhyKftZ0S9M>, May 12, 2014, 3 pages.
“Skilled at Playing my iPhone 5”, Beijing Hope Electronic Press, Jan. 2013, 6 pages (Official Copy Only). {See communication under 37 CFR § 1.98(a) (3)}.
Smith, Jake, “Amazon Alexa Calling: How to Set it up and Use it on Your Echo”, iGeneration, May 30, 2017, 5 pages.
Sundermeyer et al., “From Feedforward to Recurrent LSTM Neural Networks for Language Modeling.”, IEEE Transactions to Audio, Speech, and Language Processing, vol. 23, No. 3, Mar. 2015, pp. 517-529.
Sundermeyer et al., “LSTM Neural Networks for Language Modeling”, Interspeech 2012, Sep. 9-13, 2012, pp. 194-197.
Tan et al., “Knowledge Transfer In Permutation Invariant Training For Single-channel Multi-talker Speech Recognition”, ICASSP 2018, 2018, pp. 5714-5718.
Tanaka, Tatsuo, “Next Generation IT Channel Strategy Through “Experience Technology””, Intellectual Resource Creation, Japan, Nomura Research Institute Ltd. vol. 19, No. 1, Dec. 20, 2010, 17 pages. (Official Copy Only) {See communication under 37 CFR § 1.98(a) (3)}.
Vaswani et al., “Attention Is All You Need”, 31st Conference on Neural Information Processing Systems (NIPS 2017), 2017, pp. 1-11.
Villemure et al., “The Dragon Drive Innovation Showcase: Advancing the State-of-the-art in Automotive Assistants”, 2018, 7 pages.
Vodafone Deutschland, “Samsung Galaxy S3 Tastatur Spracheingabe”, Online available at—<https://www.youtube.com/watch?v=6kOd6Gr8uFE>, Aug. 22, 2012, 1 page.
Wang et al., “End-to-end Anchored Speech Recognition”, Proc. ICASSP2019, May 12-17, 2019, 5 pages.
Weng et al., “Deep Neural Networks for Single-Channel Multi-Talker Speech Recognition”, IEEE/ACM Transactions On Audio, Speech, And Language Processing, vol. 23, No. 10, Oct. 2015, pp. 1670-1679.
Wikipedia, “Home Automation”, Online Available at:—<https://en.wikipedia.org/w/index.php?title=Home_automation&oldid=686569068>, Oct. 19, 2015, 9 pages.
Wikipedia, “Siri”, Online Available at:—<https://en.wikipedia.org/w/index.php?title=Siri&oldid=689697795>, Nov. 8, 2015, 13 Pages.
Wikipedia, “Virtual Assistant”, Wikipedia, Online Available at:—<https://en.wikipedia.org/w/index.php?title=Virtual_assistant&oldid=679330666>, Sep. 3, 2015, 4 pages.
X.Ai, “How it Works”, Online available at:—<https://web.archive.org/web/20160531201426/https://x.ai/how-it-works/>, May 31, 2016, 6 pages.
Xu et al., “Policy Optimization of Dialogue Management in Spoken Dialogue System For Out-of-Domain Utterances”, 2016 International Conference On Asian Language Processing (IALP), IEEE, Nov. 21, 2016, pp. 10-13.
Yan et al., “A Scalable Approach to Using DNN-derived Features in GMM-HMM Based Acoustic Modeling for LVCSR”, 14th Annual Conference of the International Speech Communication Association, InterSpeech 2013, Aug. 2013, pp. 104-108.
Yang Astor, “Control Android TV via Mobile Phone APP RKRemoteControl”, Online Available at : <https://www.youtube.com/watch?v=zpmUeOX_xro>, Mar. 31, 2015, 4 pages.
Yates Michaelc., “How Can I Exit Google Assistant After I'm Finished with it”, Online available at:—<https://productforums.google.com/forum/#!msg/phone-by-google/faECnR2RJwA/gKNtOkQgAQAJ>, Jan. 11, 2016, 2 pages.
Ye et al., “iPhone 4S Native Secret”, Jun. 30, 2012, 1 page (Official Copy Only). {See communication under 37 CFR § 1.98(a) (3)}.
Yeh Jui-Feng, “Speech Act Identification Using Semantic Dependency Graphs With Probabilistic Context-free Grammars”, ACM Transactions on Asian and Low-Resource Language Information Processing, vol. 15, No. 1, Dec. 2015, pp. 5.1-5.28.
Young et al., “The Hidden Information State Model: A Practical Framework for POMDP-Based Spoken Dialogue Management”, Computer Speech & Language, vol. 24, Issue 2, Apr. 2010, pp. 150-174.
Yousef, Zulfikara., “Braina (A.I) Artificial Intelligence Virtual Personal Assistant”, Online available at:—<https://www.youtube.com/watch?v=2h6xpB8bPSA>, Feb. 7, 2017, 3 pages.
Yu et al., “Permutation Invariant Training Of Deep Models For Speaker-Independent Multi-talker Speech Separation”, Proc. ICASSP, 2017, 5 pages.
Yu et al., “Recognizing Multi-talker Speech with Permutation Invariant Training”, Interspeech 2017, Aug. 20-24, 2017, pp. 2456-2460.
Zhan et al., “Play with Android Phones”, Feb. 29, 2012, 1 page (Official Copy Only). {See communication under 37 CFR § 1.98(a) (3)}.
Zmolikova et al., “Speaker-Aware Neural Network Based Beamformer For Speaker Extraction In Speech Mixtures”, Interspeech 2017, Aug. 20-24, 2017, pp. 2655-2659.
Office Action received for Indian Patent Application No. 6734/CHENP/2012, dated Mar. 17, 2021, 3 pages.
Office Action received for Brazilian Patent Application No. BR122012028972-8, dated Sep. 4, 2020, 6 pages (1 page of English Translation and 5 pages of Official Copy).
Notice of Allowance received for Japanese Patent Application No. 2018-050944, dated Dec. 22, 2020, 4 pages (1 page of English Translation and 3 pages of Official Copy).
Office Action received for European Patent Application No. 18202474.5, dated Apr. 15, 2021, 15 pages.
Office Action received for Japanese Patent Application No. 2018-050944, dated Sep. 11, 2020, 4 pages (2 pages of English Translation and 2 pages of Official Copy).
Notice of Hearing received for Indian Patent Application No. 8905/CHENP/2012, mailed on Aug. 13, 2020, 2 pages.
Notice of Hearing received for Indian Patent Application No. 8906/CHENP/2012, mailed on May 11, 2021, 2 pages.
Notice of Hearing received for Indian Patent Application No. 8907/CHENP/2012, mailed on Feb. 3, 2021, 2 pages.
Summons to Attend Oral Proceedings received for European Patent Application No. 16188272.5, mailed on Apr. 26, 2021, 11 pages.
Office Action received for Canadian Patent Application No. 3077914, dated Jun. 8, 2021, 5 pages.
Board Opinion received for Chinese Patent Application No. 201480030811.4, dated May 13, 2020, 23 pages (1 page of English Translation and 22 pages of Official Copy).
Notice of Allowance received for Korean Patent Application No. 10-2020-7008719, dated Jun. 17, 2020, 5 pages (2 pages of English Translation and 3 pages of Official Copy).
Brief Communication received for European Patent Application No. 11707939.2, dated Oct. 9, 2020, 18 pages.
Notice of Allowance received for Korean Patent Application No. 10-2019-7018332, dated Sep. 28, 2020, 7 pages (2 pages of English Translation and 5 pages of Official Copy).
Office Action received for Australian Patent Application No. 2019283923, dated Sep. 25, 2020, 4 pages.
Brief Communication Regarding Oral Proceedings received for European Patent Application No. 16188272.5, dated Oct. 19, 2021, 2 pages.
Summons to Attend Oral Proceedings received for European Patent Application No. 16188272.5, mailed on Oct. 26, 2021, 11 pages.
Notice of Allowance received for Korean Patent Application No. 10-2020-7023927, dated May 27, 2021, 4 pages (2 pages of English Translation and 2 pages of Official Copy).
Office Action received for Australian Patent Application No. 2019283923, dated Jun. 2, 2021, 4 pages.
Office Action received for Russian Patent Application No. 2018112505, dated Sep. 2, 2021, 12 pages (5 pages of English Translation and 7 pages of Official Copy).
Result of Consultation received for European Patent Application No. 16188272.5, dated Oct. 13, 2021, 3 pages.
Office Action received for Australian Patent Application No. 2020257070, dated Oct. 14, 2021, 4 pages.
Office Action received for Japanese Patent Application No. 2020-109934, dated May 31, 2021, 5 pages (2 pages of English Translation and 3 pages of Official Copy).
Office Action received for Mexican Patent Application No. MX/a/2017/006911, dated Jun. 17, 2021, 5 pages (2 pages of English Translation and 3 pages of Official Copy).
Office Action received for Australian Patent Application No. 2019283923, dated Jul. 29, 2021, 6 pages.
Office Action received for Indian Patent Application No. 201948016386, dated Oct. 29, 2021, 6 pages.
Intention to Grant received for Indian Patent Application No. 6734CHENP2012, dated Feb. 15, 2022, 2 pages.
Office Action received for Mexican Patent Application No. MX/a/2017/006911, dated Feb. 22, 2022, 12 pages (5 pages of English Translation and 7 pages of Official Copy).
Notice of Allowance received for Korean Patent Application No. 10-2021-7027594, dated Mar. 14, 2022, 4 pages (1 page of English Translation and 3 pages of Official Copy).
Office Action received for Japanese Patent Application No. 2020-109934, dated Mar. 18, 2022, 6 pages (3 pages of English Translation and 3 pages of Official Copy).
Seto Haruka, “Application Integration Programming with VBA Next Generation Office Development Techniques”, Visual Basic magazine, SHOEISHA Co., Ltd., vol. 6, No. 12, Oct. 1, 2000, 15 pages (Official Copy Only) {See Communication under 37 CFR § 1.98(a) (3)}.
Summons to Attend Oral Proceedings received for European Patent Application No. 18202474.5, mailed on Mar. 14, 2022, 15 pages.
Windows Practical & Secret Techniques Compendium, C & R Institute Inc, first Edition, Natsumesha Co., Ltd., Apr. 10, 2007, 5 pages (Official Copy Only) {See Communication under 37 CFR § 1.98(a) (3)}.
Brief Communication Regarding Oral Proceedings received for European Patent Application No. 16188272.5, dated Dec. 2, 2021, 1 page.
Decision to Refuse received for European Patent Application No. 16188272.5, dated Dec. 9, 2021, 2 pages.
Office Action received for European Patent Application No. 19195766.1, dated Jan. 3, 2022, 11 pages.
Brief Communication Regarding Oral Proceedings received for European Patent Application No. 16188272.5, mailed on Nov. 24, 2021, 21 pages.
Notice of Allowance received for Korean Patent Application No. 10-2020-7037138, dated Nov. 24, 2021, 3 pages (1 page of English Translation and 2 pages of Official Copy).
Office Action received for Korean Patent Application No. 10-2021-7027594, dated Nov. 30, 2021, 9 pages (4 pages of English Translation and 5 pages of Official Copy).
Office Action received for Australian Patent Application No. 2021202350, dated Apr. 12, 2022, 3 pages.
Notice of Allowance received for Korean Patent Application No. 10-2022-7006342, dated Apr. 29, 2022, 5 pages (2 pages of English Translation and 3 pages of Official Copy).
Office Action received for Canadian Patent Application No. 3,077,914, dated Apr. 26, 2022, 4 pages.
Office Action received for Australian Patent Application No. 2020257070, dated May 23, 2022, 2 pages.
Notice of Acceptance received for Australian Patent Application No. 2020257070, dated Jun. 9, 2022, 3 pages.
Related Publications (1)
Number Date Country
20200279556 A1 Sep 2020 US
Provisional Applications (1)
Number Date Country
61295774 Jan 2010 US
Continuations (3)
Number Date Country
Parent 15394162 Dec 2016 US
Child 16879643 US
Parent 13492809 Jun 2012 US
Child 15394162 US
Parent 12987982 Jan 2011 US
Child 13492809 US