Isolating a portion of an online computing service for testing

Information

  • Patent Grant
  • 10691445
  • Patent Number
    10,691,445
  • Date Filed
    Wednesday, June 27, 2018
    6 years ago
  • Date Issued
    Tuesday, June 23, 2020
    4 years ago
Abstract
Techniques for isolating a portion of an online computing service referred to as a deployment unit and configured with a complete build of the online computing service may include routing production traffic away from the deployment unit, applying one or more changes to the complete build, and after applying one or more changes to the complete build, using the deployment unit for testing these changes using end-to-end tests. In one embodiment, the deployment unit may be dedicated to a specific group of tenants that require at least some isolation from other tenants.
Description
BACKGROUND

An online computing service may be continuously updated with changes to meet the demands imposed by production traffic and provide business value. There are considerable risks involved with updating a component of the online computing service. Different online computing services employ conventional mechanisms to manage the conflicting requirements of managing the risk and deploying fixes/customer-asks with high agility and negligible customer impact.


There are multiple types of test environments for resembling a production environment in some capacity. However, no matter how close the test environment is to the production environment, the production environment most likely will have some unique characteristics distinguishing it from test environments. There is a strong possibility of discovering issues in the production environment even when a change has been validated in the test environments. Furthermore, employing multiple test environments increases costs significantly. In addition, before a change is rolled out to the production environment, development teams employ deployment verification tests that are run on each changed component. These tests, however, do not resemble real-world scenarios that normally occur in the production environment. Typically, deploying the changed component across the online computing service consumes multiple days.


It is with respect to these and other considerations that the present improvements have been needed.


SUMMARY

The following presents a simplified summary in order to provide a basic understanding of some novel embodiments described herein. This summary is not an extensive overview, and it is not intended to identify key/critical elements or to delineate the scope thereof. Its sole purpose is to present some concepts in a simplified form as a prelude to the more detailed description that is presented later.


Various embodiments are generally directed to techniques to isolating a portion of an online computing service for various purposes. Some embodiments are particularly directed to techniques to isolating a portion of online computing service for validating a new/upgraded build of the online computing service and/or for segregating production traffic from a specific subset of users. Validation of the new/upgraded build may be accomplished via testing of a service instance associated with the new/upgraded build. In one embodiment, for example, an apparatus may comprise a management application stored on a set of memory units and operative on a processor. The management application may comprise a deployment component arranged to partition a resource capacity into deployment units of which each of the deployment units comprises a set of computing roles corresponding to running an online computing service for handling production traffic provided by a plurality of users. The deployment unit may be further arranged to migrate a deployment unit from a production endpoint into another endpoint, to modify one or more computing roles associated with the deployment unit to generate a modified deployment unit on the other endpoint, and to utilize the modified deployment unit for at least a portion of the production traffic. Other embodiments are described and claimed.


To the accomplishment of the foregoing and related ends, certain illustrative aspects are described herein in connection with the following description and the annexed drawings. These aspects are indicative of the various ways in which the principles disclosed herein can be practiced and all aspects and equivalents thereof are intended to be within the scope of the claimed subject matter. Other advantages and novel features will become apparent from the following detailed description when considered in conjunction with the drawings.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 illustrates an embodiment of a system to validate an online service.



FIG. 2 illustrates an embodiment of a set of components for an online computing service.



FIG. 3 illustrates an embodiment of a validation process for an online computing service.



FIG. 4 illustrates an embodiment of alternate validation process for an online computing service.



FIG. 5 illustrates an embodiment for isolating production traffic for an online computing service.



FIG. 6 illustrates an embodiment of a deployment unit for running an online computing service.



FIG. 7 illustrates an embodiment of an online computing service featuring isolated endpoints.



FIG. 8 illustrates another embodiment of an online computing service featuring isolated endpoints.



FIG. 9 illustrates an embodiment of a distributed system for the system of FIG. 1.



FIG. 10 illustrates an embodiment of a logic flow for the system of FIG. 1.



FIG. 11 illustrates an embodiment of a computing architecture.



FIG. 12 illustrates an embodiment of a communications architecture.





DETAILED DESCRIPTION

Various embodiments are directed to validate a new online computing service instance for execution of an upgraded build in a production data center by creating an endpoint that does not require a significant portion of resource capacity for testing/validation, and therefore, does not affect current production traffic. In one embodiment, this endpoint may be considered temporary or ephemeral. In another embodiment, this endpoint eventually becomes a new or next production endpoint and therefore, requires a permanent portion of the resource capacity. As described below, the upgraded build may result from one or more changes applied to a previous build, including hot-fixes, custom or new features, and/or the like.


Testing of the upgraded build is performed in production data centers using production servers and networking infrastructure. Such testing is end to end, involving a complete set of computing roles to ensure that not only the role/server functions correctly but the entire system works correctly. Such testing may simulate real-world scenarios related to the online computing service. In one example embodiment, major or minor changes may be rolled out if a problem arises after deploying the upgraded build. As an example, the production traffic may re-routed to an endpoint associated with an older build of the online computer service.


The various embodiments described herein allow for the deployment of new/replacement software and/or other changes to the online computing service to be either propagated across all service instances with a single deployment, or concentrated to an isolated service instance in order to support specific tenants. The online computing service includes computing roles that have persistent data stores as well as stateless computer roles that do not have persistent data stores. Some persistent data stores can be shared across isolated service instances, such as those that contain non-sensitive data, such as spam signatures.


Instead of using dedicated cloud service components and endpoints that are independently managed, the various embodiments described herein allow for aspects of the online computing service architecture to be shared. In one embodiment, by partitioning the online computing service service's resource capacity into deployments units, each representing complete builds of the online computing service, as described herein, the complete build may be upgraded and tested through one deployment unit. When the upgraded complete build is validated, the deployment unit may be used for actual production traffic from tenants. In another embodiment, the deployment unit may support tenants that request complete isolation from other tenants.


As a result, the embodiments can improve affordability, scalability, modularity, extendibility, or interoperability for an operator, device or network.


With general reference to notations and nomenclature used herein, the detailed descriptions which follow may be presented in terms of program procedures executed on a computer or network of computers. These procedural descriptions and representations are used by those skilled in the art to most effectively convey the substance of their work to others skilled in the art.


A procedure is here, and generally, conceived to be a self-consistent sequence of operations leading to a desired result. These operations 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 proves 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. It should be noted, however, that all of these and similar terms are to be associated with the appropriate physical quantities and are merely convenient labels applied to those quantities.


Further, the manipulations performed are often referred to in terms, such as adding or comparing, which are commonly associated with mental operations performed by a human operator. No such capability of a human operator is necessary, or desirable in most cases, in any of the operations described herein which form part of one or more embodiments. Rather, the operations are machine operations. Useful machines for performing operations of various embodiments include general purpose digital computers or similar devices.


Various embodiments also relate to apparatus or systems for performing these operations. This apparatus may be specially constructed for the required purpose or it may comprise a general purpose computer as selectively activated or reconfigured by a computer program stored in the computer. The procedures presented herein are not inherently related to a particular computer or other apparatus. Various general purpose machines may be used with programs written 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 machines will appear from the description given.


Reference is now made to the drawings, wherein like reference numerals are used to refer to like elements throughout. In the following description, for purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding thereof. It may be evident, however, that the novel embodiments can be practiced without these specific details. In other instances, well known structures and devices are shown in block diagram form in order to facilitate a description thereof. The intention is to cover all modifications, equivalents, and alternatives consistent with the claimed subject matter.



FIG. 1 illustrates a block diagram for a system 100. In one embodiment, the system 100 may comprise a computer-implemented system 100 having a management application 120 comprising one or more components 122-a. Although the system 100 shown in FIG. 1 has a limited number of elements in a certain topology, it may be appreciated that the system 100 may include more or less elements in alternate topologies as desired for a given implementation. Input 110 and Output 130 represent input/output activity associated with the system 100 in general.


It is worthy to note that “a” and “b” and “c” and similar designators as used herein are intended to be variables representing any positive integer. Thus, for example, if an implementation sets a value for a=5, then a complete set of components 122-a may include components 122-1, 122-2, and 122-3. The embodiments are not limited in this context.


The system 100 may comprise the management application 120, which may be generally arranged to generate a new service instance for an online computing service, establish a new endpoint for serving that new service instance to users, and assign a set of servers to the new endpoint. These servers may include resources dedicated to operating various computing roles for the new service instance. The management application 120 may be configured to apply one or more changes to the computing roles, for example, in order to upgrade the computing roles to a new build/version of the online computing service. As described below, these changes may be rigorously tested in a validation process prior to deployment onto other production endpoints for the online computing service. Alternatively, the management application segregates the computing roles from other servers associated with other services instances that serve the same domain of users, thereby creating a virtual endpoint.


The management application 120 may comprise a deployment component 122-1 generally arranged to modify the computing roles of the online computing service with new/replacement software code in a manner that does not considerably impact any user's experience or productivity. Once modified, the new computing roles are tested and those test results are analyzed during a validation process. If valid, the modified computing roles are migrated to the production endpoint where they become available for processing production traffic (e.g., customer or tenant data).


In one embodiment, the deployment component 122-1 may migrate a set the computing roles to the endpoint that comprise a complete build of the online computing service. By migrating this set of computing roles, end-to-end transactions may be invoked at the endpoint with only this set of computing roles. Hence, this set of computing roles may be referred to as a deployment unit. It is appreciated that in some embodiments, the set of computing roles may include stateless roles and zero, one, or more state-full roles.


The management application 120 may comprise a discovery component 122-2. Within the online computing service architecture, the discovery component 122-2 controls routing of the production traffic. The discovery component 122-2 may be generally arranged to manage routing data for the online computing service. In one embodiment, the deployment component 122-1 directs the discovery component 122-2 to process the routing data and route all production traffic away from the deployment unit comprising the above-mentioned set of computing roles.


The management application 120 may comprise a validation component 122-3. The validation component 122-3 may be generally arranged to perform a validation process on the modified deployment unit that comprises a variety of tests to measure performance, cost and/or other qualities. The validation component 122-3 performs all testing in production data centers using production servers and networking infrastructure. Testing is end to end involving all computing roles to ensure not only the role/server functions correctly but the entire system works correctly. Such testing may simulate real-world scenarios related to the online computing service. The validation component 122-3 may rollout major or minor changes if a problem arises after deploying an upgraded build of the online computing service. As an example, the discovery component 122-2 may re-route the production traffic to an endpoint associated with an older build of the online computer service.



FIG. 2 illustrates an embodiment of an operating environment 200 for the system 100. As shown in FIG. 2, the operating environment 200 includes a plurality of endpoints on which various computing resources for the system 100 are configured. Each endpoint may include one or more computing devices (e.g., servers) configured to execute one or more tasks that in some manner support an online computing service, such as a cloud computing service. As noted above, the online computing service as described herein may operate over one or more data networks in order to provide a plurality of computer users (e.g., endpoint users) with data and/or applications. FIG. 2 illustrates some example endpoints, including a discovery endpoint 210, a deployment endpoint 220, a validation endpoint 230 and endpoints 240, but it is appreciated that other endpoints are envisioned by the present disclosure. The endpoints 240 may corresponding to an instance of the online computing service. These endpoints include various computing roles of which a certain group or configuration of computing roles may represent a complete build for the online computing service described above for FIG. 1 through which end-to-end transactions may be executed.


One example endpoint, the discovery endpoint 210, includes the discovery component 122-2 configured to run the online computing service's discovery service for routing the production traffic. The discovery component 122-2 is operative on the discovery endpoint 210 and is configured to process routing data 212. In one embodiment, the discovery component 122-2 processes the routing data 212 when directing the production traffic to specific endpoints amongst the endpoints 240; hence, these specific ones of the endpoints 240 may be referred to as production endpoints.


Another example endpoint is the deployment endpoint 220, which may refer to a server or servers that execute the deployment component 122-1 and, when appropriate, use the discovery component 122-2 running on the discovery endpoint 210 and/or the validation component 122-3 running on the validation endpoint 230 to perform a validation process.


In one embodiment, the deployment component 122-1 utilizes resource capacity data 222 in order to examine a network topology for the plurality of endpoints, such as a network topology for a data center comprised of several server computing devices that run one or more online computing services. The network topology may include information identifying which server computing devices provide data storage and/or processing tasks known as computing roles and which computing role is operative on a particular server device. The deployment component 122-1 may use the network topology to identify a set of computing roles that represent a full implementation of the online computing service's instance. The full implementation may be configured to process incoming/outgoing traffic on behalf of the endpoint users in end-to-end fashion. The set of computing roles may be herein referred to as a deployment unit. One example computing role, a hub role, may generally refer to a server or servers that handle the incoming/outgoing traffic directed to the deployment unit (e.g., the deployment unit's network address). For instance, the hub role may handle all incoming/outgoing email flow, apply transport rules, apply journaling policies, and deliver messages to a recipient's mailbox. Another example computing role may screen incoming/outgoing email traffic and filter out emails with SPAM, viruses and other malware.


In one example embodiment where a change is to be applied to the set of computing roles, the deployment component 122-1 may process the routing data 212 to direct the incoming traffic away from the deployment unit comprising the set of roles. This may be accomplished by modifying the routing data 212 to remove any mappings between the set of computing roles and the endpoints 240, thereby terminating any association with the previous online computing service instance. The deployment unit is identifiable as usable resources. After generating another (e.g., new) online computing service instance and establishing another endpoint on that service instance, the deployment component 122-1 associates the set of computing roles with the other endpoint, which places the computer roles under the direction of the other service instance, completing the migration of the deployment unit to the other service instance. Note, the production traffic is re-routed through other production endpoints of the previous service instance and any user(s) associated with re-routed production traffic is, for the most part, unaffected by the migration.


According to one example embodiment, the deployment component 122-1 modifies the set of computing roles by applying one or more changes to computer program code (e.g., instructions) and/or data stored on the server computing devices that comprises the deployment unit. After implementing the one or more changes, the set of computing roles becomes transformed into a set of changed computing roles.


Another example endpoint, the validation endpoint 230, includes the validation component 122-3 for running end-to-end tests on some on some of the service instances 242. In one example embodiment, the deployment component 122-1 initiates testing of the changed set of computing roles. One example implementation of the validation component 122-3 engages in end-to-end testing by communicating transaction data simulating real-world production traffic. The transaction data allows evaluation of the changed set of computing roles under real world conditions. In the context of online mailbox protection, communicating the transaction data causes the computing roles 244 to perform various email filtering tasks, such as SPAM filtering, malware detection and/or the like.



FIG. 3 illustrates an embodiment of an operating environment 300 for the system 100. As shown in FIG. 3, the operating environment 300 includes a (current) production endpoint 302 associated with a service instance 304 and a next production endpoint 306 associated with another service instance 308.


The production endpoint 302, for example, may be configured with a plurality of computing devices known as servers that, in coordination, provide an online computing service, such as the service instance 304, to a plurality of tenants. Various parameter data associated with these tenants may determine which production endpoint to be routed as described herein. A management application (e.g., the management application 120 of FIG. 1) may allocate the production endpoint 302 with a quantifiable resource capacity in terms of, by way of example, processing power, storage space, computing capabilities (e.g., platform capabilities) and/or the like. The resource capacity, according to one embodiment, may define a set of deployment units dedicated to serving the service instance 304 to the plurality of tenants for the production endpoint 302. The set of deployment units may be illustrated in FIG. 3 as “Unit 1”, “Unit 2”, “Unit 3”, and “Unit 4” of which each deployment unit represents one or more servers that operate the service instance 304. Each server within any given deployment unit may be configured to operate a specific computing role for the service instance 304, such as a web service role, a hub role, an edge role, a filtering role, and so forth. Each deployment unit includes a set of computing roles that are substantially or completely isolated from other computing roles in the online computing service's network topology. In some embodiments, the deployment units themselves also are isolated from other deployment units in the same network topology.


As depicted in FIG. 3, deployment unit “Unit 1” is migrated from the production endpoint to the next production endpoint 306. According to one example embodiment, the resource capacity allocated to the production endpoint 302 is partitioned and a portion of that capacity is assigned to the next production endpoint 306. A set of servers running a set of computing roles for the service instance 304 may be removed from that instance's resource pool and associated with another resource pool, such as an expected resource pool for the service instance 308. After applying a change to the deployment unit “Unit 1” (including any roll-back operation of a previous change or update to set of computing roles) and prior to deployment upon production traffic, the changed deployment unit “Unit 1” is validated through testing, for example, via the validation component 122-3 of the management application 120 described herein.


Once validated, the changed deployment unit “Unit 1” is deemed ready to handle actual production traffic and accordingly, is deployed as part of a live production environment. Routing data for a specific group of tenants is modified such that traffic generated from these tenants is directed towards the next production endpoint's address. According to one example implementation, these tenants' production traffic is redirected away from the production endpoint 302 and towards the next production endpoint 306, specifically towards the set of servers within the changed deployment unit “Unit 1.” It is appreciated that the tenant's production traffic may be communicated to a server operating a specific computing role for the service instance 308 and that server orchestrates the other computing roles corresponding to the online computing service. Hence, that server's computing role may include functioning as an interface (e.g., a web interface).


By repeating at least a portion of the process described above, one or more of the remaining deployment units in the production endpoint 302 may be migrated to the next production endpoint 306 and after validation, may begin serving tenants under the service instance 308. It is appreciated that in other embodiments, none of the remaining deployment units in the production endpoint 302 are migrated. In these embodiments, the operating environment 300 maintains backwards compatibility for the tenant's production traffic. Some tenants utilize the unchanged service instance 304, which may be running an outdated/previous version of the online computing service, while other tenants are served by the updated service instance 308. If any tenant wishes to switch to the updated service instance 308, the deployment component 122-1 of the management application 120 redirects that tenant's production traffic to the changed deployment “Unit 1”; and similarly, if any tenant wishes to switch back to the unchanged service instance 304, that tenant's production data is redirected to one of the deployment units remaining in the production endpoint 302. After a roll back is performed and the changed deployment unit “Unit 1” is reverted to a previous version, the reverted deployment unit “Unit 1” may be migrated back to the production endpoint 302.



FIG. 4 illustrates an embodiment of an operating environment 400 for the system 100. As shown in FIG. 4, the operating environment 400 comprises a plurality of service instances, each further comprising one or more endpoints including a production endpoint 402 configured on a service instance 404 and a temporary test endpoint 406 associated with another service instance, service instance 408. As described herein with respect to production endpoints in general, the production endpoint 402 is allocated a resource capacity for serving a plurality of users with data processing and/or storage related tasks, such as those related to an online computing service.


The following description for FIG. 4 describes example embodiments related to when the operating environment 400 provides an online mailbox protection service over a network to the plurality of (mailbox) tenants. The production endpoint 402 may be associated with a network address (e.g., a URL) that receives all incoming and outgoing message data related to an organization, such as an enterprise's internal email system. The above described resource capacity may be partitioned amongst the production endpoint 402 and the test endpoint 406. Because the test endpoint 406 is temporary, any resource capacity assigned to the test endpoint 406 is ephemeral and has a negligible impact on tenant experience. Amongst all computing devices in the operating environment's network topology, the deployment component 122-1 of the management application 120 identifies a set of computing roles (e.g., servers) that, when combined, form a complete build (e.g., full installation) of the online mailbox protection service. In one example embodiment, the identified set of computing roles are isolated from other computing roles in the operating environment 400 and therefore, do not communicate with these roles. As described herein, when the identified set of computing roles operate as the complete build, full end-to-end testing may be executed. Furthermore, changing the complete build may be implemented, tested and deployed without impacting the plurality of tenants' messaging activities.


The deployment component 122-1 of the management application 120 may configure the identified set of computing roles into a deployment unit, such as a deployment unit depicted in FIG. 4 as “Unit 4,” and migrate that deployment unit to the service instance 408. One or more of the set of computing roles may be changed, updated and/or replaced, causing inter-role configurations between the set of computing roles to be updated such that inter-role communications are directed to the changed computing role. For example, if the enterprise's web email client interface is updated, a web service computing role may be modified with different code. Other computing roles within the test endpoint 406 are directed to the changed web service computing role. Other changes may also be performed, such as updating/changing other computing roles, updating/changing other software programs, adding custom mailbox protection features, updating operating system settings and/or the like. Once fully configured as a complete build with the changes, testing of the changed set of computing roles may be initiated by the validation component 122-3 of the management application 120. That component may reside in another endpoint communicably coupled to the test endpoint 406, which may referred to as a validation endpoint. For example, the validation component 122-3 may run tests comprising simulated mailbox-related transactions (e.g., incoming/outgoing emails) upon the deployment unit “Unit 4” and analyze any test results in accordance with various performance-based metrics. The test results, for example, may record successes/failures of email filtering operations, such as SPAM and malware scanning. If the test results indicate a successful transition to the changed computing roles, the deployment unit “Unit 4” is migrated back to the service instance 404 and brought under the control of the production endpoint 406. Each remaining deployment unit on the production endpoint 406 may be migrated to the test endpoint for an upgrade and, possibly, for testing; and if the modified deployment unit successfully completes the validation process, the modified deployment unit is migrated back to the production endpoint 402 and deployed for production traffic.


In some example embodiments, when one or more of these changed/updated computing roles are tested and the change causes problems handling user message data changes can be rolled back. According to one example roll-back operation, a changed computing role's software code is replaced with a previous version of that computing role. According to another example, the management application may instruct the server operating as the changed role to use the previous version of the changed computing role instead of the changed computing role. After being rolled-back, the deployment unit “Unit 4” may be migrated back to the service instance 404.



