c/o Microsoft Corporation Patent applications |
Patent application number | Title | Published |
20140108629 | Network Device Installation - The disclosure relates to a system and method of processing device settings of a device. In a particular embodiment, the method includes requesting the device to provide the device settings. The device settings include wide area network (WAN) and local area network (LAN) network settings. The method further includes storing the device settings in a device independent format. After the device settings have been stored in the device independent format, the device settings may be subsequently retrieved and used for replacement of the network device in a computer network. In a particular embodiment, the device settings are stored in the device independent format in a second device, such as at a server or a personal computer. | 04-17-2014 |
20120246114 | LOCALLY EDITING A REMOTELY STORED IMAGE - One or more techniques and/or systems are disclosed for editing a remotely stored image. A user can browse to a site comprising the image, and a preview (e.g., lightweight) version of the image can be loaded to a canvas component of the browser. One or more edits can be applied locally to the preview image, comprising one or more transformation. The one or more transformations can be recorded, and an edited version of the preview image, comprising the one or more image transformations, can be rendered in the canvas component. Once the user commits to one or more transformations, a request can be sent to a remote server comprising the image, to remotely edit the image, where the request comprises one or more delta changes that indicate the one or more committed image transformations, as opposed to requiring multiple bandwidth intensive transfers of the entire image. | 09-27-2012 |
20120102186 | GOAL STATE COMMUNICATION IN COMPUTER CLUSTERS - Goal state indicators can be communicated from a fabric controller of a computer cluster to each of multiple compute instances in the computer cluster managed by the fabric controller. The goal state indicators can be formatted according to a structured protocol that defines multiple possible goal states. Additionally, status reports can be received from the compute instances. Each of the status reports can indicate a current state of one of the compute instances relative to a goal state previously indicated in a goal state indicator communicated to that one of the compute instances. | 04-26-2012 |
20110224982 | AUTOMATIC SPEECH RECOGNITION BASED UPON INFORMATION RETRIEVAL METHODS - Described is a technology in which information retrieval (IR) techniques are used in a speech recognition (ASR) system. Acoustic units (e.g., phones, syllables, multi-phone units, words and/or phrases) are decoded, and features found from those acoustic units. The features are then used with IR techniques (e.g., TF-IDF based retrieval) to obtain a target output (a word or words). Also described is the use of IR techniques to provide a full large vocabulary continuous speech (LVCSR) recognizer | 09-15-2011 |
20110219028 | AUTOMATIC GENERATION OF VIRTUAL DATABASE SCHEMAS - A data consumer is provided with a system that enables automatic generation of a virtual database schema in order to support a customized pattern of data consumption across one or more source databases. In one embodiment, a metadata manager component is configured to facilitate creation of a first data tag and a second data tag. A schema definition manager component is configured to facilitate creation of a data entity that groups the first data tag with the second data tag. A virtual schema generation service component generates the virtual database schema by analyzing the data entity and, based on the grouping of the first data tag with the second data tag, automatically generating and storing a database query statement that, when executed, causes a retrieval of data consistent with data location indicators included in the first and second data tags. | 09-08-2011 |
20110208714 | LARGE SCALE SEARCH BOT DETECTION - A framework may be used for identifying low-rate search bot traffic within query logs by capturing groups of distributed, coordinated search bots. Search log data may be input to a history-based anomaly detection engine to determine if query-click pairs associated with a query are suspicious in view of historical query-click pairs for the query. Users associated with suspicious query-click pairs may be input to a matrix-based bot detection engine to determine correlations between queries submitted by the users. Those users indicating strong correlations may be categorized as bots, whereas those who do not may be categorized as part of flash crowd traffic. | 08-25-2011 |
20110197059 | SECURING OUT-OF-BAND MESSAGES - Securing an out-of-band message from a server to a mobile computing device. After requesting a service ticket from a trusted third party (e.g., via a pre-existing ticketing infrastructure), the requested service ticket and a shared secret are obtained from the trusted third party via a first channel. The mobile computing device thereafter sends the service ticket with the shared secret to a server via a second channel. The server encrypts a message (e.g., an SMS message) using the shared secret. The mobile computing device receives the encrypted message from the server via a third channel that is out-of-band relative to the first channel. The encrypted message is decrypted via the shared secret and the decrypted message is provided to a user of the mobile computing device. In some embodiments, the message includes commands for controlling the mobile computing device. | 08-11-2011 |
20110173316 | RELATIONSHIP BASED REPRESENTATION OF PARTICIPANTS IN SHARED ONLINE SPACE - One or more techniques and/or systems are disclosed for presenting members of a shared online space to a user of the shared online space. A relationship value is determined between the user and a member of the shared online space by: determining an interaction value for the user and member relationship based on the user's and member's co-presence in the shared online space; determining a social network value for the user and member relationship based on a number of social network connections between the user and member; and combining the interaction value and social network value. The relationship value is associated with a specified visual representation of the member used in the shared online space, and two or more visual representations of members are scaled in the user's display in the shared online space in order to fit an available screen space, based on the relationship value. | 07-14-2011 |
20110126113 | DISPLAYING CONTENT ON MULTIPLE WEB PAGES - Aspects of the subject matter described herein relate to displaying content on multiple pages. In aspects, a request for content is received from a browsing component. The content is divided into pages suitable for displaying on a display associated with the browsing component. Navigation elements may be embedded in the pages to allow a user using the browsing component to navigate between pages corresponding to the content. The actions of dividing the content into multiple pages may occur on a content server, an entity intermediate to the content server and a client hosting the browsing component, or a component of the client. | 05-26-2011 |
20110125732 | INTERNAL RANKING MODEL REPRESENTATION SCHEMA - A markup language schema utilized to represent internal ranking models. In one implementation, the schema developed utilizes XML (extensible markup language) for internal ranking model representation. Other markups languages can be employed. | 05-26-2011 |
20110119210 | Multiple Category Learning for Training Classifiers - Described is multiple category learning to jointly train a plurality of classifiers in an iterative manner. Each training iteration associates an adaptive label with each training example, in which during the iterations, the adaptive label of any example is able to be changed by the subsequent reclassification. In this manner, any mislabeled training example is corrected by the classifiers during training. The training may use a probabilistic multiple category boosting algorithm that maintains probability data provided by the classifiers, or a winner-take-all multiple category boosting algorithm selects the adaptive label based upon the highest probability classification. The multiple category boosting training system may be coupled to a multiple instance learning mechanism to obtain the training examples. The trained classifiers may be used as weak classifiers that provide a label used to select a deep classifier for further classification, e.g., to provide a multi-view object detector. | 05-19-2011 |
20110117389 | FLEXIBLE SIZE AND ORIENTATION BATTERY SYSTEM - A battery receptacle system is provided to accept various types or sizes of batteries in different orientations. The battery receptacle system includes a first radial notch for positioning a first positive terminal of a first battery to electrically connect with the first positive contact at a first position, and a second radial notch for positioning a second positive terminal of a second battery of a different size and/or type than the first battery to electrically connect with the first positive contact at a second position, different from the first position. The second radial notch is configured to prevent the first positive terminal of the first battery from electrically connecting with the first positive contact at the second position. | 05-19-2011 |
20100180269 | DOMAINS WITH POLYMORPHIC TYPE IMPLEMENTATIONS - Various domains may wish to specify different implementations of the type; e.g., a compilation domain may describe the type statically, an execution domain may instantiate objects of the given type, while a debugging execution domain may associate additional debugging information such as a symbol name. This may be achieved by specifying a type implementation of a particular type within respective domains which all implement a common type interface. A type binding instruction set may then select a type implementation for the type within the target instruction set according to the domain, and may bind type instances of the type within target instruction set to the selected type implementation for the current domain. This technique yields domain-specific variance in type implementation without having to reconfigure the target instruction set or perform domain-checking logic there-within. | 07-15-2010 |