| Patent application number | Description | Published |
|---|
| 20090290692 | Unified Messaging Architecture - A system and/or methodology that unifies a telephonic communication component and/or system with a data (e.g., messaging) server component and/or system. The system can facilitate telephonically accessing rich information in the server (e.g., messaging server). This rich information can include email content, calendar content, contacts information, or the like. Moreover, with access to an application programming interface, the invention can add functionality to initiate email communications as well as to accept or cancel meetings. Furthermore, the invention can synchronize messages of disparate formats. By way of example a user can set an “Out of Office” (OOF) status on both an email systems and telephone voicemail system from one location in one action. In another aspect, it will be appreciated that any message or data component can be analyzed, transformed, matched and/or communicated from one system to another (e.g., server to telephone) in accordance with the subject invention. | 11-26-2009 |
| 20110216889 | Selectable State Machine User Interface System - A system that concurrently provides multiple user interface (UI) mechanisms that facilitate control of an application state machine (e.g., unified message system). More particularly, the invention can create two relatively distinct user experiences, one via dual tone multi-frequency (DTMF) navigation and another through speech recognition navigation of a unified message system. In accordance therewith, one single underlying state machine can be used. Navigation and flow control (e.g., state transitions) in the state machine can be leveraged by multiple UI mechanisms that actively co-exist. The invention introduces speech recognition features together with other input mechanisms to drive the UI of an application state machine (e.g., unified messaging system). The speech recognition UI can be designed to provide a natural navigation through the application independent of a DTMF UI. | 09-08-2011 |
| Patent application number | Description | Published |
|---|
| 20080238941 | Adding custom content to mapping applications - Digital maps can be composed of a series of image tiles that are selected based on the context of the map to be presented. Independently hosted tiles can comprise additional details that can be added to the map. A manifest can be created that describes the layers of map details composed of such independently hosted tiles. Externally referable mechanisms can, based on the manifest and map context, select tiles, from among the independently hosted tiles, that correspond to map tiles being displayed to a user. Subsequently, the mechanisms can instruct a browser, as specified in the manifest, to combine the map tiles and the independently hosted tiles to generate a more detailed map. Alternatively, customized mechanisms can generate map detail tiles in real-time, based on an exported map context. Also, controls instantiated by the browser can render three-dimensional images based on the combined map tiles. | 10-02-2008 |
| 20090037441 | TILED PACKAGING OF VECTOR IMAGE DATA - Architecture for encoding (or packaging) vector-object data using fixed boundary tiles. Tiling a large vector database provides the same advantages that tiling provides for a large raster image. Tiling the dataset means that the set of all possible browser requests is finite and predetermined. The tiles can be rasterized on a client once the tiles have been received from a server. Alternatively, the server can do the tiling and rasterizing, and then send the raster data to the client for presentation and user interaction. Tiles can be precomputed on the server, with selected tiles then transmitted to the client for rasterization. Moreover, tiles can be cached for improved performance, and prefetched based on user interactivity on the client. Summarization of the vector-object data can be accomplished at the server using a configurable plug-in interface. | 02-05-2009 |
| 20090210388 | EFFICIENTLY DISCOVERING AND SYNTHESIZING MAPS FROM A LARGE CORPUS OF MAPS - Intent of a user is determined with respect to mapping information. A search is performed for relevant maps from a plurality of disparate sources. A subset of maps from a superset of available maps are identified that correlate to the determined intent, and the subset of maps are fused or synthesized to create a single map view that aggregates and combines relevant content from respective maps of the subset. | 08-20-2009 |
| 20090324134 | SPLITTING FILE TYPES WITHIN PARTITIONED IMAGES - The claimed subject matter provides a system and/or a method that facilitates optimally and efficiently utilizing an image file format. A server can host an image that is partitioned into two or more tiles, wherein the two or more tiles collectively represent the image in entirety and are defined in at least one image file format. A tile generator can evaluate at least one tile to identify a suitable image file format based upon at least one of a characteristic of such file format or a context of a use for the tile. A browser can utilize the tile in the identified file format in order to render a portion of the image. | 12-31-2009 |
| 20100287618 | Executing Native-Code Applications in a Browser - Techniques for leveraging legacy code to deploy native-code desktop applications over a network (e.g., the Web) are described herein. These techniques include executing an application written in native code within a memory region that hardware of a computing device enforces. For instance, page-protection hardware (e.g., a memory management unit) or segmentation hardware may protect this region of memory in which the application executes. The techniques may also provide a narrow system call interface out of this memory region by dynamically enforcing system calls made by the application. Furthermore, these techniques may enable a browser of the computing device to function as an operating system for the native-code application. These techniques thus allow for execution of native-code applications on a browser of a computing device and, hence, over the Web in a resource-efficient manner and without sacrificing security of the computing device. | 11-11-2010 |
| 20100312858 | NETWORK APPLICATION PERFORMANCE ENHANCEMENT USING SPECULATIVE EXECUTION - A speculative web browser engine may enable providing transmission of content between a server and a client prior to a user-initiated request for the content hidden in imperative code (event handlers), which may reduce user-perceived latency when the user initiates the imperative code. In some aspects, a speculative browser state may be created from an actual browser state and used to run the event handlers. The event handlers may be modified to direct actions of the event handler to update the speculative browser state. Speculative content may be transmitted between the server and the client in response to an execution of the modified code. The speculative content may be stored in a cache and made readily available for use when the user initiates the event handler and finds that the desired content has already been fetched. | 12-09-2010 |
| 20100318630 | Leveraging Remote Server Pools for Client Applications - Techniques for enabling client computing devices to leverage remote server pools for increasing the effectiveness of applications stored on the client computing device are described herein. In some instances, the server pools comprise a “cloud”, “cluster” or “data center” that comprises hundreds or thousands of servers connected together by a network that has an extremely low latency and high bandwidth relative to the network through which the client computing device connects to the server pool. The client computing device may request that the server pool perform a certain task for an application whose canonical state resides on the client. After computation of a result of the task, a server of the server pool then provides the result to the client. By doing so, the techniques dramatically increase the amount of resources working on the request of the client and, hence, dramatically increase the speed and effectiveness of the client-side application. | 12-16-2010 |
| 20110154244 | Creating Awareness of Accesses to Privacy-Sensitive Devices - Techniques for providing intuitive feedback to a user regarding which applications have access to a data stream captured by a privacy-sensitive device, such as a camera, a microphone, a location sensor, an accelerometer or the like. These techniques apprise the user of when an application is receiving potentially privacy-sensitive data and the identity of the application receiving the data. In some instances, this feedback comprises a graphical icon that visually represents the data stream being received and that dynamically alters with the received data stream. For instance, if an application receives a data stream from a camera of a computing device of the user, the described techniques may display an image of the video feed captured by the camera and being received by the application. This graphical icon intuitively alerts the user of the data stream that the application receives. | 06-23-2011 |
| 20110258290 | Bandwidth-Proportioned Datacenters - A system including at least one storage node and at least one computation node connected by a switch is described herein. Each storage node has one or more storage units and one or more network interface components, the collective bandwidths of the storage units and the network interface components being proportioned to one another to enable communication to and from other nodes at the collective bandwidth of the storage units. Each computation node has logic configured to make requests of storage nodes, an input/output bus, and one or more network interface components, the bandwidth of the bus and the collective bandwidths of the network interface components being proportioned to one another to enable communication to and from other nodes at the bandwidth of the input/output bus. | 10-20-2011 |
| 20110258297 | Locator Table and Client Library for Datacenters - A system including a plurality of servers, a client, and a metadata server is described herein. The servers each store tracts of data, a plurality of the tracts comprising a byte sequence and being distributed among the plurality of servers. To locate the tracts, the metadata server generates a table that is used by the client to identify servers associated with the tracts, enabling the client to provide requests to the servers. The metadata server also enables recovery in the event of a server failure. Further, the servers construct tables of tract identifiers and locations to use in responding to the client requests. | 10-20-2011 |
| 20110258482 | Memory Management and Recovery for Datacenters - A system including a plurality of servers, a client, and a metadata server is described herein. The servers each store tracts of data, a plurality of the tracts comprising a byte sequence and being distributed among the plurality of servers. To locate the tracts, the metadata server generates a table that is used by the client to identify servers associated with the tracts, enabling the client to provide requests to the servers. The metadata server also enables recovery in the event of a server failure. Further, the servers construct tables of tract identifiers and locations to use in responding to the client requests. | 10-20-2011 |
| Patent application number | Description | Published |
|---|
| 20080313648 | PROTECTION AND COMMUNICATION ABSTRACTIONS FOR WEB BROWSERS - Systems and methodologies for accessing resources associated with a Web-based application in accordance with one or more embodiments disclosed herein may include a browser that obtains at least first resources from a first domain and second resources from a second domain and a resource management component that facilitates controlled communication between the first resources and the second resources and prevents the first resources and the second resources from accessing other resources that the first resources and the second resources are not permitted to access. The resource management component may be further operable to contain restricted services in a sandbox containment structure and/or to isolate access-controlled resources in a service instance. In addition, the resource management component may be operable to facilitate the flexible display of resources from disparate domains and/or controlled communication therebetween. | 12-18-2008 |
| 20090076965 | COUNTERACTING RANDOM GUESS ATTACKS AGAINST HUMAN INTERACTIVE PROOFS WITH TOKEN BUCKETS - A system and method that facilitates and effectuates distinguishing a human from a non-human user. A human interactive proof (HIP) employs a token bucket algorithm in order to reduce the success rate for a non-human user employing a guessing or artificial intelligence to solve a substantial number of HIP challenges. The algorithm can employ token buckets associated with IP address and user session from which the user is attempting to solve the HIP challenge. If a token bucket is empty the algorithm can treat a correct response as incorrect and refill a portion of the buckets for a further attempt. This forces two correct responses to be received by a user within the refill quantity for the users bucket(s) before the user is identified as human. | 03-19-2009 |
| 20090077628 | HUMAN PERFORMANCE IN HUMAN INTERACTIVE PROOFS USING PARTIAL CREDIT - A system and method that facilitates and effectuates distinguishing a human from a non-human user. A human interactive proof (HIP) employs a partial credit algorithm in order to allow a user to make one or more mistakes during consecutive HIP challenges and still be identified as a human. The algorithm assigns a user partial credit based upon getting part of the challenge incorrect. The partial credit is tracked and if during one or more consecutive subsequent challenges the same user gets a portion of the challenge incorrect again, they can still be identified as human. | 03-19-2009 |
| 20090077629 | INTEREST ALIGNED MANUAL IMAGE CATEGORIZATION FOR HUMAN INTERACTIVE PROOFS - A system and method that facilitates and effectuates distinguishing a human from a non-human user. A human interactive proof (HIP) employs images from a large private database of manually categorized images to display as part of a Turing test challenge. The private database contains a sufficient quantity of images, such that the more economical manner to pass the HIP is to employ a human to take the challenge. The owner of the private database makes the database available to the presenter of the HIP due to an alignment of interests between both parties. The HIP is displayed with ads on behalf of the owner of the private database and the presenter of the HIP gains access to a large quantity of private manually categorized images. | 03-19-2009 |
| 20090210526 | DOMAIN NAME CACHE CONTROL - Domain name caching is controlled by adding a nonce to a domain name to force propagation of lookup to an authoritative server or service. Desired caching behavior is dictated by controlling when a new and unique nonce-bearing name is created. For example, caching can be completely eliminated by generating a new nonce-bearing name for every request. While a nonce can simply correspond to a random or pseudo random value, it can also be time based. Furthermore, nonces can be phase or time shifted to limit authoritative server load as well as improve response time. | 08-20-2009 |
| 20090216903 | DEFEATING CACHE RESISTANT DOMAIN NAME SYSTEMS - Domain name caching mechanisms are provided to address cache-defeating approaches. Domain name lookup requests are processed and cached information associated with a non-identical domain name returned in response. Cache-defeating behavior including nonce injection can be detected or inferred and employed to map domain name requests to previously cached information thereby exposing the benefits of caching. | 08-27-2009 |
| 20090232415 | PLATFORM FOR THE PRODUCTION OF SEAMLESS ORTHOGRAPHIC IMAGERY - Systems and methods are provided for the production of seamless, geo-referenced orthographic images that can comprise a composite of two or more underlying images. Illustratively, an exemplary image processing environment comprises an image processing engine and an instruction set comprising at least one instruction to instruct the image processing engine to process data representative of two or more images. Illustratively, the two or more images can comprise data representative of correspondence points between the two or more images and the underlying area (e.g., ground control points). Illustratively, the exemplary image processing engine can identify features that the overlapping photos have in common (e.g., feature match points) and place and re-project (e.g., distort) each of the two or more images to achieve a selected balance of correct position (e.g., based on ground control points) and seamless overlap (e.g., based on feature match points) which can be composited into a single image. | 09-17-2009 |