FIG. 5 illustrates an embodiment of an operating environment 500 for the system 100. As shown in FIG. 5, the operating environment 500 comprises a virtual endpoint 502 and a virtual endpoint 506 corresponding to a service instance 504 and a service instance 508, respectively. Combined, the virtual endpoint 502 and the virtual endpoint 506 may represent at least some resource capacity for an online computing service. As described herein, a resource capacity refers to various server or computing roles of which some may be stateless and some may be state-full. Each virtual endpoint is allocated a plurality of computing roles that comprise a number of complete builds of the online computing service. There are various degrees to which each virtual endpoint's resource capacity may be isolated from the other virtual endpoint's resource capacity. In some embodiments, the virtual endpoint 502 may be completely isolated from the virtual endpoint 506 by not sharing any resources, persistent databases, and/or computing roles. In some embodiments, certain state-full roles are maintained as shared resources, such as a globally shared database storing SPAM or malware signature data.


Within the plurality of computing roles, a deployment unit may define a set of computing roles that, independent of any other computing role, represent one complete build. Hence, each endpoint includes a set of deployment units that are isolated from other deployment units in a network topology for the online computing service. The resource capacity is partitioned into these isolated units. In one embodiment, the virtual endpoint 506 comprises an isolated build that has been changed to adapt to that virtual endpoint's users. As an example, sensitive email traffic for top level government officials may be segregated from other government email traffic originating from a same region by directing the other government email traffic email traffic to the virtual endpoint 502 and directing the sensitive email traffic to the virtual endpoint 506. An example operating environment for such an example may be described for FIG. 8.



FIG. 6 illustrates an embodiment of an operating environment 600 for the system 100. As shown in FIG. 6, the operating environment 600 includes a network topology of computing devices (referred to as servers) representing a resource capacity allocated to one or more online computing service instances. Each deployment unit depicted in FIG. 6 comprises a set of computing roles operating as complete build of an online computing service instance that may execute end-to-end transactions, such as incoming and outgoing email filtering transactions.


In one embodiment, the deployment component 122-1 has the ability to move servers or roles of a deployment unit from one endpoint to another endpoint. In one embodiment, the deployment component 122-1 is configured to add the servers in the deployment unit to expected pools in load balancers associated the other endpoint and remove them from any unexpected pools, restrict inter-role communications to internal servers of the deployment unit, and associate (e.g., tag) the deployment unit with the other endpoint.


The deployment units depicted in FIG. 6 may be dedicated to operating an endpoint protection service, such as a mailbox protection service. As described herein, the discovery component 122-2 functions as an endpoint discovery service that is used to route email traffic for a given tenant to specific endpoints or specific deployment units within an endpoint. A large commercial enterprise, for example, may be allocated multiple mailbox protection service instances where each instance contains a collection of related endpoints that serve a subset of tenants within a given domain (e.g., tenants belonging to a same geographic region).


The mailbox protection service supports various protocols for communicating production traffic, such as SMTP and HTTPS. For SMTP incoming traffic, the discovery component 122-2 routes a tenant's emails to a deployment unit or units by implementing DNS functionality. For incoming HTTPS traffic, the discovery component 122-2 re-routes a tenant's emails using HTTP-redirect where every web server communicates with the discovery component 122-2 to identify the right endpoint or deployment for servicing the tenant.


When deploying a change (e.g., a major change or update), the deployment component 122-1 instructs the discovery endpoint 122-2 to segregate endpoint 602 directed traffic and endpoint 604 directed traffic, for example, for experimentation or to isolate the endpoint 604 to a subset of tenants. Hence, given a tenant, the discovery component 122-2 may route the tenant's email traffic to either the endpoint 602 or the endpoint 604. In one embodiment, the deployment component 122-1 may partition a resource capacity allowing allocation of deployment units to either the endpoint 602 or the endpoint 604 and after migrating the deployment units to their respective endpoints, the deployment component 122-1 may share access to mailbox storage 606 amongst the endpoint 602 and the endpoint 604. The mailbox storage 606 generally stores tenant mailboxes for the enterprise's email users. As an option, some mailboxes may be held in isolated mailbox storage 608 to which the endpoint 604 is granted access.


The deployment component 122-1, as described herein, may apply one or more changes to a deployment unit and update that unit's current build into a new build for the mailbox protection service. Each deployment unit includes servers of all the computing roles so that the new build's end-to-end functionality may be tested using simulated transactions and if such testing indicates validity, exposed to tenants by deploying only that deployment unit. The validation component 122-3 may represent a test automation machine within the same data center as the deployment units that is configured to run tests on the new build's end-to-end functionality.



FIG. 7 illustrates an embodiment of an operating environment 700 for the system 100. In one example embodiment, the operating environment 700 refers to a cloud or online computing service architecture in which a virtual endpoint is adapted to isolate specific tenant production traffic while leveraging at least some shared infrastructure. As shown in FIG. 7, the operating environment 700 includes a plurality of virtual endpoints 7021 . . . N of which a given virtual endpoint 702 is configured on a service instance 704. Each virtual endpoint 702 also comprises a set of computing roles 706 for operating the service instance 704. In one embodiment, each set of computing roles 706 has the quality of being stateless (e.g., non-persistent) and isolated from the other virtual endpoints while state-full computing resources are shared across the plurality of virtual endpoints 7021 . . . N. FIG. 7 depicts regional databases 708 and global databases 710 as examples of shared state-full computing resources.


One example implementation may designate an example virtual endpoint 7021 as a dedicated endpoint for a specific subset of tenants while isolating other tenant production traffic to at least one of remaining virtual endpoints 7022 . . . N. Such isolation may be permanent or temporary. For example, the subset of tenants may be selected at random to test an upgraded build of the online computing service.


The subset of tenants may have certain criteria necessitating isolation to the dedicated endpoint. In one example, email traffic for a group of government tenants are not co-mingled with that of commercial or civilian tenants in the operating environment 700. This allows for the government tenants to have their data isolated from that of others who are non-government. In another example, a government tenant levies a requirement on an online computing service provider that the software and hardware that are used to process their email and data may only be accessed by that provider's employees who have certain security clearances and meet citizenship requirements. The hardware and software in the online computing service can be isolated architecturally and logically to only allow employees who are administrators or engineers who meet the requirements by the government tenant to be able to access the online computing service. At the same time, the other instance of the online computing service would be available for administrators and engineers to access and maintain the service.



FIG. 8 illustrates an embodiment of an operating environment 800 for the system 100. As shown in FIG. 8, the operating environment 800 almost completely isolates the virtual endpoint 812 from other virtual endpoints, such as when a service instance 814 is dedicated to serving a particular group of tenants, such as executive government officials. In addition to stateless roles 816, the virtual endpoint 812 includes state-full roles 818 that are not shared amongst the other virtual endpoints. These state-full roles 818 may include persistent databases storing non-sensitive data, such as SPAM or malware signatures.


Given a fixed group of servers operating a set of computing roles, these servers may be segregated such that software may be deployed to these servers while maintaining virtual isolation between virtual domains in the online computing service. Each service instance can be configured with its own virtual endpoint. As described above for FIG. 7, some embodiments of the deployment component 122-1 may isolate only the stateless computing roles 816. In FIG. 8, in addition to isolating all the stateless roles 816, some state-full roles 818 are isolated into the virtual domains, such as when specific tenant data is to be isolated from other tenant data. In this case, the software in the state-full role would provide virtual isolation from other service instances. Optionally, the entire group of roles or servers can be isolated to support separate dedicated service instances. Hence, the deployment unit may be adapted dynamically to provide a service instance ranging from maximum resource sharing to maximum isolation.



FIG. 9 illustrates a block diagram of a distributed system 900. The distributed system 900 may distribute portions of the structure and/or operations for the system 100 across multiple computing entities. Examples of distributed system 900 may include without limitation a client-server architecture, a 3-tier architecture, an N-tier architecture, a tightly-coupled or clustered architecture, a peer-to-peer architecture, a master-slave architecture, a shared database architecture, and other types of distributed systems. The embodiments are not limited in this context.


The distributed system 900 may comprise a client device 910 and a server device 950. In one example, the devices 910, 950 may communicate over a communications media 912 using communications signals 914 via the communications components 940.


In general, the client device 910 and/or the server device 950 may comprise any electronic device capable of receiving, processing, and sending information for the system 100. Examples of an electronic device may include without limitation an ultra-mobile device, a mobile device, a personal digital assistant (PDA), a mobile computing device, a smart phone, a telephone, a digital telephone, a cellular telephone, ebook readers, a handset, a one-way pager, a two-way pager, a messaging device, a computer, a personal computer (PC), a desktop computer, a laptop computer, a notebook computer, a netbook computer, a handheld computer, a tablet computer, a server, a server array or server farm, a web server, a network server, an Internet server, a work station, a mini-computer, a main frame computer, a supercomputer, a network appliance, a web appliance, a distributed computing system, multiprocessor systems, processor-based systems, consumer electronics, programmable consumer electronics, game devices, television, digital television, set top box, wireless access point, base station, subscriber station, mobile subscriber center, radio network controller, router, hub, gateway, bridge, switch, machine, or combination thereof. The embodiments are not limited in this context.


The client device 910 and/or the server device 950 may execute processing operations or logic for the system 100 using a processing component 930. The processing component 930 may comprise various hardware elements, software elements, or a combination of both. Examples of hardware elements may include devices, logic devices, components, processors, microprocessors, circuits, processor circuits, circuit elements (e.g., transistors, resistors, capacitors, inductors, and so forth), integrated circuits, application specific integrated circuits (ASIC), programmable logic devices (PLD), digital signal processors (DSP), field programmable gate array (FPGA), memory units, logic gates, registers, semiconductor device, chips, microchips, chip sets, and so forth. Examples of software elements may include software components, programs, applications, computer programs, application programs, system programs, software development programs, machine programs, operating system software, middleware, firmware, software modules, routines, subroutines, functions, methods, procedures, software interfaces, application program interfaces (API), instruction sets, computing code, computer code, code segments, computer code segments, words, values, symbols, or any combination thereof. Determining whether an embodiment is implemented using hardware elements and/or software elements may vary in accordance with any number of factors, such as desired computational rate, power levels, heat tolerances, processing cycle budget, input data rates, output data rates, memory resources, data bus speeds and other design or performance constraints, as desired for a given implementation.


The client device 910 and/or the server device 950 may execute communications operations or logic for the system 100 using communications component 940. The communications component 940 may implement any well-known communications techniques and protocols, such as techniques suitable for use with packet-switched networks (e.g., public networks such as the Internet, private networks such as an enterprise intranet, and so forth), circuit-switched networks (e.g., the public switched telephone network), or a combination of packet-switched networks and circuit-switched networks (with suitable gateways and translators). The communications component 940 may include various types of standard communication elements, such as one or more communications interfaces, network interfaces, network interface cards (NIC), radios, wireless transmitters/receivers (transceivers), wired and/or wireless communication media, physical connectors, and so forth. By way of example, and not limitation, communication media 912 include wired communications media and wireless communications media. Examples of wired communications media may include a wire, cable, metal leads, printed circuit boards (PCB), backplanes, switch fabrics, semiconductor material, twisted-pair wire, co-axial cable, fiber optics, a propagated signal, and so forth. Examples of wireless communications media may include acoustic, radio-frequency (RF) spectrum, infrared and other wireless media.


The client device 910 may comprise or employ one or more client programs that operate to perform various methodologies in accordance with the described embodiments. In one embodiment, for example, the client device 910 may implement a mailbox protection client 920 that functions as an interface to an online computing service referred to as a mailbox protection service. The mailbox protection client 910 may be a component (e.g., a plug-in) of an email messaging application in use at the client device 910 and configured to present mailbox information, send/receive email and other email-related tasks.


The server device 950 may comprise or employ one or more server programs that operate to perform various methodologies in accordance with the described embodiments. In one embodiment, the server device 950 may implement at least a portion of a mailbox protection service 960. To illustrate by way of examples, the server device 950 may operate a computing role that processes incoming production traffic from the client device 910 or the server device 950 may operate the entire mailbox protection service. Alternatively, the service device 950 may represent a plurality of server devices that cooperate to operate the mailbox protection service 960.


In one embodiment, the mailbox protection service 960 processes incoming emails to the client device 910 for any possible threats or problems. The incoming emails may be forwarded to the server device 950 from by the client device 910 itself or a local on-premises enterprise server that handles all network traffic in and out of the client device 910. Optionally, the incoming emails may be directly routed to the server device 950. Possible threats include, but not limited to, malware, SPAM, phish and/or any other software vulnerability exploit.


Included herein is a set of flow charts representative of exemplary methodologies for performing novel aspects of the disclosed architecture. While, for purposes of simplicity of explanation, the one or more methodologies shown herein, for example, in the form of a flow chart or flow diagram, are shown and described as a series of acts, it is to be understood and appreciated that the methodologies are not limited by the order of acts, as some acts may, in accordance therewith, occur in a different order and/or concurrently with other acts from that shown and described herein. For example, those skilled in the art will understand and appreciate that a methodology could alternatively be represented as a series of interrelated states or events, such as in a state diagram. Moreover, not all acts illustrated in a methodology may be required for a novel implementation.



FIG. 10 illustrates one embodiment of a logic flow 1000. The logic flow 1000 may be representative of some or all of the operations executed by one or more embodiments described herein.


In the illustrated embodiment shown in FIG. 10, the logic flow 1000 partitions a resource capacity into deployment units at block 1002. For example, each deployment unit may include a set of servers operating various computing roles for the mailbox protection service.


The logic flow 1000 may modify routing data to route production traffic away from one of the deployment units at block 1004. For example, the deployment unit's servers may be added to expected resource pools in load balancers that are used by the other mailbox protection service instance's endpoints and removed from an expected resource pool for the service instance. Hence, these servers' resources are no longer be available for handling tenant production traffic. Any N-tier communication may be restricted to internal endpoints of the service instance and/or to internal roles within a deployment unit. This inter-role routing configuration on the machines is modified as a server is moved to a new service instance.


As an alternative, by partitioning the mailbox protection service's resource capacity into deployments units as described herein, the deployment component 122-1 of the management application 120 may generate a mailbox protection service instance to support service tenants that request complete isolation from other tenants. In one embodiment, the deployment component 122-1 isolates a service instance across stateless roles and at least some state-full roles where complete service isolation is desired.


The logic flow 1000 may upgrade the deployment unit at block 1006. For example, one or more servers within the deployment unit may be updated with new/replacement software code and/or customized features. An example computing role, for instance, a web service role, may be changed to fix one or more program bugs and/or to perform one or more custom functions. Another example computing role may be changed to include new malware removal mechanisms and/or new malware signature data. As a part of this upgrade, the deployment component 122-1 may migrate a portion of the resource capacity to the other service instance's endpoints. At this point, the deployment unit is configured the other service instance's endpoints and that deployment unit is brought online, becoming available for handling actual production traffic.


The logic flow 1000 may initiate testing of a new mailbox protection service instance at block 1008. For example, test tenants may invoke end-to-end tests upon the deployment unit. The validation component 122-3 of the management application 120 may run simulated transactions on the deployment unit. The deployment component 122-1 may also upgrade the validation component 122-3 with a latest build of the new mailbox protection service. Thus, the simulated transactions are appropriate for testing the new mailbox protection service instance.


The logic flow 1000 may validate the upgrade to the deployment unit at block 1010. For example, the validation component 122-3 of the management application 120 may analyze test results from the simulated transactions. If the test results indicate successful completion of a substantial number of the tests, a portion of the email traffic is routed to the deployment unit, possibly, for further testing. One example implementation does not perform mailbox migration for any tenant associated with this portion and only changes the routing data to include endpoints associated with the new mailbox protection service instance.


In one example embodiment, the logic flow 1000 is repeated for subsequent deployment units in the data center. Once a deployment unit is configured for the new mailbox protection service instance, additional tenant email traffic is routed to the new mailbox protection service instance's endpoint.


Alternatively, endpoints associated with the new mailbox protection service only generate temporarily upon being associated with a first deployment unit. Email traffic from actually tenants are never routed to these endpoints. Instead, test tenants are associated with the endpoints and run end to end tests on these endpoints. Following the validation, the upgraded first deployment unit is migrated back to a production endpoint (e.g., an out-of-band of deployment upgrade). Since the new build of the mailbox protection service has been tested and validated for correctness and durability, subsequent deployment units are upgraded in a rolling fashion in-place (e.g., without being moved to test endpoints).


The embodiments are not limited to this example.



FIG. 11 illustrates an embodiment of an exemplary computing architecture 1100 suitable for implementing various embodiments as previously described. In one embodiment, the computing architecture 1100 may comprise or be implemented as part of an electronic device. Examples of an electronic device may include those described with reference to FIG. 8, among others. The embodiments are not limited in this context.


As used in this application, the terms “system” and “component” are intended to refer to a computer-related entity, either hardware, a combination of hardware and software, software, or software in execution, examples of which are provided by the exemplary computing architecture 1100. For example, a component can be, but is not limited to being, a process running on a processor, a processor, a hard disk drive, multiple storage drives (of optical and/or magnetic storage medium), an object, an executable, a thread of execution, a program, and/or a computer. By way of illustration, both an application running on a server and the server can be a component. One or more components can reside within a process and/or thread of execution, and a component can be localized on one computer and/or distributed between two or more computers. Further, components may be communicatively coupled to each other by various types of communications media to coordinate operations. The coordination may involve the uni-directional or bi-directional exchange of information. For instance, the components may communicate information in the form of signals communicated over the communications media. The information can be implemented as signals allocated to various signal lines. In such allocations, each message is a signal. Further embodiments, however, may alternatively employ data messages. Such data messages may be sent across various connections. Exemplary connections include parallel interfaces, serial interfaces, and bus interfaces.


The computing architecture 1100 includes various common computing elements, such as one or more processors, multi-core processors, co-processors, memory units, chipsets, controllers, peripherals, interfaces, oscillators, timing devices, video cards, audio cards, multimedia input/output (I/O) components, power supplies, and so forth. The embodiments, however, are not limited to implementation by the computing architecture 1100.


As shown in FIG. 11, the computing architecture 1100 comprises a processing unit 1104, a system memory 1106 and a system bus 1108. The processing unit 1104 can be any of various commercially available processors, including without limitation an AMD® Athlon®, Duron® and Opteron® processors; ARM® application, embedded and secure processors; IBM® and Motorola® DragonBall® and PowerPC® processors; IBM and Sony® Cell processors; Intel® Celeron®, Core (2) Duo®, Itanium®, Pentium®, Xeon®, and XScale® processors; and similar processors. Dual microprocessors, multi-core processors, and other multi-processor architectures may also be employed as the processing unit 1104.


The system bus 1108 provides an interface for system components including, but not limited to, the system memory 1106 to the processing unit 1104. The system bus 1108 can be any of several types of bus structure that may further interconnect to a memory bus (with or without a memory controller), a peripheral bus, and a local bus using any of a variety of commercially available bus architectures. Interface adapters may connect to the system bus 1108 via a slot architecture. Example slot architectures may include without limitation Accelerated Graphics Port (AGP), Card Bus, (Extended) Industry Standard Architecture ((E)ISA), Micro Channel Architecture (MCA), NuBus, Peripheral Component Interconnect (Extended) (PCI(X)), PCI Express, Personal Computer Memory Card International Association (PCMCIA), and the like.


The computing architecture 1100 may comprise or implement various articles of manufacture. An article of manufacture may comprise a computer-readable storage medium to store logic. Examples of a computer-readable storage medium may include any tangible media capable of storing electronic data, including volatile memory or non-volatile memory, removable or non-removable memory, erasable or non-erasable memory, writeable or re-writeable memory, and so forth. Examples of logic may include executable computer program instructions implemented using any suitable type of code, such as source code, compiled code, interpreted code, executable code, static code, dynamic code, object-oriented code, visual code, and the like. Embodiments may also be at least partly implemented as instructions contained in or on a non-transitory computer-readable medium, which may be read and executed by one or more processors to enable performance of the operations described herein.


The system memory 1106 may include various types of computer-readable storage media in the form of one or more higher speed memory units, such as read-only memory (ROM), random-access memory (RAM), dynamic RAM (DRAM), Double-Data-Rate DRAM (DDRAM), synchronous DRAM (SDRAM), static RAM (SRAM), programmable ROM (PROM), erasable programmable ROM (EPROM), electrically erasable programmable ROM (EEPROM), flash memory, polymer memory such as ferroelectric polymer memory, ovonic memory, phase change or ferroelectric memory, silicon-oxide-nitride-oxide-silicon (SONOS) memory, magnetic or optical cards, an array of devices such as Redundant Array of Independent Disks (RAID) drives, solid state memory devices (e.g., USB memory, solid state drives (SSD) and any other type of storage media suitable for storing information. In the illustrated embodiment shown in FIG. 11, the system memory 1106 can include non-volatile memory 1110 and/or volatile memory 1112. A basic input/output system (BIOS) can be stored in the non-volatile memory 1110.


The computer 1102 may include various types of computer-readable storage media in the form of one or more lower speed memory units, including an internal (or external) hard disk drive (HDD) 1114, a magnetic floppy disk drive (FDD) 1116 to read from or write to a removable magnetic disk 1118, and an optical disk drive 1120 to read from or write to a removable optical disk 1122 (e.g., a CD-ROM or DVD). The HDD 1114, FDD 1116 and optical disk drive 1120 can be connected to the system bus 1108 by a HDD interface 1124, an FDD interface 1126 and an optical drive interface 1128, respectively. The HDD interface 1124 for external drive implementations can include at least one or both of Universal Serial Bus (USB) and IEEE 1394 interface technologies.


The drives and associated computer-readable media provide volatile and/or nonvolatile storage of data, data structures, computer-executable instructions, and so forth. For example, a number of program modules can be stored in the drives and memory units 1110, 1112, including an operating system 1130, one or more application programs 1132, other program modules 1134, and program data 1136. In one embodiment, the one or more application programs 1132, other program modules 1134, and program data 1136 can include, for example, the various applications and/or components of the system 100.


A user can enter commands and information into the computer 1102 through one or more wire/wireless input devices, for example, a keyboard 1138 and a pointing device, such as a mouse 1140. Other input devices may include microphones, infra-red (IR) remote controls, radio-frequency (RF) remote controls, game pads, stylus pens, card readers, dongles, finger print readers, gloves, graphics tablets, joysticks, keyboards, retina readers, touch screens (e.g., capacitive, resistive, etc.), trackballs, trackpads, sensors, styluses, and the like. These and other input devices are often connected to the processing unit 1104 through an input device interface 1142 that is coupled to the system bus 1108, but can be connected by other interfaces such as a parallel port, IEEE 1394 serial port, a game port, a USB port, an IR interface, and so forth.


A monitor 1144 or other type of display device is also connected to the system bus 1108 via an interface, such as a video adaptor 1146. The monitor 1144 may be internal or external to the computer 1102. In addition to the monitor 1144, a computer typically includes other peripheral output devices, such as speakers, printers, and so forth.


The computer 1102 may operate in a networked environment using logical connections via wire and/or wireless communications to one or more remote computers, such as a remote computer 1148. The remote computer 1148 can be a workstation, a server computer, a router, a personal computer, portable computer, microprocessor-based entertainment appliance, a peer device or other common network node, and typically includes many or all of the elements described relative to the computer 1102, although, for purposes of brevity, only a memory/storage device 1150 is illustrated. The logical connections depicted include wire/wireless connectivity to a local area network (LAN) 1152 and/or larger networks, for example, a wide area network (WAN) 1154. Such LAN and WAN networking environments are commonplace in offices and companies, and facilitate enterprise-wide computer networks, such as intranets, all of which may connect to a global communications network, for example, the Internet.


When used in a LAN networking environment, the computer 1102 is connected to the LAN 1152 through a wire and/or wireless communication network interface or adaptor 1156. The adaptor 1156 can facilitate wire and/or wireless communications to the LAN 1152, which may also include a wireless access point disposed thereon for communicating with the wireless functionality of the adaptor 1156.


When used in a WAN networking environment, the computer 1102 can include a modem 1158, or is connected to a communications server on the WAN 1154, or has other means for establishing communications over the WAN 1154, such as by way of the Internet. The modem 1158, which can be internal or external and a wire and/or wireless device, connects to the system bus 1108 via the input device interface 1142. In a networked environment, program modules depicted relative to the computer 1102, or portions thereof, can be stored in the remote memory/storage device 1150. It will be appreciated that the network connections shown are exemplary and other means of establishing a communications link between the computers can be used.


The computer 1102 is operable to communicate with wire and wireless devices or entities using the IEEE 802 family of standards, such as wireless devices operatively disposed in wireless communication (e.g., IEEE 802.11 over-the-air modulation techniques). This includes at least Wi-Fi (or Wireless Fidelity), WiMax, and Bluetooth™ wireless technologies, among others. Thus, the communication can be a predefined structure as with a conventional network or simply an ad hoc communication between at least two devices. Wi-Fi networks use radio technologies called IEEE 802.11x (a, b, g, n, etc.) to provide secure, reliable, fast wireless connectivity. A Wi-Fi network can be used to connect computers to each other, to the Internet, and to wire networks (which use IEEE 802.3-related media and functions).



FIG. 12 illustrates a block diagram of an exemplary communications architecture 1200 suitable for implementing various embodiments as previously described. The communications architecture 1200 includes various common communications elements, such as a transmitter, receiver, transceiver, radio, network interface, baseband processor, antenna, amplifiers, filters, power supplies, and so forth. The embodiments, however, are not limited to implementation by the communications architecture 1200.


As shown in FIG. 12, the communications architecture 1200 comprises includes one or more clients 1202 and servers 1204. The clients 1202 may implement the client device 910. The servers 1204 may implement the server device 950. The clients 1202 and the servers 1204 are operatively connected to one or more respective client data stores 1208 and server data stores 1210 that can be employed to store information local to the respective clients 1202 and servers 1204, such as cookies and/or associated contextual information.


The clients 1202 and the servers 1204 may communicate information between each other using a communication framework 1206. The communications framework 1206 may implement any well-known communications techniques and protocols. The communications framework 1206 may be implemented as a packet-switched network (e.g., public networks such as the Internet, private networks such as an enterprise intranet, and so forth), a circuit-switched network (e.g., the public switched telephone network), or a combination of a packet-switched network and a circuit-switched network (with suitable gateways and translators).


The communications framework 1206 may implement various network interfaces arranged to accept, communicate, and connect to a communications network. A network interface may be regarded as a specialized form of an input output interface. Network interfaces may employ connection protocols including without limitation direct connect, Ethernet (e.g., thick, thin, twisted pair 10/100/1000 Base T, and the like), token ring, wireless network interfaces, cellular network interfaces, IEEE 802.11a-x network interfaces, IEEE 802.16 network interfaces, IEEE 802.20 network interfaces, and the like. Further, multiple network interfaces may be used to engage with various communications network types. For example, multiple network interfaces may be employed to allow for the communication over broadcast, multicast, and unicast networks. Should processing requirements dictate a greater amount speed and capacity, distributed network controller architectures may similarly be employed to pool, load balance, and otherwise increase the communicative bandwidth required by clients 1202 and the servers 1204. A communications network may be any one and the combination of wired and/or wireless networks including without limitation a direct interconnection, a secured custom connection, a private network (e.g., an enterprise intranet), a public network (e.g., the Internet), a Personal Area Network (PAN), a Local Area Network (LAN), a Metropolitan Area Network (MAN), an Operating Missions as Nodes on the Internet (OMNI), a Wide Area Network (WAN), a wireless network, a cellular network, and other communications networks.


Some embodiments may be described using the expression “one embodiment” or “an embodiment” along with their derivatives. These terms mean that a particular feature, structure, or characteristic described in connection with the embodiment is included in at least one embodiment. The appearances of the phrase “in one embodiment” in various places in the specification are not necessarily all referring to the same embodiment. Further, some embodiments may be described using the expression “coupled” and “connected” along with their derivatives. These terms are not necessarily intended as synonyms for each other. For example, some embodiments may be described using the terms “connected” and/or “coupled” to indicate that two or more elements are in direct physical or electrical contact with each other. The term “coupled,” however, may also mean that two or more elements are not in direct contact with each other, but yet still co-operate or interact with each other.


It is emphasized that the Abstract of the Disclosure is provided to allow a reader to quickly ascertain the nature of the technical disclosure. It is submitted with the understanding that it will not be used to interpret or limit the scope or meaning of the claims. In addition, in the foregoing Detailed Description, it can be seen that various features are grouped together in a single embodiment for the purpose of streamlining the disclosure. This method of disclosure is not to be interpreted as reflecting an intention that the claimed embodiments require more features than are expressly recited in each claim. Rather, as the following claims reflect, inventive subject matter lies in less than all features of a single disclosed embodiment. Thus the following claims are hereby incorporated into the Detailed Description, with each claim standing on its own as a separate embodiment. In the appended claims, the terms “including” and “in which” are used as the plain-English equivalents of the respective terms “comprising” and “wherein,” respectively. Moreover, the terms “first,” “second,” “third,” and so forth, are used merely as labels, and are not intended to impose numerical requirements on their objects.


What has been described above includes examples of the disclosed architecture. It is, of course, not possible to describe every conceivable combination of components and/or methodologies, but one of ordinary skill in the art may recognize that many further combinations and permutations are possible. Accordingly, the novel architecture is intended to embrace all such alterations, modifications and variations that fall within the spirit and scope of the appended claims.

Claims
  • 1. An apparatus, comprising: a processor;a set of memory units; anda management application operative on the processor, the management application configured to perform functions of: routing production traffic away from a deployment unit, the deployment unit including a server for running a first endpoint protection service instance for a plurality of endpoints,generating a second endpoint protection service instance,establishing a different endpoint on the second endpoint protection service instance,migrating the deployment unit to the different endpoint,applying a change to the deployment unit to produce a modified deployment unit,androuting at least a portion of the production traffic to the modified deployment unit for testing.
  • 2. The apparatus of claim 1, further comprising a deployment component arranged to direct a discovery component to process routing data and route the production traffic away from the deployment unit.
  • 3. The apparatus of claim 1, further comprising a validation component arranged to initiate testing with the modified deployment unit.
  • 4. The apparatus of claim 1, further comprising a discovery component to route the production traffic to the different endpoint.
  • 5. The apparatus of claim 1, further comprising a discovery component to route the portion of the production traffic to the different endpoint and another portion of the production traffic to the production endpoint.
  • 6. The apparatus of claim 2, wherein the deployment component is operative to apply a change to at least one computing role of a mailbox protection service for execution on the deployment unit, and create a new mailbox protection service instance.
  • 7. The apparatus of claim 6, wherein the deployment component is operative to roll back the change to the at least one computing role.
  • 8. The apparatus of claim 2, wherein the deployment component is operative to isolate production traffic associated with a subset of a plurality of users associated with the production traffic to the modified deployment unit.
  • 9. The apparatus of claim 2, wherein the deployment component is operative to arrange the deployment unit to be a dedicated service instance to handle production traffic from a subset of a plurality of users associated with the production traffic.
  • 10. A computer-implemented method, comprising: routing production traffic away from a deployment unit comprising servers for running an endpoint protection service instance for a plurality of endpoints;generating a second endpoint protection service instance,establishing a different endpoint on the second endpoint protection service instance,migrating the deployment unit to the different endpoint;applying a change to the deployment unit to produce a modified deployment unit;androuting at least a portion of the production traffic to the modified deployment unit for testing.
  • 11. The computer-implemented method of claim 10, comprising analyzing results from testing the second endpoint protection service.
  • 12. The computer-implemented method of claim 10, comprising rolling back the change to the deployment unit.
  • 13. The computer-implemented method of claim 10, comprising modifying an inter-role configuration between the servers for the deployment unit.
  • 14. The computer-implemented method of claim 10, comprising executing tests of the modified deployment unit.
  • 15. The computer-implemented method of claim 10, comprising configuring a set of computing roles into the deployment unit, the set of computing roles comprising a complete build of the endpoint protection service instance, applying a change to the set of computing roles to produce a new build of the endpoint protection service instance, and testing the new build of the endpoint protection service instance.
  • 16. The computer-implemented method of claim 10, comprising isolating a portion of production traffic that is associated with the modified deployment unit.
  • 17. At least one non-transitory computer-readable storage medium comprising instructions that, when executed, cause a system to: process routing data to route production traffic away from a deployment unit corresponding to online mailbox protection in which the deployment unit comprises a set of computing roles for running a mailbox protection service for a plurality of mailbox users;upgrade the mailbox protection service to produce a new mailbox protection service; and route at least a portion of the production traffic to the new mailbox protection service to initiate testing of the new mailbox protection service.
  • 18. The non-transitory computer-readable storage medium of claim 17, comprising instructions that when executed cause the system to: modify the routing data to migrate the deployment unit from a production endpoint to a test endpoint.
  • 19. The non-transitory computer-readable storage medium of claim 17, comprising instructions that when executed cause the system to: process resource capacity data to isolate another portion of the production traffic to the deployment unit.
  • 20. The non-transitory computer-readable storage medium of claim 17, comprising instructions that when executed cause the system to: modify the routing data to route the production traffic back to the deployment unit.
CROSS-REFERENCE TO RELATED APPLICATION

This application is a continuation of, claims the benefit of and priority to previously filed U.S. patent application Ser. No. 14/294,410 filed Jun. 3, 2014, entitled “TECHNIQUES TO ISOLATING A PORTION OF AN ONLINE COMPUTING SERVICE”, which is hereby incorporated by reference in its entirety.

US Referenced Citations (584)
Number Name Date Kind
1965389 Parr Jul 1934 A
2002004 Gard et al. May 1935 A
2015037 MacFarland Sep 1935 A
4868653 Golin et al. Sep 1989 A
5060170 Bourgeois et al. Oct 1991 A
5149919 Greanias et al. Sep 1992 A
5241682 Bryant et al. Aug 1993 A
5353133 Bernkopf Oct 1994 A
5450586 Kuzara et al. Sep 1995 A
5475425 Przyborski et al. Dec 1995 A
5687011 Mowry Nov 1997 A
5717957 Lin Feb 1998 A
5778404 Capps et al. Jul 1998 A
5831594 Tognazzini et al. Nov 1998 A
5867709 Klencke Feb 1999 A
5903566 Flammer, III May 1999 A
5964879 Dunstan et al. Oct 1999 A
6028960 Graf et al. Feb 2000 A
6151643 Cheng et al. Nov 2000 A
6167337 Haack et al. Dec 2000 A
6167377 Gillick et al. Dec 2000 A
6185528 Fissore et al. Feb 2001 B1
6232972 Arcuri et al. May 2001 B1
6263308 Heckerman et al. Jul 2001 B1
6278942 McDonough Aug 2001 B1
6282709 Reha et al. Aug 2001 B1
6339437 Nielsen Jan 2002 B1
6349406 Levine et al. Feb 2002 B1
6389181 Shaffer et al. May 2002 B2
6452597 Goldberg et al. Sep 2002 B1
6452915 Jorgensen Sep 2002 B1
6603491 Lemelson et al. Aug 2003 B2
6847386 Paleiov Jan 2005 B2
6854073 Bates et al. Feb 2005 B2
6879709 Tian et al. Apr 2005 B2
6934370 Leban et al. Aug 2005 B1
6970947 Ebling et al. Nov 2005 B2
7027054 Cheiky et al. Apr 2006 B1
7082211 Simon et al. Jul 2006 B2
7146296 Carlbom et al. Dec 2006 B1
7155037 Nagai et al. Dec 2006 B2
7251812 Jhanwar et al. Jul 2007 B1
7254257 Kim et al. Aug 2007 B2
7337112 Moriya et al. Feb 2008 B2
7370043 Shelton et al. May 2008 B1
7387539 Trenne Jun 2008 B2
7400439 Holman Jul 2008 B2
7443791 Barrett et al. Oct 2008 B2
7443807 Cutler Oct 2008 B2
7458825 Atsmon et al. Dec 2008 B2
7466986 Halcrow et al. Dec 2008 B2
7496910 Voskuil Feb 2009 B2
7525928 Cutler Apr 2009 B2
7551754 Steinberg et al. Jun 2009 B2
7577295 Constantin et al. Aug 2009 B2
7577297 Mori et al. Aug 2009 B2
7584285 Hudson et al. Sep 2009 B2
7606375 Bailey et al. Oct 2009 B2
7614046 Daniels et al. Nov 2009 B2
7639877 Shiota et al. Dec 2009 B2
7680327 Weiss Mar 2010 B2
7690042 Rantalahti Mar 2010 B2
7697557 Segel Apr 2010 B2
7703036 Satterfield et al. Apr 2010 B2
7716643 Goldin May 2010 B2
7729902 Gupta et al. Jun 2010 B1
7738870 Howard Jun 2010 B2
7751599 Chen et al. Jul 2010 B2
7756538 Bonta et al. Jul 2010 B2
7765194 Sharma et al. Jul 2010 B1
7766498 Sampsell Aug 2010 B2
7779367 Oshiro et al. Aug 2010 B2
7783629 Li et al. Aug 2010 B2
7783777 Pabla et al. Aug 2010 B1
7804982 Howard et al. Sep 2010 B2
7835910 Hakkani-Tur et al. Nov 2010 B1
7865952 Hopwood et al. Jan 2011 B1
7881479 Asada Feb 2011 B2
7900011 Amundsen et al. Mar 2011 B2
7959308 Freeman et al. Jun 2011 B2
7970350 Sheynman et al. Jun 2011 B2
7978925 Souchard Jul 2011 B1
8015006 Kennewick et al. Sep 2011 B2
8019060 Martino Sep 2011 B2
8024564 Bassani Sep 2011 B2
8026830 Womble et al. Sep 2011 B2
8074213 Holtz Dec 2011 B1
8091074 Lyon-Smith Jan 2012 B2
8107243 Guccione et al. Jan 2012 B2
8121408 Omori Feb 2012 B2
8130281 Kaneda et al. Mar 2012 B2
8149748 Bata et al. Apr 2012 B2
8154384 Hirai Apr 2012 B2
8155400 Bronstein et al. Apr 2012 B2
8165352 Mohanty et al. Apr 2012 B1
8170298 Li et al. May 2012 B2
8189807 Cutler May 2012 B2
8194177 Jung et al. Jun 2012 B2
8212294 Hoke et al. Jul 2012 B2
8213333 Greel et al. Jul 2012 B2
8213690 Okada et al. Jul 2012 B2
8224036 Maruyama et al. Jul 2012 B2
8229729 Sarikaya et al. Jul 2012 B2
8232962 Buck Jul 2012 B2
8239446 Navar et al. Aug 2012 B2
8245043 Cutler Aug 2012 B2
8275615 Kozat et al. Sep 2012 B2
8296107 Turner et al. Oct 2012 B2
8296673 Lipstein et al. Oct 2012 B2
8302006 Stanek et al. Oct 2012 B2
8316237 Felsher et al. Nov 2012 B1
8321220 Chotimongkol et al. Nov 2012 B1
8326000 Jung et al. Dec 2012 B2
8326634 Di Cristo et al. Dec 2012 B2
8331632 Mohanty et al. Dec 2012 B1
8335851 Vendrow Dec 2012 B1
8346563 Hjelm et al. Jan 2013 B1
8358811 Adams et al. Jan 2013 B2
8364717 Delling et al. Jan 2013 B2
8364802 Keagy Jan 2013 B1
8368540 Perkins et al. Feb 2013 B2
8373829 Hara et al. Feb 2013 B2
8374122 Meier et al. Feb 2013 B2
8375456 Li et al. Feb 2013 B2
8384694 Powell et al. Feb 2013 B2
8392594 Georgis et al. Mar 2013 B2
8397163 Sran Mar 2013 B1
8400332 Szwabowski et al. Mar 2013 B2
8406206 Chiang Mar 2013 B2
8407472 Hao et al. Mar 2013 B2
8410903 Hirai Apr 2013 B2
8412521 Mathias et al. Apr 2013 B2
8413198 Connor et al. Apr 2013 B2
8418139 Dhanakshirur Apr 2013 B2
8421874 Okamoto et al. Apr 2013 B2
8448847 Lee May 2013 B2
8484314 Luna et al. Jul 2013 B2
8493992 Sella et al. Jul 2013 B2
8495372 Bailey et al. Jul 2013 B2
8504823 Carpenter et al. Aug 2013 B2
8516471 Bhakta et al. Aug 2013 B2
8522209 Wintergerst et al. Aug 2013 B2
8526683 Maruyama et al. Sep 2013 B2
8527602 Rasmussen et al. Sep 2013 B1
8532347 Bourdev Sep 2013 B2
8535075 Golko et al. Sep 2013 B1
8538091 Kaneda et al. Sep 2013 B2
8539477 Balascio et al. Sep 2013 B2
8549150 Roseman et al. Oct 2013 B1
8553037 Smith et al. Oct 2013 B2
8555364 Filippi et al. Oct 2013 B2
8559722 Tsuji Oct 2013 B2
8571866 Melamed et al. Oct 2013 B2
8611678 Hanson et al. Dec 2013 B2
8614734 Cutler Dec 2013 B2
8619062 Powell et al. Dec 2013 B2
8620351 Karaoguz Dec 2013 B2
8624994 Kaneda et al. Jan 2014 B2
8626932 Lydon et al. Jan 2014 B2
8631350 Lepage et al. Jan 2014 B2
8649604 Steinberg et al. Feb 2014 B2
8670850 Soulodre Mar 2014 B2
8680439 Shei et al. Mar 2014 B2
8686600 Terlizzi et al. Apr 2014 B2
8701102 Appiah et al. Apr 2014 B2
8719603 Belesiu et al. May 2014 B2
8756507 Fong et al. Jun 2014 B2
8776166 Erickson et al. Jul 2014 B1
8839222 Brandwine Sep 2014 B1
8880439 Archambeau et al. Nov 2014 B2
8918709 Oleksy et al. Dec 2014 B2
8924315 Archambeau et al. Dec 2014 B2
8935673 Ashkenazi et al. Jan 2015 B1
9017092 McCracken et al. Apr 2015 B1
9058311 Bertz et al. Jun 2015 B1
9088891 Belton et al. Jul 2015 B2
9222791 Delling et al. Dec 2015 B2
9239773 Teplitsky et al. Jan 2016 B1
9262152 Kurian Feb 2016 B1
9311718 Scavezze et al. Apr 2016 B2
9324321 Xue et al. Apr 2016 B2
9324323 Bikel et al. Apr 2016 B1
9329761 Rodrig et al. May 2016 B2
9367490 Huang et al. Jun 2016 B2
9373179 Negrila et al. Jun 2016 B2
9384334 Burba et al. Jul 2016 B2
9384335 Hunt et al. Jul 2016 B2
9430667 Burba et al. Aug 2016 B2
9520127 Li et al. Dec 2016 B2
9614724 Menezes et al. Apr 2017 B2
9645808 Turpie May 2017 B1
9720548 Powell Aug 2017 B2
10037202 Garg et al. Jul 2018 B2
10062188 Delling et al. Aug 2018 B2
20010000356 Woods Apr 2001 A1
20020083041 Achlioptas et al. Jun 2002 A1
20020101918 Rodman et al. Aug 2002 A1
20020116171 Russell Aug 2002 A1
20020143855 Traversat et al. Oct 2002 A1
20020149924 Falicoff et al. Oct 2002 A1
20030031177 Robidas et al. Feb 2003 A1
20030064142 Wagner et al. Apr 2003 A1
20030125948 Lyudovyk Jul 2003 A1
20030182414 O'neill Sep 2003 A1
20030212543 Epstein et al. Nov 2003 A1
20030212544 Acero et al. Nov 2003 A1
20040032831 Matthews Feb 2004 A1
20040040021 Bharati et al. Feb 2004 A1
20040076079 Lyon et al. Apr 2004 A1
20040088726 Ma et al. May 2004 A1
20040168165 Kokkinen Aug 2004 A1
20040210752 Rao Oct 2004 A1
20040240711 Hamza et al. Dec 2004 A1
20050039169 Hsu et al. Feb 2005 A1
20050052427 Wu et al. Mar 2005 A1
20050058297 Jot et al. Mar 2005 A1
20050065789 Yacoub et al. Mar 2005 A1
20050091057 Phillips et al. Apr 2005 A1
20050111189 Smalc et al. May 2005 A1
20050114625 Snyder May 2005 A1
20050132348 Meulemans et al. Jun 2005 A1
20050144013 Fujimoto et al. Jun 2005 A1
20050144616 Hammond et al. Jun 2005 A1
20050165598 Cote et al. Jul 2005 A1
20050165839 Madan et al. Jul 2005 A1
20050177515 Kalavade et al. Aug 2005 A1
20050177624 Oswald et al. Aug 2005 A1
20050198407 Lee Sep 2005 A1
20050245243 Zuniga Nov 2005 A1
20060036965 Harris et al. Feb 2006 A1
20060046709 Krumm et al. Mar 2006 A1
20060058009 Vogedes et al. Mar 2006 A1
20060088209 Yu et al. Apr 2006 A1
20060155777 Shih Jul 2006 A1
20060156222 Chi et al. Jul 2006 A1
20060174017 Robertson Aug 2006 A1
20060200477 Barrenechea Sep 2006 A1
20060212867 Fields et al. Sep 2006 A1
20060244845 Craig et al. Nov 2006 A1
20060253491 Gokturk et al. Nov 2006 A1
20060277478 Seraji et al. Dec 2006 A1
20060280341 Koshizen et al. Dec 2006 A1
20060290705 White et al. Dec 2006 A1
20070038436 Cristo et al. Feb 2007 A1
20070055752 Wiegand et al. Mar 2007 A1
20070055936 Dhanjal et al. Mar 2007 A1
20070058878 Gomilla et al. Mar 2007 A1
20070074168 Bates et al. Mar 2007 A1
20070128979 Shackelford et al. Jun 2007 A1
20070136324 Xu Jun 2007 A1
20070147318 Ross et al. Jun 2007 A1
20070150428 Webb Jun 2007 A1
20070156392 Balchandran et al. Jul 2007 A1
20070157313 Denton Jul 2007 A1
20070188477 Rehm Aug 2007 A1
20070198950 Dodge et al. Aug 2007 A1
20070203863 Gupta et al. Aug 2007 A1
20070226649 Agmon Sep 2007 A1
20070233879 Woods et al. Oct 2007 A1
20070294061 Carlbom et al. Dec 2007 A1
20080004877 Tian Jan 2008 A1
20080005114 Li Jan 2008 A1
20080037438 Twiss et al. Feb 2008 A1
20080037442 Bill Feb 2008 A1
20080046425 Perski Feb 2008 A1
20080055278 Locker et al. Mar 2008 A1
20080066181 Haveson et al. Mar 2008 A1
20080069364 Itou et al. Mar 2008 A1
20080089299 Lindsley et al. Apr 2008 A1
20080089561 Zhang Apr 2008 A1
20080137875 Zong et al. Jun 2008 A1
20080140981 Kim Jun 2008 A1
20080143674 Molander et al. Jun 2008 A1
20080159232 Thalanany et al. Jul 2008 A1
20080164934 Hankey et al. Jul 2008 A1
20080165701 Ananthanarayanan et al. Jul 2008 A1
20080175190 Lee et al. Jul 2008 A1
20080192820 Brooks et al. Aug 2008 A1
20080195388 Bower et al. Aug 2008 A1
20080204598 Maurer et al. Aug 2008 A1
20080209354 Stanek et al. Aug 2008 A1
20080212894 Demirli et al. Sep 2008 A1
20080215183 Chen et al. Sep 2008 A1
20080235017 Satomura Sep 2008 A1
20080253564 Kahn et al. Oct 2008 A1
20080263130 Michalowitz et al. Oct 2008 A1
20080273708 Sandgren et al. Nov 2008 A1
20080313264 Pestoni Dec 2008 A1
20090010623 Date et al. Jan 2009 A1
20090030697 Cerra et al. Jan 2009 A1
20090046864 Mahabub et al. Feb 2009 A1
20090055389 Schilit et al. Feb 2009 A1
20090055461 Georgis et al. Feb 2009 A1
20090083148 Hwang et al. Mar 2009 A1
20090087099 Nakamura Apr 2009 A1
20090089801 Jones et al. Apr 2009 A1
20090100384 Louch Apr 2009 A1
20090100459 Riedl Apr 2009 A1
20090100489 Strothmann Apr 2009 A1
20090116749 Cristinacce et al. May 2009 A1
20090180671 Lee et al. Jul 2009 A1
20090187593 Chen et al. Jul 2009 A1
20090193445 Thakker Jul 2009 A1
20090210328 Fomenko et al. Aug 2009 A1
20090219405 Kaneda et al. Sep 2009 A1
20090259667 Wang et al. Oct 2009 A1
20090271735 Anderson et al. Oct 2009 A1
20090292687 Fan et al. Nov 2009 A1
20090300596 Tyhurst et al. Dec 2009 A1
20090313330 Sakamoto Dec 2009 A1
20090326960 Breebaat Dec 2009 A1
20100004930 Strope et al. Jan 2010 A1
20100008233 Ee Jan 2010 A1
20100011123 Dantzig et al. Jan 2010 A1
20100015956 Qu et al. Jan 2010 A1
20100023251 Gale et al. Jan 2010 A1
20100027663 Dai et al. Feb 2010 A1
20100076941 Dotsenko et al. Mar 2010 A1
20100082316 Chawla Apr 2010 A1
20100082478 Van der veen et al. Apr 2010 A1
20100101763 Huang et al. Apr 2010 A1
20100103117 Townsend et al. Apr 2010 A1
20100111059 Bappu et al. May 2010 A1
20100114890 Hagar et al. May 2010 A1
20100121954 Yang et al. May 2010 A1
20100128863 Krum et al. May 2010 A1
20100135038 Handschy et al. Jun 2010 A1
20100149755 Tomioka et al. Jun 2010 A1
20100162226 Borissov et al. Jun 2010 A1
20100191837 Linden et al. Jul 2010 A1
20100205177 Sato et al. Aug 2010 A1
20100211695 Steinmetz et al. Aug 2010 A1
20100211908 Luk et al. Aug 2010 A1
20100229222 Li et al. Sep 2010 A1
20100251206 Horiuchi et al. Sep 2010 A1
20100251230 O'farrell et al. Sep 2010 A1
20100295774 Hennessey Nov 2010 A1
20100312546 Chang et al. Dec 2010 A1
20100329533 Omi Dec 2010 A1
20110006603 Robinson et al. Jan 2011 A1
20110007174 Bacivarov et al. Jan 2011 A1
20110010171 Talwar et al. Jan 2011 A1
20110010319 Harada et al. Jan 2011 A1
20110010424 Fox et al. Jan 2011 A1
20110016333 Scott et al. Jan 2011 A1
20110023111 Gunadisastra et al. Jan 2011 A1
20110031113 Lopatin et al. Feb 2011 A1
20110043490 Powell et al. Feb 2011 A1
20110052081 Onoe et al. Mar 2011 A1
20110055901 Karaoguz et al. Mar 2011 A1
20110055935 Karaoguz et al. Mar 2011 A1
20110064331 Andres Del Valle Mar 2011 A1
20110071841 Fomenko et al. Mar 2011 A1
20110081023 Raghuvanshi et al. Apr 2011 A1
20110087666 Chou et al. Apr 2011 A1
20110093459 Dong et al. Apr 2011 A1
20110099538 Naidu pujala et al. Apr 2011 A1
20110129159 Cifarelli Jun 2011 A1
20110135166 Wechsler et al. Jun 2011 A1
20110138064 Rieger et al. Jun 2011 A1
20110144999 Jang et al. Jun 2011 A1
20110153324 Ballinger et al. Jun 2011 A1
20110167181 Minoo et al. Jul 2011 A1
20110177481 Haff et al. Jul 2011 A1
20110179182 Vadla Ravnas Jul 2011 A1
20110208980 Brooks et al. Aug 2011 A1
20110225366 Izadi et al. Sep 2011 A1
20110231676 Atkins et al. Sep 2011 A1
20110283266 Gallagher et al. Nov 2011 A1
20110289482 Bentley Nov 2011 A1
20110321029 Kern et al. Dec 2011 A1
20120014560 Obrador et al. Jan 2012 A1
20120027311 Cok Feb 2012 A1
20120029661 Jones et al. Feb 2012 A1
20120030325 Silverman et al. Feb 2012 A1
20120030682 Shaffer et al. Feb 2012 A1
20120065976 Deng et al. Mar 2012 A1
20120066642 Shi Mar 2012 A1
20120071174 Bao et al. Mar 2012 A1
20120072528 Rimac et al. Mar 2012 A1
20120076427 Hibino et al. Mar 2012 A1
20120078612 Kandekar et al. Mar 2012 A1
20120078690 Harriman et al. Mar 2012 A1
20120079372 Kandekar et al. Mar 2012 A1
20120084086 Gilbert et al. Apr 2012 A1
20120084655 Gallagher et al. Apr 2012 A1
20120096121 Hao et al. Apr 2012 A1
20120118537 Kameoka et al. May 2012 A1
20120120678 Su May 2012 A1
20120134139 Jang et al. May 2012 A1
20120144288 Caruso et al. Jun 2012 A1
20120148159 Kaneda et al. Jun 2012 A1
20120150548 Rajagopalan et al. Jun 2012 A1
20120169791 Whitehead et al. Jul 2012 A1
20120179674 Delling et al. Jul 2012 A1
20120188382 Morrison et al. Jul 2012 A1
20120224388 Lin Sep 2012 A1
20120225652 Martinez et al. Sep 2012 A1
20120231862 Yamamoto Sep 2012 A1
20120232885 Barbosa et al. Sep 2012 A1
20120235887 Border et al. Sep 2012 A1
20120236184 Jia et al. Sep 2012 A1
20120242598 Won et al. Sep 2012 A1
20120245944 Gruber et al. Sep 2012 A1
20120246458 Jain et al. Sep 2012 A1
20120250535 Delling et al. Oct 2012 A1
20120253799 Bangalore et al. Oct 2012 A1
20120253802 Heck et al. Oct 2012 A1
20120254086 Deng et al. Oct 2012 A1
20120254153 Abraham et al. Oct 2012 A1
20120254161 Zhang et al. Oct 2012 A1
20120254227 Heck et al. Oct 2012 A1
20120256967 Baldwin et al. Oct 2012 A1
20120265531 Bennett Oct 2012 A1
20120266140 Bates Oct 2012 A1
20120269355 Chandak et al. Oct 2012 A1
20120271617 Nakajima et al. Oct 2012 A1
20120278430 Lehane et al. Nov 2012 A1
20120290293 Hakkani-tur et al. Nov 2012 A1
20120293543 Jardine-skinner Nov 2012 A1
20120303565 Deng et al. Nov 2012 A1
20120310523 Delling et al. Dec 2012 A1
20120313865 Pearce Dec 2012 A1
20120317197 De foy et al. Dec 2012 A1
20120327040 Simon et al. Dec 2012 A1
20120327042 Harley et al. Dec 2012 A1
20120330887 Young et al. Dec 2012 A1
20120331102 Ertugrul Dec 2012 A1
20120331111 Wu et al. Dec 2012 A1
20130013936 Lin et al. Jan 2013 A1
20130014050 Queru Jan 2013 A1
20130016055 Chuang Jan 2013 A1
20130019175 Kotler et al. Jan 2013 A1
20130021373 Vaught et al. Jan 2013 A1
20130022513 Yoshioka et al. Jan 2013 A1
20130031476 Coin et al. Jan 2013 A1
20130034649 Boghmans et al. Feb 2013 A1
20130058274 Scherzer et al. Mar 2013 A1
20130065576 Basir Mar 2013 A1
20130073725 Bordeleau et al. Mar 2013 A1
20130078869 Golko et al. Mar 2013 A1
20130085756 Chotimongkol et al. Apr 2013 A1
20130086461 Ashley-rollman et al. Apr 2013 A1
20130086507 Poston et al. Apr 2013 A1
20130091205 Kotler et al. Apr 2013 A1
20130091440 Kotler et al. Apr 2013 A1
20130091453 Kotler et al. Apr 2013 A1
20130091465 Kikin-Gil et al. Apr 2013 A1
20130091534 Gilde et al. Apr 2013 A1
20130094445 De foy et al. Apr 2013 A1
20130097481 Kotler et al. Apr 2013 A1
20130097490 Kotler et al. Apr 2013 A1
20130106725 Bakken et al. May 2013 A1
20130106740 Yilmaz et al. May 2013 A1
20130106977 Chu et al. May 2013 A1
20130108065 Mullins et al. May 2013 A1
20130115821 Golko et al. May 2013 A1
20130117470 Terlizzi et al. May 2013 A1
20130117658 Fidler et al. May 2013 A1
20130127982 Zhang et al. May 2013 A1
20130128364 Wheeler et al. May 2013 A1
20130132369 Delling et al. May 2013 A1
20130132614 Bajpai et al. May 2013 A1
20130138436 Yu et al. May 2013 A1
20130148864 Dolson et al. Jun 2013 A1
20130151441 Archambeau et al. Jun 2013 A1
20130152092 Yadgar Jun 2013 A1
20130159021 Felsher Jun 2013 A1
20130166742 Wiener et al. Jun 2013 A1
20130173604 Li et al. Jul 2013 A1
20130174047 Sivakumar et al. Jul 2013 A1
20130179067 Trowbridge et al. Jul 2013 A1
20130179172 Nakamura et al. Jul 2013 A1
20130185065 Tzirkel-hancock et al. Jul 2013 A1
20130188032 Vertegaal Jul 2013 A1
20130191781 Radakovitz et al. Jul 2013 A1
20130212484 Joshi et al. Aug 2013 A1
20130217414 Nagaraj Aug 2013 A1
20130226587 Cheung et al. Aug 2013 A1
20130227398 Bolstad Aug 2013 A1
20130227415 Gregg et al. Aug 2013 A1
20130231862 Delling et al. Sep 2013 A1
20130234913 Thangadorai et al. Sep 2013 A1
20130238729 Holzman et al. Sep 2013 A1
20130238819 Oljaca et al. Sep 2013 A1
20130242964 Hassan et al. Sep 2013 A1
20130252636 Chang et al. Sep 2013 A1
20130254412 Menezes et al. Sep 2013 A1
20130266196 Kono et al. Oct 2013 A1
20130275779 He Oct 2013 A1
20130293530 Perez et al. Nov 2013 A1
20130297700 Hayton et al. Nov 2013 A1
20130297769 Chang Nov 2013 A1
20130298185 Koneru et al. Nov 2013 A1
20130305210 Sharma Nov 2013 A1
20130311423 Price Nov 2013 A1
20130321390 Latta et al. Dec 2013 A1
20130335301 Wong et al. Dec 2013 A1
20130346494 Nakfour et al. Dec 2013 A1
20140004741 Jol et al. Jan 2014 A1
20140007215 Romano et al. Jan 2014 A1
20140019626 Hubler et al. Jan 2014 A1
20140019896 Satterfield et al. Jan 2014 A1
20140025380 Koch et al. Jan 2014 A1
20140046914 Das et al. Feb 2014 A1
20140072242 Wei et al. Mar 2014 A1
20140075523 Tuomaala et al. Mar 2014 A1
20140087355 Henry Mar 2014 A1
20140092554 Yamaguchi et al. Apr 2014 A1
20140098682 Cao et al. Apr 2014 A1
20140107921 Delling et al. Apr 2014 A1
20140108979 Davidson et al. Apr 2014 A1
20140141635 Saunders et al. May 2014 A1
20140157169 Kikin-gil Jun 2014 A1
20140173602 Kikin-gil et al. Jun 2014 A1
20140181708 Kikin-gil et al. Jun 2014 A1
20140210797 Kreek et al. Jul 2014 A1
20140211065 Sudheendra et al. Jul 2014 A1
20140214410 Jang et al. Jul 2014 A1
20140222729 Dasgupta et al. Aug 2014 A1
20140253522 Cueto Sep 2014 A1
20140257803 Yu et al. Sep 2014 A1
20140258405 Perkin Sep 2014 A1
20140282415 Ovadia et al. Sep 2014 A1
20140297412 Fong et al. Oct 2014 A1
20140304297 Lian et al. Oct 2014 A1
20140317602 Zuo Oct 2014 A1
20140341443 Cao et al. Nov 2014 A1
20140358537 Gilbert et al. Dec 2014 A1
20140359593 Cohen et al. Dec 2014 A1
20140372112 Xue et al. Dec 2014 A1
20140379326 Sarikaya et al. Dec 2014 A1
20140379353 Boies et al. Dec 2014 A1
20150081572 Thomas et al. Mar 2015 A1
20150082291 Thomas et al. Mar 2015 A1
20150082292 Thomas et al. Mar 2015 A1
20150082293 Thomas et al. Mar 2015 A1
20150082296 Thomas et al. Mar 2015 A1
20150100312 Bocchieri et al. Apr 2015 A1
20150160961 Johnson Jun 2015 A1
20150161993 Sainath et al. Jun 2015 A1
20150161994 Tang et al. Jun 2015 A1
20150170020 Garimella Jun 2015 A1
20150206321 Scavezze et al. Jul 2015 A1
20150234725 Cillis Aug 2015 A1
20150255061 Xue et al. Sep 2015 A1
20150255069 Adams et al. Sep 2015 A1
20150277682 Kaufthal et al. Oct 2015 A1
20150277708 Rodrig et al. Oct 2015 A1
20150278191 Levit et al. Oct 2015 A1
20150302040 Amigud Oct 2015 A1
20150304165 Menezes et al. Oct 2015 A1
20150310040 Chan et al. Oct 2015 A1
20150310261 Lee et al. Oct 2015 A1
20150310858 Li et al. Oct 2015 A1
20150317147 Nachimuthu et al. Nov 2015 A1
20150317313 Lv et al. Nov 2015 A1
20150317510 Lee et al. Nov 2015 A1
20150324555 Burba et al. Nov 2015 A1
20150324556 Hunt et al. Nov 2015 A1
20150324601 Burba et al. Nov 2015 A1
20150325236 Levit et al. Nov 2015 A1
20150327068 Hunt et al. Nov 2015 A1
20150331240 Poulos et al. Nov 2015 A1
20150331463 Obie et al. Nov 2015 A1
20150346784 Delano et al. Dec 2015 A1
20150347120 Garg et al. Dec 2015 A1
20150347274 Taylor et al. Dec 2015 A1
20150347734 Beigi Dec 2015 A1
20150350333 Cutler et al. Dec 2015 A1
20150356759 Delling et al. Dec 2015 A1
20150363339 Huang et al. Dec 2015 A1
20150363919 Suri et al. Dec 2015 A1
20150371409 Negrila et al. Dec 2015 A1
20150373475 Raghuvanshi et al. Dec 2015 A1
20150373546 Haugen et al. Dec 2015 A1
20150378515 Powell Dec 2015 A1
20160203125 Sarikaya et al. Jul 2016 A1
20160210035 Rodrig et al. Jul 2016 A1
20160217092 Huang et al. Jul 2016 A1
20160239987 Negrila et al. Aug 2016 A1
20160379343 Suri et al. Dec 2016 A1
20170364737 Chan et al. Dec 2017 A1
20190354748 Lee et al. Nov 2019 A1
Foreign Referenced Citations (64)
Number Date Country
1271896 Nov 2000 CN
1337619 Feb 2002 CN
1649420 Aug 2005 CN
1735927 Feb 2006 CN
1868215 Nov 2006 CN
101377925 Mar 2009 CN
101406074 Apr 2009 CN
101420627 Apr 2009 CN
101753404 Jun 2010 CN
101770778 Jul 2010 CN
101930595 Dec 2010 CN
102158554 Aug 2011 CN
102368194 Mar 2012 CN
102714723 Oct 2012 CN
102722364 Oct 2012 CN
102884526 Jan 2013 CN
103052922 Apr 2013 CN
103098476 May 2013 CN
103365725 Oct 2013 CN
103365817 Oct 2013 CN
553101 Aug 1993 EP
704655 Apr 1996 EP
553101 Jul 1997 EP
816981 Jan 1998 EP
816981 May 1998 EP
704655 Mar 1999 EP
1055872 Nov 2000 EP
1174787 Jan 2002 EP
1331566 Jul 2003 EP
1628197 Feb 2006 EP
1965389 Sep 2008 EP
1970803 Sep 2008 EP
2096577 Sep 2009 EP
1970803 Oct 2010 EP
2267655 Dec 2010 EP
2312462 Apr 2011 EP
2482572 Aug 2012 EP
2575128 Apr 2013 EP
2590274 May 2013 EP
2650752 Oct 2013 EP
2701457 Feb 2014 EP
2431001 Apr 2007 GB
356140430 Nov 1981 JP
2002091477 Mar 2002 JP
1020040076079 Aug 2004 KR
1020130022513 Mar 2013 KR
9304468 Mar 1993 WO
125943 Apr 2001 WO
250590 Jun 2002 WO
2005013262 Feb 2005 WO
2005033934 Apr 2005 WO
2009015047 Jan 2009 WO
2009082814 Jul 2009 WO
2009089308 Jul 2009 WO
2009128021 Oct 2009 WO
2010141403 Dec 2010 WO
2011014138 Feb 2011 WO
2011150403 Dec 2011 WO
2012152817 Nov 2012 WO
2013008026 Jan 2013 WO
2013048510 Apr 2013 WO
2013154561 Oct 2013 WO
2013171481 Nov 2013 WO
2013184225 Dec 2013 WO
Non-Patent Literature Citations (478)
Entry
“Non-Final Office Action Issued in U.S. Appl. No. 14/264,619”, dated Apr. 19, 2016, 12 Pages.
“Non-Final Office Action Issued in U.S. Appl. No. 14/264,619”, dated Nov. 2, 2016, 11 Pages.
“Non-Final Office Action Issued in U.S. Appl. No. 14/265,110”, dated Jan. 4, 2016, 26 Pages.
“Final Office Action Issued in U.S. Appl. No. 14/266,795”, dated Apr. 11, 2016, 12 Pages.
“Final Office Action Issued in U.S. Appl. No. 14/266,795”, dated Dec. 21, 2017, 17 Pages.
“Non-Final Office Action Issued in U.S. Appl. No. 14/266,795”, dated Oct. 7, 2015, 11 Pages.
“Non-Final Office Action Issued in U.S. Appl. No. 14/266,795”, dated Jul. 19, 2016, 13 Pages.
“Final Office Action Issued in U.S. Appl. No. 14/268,953”, dated Sep. 14, 2016, 16 Pages.
“Non-Final Office Action Issued in U.S. Appl. No. 14/268,953”, dated Apr. 19, 2016, 15 Pages.
“Final Office Action Issued in U.S. Appl. No. 14/273,100”, dated Mar. 3, 2016, 18 Pages.
Zwol, et al., “Prediction of Favourite Photos using Social, Visual, and Textual Signals”, In Proceedings of the 18th ACM International Conference on Multimedia, Oct. 25, 2010, 4 Pages.
“Non-Final Office Action Issued in U.S. Appl. No. 14/273,100”, dated Oct. 1, 2015, 21 Pages.
Zhu, et al., “A Rank-Order Distance based Clustering Algorithm for Face Tagging”, In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, Jun. 20, 2011, pp. 481-488.
“Final Office Action Issued in U.S. Appl. No. 14/275,724”, dated Jan. 29, 2016, 6 Pages.
“Non-Final Office Action Issued in U.S. Appl. No. 14/275,724”, dated Sep. 23, 2015, 9 Pages.
“Final Office Action Issued in U.S. Appl. No. 14/275,761”, dated Dec. 18, 2015, 6 Pages.
“Non-Final Office Action Issued in U.S. Appl. No. 14/275,761”, dated Sep. 24, 2015, 9 Pages.
“Final Office Action Issued in U.S. Appl. No. 14/275,785”, dated Feb. 9, 2016, 11 Pages.
“Non-Final Office Action Issued in U.S. Appl. No. 14/275,785”, dated Aug. 26, 2015, 10 Pages.
“Non-Final Office Action Issued in U.S. Appl. No. 14/275,785”, dated Sep. 9, 2016, 14 Pages.
“Final Office Action Issued in U.S. Appl. No. 14/279,146”, dated Apr. 13, 2016, 16 Pages.
Zhang, Daoqiang, “Two-Dimensional Bayesian Subspace Analysis for Face Recognition”, In Proceedings of the 4th International Symposium on Neutral Networks, Jun. 3, 2007, 7 Pages.
“Non-Final Office Action Issued in U.S. Appl. No. 14/279,146”, dated Dec. 8, 2015, 10 Pages.
“Non-Final Office Action Issued in U.S. Appl. No. 14/279,146”, dated Aug. 3, 2016, 15 Pages.
“Final Office Action Issued in U.S. Appl. No. 14/281,518”, dated Aug. 25, 2016, 29 Pages.
“Non-Final Office Action Issued in U.S. Appl. No. 14/281,518”, dated Feb. 26, 2016, 24 Pages.
Zhai, et al., “A Study of Smoothing Methods for Language Models Applied to Ad Hoc Information Retrieval”, In Proceedings of the 24th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, Sep. 1, 2001, 9 Pages.
“Non Final Office Action Issued in U.S. Appl. No. 14/294,410”, dated Sep. 21, 2017, 8 Pages.
“Final Office Action Issued in U.S. Appl. No. 14/296,644”, dated Dec. 4, 2017, 32 Pages.
“Non-Final Office Action Issued in U.S. Appl. No. 14/296,644”, dated Aug. 04, 2016, 25 Pages.
“Non-Final Office Action Issued in U.S. Appl. No. 14/304,174”, dated Jun. 29, 2015, 16 Pages.
“Final Office Action Issued in U.S. Appl. No. 14/304,911”, dated Nov. 13, 2015, 7 Pages.
“Non-Final Office Action Issued in U.S. Appl. No. 14/304,911”, dated Jul. 17, 2015, 7 Pages.
“Non-Final Office Action Issued in U.S. Appl. No. 14/311,208”, dated Jan. 7, 2016, 7 Pages.
“Final Office Action Issued in U.S. Appl. No. 14/312,501”, dated May 27, 2016, 14 Pages.
“Non-Final Office Action Issued in U.S. Appl. No. 14/312,501”, dated Dec. 16, 2015, 15 Pages.
“Final Office Action Issued in U.S. Appl. No. 14/316,802”, dated Sep. 6, 2016, 21 Pages.
“Non-Final Office Action Issued in U.S. Appl. No. 14/316,802”, dated Jul. 8, 2016, 17 Pages.
“Non-Final Office Action Issued in U.S. Appl. No. 14/316,802”, dated Dec. 2, 2016, 22 Pages.
“Non-Final Office Action Issued in U.S. Appl. No. 14/338,078”, dated Jun. 16, 2016, 19 Pages.
“First Action Interview Office Action Issued in U.S. Appl. No. 14/444,987”, dated Aug. 24, 2016, 7 Pages.
“Preinterview First Office Action Issued in U.S. Appl. No. 14/444,987”, dated Mar. 3, 2016, 5 Pages.
“Final Office Action Issued in U.S. Appl. No. 14/456,679”, dated Nov. 2, 2015, 27 Pages.
“Final Office Action Issued in U.S. Appl. No. 14/456,679”, dated Aug. 31, 2016, 34 Pages.
Yu, et al., “Roles of Pre-Training and Fine-Tuning in Context-Dependent DBN-HMMs for Real-World Speech Recognition”, In Proceedings of the NIPS Workshop on Deep Learning and Unsupervised Feature Learning, Dec. 1, 2010, 8 Pages.
Yu, et al., “KL-Divergence Regularized Deep Neural Network Adaptation for Improved Large Vocabulary Speech Recognition”, In Proceedings of the IEEE International Conference on Acoustics Speech and Signal Processing, May 26, 2013, pp. 7893-7897.
Yu, et al., “Improved Bottleneck Features Using Pretrained Deep Neural Networks”, In Proceedings of the 12th Annual Conference of the International Speech Communication Association, Aug. 28, 2011, 4 Pages.
“Non-Final Office Action Issued in U.S. Appl. No. 14/456,679”, dated May 10, 2016, 32 Pages.
“Non-Final Office Action Issued in U.S. Appl. No. 14/456,679”, dated Jun. 19, 2015, 23 Pages.
“Acoustics—Measurement of Room Acoustic Parameters—Part 1: Performance Spaces”, In Proceedings of the International Organization for Standardization, ISO 3382-1:2009, May 6, 2014, 2 Pages.
“Centrally Managed Wireless Networks”, Retrieved From: http://web.archive.org/web/20130905204305/http://burconix.com/?p=services-centrally-managed-wireless, Sep. 5, 2013, 2 Pages.
“Cisco Bring Your Own Device”, Retrieved From: http://www.cisco.com/c/en/us/td/docs/solutions/Enterprise/Borderless_Networks/Unified_Access/byodwp.html, Mar. 7, 2014, 23 Pages.
“Cloud ERP—New dog, Same Flea”, Retrieved From: https://gbeaubouef.wordpress.com/2011/05/22/cloud-erp/, May 22, 2011, 8 Pages.
“Connectify pro Full+Key 7 MB”, Retrieved From: http://zonretum.blogspot.mx/2013/05/connectify-pro-fullkey-7-mb.html, May 14, 2013, 5 Pages.
“Connecting to Multiple 802.11 Networks from One WiFi Card Simultaneously”, Retrieved From: http://marketplace.yet2.com/app/insight/techofweek/38576, Jun. 20, 2012, 2 Pages.
“Corporate Telecommunication Networks—Mobility for Enterprise Communications”, In Proceedings of the ECMA International Technical Report, Ecma/TC32-TG17/2010/056 Ecma/EC32/2010/042, Final Draft, 2nd Edition, Oct. 1, 2010, 38 Pages.
“Debug Navigator Help: Using Debug Gauges”, Retrieved From: http://web.archive.org/web/20160421103618/https://developer.apple.com/library/mac/recipes/xcode_help-debug_navigator/articles/using_debug_gauges.html, May 28, 2014, 3 Pages.
“Determining Costs and Impact of a Software Upgrade Across Different Business Units”, Retrieved From: http://www.geneca.com/case-studies/determining-costs-impact-software-upgrade-business-units/, Feb. 12, 2013, 2 Pages.
“Find Code Changes and Other History with CodeLens”, Retrieved From: https://msdn.microsoft.com/en-gb/enus/library/dn269218.aspx, Retrieved on: May 23, 2014, 10 Pages.
“Get history and other info about your code”, Retrieved From: https://web.archive.org/web/20140608170534/http://msdn.microsoft.com/en-us/library/dn269218.aspx, Retrieved on: May 23, 2014,15 Pages.
“GPU-Accelerated Route Planning”, Retrieved From: https://www.cs.unc.edu/Research/ProjectSummaries/routing05.pdf, Aug. 1, 2005, 2 Pages.
“How to Set Up a Wireless Hotspot—From Ethernet (Windows 7)”, Retrieved From: http://www.instructables.com/id/How-to-Set-Up-a-Wireless-Hotspot-Windows-7/, Apr. 3, 2012, 8 Pages.
“Interactive 3D Audio Rendering Guidelines, Level 2.0”, In Proceedings of the 3D Working Group of the Interactive Audio Special Interest Group, Sep. 20, 1999, 29 Pages.
“Interest Point Detection”, Retrieved From: http://en.wikipedia.org/wiki/Interest_point_detection, Apr. 21, 2014, 3 Pages.
“Lifecycle Services for Microsoft Dynamics User Guide (LCS) [AX 2012]”, Retrieved From: https://web.archive.org/web/20141031185423/http://technet.microsoft.com/en-us/library/dn268616.aspx, Aug. 8, 2013, 5 Pages.
“Microsoft Codelens Code Health Indicator Extension”, Retrieved From: https://web.archive.org/web/20150319182733/https://visualstudiogallery.msdn.microsoft.com/f85a7ab9-b4c2-436c-a6e5-0f06e0bac16d, Mar. 10, 2014, 2 Pages.
“Ribbon Layout and Resizing”, Retrieved From: https://msdn.microsoft.com/en-us/library/ff701790(v=vs.110).aspx, Retrieved Date: Mar. 12, 2014, 6 Pages.
Volker, Lars “Route Planning in Road Networks with Turn Costs”, Retrieved from: http://algo2.iti.kit.edu/documents/routeplanning/volker_sa.pdf, Jul. 22, 2008, 30 Pages.
“The Ribbon Bar”, Retrieved From: http://bioinf.scri.ac.uk/tablet/help/ribbon.shtml, Retrieved Date: Dec. 28, 2015, 5 Pages.
“UI Element Guidelines: Menus”, Retrieved From: https://web.archive.org/web/20140603021407/https://developer.apple.com/library/mac/documentation/UserExperience/Conceptual/AppleHIGuidelines/Menus/Menus.html, Sep. 26, 2011, 22 Pages.
“Unified Communications Managed API 3.0 Core SDK Documentation”, Retrieved From: http://web.archive.org/web/20120113042236/http://msdn.microsoft.com/en-us/library/gg421023.aspx, Dec. 1, 2011, 2 Pages.
“Xcode OpenGL ES Tools Overview”, Retrieved From: https://developer.apple.com/library/ios/documentation/3DDrawing/Conceptual/OpenGLES_ProgrammingGuide/ToolsOverview/ToolsOverview.html, Retrieved on: Jun. 5, 2014, 12 Pages.
“Xcode Overview”, Retrieved From: https://developer.apple.com/library/ios/documentation/ToolsLanguages/Conceptual/Xcode_Overview/DebugYourApp/DebugYourApp.html, Mar. 10, 2014,18 Pages.
“Final Office Action Issued in U.S. Appl. No. 12/573,157”, dated Jul. 5, 2013, 18 Pages.
“Final Office Action Issued in U.S. Appl. No. 12/573,157”, dated Feb. 17, 2015, 18 Pages.
“Non Final Office Action Issued in U.S. Appl. No. 12/573,157”, dated Aug. 20, 2015, 18 Pages.
“Non Final Office Action Issued in U.S. Appl. No. 12/573,157”, dated Apr. 23, 2014, 19 Pages.
“Non Final Office Action Issued in U.S. Appl. No. 12/573,157”, dated Nov. 28, 2012, 12 Pages.
“Final Office Action Issued in U.S. Appl. No. 12/970,949”, dated Jun. 10, 2015, 25 Pages.
“Non-Final Office Action Issued in U.S. Appl. No. 12/970,949”, dated Jan. 2, 2015, 24 Pages.
“Final Office Action Issued in U.S. Appl. No. 13/327,794”, dated Nov. 20, 2014,13 Pages.
“Final Office Action Issued in U.S. Appl. No. 13/530,015”, dated Nov. 19, 2014, 49 Pages.
“Non-Final Office Action Issued in U.S. Appl. No. 13/530,015”, dated Apr. 28, 2015, 33 Pages.
“Non-Final Office Action Issued in U.S. Appl. No. 13/903,944”, dated Mar. 27, 2015, 26 Pages.
“Final Office Action Issued in U.S. Appl. No. 13/920,323”, dated Sep. 24, 2015, 25 Pages.
“Non-Final Office Action Issued in U.S. Appl. No. 13/920,323”, dated Apr. 5, 2016, 23 Pages.
“Non-Final Office Action Issued in U.S. Appl. No. 13/920,323”, dated Feb. 27, 2015, 14 Pages.
“Final Office Action Issued in U.S. Appl. No. 13/923,917”, dated Sep. 29, 2015, 6 Pages.
“Non-Final Office Action Issued in U.S. Appl. No. 13/923,917”, dated Jun. 30, 2016, 9 Pages.
“Non-Final Office Action Issued in U.S. Appl. No. 13/923,917”, dated May 28, 2015, 10 Pages.
“Non-Final Office Action Issued in U.S. Appl. No. 13/923,969”, dated May 6, 2015, 8 Pages.
“Non-Final Office Action Issued in U.S. Appl. No. 14/201,704”, dated Jul. 1, 2015, 7 Pages.
“Non-Final Office Action Issued in U.S. Appl. No. 14/227,492”, dated Aug. 13, 2015, 37 Pages.
“Non-Final Office Action Issued in U.S. Appl. No. 14/257,502”, dated Feb. 1, 2016, 20 Pages.
Yeh, et al., “Wave-Ray Coupling for Interactive Sound Propagation in Large Complex Scenes”, In Proceedings of the ACM SIGGRAPH Transactions on Graphics (TOG)—vol. 32, Issue 6, Nov. 1, 2013, 11 Pages.
“Non-Final Office Action Issued in U.S. Appl. No. 14/264,012”, dated Mar. 10, 2016, 8 Pages.
“Non-Final Office Action Issued in U.S. Appl. No. 14/264,012”, dated Jul. 31, 2015, 8 Pages.
“Non-Final Office Action Issued in U.S. Appl. No. 14/264,012”, dated Aug. 10, 2016, 9 Pages.
“Final Office Action Issued in U.S. Appl. No. 14/264,619”, dated Aug. 12, 2016, 12 Pages.
“International Search Report and Written Opinion Issued in PCT Application No. PCT/US2015/030096”, dated Aug. 19, 2015, 11 Pages.
“Second Written Opinion Issued in PCT Application No. PCT/US2015/030096”, dated Apr. 5, 2016, 6 Pages.
“International Preliminary Report on Patentability Issued in PCT Application No. PCT/US2015/030104”, dated Apr. 15, 2016, 8 Pages.
“International Search Report & Written Opinion Issued in PCT Application No. PCT/US2015/030104”, dated Aug. 7, 2015, 11 Pages.
“Second Written Opinion Issued in PCT Application No. PCT/US2015/030104”, dated Dec. 4, 2015, 7 Pages.
“International Preliminary Report on Patentability Issued in PCT Patent Application No. PCT/US2015/030113”, dated Jul. 14, 2016, 11 Pages.
“International Search Report & Written Opinion Issued in PCT Application No. PCT/US2015/030113”, dated Aug. 7, 2015, 10 Pages.
“Second Written Opinion Issued in PCT Application No. PCT/US2015/030113”, dated Mar. 21, 2016, 8 Pages.
“International Preliminary Report on Patentability Issued in PCT Application No. PCT/US2015/030153”, dated Apr. 15, 2016, 8 Pages.
“International Search Report and Written Opinion Issued in PCT Application No. PCT/US2015/030153”, dated Aug. 7, 2015, 12 Pages.
“Second Written Opinion Issued in PCT Application No. PCT/US2015/030153”, dated Dec. 4, 2015, 6 Pages.
“International Preliminary Report on Patentability Issued in PCT Application No. PCT/US2015/031270”, dated Aug. 17, 2016, 10 Pages.
“International Search Report & Written Opinion Issued in PCT Application No. PCT/US2015/031270”, dated Sep. 4, 2015, 16 Pages.
“Second Written Opinion Issued in PCT Application No. PCT/US2015/031270”, dated May 3, 2016, 9 Pages.
“International Preliminary Report on Patentability Issued in PCT Application No. PCT/US2015/032089”, dated Jun. 29, 2016, 9 Pages.
“International Search Report & Written Opinion Issued in PCT Application No. PCT/US2015/032089”, dated Jul. 31, 2015, 11 Pages.
“Second Written Opinion Issued in PCT Application No. PCT/US2015/032089”, dated Apr. 12, 2016, 8 Pages.
“International Search Report & Written Opinion Issued in PCT Application No. PCT/US2015/033545”, dated Aug. 20, 2015, 11 Pages.
“International Preliminary Report on Patentability Issued in PCT Application No. PCT/US2015/033872”, dated Jul. 1, 2016, 6 Pages.
“International Search Report & Written Opinion Issued in PCT Application No. PCT/US2015/033872”, dated Sep. 2, 2015, 12 Pages.
“Second Written Opinion Issued in PCT Application No. PCT/US2015/033872”, dated Apr. 21, 2016, 6 Pages.
“International Preliminary Report on Patentability Issued in PCT Application No. PCT/US2015/035218”, dated Nov. 16, 2016, 7 Pages.
“International Search Report and Written Opinion Issued in PCT Patent Application No. PCT/US2015/035218”, dated May 19, 2016, 19 Pages.
“Second Written Opinion Issued in PCT Application No. PCT/US2015/035218”, dated Jul. 27, 2016, 7 Pages.
“International Preliminary Report on Patentability Issued in PCT Application No. PCT/US2015/035219”, dated Jun. 23, 2016, 9 Pages.
“Second Written Opinion Issued in PCT Application No. PCT/US2015/035219”, dated Apr. 26, 2016, 8 Pages.
“International Search Report and Written Opinion Issued in PCT Application No. PCT/US2015/036587”, dated Oct. 8, 2015, 11 Pages.
“Second Written Opinion Issued in PCT Application No. PCT/US2015/036587”, dated May 18, 2016, 7 Pages.
“International Preliminary Report on Patentability Issued in PCT Application No. PCT/US2015/036595”, dated Oct. 7, 2016, 8 Pages.
“International Search Report & Written Opinion Issued in PCT Application No. PCT/US2015/036595”, dated Sep. 24, 2015, 10 Pages.
“Second Written Opinion Issued in PCT Application No. PCT/US2015/036595”, dated May 31, 2016, 6 Pages.
“International Search Report and Written Opinion Issued in PCT Application No. PCT/US2015/036767”, dated Sep. 14, 2015, 18 Pages.
“International Preliminary Report on Patentability Issued in PCT Application No. PCT/US2015/036859”, dated Oct. 7, 2016, 8 Pages.
“International Search Report & Written Opinion Issued in PCT Application No. PCT/US2015/036859”, dated Dec. 22, 2015, 17 Pages.
“Second Written Opinion Issued in PCT Application No. PCT/US2015/036859”, dated May 6, 2016, 7 Pages.
Peng, et al., “Joint and Implicit Registration for Face Recognition”, In Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, Jun. 20, 2009, 8 Pages.
Perumalla, et al., “GPU-based Real-Time Execution of Vehicular Mobility Models in Large-Scale Road Network Scenarios”, In Proceedings of the ACM/IEEE/SCS 23rd Workshop on Principles of Advanced and Distributed Simulation, Jun. 22, 2009, 9 Pages.
Peter, et al., “Frequency-Domain Edge Diffraction for Finite and Infinite Edges”, In Proceedings of the Acta Acustica United with Acustica, vol. 95, Issue 3, May 1, 2009, pp. 568-572.
Petkova, et al., “Proximity-Based Document Representation for Named Entity Retrieval”, In Proceedings of the Sixteenth ACM Conference on Information and Knowledge Management, Nov. 6, 2007, 10 Pages.
Phillips, et al., “The FERET Evaluation Methodology for Face-Recognition Algorithms”, In Proceedings of the IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 22, Issue 10, Oct. 1, 2000, pp. 1090-1104.
Pierce, et al., “Acoustics: An Introduction to Its Physical Principles and Applications”, In Book of Acoustics: An Introduction to Its Physical Principles and Applications, Jun. 1, 1989, 4 Pages.
Ponte, et al., “A Language Modelling Approach to Information Retrieval”, In Proceedings of the 21st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, Aug. 1, 1998, 7 Pages.
Raghuvanshi, et al., “Efficient and Accurate Sound Propagation Using Adaptive Rectangular Decomposition”, In Proceedings of the IEEE Transactions on Visualization and Computer Graphics, vol. 15, Issue 5, Sep. 1, 2009, 10 Pages.
Raghuvanshi, Nikunj, “Interactive Physically-Based Sound Simulation”, In a Dissertation Submitted to the Faculty of The University of North Carolina at Chapel Hill in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy in the Department of Computer Science, Aug. 1, 2010, 187 Pages.
Raghuvanshi, et al., “Parametric wave field coding for precomputed sound propagation”, In Proceedings of the ACM Transactions on Graphics, vol. 33, Issue 4, Jul. 27, 2014, 11 Pages.
Raghuvanshi, et al., “Precomputed Wave Simulation for Real-Time Sound Propagation of Dynamic Sources in Complex Scenes”, In Proceedings of the ACM Transactions on Graphics, vol. 29, Issue 4, Jul. 26, 2010, 11 Pages.
Ramanan, et al., “Local Distance Functions: A Taxonomy, New Algorithms, and an Evaluation”, In Proceedings of the IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 33, Issue 4, Apr. 1, 2011, 8 Pages.
Ramon, San, “Unified Communications Interoperability Forum and Open Networking Foundation Announce Collaborative Relationship Between Unified Communications and Software-Defined Networks”, Retrieved From: http://www.businesswire.com/news/home/20131120005275/en/Unified-Communications-Interoperability-Forum-Open-Networking-Foundation, Nov. 20, 2013, 2 Pages.
Rindel, et al., “The Use of Colors, Animations and Auralizations in Room Acoustics”, In Proceedings of the Inter Noise Conference, Sep. 15, 2013, pp. 4396-4404.
Roberts, et al., “Evaluating Passage Retrieval Approaches for Question Answering”, In Proceedings of the 26th European Conference on Information Retrieval, Apr. 14, 2003, 8 Pages.
Yu, et al., “Exploiting Sparseness in Deep Neural Networks for Large Vocabulary Speech Recognition”, In Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing, Mar. 25, 2012, pp. 4409-4412.
“Non Final office Action Issued in U.S. Appl. No. 14/529,636”, dated Jul. 19, 2016, 13 Pages.
“Non Final Office Action Issued in U.S. Appl. No. 15/497,423”, dated Jun. 25, 2018, 8 Pages.
“Office Action Issued in European Patent Application No. 15721468.5”, dated Dec. 8, 2016, 2 Pages.
“Office Action Issued in European Patent Application No. 15738178.1”, dated Apr. 25, 2017, 5 Pages.
“Search Report Issued in European Patent Application No. 15794355.6”, dated Jul. 19, 2018, 3 Pages.
“First Office Action and Search Report Issued in Chinese Patent Application No. 201580028549.4”, dated Aug. 30, 2018, 17 Pages.
“Office Action Issued in Chinese Patent Application No. 201580030301.1”, dated Aug. 27, 2018, 16 Pages.
“Office Action Issued in Chinese Patent Application No. 201580031657.7”, dated Aug. 31, 2018, 17 Pages.
“Office Action Issued in Chinese Patent Application No. 201580032034.1”, dated Aug. 27, 2018, 14 Pages.
“First Office Action and Search Report Issued in Chinese Patent Application No. 201580033425.5”, dated Dec. 7, 2017, 9 Pages.
“Office Action Issued in Chinese Patent Application No. 201580034192.0”, dated Aug. 27, 2018, 9 Pages.
“Application as filed in U.S. Appl. No. 61/877,856”, filed Sep. 13, 2013, 70 Pages.
“Application as filed in U.S. Appl. No. 61/902,093”, filed Nov. 8, 2013, 76 Pages.
“Application As Filed in U.S. Appl. No. 62/062,732”, dated Oct. 10, 2014, 46 Pages.
Abad, et al., “Context Dependent Modelling Approaches for Hybrid Speech Recognizers”, In Proceedings of the 11th Annual Conference of the International Speech Communication Association, Sep. 26, 2010, pp. 2950-2953.
Abdel-Hamid, et al., “Fast Speaker Adaptation of Hybrid NN/HMM Model for Speech Recognition Based on Discriminative Learning of Speaker Code”, In Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing, May 26, 2013, 5 Pages.
Abid, et al., “A New Neural Network Pruning Method Based on the Singular Value Decomposition and the Weight Initialisation”, In Proceedings of the 11th IEEE on European Signal Processing Conference, Sep. 3, 2002, 4 Pages.
Abraham, et al., “Hierarchical Hub Labelings for Shortest Paths”, In Proceedings of the 20th Annual European Conference on Algorithms, Technical Report MSR-TRMSR-TR-2012-46, Apr. 1, 2012, 15 Pages.
Adams, Paul, “The Next Generation of USB Connector Will Plug in Either Way”, Retrieved From: http://www.popsci.com/article/gadgets/next-generation-usb-connector-will-plug-either-way, Dec. 5, 2013, 3 Pages.
Ajdler, et al., “The Plenacoustic Function and Its Sampling”, In Proceedings of the IEEE Transactions on Signal Processing, vol. 54, Issue 10, Oct. 1, 2006, pp. 3790-3804.
Ajwani, et al., “Breadth First Search on Massive Graphs”, In Proceedings of the 9th DIMACS Implementation Challenge: The Shortest Path Problem, Nov. 13, 2006, 15 Pages.
Al-Hazmi, et al., “Virtualization of 802.11 Interfaces for Wireless Mesh Networks”, In Proceeding of the Eighth International Conference on Wireless On-Demand Network Systems and Services, Computer Networks and Computer Communications Lab, Jan. 26, 2011, 8 Pages.
Al-Kanj, et al., “Optimized Energy Efficient Content Distribution over Wireless Networks with Mobile-to-Mobile Cooperation”, In Proceedings of the IEEE 17th International Conference on Telecommunications, Department of Electrical and Computer Engineering, Apr. 4, 2010, 5 Pages.
Alt, et al., “Increasing the User's Attention on the Web: Using Implicit Interaction Based on Gaze Behavior to Tailor Content”, In Proceedings of the 7th Nordic Conference on Human-Computer Interaction- Making Sense through Design, Oct. 14, 2012, 10 Pages.
Ananthanarayanan, et al., “Collaborative Downloading for Multi-homed Wireless Devices”, In Proceedings of the Eighth IEEE Workshop on Mobile Computing Systems and Applications, Mar. 8, 2007, 6 Pages.
Ananthanarayanan, et al., “COMBINE: Leveraging the Power of Wireless Peers through Collaborative Downloading”, In Proceedings of the ACM 5th International Conference on Mobile Systems, Applications and Services, Jun. 11, 2007, 13 Pages.
Aniyan, Mathew, “New CodeLens Indicator—Incoming Changes”, Retrieved From: https://blogs.msdn.microsoft.com/visualstudioalm/2014/03/03/new-codelens-indicatorincoming-changes/, Mar. 3, 2014, 7 Pages.
Astheimer, Peter, “What You See Is What You Hear—Acoustics Applied in Virtual Worlds”, In Proceedings of the IEEE Symposium on Research Frontiers in Virtual Reality, Oct. 25, 1993, pp. 100-107.
Azizyan, et al., “SurroundSense: Mobile Phone Localization via Ambience Fingerprinting”, In Proceedings of the 15th Annual International Conference on Mobile Computing and Networking, Sep. 20, 2009, 12 Pages.
Barman, et al., “Nonnegative Matrix Factorization (NMF) Based Supervised Feature Selection and Adaptation”, In Proceedings of the 9th International Conference on Intelligent Data Engineering and Automated Learning, Nov. 2, 2008, 2 Pages.
Barrett, et al., “Implementations of Routing Algorithms for Transportation Networks”, In Proceedings of the 9th DIMACS Implementation Challenge: The Shortest Path Problem, Nov. 8, 2006, 19 Pages.
Bast, et al., “Fast Routing in Road Networks with Transit Nodes”, In Proceedings of the Science, vol. 316, No. 5824, Apr. 27, 2007, 1 Page.
Bast, et al., “Route Planning in Transportation Networks”, In Technical Report MSR-TR-2014-4, Jan. 8, 2014, 57 Pages.
Belhumeur, et al., “Eigenfaces vs. Fisherfaces: Recognition Using Class Specific Linear Projection”, In Proceedings of the IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 19, Issue 7, Jul. 1, 1997, pp. 711-720.
Beymer, et al., “WebGazeAnalyzer: A System for Capturing and Analyzing Web Reading Behavior Using Eye Gaze”, In Proceedings of the Extended Abstracts on Human Factors in Computing Systems, Apr. 2, 2005, 10 Pages.
Bleiweiss, Avi, “GPU Accelerated Pathfinding”, In Proceedings of the 23rd ACM Siggraph/Eurographics Symposium on Graphics Hardware, Jun. 20, 2008, pp. 65-74.
Bohus, et al., “Olympus: An Open-Source Framework for Conversational Spoken Language Interface Research”, In Proceedings of the Workshop on Bridging the Gap: Academic and Industrial Research in Dialog Technologies, Apr. 1 2007, 8 Pages.
Bonzi et al., “The Use of Anaphoric Resolution for Document Description in Information Retrieval”, In Proceedings of the Information Processing & Management, vol. 25, Issue 4, Jun. 1, 1989, pp. 53-66.
Bradley, et al., “Accuracy and Reproducibility of Auditorium Acoustics Measures”, in Proceedings of the British Institute of Acoustics, vol. 10, Part 2, Retrieved On: May 6, 2014, pp. 339-406.
Broder, Andrei, “A Taxonomy of Web Search”, In Proceedings of the ACM SIGIR Forum, vol. 36, Issue 2, Sep. 1, 2002, pp. 3-10.
Burges, Christopher JC., “From Ranknet to Lambdarank to Lambdamart: An Overview”, In Proceedings of the Microsoft Research Technical Report MSR-TR-2010-82, Jun. 23, 2010, 19 Pages.
Burges, et al., “Learning to Rank With Nonsmooth Cost Functions”, In Proceedings of the 19th International Conference on Neural Information Processing Systems, Dec. 4, 2006, 8 Pages.
Buscher, et al., “Generating and Using Gaze-Based Document Annotations”, In Proceedings of the Extended Abstracts on Human Factors in Computing Systems, Apr. 5, 2008, 6 Pages.
Calamia, Paul Thomas., “Advances in Edge-Diffraction Modeling for Virtual-Acoustic Simulations”, In Doctoral Dissertation of Princeton University, in Candidacy for the Degree of Doctor of Philosophy, Jun. 1, 2009, 159 Pages.
Callan, James P., “Passage-Level Evidence in Document Retrieval”, In Proceedings of the 17th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, Jul. 3, 1994, pp. 302-310.
Cao, et al., “Face Recognition with Learning-based Descriptor”, In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, Jun. 13, 2010, 8 Pages.
Castro, et al., “A Probabilistic Room Location Service for Wireless Networked Environments”, In Proceedings of the 3rd International Conference on Ubiquitous Computing, Sep. 30, 2001, 19 Pages.
Nguyen, et al., “Cosine Similarity Metric Learning for Face Verification”, In Proceedings of the 10th Asian Conference on Computer Vision, vol. Part II, Nov. 8, 2010, 12 Pages.
Novak, et al., “Use of Non-Negative Matrix Factorization for Language Model Adaptation in a Lecture Transcription Task”, In Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing, vol. 1, May 7, 2001, 4 Pages.
O'Connor, Enda, et al., “Patch Management Best Practices”, Retrieved From: http://www.oracle.com/technetwork/systems/articles/patch-management-jsp-135385.html, Apr. 1, 2008, 8 Pages.
Ojala, et al., “A Generalized Local Binary Pattern Operator for Multiresolution Gray Scale and Rotation Invariant Texture Classification”, In Proceedings of the 2nd International Conference on Advances in Pattern Recognition, Mar. 11, 2001, 10 Pages.
Ortega-Arranz, et al., “A New GPU-based Approach to the Shortest Path Problem”, In Proceedings of the International Conference on High Performance Computing and Simulation, Jul. 1, 2013, 7 Pages.
Papadopoulos, et al., “Image Clustering Through Community Detection on Hybrid Image Similarity Graphs”, In Proceedings of the 17th IEEE International Conference on Image Processing, Sep. 26, 2014, 4 Pages.
Park, et al., “Monitoring Impact Events Using a System-Identification Method”, In AAA Journal, vol. 47, Issue 9, Sep. 1, 2009, pp. 2011-2021.
Pascoal, Marta M. B., “Implementations and Empirical Comparison of K Shortest Loopless Path Algorithms”, In Proceedings of the 9th DIMACS Implementation Challenge: The Shortest Path Problem, Nov. 13, 2006, 16 Pages.
“Written Opinion Issued in PCT Application No. PCT/US2015/027688”, dated Feb. 9, 2016, 6 Pages.
“International Preliminary Report on Patentability Issued in PCT Application No. PCT/US2014/041014”, dated Sep. 15, 2015, 6 Pages.
“International Search Report & Written Opinion Issued in PCT Application No. PCT/US2015/017872”, dated Jun. 25, 2015, 11 Pages.
“International Search Report & Written Opinion Issued in PCT Application No. PCT/US2014/041014”, dated Oct. 2, 2014, 9 Pages.
“International Preliminary Report on Patentability Issued in PCT Application No. PCT/US2015/017872”, dated Dec. 14, 2015, 7 Pages.
“International Preliminary Report on Patentability for PCT Patent Application No. PCT/US2014/041023”, dated Nov. 13, 2015, 18 Pages.
“International Search Report & Written Opinion Issued in PCT Application No. PCT/US2014/041023”, dated Jun. 3, 2015, 16 Pages.
Xue, et al., “Singular Value Decomposition Based Low-Footprint Speaker Adaptation and Personalization for Deep Neural Network”, In Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing, May 4, 2014, pp. 6359-6363.
Xue, et al., “Restructuring of Deep Neural Network Acoustic Models with Singular Value Decomposition”, In Proceedings of the 14th Annual Conference of the International Speech Communication Association, Aug. 25, 2013, pp. 2365-2369.
Yan, et al., “A Scalable Approach to Using DNN-Derived Features in GMM-HMM Based Acoustic Modeling for LVCSR”, In Proceedings of the 14th Annual Conference of the International Speech Communication Association, Aug. 25, 2013, 5 Pages.
Yang, et al., “Qualifier in TREC-12 QA Main Task”, In Proceedings of the 12th Text Retrieval Conference, Nov. 1, 2003, 9 Pages.
Yao, et al., “Adaptation of Context-Dependent Deep Neural Networks for Automatic Speech Recognition”, In Proceedings of the IEEE Spoken Language Technology Workshop, Dec. 2, 2012, pp. 366-369.
“International Search Report and Written Opinion Issued in PCT Application No. PCT/US2015/021921”, dated Jul. 17, 2015, 11 Pages.
“Second Written Opinion Issued in PCT Application No. PCT/US2015/021921”, dated Feb. 11, 2016, 7 Pages.
“International Search Report & Written Opinion Issued in PCT Application No. PCT/US2015/022886”, dated Aug. 31, 2015, 17 Pages.
“Second Written Opinion Issued in PCT Application No. PCT/US2015/022886”, dated Jun. 16, 2016, 9 Pages.
“International Preliminary Report on Patentability Issued in PCT Application No. PCT/US2015/022887”, dated Apr. 7, 2016, 8 Pages.
“International Search Report and Written Opinion Issued in PCT Application No. PCT/US2015/022887”, dated Jun. 26, 2015, 12 Pages.
“Second Written Opinion Issued in PCT Application No. PCT/US2015/022887”, dated Jan. 7, 2016, 5 Pages.
“International Search Report and Written Opinion Issued in PCT Patent Application No. PCT/US2015/024594”, dated Jul. 24, 2015, 9 Pages.
“International Preliminary Report on Patentability Issued in PCT Application No. PCT/US2015/026971”, dated Aug. 10, 2016, 8 Pages.
“International Search Report and Written Opinion Issued in PCT Patent Application No. PCT/US2015/026971”, dated Jul. 24, 2015, 14 Pages.
“Second Written Opinion Issued in PCT Application No. PCT/US2015/026971”, dated Mar. 30, 2016, 7 Pages.
“International Preliminary Report on Patentability Issued in Patent Application No. PCT/US2015/027409”, dated Jun. 16, 2016, 9 Pages.
“International Search Report & Written Opinion Issued in PCT Application No. PCT/US2015/027409”, dated Jul. 22, 2015, 13 Pages.
“Second Written Opinion Issued in PCT Application No. PCT/US2015/027409”, dated Mar. 18, 2016, 8 Pages.
“International Preliminary Report on Patentability Issued in PCT Application No. PCT/US2015/027688”, dated Apr. 26, 2016, 7 Pages.
“International Search Report and Written Opinion Issued in PCT Application No. PCT/US2015/027688”, dated Jul. 9, 2015, 9 Pages.
“Second Written Opinion Issued in PCT Application No. PCT/US2015/027688”, dated Feb. 9, 2016, 6 Pages.
“International Preliminary Report on Patentability Issued in PCT Application No. PCT/US2015/027689”, dated Jul. 18, 2016, 9 Pages.
“International Search Report and Written Opinion Issued in PCT Patent Application No. PCT/US2015/027689”, dated Jul. 8, 2015, 13 Pages.
“Second Written Opinion Issued in PCT Application No. PCT/US2015/027689”, dated Apr. 1, 2016, 8 Pages.
“International Preliminary Report on Patentability Issued in PCT Application No. PCT/US2015/028383”, dated Jul. 18, 2016, 10 Pages.
“International Search Report & Written Opinion Issued in PCT Application No. PCT/US2015/028383”, dated Jul. 24, 2015, 13 Pages.
“Second Written Opinion Issued in PCT Application No. PCT/US2015/028383”, dated Apr. 18, 2016, 9 Pages.
“International Preliminary Report on Patentability Issued in PCT Application No. PCT/US2015/029334”, dated Jul. 18, 2016, 8 Pages.
“International Search Report & Written Opinion for PCT Application No. PCT/US2015/029334”, dated Jul. 7, 2015, 11 Pages.
“Second Written Opinion Issued in PCT Application No. PCT/US2015/029334”, dated Mar. 31, 2016, 5 Pages.
“International Preliminary Report on Patentability Issued in PCT Application No. PCT/US2015/029805”, dated Jul. 27, 2016, 11 Pages.
“International Search Report and Written Opinion Issued in PCT Application No. PCT/US2015/029805”, dated Oct. 15, 2015, 19 Pages.
“Second Written Opinion Issued in PCT Application No. PCT/US2015/029805”, dated May 6, 2016, 9 Pages.
“International Preliminary Report on Patentability Issued in Application No. PCT/US2015/030096”, dated Jul. 14, 2016, 8 Pages.
Gade, Anders, “Acoustics in Halls for Speech and Music”, In Proceedings of the Springer Handbook of Acoustics, Jan. 1, 2007, 8 Pages.
Gajos, et al., “Automatically Generating Personalized User Interfaces With Supple”, In Proceedings of the Artificial Intelligence, vol. 174, Issue 12-13, Aug. 1, 2010, 49 Pages.
Gajos, et al., “Exploring the Design Space for Adaptive Graphical User Interfaces”, In Proceedings of the ACM Working Conference on Advanced Visual Interfaces, May 23, 2006, 8 Pages.
Geisberger, et al., “Efficient Routing in Road Networks with Turn Costs”, In Proceedings of the 10th International Conference on Experimental Algorithms, May 5, 2011, 12 Pages.
Geisberger, et al., “Exact Routing in Large Road Networks using Contraction Hierarchies”, In Proceedings of the Transportation Science, vol. 46, Issue 3, Apr. 5, 2012, 17 Pages.
Gemello, et al., “Adaptation of Hybrid ANN/HMM Models Using Linear Hidden Transformations and Conservative Training”, In Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing, vol. 1, May 14, 2006, pp. 1189-1192.
Goldberg, et al., “Better Landmarks within Reach”, In Proceedings of the 6th International Conference on Experimental Algorithms, Jun. 6, 2007, 14 Pages.
Goldstein, et al., “Summarizing Text Documents: Sentence Selection and Evaluation Metrics”, In Proceedings of the 22nd Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, Aug. 15, 1999, pp. 121-128.
Gooch, et al., “Color2Gray: Salience-Preserving Color Removal”, In Journal of ACM Transactions on Graphics, vol. 24, Issue 3, Jul. 31, 2005, 6 Pages.
Grasset, et al., “Image-Driven View Management for Augmented Reality Browsers”, In Proceedings of the IEEE International Symposium on Mixed and Augmented Reality, Nov. 5, 2012, 10 Pages.
Gruenstein, et al., “Context-Sensitive Language Modeling for Large Sets of Proper Nouns in Multimodal Dialogue Systems”, In Proceedings of the IEEE/ACL Workshop on Spoken Language Technology, Dec. 10, 2006, pp. 130-133.
Guillaumin, et al., “Is that you? Metric Learning Approaches for Face Identification”, In Proceedings of the 12th IEEE International Conference on Computer Vision, Sep. 29, 2009, 8 Pages.
Gumerov, et al., “Fast Multipole Methods on Graphics Processors”, In Journal of Computational Physics, vol. 227, Issue 18, Sep. 10, 2008, 4 Pages.
Harper, et al., “A Language Modelling Approach to Relevance Profiling for Document Browsing”, In Proceedings of the 2nd ACM/IEEE-CS Joint Conference on Digital Libraries, Jul. 14, 2002, 8 Pages.
Harper, et al., “Within-Document Retrieval: A User-Centered Evaluation of Relevance Profiling”, In Journal of Information Retrieval, vol. 7, Issue 3-4, Sep. 1, 2004, 26 Pages.
Harris, Frederic J., “On the Use of Windows for Harmonic Analysis with the Discrete Fourier Transform”, In Proceedings of the IEEE, vol. 66, Issue 1, Jan. 1, 1978, pp. 51-84.
Hawamdeh, et al., “Paragraph-Based Nearest Neighbor Searching in Full-Text Documents”, In Proceedings of the Electronic Publishing, vol. 2, No. 4, Dec. 1, 1989, pp. 179-192.
He, et al., “What is Discriminative Learning?”, In Proceedings of the Discriminative Learning for Speech Recognition Theory and Practice, Achorn International, Jun. 25, 2008, 25 Pages.
Hearst, Marti A., “Tilebars: Visualization of Term Distribution Information in Full Text Information Access”, In Proceedings of the SIGCHI Conference on Human Factors in Computing System, May 7, 1995, pp. 59-66.
Heck, et al., “Robustness to Telephone Handset Distortion in Speaker Recognition by Discriminative Feature Design”, In Journal of Speech Communication—Speaker Recognition and its Commercial and Forensic Applications, vol. 31, Issue 2-3, Jun. 1, 2000, pp. 181-192.
Hefeeda, Mohamed M., “A Framework for Cost-Effective Peer-to-Peer Content Distribution”, In Proceedings of the Eleventh ACM International Conference on Multimedia, Department of Computer Sciences, Nov. 2, 2003, 2 Pages.
Hinton, et al., “Deep Neural Networks for Acoustic Modeling in Speech Recognition”, In Proceedings of the IEEE Signal Processing Magazine, vol. 29, Issue 6, Apr. 27, 2012, 27 Pages.
Xu, et al., “User-Oriented Document Summarization through Vision-Based Eye-Tracking”, In Proceedings of the 14th International Conference on Intelligent User Interfaces, Feb. 8, 2009, 10 Pages.
Hodgson, et al., “Experimental Evaluation of Radiosity for Room Sound-Field Prediction”, In the Journal of the Acoustical Society of America, vol. 120, Issue 2, Aug. 1, 2006, pp. 808-819.
Hoffmeister, et al., “Log-Linear Model Combination with Word-Dependent Scaling Factors”, In Proceedings of the Human Language Technology and Pattern Recognition Computer Science Department, Sep. 6-10, 2009, 4 Pages.
Holzer, et al., “Engineering Multilevel Overlay Graphs for Shortest-Path Queries”, In Journal of Experimental Algorithmics (JEA), vol. 13, Article No. 5, Sep. 1, 2008, 24 Pages.
Hsu, et al., “HBCI: Human-Building-Computer Interaction”, In Proceedings of the 2nd ACM Workshop on Embedded Sensing Systems for Energy-Efficiency in Building, Nov. 2, 2010, 6 Pages.
Huang, et al., “Labeled Faces in the Wild: A Database for Studying Face Recognition in unconstrained Environments”, In Proceedings of the 10th European Conference on Computer Vision, Oct. 12, 2008, 11 Pages.
Huang, et al., “Unified stochastic engine (USE) for speech recognition”, In Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing, vol. 2, Apr. 27, 1993, pp. 636-639.
Hughes, Neil, “Apple's Lightning Port Dynamically Assigns Pins to Allow for Reversible Use”, Retrieved From: http://appleinsider.com/articles/12/09/25/apples-lightning-port-dynamically-assigns-pins-to-allow-for-reversible-use, Sep. 25, 2012, 9 Pages.
Ioffe, Sergey, “Probabilistic Linear Discriminant Analysis”, In Proceedings of the 9th European Conference on Computer Vision, Part IV, May 7, 2001, pp. 531-542.
Jacob, Josh, “QR Directory App—Overview”, In Blog of Josh Jacob Dev, Apr. 21, 2011, 3 Pages.
Jaiswal, et al., “Bulk Content Delivery Using Co-Operating End-Nodes with Upload/Download Limits”, In Proceedings of the IEEE Fifth International Conference on Communication Systems and Networks, Sep. 10, 2012, 11 Pages.
Jaitly, et al., “Application of Pretrained Deep Neural Networks to Large Vocabulary Conversational Speech Recognition”, In Proceedings of the 13th Annual Conference of the International Speech Communication Association, Mar. 12, 2012, 11 Pages.
Jluedemann, “Networking & Wireless Forum: How to Set up Dual Network Adapters”, Retrieved From: http://www.cnet.com/forums/discussions/how-to-set-up-dual-network-adapters-531538/, Jun. 27, 2011, 3 Pages.
Jones, Karen Sparck., “Automatic Summarising: The State of the Art”, In Journal of Information Processing and Management: an International Journal, vol. 43, Issue 6, Oct. 1, 2007, 52 Pages.
Karpinski, et al., “Multi-GPU Parallel Memetic Algorithm for Capacitated Vehicle Routing Problem”, In Lecture Notes in Computer Science, Jan. 21, 2014, 12 Pages.
Kaszkiel, et al., “Effective Ranking with Arbitrary Passages”, In Journal of the American Society for Information Science and Technology, vol. 52, Issue 4, Jan. 22, 2001, pp. 344-364.
Kaszkiel, et al., “Efficient Passage Ranking for Document Databases”, In Journal of ACM Transactions on Information Systems, vol. 17, Issue 4, Oct. 1, 1999, 26 Pages.
Keller, et al., “MicroCast: Cooperative Video Streaming on Smartphones”, In Proceedings of the 10th International Conference on Mobile Systems, Applications and Services, Jun. 25, 2012, 13 Pages.
Keshtkar, et al., “A Corpus-Based Method for Extracting Paraphrases of Emotion Terms”, In Proceedings of the NAACL HLT Workshop on Computational Approaches to Analysis and Generation of Emotion in Text, Jun. 5, 2010, pp. 35-44.
Ko, et al., “Cammia—A Context-Aware Spoken Dialog System for Mobile Environments”, In Proceedings of the Automatic Speech Recognition and Understanding Workshop, Jul. 29, 2011, 2 Pages.
Kohler, et al., “Fast Point-to-Point Shortest Path Computations with Arc-Flags”, In Proceedings of the Shortest Path Computations: Ninth DIMACS Challenge, vol. 24 of DIMACS Book, American Mathematical Society, Nov. 13, 2006, 27 Pages.
Kolarik, et al., “Perceiving Auditory Distance Using Level and Direct-to-Reverberant Ratio Cues”, In the Journal of the Acoustical Society of America, vol. 130, Issue 4, Oct. 2011, 4 Pages.
Konig, et al., “Nonlinear Discriminant Feature Extraction for Robust Text-Independent Speaker Recognition”, In Proceedings of the RLA2C, ESCA workshop on Speaker Recognition and its Commercial and Forensic Applications, Apr. 1, 1998, 4 Pages.
Koo, et al., “Autonomous Construction of a WiFi Access Point Map Using Multidimensional Scaling”, In Proceedings of the 9th International Conference on Pervasive computing, Jun. 12, 2011, 18 Pages.
Krokstad, Asbjorn, “The Hundred Years Cycle in Room Acoustic Research and Design”, In Proceedings of the Reflections on Sound, Norwegian University of Science and Technology, Jun. 1, 2008, 30 Pages.
Kumar, et al., “Attribute and Simile Classifiers for Face Verification”, In Proceedings of the 12th IEEE International Conference on Computer Vision, Sep. 29, 2009, 8 Pages.
Kumar, et al., “Describable Visual Attributes for Face Verification and Image Research”, In Journal of the IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 33, Issue 10, Oct. 1, 2011, 17 Pages.
Kumar, et al., “Face Recognition Using Gabor Wavelets”, In Proceedings of the 40th IEEE Asilomar Conference on Signals, Systems and Computers, Oct. 29, 2006, 5 Pages.
Chandak, et al., “AD Frustum: Adaptive Frustum Tracing for Interactive Sound Propagation”, In Proceedings of the IEEE Transactions on Visualization and Computer Graphics, vol. 14, Issue 6, Nov. 1, 2008, pp. 1707-1714.
Chandra, et al., “MultiNet: Connecting to Multiple IEEE 802.11 Networks Using a Single Wireless Card”, In Proceedings of the 23rd Annual Joint Conference of the IEEE Computer and Communications Societies, INFOCOM, Mar. 7, 2004, 12 Pages.
Chandrasekaran, et al., “Sparse and Low-Rank Matrix Decompositions”, In Proceedings of the IFAC Symposium on System Identification, vol. 42, Issue 10, Sep. 30, 2009, 6 Pages.
Chen, et al., “Bayesian Face Revisited: A Joint Formulation”, In Proceedings of the 12th European Conference on Computer Vision, vol. Part III, Oct. 7, 2012, 14 Pages.
Chen, Wei, “Building Language Model on Continuous Space using Gaussian Mixture Models”, In Proceedings of the Research in Language Modeling, Jan. 1, 2007, 66 Pages.
Chen, et al., “Supplemental Material for Bayesian Face Revisited: A Joint Formulation”, Retrieved From: https://www.microsoft.com/en-us/research/wp-content/uploads/2012/01/JointBayesian_Suppl.pdf, Apr. 1, 2013, 5 Pages.
Cheng, et al., “Entityrank: Searching Entities Directly and Holistically”, In Proceedings of the 33rd International Conference on Very Large Data Bases, Sep. 23, 2007, 12 Pages.
Cheng, et al., “Heritage and Early History of the Boundary Element Method”, In Proceedings of the Engineering Analysis with Boundary Elements, vol. 29, Issue 3, Mar. 1, 2005, pp. 268-302.
Chi, et al., “Visual Foraging of Highlighted Text: An Eye-Tracking Study”, In Proceedings of the 12th International Conference on Human-Computer Interaction-Intelligent Multimodal Interaction Environments, Jul. 22, 2007, pp. 589-598.
Choi, et al., “Face Annotation for Personal Photos Using Collaborative Face Recognition in Online Social Networks”, In Proceedings of the 16th International Conference on Digital Signal Processing, Jul. 5, 2009, 8 Pages.
Choudhury, et al., “A Framework for Robust Online Video Contrast Enhancement Using Modularity Optimization”, In Proceedings of the IEEE Transactions on Circuits and Systems for Video Technology, vol. 22, Issue 9, Sep. 9, 2012, 14 Pages.
Clarke, et al., “Exploiting Redundancy in Question Answering”, In Proceedings of the 24th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, Sep. 9, 2001, 8 Pages.
Cootes, et al., “Chapter 3: Modeling Facial Shape and Appearance”, In Handbook of Face Recognition, Chapter 3, Published by Springer New York, 2005, pp. 39-63.
Cormen, et al., “Introduction to Algorithms”, In Book of Introduction to Algorithms, Third Edition, Published by the MIT Press, Jul. 31, 2009, 43 Pages.
Ying, et al., “Distance Metric Learning with Eigenvalue Optimization”, In Journal of Machine Learning Research, vol. 13, Issue 1, Jan. 1, 2012, 26 Pages.
Cucerzan, Silviu, “Large-Scale Named Entity Disambiguation Based on Wikipedia Data”, In Proceedings of the Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning, Jun. 28, 2007, pp. 708-716.
Cvetkovic, et al., “Image enhancement circuit using non-linear processing curve and constrained histogram range equalization”, In Proceedings of the SPIE and IS&T Conference on Visual Communication and Image Processing, vol. 5308, Jan. 7, 2004, 11 Pages.
Dahl, et al., “Context-Dependent Pre-Trained Deep Neural Networks for Large Vocabulary Speech Recognition”, In Proceedings of the IEEE Transactions on Audio, Speech, and Language Processing, vol. 20, Issue 1, Jan. 1, 2012, pp. 30-42.
Dahl, et al., “Large Vocabulary Continuous Speech Recognition with Context-Dependent DBN-HMMs”, In Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing, May 22, 2011, 4 Pages.
Davis, et al., “Information-Theoretic Metric Learning”, In Proceedings of the 24th International Conference on Machine Learning, Jun. 20, 2007, 8 Pages.
Davis, et al., “Low-Rank Approximations for Conditional Feedforward Computation in Deep Neural Networks”, In Journal of Computing Research Repository, Dec. 16, 2013, pp. 1-10.
Delano, et al., “Integrated Development Environments for Natural Language Processing”, Retrieved From: http://www.textanalysis.com/TAI-IDE-WP.pdf, Oct. 1, 2001, 13 Pages.
Delling, et al., “Customizable Route Planning”, In Proceedings of the 10th International Symposium on Experimental Algorithms, May 5, 2011, 12 Pages.
Delling, et al., “Customizable Route Planning in Road Networks”, In Proceedings of the Sixth Annual Symposium on Combinatorial Search, AAAI Publications, Jul. 24, 2011, 31 Pages.
Delling, et al., “Customizing Driving Directions With GPUs”, In Proceedings of the 20th Euro-Par International Conference on Parallel Processing, Aug. 25, 2014, 12 Pages.
Delling, et al., “Faster Customization of Road Networks”, In Proceedings of the 12th International Symposium on Experimental Algorithms, Jun. 5, 2013, 12 Pages.
Delling, et al., “Graph Partitioning with Natural Cuts”, In Proceedings of the IEEE International Parallel & Distributed Processing Symposium, Dec. 1, 2010, 27 Pages.
Delling, et al., “High-Pertormance Multi-Level Graphs”, In Proceedings of the 9th DIMACS Implementation Challenge: The Shortest Path Problem, Nov. 1, 2006, 13 Pages.
Delling, et al., “Highway Hierarchies Star”, In Proceedings of the 9th DIMACS Implementation Challenge: The Shortest Path Problem, Nov. 13, 2006, 29 Pages.
Delling, et al., “PHAST: Hardware-Accelerated Shortest Path Trees”, In Joumal of Parallel and Distributed Computing, vol. 73, Issue 7, Sep. 1, 2010, 20 Pages.
Demetrescu, et al., “The Shortest Path Problem: Ninth DIMACS Implementation Challenge”, In Proceedings of the DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 74, Aug. 15, 2009, 3 Pages.
Diez, et al., “Optimization of a Face Verification System Using Bayesian Screening Techniques”, In Proceedings of the 23rd IASTED International Multi-Conference on Artificial Intelligence and Applications, Feb. 14, 2005, pp. 427-432.
Ding, et al., “Chapter 12: Facial Landmark Localization”, In Book of Handbook of Face Recognition, Second Edition, Aug. 22, 2011, pp. 305-322.
Dong, et al., “Image Retargeting by Content-Aware Synthesis”, In Proceedings of the IEEE Transaction on Visualisation and Computer Graphics, vol. XX, No. XX, Jun. 2014, 14 Pages.
Yin, et al., “An Associate-Predict Model for Face Recognition”, In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, Jun. 20, 2011, pp. 497-504.
Doren, Don Van., “Unified Communication and Collaboration from the User's Perspective”, Retrieved From: http://www.ucstrategies.com/unified-communications-expert-views/unified-communication-and-collaboration-from-the-users-perspective.aspx, Retrieved Date: Dec. 8, 2009, 2 Pages.
Eagle, et al., “Common Sense Conversations: Understanding Casual Conversation using a Common Sense Database”, In Proceedings of the Artificial Intelligence, Information Access and Mobile Computing Workshop, Aug. 1, 2003, 6 Pages.
Edens, et al., “An Investigation of Broad Coverage Automatic Pronoun Resolution for Information Retrieval”, In Proceedings of the 26th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, Jul. 28, 2003, pp. 381-382.
Edmonds, et al., “Single-Source Shortest Paths With the Parallel Boost Graph Library”, In Proceedings of the 9th DIMACS Implementation Challenge: The Shortest Path Problem, Nov. 4, 2006, 20 Pages.
Efentakis, et al., “Optimizing Landmark-Based Routing and Preprocessing”, In Proceedings of the Sixth ACM SIGSPATIAL International Workshop on Computational Transportation Science, Nov. 5, 2013, 6 Pages.
Elrakabawy, et al., “Peer-to-Peer File Transfer in Wireless Mesh Networks”, In Proceedings of the Fourth Annual Conference on Wireless on Demand Network Systems and Services, Jan. 24, 2007, 8 Pages.
Fang, et al., “A Formal Study of Information Retrieval Heuristics”, In Proceedings of the 27th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, Jul. 25, 2004, 8 Pages.
Ferguson, Scott, “Five Key Criteria for adaptable SDN Wi-Fi”, Retrieved From: http://www.extremenetworks.com/five-key-criteria-for-adaptable-sdn-wi-fi/, Nov. 25, 2013, 7 Pages.
Finkel, et al., “Incorporating Non-Local Information into Information Extraction Systems by Gibbs Sampling”, In Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics, Jun. 25, 2005, pp. 363-370.
Fiore et al., “Information Density Estimation for Content Retrieval in MANETs”, In Proceedings of the IEEE Transactions on Mobile Computing, vol. 8, Issue 3, Mar. 1, 2009, 15 Pages.
Florescu, et al., “Towards a Peer-Assisted Content Delivery Architecture”, In Proceedings of the 18th International Conference on Control Systems and Computer Science, May 1, 2011, 8 Pages.
Friedman, Jerome H., “Greedy Function Approximation: A Gradient Boosting Machine”, In Proceedings of the Annals of Statistics, vol. 29, Issue 5, Feb. 24, 1999, 34 Pages.
Funkhouser, et al., “A Beam Tracing Method for Interactive Architectural Acoustics”, In Journal of the Acoustical Society of America, vol. 115, Feb. 1, 2004, pp. 739-756.
Funkhouser, et al., “Realtime Acoustic Modeling for Distributed Virtual Environments”, In Proceedings of the 26th Annual Conference on Computer Graphics and Interactive Techniques, Jul. 1, 1999, pp. 365-374.
Funkhouser, et al., “Survey of Methods for Modeling Sound Propagation in Interactive Virtual Environment Systems”, In Journal of Presence and Teleoperation, Jan. 1, 2003, 53 Pages.
“Second Office Action Issued in Chinese Patent Application No. 201580032034.1”, dated Apr. 22, 2019, 13 Pages.
“Second Office Action Issued in Chinese Patent Application No. 201580034192.0”, dated Apr. 22, 2019, 10 Pages.
“Office Action Issued in European Patent Application No. 15721468.5”, dated May 24, 2019, 8 Pages.
“Office Action Issued in Chinese Patent Application No. 201580029370.0”, dated Feb. 28, 2019, 15 Pages.
Kumar, et al., “Gaze-Enhanced Scrolling Techniques”, In Proceedings of the 20th Annual ACM Symposium on User Interface Software and Technology, Apr. 28, 2007, pp. 2531-2536.
Kuttruff, Heinrich, “Room Acoustics, Fourth Edition”, In Book of Room Acoustics, Fourth Edition, Published by CRC Press, ISBN 9780419245803—CAT# RU29207, Aug. 3, 2000, 1 Page.
Lambert, et al., “Step by Step Microsoft Word 2013”, In Book Step by Step, First Edition, Published by Microsoft Press, Jan. 15, 2013, 576 Pages.
Lanitis, et al., “Toward Automatic Simulation of Aging Effects on Face Images”, In Proceedings of the IEEE Transaction of Pattern Analysis and Machine Intelligence (PAML), vol. 24, Issue 4, Apr. 1, 2002, pp. 442-455.
Lauterbach, et al., “Interactive Sound Rendering in Complex and Dynamic Scenes Using Frustum Tracing”, In Proceedings of the IEEE Transactions on Visualization and Computer Graphics, vol. 13, Issue 6, Nov. 1, 2007, pp. 1672-1679.
Lauther, Ulrich, “An Experimental Evaluation for Point-To-Point Shortest Path Calculation on Roadnetworks with Precalculated Edge-Flags”, In Proceedings of the 9th DIMACS Implementation Challenge: The Shortest Path Problem, Nov. 3, 2006, 18 Pages.
Lavrenko, et al., “Relevance-Based Language Models”, In Proceedings of the 24th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, Sep. 9, 2001, pp. 120-127.
Lecouteux, et al., “Dynamic Combination of Automatic Speech Recognition Systems by Driven Decoding”, In Proceedings of the IEEE Transactions on Audio, Speech and Language Processing, vol. 21, Issue 6, Jan. 1, 2013, 10 Pages.
Lee, et al., “Deterministic Coreference Resolution Based on Entity-Centric, Precision-Ranked Rules”, In Journal of Computational Linguistics, vol. 39, Issue 4, Dec. 1, 2013, 32 Pages.
Lee, et al., “Intention-Based Corrective Feedback Generation using Context-Aware Model”, In Proceedings of the Second International Conference on Computer Supported Education, Apr. 7, 2010, 8 Pages.
Lei, et al., “Face Recognition by Exploring Information Jointly in Space, Scale and Orientation”, In Proceedings of the IEEE Transactions on Image Processing, vol. 20, Issue 1, Jan. 1, 2011, pp. 247-256.
Lentz, et al., “Virtual Reality System with Integrated Sound Field Simulation and Reproduction”, In EURASIP Journal on Applied Signal Processing, vol. 2007, Issue 1, Jan. 1, 2007, 22 Pages.
Li, et al., “Bayesian Face Recognition Using Support Vector Machine and Face Clustering”, In Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, Jun. 27, 2004, 7 Pages.
Li, et al., “Comparison of Discriminative Input and Output Transformations for Speaker Adaptation in the Hybrid NN/HMM Systems”, In Proceedings of the 11th Annual Conference of the International Speech Communication Association, INTERSPEECH, Sep. 26, 2010, pp. 526-529.
Li, et al., “Lattice Combination for Improved Speech Recognition”, In Proceedings of the 7th International Conference of Spoken Language Processing, Sep. 16, 2002, 4 Pages.
Li, et al., “Probabilistic Models for Inference about Identity”, In Proceedings of the IEEE Transactions on Pattern Recognition and Machine Intelligence, vol. 34, Issue 1, Jan. 1, 2012, 16 Pages.
Li, et al., “Spatial Sound Rendering Using Measured Room Impulse Responses”, In Proceedings of the IEEE International Symposium on Signal Processing and Information Technology, Aug. 27, 2006, pp. 432-434.
Liang et al., “Face Alignment via Component-Based Discriminative Search”, In Proceedings of the 10th European Conference on Computer Vision, Lecture Notes in Computer Science, vol. 5303, Oct. 12, 2008, 14 Pages.
Liao, Hank, “Speaker Adaptation of Context Dependent Deep Neural Networks”, In Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing, May 26, 2013, 5 Pages.
Lilly, et al., “Robust Speech Recognition using Singular Value Decomposition based Speech Enhancement”, In Proceedings of the IEEE Region 10th Annual Conference on Speech and Image Technologies for Computing and Telecommunications, vol. 1, 1997, pp. 257-260.
Lin, et al., “What Makes a Good Answer? The Role of Context in Question Answering”, In Proceedings of the Ninth IFIP TC13 International Conference on Human-Computer Interaction, Sep. 1, 2003, 8 Pages.
Liu, et al., “Language Model Combination and Adaptation using Weighted Finite State Transducers”, In Proceedings of the IEEE International Conference on Acoustics Speech and Signal Processing, Mar. 14, 2010, 4 Pages.
Liu, et al., “Use of Contexts in Language Model Interpolation and Adaptation”, In Journal of Computer Speech and Language, vol. 27, Issue 1, Feb. 1, 2009, 23 Pages.
Loizides, et al., “The Myth of Find: User Behaviour and Attitudes Towards the Basic Search Feature”, In Proceedings of the 8th ACM/IEEE-CS Joint Conference on Digital Libraries, Jun. 16, 2008, 4 Pages.
Lokki, et al., “Creating interactive virtual auditory environments”, In Proceedings of the IEEE on Computer Graphics and Applications, vol. 22, Issue 4, Jul. 1, 2002, pp. 49-57.
Lu, et al., “Context Aware Textures”, In Journal of ACM Transactions on Graphics, vol. 26, Issue 1, Article No. 3, Jan. 1, 2007, 31 Pages.
Luo, et al., “UCAN: A Unified Cellular and AdHoc Network Architecture”, In Proceedings of the Ninth ACM Annual International Conference on Mobile Computing and Networking, Sep. 14, 2013, 15 Pages.
Lv, et al., “A Comparative Study of Methods for Estimating Query Language Models with Pseudo Feedback”, In Proceedings of the 18th ACM Conference on Information and Knowledge Management, Nov. 2, 2009, 4 Pages.
Lv, et al., “Positional Language Models for Information Retrieval”, In Proceedings of the 32nd International ACM SIGIR Conference on Research and Development in Information Retrieval, Jul. 19, 2009, 8 Pages.
Madduri, et al., “Parallel Shortest Path Algorithms for Solving Large-Scale Instances”, In Proceedings of the 9th DIMACS Implementation Challenge—The Shortest Path Problem, DIMACS Center, Aug. 30, 2006, 39 Pages.
Malony, et al., “Compensation of Measurement Overhead in Parallel Performance Profiling”, In Proceedings of the International Journal of High Performance Computing Applications, vol. 21, Issue 2, May 1, 2007, 23 Pages.
Malony, et al., “Overhead Compensation in Performance Profiling”, In Lecture Notes in Computer Science, vol. 3149, Oct. 1, 2004, 14 Pages.
Manetti, et al., “Next Generation CDN services for Community Networks”, In Proceedings of the Third International Conference on Next Generation Mobile Applications, Services and Technologies, Sep. 15, 2009, 6 Pages.
Martin, et al., “CUDA Solutions for the SSSP Problem”, In Proceedings of the 9th International Conference on Computational Science: Part I, Baton Rouge, May 20, 2009, pp. 904-913.
Mavridis, et al., “Friends with Faces: How Social Networks Can Enhance Face Recognition and Vice Versa”, In Proceedings of the Computational Social Networks Analysis: Trends, Tools and Research Advances, Computer Communications and Networks, May 24, 2010, 30 Pages.
Mehra, et al., “An Efficient GPU-Based Time Domain Solver for the Acoustic Wave Equation”, In Proceedings of the Applied Acoustics, vol. 73, Issue 2, Feb. 29, 2012, pp. 83-94.
Mehra, et al., “Wave-Based Sound Propagation in Large Open Scenes Using an Equivalent Source Formulation”, In Journal of ACM transactions on Graphics, vol. 32, Issue 2, Apr. 1, 2013, 13 Pages.
Mehrotra, et al., “Interpolation of Combined Head and Room Impulse Response for Audio Spatialization”, In Proceedings of the IEEE 13th International Workshop on Multimedia Signal Processing, Oct. 17, 2011, pp. 1-6.
Meinedo, et al., “Combination of Acoustic Models in Continuous Speech Recognition Hybrid Systems”, In Proceedings of the Sixth International Conference on Spoken Language Processing, Oct. 1, 2000, 4 Pages.
Meyer, et al., “D-Stepping: A Parallelizable Shortest Path Algorithm”, In Journal of Algorithms, vol. 49, Issue 1, Oct. 1, 2003, pp. 114-152.
Mihalcea, et al., “Wikify!: Linking Documents to Encyclopedic Knowledge”, In Proceedings of the Sixteenth ACM Conference on Information and Knowledge Management, Nov. 6, 2007, 9 Pages.
Militano, et al., “Group Interactions in Wireless Cooperative Networks”, In Proceedings of the IEEE 73rd Conference on Vehicular Technology, May 15, 2011, 5 Pages.
Moghaddam, et al., “Bayesian Face Recognition”, In Journal of Pattern Recognition Society, vol. 33, Issue 11, Nov. 30, 2000, pp. 1771-1782.
Mohamed, et al., “Acoustic Modeling Using Deep Belief Networks”, In Proceedings of the IEEE Transactions on Audio, Speech and Language Processing, vol. 20, Issue 1, Jan. 1, 2012, 10 Pages.
Moreira, et al., “Towards the Rapid Development of a Natural Language Understanding Module”, In Proceedings of the 10th International Conference on Intelligent Virtual Agents, Sep. 15, 2011, 7 Pages.
Mota, Pedro Jose Dos Reis., “LUP: A Language Understanding Platform”, In Dissertation for the Degree of Master of Information Systems and Computer Engineering, Jul. 1, 2012, 128 Pages.
Motlicek, et al., “Feature and Score Level Combination of Subspace Gaussinasin LVCSR Task”, In Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing, May 26, 2013, 5 Pages.
“Office Action Issued in Mexican Patent Application No. MX/a/2016/016291”, dated Sep. 11, 2018, 4 Pages.
Na, et al., “A 2-Poisson Model for Probabilistic Coreference of Named Entities for Improved Text Retrieval”, In Proceedings of the 32nd International ACM SIGIR Conference on Research and Development in Information Retrieval, Jul. 19, 2009, 8 Pages.
Neve, et al., “Face Recognition for Personal Photos using Online Social Network Context and Collaboration”, In Guest Lecture at Korea Advanced Institute of Science and Technology (KAIST), Image and Video Systems Lab, Department of Electrical Engineering, Dec. 14, 2010, 54 Pages.
Tsay, et al., “Personal Photo Organizer based on Automated Annotation Framework”, In Proceedings of the 5th International Conference on Intelligent Information Hiding and Multimedia Signal Processing, Sep. 12, 2009, pp. 507-510.
Tysowski, et al., “Peer to Peer Content Sharing on Ad Hoc Networks of Smartphones”, In Proceedings of 7th International Conference on Wireless Communications and Mobile Computing, Jul. 4, 2011, 6 Pages.
Valimaki, et al., “Fifty Years of Artificial Reverberation”, In Journal of IEEE Transactions on Audio, Speech, and Language Processing, vol. 20, Issue 5, Jul. 5, 2012, 28 Pages.
Vanhoucke, et al., “Improving the Speed of Neural Networks on CPUs”, In Proceedings of the NIPS Workshop on Deep Learning and Unsupervised Feature Learning, vol. 1, Dec. 16, 2011, 8 Pages.
Vorm, Jochem Van Der., “Transform Coding of Audio Impulse Responses”, In Proceedings of the Master's Thesis, Laboratory of Acoustical Imaging and Sound Control, Department of Imaging Science and Technology, Faculty of Applied Sciences, Delft University of Technology, Aug. 1, 2003, 109 Pages.
Wand, et al., “A Real-Time Sound Rendering Algorithm for Complex Scenes”, In Proceedings of the Technical Report WSI-2003-5, ISSN 0946-3852, Jul. 1, 2003, 13 Pages.
Wang, et al., “A Unified Framework for Subspace Face Recognition”, In Proceedings of the IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 26, Issue 9, Sep. 1, 2004, pp. 1222-1228.
Wang, et al., “Bayesian Face Recognition Using Gabor Features”, In Proceedings of the ACM SIGMM Workshop on Biometrics Methods and Applications, Nov. 8, 2003, pp. 70-73.
Wang, et al., “Boosted Multi-Task Learning for Face Verification with Applications to Web Image and Video Search”, In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, Jun. 20, 2009, 8 Pages.
Wang, et al., “Subspace Analysis Using Random Mixture Models”, In Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, Jun. 20, 2005, 7 Pages.
Weinberger, et al., “Distance Metric Learning for Large Margin Nearest Neighbor Classification”, In Proceedings of the Conference on Advances in Neural Information Processing Systems, Dec. 1, 2006, 8 Pages.
Wodecki, et al., “Multi-GPU Parallel Memetic Algorithm for Capacitated Vehicle Routing Problem”, In Proceedings of the 10th International Conference on Parallel Processing and Applied Mathematics, Jan. 21, 2014, pp. 207-214.
Wu, et al., “Adapting Boosting for Information Retrieval Measures”, In Journal of Information Retrieval, vol. 13, Issue 3, Jun. 1, 2010, pp. 254-270.
Wu, et al., “Who's Mary Jane? Understanding Fictional Characters”, In Proceedings of the 23rd International World Nide Web Conference, Apr. 7, 2014, 212 Pages.
Robertson, et al., “Okapi at TREC-3”, In Proceedings of the Text Retrieval Conference, Jan. 24, 2014, 18 Pages.
Rosten, et al., “Real-Time Video Annotations for Augmented Reality”, In Proceedings of the First International Conference on Advances in Visual Computing, Lecture Notes in Computer Science, Dec. 5, 2005, 8 Pages.
Rouillard, Jose, “Contextual QR Codes”, In Proceedings of the Third International Multi-Conference on Computing in the Global Information Technology, Jul. 27, 2008, pp. 50-55.
Sabine, Hale J., “Room Acoustics”, In Proceedings of the Transactions of the IEEE Professional Group on Audio, vol. 1, Issue 4, Jul. 1, 1953, pp. 4-12.
Sainath, et al., “Auto-Encoder Bottleneck Features Using Deep Belief Networks”, In Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing, Mar. 25, 2012, pp. 4153-4156.
Sainath, et al., “Low-Rank Matrix Factorization for Deep Neural Network Training with High-Dimensional Output Targets”, In Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing, May 26, 2013, pp. 6655-6659.
Sainath, et al., “Making Deep Belief Networks Effective for Large Vocabulary Continuous Speech Recognition”, In Proceedings of the IEEE Workshop on Automatic Speech Recognition and Understanding, Dec. 11, 2011, pp. 30-35.
Sakamoto, et al., “Calculation of Impulse Responses and Acoustic Parameters in a Hall by The Finite-Difference Time-Domain Method”, In Proceedings of the Acoustical Science and Technology, vol. 29, Issue 4, Feb. 1, 2008, pp. 256-265.
Saluja, et al., “Context-aware Language Modeling for Conversational Speech Translation”, in Proceedings of the Machine Translation Summit XIII, Sep. 19, 2011, 8 Pages.
Sanders, et al., “Robust, Almost Constant Time Shortest-Path Queries in Road Networks”, In Proceedings of the 9th DIMACS Implementation Challenge: The Shortest Path Problem, Nov. 1, 2006, 19 Pages.
Santos, Jose Luis, “K Shortest Path Algorithms”, In Proceedings of the 9th DIMACS Implementation Challenge: The Shortest Path Problem, Aug. 1, 2006, 13 Pages.
Sarukkai, et al., “Improved Spontaneous Dialogue Recognition Using Dialogue and Utterance Triggers by Adaptive Probability Boosting”, In Proceedings of the Fourth International Conference on Spoken Language, vol. 1, Oct. 3, 1996, 4 Pages.
Sarukkai, et al., “Word Set Probability Boosting for Improved Spontaneous Dialog Recognition”, In Proceedings of be IEEE Transactions on Speech and Audio Processing, vol. 5, Issue 5, Sep. 1, 1997, pp. 438-450.
Sato, et al., “Incentive Mechanism Considering Variety of User Cost in P2P Content Sharing”, In Proceedings of the IEEE Global Telecommunications Conference on Communications and Computer Engineering, Nov. 30, 2008, 5 Pages.
Satoh, et al., “Poster Abstract: Ambient Sound-Based Proximity Detection with Smartphones”, In Proceedings of the 11th ACM Conference on Embedded Networked Sensor Systems, Article No. 58, Nov. 11, 2013, 2 Pages.
Savioja, Lauri, “Real-Time 3D Finite-Difference Time-Domain Simulation of Mid-Frequency Room Acoustics”, In Proceedings of the 13th International Conference on Digital Audio Effects, Sep. 6, 2010, 8 Pages.
Savioja, et al., “Simulation of Room Acoustics with a 3-D Finite Difference Mesh”, In Proceedings of the International Computer Music Conference, Sep. 1, 1994, pp. 463-466.
Sbai, et al., “P2P Content Sharing in Spontaneous Multi-Hop Wireless Networks”, In Proceedings of the Second International Conference of Communication Systems and Networks, Jan. 5, 2010, 10 Pages.
Scarr, et al., “Improving Command Selection with Command Maps”, In Proceedings of the ACM SIGCHI Conference on Human Factors in Computing Systems, May 5, 2012, 10 Pages.
Seide, et al., “Conversational Speech Transcription using Context-Dependent Deep Neural Networks”, In Proceedings of the 12th Annual Conference of the International Speech Communication Association, Aug. 28, 2011, pp. 437-440.
Seneff, et al., “Galaxy-II: A Reference Architecture for Conversational System Development”, In Proceedings of the 5th International Conference on Spoken Language Processing, Nov. 1, 2008, 4 Pages.
Seo, et al., “Face Verification Using the Lark Representation”, In Proceedings of the IEEE Transactions on Information Forensics and Security, vol. 6, Issue 4, Dec. 1, 2011, 12 Pages.
Shan, et al., “Image Based Surface Detail Transfer”, In Proceedings of the IEEE Computer Graphics and Applications, vol. 24, Issue 3, May 1, 2004, 6 Pages.
Shanklin, Will, “Samsung Galaxy S4 to Feature Eye-Tracking Technology”, Retrieved From: http://www.gizmag.com/galaxy-s4-eye-tracking-technology/265031/, Mar. 4, 2013, 5 Pages.
Shen, et al., “Agent-based Traffic Simulation and Traffic Signal Timing Optimization with GPU”, In Proceedings of the 14th International IEEE Conference on Intelligent Transportation Systems, Oct. 5, 2011, pp. 145-150.
Sing, et al., “Domain Metric Knowledge Model for Embodied Conversation Agents”, In Proceedings of the 5th International Conference on Research, Innovation & Vision for the Future, Mar. 5, 2007, 7 Pages.
Singhal, et al., “Pivoted Document Length Normalization”, In Proceedings of the 19th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, Aug. 18, 1996, 12 Pages.
Singh-Miller, et al., “Dimensionality Reduction for Speech Recognition Using Neighborhood Components Analysis”, In Proceedings of the 8th Annual Conference of the International Speech Communication Association, Aug. 27, 2007, 4 Pages.
Siniscalchi, et al., “Hermitian Based Hidden Activation Functions for Adaptation of Hybrid HMM/ANN Models”, In Proceedings of the 13th Annual Conference of the International Speech Communication Association, Sep. 9, 2012, 4 Pages.
So, et al., “Routing and Channel Assignment in Multi-Channel Multi-Hop Wireless Networks with Single-NIC Devices”, In The Technical Report, Department of Computer Science, Department of Electrical and Computer Engineering, Coordinated Science Laboratory, University of Illinois at Urbana-Champaign, Dec. 1, 2004, 12 Pages.
Sommer, Christian, “Shortest-Path Queries in Static Networks”, In Proceedings of the ACM Computing Surveys (CSUR), vol. 46, Issue 4, Article No. 45, Apr. 7, 2014, 35 Pages.
Song, et al., “Centralized Control of Wireless Sensor Networks for Real-time Applications”, In IFAC Proceedings vols. 40, Issue 22, Nov. 7, 2007, 8 Pages.
Song, et al., “Optimal Resource Utilization in Content Distribution Networks”, In Technical Report of Computer Science, Department of Computer Science, Nov. 14, 2005, 14 Pages.
Sparck Jones, et al., “Report on the Need for and Provision of an ‘Ideal’ Information Retrieval Test Collection”, In the University Computer Laboratory Publishers, Dec. 1, 1975, 44 Pages.
Starr, Michelle, “Facial Recognition App Matches Strangers to Online Profiles”, Retrieved From: http://www.cnet.com.au/facial-recognition-app-matches-strangers-to-online-profiles-339346355.htm, Jan. 7, 2014, 10 Pages.
Stettner, et al., “Computer Graphics Visualization for Acoustic Simulation”, In Proceedings of the 16th Annual Conference on Computer Graphics and Interactive Techniques, vol. 23, Issue 3, Jul. 1, 1989, pp. 195-205.
Su, et al., “Error Back Propagation for Sequence Training of Context-Dependent Deep Networks for Conversational Speech Transcription”, In Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing, May 26, 2013, pp. 6664-6668.
Susskind, et al., “Modeling the Joint Density of Two Images Under a Variety of Transformations”, In Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, Jun. 20, 2011, pp. 2793-2800.
Svensson, et al., “The Use of Ambisonics in Describing Room Impulse Responses”, In Proceedings of the International Congress on Acoustics, Apr. 1, 2004, pp. 2481-2483.
Swietojanski, et al., “Revisiting Hybrid and GMM-HMM System Combination Techniques”, In Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing, May 26, 2013, 5 Pages.
Taigman, et al., “Leveraging Billions of Faces to Overcome Performance Barriers in Unconstrained Face Recognition”, In Proceedings of the Computer Vision and Pattern Recognition, Aug. 4, 2011, 7 Pages.
Taigman, et al., “Multiple One-Shots for Utilizing Class Label Information”, In Proceedings of the British Machine Vision Conference (BMVC), Sep. 7, 2009, 12 Pages.
Takala, et al., “Sound Rendering”, In Proceedings of the 19th Annual Conference on Computer Graphics and Interactive Techniques, vol. 26, Issue 2, Jul. 1, 1992, pp. 211-220.
Taylor, et al., “RESound: Interactive Sound Rendering for Dynamic Virtual Environments”, In Proceedings of the 17th ACM International Conference on Multimedia, Oct. 19, 2009, pp. 271-280.
Tellex, et al., “Quantitative Evaluation of Passage Retrieval Algorithms for Question Answering”, In Proceedings of the 26th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, Jul. 28, 2003, 7 Pages.
Thompson, Lonny L., “A Review of Finite-Element Methods for Time-Harmonic Acoustics”, In Journal of Acoustical Society of America, vol. 119, Issue 3, Mar. 1, 2006, pp. 1315-1330.
Thouin, et al., “Video-on-Demand Networks: Design Approaches and Future Challenges”, In Proceedings of the IEEE Network, vol. 21, Issue 2, Mar. 1, 2007, 7 Pages.
Tian, et al., “Chapter 11: Facial Expression Analysis”, In Book—Handbook of Face Recognition, Jan. 1, 2005, pp. 247-275.
Tombros, et al., “Advantages of Query Biased Summaries in Information Retrieval”, In Proceedings of the 21st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, Aug. 1, 1998, 9 Pages.
Trmal, et al., “Adaptation of a Feedforward Artificial Neural Network Using a Linear Transform”, In Proceedings of the Text, Speech and Dialogue, vol. 6231 of the series Lecture Notes in Computer Science, Sep. 10, 2010, 8 Pages.
“Non Final Office Action Issued in U.S. Appl. No. 15/692,494”, dated Jul. 19, 2019, 11 Pages.
“Second Office Action and Search Report Issued in Chinese Application No. 201580028549.4”, dated Jul. 3, 2019, 10 Pages.
“First Office Action Issued in Chinese Patent Application No. 201580018659.2”, dated Dec. 25, 2018, 19 Pages.
“Office Action Issued in Chinese Patent Application No. 201580018659.2”, dated Aug. 23, 2019, 15 Pages.
“Office Action Issued in Chinese Patent Application No. 201580024796.7”, dated Aug. 26, 2019, 18 Pages.
“Office Action Issued in Chinese Patent Application No. 201580032034.1”, dated Aug. 30, 2019, 6 Pages.
“Office Action Issued in Chinese Patent Application No. 201580034192.0”, dated Sep. 2, 2019, 7 Pages.
“Second Office Action Issued in Chinese Patent Application No. 201580029370.0”, dated Sep. 6, 2019, 6 Pages.
“Office Action Issued in European Patent Application No. 15745006.5”, dated Dec. 20, 2019, 4 Pages.
“Office Action Issued in Chinese Patent Application No. 201580018659.2”, dated Dec. 25, 2019, 11 Pages.
“Office Action Issued in European Patent Application No. 15724882.4”, dated Feb. 20, 2020, 6 Pages.
“Office Action Issued in European Patent Application No. 15726780.8”, dated Mar. 5, 2020, 7 Pages.
“Summons to Attend Oral Proceedings Issued in European Patent Application No. 15728297.1”, Mailed Date: Mar. 13, 2020, 8 Pages.
Related Publications (1)
Number Date Country
20180314514 A1 Nov 2018 US
Continuations (1)
Number Date Country
Parent 14294410 Jun 2014 US
Child 16019939 US