Sie sind auf Seite 1von 261

US Patent Application Review Series

Microsoft

April 2010 issue

Provide to you by:

D-Publish
c

All information provided “as is“ for informational purposes only, not intended for research
or development purposes or advice. Neither D-Publish nor its associates are liable for any
informational errors, incompleteness, or delays, or for any actions taken in reliance, direct
or indirect, on information contained herein.

April 2010 USPTO Patent Applications 1


A few words from the editor

A few words from the editor


If I have seen a little further it is by standing on the shoulders of giants.
- Issac Newton

If you want your views to be known, we now open this monthly review to columnists, bloggers
and IP practitioners. Send us an email at info@d-publish.com and lets discuss how we can
work together. We also accept advertorial and advertisement placements.

Structure of this review IPC Catchword Index is an alphabetical sorted list of


catchwords of the IPC appeared in the review.
The Table of Contents is created based on
alphabetical order of IPC. The patent applications
are also sorted by alphabetical order of IPC. A brief How to use this review?
description of each IPC is shown. We find that the IPC
description could help ‘deciphering’ the abstract of an For creativity stimulation purpose:
patent application. If a patent application belongs to • quickly flip the pages and write down the page
multiple IPC, the patent application will only be shown number of the diagrams that interests you for
under the section of first IPC. later review.
For each patent application, the following information
will be shown: • look up the IPC Catchword Index and go to the
IPC that you are interested
1. App. No. – patent application no. – it is unique
to each patent application. For business intelligent purpose:
2. Assignee – this is owner of the patent • quickly flip the pages and identify the IPC that
application. If there is no assignee being could “ring a bell”
specified, either the inventor of the patent
application own the patent application or the • study all patent applications belong to the
owner of the patent application did not record identified IPC.
such information when the patent application
was filed. For engineering design purpose:

3. Title – this is the title of the patent application. • quickly flip the pages and identify the diagrams
that may be similar to your work.
4. Abstract – this is the abstract of the patent
application. There are rules on how an abstract • click on the patent application link and visit the
should be drafted. Most patent attorneys like to US server for more detailed information of the
have the abstract based on the first claim of the patent application.
patent application.
• read the description of IPC carefully.
5. Pri. Date – priority date – it is the date
of filing of the first application of the patent • if you are interested in IPC, compare the patent
application (a patent application could have applications belong to it.
multiple application dates because of divisional
patents as well as overseas patent applications). Copyright
It is considered to be the effective date of filing
for the examination of novelty and inventive Patent applications are free of copyrights unless the
step or non-obviousness for the subsequent inventor specifically stated so in the patent application.
application claiming the priority of the first However, this review is protected by copyright law due
application. to the editing effort we have invested in. We hope you
find this review useful and would recommend your
6. App. Date – application date – it is the date of friend to purchase another review from us. Please
filing of the patent application at the US. do not copy or distribute this review. This would be
a violation of copyright law and reduce the amount of
7. Pub. Date – publishing date – it is the date of the revenue we should earn.
patent application published by US. Usually, it is
about 18 months after the application date. We hope you find this review useful. If you
would like to contact us or have us to develop a
Patent Index is a numerical sorted list the patent customized review, please send us an email at
applications appeared in the review. info@d-publish.com.

April 2010 USPTO Patent Applications 2


Table of Contents

G06F 03/14 - Digital output to display device 37


G06F 07/00 - Methods or arrangements for
processing data by operating upon the
order or content of the data handled . . 38
G06F 07/04 - Identity comparison, i.e. for like
or unlike values . . . . . . . . . . . . . . 42
Table of Contents G06F 07/06 - Arrangements for sorting,
selecting, merging, or comparing data
on individual record carriers . . . . . . . 42
G06F 07/58 - Random or pseudo-random
number generators . . . . . . . . . . . . 51
G06F 09/00 - Arrangements for programme
control, e.g. control unit . . . . . . . . . 51
A few words from the editor 2 G06F 09/318 - with operation extension or
Table of Contents 3 modification . . . . . . . . . . . . . . . . 52
G06F 09/44 - Arrangements for executing
A63 - Card, board, or roulette games 6 specific programmes . . . . . . . . . . . 53
A63F 01/00 - Card games . . . . . . . . . . . 6 G06F 09/445 - Programme loading or initiating 67
A63F 09/24 - Games using electronic circuits G06F 09/45 - Compilation or interpretation of
not otherwise provided for . . . . . . . . 6 high level programme languages . . . . 68
A63F 11/00 - Game accessories of general G06F 09/455 - Emulation . . . . . . . . . . . 71
use . . . . . . . . . . . . . . . . . . . . . 7 G06F 09/46 - Multiprogramming arrangements 71
G06F 09/50 - Allocation of resources, e.g. of
F21 - Functional features or details of lighting the central processing unit (CPU) . . . . 81
devices or systems thereof 8 G06F 09/54 - Interprogramme communication 82
F21V 07/04 - Optical design . . . . . . . . . . 8 G06F 11/00 - Error detection . . . . . . . . . 82
F21V 08/00 - Use of light guides, e.g. fibre G06F 11/07 - Responding to the occurrence
optic devices, in lighting devices or of a fault, e.g. fault tolerance . . . . . . 85
systems . . . . . . . . . . . . . . . . . . 8 G06F 11/20 - using active fault-masking, e.g.
by switching out faulty elements or by
G01 - Measuring distances, levels or bearings 9 switching in spare elements . . . . . . . 87
G01C 21/00 - Navigation . . . . . . . . . . . 9 G06F 11/32 - with visual indication of the
functioning of the machine . . . . . . . . 87
G02 - Optical elements, systems, or apparatus 11 G06F 11/34 - Recording or statistical
G02B 06/10 - of the optical waveguide type . 11 evaluation of computer activity, e.g. of
G02B 06/12 - of the integrated circuit kind . . 12 down time, of input/output operation . . 88
G06F 11/36 - Preventing errors by testing or
G03 - apparatus or arrangements for taking debugging of software . . . . . . . . . . 88
photographs or for projecting or viewing G06F 12/00 - Accessing, addressing or
them 12 allocating within memory systems or
G03B 17/24 - with means for separately architectures . . . . . . . . . . . . . . . 92
producing marks on the film, e.g. title, G06F 12/02 - Addressing or allocation . . . . 99
time of exposure . . . . . . . . . . . . . 12 G06F 12/06 - Addressing a physical block
G03B 21/28 - Reflectors in projection beam . 12 of locations, e.g. base addressing,
G03D 13/00 - Processing apparatus or module addressing, address space
accessories therefor, not covered by extension, memory dedication . . . . . . 101
groups . . . . . . . . . . . . . . . . . . . 12 G06F 12/08 - in hierarchically structured
memory systems, e.g. virtual memory
G06 - Electric digital data processing 12 systems . . . . . . . . . . . . . . . . . . 102
G06F 01/00 - Details not covered by groups G06F 12/10 - Address translation . . . . . . . 104
and . . . . . . . . . . . . . . . . . . . . 12 G06F 12/14 - Protection against
G06F 03/00 - Input arrangements for unauthorised use of memory . . . . . . 104
transferring data to be processed into G06F 12/16 - Protection against loss of
a form capable of being handled by the memory contents . . . . . . . . . . . . . 105
computer . . . . . . . . . . . . . . . . . 13 G06F 13/00 - Interconnection of, or transfer
G06F 03/01 - Input arrangements of information or other signals between,
or combined input and output memories, input/output devices or
arrangements for interaction between central processing units . . . . . . . . . 106
user and computer . . . . . . . . . . . . 19 G06F 13/28 - using burst mode transfer, e.g.
G06F 03/02 - Input arrangements using direct memory access, cycle steal . . . 107
manually operated switches, e.g. using G06F 15/00 - Digital computers in general . . 107
keyboards or dials . . . . . . . . . . . . 20 G06F 15/16 - Combinations of two or more
G06F 03/033 - Pointing devices displaced digital computers each having at least
or positioned by the user, e.g. mice, an arithmetic unit, a programme unit
trackballs, pens or joysticks . . . . . . . 22 and a register, e.g. for a simultaneous
G06F 03/041 - Digitisers, e.g. for touch processing of several programmes . . . 108
screens or touch pads, characterised G06F 15/173 - using an interconnection
by the transducing means . . . . . . . . 22 network, e.g. matrix, shuffle, pyramid,
G06F 03/048 - Interaction techniques star, snowflake . . . . . . . . . . . . . . 124
for graphical user interfaces, e.g. G06F 15/177 - Initialisation or configuration
interaction with windows, icons or menus 24 control . . . . . . . . . . . . . . . . . . . 127

April 2010 USPTO Patent Applications 3


Table of Contents

G06F 15/18 - in which a programme G06Q 90/00 - Systems or methods specially


is changed according to experience adapted for administrative, commercial,
gained by the computer itself during a financial, managerial, supervisory or
complete run . . . . . . . . . . . . . . . 130 forecasting purposes, not involving
G06F 15/82 - data or demand driven . . . . . 131 significant data processing . . . . . . . 205
G06F 17/00 - Digital computing or data G06T 01/00 - General purpose image data
processing equipment or methods, processing . . . . . . . . . . . . . . . . 206
specially adapted for specific functions . 131 G06T 15/00 - Three dimensional (3D) image
G06F 17/10 - Complex mathematical rendering, e.g. from a model to a bit-
operations . . . . . . . . . . . . . . . . . 134 mapped image . . . . . . . . . . . . . . 206
G06F 17/14 - Fourier, Walsh or analogous G06T 15/20 - Perspective computation . . . . 208
domain transformations . . . . . . . . . 134 G06T 15/50 - Lighting effects, e.g. shading . 209
G06F 17/24 - Editing, e.g. insert/delete . . . 135 G06T 15/60 - Shadowing . . . . . . . . . . . 210
G06F 17/27 - Automatic analysis, e.g. G06T 15/70 - Animation effects . . . . . . . . 212
parsing, orthograph correction . . . . . 137 G06T 17/00 - Three dimensional (3D)
G06F 17/28 - Processing or translating of modelling, e.g. data description of 3D
natural language . . . . . . . . . . . . . 138 objects . . . . . . . . . . . . . . . . . . . 212
G06F 17/30 - Information retrieval . . . . . . 139
G06F 19/00 - Digital computing or data G09 - Arrangements or circuits for control of
processing equipment or methods, indicating devices using static means to
specially adapted for specific applications174 present variable information 212
G06F 21/00 - Security arrangements for G09G 05/00 - Control arrangements or
protecting computers or computer circuits for visual indicators common to
systems against unauthorised activity . 178 cathode-ray tube indicators and other
G06F 21/22 - by restricting access to, visual indicators . . . . . . . . . . . . . 212
G09G 05/10 - Intensity circuits . . . . . . . . 214
or manipulation of, programmes or
processes . . . . . . . . . . . . . . . . . 186 G09G 05/36 - characterised by the display of
individual graphic patterns using a bit-
G06K 07/10 - by electromagnetic radiation,
mapped memory . . . . . . . . . . . . . 215
e.g. optical sensing . . . . . . . . . . . . 186
G06K 09/00 - Methods or arrangements for G10 - Speech analysis or synthesis 216
reading or recognising printed or written
characters or for recognising patterns, G10L 13/00 - Speech synthesis . . . . . . . . 216
e.g. fingerprints . . . . . . . . . . . . . . 187 G10L 13/08 - Text analysis or generation of
parameters for speech synthesis out
G06K 09/18 - using printed characters
of text, e.g. grapheme to phoneme
having additional code marks or
translation, prosody generation or
containing code marks, e.g. the
stress or intonation determination . . . . 216
character being composed of individual G10L 15/18 - using natural language modelling217
strokes of different shape, each
representing a different code value . . . 189 G10L 15/26 - Speech to text systems . . . . 217
G06K 09/32 - Aligning or centering of the
G11 - Information storage based on relative
image pick-up or image-field . . . . . . 190
movement between record carrier and
G06K 09/34 - Segmentation of touching or transducer 218
overlapping patterns in the image field . 191 G11B 27/36 - Monitoring, i.e. supervising the
G06K 09/36 - Image preprocessing, i.e. progress of recording or reproducing . . 218
processing the image information
without deciding about the identity of H01 - Electric switches 219
the image . . . . . . . . . . . . . . . . . 192 H01H 13/70 - having a plurality of operating
G06K 09/46 - Extraction of features or members associated with different sets
characteristics of the image . . . . . . . 193 of contacts, e.g. keyboard . . . . . . . . 219
G06K 09/54 - Combinations of
preprocessing functions . . . . . . . . . 194 H02 - Circuit arrangements or systems for
G06K 09/62 - Methods or arrangements for supplying or distributing electric power 220
recognition using electronic means . . . 195 H02J 09/00 - Circuit arrangements for
G06K 09/66 - references adjustable by an emergency or stand-by power supply,
adaptive method, e.g. learning . . . . . 196 e.g. for emergency lighting . . . . . . . 220
G06N 05/00 - Computer systems utilizing
knowledge based models . . . . . . . . 196 H04 - Transmission 221
G06N 05/02 - Knowledge representation . . . 196 H04B 01/18 - Input circuits, e.g. for coupling
to an aerial or a transmission line . . . . 221
G06N 07/02 - using fuzzy logic . . . . . . . . 198 H04B 05/00 - Near-field transmission
G06N 07/04 - Physical realisation . . . . . . . 199 systems, e.g. inductive loop type . . . . 221
G06Q 10/00 - Administration, e.g. office H04L 09/00 - Arrangements for secret or
automation or reservations . . . . . . . 199 secure communication . . . . . . . . . . 222
G06Q 30/00 - Commerce, e.g. marketing, H04L 09/06 - the encryption apparatus
shopping, billing, auctions or e-commerce203 using shift registers or memories for
G06Q 50/00 - Systems or methods specially blockwise coding, e.g. D.E.S. systems . 225
adapted for a specific business sector, H04L 09/08 - Key distribution . . . . . . . . . 227
e.g. health care, utilities, tourism or H04L 09/28 - using particular encryption
legal services . . . . . . . . . . . . . . . 204 algorithm . . . . . . . . . . . . . . . . . 228

April 2010 USPTO Patent Applications 4


Table of Contents

H04L 09/30 - Public key, i.e. encryption H04N 07/12 - Systems in which the television
algorithm being computationally signal is transmitted via one channel
infeasible to invert and users’ or a plurality of parallel channels, the
encryption keys not requiring secrecy . 228 bandwidth of each channel being less
H04L 09/32 - including means for verifying than the bandwidth of the television signal241
the identity or authority of a user of the H04N 07/14 - Systems for two-way working . 241
system . . . . . . . . . . . . . . . . . . . 228 H04N 07/15 - Conference systems . . . . . . 242
H04L 12/26 - Monitoring arrangements . . . 233 H04N 07/16 - Secrecy systems . . . . . . . . 244
H04N 07/173 - with two-way working,
H04L 12/28 - characterised by path e.g. subscriber sending a programme
configuration, e.g. LAN [Local Area selection signal . . . . . . . . . . . . . . 244
Networks] or WAN [Wide Area Networks] 234 H04N 07/26 - using bandwidth reduction . . . 245
H04L 12/56 - Packet switching systems . . . 236 H04N 09/69 - for modifying the colour signals
H04L 12/58 - Message switching systems . . 236 by gamma correction . . . . . . . . . . . 245
H04N 11/02 - with bandwidth reduction . . . 246
H04M 01/00 - Substation equipment, e.g. for H04N 11/04 - using pulse code modulation . 248
use by subscribers . . . . . . . . . . . . 237 H04R 03/00 - Circuits for transducers . . . . 249
H04M 01/64 - Automatic arrangements for H04W 04/00 - Services or facilities specially
answering calls . . . . . . . . . . . . . . 237 adapted for wireless communication
networks . . . . . . . . . . . . . . . . . 249
H04M 01/66 - with means for preventing H04W 04/02 - Services making use of the
unauthorised or fraudulent calling . . . . 237 location of users or terminals . . . . . . 251
H04W 04/12 - Messaging, e.g. SMS [Short
H04M 03/42 - Systems providing special Messaging Service] . . . . . . . . . . . 252
services or facilities to subscribers . . . 238 H04W 64/00 - Locating users or terminals for
H04N 05/225 - Television cameras . . . . . . 239 network management purposes, e.g.
H04N 05/445 - for displaying additional mobility management . . . . . . . . . . 253
information . . . . . . . . . . . . . . . . 240 H04W 72/04 - Wireless resource allocation . 254
H04N 05/93 - Regeneration of the television H04W 74/00 - Wireless channel access, e.g.
signal or of selected parts thereof . . . . 240 scheduled or random access . . . . . . 255
H04N 07/025 - Systems for transmission of Patent Index 257
digital non-picture data, e.g. of text
during the active part of a television frame241 IPC Catchword Index 260

April 2010 USPTO Patent Applications 5


A63F 09/24

A63F 01/00: Card, board, or roulette games Ü Card games


App. No. 20100090403 Assignee MICROSOFT CORPORATION
Title Press-your-luck challenge
Abstract A method of hosting a press-your-luck challenge includes receiving a stake from a player and
iteratively beginning phases of the press-your-luck challenge. Each phase of the press-your-luck
challenge comprises dealing an active subset of game items from a set of game items. If the
active subset of game items is defeated by an immediately previous subset of game items, the
press-your-luck challenge is ended. If the active subset of game items is not defeated by an
immediately previous subset of game items, the player is offered a return equal to a total value of
the active subset of game items. If the player accepts the return, the player is awarded the return
and the press-your-luck challenge ends. If the player declines the return, a subsequent phase of
the press-your-luck challenge is begun.
Pri. Date 20070921 App. Date 20081013 Pub. Date 20100415

A63F 09/24: Card, board, or roulette games Ü Games not otherwise


provided for Ü Games using electronic circuits not otherwise provided
for
App. No. 20100081507 Assignee Microsoft Corporation
Title Adaptation for alternate gaming input devices
Abstract Mechanisms for adjusting signals between gaming controllers and gaming consoles are disclosed.
In an embodiment, the output signals of a mouse control a gaming console which is normally
controlled by an analog thumbstick. The output signals of mouse are adjusted to compensate for
the analog thumbstick controller assist techniques employed by the gaming console. The adjusted
signals are sent to the gaming console. The result is that the user is able to control the game using
the mouse and have the same feel as if the user was using the analog thumbstick controller.
Pri. Date 20080930 App. Date 20090130 Pub. Date 20100401

April 2010 USPTO Patent Applications 6


A63F 11/00

App. No. 20100087257 Assignee MICROSOFT CORPORATION


Title Assisted navigation in virtual environments
Abstract Navigational data may be collected from experienced users and paths may be extracted from the
navigational data. One or more points of interest may be identified in the navigational data and the
points of interests may be merged into an interest region. The navigational data may be reviewed
for interest paths between the interest regions. The collection of possible interest paths may be
reviewed interest paths in view of statistical procedures and criteria to determine if the interest
path is a preferred interest path. If the preferred interest path does not satisfy the predefined
constraints, additional interest paths may be reviewed by substituting an additional interest path
for the interest path and repeating the review the interest path analysis. If the preferred interest
path satisfies predefined criteria, a walkthrough of the virtual world may be generated based on
the preferred interest path.
Pri. Date 20081003 App. Date 20081003 Pub. Date 20100408

App. No. 20100093435 Assignee MICROSOFT CORPORATION


Title Virtual space mapping of a variable activity region
Abstract An electronic game system and a method of its operation are provided for virtual space mapping of
a variable activity region in physical space. A calibration input may be received from a positioning
device of a game controller that indicates waypoints that define an activity region in physical
space. A scale factor may be identified between the activity region and an interactive game region
in virtual space based on the calibration input. Positioning information may be received from the
positioning device that indicates a position of the positioning device within the activity region. The
position of the positioning device within the activity region may be mapped to a corresponding
virtual position within the interactive game region based on the scale factor.
Pri. Date 20081009 App. Date 20081014 Pub. Date 20100415

April 2010 USPTO Patent Applications 7


F21V 08/00

A63F 11/00: Card, board, or roulette games Ü Game accessories of


general use
App. No. 20100105479 Assignee MICROSOFT CORPORATION
Title Determining orientation in an external reference frame
Abstract Orientation in an external reference is determined. An external-frame acceleration for a device
is determined, the external-frame acceleration being in an external reference frame relative
to the device. An internal-frame acceleration for the device is determined, the internal-frame
acceleration being in an internal reference frame relative to the device. An orientation of the device
is determined based on a comparison between a direction of the external-frame acceleration and
a direction of the internal-frame acceleration.
Pri. Date 20081029 App. Date 20081023 Pub. Date 20100429

F21V 07/04: Functional features or details of lighting devices or systems


thereof Ü Reflectors for light sources Ü Optical design
App. No. 20100097820 Assignee Microsoft Corporation
Title Method and apparatus for directing light around an obstacle using an optical waveguide for
uniform lighting of a cylindrical cavity
Abstract A method and apparatus for directing light from a light source along a trajectory to avoid particular
obstacles and provide uniform illumination of a surface having a particular geometry such as
a cylindrical geometry is described. The surface may enclose components such as PCBs that
provide particular functionality that operate as obstacles to a light beam.
Pri. Date 20081022 App. Date 20081017 Pub. Date 20100422

April 2010 USPTO Patent Applications 8


G01C 21/00

F21V 08/00: Functional features or details of lighting devices or systems


thereof Ü Use of light guides, e.g. fibre optic devices, in lighting devices
or systems
App. No. 20100080017 Assignee Microsoft Corporation
Title Uniformly lighting a cylindrical cavity via a prism
Abstract Systems and methods are disclosed for substantially uniformly lighting a substantially cylindrical
cavity using a minimal amount of light sources. The primary technique disclosed utilizes directing
light through a light pipe where is dispersed appropriately. Further, techniques are disclosed for
performing the above functions when the substantially cylindrical cavity is partially filled with an
opaque obstruction.
Pri. Date 20080929 App. Date 20080930 Pub. Date 20100401

G01C 21/00: Measuring distances, levels or bearings Ü Navigation


App. No. 20100082237 Assignee Microsoft Corporation
Title Journal service
Abstract A journal service is described. In embodiment(s), a portable device includes position logic that
can determine spatial data corresponding to a location of the portable device. Temporal data
that corresponds to the spatial data can also be logged. A journal service can determine context
information that is associated with the spatial data and/or the temporal data when the portable
device is or was proximate the location. The journal service can then create a journal event that
is defined by the spatial data, the temporal data, and the context information.
Pri. Date 20090916 App. Date 20080930 Pub. Date 20100401

April 2010 USPTO Patent Applications 9


G01C 21/00

App. No. 20100082397 Assignee MICROSOFT CORPORATION


Title Predictive geo-temporal advertisement targeting
Abstract A method, system, and medium are provided for targeting advertisements to users of mobile
devices based on geo-temporal models. Time-stamped location information is collected for a
mobile device and a dynamic geo-temporal model is constructed and updated when new data
is collected according to a sample design. Using the geo-temporal model, device location
and instances of user interaction with the device can be predicted, and advertisements can be
provided based on the predicted location. Advertisements can be cached on the mobile device
for later presentation, and the sample design can be updated to improve efficiency and accuracy
in the modeling system.
Pri. Date 20080929 App. Date 20080926 Pub. Date 20100401

April 2010 USPTO Patent Applications 10


G02B 06/12

App. No. 20100088026 Assignee MICROSOFT CORPORATION


Title Location-aware selection of public transportation
Abstract A mobile device such as a mobile phone, smart phone, personal music player, handheld game
device and the like that is configured to be location-aware through GPS (Global Positioning
System), cell tower positioning, or other means of determining location, is provided with a public
transportation selector functionality that interfaces with one or more on-line public transportation
schedule services. The public transportation selector passes the location of a user of the
mobile device, the user’s destination, and the targeted arrival time to the schedule services
which responsively return information including, for example, station/stop location information,
route identifier, departure and arrival times, and fare costs. The public transportation selector
aggregates schedule information provided by the services for presentation to the user through a
user interface on the mobile device. The user can then select the desired public transportation
option and be provided with directions to the appropriate station or stop.
Pri. Date 20081007 App. Date 20081002 Pub. Date 20100408

G02B 06/10: Optical elements, systems, or apparatus Ü Light guides Ü


of the optical waveguide type
App. No. 20100091254 Assignee Microsoft Corporation
Title Flat-panel optical projection apparatus with reduced distortion
Abstract A light guide of the tapered-waveguide type includes an input slab (
Pri. Date 20061002 App. Date 20071002 Pub. Date 20100415

April 2010 USPTO Patent Applications 11


G06F 01/00

G02B 06/12: Optical elements, systems, or apparatus Ü Light guides Ü


of the optical waveguide type Ü of the integrated circuit kind
Patent applications also belong to this classification and have been already shown:
20100097820 page 8

G03B 17/24: apparatus or arrangements for taking photographs or for


projecting or viewing them Ü Details of cameras or camera bodies Ü
with means for separately producing marks on the film, e.g. title, time
of exposure
App. No. 20100080551 Assignee MICROSOFT CORPORATION
Title Geotagging photographs using annotations
Abstract Labels of elements in images may be compared to known elements to determine a region from
which an image was created. Using this information, the approximate image position can be
found, additional elements may be recognized, labels may be checked for accuracy and additional
labels may be added.
Pri. Date 20080930 App. Date 20080930 Pub. Date 20100401

G03B 21/28: apparatus or arrangements for taking photographs or for


projecting or viewing them Ü Projectors or projection-type viewers Ü
Details Ü Reflectors in projection beam
Patent applications also belong to this classification and have been already shown:
20100091254 page 11

G03D 13/00: apparatus for processing exposed photographic materials


Ü Processing apparatus or accessories therefor, not covered by groups
Patent applications also belong to this classification and have been already shown:
20100091254 page 11

April 2010 USPTO Patent Applications 12


G06F 03/00

G06F 01/00: Electric digital data processing Ü Details not covered by


groups and
App. No. 20100100716 Assignee MICROSOFT CORPORATION
Title Conserving power using predictive modelling and signaling
Abstract Methods and systems for conserving power using predictive models and signaling are described.
Parameters of a power management policy are set based on predictions based on user activity
and/or signals received from a remote computer which define a user preference. In an
embodiment, the power management policy involves putting the computer into a sleep state and
periodically waking it up. On waking, the computer determines whether to remain awake or to
return to the sleep state dependent upon the output of a predictive model or signals that encode
whether a remote user has requested that computer remain awake. Before returning to the sleep
state, a wake-up timer is set and this timer triggers the computer to subsequently wake-up. The
length of time that the timer is set to may depend on factors such as the request from the remote
user, context sensors and usage data.
Pri. Date 20070925 App. Date 20081022 Pub. Date 20100422

April 2010 USPTO Patent Applications 13


G06F 03/00

G06F 03/00: Electric digital data processing Ü Input arrangements for


transferring data to be processed into a form capable of being handled
by the computer
App. No. 20100082851 Assignee Microsoft Corporation
Title Balancing usage of hardware devices among clients
Abstract Techniques are disclosed for managing the flow of IO jobs from a client to a hardware device such
that resource starvation is reduced without significantly impacting throughput. Each flow can be
assigned an amount of time that a hardware device can deplete completing IO jobs from the client.
When the allocated amount of time is used IO jobs associated with the client can be stored in a
queue until the client obtains more time.
Pri. Date 20080926 App. Date 20080930 Pub. Date 20100401

April 2010 USPTO Patent Applications 14


G06F 03/00

App. No. 20100083192 Assignee Microsoft Corporation


Title Variable screen magnifier user interface
Abstract The magnifier interface system determines a level of user activity with a screen magnifier user
interface and determines a current user interface mode. If the system is currently in the full mode
and the level of user activity indicates user interaction with the screen magnifier user interface
below a threshold, then the system transitions from the full mode to the watermark mode based
on the lack of determined user activity. If the system is currently in the watermark mode and
the level of user activity indicates user interaction with the screen magnifier user interface, then
the system transitions from the watermark mode to the full mode based on the determined user
activity. Thus, the magnifier interface system presents a full user interface that transitions into
a smaller watermark interface when not in use to take up less screen real restate yet remain
available to users.
Pri. Date 20080930 App. Date 20080926 Pub. Date 20100401

April 2010 USPTO Patent Applications 15


G06F 03/00

App. No. 20100083318 Assignee MICROSOFT CORPORATION


Title Determining user-to-user simlarities in an online media environment
Abstract The determination of similarities between users in an online entertainment environment is
disclosed. For example, one disclosed embodiment comprises a method of operating an
entertainment server, wherein the method includes receiving user information that comprises
user demographic information and user media selection information from each user of a plurality
of users. For a current user, a plurality of similarity values are determined that each quantifies a
similarity of the current user to another user based upon similarities between the user information
of the current user and the user information of the other user. Then, the method comprises
determining a list of other users to present to the current user based upon the similarity values
determined, and sending the list of other users to the current user.
Pri. Date 20080922 App. Date 20080930 Pub. Date 20100401

App. No. 20100088431 Assignee MICROSOFT CORPORATION


Title Configuration space virtualization
Abstract Various aspects are disclosed herein for bounding the behavior of a non-privileged virtual machine
that interacts with a device by creating a description of the device which indicates to a privileged
authority (1) which operations on the device may have system-wide effects and (2) which
operations have effects local to the device. The privileged authority may then permit or deny
these actions. The privileged authority may also translate these actions into other actions with
benign consequences.
Pri. Date 20071106 App. Date 20081003 Pub. Date 20100408

April 2010 USPTO Patent Applications 16


G06F 03/00

App. No. 20100088727 Assignee MICROSOFT CORPORATION


Title Computational recommendation engine
Abstract A computational recommendation engine is described. In embodiment(s), identifiers of ranked
programs can be distributed to television client devices, and then a viewing vector from each
of the television client devices can be received where the viewing vectors indicate which of the
ranked programs have been displayed for viewing at different ones of the television client devices.
A client devices group can be created that includes a subset of the television client devices based
on the viewing vectors that are received from respective ones of the television client devices.
A ranked program can be determined that has not been displayed for viewing by some of the
television client devices in the client devices group, and a recommendation of the ranked program
can be communicated to the television client devices in the client devices group that have not had
the ranked program displayed for viewing.
Pri. Date 20081007 App. Date 20081002 Pub. Date 20100408

App. No. 20100095310 Assignee MICROSOFT CORPORATION


Title Virtualized storage assignment method
Abstract Various aspects are disclosed for building a device driver stack in a virtual machine partition that
does not physically control the device represented by the stack. In an embodiment, a secondary
interface and driver for an I/O device may be instantiated. Information from an I/O virtualization
layer describing the devices that the associated driver may control may be requested. A multi-path
redirection layer may provide a handle to an existing stack that includes a driver for the I/O device.
This existing stack may then be used to communicate with the device and allow the creation of a
new stack including an object representing the device and a new driver for the device. The multi-
path redirection layer may then open a handle to the new stack and inform the device virtualization
layer, which may then ask the existing device interface to relinquish control of the device to the
newly created interface.
Pri. Date 20081010 App. Date 20081009 Pub. Date 20100415

April 2010 USPTO Patent Applications 17


G06F 03/01

April 2010 USPTO Patent Applications 18


G06F 03/02

G06F 03/01: Electric digital data processing Ü Input arrangements for


transferring data to be processed into a form capable of being handled
by the computer Ü Input arrangements or combined input and output
arrangements for interaction between user and computer
App. No. 20100088602 Assignee MICROSOFT CORPORATION
Title Multi-application control
Abstract Multi-application control is described. In embodiment(s), multiple media applications can be
processed to generate a media content output from each of the media applications. The media
content outputs from the media applications can be displayed together on a display device. A
control input can be received to initiate a change to one or more of the media content outputs that
are displayed on the display device, and a determination is made as to which of the media content
outputs to change when receiving the control input.
Pri. Date 20080725 App. Date 20081003 Pub. Date 20100408

App. No. 20100095224 Assignee MICROSOFT CORPORATION


Title Method and computer-readable medium for navigating between attachments to electronic mail
messages
Abstract A method and computer-readable medium are provided for navigation between attachments to
electronic mail messages. According to the method, a list of e-mail messages is displayed
that includes header information associated with each of the messages. When one of the
messages in the list is selected, a determination is made as to whether the selected message
has attachments. If the selected message has attachments, an identifier is displayed adjacent
to the header information for each attachment. The identifier indicates that the attachment is
associated with the selected message and may provide other information such as the type and
size of the attachment. The identifiers are displayed in a manner to indicate clearly to a user
that the attachments are associated with the selected e-mail message. The identifiers may be
selected to preview the corresponding attachment.
Pri. Date 20081010 App. Date 20091216 Pub. Date 20100415

April 2010 USPTO Patent Applications 19


G06F 03/02

G06F 03/02: Electric digital data processing Ü Input arrangements for


transferring data to be processed into a form capable of being handled
by the computer Ü Input arrangements or combined input and output
arrangements for interaction between user and computer Ü Input arrangements
using manually operated switches, e.g. using keyboards or dials
App. No. 20100079369 Assignee Microsoft Corporation
Title Using physical objects in conjunction with an interactive surface
Abstract An interaction management module (IMM) is described for allowing users to engage an interactive
surface in a collaborative environment using various input devices, such as keyboard-type
devices and mouse-type devices. The IMM displays digital objects on the interactive surface
that are associated with the devices in various ways. The digital objects can include input
display interfaces, cursors, soft-key input mechanisms, and so on. Further, the IMM provides
a mechanism for establishing a frame of reference for governing the placement of each cursor
on the interactive surface. Further, the IMM provides a mechanism for allowing users to make
a digital copy of a physical article placed on the interactive surface. The IMM also provides a
mechanism which duplicates actions taken on the digital copy with respect to the physical article,
and vice versa.
Pri. Date 20030812 App. Date 20080930 Pub. Date 20100401

April 2010 USPTO Patent Applications 20


G06F 03/02

App. No. 20100081476 Assignee MICROSOFT CORPORATION


Title Glow touch feedback for virtual input devices
Abstract The claimed subject matter is directed to providing feedback in a touch screen device in response
to an actuation of a virtual unit in a virtual input device. Specifically, the claimed subject matter
provides a method and system for providing visual feedback in response to an actuation of a
virtual key in a virtual keyboard. One embodiment of the claimed subject matter is implemented
as a method for providing luminescent feedback in response to an actuation of a virtual key in
a virtual keyboard. User input in a virtual keyboard corresponding to a virtual key is received.
The corresponding virtual key is actuated and registered in response to the user input, and a
luminescent feedback is displayed to the user as confirmation of the actuation of the virtual key.
Pri. Date 20080930 App. Date 20080929 Pub. Date 20100401

April 2010 USPTO Patent Applications 21


G06F 03/041

G06F 03/033: Electric digital data processing Ü Input arrangements for


transferring data to be processed into a form capable of being handled
by the computer Ü Input arrangements or combined input and output
arrangements for interaction between user and computer Ü Arrangements
for converting the position or the displacement of a member into a
coded form Ü Pointing devices displaced or positioned by the user,
e.g. mice, trackballs, pens or joysticks
Patent applications also belong to this classification and have been already shown:
20100079369 page 20

April 2010 USPTO Patent Applications 22


G06F 03/041

G06F 03/041: Electric digital data processing Ü Input arrangements for


transferring data to be processed into a form capable of being handled
by the computer Ü Input arrangements or combined input and output
arrangements for interaction between user and computer Ü Arrangements
for converting the position or the displacement of a member into a
coded form Ü Digitisers, e.g. for touch screens or touch pads, characterised
by the transducing means
App. No. 20100103117 Assignee MICROSOFT CORPORATION
Title Multi-touch manipulation of application objects
Abstract The manipulation system described herein provides a common platform and application-
programming interface (API) for applications to communicate with various multi-touch hardware
devices, and facilitates the interpretation of multi-touch input as one or more manipulations.
Manipulations map more directly to user intentions than do individual touch inputs and add
support for basic transformation of objects using multiple touch contacts. An application can
use manipulations to support rotating, resizing, and translating multiple objects at the same time.
The manipulation system outputs two-dimensional (2D) affine transforms that contain rotation,
scale, and translation information. Thus, using the manipulation system the application author
can focus more on building touch-capable applications and let the manipulation system handle
the underlying transformations and communication with the multi-touch hardware.
Pri. Date 20080422 App. Date 20081026 Pub. Date 20100429

App. No. 20100103118 Assignee MICROSOFT CORPORATION


Title Multi-touch object inertia simulation
Abstract The inertia system provides a common platform and application-programming interface (API) for
applications to extend the input received from various multi-touch hardware devices to simulate
real-world behavior of application objects. To move naturally, application objects should exhibit
physical characteristics such as elasticity and deceleration. When a user lifts all contacts from an
object, the inertia system provides additional manipulation events to the application so that the
application can handle the events as if the user was still moving the object with touch. The inertia
system generates the events based on a simulation of the behavior of the objects. If the user
moves an object into another object, the inertia system simulates the boundary characteristics
of the objects. Thus, the inertia system provides more realistic movement for application objects
manipulated using multi-touch hardware and the API provides a consistent feel to manipulations
across applications.
Pri. Date 20080422 App. Date 20081026 Pub. Date 20100429

April 2010 USPTO Patent Applications 23


G06F 03/048

G06F 03/048: Electric digital data processing Ü Input arrangements for


transferring data to be processed into a form capable of being handled
by the computer Ü Input arrangements or combined input and output
arrangements for interaction between user and computer Ü Interaction
techniques for graphical user interfaces, e.g. interaction with windows,
icons or menus
App. No. 20100082662 Assignee Microsoft Corporation
Title Information retrieval system user interface
Abstract A user interface for an information retrieval system is described. In an embodiment an output
region for showing retrieved documents is displayed on an interactive surface. One or more
movable user interface items, such as digital buttons or tangible objects, may be positioned in
an active region. Each movable user interface item has a stored query associated with it and
for example, the queries may be words or images. In an embodiment a user interface controller
apparatus identifies any movable user interface items in the active region and identifies a spatial
relationship between those items and the output region. In an embodiment, a query is accessed
for each of the user interface items in the active region and those queries and the information
about the spatial relationship are used to retrieve documents from a document database.
Pri. Date 20080930 App. Date 20080925 Pub. Date 20100401

April 2010 USPTO Patent Applications 24


G06F 03/048

App. No. 20100083111 Assignee MICROSOFT CORPORATION


Title Manipulation of objects on multi-touch user interface
Abstract Embodiments related to the manipulation of objects on a multi-touch graphical user interface
are disclosed. For example, in one disclosed embodiment, a method of operating a multi-touch
graphical user interface on a computing device comprises displaying a group of objects on the
graphical user interface in a group representation, receiving a first multi-touch input in which a
first number of touches associated with the group representation are moved on the graphical
user interface, and in response to the first multi-touch input, changing a scale of the objects in the
group representation. The method further comprises receiving a second multi-touch input in which
a second number of touches associated with the group representation are moved on the graphical
user interface, and in response to the second multi-touch input, changing an organization of the
objects in the group representation on the graphical user interface.
Pri. Date 20080930 App. Date 20081001 Pub. Date 20100401

April 2010 USPTO Patent Applications 25


G06F 03/048

App. No. 20100083155 Assignee MICROSOFT CORPORATION


Title Object search ui and dragging object results
Abstract A unique object navigation system, user interface, and method that facilitate faster and smoother
navigation of objects are provided. For example, the system can generate a plurality of objects that
can be rendered on a display space that spans a single page in length, thereby mitigating the need
to navigate through multiple pages. The system can determine the length of the page according to
the number of objects generated. To view off-screen objects, an infinite scroll component can be
employed. The amount of scroll space needed to view the plurality of objects can be determined
in part by the length of the page and/or by the number of objects. The objects can also be viewed
in a film strip format that is infinitely scrollable. The film strip view allows a view of the objects to
be maintained while also viewing a selected object in greater detail at the same time.
Pri. Date 20080930 App. Date 20091203 Pub. Date 20100401

App. No. 20100083165 Assignee MICROSOFT CORPORATION


Title Panoramic graphical user interface
Abstract A panoramic graphical user interface includes a contiguous background and a collection of mixed-
media content objects. The contiguous background includes one or more space-orientating
graphical elements and is sized to fit within a first dimension of a display and to extend beyond
a second dimension of the display. The collection of mixed-media content objects are anchored
over the contiguous background. The collection of mixed-media content objects are arranged to
fit within the first dimension of the display and arranged to extend beyond the second dimension
of the display
Pri. Date 20080926 App. Date 20080929 Pub. Date 20100401

April 2010 USPTO Patent Applications 26


G06F 03/048

App. No. 20100083170 Assignee Microsoft Corporation


Title Advertising-driven theme preview and selection
Abstract An advertisement is associated with an advertiser-sponsored theme. An application generates
a page that includes the advertisement. If a first user input event is detected with respect to
the advertisement, the advertiser-sponsored theme is temporarily applied to the page, thereby
providing a preview of the advertiser-sponsored theme. If a second user input event is detected
with respect to the advertisement, the preview of the advertiser-sponsored theme is removed from
the page. If a third user input event is detected with respect to the advertisement, the advertiser-
sponsored theme is selected for use with the application. A notification may also be provided to
other users indicated that the advertiser-sponsored theme was selected for use.
Pri. Date 20080924 App. Date 20080930 Pub. Date 20100401

App. No. 20100083186 Assignee Microsoft Corporation


Title Magnifier panning interface for natural input devices
Abstract A magnifier movement system is described herein that provides a more user-friendly experience
for users of natural input devices when moving the magnifier and interacting with magnified user
interface elements. The system receives an indication that a user has touched the screen with
a natural input device at a particular location. The system displays a drag control for moving the
magnifier, but does not move the magnifier unless the user selects the drag control and moves the
natural input device. If the drag control is unselected and the system receives additional natural
input, then the system passes the input on to the magnified application. Thus, the magnifier
movement system provides a more satisfying user experience for users of natural input-based
computer systems and screen magnifiers.
Pri. Date 20080930 App. Date 20080926 Pub. Date 20100401

April 2010 USPTO Patent Applications 27


G06F 03/048

App. No. 20100088630 Assignee MICROSOFT CORPORATION


Title Content aware adaptive display
Abstract Content aware adaptive display is described. In embodiment(s), a media image can be displayed
on an integrated display of a media device. The media device can detect that a display device is
proximate the media device, determine a display orientation for the media image at the display
device, and communicate the media image to the display device that then displays the media
image in the determined display orientation.
Pri. Date 20070406 App. Date 20081007 Pub. Date 20100408

App. No. 20100088647 Assignee Microsoft Corporation


Title User interface for viewing clusters of images
Abstract A method and system for providing a user interface for presenting images of clusters of an image
search result is provided. The user interface system displays the search result in a cluster/view
form using a cluster panel and a view panel. The cluster panel contains a cluster area for each
cluster. The view panel may contain thumbnails of images of the search result in a list view or a
mix view. When a user selects a cluster area from the cluster panel, the user interface system
displays a list view of thumbnails for that cluster in the view panel. The user interface system
may display a thumbnail list near a cluster area of the cluster panel. The thumbnail list contains
mini-thumbnails of the images of the selected cluster. The user interface system may also display
a detail view of an image in the view panel when a user selects an image.
Pri. Date 20081007 App. Date 20091209 Pub. Date 20100408

April 2010 USPTO Patent Applications 28


G06F 03/048

App. No. 20100088651 Assignee Microsoft Corporation


Title Merged tree-view ui objects
Abstract Merging user interface (UI) object trees comprising UI trees from different technologies (e.g., host
and one or more guest technologies) can involve registering guest technologies with a technology
adapter layer, for example, used to manage UI tree merging. Further, identifying whether a UI
object can be switched from a first technology to a second technology can comprise using a host
technology provider to identify if a UI object can be switched, when navigating down the UI tree.
When navigating up the UI tree, information stored by the technology adapter layer can be used
to identify if a UI object can be switched. Additionally, identifying the second technology can
comprise having the technology adapter layer request technology switching capability information
from registered technologies for the UI object when navigating down the UI tree. When navigating
up the UI tree, information stored by the technology adapter layer can be used to identify the
second technology. Also, converting the UI object from the first technology to the second
technology in the UI tree can be performed using a COM-based conversion.
Pri. Date 20070331 App. Date 20081007 Pub. Date 20100408

April 2010 USPTO Patent Applications 29


G06F 03/048

App. No. 20100094915 Assignee MICROSOFT CORPORATION


Title Quick-creating objects in an application
Abstract A palette of representations that can be generated by an application for database, spreadsheet,
word processing, and the like, is provided in response to a request for a new object within the
application. If the application already has one or more objects open at the time of the request, the
representations are also determined based on the context of the data such as from any currently
open object(s). The new object is then generated based on the selected representation from the
palette, the context of the data, and a structure of data consumed by the application. The layout
parameters for the new object are automatically set based on the current context, the structure of
the data, and the selected representation.
Pri. Date 20050304 App. Date 20091217 Pub. Date 20100415

April 2010 USPTO Patent Applications 30


G06F 03/048

App. No. 20100100831 Assignee MICROSOFT CORPORATION


Title Suppressing unwanted ui experiences
Abstract Methods to allow, suppress, or reformulate a presentation of a UI element invoked by a computer
program are provided. One method includes applying an administrator-configurable heuristic
to determine whether to allow a native presentation of the UI element, to suppress the native
presentation of the UI element, or to enable a reformulated presentation of the UI element.
The method further includes one or more of suppressing and reformulating the UI element in
accordance with a determination of the heuristic.
Pri. Date 20070802 App. Date 20081017 Pub. Date 20100422

App. No. 20100100838 Assignee MICROSOFT CORPORATION


Title System and method for formatting a cell in response to data stored in a separate location
Abstract A data cell included in a document supporting cell structured data is conditionally formatted
according to data that is stored in a separate location from the document. A user is allowed to
select from a drop-down menu of related data sets a particular data set for conditionally formatting
the data cell. The data cell is formatted according to the data set and the condition without
requiring that the data set be stored locally in the document.
Pri. Date 20061025 App. Date 20091130 Pub. Date 20100422

April 2010 USPTO Patent Applications 31


G06F 03/048

App. No. 20100107095 Assignee MICROSOFT CORPORATION


Title Template-based calculator application
Abstract Methods, systems, and media are provided for using a calculator application to calculate answer
values by evaluating formulas based on user input. The calculator application is hosted by an
operating system and includes a template store containing templates that define user interface
elements such as input fields associated with variables. The templates also have embodied
therein formulae that define relationships between the variables. A user-interface, generated from
information in a template, is provided to a user that includes input fields for receiving values to
be associated with variables. Answer values are calculated by evaluating the formulae based on
user input.
Pri. Date 20070131 App. Date 20081024 Pub. Date 20100429

April 2010 USPTO Patent Applications 32


G06F 03/048

App. No. 20100107101 Assignee MICROSOFT CORPORATION


Title In-document floating object re-ordering
Abstract Techniques are disclosed herein for re-ordering floating objects in an electronic document. An
electronic document having floating objects is displayed in a first mode. Each floating object has
an x-y location in the document and has a position on a z-order stack. In the first mode the floating
objects are displayed in an x-y plane based on the z-order stack. Then, the electronic document
is displayed in a second mode in which the electronic document is depicted as x-y plane slices.
Each x-y plane slice corresponds to one position on the z-order stack. The x-y plane slices are
displayed in particular order to depict the position of the floating objects on the z-order stack. A
re-ordering of the x-y plane slices is displayed based on a request. Then, the electronic document
is displayed in the first mode again based on the re-ordering of the x-y planes.
Pri. Date 20081023 App. Date 20081024 Pub. Date 20100429

April 2010 USPTO Patent Applications 33


G06F 03/048

App. No. 20100107104 Assignee MICROSOFT CORPORATION


Title Display of predicted storage state of target computing device during media file synchronization
Abstract A system and method for synchronizing media files stored on a plurality of computing devices.
The system includes a source computing device configured to execute a synchronization engine
configured to synchronize media files on the source computing device with copies of the media
files on a target computing device. The synchronization engine may be configured to display a
file synchronization interface including a synchronization control having a plurality of media file
selectors configured to receive user input of a selected set of the media files for synchronization.
The system further may include a prediction module configured to compute a predicted storage
state of the target computing device based on an available storage capacity of the target
computing device and an estimated destination file size of each of the selected set of media
files, and display the predicted storage state on a graphical predicted storage state gauge.
Pri. Date 20081023 App. Date 20081021 Pub. Date 20100429

App. No. 20100107115 Assignee MICROSOFT CORPORATION


Title Child window surfacing and management
Abstract Tabs or other display elements that do not comply with traditional x201c;windowx201d;
requirements can be individually presented to a user when the window containing such tabs or
other display elements is hidden or obscured. The user can be enabled to perform tab-specific
actions, such as closing a particular tab, or viewing a specific tab without interacting with the
containing window. Executing processes utilizing such tabs can register them and provide order
and display information. Subsequent tab-specific actions can be received and directed to such
executing processes. Additional requests, such as for thumbnails and bitmaps, can be directed to
such executing processes in order to implement the tab presentation mechanisms and to provide
for the tab-specific actions.
Pri. Date 20070227 App. Date 20081027 Pub. Date 20100429

April 2010 USPTO Patent Applications 34


G06F 03/048

App. No. 20100107120 Assignee Microsoft Corporation


Title Painting user controls
Abstract The described implementations relate to dynamically painting user-controls. One method
dynamically determines a highlight color of a user-control under a cursor on a graphical user-
interface. The method also paints at least a portion of the user-control with the highlight color.
Pri. Date 20070227 App. Date 20081027 Pub. Date 20100429

App. No. 20100107123 Assignee MICROSOFT CORPORATION


Title Surfacing and management of window-specific controls
Abstract The functionality traditionally provided by an application program through a window presented as
part of a window-based user interface can be accessed while the window remains hidden. A
toolbar, or similar collection of user interface elements, can be presented when a user indicates
an intention to interact with an application program whose window is hidden. The toolbar can
comprise elements associated with functions specific to the hidden window. The user’s selection
can be communicated to the application program so that it can perform the requested function. If
the user no longer indicates an intention to interact with the application program, the toolbar can
be removed. In one embodiment, the toolbar can be presented together with a thumbnail of the
relevant window in a floating display element.
Pri. Date 20081024 App. Date 20081027 Pub. Date 20100429

April 2010 USPTO Patent Applications 35


G06F 03/048

App. No. 20100107125 Assignee Microsoft Corporation


Title Light box for organizing digital images
Abstract A processing device and a machine-implemented method may be provided for assisting users
of photographic applications to organize large numbers of digital images. A light box may be a
conceptual workspace having a number of digital images positioned on a surface thereof. A user
may select one of a number of light boxes and a portion of a surface of the selected one of the
light boxes may be displayed along with a navigation panel. The navigation panel may provide an
indication of where the displayed portion of the surface of the selected one of the light boxes is
located with respect to a complete surface of the light box. Digital images may be automatically
grouped or manually grouped. A filtering capability may be provided to filter digital images on a
surface of a light box based on one or more specified criteria.
Pri. Date 20081024 App. Date 20081024 Pub. Date 20100429

April 2010 USPTO Patent Applications 36


G06F 03/14

G06F 03/14: Electric digital data processing Ü Input arrangements for


transferring data to be processed into a form capable of being handled
by the computer Ü Digital output to display device
App. No. 20100088582 Assignee Microsoft Corporation
Title Talking paper authoring tools
Abstract A range of unified software authoring tools for creating a talking paper application for integration
in an end user platform are described herein. The authoring tools are easy to use and are
interoperable to provide an easy and cost-effective method of creating a talking paper application.
The authoring tools provide a framework for creating audio content and image content and
interactively linking the audio content and the image content. The authoring tools also provide
for verifying the interactively linked audio and image content, reviewing the audio content, the
image content and the interactive linking on a display device. Finally, the authoring tools provide
for saving the audio content, the video content and the interactive linking for publication to a
manufacturer for integration in an end user platform or talking paper platform.
Pri. Date 20080109 App. Date 20081008 Pub. Date 20100408

April 2010 USPTO Patent Applications 37


G06F 07/00

App. No. 20100107128 Assignee MICROSOFT CORPORATION


Title Displaying available content via a screen saver
Abstract In a device, multiple content descriptions are obtained. Each of the content descriptions identifies
content that is available to the device, such as video on demand (VOD) programs, previously
recorded programs, live programs, applications that can be run, and so forth. A screen saver is
generated to concurrently display each of the multiple content descriptions as at least part of a
screen saver for the device.
Pri. Date 20081023 App. Date 20081027 Pub. Date 20100429

G06F 07/00: Electric digital data processing Ü Methods or arrangements


for processing data by operating upon the order or content of the data
handled
App. No. 20100088267 Assignee MICROSOFT CORPORATION
Title Graphical model for data validation
Abstract Data may be received from the source and based on training; a confidence level may be
determined that a specific element in the data is correctly assigned to a master category given
that the source assigned the data to one of the plurality of assigned source categories. If the
confidence level meets a threshold, the element may be stored in the assigned master category
and if the confidence level does not meet a threshold, the element may be stored for reassignment.
Pri. Date 20050929 App. Date 20081002 Pub. Date 20100408

April 2010 USPTO Patent Applications 38


G06F 07/00

App. No. 20100094900 Assignee Microsoft Corporation


Title Content package for electronic distribution
Abstract Defining a content package having media files and table of contents (TOC) data. The content
package includes physical representation data and logical representation data for the media files
(e.g., stored in the TOC data). Computing devices store, download, and play back the media
files based on the data in the content package. Presentations (e.g., collections of files) within
the content package are available for extraction based on a configuration of a media player. The
media files are provided for presentation to a user of the computing device, or for storage by the
computing device.
Pri. Date 20050216 App. Date 20090609 Pub. Date 20100415

App. No. 20100106732 Assignee Microsoft Corporation


Title Identifying visually similar objects
Abstract Methods, systems, and computer-readable media for finding similarities between visual objects
using keywords and computerized visual image analysis are provided. A visual object may be
provided as an input. A group of visual objects sharing keywords with the visual object may be
generated for further analysis. The visual similarity of this group of visual objects may then be
determined using computerized visual analysis. A group of visual objects that have the highest
similarity rank, as determined by the computerized visual analysis, may then be displayed.
Pri. Date 20070430 App. Date 20081029 Pub. Date 20100429

April 2010 USPTO Patent Applications 39


G06F 07/00

App. No. 20100106744 Assignee MICROSOFT CORPORATION


Title Conflict prevention for peer-to-peer replication
Abstract Aspects of the subject matter described herein relate to conflict prevention. In aspects, a peer that
seeks to modify a data structure first determines whether it is the owner of the data structure. An
owner of the data structure has rights to update the data structure. If the peer is not the owner, the
peer sends a request to the owner. The owner responds to the request by changing ownership
of the data structure to the peer. Once this change is replicated to the peer, the peer is able to
update the data structure as desired.
Pri. Date 20081029 App. Date 20081023 Pub. Date 20100429

App. No. 20100106754 Assignee Microsoft Corporation


Title Hardware and operating system support for persistent memory on a memory bus
Abstract Implementations of a file system that is supported by a non-volatile memory that is directly
connected to a memory bus, and placed side by side with a dynamic random access memory
(DRAM), are described.
Pri. Date 20081024 App. Date 20090616 Pub. Date 20100429

April 2010 USPTO Patent Applications 40


G06F 07/04

App. No. 20100106756 Assignee MICROSOFT CORPORATION


Title Random number generation failure detection and entropy estimation
Abstract In accordance with one or more aspects, an initial output string is generated by a random number
generator. The initial output string is sent to a random number service, and an indication of
failure is received from the random number service if the initial output string is the same as a
previous initial output string received by the random number service. Operation of the device is
ceased in response to the indication of failure. Additionally, entropy estimates for hash values of
an entropy source can be generated by an entropy estimation service based on hash values of
various entropy source values received by the entropy estimation service. The hash values can
be incorporated into an entropy pool of the device, and the entropy estimate of the pool being
updated based on the estimated entropy of the entropy source.
Pri. Date 20081024 App. Date 20081027 Pub. Date 20100429

April 2010 USPTO Patent Applications 41


G06F 07/06

G06F 07/04: Electric digital data processing Ü Methods or arrangements


for processing data by operating upon the order or content of the data
handled Ü Comparing digital values Ü Identity comparison, i.e. for like
or unlike values
App. No. 20100088753 Assignee MICROSOFT CORPORATION
Title Identity and authentication system using aliases
Abstract An identity and authentication platform utilizes a data model that enables multiple identities such
as e-mail addresses, mobile phone numbers, nicknames, gaming IDs, and other user IDs to
be utilized as aliases which are unique sub-identities of a main account name. A user may
utilize the aliases supported by the platform to project multiple different on-line identities while
using the authentication credentials of the main account. The platform is configured to expose
the aliases to various client applications and Internet-accessible sites and services such as e-
mail, instant messaging, media sharing, gaming and social networks, and the like, to enable the
implementation of a variety of usage scenarios that employ aliases.
Pri. Date 20081002 App. Date 20081003 Pub. Date 20100408

April 2010 USPTO Patent Applications 42


G06F 07/06

G06F 07/06: Electric digital data processing Ü Methods or arrangements


for processing data by operating upon the order or content of the data
handled Ü Arrangements for sorting, selecting, merging, or comparing
data on individual record carriers
App. No. 20100082510 Assignee MICROSOFT CORPORATION
Title Training a search result ranker with automatically-generated samples
Abstract A search result ranker may be trained with automatically-generated samples. In an example
embodiment, user interests are inferred from user interactions with search results for a particular
query so as to determine respective relevance scores associated with respective query-identifier
pairs of the search results. Query-identifier-relevance score triplets are formulated from the
respective relevance scores associated with the respective query-identifier pairs. The query-
identifier-relevance score triplets are submitted as training samples to a search result ranker. The
search result ranker is trained as a learning machine with multiple training samples of the query-
identifier-relevance score triplets.
Pri. Date 20080926 App. Date 20081001 Pub. Date 20100401

App. No. 20100082511 Assignee Microsoft Corporation


Title Joint ranking model for multilingual web search
Abstract Described is a technology in which a classifier is built to rank documents of different languages
found in a query based at least in part on similarity to other documents and the relevance of those
other documents to the query. A joint ranking model, e.g., based upon a Boltzmann machine, is
used to represent the content similarity among documents, and to help determine joint relevance
probability for a set of documents. The relevant documents of one language are thus leveraged to
improve the relevance estimation for documents of different languages. In one aspect, a hidden
layer of units (neurons) represents clusters (corresponding to relevant topics) among the retrieved
documents, with an output layer representing the relevant documents and their features, and
edges representing a relationship between clusters and documents.
Pri. Date 20080926 App. Date 20080930 Pub. Date 20100401

April 2010 USPTO Patent Applications 43


G06F 07/06

App. No. 20100082577 Assignee Microsoft Corporation


Title Multidimensional data space queries with expression evaluation
Abstract A system and techniques for executing queries of a sparse multidimensional data space in the
presence of expressions. A dimension is associated with a set of data references, which reference
stored data items. A query expression has dimension or a data reference as an operand. A result
space with one or more result dimensions is defined based on the query. A plan is built and
executed for retrieving the stored data items associated with the result dimensions, and forming
x201c;calculated data itemsx201d; by evaluating the expression. Executing the plan produces
a stream of data tuples, each having a set of data components storing the retrieved data items
and/or the calculated data items. Data components are either empty or have data values. An
iterative algorithm is employed on the stream to locate the data tuples that are empty at the
intersection of each result dimension.
Pri. Date 20080925 App. Date 20080926 Pub. Date 20100401

App. No. 20100082614 Assignee Microsoft Corporation


Title Bayesian video search reranking
Abstract A general framework for video search reranking is disclosed which explicitly formulates reranking
into a global optimization problem from the Bayesian perspective. Under this framework, with two
novel pair-wise ranking distances, two effective video search reranking methods, hinge reranking
and preference strength reranking, are disclosed. Experiments conducted on the TRECVID
dataset have demonstrated that the disclosed methods outperform several existing reranking
approaches.
Pri. Date 20080922 App. Date 20080922 Pub. Date 20100401

April 2010 USPTO Patent Applications 44


G06F 07/06

App. No. 20100082661 Assignee MICROSOFT CORPORATION


Title Linking search queries to rich media themes
Abstract Methods, systems and computer-readable media for providing a rich media themed search results
webpage are provided. A search query entered by a user into an internet search engine is
analyzed based on one or both of the search query terms and user data communicated to a theme
configuration module to determine an appropriate rich media theme. A rich media theme is then
selected and combined with a search results display, returned by the search engine, to compose
a search results webpage. The rich media theme content is displayed in an ambient manner such
that the search results display remains visible to the user. The rich media theme content provides,
among other things, relevant images, videos, audio, advertisements, and interactive features that
enhance the value of the search results webpage.
Pri. Date 20080930 App. Date 20080923 Pub. Date 20100401

April 2010 USPTO Patent Applications 45


G06F 07/06

App. No. 20100082683 Assignee MICROSOFT CORPORATION


Title Visitor-assisted user profile creation
Abstract A visitor to a profile page is invited to modify a user profile associated with the profile page. If the
visitor elects to provide a suggested modification to the profile page, a message is transmitted
to the user that owns the profile page requesting authorization to perform the suggested
modification. In response to the message, the user can accept the suggested modification to
the user profile, decline the suggested modification to the user profile, or edit the suggested
modification to the user profile. If the user accepts or edits the suggested modification to the user
profile, the user profile is modified accordingly. In this manner, a visitor to a profile page can assist
in the creation of a user profile.
Pri. Date 20080930 App. Date 20080926 Pub. Date 20100401

App. No. 20100082703 Assignee Microsoft Corporation


Title Octree construction on graphics processing units
Abstract An octree GPU construction system and method for constructing a complete octree data structure
on a graphics processing unit (GPU). Embodiments of the octree GPU construction system and
method first defines a complete octree data structure as forming a complete partition of the 3-
D space and including a vertex, edge, face, and node arrays, and neighborhood information.
Embodiments of the octree GPU construction system and method input a point cloud and
construct a node array. Next, neighboring nodes are computed for each of the nodes in the
node arrays by using at least two pre-computed look-up tables (such as a parent look-up table
and a child look-up table). Embodiments of the octree GPU construction system and method then
use the neighboring nodes and neighborhood information to compute a vertex array, edge array,
and face array are computed by determining owner information and self-ownership information
based on the neighboring nodes.
Pri. Date 20080925 App. Date 20080929 Pub. Date 20100401

April 2010 USPTO Patent Applications 46


G06F 07/06

App. No. 20100088295 Assignee MICROSOFT CORPORATION


Title Co-location visual pattern mining for near-duplicate image retrieval
Abstract Described is a technology in which image near-duplicate retrieval is performed using similarities
between patterns of query image words and patterns of database image words. In general,
the image retrieval problems resulting from visual polysemy are reduced by using such visual
patterns. Visual word vectors and visual pattern vectors are determined for the query image and
a database image. These four vectors are used to determine similarity between the database
image and the query image. The similarity scores may be used for ranking and/or re-ranking the
database image similarity to the query image relative to other database images’ similarity scores.
Also described is expanding a query visual word of the query image to a set of visual words that
are visual synonyms with the query visual word, to help reduce image retrieval problems resulting
from visual synonymy.
Pri. Date 20081003 App. Date 20081003 Pub. Date 20100408

April 2010 USPTO Patent Applications 47


G06F 07/06

App. No. 20100088300 Assignee Microsoft Corporation


Title Resource tracking
Abstract Clients may subscribe to resources for the purpose of receiving notifications of changes in the
resource (e.g., a file is added to a shared folder). Storing subscriptions within persistent storage
provides data security in the event of a service failure, at the cost of high latency in accessing
subscription data. An efficient method for tracking a resource is provided herein. A subscription
service creates subscriptions and monitors resources for a client. Upon a subscribed resource
change, a notification service stores a notification of the change into a queue associated with
the client. Efficient resource tracking is achieved because notification and subscription data is
stored in low latency soft memory. The notification service is configured to detect a failure in the
notification service and/or subscription service. In the event a service fails, the client provides a
recovery mechanism by resubscribing to resources the client is interested in.
Pri. Date 20081003 App. Date 20081006 Pub. Date 20100408

App. No. 20100094831 Assignee MICROSOFT CORPORATION


Title Named entity resolution using multiple text sources
Abstract An arrangement for resolving ambiguity among named entities in web based text documents
is provided in which multiple documents are utilized that are of different genres and will thus
typically use different degrees of precision when referring to named entities. When an ambiguous
named entity is located in a document, any links contained in that document are followed to other
documents. If a linked document includes a named entity that is fully specified (i.e., includes both
a first and last name), then this information can be used to resolve the ambiguity of the named
entity in the original document.
Pri. Date 20080917 App. Date 20081014 Pub. Date 20100415

April 2010 USPTO Patent Applications 48


G06F 07/06

App. No. 20100106571 Assignee MICROSOFT CORPORATION


Title Smart, search-enabled web error pages
Abstract Embodiments of our technology provide a method, system, and media for presenting relevant
information incident to attempting to present information that is unavailable by way of a website.
One embodiment of the method includes receiving a request to present a desired web page,
determining that the desired web page is unavailable for presentation, determining search criteria
associated with the request, dynamically generating a second web page that includes search
results that were obtained based on the search criteria, and presenting the second web page on
a display device.
Pri. Date 20081028 App. Date 20081023 Pub. Date 20100429

April 2010 USPTO Patent Applications 49


G06F 07/06

App. No. 20100106678 Assignee Microsoft Corporation


Title Monitoring agent programs in a distributed computing platform
Abstract Methods, systems, and computer-readable media for monitoring information passed from
instances of role(s) of a service application installed on a distributed computing platform and
for indexing and analyzing the information within a data store are provided. Monitoring involves a
monitoring agent that is integrated within an operating system of computing devices that make up
the distributed computing platform. In operation, the monitoring agent retrieves information from
the role instances and converts the information into parameters that are assembled to documents.
Generally, the parameters are assembled to a uniform-structured format in accordance with a
schema imposed by the distributed computing platform. Accordingly, each of the documents
across the platform have a common format that promotes processing and analysis without a
need for reconfiguration. Accordingly, the health of the service application, although dispersed
throughout the distributed computing environment, may be observed and evaluated in a consistent
manner.
Pri. Date 20081114 App. Date 20081024 Pub. Date 20100429

April 2010 USPTO Patent Applications 50


G06F 09/00

App. No. 20100106734 Assignee MICROSOFT CORPORATION


Title Blob manipulation in an integrated structured storage system
Abstract Embodiments of the present invention relate to systems, methods and computer storage media for
facilitating the structured storage of binary large objects (Blobs) to be accessed by an application
program being executed by a computing device. Generally, the manipulation of Blobs in a
structured storage system includes receiving a request for a Blob, which may be located by way of
a Blob pointer. The Blob pointer allows for the data, such as properties, of the Blob to be identified
and located. Expired properties are garbage collected as a manipulation of the Blob data within a
structured storage system. In an embodiment, the Blob is identified by a key that is utilized within
a primary structured index to located the requested Blob. In another embodiment, the requested
Blob is located utilizing a secondary hash index. In an additional embodiment, the Blob is locate
utilizing a file table.
Pri. Date 20070430 App. Date 20081024 Pub. Date 20100429

G06F 07/58: Electric digital data processing Ü Methods or arrangements


for processing data by operating upon the order or content of the data
handled Ü Random or pseudo-random number generators
Patent applications also belong to this classification and have been already shown:
20100106756 page 41

April 2010 USPTO Patent Applications 51


G06F 09/318

G06F 09/00: Electric digital data processing Ü Arrangements for programme


control, e.g. control unit
App. No. 20100083254 Assignee MICROSOFT CORPORATION
Title Flexible and scalable operating system achieving a fast boot and reliable operation
Abstract Systems and methods are provided for a flexible and scalable operating system achieving a fast
boot. A computing system is described that includes a reserved static object memory configured
to store predefined static threads, and a secure kernel configured to be executed in a fast boot
mode. The secure kernel further may be configured to chain the static threads to a secure kernel
thread queue stored in a secure kernel work memory, and to create temporary threads in the
secure kernel work memory during the fast boot mode. The computing system may include a
main kernel configured to be initialized by creating dynamic threads in a main kernel work memory
during the fast boot mode. The main kernel may be configured to chain the static threads to a
main kernel thread queue, and to assume control of the static threads from the secure kernel.
Pri. Date 20080930 App. Date 20081001 Pub. Date 20100401

G06F 09/318: Electric digital data processing Ü Arrangements for programme


control, e.g. control unit Ü using stored programme, i.e. using internal
store of processing equipment to receive and retain programme Ü Arrangements
for executing machine- instructions, e.g. instruction decode Ü with
operation extension or modification
App. No. 20100088495 Assignee Microsoft Corporation
Title Mode-specific container runtime attachment
Abstract The operation of a multi-mode application. The multi-mode application has a number of mode-
specific logical containers of components. Each mode-specific container contains components
that assist the multi-mode application in operating in a corresponding mode. If the application
transitions to another mode, the component(s) of the other corresponding mode-specific logical
container is used to assist in operating in the other mode. The logical containers may be activated
and deactivated during execution time as the application transitions from mode to mode.
Pri. Date 20081003 App. Date 20081014 Pub. Date 20100408

April 2010 USPTO Patent Applications 52


G06F 09/44

G06F 09/44: Electric digital data processing Ü Arrangements for programme


control, e.g. control unit Ü using stored programme, i.e. using internal
store of processing equipment to receive and retain programme Ü Arrangements
for executing specific programmes
App. No. 20100083210 Assignee Microsoft Corporation
Title Hardware abstraction in embedded systems
Abstract A system and a machine-implemented method are provided. The system may include a
platform, in which one or more application domains may be specified. At least some of the
application domains may abstract a hardware device. Partitioning of the system into a number
of independent applications with fixed public interfaces may provide each application domain with
isolation, or protection, from other application domains. Application domains may be specified via
programming language constructs. An application, within one application domain, may access a
hardware device, or software, in another application domain via similar generic interfaces provided
in a managed code environment enforced by the platform.
Pri. Date 20080930 App. Date 20080926 Pub. Date 20100401

April 2010 USPTO Patent Applications 53


G06F 09/44

App. No. 20100083219 Assignee Microsoft Corporation


Title Runtime object composition
Abstract Objects in computing environments are often instantiated based on a class definition that is
statically declared at design time, but such instantiation limits the flexibility of the objects so
created. Objects may also be composed at runtime through a series of invocations of a reflection
programming interface, but reflection techniques may be computationally expensive, and the
generation of many objects at runtime based on a single object definition may redundantly invoke
the reflection programming interface. As provided herein, when requested to generate a new
object at runtime based on an object definition, the host environment may instead automatically
generate a factory method (via reflection) using the object definition, and may invoke the factory
method to compose the object. The factory method may also be cached with the object definition
to facilitate the composing of additional objects based on the same object definition, thereby
economizing computing resources and improving system performance.
Pri. Date 20080926 App. Date 20081001 Pub. Date 20100401

App. No. 20100083230 Assignee Microsoft Corporation


Title Data feature tracking through hierarchical node sets
Abstract A data set may be represented as a hierarchical node set, comprising interrelated nodes
that respectively include various data features (e.g., versions in a version-controlled software
architecture.) Queries may be formulated regarding the inclusion of a particular feature in the
nodes of the hierarchical data set (x201c;does this node include this data feature?x201d; and
x201c;what is the path of the data feature through the node set?x201d;). Such queries may
be evaluated by identifying a source node that includes the data feature, identifying candidate
merge paths from the source node to the taget node, and determining whether the nodes of any
candidate merge path include the data feature. The results may be presented to the user, e.g.,
as a visual layout of the portion of the hierarchical node set that includes the data feature or a
timeline of nodes illustrating the path of the data feature over time.
Pri. Date 20060426 App. Date 20080926 Pub. Date 20100401

April 2010 USPTO Patent Applications 54


G06F 09/44

App. No. 20100083233 Assignee Microsoft Corporation


Title Symbolic runtime checking of quantified contracts
Abstract An extension of symbolic execution for programs involving contracts with quantifiers over large
and potentially unbounded domains is described. Symbolic execution is used to generate, from a
program, concrete test cases that exhibit mismatches between the program code and its contracts
with quantifiers. Quantifiers are instantiated using symbolic values encountered during a set of
exhibited runs. In this setting, quantifier instantiation is limited to values supplied to or produced
by a symbolic execution. Quantifier instantiation is controlled by performing a matching algorithm
that uses run-time values of input and program variables in order to guide and limit the set of
quantifier instantiations. With a sufficient set of instances, test cases are derived that directly
witness limitations of the auxiliary assertions.
Pri. Date 20060426 App. Date 20080926 Pub. Date 20100401

April 2010 USPTO Patent Applications 55


G06F 09/44

App. No. 20100088665 Assignee MICROSOFT CORPORATION


Title Tree-based directed graph programming structures for a declarative programming language
Abstract Embodiments of tree-based directed graph programming structures for a declarative programming
language are provided. In various embodiments, complex graph structured data, referred to as
x201c;DGraphsx201d; herein in one non-limiting implementation, is authored using a compact,
human friendly syntax without the use of explicit identifiers. In one non-limiting aspect, the syntax
includes support for conformance relationships, also referred to as factored relationships. In
another non-limiting aspect, the semistructured graph data is a tree-based representation and the
syntax includes lexical resolution of references or lexical scoping, and/or non local initialization.
Pri. Date 20070625 App. Date 20081003 Pub. Date 20100408

April 2010 USPTO Patent Applications 56


G06F 09/44

App. No. 20100088666 Assignee Microsoft Corporation


Title Common intermediate representation for data scripting language
Abstract A common intermediate representation for a data scripting language is provided for efficient
representation and direct specification of programming constructs in memory. The common
intermediate representation of data scripts allows data intensive applications to be created
and analyzed in a machine accessible format, and the elements of the common intermediate
representation can be stored independent of underlying storage specifics. Stored elements of the
common intermediate representation of code are thus available for fast loading in memory when
desired by other applications and programs by mapping the stored elements to the in memory
intermediate representation.
Pri. Date 20070625 App. Date 20081003 Pub. Date 20100408

April 2010 USPTO Patent Applications 57


G06F 09/44

App. No. 20100088669 Assignee Microsoft Corporation


Title Logical extensions to intermediate code
Abstract An assembly aggregate comprising a virtual, logical view of an arbitrarily defined collection of
intermediate code and metadata can be authored, factored, accessed, modified, and distributed.
Multiple physical containers of assembly information can be aggregated to create a single logical
assembly called an assembly aggregate. An assembly can thus be redefined as a logical view
against (or projection over) the assembly aggregate. Such an assembly can be targeted to the
requester that is, an assembly can be redefined according to tool and/or execution context rather
than conforming to explicit or implicit requirements enforced by the runtime.
Pri. Date 20081003 App. Date 20081008 Pub. Date 20100408

April 2010 USPTO Patent Applications 58


G06F 09/44

App. No. 20100088672 Assignee MICROSOFT CORPORATION


Title Compact syntax for data scripting language
Abstract The subject disclosure relates to a syntax for a scripting language that allows data intensive
applications to be written in a compact, human friendly, textual format. The scripting language
can be a declarative programming language, such as the x201c;Dx201d; programming language,
which is well suited to the authoring of data intensive programs. A compact query syntax is
provided for D that simplifies the expression of complex and data intensive programs. In another
non-limiting aspect, conventional operator precedence is modified to accommodate the compact
syntax and other unique features of a general purpose declarative programming language.
Pri. Date 20081003 App. Date 20081003 Pub. Date 20100408

April 2010 USPTO Patent Applications 59


G06F 09/44

App. No. 20100088674 Assignee MICROSOFT CORPORATION


Title System and method for recognizing structure in text
Abstract A method, system, and computer product for processing information embedded in a text file
with a grammar programming language is provided. A text file is parsed according to a set of
rules and candidate textual shapes corresponding to potential interpretations of the text file are
provided by compiling a script. An output is provided, which may include either a processed value
corresponding to a particular textual shape, or a textual representation of the text file that includes
generic data structures that facilitate providing any of the candidate textual shapes, where the
generic data structures are a function of the set of rules.
Pri. Date 20081003 App. Date 20090331 Pub. Date 20100408

App. No. 20100088677 Assignee MICROSOFT CORPORATION


Title Test case management controller web access
Abstract Described is a technology in which test case content in the form of a web application is provided to
a client browser from a test case management system over a web server. Results of running the
test case are similarly communicated back. This allows different web application test harnesses
to be run on whatever Internet browser the client computing device is running, and is independent
of any operating system. The client registers with the test case management system through
the website, and receives a browser identifier for use in future communications. In one protocol,
the client uses the identifier in heartbeats sent to the test case management system, including a
heartbeat indicating when the client is available to run a test case, when the test case is complete,
and the results of performing the test case. Also described are various interfaces that facilitate
component communication.
Pri. Date 20081003 App. Date 20081003 Pub. Date 20100408

April 2010 USPTO Patent Applications 60


G06F 09/44

App. No. 20100088679 Assignee MICROSOFT CORPORATION


Title Bidirectional type checking for declarative data scripting language
Abstract An efficient, logical and expressive type system supports the combination of refinement types
and type membership expressions, as well as a top type that encompasses all valid values
as members. A bidirectional type checking algorithm is provided for the type system including
synthesis and checking steps to statically verify types of code based on the type system.
Pri. Date 20081003 App. Date 20081003 Pub. Date 20100408

April 2010 USPTO Patent Applications 61


G06F 09/44

App. No. 20100088685 Assignee MICROSOFT CORPORATION


Title System and method for mapping a domain modeling language to a relational store
Abstract A method and system for mapping between constructs in a domain modeling language and a
relational storage language is provided. A source code authored in a source language is received
and a set of constructs in the source code are identified. The set of constructs in the source code
are mapped to a set of constructs in a target language. The source code is then compiled into
a target code authored in the target language such that one of the source code or target code
include a declarative constraint-based and/or order-independent execution model.
Pri. Date 20081007 App. Date 20090331 Pub. Date 20100408

April 2010 USPTO Patent Applications 62


G06F 09/44

App. No. 20100088689 Assignee MICROSOFT CORPORATION


Title Branding binary modules using resource patching
Abstract A resource patching tool is configured to enable resources from an external source module to
be added or replaced in a binary module after the module is built as an executable program. A
developer may use the resource patching tool to place different resources into a generic binary
module to easily and efficiently create different branding without having to rebuild the module.
Thus, for example, a single instance of agent.exe can be built that does not have any resources
so that different resources patched into it post-build using the resource patching tool to thereby
create different binary module configurations with the desired branding.
Pri. Date 20081003 App. Date 20081003 Pub. Date 20100408

April 2010 USPTO Patent Applications 63


G06F 09/44

App. No. 20100088690 Assignee MICROSOFT CORPORATION


Title Replacing the identity of an activex control
Abstract A development tool is provided that finds existing ActiveX identification resources in a binary
module, generates new identification resources, and then outputs commands to a resource
patching tool. Execution of the commands will cause the resource patching tool to patch the
newly generated ActiveX identification resources into the binary module to replace the existing
identification resources. This technique allows ActiveX controls to be separately registered and
differentiated. ActiveX controls can thus be efficiently implemented with different branding, for
example, and/or concurrently used without concern that the execution of one will be affect another.
Pri. Date 20081003 App. Date 20081003 Pub. Date 20100408

App. No. 20100088692 Assignee Microsoft Corporation


Title Dynamic, customizable and configurable notification mechanism
Abstract Provided are arrangements for delivering customized application or update notifications
corresponding to a software application so that a user may be informed of the value of the
application or update. In addition, the notifications may be rendered by a configurable notification
mechanism so that the behavior of the notification, i.e., when and how often it is displayed, to
what users and in what conditions, and the like, is also configurable. In this way, users become
more invested in the application or update, are more likely to install the same, and become more
aware of what changes to expect following installation.
Pri. Date 20081003 App. Date 20081003 Pub. Date 20100408

April 2010 USPTO Patent Applications 64


G06F 09/44

App. No. 20100095272 Assignee Microsoft Corporation


Title Declarative programming model for authoring and execution control and data flow for resource
oriented system
Abstract A data set may be managed by a host that provides access to clients through a protocol, such as
a RESTful HTTP interface. A resource script may be expressed according to a script language
featuring two types of instructions data set instructions that correspond to the verbs of the protocol,
and flow control instructions that alter the flow of execution of the resource script. At runtime, an
execution context for the resource script may be selected as a local execution context (through a
local script processor that issues protocol verbs to the host based on the data set operations) or
a remote execution context (by sending the resource script to a script processor located on the
host.) The runtime selection of data context may be executed without having to reconfigure the
resource script, and with an equivalent effect on the data set.
Pri. Date 20081011 App. Date 20081014 Pub. Date 20100415

April 2010 USPTO Patent Applications 65


G06F 09/44

App. No. 20100100868 Assignee Microsoft Corporation


Title Interactive design environments to visually model, debug and execute resource oriented
programs.
Abstract In scenarios involving a data set accessible through a protocol, operations sets may be formulated
for performing various operations on the data set, and may be expressed as resource scripts
according to a scripting language. However, such resource scripts may be difficult to design
due to the complicated aspects of the interaction, such as asynchrony, network transport, the
syntax of the scripting language, and the details of the protocol. A design environment may
be devised to facilitate designers in generating resource scripts, e.g., through the manipulation
of visual elements. The design environment may abstract the lower-level working details of the
resource scripts, and may allow designers to focus on the logical designing of the operations set.
The design environment may then automatically generate the resource script from the operations
set in accordance with the constraints of the script language and the protocol.
Pri. Date 20080417 App. Date 20081017 Pub. Date 20100422

App. No. 20100107142 Assignee MICROSOFT CORPORATION


Title Scalability analysis for server systems
Abstract Described is predicting cache locality in a multicore/multithreaded processing environment
including when threads share cache data in a non-uniform interleaving manner. Thread execution
traces are analyzed to compute a set of per-thread parameters that can then be used to predict
cache miss rates for other cache sizes. In one aspect, a model is based upon a probability that the
cache reuse distance will increase because of accesses by other threads, and another probability
that the reuse distance will decrease because of intercept accesses by other threads to shared
data blocks. Estimates of the number of shared data blocks, possibly shared data blocks and
private data blocks are used in the computations.
Pri. Date 20081029 App. Date 20081024 Pub. Date 20100429

April 2010 USPTO Patent Applications 66


G06F 09/445

G06F 09/445: Electric digital data processing Ü Arrangements for programme


control, e.g. control unit Ü using stored programme, i.e. using internal
store of processing equipment to receive and retain programme Ü Arrangements
for executing specific programmes Ü Programme loading or initiating
App. No. 20100107015 Assignee MICROSOFT CORPORATION
Title Expressing fault correlation constraints
Abstract Methods, systems, and computer-readable media for expressing fault correlation constrains to
a developer of a service application are provided. Initially, the fault correlation constraints are
identified by inspecting an architecture of resources comprising a data center. Based on the
resources, sets of nodes that become concurrently unavailable due to a failure mode or update
scheme are aggregated. These fault correlation constraints, upon being communicated to the
developer, then may be incorporated into a service model produced thereby. Accordingly, the
service model is tailored to the specific characteristics of the data center and is provided with
instructions as to how to partition instances of the service application throughout the distributed
resources of the data center. Thus, the fault correlation constraints provide a developer with
insight into rules and structures on which the data center is constructed and assurances of a
certain level of fault tolerance upon deploying the service application.
Pri. Date 20081023 App. Date 20081024 Pub. Date 20100429

April 2010 USPTO Patent Applications 67


G06F 09/45

G06F 09/45: Electric digital data processing Ü Arrangements for programme


control, e.g. control unit Ü using stored programme, i.e. using internal
store of processing equipment to receive and retain programme Ü Arrangements
for executing specific programmes Ü Compilation or interpretation of
high level programme languages
App. No. 20100083238 Assignee Microsoft Corporation
Title Binary manipulation of intermediate-language code
Abstract One or more embodiments, described herein, are directed towards a technology for performing
transformations and/or modifications to managed byte code. In order to perform the
transformations and/or modifications, a mutable programmable representation (MPR) is laid out.
A programmer then performs an arbitrary adjustment using the MPR.
Pri. Date 20070514 App. Date 20080930 Pub. Date 20100401

App. No. 20100088684 Assignee Microsoft Corporation


Title Calculating resource bounds of programs manipulating recursive data structures and collections
Abstract Bounding resource consumption of code that processes recursive data structures and collections
includes making use of quantitative functions (based on user input) that are associated with a
tuple of data-structures and whose semantics is specified by describing the effect of various
data-structure methods on the relevant quantitative functions. Counter variables are incorporated
into source code to count loop iterations (and number of recursive procedure call invocations).
Relevant quantitative functions are incorporated into the source code to allow computation of
invariants (and hence bounds) on the incorporated counter variables in terms of the quantitative
functions.
Pri. Date 20081007 App. Date 20081007 Pub. Date 20100408

April 2010 USPTO Patent Applications 68


G06F 09/45

App. No. 20100088686 Assignee Microsoft Corporation


Title Programming language with extensible syntax
Abstract The subject disclosure relates to an extensible syntax for a scripting language that allows data
intensive applications to be written in a compact, human friendly, textual format, and also
according to self-defined syntax within the data intensive applications so that a single compilation
unit of a program can support multiple syntaxes. An extensible syntax is provided for M that allows
alternate syntaxes to be defined in line and then used in the program so as to accommodate
user-defined syntaxes and other pre-existing domain specific languages. In one embodiment, the
alternate syntaxes can be defined at pre-designated functional points in the program.
Pri. Date 20081007 App. Date 20081201 Pub. Date 20100408

April 2010 USPTO Patent Applications 69


G06F 09/45

App. No. 20100095284 Assignee Microsoft Corporation


Title Caching runtime generated code
Abstract A program entity that generates code but that does not perturb global state is identified. Code
produced by the identified program entity can be assigned an identifier and cached the first time
it is executed. Subsequent executions of the program entity can eliminate generation of the code
and/or translation of the generated code into native binary code. The runtime generated code and
native binary code can be cached in a machine-wide cache, or can be added to the metadata of
the assembly generated from the source code of the program entity.
Pri. Date 20061017 App. Date 20081015 Pub. Date 20100415

April 2010 USPTO Patent Applications 70


G06F 09/46

Patent applications also belong to this classification and have been already shown:
20100088674 page 60 20100088679 page 61 20100088685 page 62

G06F 09/455: Electric digital data processing Ü Arrangements for programme


control, e.g. control unit Ü using stored programme, i.e. using internal
store of processing equipment to receive and retain programme Ü Arrangements
for executing specific programmes Ü Emulation
Patent applications also belong to this classification and have been already shown:
20100082851 page 14

G06F 09/46: Electric digital data processing Ü Arrangements for programme


control, e.g. control unit Ü using stored programme, i.e. using internal
store of processing equipment to receive and retain programme Ü Multiprogram
arrangements
App. No. 20100083255 Assignee MICROSOFT CORPORATION
Title Notification batching based on user state
Abstract Batching messages such as notifications intended for a user to preserve battery life on a
computing device associated with the user. A server such as a proxy server receives the
messages from one or more service providers. The proxy server maintains a state of the user.
If the state indicates that the user is idle, the messages are stored at the proxy server unless
the messages correspond to activating messages. The activating messages are sent to the user
upon receipt. The stored messages are sent when the state changes to an active state or when a
defined duration of time elapses. In some embodiments, the messages are presence notifications
in an instant messaging session on a mobile computing device. By reducing the frequency of sent
notifications, the battery life of the mobile computing device is preserved.
Pri. Date 20080930 App. Date 20080926 Pub. Date 20100401

April 2010 USPTO Patent Applications 71


G06F 09/46

App. No. 20100083256 Assignee Microsoft Corporation


Title Temporal batching of i/o jobs
Abstract Batching techniques are provided to maximize the throughput of a hardware device based on
the saturation point of the hardware device. A balancer can determine the saturation point of
the hardware device and determine the estimated time cost for IO jobs pending in the hardware
device. A comparison can be made and if the estimated time cost total is lower than the saturation
point one or more IO jobs can be sent to the hardware device.
Pri. Date 20080930 App. Date 20080930 Pub. Date 20100401

April 2010 USPTO Patent Applications 72


G06F 09/46

App. No. 20100083257 Assignee Microsoft Corporation


Title Array object concurrency in stm
Abstract A software transactional memory system is provided that creates an array of transactional locks
for each array object that is accessed by transactions. The system divides the array object into
non-overlapping portions and associates each portion with a different transactional lock. The
system acquires transactional locks for transactions that access corresponding portions of the
array object. By doing so, different portions of the array object can be accessed by different
transactions concurrently. The system may use a shared shadow or undo copy for accesses to
the array object.
Pri. Date 20080930 App. Date 20081001 Pub. Date 20100401

App. No. 20100083258 Assignee Microsoft Corporation


Title Scheduling execution contexts with critical regions
Abstract A scheduler in a process of a computer system detects an execution context that blocked from
outside of the scheduler while in a critical region. The scheduler ensures that the execution
context resumes execution on the processing resource of the scheduler on which the execution
context blocked when the execution context becomes unblocked. The scheduler also prevents
another execution context from entering a critical region on the processing resource prior to the
blocked execution context becoming unblocked and exiting the critical region.
Pri. Date 20080930 App. Date 20080929 Pub. Date 20100401

April 2010 USPTO Patent Applications 73


G06F 09/46

App. No. 20100083261 Assignee MICROSOFT CORPORATION


Title Intelligent context migration for user mode scheduling
Abstract Embodiments for performing directed switches between user mode schedulable (UMS) thread
and primary threads are disclosed. In accordance with one embodiment, a primary thread user
portion is switched to a UMS thread user portion so that the UMS thread user portion is executed
in user mode via the primary thread user portion. The primary thread is then transferred into
kernel mode via an implicit switch. A kernel portion of the UMS thread is then executed in kernel
mode using the context information of a primary thread kernel portion.
Pri. Date 20080930 App. Date 20080930 Pub. Date 20100401

April 2010 USPTO Patent Applications 74


G06F 09/46

App. No. 20100083275 Assignee MICROSOFT CORPORATION


Title Transparent user mode scheduling on traditional threading systems
Abstract Embodiments for performing cooperative user mode scheduling between user mode schedulable
(UMS) threads and primary threads are disclosed. In accordance with one embodiment, an
asynchronous procedure call (APC) is received on a kernel portion of a user mode schedulable
(UMS) thread. The status of the UMS thread as it is being processed in a multi-processor
environment is determined. Based on the determined status, the APC is processed on the UMS
thread.
Pri. Date 20080926 App. Date 20080930 Pub. Date 20100401

April 2010 USPTO Patent Applications 75


G06F 09/46

App. No. 20100083276 Assignee MICROSOFT CORPORATION


Title On-the-fly replacement of physical hardware with emulation
Abstract Various aspects are disclosed herein for replacing the hardware backing the memory locations
associated with a virtual machine with a backing mechanism. The backing mechanism may have
the memory locations appear to contain data convenient to the driver in the virtual machine,
typically containing what the hardware would have returned if the hardware had been read from.
The data image being returned from the memory locations may travel with the virtual machine
even if the virtual machine moves to a different physical machine that does not contain hardware
equivalent to the hardware that was recently removed from the virtual machine.
Pri. Date 20080926 App. Date 20080930 Pub. Date 20100401

April 2010 USPTO Patent Applications 76


G06F 09/46

App. No. 20100083285 Assignee MICROSOFT CORPORATION


Title Data-tier application component
Abstract Data-tier application components (DACs) and methods for managing database applications are
disclosed. According to one particular embodiment, a DAC includes a single unit of management
that packages metadata related to a database object. The metadata related to the database
object includes an identifier of the database object, a database runtime resource identifier of a
database runtime resource operable to manipulate the database object, and a policy related to
execution of the database runtime resource.
Pri. Date 20080930 App. Date 20080926 Pub. Date 20100401

April 2010 USPTO Patent Applications 77


G06F 09/46

App. No. 20100088702 Assignee MICROSOFT CORPORATION


Title Checking transactional memory implementations
Abstract A transactional memory implementation is tested using an automatically generated test program
and a locking memory model implementation which defines atomicity semantics. Schedules of
the test program specify different interleavings of read operations and write operations of the
test program threads. Executing the schedules under the locking memory model implementation
provides legal final states of the shared variable(s). Executing the schedules under the
transactional memory implementation produces candidate final states of the shared variable(s). If
the candidate final states are also legal final states, then the transactional memory implementation
passes the test.
Pri. Date 20081006 App. Date 20081006 Pub. Date 20100408

App. No. 20100088704 Assignee Microsoft Corporation


Title Meta-scheduler with meta-contexts
Abstract A process in a computer system creates and uses a meta-scheduler with meta-contexts that
execute on meta-virtual processors. The meta-scheduler includes a set of schedulers with
scheduler-contexts that execute on virtual processors. The meta-scheduler schedules the
scheduler-contexts on the meta-contexts and schedules the meta-contexts on the meta-virtual
processors which execute on execution contexts associated with hardware threads.
Pri. Date 20081006 App. Date 20081003 Pub. Date 20100408

April 2010 USPTO Patent Applications 78


G06F 09/46

App. No. 20100100890 Assignee Microsoft Corporation


Title Providing supplemental semantics to a transactional queue manager
Abstract In one embodiment, a computer system instantiates a queue manager configured to process a
plurality of existing queue manager commands on messages in a message queue. The computer
system instantiates a virtualized instance of a queue manager in a virtual layer associated
with the queue manager in the computing system. The a virtualized queue manager instance
provides supplemental queue manager commands usable in addition to existing queue manager
commands, such that the queue manager can be used to implement the supplemental commands
without substantial modification. The computer system receives an indication that a message in a
message queue is to be accessed according to a specified command provided by the instantiated
virtualized queue manager instance that is not natively supported by the queue manager and the
virtualized queue manager performs the specified supplemental command as indicated by the
received indication by performing one or more existing queue manager commands.
Pri. Date 20080915 App. Date 20081022 Pub. Date 20100422

April 2010 USPTO Patent Applications 79


G06F 09/50

App. No. 20100107177 Assignee Microsoft Corporation


Title Dispatch mechanism for coordinating application and communication medium state
Abstract The present invention extends to methods, systems, and computer program products for
coordinating application state and communication medium state. Embodiments of the invention
provide mechanisms by which a dispatcher can enable application code to coordinate changes
in application state with the consumption of messages from a communication medium. The
coordination can be automatic where the dispatcher performs the coordination, or manual, where
the coordination is performed more expressly by application code. Embodiments also include
mechanisms by which applications targeting an execution (e.g., continuation based) runtime may
compose alternative state transitions in the application with a peek lock protocol.
Pri. Date 20070320 App. Date 20091023 Pub. Date 20100429

April 2010 USPTO Patent Applications 80


G06F 09/50

Patent applications also belong to this classification and have been already shown:
20100083254 page 52 20100095310 page 17

G06F 09/50: Electric digital data processing Ü Arrangements for programme


control, e.g. control unit Ü using stored programme, i.e. using internal
store of processing equipment to receive and retain programme Ü Multiprogram
arrangements Ü Allocation of resources, e.g. of the central processing
unit (CPU)
App. No. 20100083272 Assignee MICROSOFT CORPORATION
Title Managing pools of dynamic resources
Abstract Computer systems attempt to manage resource pools of a dynamic number of similar resources
and work tasks in order to optimize system performance. Work requests are received into the
resource pool having a dynamic number of resources instances. An instance-throughput curve is
determined that relates a number of resource instances in the resource pool to throughput of the
work requests. A slope of a point on the instance-throughput curve is estimated with stochastic
gradient approximation. The number of resource instances for the resource pool is selected when
the estimated slope of the instance-throughput curve is zero.
Pri. Date 20080930 App. Date 20081001 Pub. Date 20100401

App. No. 20100083274 Assignee Microsoft Corporation


Title Hardware throughput saturation detection
Abstract Improved hardware throughput can be achieved when a hardware device is saturated with IO
jobs. Throughput can be estimated based on the quantifiable characteristics of incoming IO jobs.
When IO jobs are received a time cost for each job can be estimated and stored in memory. The
estimates can be used to calculate the total time cost of in-flight IO jobs and a determination can
be made as to whether the hardware device is saturated based on completion times for IO jobs.
Over time the time cost estimates for IO jobs can be revised based on a comparison between the
estimated time cost for an IO job and the actual time cost for the IO job using aggregate IO job
completion sequences.
Pri. Date 20080926 App. Date 20080930 Pub. Date 20100401

April 2010 USPTO Patent Applications 81


G06F 11/00

App. No. 20100100885 Assignee Microsoft Corporation


Title Transaction processing for side-effecting actions in transactional memory
Abstract A processing system includes a transactional memory, first and second resource managers, and
a transaction manager for a concurrent program having a thread including an atomic transaction
having a side-effecting action. The first resource manager is configured to enlist in the atomic
transaction and manage a resource related to the side effecting action. The second resource
manager is configured to enlist in the atomic transaction and manage the transaction memory.
The transaction manager is coupled to the first and second resource managers and manager
is configured to receive a vote from the first and second resource managers as to whether to
commit the transaction. The side-effecting action is postponed until after the transaction commits
or applied along with a compensating action to the side-effecting action.
Pri. Date 20081021 App. Date 20081020 Pub. Date 20100422

G06F 09/54: Electric digital data processing Ü Arrangements for programme


control, e.g. control unit Ü using stored programme, i.e. using internal
store of processing equipment to receive and retain programme Ü Multiprogram
arrangements Ü Interprogramme communication
Patent applications also belong to this classification and have been already shown:
20100107177 page 80

April 2010 USPTO Patent Applications 82


G06F 11/00

G06F 11/00: Electric digital data processing Ü Error detection


App. No. 20100088548 Assignee Microsoft Corporation
Title Using constraint solving to discovering disjunctive and quantified invariants over predicate
abstraction
Abstract Techniques are disclosed for generating complex invariants in a program using a Satisfiability
Modulo Theories (SMT) solver. In one embodiment, the generated invariants may be used to
validate assert statements in a program. Additionally or alternatively, a weakest pre-condition
invariant may be generated such that parameters passed to the program that satisfy the
weakest pre-condition are guaranteed to satisfy the program’s assert statements. Additionally or
alternatively, a strongest post-condition may be generated, determining what is guaranteed to be
true about the state of the program upon completion of the program. In one embodiment, the SMT
solver generates invariants by mapping predicates onto unknown variables in a template. The
template may comprise unknown variables related by logical structures defined with disjunctions,
universal quantifiers, and existential quantifiers. The predicates may comprise equalities and
inequalities between program variables.
Pri. Date 20081006 App. Date 20081002 Pub. Date 20100408

April 2010 USPTO Patent Applications 83


G06F 11/00

App. No. 20100107245 Assignee MICROSOFT CORPORATION


Title Tamper-tolerant programs
Abstract Tamper-tolerant programs enable correct and continued execution despite attacks. Programs
can be transformed into tamper-tolerant versions that correct effects of tampering in response
to detection thereof Tamper-tolerant programs can execute alone or in conjunction with tamper
resistance/prevention mechanisms such as obfuscation and encryption/decryption, among other
things. In fact, the same and/or similar mechanisms can be employed to protect tamper tolerance
functionality.
Pri. Date 20050812 App. Date 20081029 Pub. Date 20100429

April 2010 USPTO Patent Applications 84


G06F 11/07

G06F 11/07: Electric digital data processing Ü Error detection Ü Responding


to the occurrence of a fault, e.g. fault tolerance
App. No. 20100083036 Assignee Microsoft Corporation
Title Configuration of memory management techniques selectively using mitigations to reduce errors
Abstract Techniques for performing memory management to mitigate memory errors. In accordance with
the principles described herein, a memory management module may be implemented that acts
in different modes of operation for each of one or more software modules that are instances of
applications. In one mode of operation, memory operations may be performed in accordance with
one or more mitigation actions, and in another mode of operation, the memory management
module performs memory operations as requested, without performing mitigation actions. A
memory management module may maintain a record in a data store associated with the memory
management module that may be used to determine whether to enable the mitigations. In
some implementations, records maintained by each of a plurality of computing devices may be
aggregated at a central server and this aggregated information may be used to adjust the entries
on each of the computing devices.
Pri. Date 20090512 App. Date 20080926 Pub. Date 20100401

April 2010 USPTO Patent Applications 85


G06F 11/07

App. No. 20100100688 Assignee MICROSOFT CORPORATION


Title Low-level conditional synchronization support
Abstract A low-overhead conditional synchronization instruction operates on a synchronization variable
which includes a lock bit, a state specification, and bits for user-defined data. The instruction
specifies the memory address of the synchronization variable and a condition. During the
synchronization instruction the condition is compared to the state specification within an atomic
region. The match succeeds if the condition matches the state specification and the lock bit
is clear. The synchronization instruction may operate with a cache under a cache coherency
protocol, or without a cache, and may include a timeout operand.
Pri. Date 20081020 App. Date 20081016 Pub. Date 20100422

April 2010 USPTO Patent Applications 86


G06F 11/32

App. No. 20100107002 Assignee MICROSOFT CORPORATION


Title Failure notification in rendezvous federation
Abstract Systems and methods that supply a global knowledge on what nodes are available in the system,
via employing routing tokens that are analyzed by a centralized management component to infer
status for the nodes. When nodes fail, the routing tokens associated therewith are acquired by
neighboring nodes, and the global knowledge updated. Moreover, upon inferring a failed or down
status for a node, a challenge can be sent to a node reporting such failure to verify actual failure(s).
Pri. Date 20081027 App. Date 20090427 Pub. Date 20100429

G06F 11/20: Electric digital data processing Ü Error detection Ü Responding


to the occurrence of a fault, e.g. fault tolerance Ü Error detection or
correction of the data by redundancy in hardware Ü using active fault-
masking, e.g. by switching out faulty elements or by switching in spare
elements
Patent applications also belong to this classification and have been already shown:
20100107002 page 87

April 2010 USPTO Patent Applications 87


G06F 11/36

G06F 11/32: Electric digital data processing Ü Error detection Ü Monitoring


Ü with visual indication of the functioning of the machine
App. No. 20100106819 Assignee MICROSOFT CORPORATION
Title Script based computer health management system
Abstract A management system may use a human readable script in which is defined executable
statements that may gathers status information from various services. The status information
may be displayed within a management user interface, which may also include various summary
statistics including an overall security state. The services may be locally running services, and
services provided or accessible over a local area network or wide area network. In some cases,
the human readable script may include statements for starting or resuming the services, querying
a running service, or querying a database related to a service. The user interface may be
refreshed when the human readable script is updated and re-executed. The services may include
security related services, among others.
Pri. Date 20081023 App. Date 20081027 Pub. Date 20100429

G06F 11/34: Electric digital data processing Ü Error detection Ü Monitoring


Ü Recording or statistical evaluation of computer activity, e.g. of down
time, of input/output operation
App. No. 20100082804 Assignee MICROSOFT CORPORATION
Title Measured client experience for computer network
Abstract Routing network traffic on a computer network is described. In one embodiment, a method
is presented which includes transmitting instructions to a client, the instructions executable by
the client to request content from two or more content servers, measure two or more network
performance characteristics associated with the two or more different content servers, and
issue a report to an administrative server. The report may include a first network performance
characteristic and a second network performance characteristic. The method may further include
selecting a target content server from one of two or more content servers based on comparison
of the two or more network performance characteristics; and transmitting routing instructions to
an intermediate routing system, the routing instructions executable by the intermediate routing
system to direct subsequent content requests transmitted by the client to the target content server.
Pri. Date 20080930 App. Date 20081001 Pub. Date 20100401

April 2010 USPTO Patent Applications 88


G06F 11/36

G06F 11/36: Electric digital data processing Ü Error detection Ü Preventing


errors by testing or debugging of software
App. No. 20100083047 Assignee Microsoft Corporation
Title Memory management techniques selectively using mitigations to reduce errors
Abstract Techniques for performing memory management to mitigate memory errors. In accordance with
the principles described herein, a memory management module may be implemented that acts
in different modes of operation for each of one or more software modules issuing requests
for performance of memory operations to the memory management module. In one mode
of operation, one or more mitigation actions may be performed by the memory management
module in addition to or instead of the memory operation requested by the calling software
module, such that the memory operations are performed in accordance with the mitigation actions.
These mitigation actions may serve to reduce a likelihood of a memory error negatively affecting
the calling software module. In another mode of operation, the memory management module
performs memory operations as requested, without performing mitigation actions.
Pri. Date 20080930 App. Date 20080926 Pub. Date 20100401

April 2010 USPTO Patent Applications 89


G06F 11/36

App. No. 20100083048 Assignee Microsoft Corporation


Title Evaluating effectiveness of memory management techniques selectively using mitigations to
reduce errors
Abstract A mitigation enablement module for a computer that improves application reliability. When
performing memory management operations, the mitigation enablement module and associated
memory manager selectively use mitigations that are intended to prevent an application bug from
cause an application error. The memory manager may selectively apply mitigations for each of
one or more applications based on the likelihood that such mitigations are successful at preventing
bugs from causing application errors. The likelihood is determined from historical information on
whether the mitigations, when applied, prevented bugs from causing memory operations that
could cause application errors. This historical information can be gathered on a single computer
over multiple invocations of the application or may be aggregated from multiple computers, each
invoking the application. The determined likelihood may then be used to determine whether or for
how long to apply the mitigation actions for memory operations requested by the application.
Pri. Date 20080930 App. Date 20080926 Pub. Date 20100401

April 2010 USPTO Patent Applications 90


G06F 11/36

April 2010 USPTO Patent Applications 91


G06F 12/00

App. No. 20100088546 Assignee MICROSOFT CORPORATION


Title Statistical debugging using paths and adaptive profiling
Abstract The method executes the application and if there are no errors from the execution of the
application, the method ends. If errors exist, the errors are collected from the execution of the
application in an error report. Labeled application paths are created by adding a unique label
to individual application paths where the application paths are individual loops and individual
functions in the application. An analysis is created of the labeled application paths by executing
the application with the labeled paths, reviewing the error report for data related to the labels and
if an error is sufficiently related to application paths with labels, storing the path that created the
errors in a report. If an error is not sufficient related to the application path with labels, the method
is repeated by the creating the analysis again by substituting additional application paths for the
application paths.
Pri. Date 20081003 App. Date 20081003 Pub. Date 20100408

Patent applications also belong to this classification and have been already shown:
20100107015 page 67

G06F 12/00: Electric digital data processing Ü Accessing, addressing


or allocating within memory systems or architectures
App. No. 20100082714 Assignee Microsoft Corporation
Title Nested file system support
Abstract A processing device and a machine-implemented method may be provided for tracking file system
dependencies with respect to a volume residing on a storage device and guest volumes residing
on virtual storage devices nested within the volume. A shim driver may receive an indication of a
virtual storage device being surfaced and may parse contents to surface partitions and volumes
contained within the virtual storage device to a system. The shim driver may open a guest volume
nested within a host volume and may send a register request, regarding the guest volume, to
a virtual disk mini-filter associated with the host volume. The virtual disk mini-filter may save
information regarding a relationship between the host volume and the guest volume. The saved
information may be used to prevent file system corruption when the host volume is dismounted or
unexpectedly removed.
Pri. Date 20081001 App. Date 20080930 Pub. Date 20100401

April 2010 USPTO Patent Applications 92


G06F 12/00

App. No. 20100082918 Assignee Microsoft Corporation


Title Log manager for aggregating data
Abstract A processing device and a machine-implemented method may be provided for sequentially
aggregating, or writing, data to a log included in a data store. The log may store multiple log
entries. Each of the log entries may include an entry metadata portion, describing a respective
log entry, and an entry payload data portion. The entry metadata portion may include a log
sequence number, corresponding to a log entry at a particular position in the log. A library of
log-related processes may be provided, along with an application program interface to permit a
calling application program to call any of the log related processes. The log-related processes
may be called during a boot mode, a user mode, and a kernel mode.
Pri. Date 20081001 App. Date 20080922 Pub. Date 20100401

April 2010 USPTO Patent Applications 93


G06F 12/00

App. No. 20100095083 Assignee Microsoft Corporation


Title Selectively utilizing a plurality of disparate solid state storage locations
Abstract A method for selectively utilizing a plurality of disparate solid state storage locations is disclosed.
The technology initially receives class types for a plurality of disparate solid state storage
locations. The characteristics of the received data are determined. The received data is
then allocated to one of the plurality of disparate solid state storage locations based upon the
determined characteristics of the received data.
Pri. Date 20061220 App. Date 20091216 Pub. Date 20100415

April 2010 USPTO Patent Applications 94


G06F 12/00

App. No. 20100100689 Assignee MICROSOFT CORPORATION


Title Transaction processing in transactional memory
Abstract A transactional memory processing system provides for the integration of transactional memory
concepts at the compiler-level into a higher-level traditional transaction processing system. Atomic
blocks at the compiler-level can be specified as atomic block transactions and include the features
of atomicity and isolation. Actions within this atomic block transaction include the enlistment of
resource managers from a repository. The repository can now include a pre-programmed memory
resource manager to manage the transactional memory. As in traditional transactions, a commit
protocol can be used to determine if the actions are valid and can be exposed outside of the
transaction. Unlike traditional transactions, however, the transaction is not necessarily doomed
if all of the actions are not validated. Rather, memory conflicts can cause a rollback and re-
execution of the atomic block transaction, which can be repeated as long as necessary, until the
memory resource manger votes to commit.
Pri. Date 20081020 App. Date 20090114 Pub. Date 20100422

App. No. 20100100690 Assignee MICROSOFT CORPORATION


Title System to reduce interference in concurrent programs
Abstract Locks are used to protect variables. All variables protected by a lock are allocated on a page
associated with a lock. When a thread (called the owner) acquires the lock, a local copy of the
memory page containing the variable is created, the original memory page is protected, and all
access of the variable in the owner thread is directed to the local copy. Upon releasing the lock,
the changes from the local copy are carried over to the memory page and the memory page is
unprotected. Any concurrent access of the variable by non-owner threads triggers an exception
handler (due to the protection mechanism) and delays such an access until after the owner thread
has finished accessing the variable.
Pri. Date 20081020 App. Date 20081021 Pub. Date 20100422

App. No. 20100106758 Assignee Microsoft Corporation


Title Computing discrete fourier transforms
Abstract A system described herein includes a selector component that receives input data that is desirably
transformed by way of a Discrete Fourier Transform, wherein the selector component selects one
of a plurality of algorithms for computing the Discrete Fourier Transform from a library based at
least in part upon a size of the input function. An evaluator component executes the selected one
of the plurality of algorithms to compute the Discrete Fourier Transform, wherein the evaluator
component causes leverages shared memory of a processor to compute the Discrete Fourier
Transform.
Pri. Date 20081024 App. Date 20081024 Pub. Date 20100429

April 2010 USPTO Patent Applications 95


G06F 12/00

App. No. 20100106895 Assignee Microsoft Corporation


Title Hardware and operating system support for persistent memory on a memory bus
Abstract Implementations of a file system that is supported by a non-volatile memory that is directly
connected to a memory bus, and placed side by side with a dynamic random access memory
(DRAM), are described.
Pri. Date 20081029 App. Date 20090715 Pub. Date 20100429

April 2010 USPTO Patent Applications 96


G06F 12/00

App. No. 20100106920 Assignee MICROSOFT CORPORATION


Title Data location obfuscation
Abstract Programs running on an open architecture, such as a personal computer, are vulnerable to
inspection and modification. This is a concern as the program may include or provide access
to valuable information. As a defense, the actual location of data can be hidden throughout
execution of the program by way of periodic location reordering and pointer scrambling, among
other things. These techniques serve to complicate static data flow analysis and dynamic data
tracking thereby at least deterring program tampering.
Pri. Date 20081027 App. Date 20081029 Pub. Date 20100429

April 2010 USPTO Patent Applications 97


G06F 12/00

App. No. 20100106930 Assignee MICROSOFT CORPORATION


Title Opportunistic page largification
Abstract Page tables in the last level of a hierarchical page table system are scanned for candidate page
tables. Candidate page tables are converted to large pages, having a page table entry in a level
before the last level of the hierarchical page table system adjusted to be associated with the newly
created large page. Upon receiving a notification that a large page is to be converted into a page
table, a new page table is created. Each entry in the new page table is associated with a small
segment of memory in the large page and an entry in a page table one level before the last level
in a hierarchical page table system is adjusted to be associated with the new page table.
Pri. Date 20081029 App. Date 20081023 Pub. Date 20100429

April 2010 USPTO Patent Applications 98


G06F 12/02

Patent applications also belong to this classification and have been already shown:
20100088431 page 16 20100106754 page 40

G06F 12/02: Electric digital data processing Ü Accessing, addressing


or allocating within memory systems or architectures Ü Addressing or
allocation
App. No. 20100088470 Assignee MICROSOFT CORPORATION
Title Optimizing information lifecycle management for fixed storage
Abstract The method may query the disk drive for a size where size may be a total number of logical blocks
on the disk drive. The drive may receive a size response where the size includes a total number of
logical blocks on the disk drive. The number of usage blocks necessary to represent the number
of logical blocks on the disk drive may then be determined and usage data may be stored in the
usage blocks. The data may be stored in the buffer of the disk drive. The data may also be stored
in the DDF of a RAID drive. The data may be used to permit incremental backups of disk drives
by backing up only the blocks that are indicated as having been changed. In addition, information
about the access to the drive may be collected and stored for later analysis.
Pri. Date 20081008 App. Date 20081002 Pub. Date 20100408

App. No. 20100106931 Assignee MICROSOFT CORPORATION


Title Avoiding information disclosure when direct mapping non-page aligned buffers
Abstract A method and a processing device are provided for mapping a non-page aligned memory buffer
to an address space of a process. A beginning portion of a non-page aligned memory buffer
and an ending portion of the non-page aligned memory buffer may be copied from respective
original memory pages to new memory pages. Unused portions of the new memory pages may
be initialized to zeros, ones, or other values. A safe buffer may be created, which resides in the
new memory pages and all original memory pages of the non-page aligned memory buffer, except
for the original memory pages including either the beginning portion or the ending portion of the
non-page aligned buffer. The safe buffer may then be mapped to an address space of a process
while avoiding unintended information disclosure.
Pri. Date 20081029 App. Date 20090123 Pub. Date 20100429

April 2010 USPTO Patent Applications 99


G06F 12/06

App. No. 20100106934 Assignee MICROSOFT CORPORATION


Title Partition management in a partitioned, scalable, and available structured storage
Abstract Partition management for a scalable, structured storage system is provided. The storage system
provides storage represented by one or more tables, each of which includes rows that represent
data entities. A table is partitioned into a number of partitions, each partition including a
contiguous range of rows. The partitions are served by table servers and managed by a table
master. Load distribution information for the table servers and partitions is tracked, and the table
master determines to split and/or merge partitions based on the load distribution information.
Pri. Date 20081027 App. Date 20081024 Pub. Date 20100429

Patent applications also belong to this classification and have been already shown:
20100082714 page 92 20100106895 page 96 20100106930 page 98

April 2010 USPTO Patent Applications 100


G06F 12/06

G06F 12/06: Electric digital data processing Ü Accessing, addressing


or allocating within memory systems or architectures Ü Addressing
or allocation Ü Addressing a physical block of locations, e.g. base
addressing, module addressing, address space extension, memory dedication
App. No. 20100100701 Assignee MICROSOFT CORPORATION
Title Optimizing defragmentation operations in a differential snapshotter
Abstract A method for establishing and maintaining a differential snapshot of a set of files stored on a
volume is disclosed. The invention achieves processing time and disk space optimizations by
avoiding copy-on-write operations for logically insignificant moves of blocks, such as the block
rearrangements characteristic of defragmentation utilities. A file system enhancement enabling
the passing of a block copy command from the file system to lower-level drivers, is used to inform
the snapshotter that a block move operation is not logically meaningful. When the logically
insignificant move is of a block whose data forms part of the data captured in the snapshot
virtual volume, and when the move is to a block location that is functioning as logical free space,
the snapshotter can simply modify its block bitmap and update translation table entries without
needing to perform a copy-on-write.
Pri. Date 20081020 App. Date 20091223 Pub. Date 20100422

April 2010 USPTO Patent Applications 101


G06F 12/08

G06F 12/08: Electric digital data processing Ü Accessing, addressing


or allocating within memory systems or architectures Ü Addressing or
allocation Ü in hierarchically structured memory systems, e.g. virtual
memory systems
App. No. 20100106914 Assignee Microsoft Corporation
Title Consistency models in a distributed store
Abstract Systems and methods that designate read/write consistency models based on requirements of
a distributed store to increase performance or scale. Such sever loads can be determined via a
plurality of mechanisms, including delays in responses by the primary node; setting predetermined
threshold limits that if exceeded results in contacting secondary nodes; polling services of the
distributed cache periodically and maintaining track of loads on the servers, and the like. The
weak or scalable read can occur when read requests are directed to a secondary node, and upon
over loading of the primary node.
Pri. Date 20081027 App. Date 20090430 Pub. Date 20100429

April 2010 USPTO Patent Applications 102


G06F 12/10

App. No. 20100106915 Assignee MICROSOFT CORPORATION


Title Poll based cache event notifications in a distributed cache
Abstract Systems and methods that supply poll based notification system in a distributed cache, for tracking
changes to cache items. Local caches on the client can employ the notification system to keep
the local objects in sync with the backend cache service; and can further dynamically adjust the
x201c;scopex201d; of notifications required based on the number and distribution of keys in the
local cache. The server can maintain the changes in an efficient fashion (in blocks) and returns
the changes to clients that perform the appropriate filtering. Notifications can be associated with
a session and/or an application.
Pri. Date 20081027 App. Date 20090511 Pub. Date 20100429

April 2010 USPTO Patent Applications 103


G06F 12/14

Patent applications also belong to this classification and have been already shown:
20100088470 page 99 20100100688 page 86 20100106931 page 99

G06F 12/10: Electric digital data processing Ü Accessing, addressing


or allocating within memory systems or architectures Ü Addressing or
allocation Ü in hierarchically structured memory systems, e.g. virtual
memory systems Ü Address translation
Patent applications also belong to this classification and have been already shown:
20100106930 page 98 20100106934 page 100

G06F 12/14: Electric digital data processing Ü Accessing, addressing


or allocating within memory systems or architectures Ü Protection against
unauthorised use of memory
App. No. 20100088523 Assignee Microsoft Corporation
Title Trusted platform module security
Abstract The described implementations relate to trusted platform module (TPM) security. One
configuration that is implemented on a computing device includes a TPM configured to generate a
key pair utilizing a factor stored on the TPM and an external cofactor that is not stored on the TPM.
The computing device also includes a communication device configured to receive the external
cofactor and convey the external cofactor to the TPM.
Pri. Date 20070207 App. Date 20081007 Pub. Date 20100408

April 2010 USPTO Patent Applications 104


G06F 12/16

App. No. 20100088525 Assignee Microsoft Corporation


Title External encryption and recovery management with hardware encrypted storage devices
Abstract Hardware encrypting storage devices can provide for hardware encryption of data being written to
the storage media of such storage devices, and hardware decryption of data being read from that
storage media. To utilize existing key management resources, which can be more flexible and
accommodating, mechanisms for storing keys protected by the existing resources, but not the
hardware encryption of the storage device, can be developed. Dedicated partitions that do not
have corresponding encryption bands can be utilized to store keys in a non-hardware-encrypted
manner. Likewise, partitions can be defined larger than their associated encryption bands, leaving
room near the beginning and end for non-hardware encrypted storage. Or a separate bit can be
used to individually specify which data should be hardware encrypted. Additionally automated
processes can maintain synchronization between a partition table of the computing device and a
band table of the hardware encrypting storage device.
Pri. Date 20070207 App. Date 20081003 Pub. Date 20100408

G06F 12/16: Electric digital data processing Ü Accessing, addressing


or allocating within memory systems or architectures Ü Protection against
loss of memory contents
App. No. 20100082550 Assignee MICROSOFT CORPORATION
Title Aggregation of write traffic to a data store
Abstract A method and a processing device are provided for sequentially aggregating data to a write log
included in a volume of a random-access medium. When data of a received write request is
determined to be suitable for sequentially aggregating to a write log, the data may be written to
the write log and a remapping tree, for mapping originally intended destinations on the random-
access medium to one or more corresponding entries in the write log, may be maintained and
updated. At time periods, a checkpoint may be written to the write log. The checkpoint may
include information describing entries of the write log. One or more of the checkpoints may be
used to recover the write log, at least partially, after a dirty shutdown. Entries of the write log may
be drained to respective originally intended destinations upon an occurrence of one of a number
of conditions.
Pri. Date 20080930 App. Date 20080919 Pub. Date 20100401

April 2010 USPTO Patent Applications 105


G06F 13/00

Patent applications also belong to this classification and have been already shown:
20100083257 page 73

G06F 13/00: Electric digital data processing Ü Interconnection of, or


transfer of information or other signals between, memories, input/output
devices or central processing units
App. No. 20100082868 Assignee Microsoft Corporation
Title Methods and systems for a portable, interactive display device for use with a computer
Abstract A portable, interactive display device is disclosed. The device presents to a user the graphical
interface of a host computer. The host is separate from the display device and sits in a fixed
location. The invention allows a user to carry with him the user interface capability of the host,
limited only by the capabilities of a wireless communications channel to the host. The host
provides processing, storage, and access to its own peripheral devices. The display device need
only provide the amount of processing necessary to communicate with the host, to run the client
side of the hosting software, and to provide security functions. The host provides a docking station
that accommodates the display device. When in the docking station, the display device continues
to operate but communicates with the host through the docking station rather than through the
wireless channel. This allows for a higher quality video connection.
Pri. Date 20080930 App. Date 20061004 Pub. Date 20100401

April 2010 USPTO Patent Applications 106


G06F 15/00

Patent applications also belong to this classification and have been already shown:
20100082714 page 92 20100082918 page 93 20100088431 page 16

G06F 13/28: Electric digital data processing Ü Interconnection of, or


transfer of information or other signals between, memories, input/output
devices or central processing units Ü Handling requests for interconnection
or transfer Ü for access to input/output bus Ü using burst mode transfer,
e.g. direct memory access, cycle steal
Patent applications also belong to this classification and have been already shown:
20100082714 page 92 20100082918 page 93

G06F 15/00: Electric digital data processing Ü Digital computers in


general
App. No. 20100082300 Assignee MICROSOFT CORPORATION
Title Storage input/output utilization associated with a software application
Abstract A method includes determining a total storage input/output capacity of a set of storage elements
available for use by a software application located on an operating system volume of a computer
system. The total storage input/output capacity is determined by evaluating storage input/output
capacity of the storage elements at a physical device level and at a file level. The method
includes measuring a number of input/output storage operations performed on behalf of the
software application. The method also includes determining a storage input/output utilization
of the software application based on the measured number of input/output storage operations as
compared to the total storage input/output capacity of the set of storage elements.
Pri. Date 20080930 App. Date 20080930 Pub. Date 20100401

April 2010 USPTO Patent Applications 107


G06F 15/16

G06F 15/16: Electric digital data processing Ü Digital computers in


general Ü Combinations of two or more digital computers each having
at least an arithmetic unit, a programme unit and a register, e.g. for a
simultaneous processing of several programmes
App. No. 20100082440 Assignee MICROSOFT CORPORATION
Title Adaptive run-time advertisements
Abstract Systems, computer-implemented methods and computer-storage media are provided for
presenting customizable advertisements to a user. Advertising is customized through the use
of user-specific or user-relevant data. Items such as keywords, profile data, and application data
are received and are then used to retrieve customizations. These customizations are stored by a
server or group of servers that the vendor makes available to the advertising provider. Items that
could further identify adaptations desirable for advertising, such as a user profile, may be sent
to the vendor’s server as well. The adaptations take forms that include pictures, text, graphics,
links, audio, and video files. Systems that comprise an advertising server, a vendor server, and
a client application used for completing the above method, as well as computer-readable media
necessary at each device to accomplish the customizations, are also described.
Pri. Date 20090623 App. Date 20080930 Pub. Date 20100401

April 2010 USPTO Patent Applications 108


G06F 15/16

App. No. 20100082733 Assignee Microsoft Corporation


Title Extensible remote programmatic access to user interface
Abstract A remote automation system is described herein that allows application accessibility information
to be used remotely and extended to allow custom UI elements to be automated. The remote
automation system receives a request at a remote computer for automation data related to an
application running on the remote computer. The remote automation system requests automation
data from the application running on the remote computer and serializes the automation data for
transmission to the client computer. The system transmits the serialized automation data to the
client computer in response to the request. When the client computer receives the response, the
system deserializes the automation data and provides the deserialized automation data to a local
application on the client computer. Thus, the remote automation system allows users to view
applications running on a remote system but run accessibility applications locally.
Pri. Date 20080930 App. Date 20080930 Pub. Date 20100401

App. No. 20100082736 Assignee MICROSOFT CORPORATION


Title Recording and/or use of generation information
Abstract An object (e.g., a video, a widget, etc.) may carry generation information, indicating the length
of the referral chain that led to the object’s being downloaded. Some users become aware of the
object through initial publicity. When these users download an instance of the object, that instance
is a generation zero instance. The object may contain a mechanism (e.g., a link) that invites other
users to download an instance of the objects. When a user follows such a link and downloads an
instance of the object, the downloaded instance has a higher generation than the instance that
presented the link to the user. For example, if a generation zero object refers a download, then the
downloaded object instance may have generation one. Generation information may be collected
and analyzed to determine how successfully an object propagates.
Pri. Date 20080930 App. Date 20080930 Pub. Date 20100401

April 2010 USPTO Patent Applications 109


G06F 15/16

App. No. 20100082750 Assignee MICROSOFT CORPORATION


Title Dynamically transforming data to the context of an intended recipient
Abstract A sender can create a message for transmission to an intended recipient. During creation of
the message, the sender may insert data into the message that is expressed with reference
to the context of the sender. When the sender inserts data into a message that is expressed
with reference to their own context, they may be asked whether the data should be dynamically
transformed to the context of the intended recipient. If the sender indicates that the data should
be transformed to the context of the intended recipient, the context of the intended recipient is
determined. Once the context of the intended recipient has been determined, the data in the
message is transformed to the context of the intended recipient and the message containing the
transformed data is transmitted to the intended recipient.
Pri. Date 20080930 App. Date 20080929 Pub. Date 20100401

App. No. 20100082751 Assignee MICROSOFT CORPORATION


Title User perception of electronic messaging
Abstract Determining user use context for electronic messaging and disseminating a subset of the user
use context to recipients and/or senders of such electronic message is disclosed herein. By way
of example, the user use context can be based on a general context of recipients, such as speed
with which a message is disseminated or consumed, number of child messages spawned, rate
at which such messages are spawned, and so on. Additionally, user use context can also be
based on individual context, by comparing individual interaction to a message (e.g., time to read,
time to delete, number of child messages, etc.), with a baseline usage context determined for the
individual. The context can be disseminated to recipients of the message or to the sender, to
provide an overview of perception of the electronic message.
Pri. Date 20080930 App. Date 20080929 Pub. Date 20100401

April 2010 USPTO Patent Applications 110


G06F 15/16

App. No. 20100082753 Assignee Microsoft Corporation


Title Role-independent context exchange
Abstract Technologies for conversations between various parties, the conversations including context
information that can be persisted to maintain the conversation when the parties or the
communications media they communicate over operate intermittently. In such a conversation,
any party can embed its view of the context into a message and any party can send the next
message regardless of role and regardless of the underlying network, transport, or application
message exchange pattern. Such technologies provide for durable services.
Pri. Date 20080930 App. Date 20080930 Pub. Date 20100401

April 2010 USPTO Patent Applications 111


G06F 15/16

App. No. 20100082813 Assignee MICROSOFT CORPORATION


Title Multiple parallel user experiences provided by a single set of internet hosting machines
Abstract This disclosure describes techniques of using a hosting device to provide multiple versions of
a single web application. As described in detail below, the hosting device stores resources
associated with different versions of the web application in different subdirectories. When
the hosting device receives a request associated with the web application, the hosting device
automatically identifies one of the versions of the web application as an applicable version of the
web application. The hosting device rewrites a pathname in the request to include a subdirectory
name of the subdirectory that stores the applicable version of the web application. The hosting
device then dereferences the resource identified by the rewritten pathname. In this way, the
hosting device uses the resources of the applicable version of the web application to process the
request.
Pri. Date 20080930 App. Date 20080929 Pub. Date 20100401

App. No. 20100082825 Assignee Microsoft Corporation


Title Integrating enterprise identity authorization in conferences
Abstract Disclosed herein are embodiments for validating a user joining a conferencing session. According
to various embodiments, a first identifier is received. A user is identified from a plurality of users
based at least in part on the first identifier. A second identifier is received that corresponds to
the first identifier and the user and the user is validated based on both the first identifier and the
second identifier. The user may then join the conferencing session, with the user’s identity being
revealed to others attending the conferencing session.
Pri. Date 20070608 App. Date 20080926 Pub. Date 20100401

April 2010 USPTO Patent Applications 112


G06F 15/16

App. No. 20100082838 Assignee Microsoft Corporation


Title Isp-friendly rate allocation for p2p applications
Abstract An ISP-friendly rate allocation system and method that reduces network traffic across ISP
boundaries in a peer-to-peer (P2P) network, Embodiments of the system and method
continuously solve a global optimization problem and dictate accordingly how much bandwidth
is allocated on each connection. Embodiments of the system and method minimize load on
a server in communication with the P2P network, minimize ISP-unfriendly traffic while keeping
the minimum server load unaffected, and maximize peer prefetching. Two different techniques
are used to compute rate allocation, including a utility function optimization technique and a
minimum cost flow formulation technique. The utility function optimization technique constructs
a utility function and optimizes that utility function. The minimum cost flow formulation technique
generates a minimum cost flow formulation using a bipartite graph have a vertices set and an
edges set. A distributed minimum cost flow formulation is solved using Lagrangian multipliers.
Pri. Date 20070208 App. Date 20080930 Pub. Date 20100401

App. No. 20100083098 Assignee MICROSOFT CORPORATION


Title Streaming information that describes a webpage
Abstract Techniques to stream information describing a webpage are described. In an implementation,
a webpage having a plurality of objects is accessed over a network. As changes are made to
the webpage, elements describing changes to objects within the webpage are generated and
streamed to an application. In another implementation, a stream of elements from a browser is
received. Each of the elements describes a change to an object in a webpage accessed by the
browser.
Pri. Date 20051117 App. Date 20080930 Pub. Date 20100401

April 2010 USPTO Patent Applications 113


G06F 15/16

App. No. 20100088359 Assignee MICROSOFT CORPORATION


Title Network based jit on a priori knowledge of a set of disparate clients
Abstract Network based just-in-time compilation based on A Priori knowledge of a set of disparate clients
is disclosed. One embodiment comprises using a web service to register a device and store
a device profile containing the capabilities of the device, receiving a request from the device to
subscribe to a content service, and to create a client runtime for the device for a requested service
corresponding to the device capabilities. In this way, the embodiment may send the client runtime
to the device to allow the device to communicate with the content service through the web service.
Pri. Date 20061130 App. Date 20081003 Pub. Date 20100408

App. No. 20100088372 Assignee MICROSOFT CORPORATION


Title Conference networking system incorporating social networking site information
Abstract A method for facilitating networking among attendees at a conference is provided. The method
includes receiving over a wide-area network a user profile from a user who has registered for at
least one conference selected from among a plurality of conferences. The user profile includes
a username for at least one social networking site. The user profile is stored in a database that
includes a plurality of user profiles for a plurality of attendees who have registered for at least one
of the plurality of conferences. The user is granted access to the database over the wide-area
network, including access to a profile on the social networking site associated with the username.
Pri. Date 20071207 App. Date 20081003 Pub. Date 20100408

April 2010 USPTO Patent Applications 114


G06F 15/16

App. No. 20100088380 Assignee MICROSOFT CORPORATION


Title Message rendering for identification of content features
Abstract Architecture for detecting and removing obfuscating clutter from the subject and/or body of a
message, e.g., e-mail, prior to filtering of the message, to identify junk messages commonly
referred to as spam. The technique utilizes the powerful features built into an HTML rendering
engine to strip the HTML instructions for all non-substantive aspects of the message. Pre-
processing includes pre-rendering of the message into a final format, which final format is that
which is displayed by the rendering engine to the user. The final format message is then converted
to a text-only format to remove graphics, color, non-text decoration, and spacing that cannot be
rendered as ASCII-style or Unicode-style characters. The result is essentially to reduce each
message to its common denominator essentials so that the junk mail filter can view each message
on an equal basis.
Pri. Date 20081002 App. Date 20090123 Pub. Date 20100408

April 2010 USPTO Patent Applications 115


G06F 15/16

App. No. 20100088390 Assignee MICROSOFT CORPORATION


Title Data sharing proxy for mobile devices
Abstract Described is a technology that uses a web service as a proxy for transferring data between mobile
communications devices. A short range communication link is established between a source
device and a destination device. The source device sends a content identifier over the short
range communication link to the destination device, that the destination devices uses to access
the content, including when the short range communication link no longer exists. Also described
is security for the content via authentication data (e.g., credentials) and policy associated with
the content to control its access. The source device may select the destination device or may
broadcast the content identifier to any number of destination devices within range.
Pri. Date 20081006 App. Date 20081003 Pub. Date 20100408

App. No. 20100088405 Assignee Microsoft Corporation


Title Determining network delay and cdn deployment
Abstract Charting a content distribution system (CDN) involves identifying a set of DNS servers that may be
used as vantage points to test delay performance to a CDNs content server. As provided herein,
to identify potential vantage point DNS servers, a set of authoritative name servers is identified
and, from that set, those authoritative name servers that respond to a DNS query are identified as
responsive authoritative name servers. Identifying a CDN content server that serves a particular
vantage point DNS server involves retrieving an IP address for the CDN content server from a DNS
query to the DNS server corresponding to the vantage point. The delay performance between the
vantage point DNS server and the CDN content server can then be determined. Further, one can
determine locations to deploy new data centers for a CDN based on delay performance, A delay
from one or more vantage points to an existing CDN’s DNS servers can be measured, and desired
rank of locations can be generated. A location of a new data center can be selected based on a
desired delay performance ranking.
Pri. Date 20071221 App. Date 20081008 Pub. Date 20100408

April 2010 USPTO Patent Applications 116


G06F 15/16

App. No. 20100088418 Assignee Microsoft Corporation


Title Edge traversal service dormancy
Abstract A system maintains a dormant state in the host, in which no beacons (or x201c;bubblesx201d;)
are transmitted from the host when no application or service (collectively, x201c;processesx201d;)
of the host is accepting unsolicited traffic via the edge traversal service. When at least one
application or service begins to accept unsolicited traffic via the edge traversal service, the host
enters a qualified state and begins transmitting the beacons. As each additional application
or service begins to accept such traffic, the number of accepting applications and services is
maintained. As applications and services terminate acceptance of such traffic, the number
of accepting applications and services is decremented. When the last application or service
terminates acceptance of unsolicited traffic via the edge traversal service, the host re-enters the
dormant state and ceases transmission of its beacons.
Pri. Date 20090603 App. Date 20091207 Pub. Date 20100408

April 2010 USPTO Patent Applications 117


G06F 15/16

App. No. 20100088520 Assignee MICROSOFT CORPORATION


Title Protocol for determining availability of peers in a peer-to-peer storage system
Abstract A method and system is provided for monitoring the availability of a peer in a P2P system that
is used to provide remote storage or remote processing power. In one illustrative example, a
recipient peer requests access to a service provisioned by another peer in a peer-to-peer network.
The request may be a request to access a file or a file fragment that is being stored on the
other peer. In order to make use of the accessed service, after receiving access to the service
provisioned by the peer, the recipient peer needs to report to a central server that the service has
been rendered. For instance, in some cases the file fragment accessed by the recipient peer may
be encrypted, in which case the central server will send the recipient peer a decryption key after
receiving the report that the service has been rendered.
Pri. Date 20070207 App. Date 20081002 Pub. Date 20100408

April 2010 USPTO Patent Applications 118


G06F 15/16

App. No. 20100094926 Assignee Microsoft Corporation


Title Declarative programming model for modeling and execution of triggers for resource oriented
system
Abstract Data sets of various types may be accessible through a host according to a protocol, such as a
RESTful HTTP interface. Various domains may involve domain-specific processes to be executed
as pre-triggers or post-triggers of various protocol requests (e.g., an HTTP GET request specifying
a Read operation on an access-restricted data set may involve an authorization operations set that
verifies the access privileges of the requester.) A host of the data set may be configured to receive
a resource script expressing the operations set in a script language, to store the resource script,
and to associated it with at least one data set and at least one verb of the protocol. Upon later
receiving a protocol request specifying the verb and the resource, the host may then execute the
resource script (as a pre-trigger and/or as a post-trigger) in accordance with the business logic of
the domain.
Pri. Date 20081015 App. Date 20081014 Pub. Date 20100415

App. No. 20100094939 Assignee MICROSOFT CORPORATION


Title Transient networks
Abstract The claimed subject matter relates to an architecture that can facilitate creation and management
of an event-oriented transient network and can further manage decommission of the transient
network. In particular, the architecture can construct temporary communities based upon a
particular event, project, or activity; manage (e.g., filter, prioritize, or control) communications
and content associated with the community; and disband the community by deconstructing
the transient network according to an aging function that controls how the network decays.
In addition, the architecture can leverage existing information (e.g. profile data) and content
feeds associated with disparate social networking services or communities for the benefit of the
temporary community.
Pri. Date 20081010 App. Date 20081009 Pub. Date 20100415

April 2010 USPTO Patent Applications 119


G06F 15/16

App. No. 20100100632 Assignee Microsoft Corporation


Title Sharing data within an instant messaging session
Abstract Sharing data within an instant messaging session is described. A user participating in an
instant messaging session may request a data access key. The key, which provides access to
data associated with the user, may then be transmitted via the instant messaging session to
one or more other participants in the instant messaging session. The other instant messaging
session participants can then use the key to access, via the instant messaging session, the data
associated with the user. Users may be granted various levels of access to another user’s data.
Pri. Date 20070627 App. Date 20091222 Pub. Date 20100422

April 2010 USPTO Patent Applications 120


G06F 15/16

April 2010 USPTO Patent Applications 121


G06F 15/16

App. No. 20100100637 Assignee MICROSOFT CORPORATION


Title Dynamically balancing user experiences in a multi-user computing system
Abstract A media experience policy engine includes three components an information manager, a policy
evaluator, and an enforcement module. The information manager collects information regarding
the current state of a media delivery system, such as, for example, usage of a CPU, memory, hard
disk, (I/O) interface, and a network. This collected data is then verified by the policy evaluator to
see if resource contention is, or is close to, occurring. If so, existing or potential conflicts are
dealt with by the enforcement module, which applies corrections, such as, for example, limiting
the access of later chronologic users, or degrading the user experience of all users, in accordance
with a desired policy in order to vitiate the resource contention and maintain a user experience
consistent with the desired policy.
Pri. Date 20081016 App. Date 20091224 Pub. Date 20100422

App. No. 20100106767 Assignee MICROSOFT CORPORATION


Title Automatically securing distributed applications
Abstract A processing system for distributed multi-tier applications is provided. The system includes a
server component that executes a replica of a client-side application, where a client component
executes the client-side application. The client component captures events from the client-side
application and transmits the events to the replica to validate the computational integrity security
of the application.
Pri. Date 20081020 App. Date 20081024 Pub. Date 20100429

April 2010 USPTO Patent Applications 122


G06F 15/16

App. No. 20100106768 Assignee MICROSOFT CORPORATION


Title Providing functionality to client services by implementing and binding contracts
Abstract Methods, systems, and computer-readable media for automating the expression of functional
aspects of a target service to a client service via a vehicle referred to herein as a contract
are provided. Generally, the methods are performed in the context of a distributed computing
environment configured to underlie operations of service application(s). In embodiments, the
contract is implemented and bound upon ascertaining that the expressed functional aspects
satisfy dependencies of the client service. Generally, the contract defines interfaces and
maintains properties that configure the interfaces during installation. During the implementation,
one of the interfaces is established and parameterized in accordance with the properties
associated therewith. During the binding, the target service and the client service are linked
via communication channels that are routed through the established interface. Accordingly, calls
from the client service over the communication channels allow for reaching and employing the
functional aspects of the target service.
Pri. Date 20081020 App. Date 20081024 Pub. Date 20100429

April 2010 USPTO Patent Applications 123


G06F 15/173

App. No. 20100106831 Assignee MICROSOFT CORPORATION


Title Bootstrap rendezvous federation
Abstract Systems and methods that ensure formation of a single ring from a seed node at any given time.
A x201c;bootstrapx201d; phase is included in a node’s life cycle, to mitigate adverse affects of
split-brain conditions in a network. During such bootstrap phase, if an existing ring is found,
the seed node can join the existing ring in a same manner as a non-seed node does. If no
ring is detected, the bootstrap phase attempts to elect a seed node to be the x201c;super-seed
nodex201d;, wherein a new ring can then be formed with such new super-seed node as the first
node.
Pri. Date 20081027 App. Date 20090427 Pub. Date 20100429

Patent applications also belong to this classification and have been already shown:
20100082804 page 88 20100088677 page 60 20100088753 page 42
20100095224 page 19 20100106678 page 50

April 2010 USPTO Patent Applications 124


G06F 15/173

G06F 15/173: Electric digital data processing Ü Digital computers in


general Ü Combinations of two or more digital computers each having
at least an arithmetic unit, a programme unit and a register, e.g. for
a simultaneous processing of several programmes Ü Interprocessor
communication Ü using an interconnection network, e.g. matrix, shuffle,
pyramid, star, snowflake
App. No. 20100082802 Assignee Microsoft Corporation
Title Stabilization of distributed systems
Abstract One or more embodiments, described herein, are directed towards a technology for analyzing
a distributed system in order to determine one or more inconsistencies placing the distributed
system in an unstable state. Once the one or more inconsistencies are determined, one or more
operations reconciling the inconsistencies are defined in order to stabilize the distributed system.
Pri. Date 20080930 App. Date 20080930 Pub. Date 20100401

App. No. 20100082803 Assignee Microsoft Corporation


Title Flexible compliance agent with integrated remediation
Abstract A flexible compliance system is described herein that provides a deployable meta-agent
and automated remediation of computer system compliance failures based on configurable
compliance rules. An administrator defines one or more rules that represent compliance elements
that the flexible compliance system will enforce. The flexible compliance system reads the
rules defined by the administrator like a flexible set of conditions to check, and correlates the
outcome of the conditions to the rules. The flexible compliance system may take various actions
with respect to a computer system in violation of a rule, including attempting to resolve the
violation or quarantining the computer system to avoid interaction with other computer systems.
Administrators can use the flexible compliance system to define these and many other types of
actions to automatically remediate non-compliant computer systems and protect the health of the
organization’s resources.
Pri. Date 20080930 App. Date 20081001 Pub. Date 20100401

April 2010 USPTO Patent Applications 125


G06F 15/173

App. No. 20100088376 Assignee Microsoft Corporation


Title Obtaining content and adding same to document
Abstract Mechanisms to assist a user in obtaining content may be integrated with the tools that allow
the user to author an e-mail message or any other type of document. For example, an e-
mail composition system may offer various buttons that allow users to obtain certain types of
contentx2014;e.g., movie times, restaurant menus, etc. When the user clicks the button, the
requested type of content may be obtained, and the user may be offered the opportunity to insert
the obtained content into the document that is being authored. The content that is obtained may
follow a particular structure. For example, a system might be configured to respond to a request
for movie-related content by returning a list of show-times and theaters for a particular movie.
Pri. Date 20081002 App. Date 20081003 Pub. Date 20100408

App. No. 20100094991 Assignee MICROSOFT CORPORATION


Title Automated role based usage determination for software system
Abstract A usage data collection and evaluation mechanism may collect usage information from various
sources and summarize the usage information to determine a role for a system. The role
and usage information may be transmitted to a centralized server for aggregation and analysis.
The collection and transmission of usage data may be governed by and conform to a privacy
agreement and may be collected when an end user agrees to such collection. Role determination
may be performed using data collected from a single device, multiple devices, or from a network
monitoring system. The usage data collection and evaluation mechanism may determine an
installed role base and any changes in the installed role base since a previous report.
Pri. Date 20050919 App. Date 20081015 Pub. Date 20100415

April 2010 USPTO Patent Applications 126


G06F 15/177

App. No. 20100106839 Assignee Microsoft Corporation


Title Arbitrating an appropriate back-end server to receive channels of a client sesssion
Abstract The present invention extends to methods, systems, and computer program products for
arbitrating an appropriate back-end server to receive channels of a client connection. Each front-
end server in a server farm specifies a back-end server in the server farm that it deems appropriate
for receiving channels of a client connection. Each specified back-end server is represented by an
arbitration mechanism. A relevant set of potential back-end servers that can receive channels of a
client connection is selected according to function configured to minimize performance impact. A
load balancing service compares arbitration mechanisms for different back-end servers in the set
of potential back-end servers to determine an appropriate back-end server for receiving channels
of the client connection.
Pri. Date 20081024 App. Date 20091221 Pub. Date 20100429

Patent applications also belong to this classification and have been already shown:
20100106767 page 122 20100106819 page 88 20100106934 page 100

April 2010 USPTO Patent Applications 127


G06F 15/177

G06F 15/177: Electric digital data processing Ü Digital computers in


general Ü Combinations of two or more digital computers each having
at least an arithmetic unit, a programme unit and a register, e.g. for
a simultaneous processing of several programmes Ü Initialisation or
configuration control
App. No. 20100106808 Assignee MICROSOFT CORPORATION
Title Replica placement in a distributed storage system
Abstract Replica placement in a network of nodes is provided. Nodes are selected for replica placement
to satisfy location-based preferences. Additionally, nodes are selected for replica placement to
spread replicas of the same data over different fault domains and upgrade domains. In some
instances, nodes may be selected for replica placement based on load-based information for the
nodes.
Pri. Date 20070816 App. Date 20081024 Pub. Date 20100429

April 2010 USPTO Patent Applications 128


G06F 15/177

App. No. 20100106812 Assignee MICROSOFT CORPORATION


Title Automating deployment of service applications by exposing hosting environment constraints
Abstract Methods, systems, and computer-readable media for automating deployment of service
applications by exposing environmental constraints in a service model are provided. In general,
the methods are performed in the context of a general purpose platform configured as a server
cloud to run various service applications distributed thereon. Accordingly, the general purpose
platform may be flexibly configured to manage varying degrees of characteristics associated
with each of the various service applications. Typically, these characteristics are provided in the
service model that governs the environmental constraints under which each component program
of the service application operates. As such, hosting environments are selected and adapted
to satisfy the environmental constraints associated with each component program. Adapting the
hosting environments includes installing parameters transformed from configuration settings of
each component program via map constructs, thereby refining the hosting environment to support
operation of the component program.
Pri. Date 20070816 App. Date 20081024 Pub. Date 20100429

App. No. 20100106813 Assignee Microsoft Corporation


Title Quorum based transactionally consistent membership management in distributed storage
systems
Abstract Systems and methods that restore a failed reconfiguration of nodes in a distributed environment.
By analyzing reports from read/write quorums of nodes associated with a configuration, automatic
recovery for data partitions can be facilitated. Moreover, a configuration manager component
tracks current configurations for replication units and determines whether a reconfiguration is
required (e.g., due to node failures, node recovery, replica additions/deletions, replica moves, or
replica role changes, and the like.) Reconfigurations of data activated as being replicated from an
old configuration to being replicated on a new configuration may be performed in a transactionally
consistent manner based on dynamic quorums associated with the new configuration and the old
configuration.
Pri. Date 20070816 App. Date 20090729 Pub. Date 20100429

April 2010 USPTO Patent Applications 129


G06F 15/18

Patent applications also belong to this classification and have been already shown:
20100100716 page 13

G06F 15/18: Electric digital data processing Ü Digital computers in


general Ü in which a programme is changed according to experience
gained by the computer itself during a complete run
App. No. 20100094784 Assignee Microsoft Corporation
Title Generalized kernel learning in support vector regression
Abstract A generalized kernel learning system and method for learning a wide variety of kernels for use
in a support vector regression (SVR) technique. Embodiments of the generalized kernel learning
system and method learn nearly any possible kernel, subject to minor constraints. The learned
kernel then is used to obtain a desired function, which is a function that closely fits training data
and has a desired simplicity. Embodiments of the generalized kernel learning method include
inputting the training data, reformulating a and a standard SVM x3b5;-SVR primal formulation for a
single kernel as two reformulated primal cost functions for multiple kernels, and then reformulating
one of the two reformulated primal cost functions as a reformulated dual cost function. A plurality
of different regularizer and kernel combinations is evaluated using the reformulated dual cost
function, and it is determined which regularizer and kernel combination yields the desired function.
Pri. Date 20061016 App. Date 20081013 Pub. Date 20100415

April 2010 USPTO Patent Applications 130


G06F 17/00

Patent applications also belong to this classification and have been already shown:
20100082510 page 43 20100082511 page 43

G06F 15/82: Electric digital data processing Ü Digital computers in


general Ü Architectures of general purpose stored programme computers
Ü data or demand driven
App. No. 20100082759 Assignee Microsoft Corporation
Title Communications grouped as conversations
Abstract Described are embodiments for displaying groups of communications, such as messages, as a
conversation. Conversations are groups of communications that can be traced back as related
to an original communication. The embodiments allow a user to select a conversation mode for
displaying communications, e.g., messages, as conversations. In response to the user’s selection,
embodiments provide for displaying a graphical element associated with a conversation. The
graphical element can be selected to display the messages associated with the conversation.
Additionally, embodiments provide for selecting a conversation and applying actions to the
conversation, resulting in the application of the action to the messages that are associated with
the conversation.
Pri. Date 20080930 App. Date 20080930 Pub. Date 20100401

April 2010 USPTO Patent Applications 131


G06F 17/00

G06F 17/00: Electric digital data processing Ü Digital computing or


data processing equipment or methods, specially adapted for specific
functions
App. No. 20100083094 Assignee MICROSOFT CORPORATION
Title Handling unhandled raster operations in a document conversion
Abstract The conversion of a document of a first format that supports a set of raster operations into a
document of a second format that does not support one or more unhandled raster operations
of the set of raster operations is disclosed. For example, one disclosed embodiment comprises
locating a region in the document of the first format that contains an unhandled raster operation,
rasterizing the region in the document of the first format that contains the unhandled raster
operation to form a rasterized region, and incorporating the rasterized region into the document
of the second format.
Pri. Date 20051117 App. Date 20080926 Pub. Date 20100401

App. No. 20100094800 Assignee Microsoft Corporation


Title Evaluating decision trees on a gpu
Abstract Methods and apparatus for evaluating decision trees on a GPU are described. In an embodiment,
the structure of a decision tree is converted into a 2D x201c;treex201d; array with each row
representing a node in the tree. Each row comprises details of any child nodes and the parameters
which are required to perform the binary test at the node. A pixel shader can then be used to
evaluate the decision tree in parallel for each input data point in an input array by navigating
through rows in the 2D tree array. For each row, data is read from the input array dependent upon
the parameters in the row and the shader moves to another row dependent upon the result of the
binary test. On reaching a row which represents a leaf node, the pixel shader outputs evaluation
results, such as a leaf node index or a probability distribution over classes.
Pri. Date 20081014 App. Date 20081009 Pub. Date 20100415

April 2010 USPTO Patent Applications 132


G06F 17/10

App. No. 20100100808 Assignee Microsoft Corporation


Title Creating search enabled web pages
Abstract The present invention extends to methods, systems, and computer program products for creating
search enabled Web pages. A search engine crawler requests a Web page. A Web server
receives the request and constructs a Web page that includes client-side script configured to
obtain a portion of content at a Web browser. The Web server inserts textual (e.g., HTML)
hinting data for the client-side script into the Web page. When analyzed at the search engine, the
textual hinting data provides similar analysis results to analysis results obtained from analyzing
the portion of content that is to be obtained at through execution of the client-side script. Thus,
the Web server can provide the search engine with information to sufficiently index the Web page
even when the search engine lacks the capability to execute the client-side script.
Pri. Date 20061010 App. Date 20091222 Pub. Date 20100422

April 2010 USPTO Patent Applications 133


G06F 17/14

Patent applications also belong to this classification and have been already shown:
20100083098 page 113 20100094900 page 39 20100106744 page 40

G06F 17/10: Electric digital data processing Ü Digital computing or


data processing equipment or methods, specially adapted for specific
functions Ü Complex mathematical operations
App. No. 20100082606 Assignee Microsoft Corporation
Title Directly optimizing evaluation measures in learning to rank
Abstract The present invention provides methods for improving a ranking model. In one embodiment, a
method includes the step of obtaining queries, documents, and document labels. The process
then initializes active sets using the document labels, wherein two active sets are established
for each query, a perfect active set and an imperfect active set. Then, the process optimizes
an empirical loss function by the use of the first and second active set, whereby parameters of
the ranking model are modified in accordance to the empirical loss function. The method then
updates the active sets with additional ranking data, wherein the updates are configured to work
in conjunction with the optimized loss function and modified ranking model. The recalculated
active sets provide an indication for ranking the documents in a way that is more consistent with
the document metadata.
Pri. Date 20080922 App. Date 20080924 Pub. Date 20100401

G06F 17/14: Electric digital data processing Ü Digital computing or


data processing equipment or methods, specially adapted for specific
functions Ü Complex mathematical operations Ü Fourier, Walsh or analogous
domain transformations
App. No. 20100088356 Assignee MICROSOFT CORPORATION
Title Fast computation of general fourier transforms on graphics processing units
Abstract Described is a technology for use with general discrete Fourier transforms (DFTs) performed on
a graphics processing unit (GPU). The technology is implemented in a general library accessed
through GPU-independent APIs. The library handles complex and real data of any size, including
for non-power-of-two data sizes. In one implementation, the radix-2 Stockham formulation of the
fast Fourier transform (FFT) is used to avoid computationally expensive bit reversals. For non-
power of two data sizes, a Bluestein z-chirp algorithm may be used.
Pri. Date 20061130 App. Date 20081003 Pub. Date 20100408

April 2010 USPTO Patent Applications 134


G06F 17/24

Patent applications also belong to this classification and have been already shown:
20100106758 page 95

G06F 17/24: Electric digital data processing Ü Digital computing or


data processing equipment or methods, specially adapted for specific
functions Ü Handling natural language data Ü Text processing Ü Editing,
e.g. insert/delete
App. No. 20100083103 Assignee Microsoft Corporation
Title Phrase generation using part(s) of a suggested phrase
Abstract Real-time query expansion (RTQE) is a process of supplementing an original query with addition
terms or expansion choices that are ranked according to some figure of merit and presented while
users are still formulating their queries. As disclosed herein, phrases may be presented and one
or more terms of a focused-on phrase may be pinned (as desirable to the user). Subsequent
lists may be presented as a function of pinned terms and/or user input. In one embodiment, a
placeholder may be substituted for one or more pinned terms if less than some predetermined
threshold of phrases is able to be presented based upon the pinned terms and/or user input, and
another list of phrases may be presented as a function of a query using fewer than all the pinned
terms. The placeholder may allow out-of-index phrases to be formed, for example, based upon
two or more phrases and/or terms input by the user.
Pri. Date 20080930 App. Date 20081001 Pub. Date 20100401

April 2010 USPTO Patent Applications 135


G06F 17/24

App. No. 20100100743 Assignee Microsoft Corporation


Title Natural visualization and routing of digital signatures
Abstract Embodiments are provided for securely visualizing and routing digital signatures in an electronic
document generated by an application program executing on a computer system. The application
program may generate an electronic document for receiving a signature graphic, and calculate a
hash value from the electronic document and the signature graphic, and create a cryptographic
signature from the hash value using a cryptographic encryption method. The electronic document
is digitally signed by embedding the cryptographic signature therein. The application program may
further collect and route digital signatures by automatically collecting signatures from individual
signers, one-by-one, and identify the appropriate signature line for each signer to sign. The
application program may further generate a user interface for creating and collecting digital
signatures.
Pri. Date 20070322 App. Date 20081017 Pub. Date 20100422

April 2010 USPTO Patent Applications 136


G06F 17/27

G06F 17/27: Electric digital data processing Ü Digital computing or


data processing equipment or methods, specially adapted for specific
functions Ü Handling natural language data Ü Automatic analysis, e.g.
parsing, orthograph correction
App. No. 20100080462 Assignee Microsoft Corporation
Title Letter model and character bigram based language model for handwriting recognition
Abstract A handwriting recognition system is described that includes a language model with scoring to
improve recognition accuracy, such as for words outside of a selected language model. The
handwriting recognition system increases the accuracy of handwriting recognizers that perform
segmentation of ink into atomic elements (segments) and then classify each ink segment
separately. After segmentation, a shape classifier estimates the class (letter) probabilities for
each segment of ink by producing a corresponding score. The system applies the language
model scoring to the shape classification results and typically selects the class with the highest
score as the recognition result. Because the language model is not too restrictive, it works well for
recognizing any word, even those that would not be in a dictionary for the current language. Thus,
the handwriting recognition system produces better recognition results and can often recognize
words that dictionary-based language models would not recognize correctly.
Pri. Date 20080930 App. Date 20080929 Pub. Date 20100401

April 2010 USPTO Patent Applications 137


G06F 17/28

App. No. 20100106486 Assignee Microsoft Corporation


Title Image-based semantic distance
Abstract Image-based semantic distance technique embodiments are presented that involve establishing
a measure of an image-based semantic distance between semantic concepts. Generally, this
entails respectively computing a semantic concept representation for each concept based on
a collection of images associated with the concept. A degree of difference is then computed
between two semantic concept representations to produce the aforementioned semantic distance
measure for the pair of corresponding concepts.
Pri. Date 20071009 App. Date 20081219 Pub. Date 20100429

G06F 17/28: Electric digital data processing Ü Digital computing or


data processing equipment or methods, specially adapted for specific
functions Ü Handling natural language data Ü Processing or translating
of natural language
App. No. 20100082324 Assignee MICROSOFT CORPORATION
Title Replacing terms in machine translation
Abstract A system described herein includes a receiver component that receives an output translation
from a machine translation system, wherein the output translation is in a target language and is
based at least in part upon an input to the machine translation system in a source language, and
wherein the input to the machine translation system includes a first term in the source language
and the output translation includes a second term in the target language that corresponds to
the first term. The system additionally includes a replacer component in communication with the
receiver component that accesses a dictionary of term correspondences, wherein the dictionary
of term correspondences includes an indication that the input first term in the source language is
desirably translated to a third term in the target language, and wherein the replacer component
is configured to automatically replace the second term with the third term to modify the output
translation.
Pri. Date 20080929 App. Date 20080930 Pub. Date 20100401

April 2010 USPTO Patent Applications 138


G06F 17/30

App. No. 20100106484 Assignee MICROSOFT CORPORATION


Title Named entity transliteration using corporate corpra
Abstract A document in a first language and an additional document in a second language may be
reviewed. It may be determined if the additional document is sufficiently similar to the document.
If the additional document is determined sufficiently similar to the document, a named entity in the
document may be selected. The method may search for a similar named entity by comparing the
named entity to a word in the additional document and determining if the named entity and word
are sufficiently similar. If a similar word to the named entity is located, the named entity and the
similar named entities may be stored as name entity transliterations.
Pri. Date 20071009 App. Date 20081021 Pub. Date 20100429

April 2010 USPTO Patent Applications 139


G06F 17/30

G06F 17/30: Electric digital data processing Ü Digital computing or


data processing equipment or methods, specially adapted for specific
functions Ü Information retrieval
App. No. 20100082512 Assignee Microsoft Corporation
Title Analyzing data and providing recommendations
Abstract Aspects of the subject matter described herein relate to analyzing data and providing
recommendations regarding computing assets. In aspects, data is collected from computing
assets and aggregated in a data repository. A data analyzer analyzes the data to determine
problems associated with the computing assets. Work done to identify a problem with one
computing asset may be used to identify problems with or provide recommendations for other
computing assets controlled by the same or different entities. When a problem is identified in a
computing asset, a recommendation may be proactively provided to an entity associated with the
computing asset.
Pri. Date 20080926 App. Date 20080929 Pub. Date 20100401

App. No. 20100082534 Assignee MICROSOFT CORPORATION


Title Method and system of managing conflicts for a set of synchronized folders
Abstract Generally, the described system and process enables resolution of conflicts in a synchronized
folder. Within the described mesh operating environment, each of the devices may be configured
to do the same processing so that the file system view of the synchronized folder looks the same
on all devices (pending local capabilities). Updates that cannot be immediately realized to the local
store due to conflicts may be deferred for later attempts when, for example, additional updates at
the system level or local level are made to resolve or eliminate the conflict for the update item.
Generally, further changes may be propagated by a user in addressing a particular conflict that
the user is notified about (e.g., via a selected winner that the user disagrees with). Alternatively,
the conflict may resolve itself when a further update occurs that overrides or renders moot the
previous update (e.g., a deleted item having a modified enclosure, where the enclosure had a
previous concurrency conflict).
Pri. Date 20070427 App. Date 20080930 Pub. Date 20100401

April 2010 USPTO Patent Applications 140


G06F 17/30

April 2010 USPTO Patent Applications 141


G06F 17/30

App. No. 20100082546 Assignee Microsoft Corporation


Title Storage tiers for database server system
Abstract A technique is described for storing data from a database across a plurality of data storage
devices, wherein each data storage device is capable of being accessed only by a corresponding
computer system in a group of interconnected computer systems. In accordance with the
technique, an identifier of the database is received. An identifier of a storage tier instance is
also received, wherein the storage tier instance comprises a logical representation of one or
more storage locations within each of the data storage devices. Responsive to the receipt of the
identifier of the database and the identifier of the storage tier instance, data from the database is
stored in two or more of the storage locations logically represented by the storage tier instance,
wherein each of the two or more storage locations in which data is stored is within a corresponding
one of the data storage devices.
Pri. Date 20080930 App. Date 20080930 Pub. Date 20100401

April 2010 USPTO Patent Applications 142


G06F 17/30

App. No. 20100082548 Assignee MICROSOFT CORPORATION


Title Flexible electronic records management
Abstract This disclosure describes techniques of managing electronic documents as electronic records
that do not require moving the electronic documents to a different repository. As described
herein, an electronic document is stored at a first repository prior to a time when the electronic
document is declared to be an electronic record. An administrator is able to configure a document
management system (DMS) to manage the electronic document as an electronic record after the
electronic document is declared to be an electronic record. In addition, the administrator is able
to configure the DMS to store a copy of the electronic document at a second repository after
the electronic document is declared to be an electronic record and to manage the copy of the
electronic document as an electronic record.
Pri. Date 20080930 App. Date 20080929 Pub. Date 20100401

App. No. 20100082549 Assignee Microsoft Corporation


Title Data-tier application component fabric management
Abstract Systems and methods for managing database applications are disclosed. A system includes a
fabric that identifies a set of data-tier application components. Each of the data-tier application
components includes a logical representation of a collection of database elements. The fabric
identifies a set of database runtime resources hosting the set of data-tier application components,
and the fabric identifies computing resources used by the set of database runtime resources to
host the set of data-tier application components. The system also includes a management point
to receive a fabric policy. One or more actions of the fabric policy are automatically applied to
affected entities identified by the fabric to bring fabric elements into compliance with the fabric
policy.
Pri. Date 20080930 App. Date 20080930 Pub. Date 20100401

April 2010 USPTO Patent Applications 143


G06F 17/30

App. No. 20100082551 Assignee MICROSOFT CORPORATION


Title Data placement transparency for high availability and load balancing
Abstract A method of updating a clone data map associated with a plurality of nodes of a computer system
is disclosed. The clone data map includes node identification data and clone location data. A node
failure event of a failed node of the computer system that supports a primary clone is detected.
The clone data map is updated such that a secondary clone stored at a node other than the failed
node is marked as a new primary clone. In addition, clone data maps may be used to perform
node load balancing by placing a substantially similar number of primary clones on each node of
a node cluster or may be used to increase or decrease a number of nodes of the node cluster.
Further, data fragments that have a heavy usage or a large fragment size may be reduced in size
by performing one or more data fragment split operations.
Pri. Date 20080930 App. Date 20080926 Pub. Date 20100401

April 2010 USPTO Patent Applications 144


G06F 17/30

App. No. 20100082566 Assignee MICROSOFT CORPORATION


Title Evaluating the ranking quality of a ranked list
Abstract The ranking quality of a ranked list may be evaluated. In an example embodiment, a method
is implemented by a system to access log data, ascertain which entries of a ranked list are
skipped, and determine a ranking quality metric from the skipped entries. More specifically, log
data that reflects user interactions with a ranked list having multiple entries is accessed. The user
interactions include at least indications of which of the multiple entries are selected entries. It is
ascertained which entries of the multiple entries of the ranked list are skipped entries based on
the selected entries. The ranking quality metric for the ranked list is determined responsive to the
skipped entries.
Pri. Date 20080925 App. Date 20081001 Pub. Date 20100401

April 2010 USPTO Patent Applications 145


G06F 17/30

App. No. 20100082573 Assignee MICROSOFT CORPORATION


Title Deep-content indexing and consolidation
Abstract Methods in computer-readable media for searching a large volume of documents is provided. In
embodiments, the plurality of related documents are consolidated by a web host into a synthetic
search document. The synthetic search document includes a set of descriptive information
for each web page consolidated into the synthetic search document. Each set of descriptive
information is associated with a subpart identifier that includes information that allows a search
engine to provide a link to navigate to an individual document. Web pages consolidated into a
synthetic search document may be edited to include an indication that that web page is not to
be individually searched or indexed by a search engine. Similarly, the synthetic search document
may be designated as a synthetic search document by information included on it.
Pri. Date 20080925 App. Date 20080923 Pub. Date 20100401

App. No. 20100082582 Assignee MICROSOFT CORPORATION


Title Combining log-based rankers and document-based rankers for searching
Abstract Log-based rankers and document-based rankers may be combined for searching. In an example
embodiment, there is a method for combining rankers to perform a search operation. A count of
query instances in log data is ascertained based on a query. A search for the query is performed
to produce a set of search results. The set of search results is ranked by relevance score
with a document-based ranker and a log-based ranker using a weighting factor that is adapted
responsive to the count of the query instances in the log data.
Pri. Date 20080925 App. Date 20081001 Pub. Date 20100401

April 2010 USPTO Patent Applications 146


G06F 17/30

App. No. 20100082604 Assignee MICROSOFT CORPORATION


Title Automatic search query suggestions with search result suggestions from user history
Abstract Suggested search results are provided with suggested search queries as a user incrementally
enters characters of a search query. At each incremental user input, a query portion is received
and suggested search queries are identified based on the query portion. Suggested search
results associated with the suggested search queries are also identified. These suggested
search results enable direct navigation to web sites associated with the search results. In some
embodiments, a user’s search history is analyzed to identify search results selected by the user
for the suggested search queries. In other embodiments, search histories for a group of users
associated with the user are analyzed to identify the suggested search results to provide with the
suggested search queries.
Pri. Date 20080922 App. Date 20080922 Pub. Date 20100401

April 2010 USPTO Patent Applications 147


G06F 17/30

App. No. 20100082612 Assignee MICROSOFT CORPORATION


Title Determining relevance between an image and its location
Abstract Method for determining a relevance between an image and information pertaining to the image,
including receiving information about a geographical region, displaying the image related to the
geographical region, receiving an estimated location information of the image, and determining
the relevance between the image and the information based on the estimated location information.
Pri. Date 20080922 App. Date 20080924 Pub. Date 20100401

App. No. 20100082613 Assignee Microsoft Corporation


Title Optimizing ranking of documents using continuous conditional random fields
Abstract The present invention provides an improved method for ranking documents using a ranking model.
One embodiment employs Continuous Conditional Random Fields (CRF) as a model, which is a
conditional probability distribution representing a mapping relationship from retrieved documents
to their ranking scores. The model can naturally utilize features of the content information of
documents as well as the relation information between documents for global ranking. The present
invention also provides a learning algorithm for creating Continuous CRF. Also provided, the
invention introduces Pseudo Relevance Feedback and Topic Distillation.
Pri. Date 20080922 App. Date 20080922 Pub. Date 20100401

April 2010 USPTO Patent Applications 148


G06F 17/30

App. No. 20100082617 Assignee Microsoft Corporation


Title Pair-wise ranking model for information retrieval
Abstract The present invention provides techniques for generating data that is used for ranking documents.
In one embodiment, a method involves the step of extracting data features from a number of
documents to be ranked. The data features extracted from the documents are established in
conjunction with a first feature map and a second feature map, wherein the first feature map
and the second feature map are capable of keeping the relative ordering between two document
instances. In one embodiment, the two feature maps are specially a divide feature map and a
minus feature map. Once the data is mapped, the method involves the step of generating pairwise
preferences from the first feature map and the second feature map. Then the pairwise preferences
are aggregated into a total order, which can be used to produce one or more relevancy scores.
Pri. Date 20080930 App. Date 20080924 Pub. Date 20100401

App. No. 20100082639 Assignee Microsoft Corporation


Title Processing maximum likelihood for listwise rankings
Abstract The present invention introduces a new approach to learning systems. More specifically, the
present invention provides learned methods for optimize ranking models. In one aspect of the
present invention, an objective function is defined as the likelihood of ground truth based on a
Luce model. In another aspect, techniques of the present invention provide a way of representing
different kinds of ground truths as a constraint set of permutations. In yet another aspect of
the present invention, techniques of the present invention provide a way of learning the model
parameter by maximizing the likelihood of the ground truth.
Pri. Date 20081001 App. Date 20080930 Pub. Date 20100401

April 2010 USPTO Patent Applications 149


G06F 17/30

App. No. 20100082646 Assignee MICROSOFT CORPORATION


Title Tracking constraints and dependencies across mapping layers
Abstract Techniques for object relational mapping (ORM) are provided. A dependency graph generator
receives a combination of object level custom commands and store level dynamic commands.
Each store level dynamic command is generated from at least one object level dynamic command.
An identifier is assigned to each entity present in the object level custom commands and the object
level dynamic commands. A store level dynamic command includes any identifiers assigned
in the corresponding object level dynamic command(s). The dependency graph generator is
configured to generate a dependency graph that includes nodes and at least one edge coupled
between a corresponding pair of nodes. Each node is associated with a corresponding store level
dynamic command or an object level custom command. An edge is configured according to an
identifier associated with the corresponding pair of nodes and a dependency between commands
associated with the corresponding pair of nodes.
Pri. Date 20081001 App. Date 20080926 Pub. Date 20100401

April 2010 USPTO Patent Applications 150


G06F 17/30

App. No. 20100082649 Assignee Microsoft Corporation


Title Automatic search suggestions from server-side user history
Abstract Suggested search queries are provided to a user as search assistance while a user is entering a
search query but before the user submits a completed search query for a search to be performed.
The suggested search queries are selected and ordered based on the user’s personal search
history stored server-side as well as other information available to the search engine. When a
query portion is received while a user is entering a search query, previously submitted search
queries are selected from the user’s search history as suggested search queries. The suggested
search queries are selected and/or ranked based on the user’s search history and/or other
information available to the search engine.
Pri. Date 20080930 App. Date 20080922 Pub. Date 20100401

April 2010 USPTO Patent Applications 151


G06F 17/30

App. No. 20100082657 Assignee Microsoft Corporation


Title Generating synonyms based on query log data
Abstract An approach is described for generating synonyms to supplement at least one information item,
such as, in one case, a set of related items. The approach can involve an expansion phase, a
clean-up phase, and a reduction phase. In the expansion phase, the approach identifies, for each
related item, a set of initial synonym candidates. In the clean-up phase, the approach removes
noise from the set of initial synonym candidates (if such noise exists), to provide a set of filtered
synonym candidate items. In the reduction phase, the approach ranks and applies a threshold
(or thresholds) to the set of filtered synonym candidate items, to generate, for each information
item, a set of selected synonyms. The approach uses query log data as at various points in its
operation. The selected synonyms can be used to improve the effectiveness of user searches.
Pri. Date 20080930 App. Date 20080923 Pub. Date 20100401

April 2010 USPTO Patent Applications 152


G06F 17/30

App. No. 20100082704 Assignee MICROSOFT CORPORATION


Title Real-time kd-tree construction on graphics hardware
Abstract Described is a technology for constructing kd-trees on GPUs, in a manner that is sufficiently
fast to achieve real-time performance by exploiting GPU-bsaed parallelism during the kd-tree
construction. Tree nodes are built in breadth-first search order, e.g., to use a thread for each node
at each level. For large nodes at upper tree levels, computations are parallelized over geometric
primitives (instead of nodes). To this end, large nodes are split into child nodes by cutting off
empty space based until an empty space ratio is achieved, and thereafter performing spatial
splitting. Small nodes are split based on split candidate costs, e.g., computed by a surface area
heuristic or a voxel volume heuristic (VVH).
Pri. Date 20080925 App. Date 20080930 Pub. Date 20100401

App. No. 20100083375 Assignee MICROSOFT CORPORATION


Title Detection accuracy tuning for security
Abstract Aspects of the subject matter described herein relate to tuning detection components of a security
system. In aspects, a history of alerts is collected. This history is then used together with
knowledge about tunable objects of the system to determine parameters of the tunable objects
that can be changed to improve detection of the system. Parameters of tunable objects are
adjusted in a simulator that determines an effect on alerts in the history based on the adjusted
parameters. A recommendation of one or more tuning actions may be provided together with
information regarding the effect of each tuning action.
Pri. Date 20080930 App. Date 20080926 Pub. Date 20100401

April 2010 USPTO Patent Applications 153


G06F 17/30

App. No. 20100088274 Assignee MICROSOFT CORPORATION


Title System and method for synchronizing a repository with a declarative defintion
Abstract The subject disclosure relates to a method and system for synchronizing a repository with a
declarative definition. The method and system includes receiving the declarative definition in
which the declarative definition represents a constraint-based execution model. A script is also
created that translates the declarative definition into machine code. At least one function is then
performed on the repository in which the script provides instructions for the at least one function.
Pri. Date 20050929 App. Date 20081022 Pub. Date 20100408

April 2010 USPTO Patent Applications 154


G06F 17/30

App. No. 20100088283 Assignee MICROSOFT CORPORATION


Title System and method for managing database applications
Abstract The subject disclosure relates to a method and system for managing a database application. The
method and system include receiving a deployment package, which includes deployed objects
of a declarative execution model and defining a plurality of data structures extracted from the
deployment package such that at least one data structure populates an extended catalog. The
deployed objects are then stored in a manner consistent with the plurality of data structures.
Pri. Date 20081006 App. Date 20081027 Pub. Date 20100408

App. No. 20100088289 Assignee Microsoft Corporation


Title Transitioning clone data maps and synchronizing with a data query
Abstract Methods, systems, and computer-readable media are disclosed for transitioning clones and clone
data access maps in response to node or media failure without blocking queries. In a system, a
data request interface is configured to receive a query to access data at a storage device. Data
management logic is configured to access clone state information of a plurality of clones including
clones in a static state and clones in a transitory state. The data management logic is further
configured to process the query to access the data according to the dynamic clone data access
map, with functional correctness maintained.
Pri. Date 20081003 App. Date 20080925 Pub. Date 20100408

April 2010 USPTO Patent Applications 155


G06F 17/30

App. No. 20100088297 Assignee MICROSOFT CORPORATION


Title Packaging and bulk transfer of files and metadata for synchronization
Abstract An arrangement for packaging and transferring files such as content items and metadata in
synchronization operations. Files are packaged in a concatenated fashion in order to optimize
usage of the transfer channel, while maintaining an ability to keep track of how many files have
been transferred. Metadata associated with the files may be sent in a single package in advance
of sending the files. The metadata may be compressed using both a custom mechanism that
takes into account predictable commonalities inherent in metadata for multimedia files, as well as
standard compression techniques.
Pri. Date 20081003 App. Date 20081003 Pub. Date 20100408

April 2010 USPTO Patent Applications 156


G06F 17/30

April 2010 USPTO Patent Applications 157


G06F 17/30

App. No. 20100088303 Assignee MICROSOFT CORPORATION


Title Mining new words from a query log for input method editors
Abstract Described is a technology in which new words (including a phrase or set of Chinese characters)
are mined from a query log. The new words may be added to (or otherwise supplement) an IME
dictionary. A set of candidate queries may be selected from the log based upon market (e.g.,
the Chinese market) and/or by language. From this set, various filtering steps are performed to
locate only new words that are frequently in used. For example, only frequent queries are kept for
further processing, which may include filtering out queries based on length (e.g., less than two or
greater than eight Chinese characters), and/or filtering out queries based on too many stop-words
in the query. Processing may also include filtering out a query that is a substring of a larger query,
or Vice-versa. Also described is Pinyin-based clustering and filtering, and filtering out queries
already handled in the dictionary.
Pri. Date 20081003 App. Date 20081003 Pub. Date 20100408

App. No. 20100088309 Assignee MICROSOFT CORPORATION


Title Efficient large-scale joining for querying of column based data encoded structures
Abstract The subject disclosure relates to querying of column based data encoded structures enabling
efficient query processing over large scale data storage, and more specifically, with respect to
join operations. Initially, a compact structure is received that represents the data according to
a column based organization, and various compression and data packing techniques, already
enabling a highly efficient and fast query response in real-time. On top of already fast querying
enabled by the compact column oriented structure, a scalable, fast algorithm is provided for query
processing in memory, which constructs an auxiliary data structure, also column-oriented, for
use in join operations, which further leverages characteristics of in-memory data processing and
access, as well as the column-oriented characteristics of the compact data structure.
Pri. Date 20081002 App. Date 20081215 Pub. Date 20100408

April 2010 USPTO Patent Applications 158


G06F 17/30

April 2010 USPTO Patent Applications 159


G06F 17/30

App. No. 20100088315 Assignee MICROSOFT CORPORATION


Title Efficient large-scale filtering and/or sorting for querying of column based data encoded structures
Abstract The subject disclosure relates to querying of column based data encoded structures enabling
efficient query processing over large scale data storage, and more specifically with respect to
complex queries implicating filter and/or sort operations for data over a defined window. In this
regard, in various embodiments, a method is provided that avoids scenarios involving expensive
sorting of a high percentage of, or all, rows, either by not sorting any rows at all, or by sorting only
a very small number of rows consistent with or smaller than a number of rows associated with the
size of the requested window over the data. In one embodiment, this is achieved by splitting an
external query request into two different internal sub-requests, a first one that computes statistics
about distribution of rows for any specified WHERE clauses and ORDER BY columns, and a
second one that selects only the rows that match the window based on the statistics.
Pri. Date 20081002 App. Date 20090130 Pub. Date 20100408

April 2010 USPTO Patent Applications 160


G06F 17/30

April 2010 USPTO Patent Applications 161


G06F 17/30

April 2010 USPTO Patent Applications 162


G06F 17/30

App. No. 20100088325 Assignee Microsoft Corporation


Title Streaming queries
Abstract The described implementations relate to recursive streaming queries. One technique processes
a recursive streaming query through a query graph. The technique also detects when output
produced by executing the query graph advances to a specific point.
Pri. Date 20061006 App. Date 20081007 Pub. Date 20100408

April 2010 USPTO Patent Applications 163


G06F 17/30

App. No. 20100088331 Assignee MICROSOFT CORPORATION


Title Domain expertise determination
Abstract A user’s domain expertise may be estimated through several factors by monitoring different
aspects of a user’s interaction with a web browser. Based on the user’s domain expertise, search
results may be presented to the user that is commensurate with their expertise, resulting in a
more efficient and productive on line session. A user’s expertise in a knowledge domain may
be determined from the user’s behavior, including analyzing search queries, monitoring how the
user navigates between and through websites, and analyzing the specific cites visited. As a user
interacts with a browser, the user’s estimated domain expertise may be updated and used to
provide appropriate and useful search results. In many embodiments, a user may have different
expertise levels for different technical domains.
Pri. Date 20081008 App. Date 20081006 Pub. Date 20100408

App. No. 20100088342 Assignee MICROSOFT CORPORATION


Title Incremental feature indexing for scalable location recognition
Abstract Described is a technology in which an image retrieval system is updated incrementally as new
image data becomes available. Updating is incrementally performed and only triggered when the
new image data is large enough or diverse enough relative to the image data currently in use for
image retrieval. Incremental updating updates the leaf nodes of a vocabulary tree based upon
the new image data. Each leaf node’s feature frequency is evaluated against upper and/or lower
threshold values, to modify the nodes of the tree based on the feature frequency. Upon completion
of the incremental updating, a server that performed the incremental updating is switched to an
active state with respect to handling client queries for image retrieval, and another server that was
actively handling client queries is switched to an inactive state, awaiting a subsequent incremental
updating before switching back to active
Pri. Date 20080829 App. Date 20081004 Pub. Date 20100408

April 2010 USPTO Patent Applications 164


G06F 17/30

App. No. 20100088350 Assignee MICROSOFT CORPORATION


Title Packaging system to facilitate declarative model-driven development
Abstract The subject disclosure relates to a method and system for packaging a post-processed definition
of a programming module. Contents of a constraint-based and/or order-independent execution
model are received, in which the contents include a declarative source code. The contents are
stored into an extensible storage abstraction such that the source code is stored in a declarative
format. Metadata describing attributes of the contents stored in the extensible storage abstraction
is also defined. A file is then created, which includes the extensible storage abstraction and the
metadata.
Pri. Date 20081003 App. Date 20081022 Pub. Date 20100408

April 2010 USPTO Patent Applications 165


G06F 17/30

App. No. 20100088661 Assignee MICROSOFT CORPORATION


Title Type system for declarative data scripting language
Abstract An efficient, logical and expressive type system is provided for flexibly defining types of a
declarative programming language so that efficient and structurally compact data intensive
applications can be generated. The type system supports the combination of refinement types
and type membership expressions, as well as a top type that encompasses all valid values as
members. With the type system, types can be expressed as intersections and/or unions of other
types. Thus, types can be efficiently represented for a full range of types of data as may be found
in real world data stores.
Pri. Date 20081002 App. Date 20081003 Pub. Date 20100408

April 2010 USPTO Patent Applications 166


G06F 17/30

App. No. 20100094809 Assignee MICROSOFT CORPORATION


Title Techniques to manage retention policy tags
Abstract Techniques to manage retention policy tags are described. A system may comprise a tagging
component operative to tag a message with an expiration tag to form an expiration tagged
message, the expiration tag having expiration information used to expire the expiration tagged
message in accordance with a retention policy. The system may further comprise a presentation
component communicatively coupled to the tagging component, the presentation component
operative to present a view of the expiration tagged message with an expiration field having the
expiration information for the expiration tagged message. Other embodiments are described and
claimed.
Pri. Date 20061208 App. Date 20080925 Pub. Date 20100415

App. No. 20100094906 Assignee Microsoft Corporation


Title Modular forest automata
Abstract Modular forest automata (MFA) provide a unified description of partially-ordered regular
tree patterns. MFAs provide simple methods for determinization, sub-typing, intersection,
and complementation of these patterns. MFAs support high-performance pattern analysis
and matching. Modular forest transducers, in conjunction with modular forest automata,
enable compilers to place semantic actions on any state transition while supporting efficient
transformation of labeled, directed graphs.
Pri. Date 20080918 App. Date 20080930 Pub. Date 20100415

April 2010 USPTO Patent Applications 167


G06F 17/30

App. No. 20100094912 Assignee Microsoft Corporation


Title Preserving user intention in distributed data systems
Abstract The present invention extends to methods, systems, and computer program products for
preserving user intention in distributed data systems. Embodiments of the invention preserve
user intention when different copies of the same data are independently edited at different
locations. User intent can be preserved without centralized locking or other coordination. Thus,
modifications to each copy of the date are appropriately reflected in all other copies of the data
such that all copies end up in essentially the same state. Embodiments of the invention can be
used in collaborative editing and data replication systems.
Pri. Date 20030312 App. Date 20081015 Pub. Date 20100415

April 2010 USPTO Patent Applications 168


G06F 17/30

App. No. 20100100416 Assignee Microsoft Corporation


Title Recommender system
Abstract A recommender system may be used to predict a user behavior that a user will give in relation
to an item. In an embodiment such predictions are used to enable items to be recommended
to users. For example, products may be recommended to customers, potential friends may
be recommended to users of a social networking tool, organizations may be recommended to
automated users or other items may be recommended to users. In an embodiment a memory
stores a data structure specifying a bi-linear collaborative filtering model of user behaviors. In
the embodiment an automated inference process may be applied to the data structure in order
to predict a user behavior given information about a user and information about an item. For
example, the user information comprises user features as well as a unique user identifier.
Pri. Date 20081016 App. Date 20081017 Pub. Date 20100422

April 2010 USPTO Patent Applications 169


G06F 17/30

App. No. 20100100527 Assignee MICROSOFT CORPORATION


Title Forgetting items with knowledge based synchronization
Abstract Systems and methods that enable removal of data from an endpoint, while not propagating such
removal to other endpoints when synchronizing data sources associated therewith. A designation
component can indicate items as forgotten items, wherein such items are being known to an
endpoint and deleted therefromx2014;yet, reintroduced therein and reappearing (e.g., as a create)
upon re-synchronizing with the replica over again. Moreover, the forgotten items can employ
additional metadata such as in from of an additional bit that indicates whether an item is a forgotten
item.
Pri. Date 20061023 App. Date 20081021 Pub. Date 20100422

April 2010 USPTO Patent Applications 170


G06F 17/30

App. No. 20100100564 Assignee MICROSOFT CORPORATION


Title System and method for spam identification
Abstract A system and method are provided for improving a user search experience by identifying spam
results in a result set produced in response to a query. The system may include a user interface
spam feedback mechanism for allowing a user to indicate that a given result is spam. The
system may additionally include an automated spam identification mechanism for implementing
automated techniques on the given result to determine whether the given result is spam. The
system may further include a merging component for merging the determinations of the user
interface spam feedback mechanism and the automated spam identification mechanism for
deriving an indicator of the likelihood that a given result is spam.
Pri. Date 20070330 App. Date 20091224 Pub. Date 20100422

App. No. 20100106684 Assignee Microsoft Corporation


Title Synchronization of a conceptual model via model extensions
Abstract A method of synchronizing data between multiple endpoints each storing a copy of the data
in accordance with different underlying schemas. An application model that provides a logical
representation of an underlying schema is extended with a synchronization model that provides
a logical representation of changes made to the data. The synchronization model comprises
functions that provide synchronization information on the changes in a common format. Using
such synchronization information, changes in a copy of the data stored in a first underlying
schema on a first endpoints are applied to another copy of the data stored in a second underlying
schema on a second endpoint in synchronization relationship with the first endpoint.
Pri. Date 20081023 App. Date 20090819 Pub. Date 20100429

April 2010 USPTO Patent Applications 171


G06F 17/30

App. No. 20100106695 Assignee MICROSOFT CORPORATION


Title Scalable blob storage integrated with scalable structured storage
Abstract Embodiments of the present invention relate to systems, methods and computer storage media for
facilitating the structured storage of binary large objects (Blobs) to be accessed by an application
program being executed by a computing device. Generally, the structured storage of Blobs
includes a primary structured storage index for indexing Blobs, a secondary hash index that is
integrated into the structured storage system, a Blob log stream, and a Blob data stream for
storing blocks that include the Blob data. In an embodiment, a block is created and written to
a Blob store along with a block list. The block list facilitates the locating of one or more blocks
that store the Blob data. In this embodiment, a primary structured storage index and a secondary
hash index are updated to facilitate efficient access of the Blob in a structured storage system.
Pri. Date 20070315 App. Date 20081024 Pub. Date 20100429

April 2010 USPTO Patent Applications 172


G06F 17/30

App. No. 20100106753 Assignee Microsoft Corporation


Title Cyclic commit transaction protocol
Abstract A cyclic commit protocol is used to store relationships between transactions and is used by the
technology to determine whether a transaction is committed or not. The protocol allows creation
of a cycle of transactions which can be used to recover the state of a storage device after a host
failure by identifying the last committed version of intention records as committed or uncommitted
based on the data stored in the physical pages.
Pri. Date 20081024 App. Date 20081024 Pub. Date 20100429

April 2010 USPTO Patent Applications 173


G06F 19/00

Patent applications also belong to this classification and have been already shown:
20100082510 page 43 20100082511 page 43 20100082550 page 105
20100082577 page 44 20100082606 page 134 20100082614 page 44
20100082661 page 45 20100082662 page 24 20100082683 page 46
20100082703 page 46 20100083155 page 26 20100083285 page 77
20100088267 page 38 20100088295 page 47 20100088300 page 48
20100088647 page 28 20100094831 page 48 20100094900 page 39
20100094915 page 30 20100094939 page 119 20100100838 page 31
20100106571 page 49 20100106678 page 50 20100106732 page 39
20100106734 page 51 20100106744 page 40 20100106934 page 100
20100107104 page 34

April 2010 USPTO Patent Applications 174


G06F 19/00

G06F 19/00: Electric digital data processing Ü Digital computing or


data processing equipment or methods, specially adapted for specific
applications
App. No. 20100106426 Assignee Microsoft Corporation
Title Regions of interest processing
Abstract After prepared biological samples have been submitted to liquid-chromatography/mass
spectrometry equipment, digital images are produced that show variations. Some of these
variations may be of interest while others are not of interest. Variations in regions of interest can be
correlated and correlation scores produced to classify biological features aid in scientific discovery.
Shape properties of variations can also be calculated by geometric scores. A microalignment
method aids the correlation calculation without resorting to macroalignment.
Pri. Date 20080610 App. Date 20091023 Pub. Date 20100429

April 2010 USPTO Patent Applications 175


G06F 19/00

April 2010 USPTO Patent Applications 176


G06F 19/00

April 2010 USPTO Patent Applications 177


G06F 21/00

G06F 21/00: Electric digital data processing Ü Security arrangements


for protecting computers or computer systems against unauthorised
activity
App. No. 20100082989 Assignee Microsoft Corporation
Title Storing composite services on untrusted hosts
Abstract A method of storing a composite service on an untrusted host without enabling the untrusted
host to access resources called by the composite service is described. In an embodiment, the
delegator provides a delegatee with credentials to enable verification of the composite service
and to enable access to the resources. The credential which is provided to enable access to
the resources may be a credential which can be used to decrypt access credentials for each of
the resources. These access credentials are stored in encrypted form in a credential store. The
delegatee downloads the composite service and the encrypted access credentials and executes
the composite service once it has been verified.
Pri. Date 20080930 App. Date 20080926 Pub. Date 20100401

April 2010 USPTO Patent Applications 178


G06F 21/00

App. No. 20100088738 Assignee Microsoft Corporation


Title Global object access auditing
Abstract Global object access auditing techniques are described. In an implementation, a global SACL for
a resource and an object SACL are merged to form a merged SACL responsive to a request for
access to an object. The merged SACL is checked to determine what activity is to generate an
audit event.
Pri. Date 20081002 App. Date 20081002 Pub. Date 20100408

April 2010 USPTO Patent Applications 179


G06F 21/00

App. No. 20100088759 Assignee MICROSOFT CORPORATION


Title Device-side inline pattern matching and policy enforcement
Abstract Inline pattern matching and policy enforcement may be implemented by a memory storage
device. In an example embodiment, a device-implemented method includes acts of receiving,
intercepting, and performing and conditional acts of invoking or permitting. A request from a host
to perform a memory access operation is received at a memory storage device. Data flowing
between an I/O channel and physical storage of the memory storage device is intercepted. A
pattern matching procedure is performed on the data with reference to multiple target patterns in
real-time while the data is being intercepted. If a pattern match is detected between the data
and a target pattern, a policy enforcement mechanism is invoked. If a pattern match is not
detected between the data and the multiple target patterns, the request from the host to perform
the memory access operation is permitted.
Pri. Date 20081006 App. Date 20081003 Pub. Date 20100408

April 2010 USPTO Patent Applications 180


G06F 21/00

App. No. 20100095374 Assignee MICROSOFT CORPORATION


Title Graph based bot-user detection
Abstract Computer implemented methods are disclosed for detecting bot-user groups that send spam
email over a web-based email service. Embodiments of the present system employ a two-prong
approach to detecting bot-user groups. The first prong employs a historical-based approach for
detecting anomalous changes in user account information, such as aggressive bot-user signups.
The second prong of the present system entails constructing a large user-user relationship graph,
which identifies bot-user sub-graphs through finding tightly connected subgraph components.
Pri. Date 20081009 App. Date 20081010 Pub. Date 20100415

April 2010 USPTO Patent Applications 181


G06F 21/00

App. No. 20100100943 Assignee Microsoft Corporation One Microsoft Way


Title Permissions using a namespace
Abstract Permissions using a namespace is described. In an embodiment, a namespace system includes a
network resource that has a resource permission, and includes a namespace that has one or more
members associated with the namespace. The namespace system also includes a namespace
permission to permission the network resource to one or more of the members of the namespace.
Pri. Date 20081022 App. Date 20091216 Pub. Date 20100422

April 2010 USPTO Patent Applications 182


G06F 21/00

App. No. 20100100945 Assignee Microsoft Corporation


Title User authentication management
Abstract End users of a multi-factor authentication service can utilize an account management service,
and third-party website can register to utilize the multi-factor authentication service. Registering a
third-party website can comprise the multi-factor authentication service receiving a valid digital
identity certificate for the third-party website, and receiving an agreement to terms of use of
the multi-factor authentication service for the third-party website. Once received, the multi-
factor authentication service can enable the third-party website to utilize the service (e.g., switch
the service on, or send an authorization key to the third-party website). Further, registering a
user to the multi-factor authentication service can comprise determining availability of service,
and providing a location-specific access code. Additionally, registering the user can comprise
registering the user’s mobile device, for example, to provide multi-factor authentication. Also, an
Internet-based user account management user interface can be provided that allows a user to
view transactions on their account, and an ability to shut off a designated mobile device’s ability
to authenticate.
Pri. Date 20081022 App. Date 20081020 Pub. Date 20100422

App. No. 20100107213 Assignee Microsoft Corporation


Title Access control state determination based on security policy and secondary access control state
Abstract In accordance with one or more aspects, a current security policy for accessing a device or volume
of a computing device is identified. A secondary access control state for the device or volume is
also identified. An access state for the device is determined based on both the current security
policy and the secondary access control state.
Pri. Date 20081024 App. Date 20081023 Pub. Date 20100429

April 2010 USPTO Patent Applications 183


G06F 21/00

App. No. 20100107219 Assignee Microsoft Corporation


Title Authentication - circles of trust
Abstract Within a surface computing environment users are provided a seamless and intuitive manner of
modifying security levels associated with information. If a modification is to be made the user
can perceive the modifications and the result of such modifications, such as on a display. When
information is rendered within the surface computing environment and a condition changes, the
user can quickly have that information concealed in order to mitigate unauthorized access to the
information.
Pri. Date 20080804 App. Date 20090226 Pub. Date 20100429

April 2010 USPTO Patent Applications 184


G06F 21/00

App. No. 20100107240 Assignee Microsoft Corporation


Title Network location determination for direct access networks
Abstract A client computer that supports different behaviors when connected to a private network behind
a network firewall than when outside the network firewall and connected indirectly through an
access device. The client computer is configured to attempt communication with a device on the
network. Based on the response, the client computer can determine that it is behind the network
firewall, and therefore can operate with less restrictive security or settings for other parameters
appropriate for when the client is directly connected to the network. Alternatively, the client
computer may determine that it is indirectly connected to the network through the Internet or
other outside network, and therefore, because it is outside the private network firewall, should
operate with more restrictive security or settings of other parameters more appropriate for use in
that network location. The described approach operates even if the remote client computer has a
direct connection to the network that enables it to authenticate with a domain controller.
Pri. Date 20070808 App. Date 20090122 Pub. Date 20100429

April 2010 USPTO Patent Applications 185


G06K 07/10

Patent applications also belong to this classification and have been already shown:
20100083375 page 153 20100088380 page 115

G06F 21/22: Electric digital data processing Ü Security arrangements


for protecting computers or computer systems against unauthorised
activity Ü by restricting access to, or manipulation of, programmes or
processes
Patent applications also belong to this classification and have been already shown:
20100088759 page 180

G06K 07/10: Recognition of data Ü Methods or arrangements for sensing


record carriers Ü by electromagnetic radiation, e.g. optical sensing
App. No. 20100080493 Assignee Microsoft Corporation
Title Associating optical character recognition text data with source images
Abstract A system and method for associating optical character recognition text data with source images
are provided. In one embodiment, an association module of a computing system is configured to
receive text data from an OCR engine; associate the text data with a source image; and output
associated optical character recognition data including the source image, the text data associated
with the source image, and a plurality of referrers. Each referrer of the plurality of referrers may
indicate a different image reference. The plurality of referrers are configured to cause the viewer
application to output the text data associated with the source image to each instance of the source
image that is rendered as part of the fixed-layout document in accordance with the multiple image
references.
Pri. Date 20080926 App. Date 20080929 Pub. Date 20100401

April 2010 USPTO Patent Applications 186


G06K 09/00

App. No. 20100084470 Assignee Microsoft Corporation


Title Two-dimensional barcode localization for camera based devices
Abstract Described is a technology in which a two-dimensional barcode symbol (e.g., a QR Codexae;) is
located within an image by looking for angular signatures that indicate a high density of generally
vertical and/or horizontal angles. An image is divided into blocks of pixels. Angles are associated
with each pixel, forming an angular signature for the block based on how many pixels are
associated with each angle. The angular signatures indicate which blocks have pixels associated
with mostly generally vertical and/or horizontal angles. A region with the largest number of blocks
having such angular signatures is determined, and a bounding box for the barcode symbol grown
from that region block by evaluating nearby blocks to find the outermost blocks that contain the
barcode symbol.
Pri. Date 20081003 App. Date 20081003 Pub. Date 20100408

G06K 09/00: Recognition of data Ü Methods or arrangements for reading


or recognising printed or written characters or for recognising patterns,
e.g. fingerprints
App. No. 20100104153 Assignee Microsoft Corporation
Title Iterative processing
Abstract A regional redefiner redefines a bounding area in sets of chromatographic/mass spectroscopic
images. The redefiner defines and localizes peaks in the images which point to a common feature
of interest. A redefined bounding area locates other peaks associated with the feature of interest.
Peaks can be iteratively identified and extracted using constituent images or a composite image
formed as a combination of a set of constituent images.
Pri. Date 20080924 App. Date 20091023 Pub. Date 20100429

April 2010 USPTO Patent Applications 187


G06K 09/00

April 2010 USPTO Patent Applications 188


G06K 09/32

App. No. 20100106671 Assignee Microsoft Corporation


Title Comprehensive human computation framework
Abstract Technologies for a human computation framework suitable for answering common sense
questions that are difficult for computers to answer but easy for humans to answer. The
technologies support solving general common sense problems without a priori knowledge of the
problems; support for determining whether an answer is from a bot or human so as to screen out
spurious answers from bots; support for distilling answers collected from human users to ensure
high quality solutions to the questions asked; and support for preventing malicious elements in or
out of the system from attacking other system elements or contaminating the solutions produced
by the system, and preventing users from being compensated without contributing answers.
Pri. Date 20081114 App. Date 20081027 Pub. Date 20100429

Patent applications also belong to this classification and have been already shown:
20100106486 page 138

April 2010 USPTO Patent Applications 189


G06K 09/32

G06K 09/18: Recognition of data Ü Methods or arrangements for reading


or recognising printed or written characters or for recognising patterns,
e.g. fingerprints Ü using printed characters having additional code
marks or containing code marks, e.g. the character being composed
of individual strokes of different shape, each representing a different
code value
Patent applications also belong to this classification and have been already shown:
20100080462 page 137

G06K 09/32: Recognition of data Ü Methods or arrangements for reading


or recognising printed or written characters or for recognising patterns,
e.g. fingerprints Ü Image acquisition Ü Aligning or centering of the
image pick-up or image-field
App. No. 20100080466 Assignee MICROSOFT CORPORATION
Title Smart navigation for 3d maps
Abstract An interest center-point and a start point are created in an image. A potential function is created
where the potential function creates a potential field and guides traversal from the starting point
to the interest center-point. The potential field is adjusted to include a sum of potential fields
directed toward the center-point where each potential field corresponds to an image. Images are
displayed in the potential field at intervals in the traversal from the start point toward the interest
center point.
Pri. Date 20081001 App. Date 20080930 Pub. Date 20100401

App. No. 20100086232 Assignee MICROSOFT CORPORATION


Title Alignment of sharp and blurred images based on blur kernel sparseness
Abstract The alignment of a sharp image of a subject and a blurred image of the same subject is
disclosed. For example, one disclosed embodiment provides a method of determining a series
of trial images. The method comprises applying a corresponding series of coordinate transforms
to the sharp image, the series of coordinate transforms differing with respect to one or more
of a rotational operation and a scaling operation. The method further comprises computing
a series blur kernels corresponding to the series of trial images, each blur kernel mapping a
trial image from the series of trial images to the blurred image. The method further includes
locating a sparsest blur kernel in the series of blur kernels, and identifying one or more of the
rotational operation and the scaling operation of the coordinate transform mapping the trial image
corresponding to the sparsest blur kernel to the blurred image.
Pri. Date 20081008 App. Date 20081003 Pub. Date 20100408

April 2010 USPTO Patent Applications 190


G06K 09/34

G06K 09/34: Recognition of data Ü Methods or arrangements for reading


or recognising printed or written characters or for recognising patterns,
e.g. fingerprints Ü Image acquisition Ü Segmentation of touching or
overlapping patterns in the image field
App. No. 20100086208 Assignee Microsoft Corporation
Title Almost rectangular triangulations
Abstract Triangulating quadrilaterals. A method includes accessing an irregular grid comprising a plurality
of irregular quadrilaterals. A determination is made that each of the irregular quadrilaterals in
the irregular grid is not a concave and is a convex quadrilateral. On a grid basis and as a result
of determining that each of the irregular quadrilaterals in the irregular grid is not a concave and
is a convex quadrilateral, each of the irregular quadrilaterals in the irregular grid is triangulated
to create a triangular mesh by defining diagonals from at least one vertex point of each of the
irregular quadrilaterals in the irregular grid to the diagonally opposed vertex point of the same
irregular quadrilateral. The triangular mesh is stored in a computer readable storage medium that
can be accessed by an application for performing tasks related to data visualization, computer
graphics, computational geometry, etc.
Pri. Date 20080215 App. Date 20081008 Pub. Date 20100408

April 2010 USPTO Patent Applications 191


G06K 09/36

G06K 09/36: Recognition of data Ü Methods or arrangements for reading


or recognising printed or written characters or for recognising patterns,
e.g. fingerprints Ü Image preprocessing, i.e. processing the image
information without deciding about the identity of the image
App. No. 20100080489 Assignee MICROSOFT CORPORATION
Title Hybrid interface for interactively registering images to digital models
Abstract The first image may be displayed adjacent to the second image where the second image is a
three dimensional image. An element may be selected in the first image and a matching element
may be selected in the second image. A selection may be permitted to view a merged view where
the merged view is the first image displayed over the second image by varying the opaqueness
of the images. If the merged view is not acceptable, the method may repeat and if the merged
view is acceptable; the first view onto the second view and the merged view may be stored as a
merged image.
Pri. Date 20080929 App. Date 20080930 Pub. Date 20100401

App. No. 20100086227 Assignee MICROSOFT CORPORATION


Title Image super-resolution using gradient profile prior
Abstract Described is a technology by which a low-resolution image is processed into a high-resolution
image, including by performing processing in the gradient domain. A gradient profile
corresponding to the lower-resolution image is transform into a sharpened image gradient.
A high-resolution gradient profile is estimated from a low-resolution gradient profile, e.g., by
multiplying the low-resolution gradient profile by a transform ratio that is based upon learned
shape parameters, learned sharpness values and a curve distance to an edge pixel along the
gradient profile. The transform ratio is used to transform a low-resolution gradient field to a high-
resolution gradient field. Reconstructing the higher-resolution image is performed by using the
high-resolution gradient field as a gradient domain constraint, e.g., in along with a reconstruction
constraint obtained from image domain data. An energy function is minimized by enforcing
the gradient domain constraint and the reconstruction constraint, e.g., by performing a gradient
descent algorithm.
Pri. Date 20070122 App. Date 20081004 Pub. Date 20100408

April 2010 USPTO Patent Applications 192


G06K 09/46

App. No. 20100092098 Assignee MICROSOFT CORPORATION


Title Reduced dc gain mismatch and dc leakage in overlap transform processing
Abstract In certain embodiments, overlap operators are applied during encoding and/or decoding of
digital media, where the overlap operators have reduced DC gain mismatch and/or DC leakage
between interior overlap operators and overlap operators at the edge and/or corner. In other
embodiments, information indicating a selected tile boundary option for overlap processing can be
encoded and/or decoded. The selected tile boundary option indicates one of a hard tile boundary
option and a soft tile boundary option for processing with overlap operators. Overlap transform
processing can then be applied based at least in part on the selected tile boundary option.
Pri. Date 20081010 App. Date 20090930 Pub. Date 20100415

April 2010 USPTO Patent Applications 193


G06K 09/54

G06K 09/46: Recognition of data Ü Methods or arrangements for reading


or recognising printed or written characters or for recognising patterns,
e.g. fingerprints Ü Image preprocessing, i.e. processing the image
information without deciding about the identity of the image Ü Extraction
of features or characteristics of the image
App. No. 20100086214 Assignee MICROSOFT CORPORATION
Title Face alignment via component-based discriminative search
Abstract Described is a technology in which face alignment data is obtained by processing an image using
a component-based discriminative search algorithm. For each facial component, the search is
guided by an associated directional classifier that determines how to move the facial component
(if at all) to achieve better alignment relative to its corresponding facial component in the image.
Also described is training of the classifiers.
Pri. Date 20081002 App. Date 20081004 Pub. Date 20100408

Patent applications also belong to this classification and have been already shown:
20100080466 page 190 20100082612 page 148

April 2010 USPTO Patent Applications 194


G06K 09/62

G06K 09/54: Recognition of data Ü Methods or arrangements for reading


or recognising printed or written characters or for recognising patterns,
e.g. fingerprints Ü Image preprocessing, i.e. processing the image
information without deciding about the identity of the image Ü Combinations
of preprocessing functions
App. No. 20100080488 Assignee MICROSOFT CORPORATION
Title Fast directional image interpolator with difference projection
Abstract Described is a technology in which a low resolution image is processed into a high-resolution
image, including by a two interpolation passes. In the first pass, missing in-block pixels, which are
the pixels within a block formed by four neighboring original pixels, are given values by gradient
diffusion based upon interpolation of the surrounding original pixels. In the second interpolation
pass, missing on-block pixels, which are the pixels on a block edge formed by two adjacent original
pixels, are given values by gradient diffusion based upon interpolation of the values of those
adjacent original pixels and the previously interpolated values of their adjacent in-block pixels.
Also described is a difference projection process that varies the values of the interpolated pixels
according to a computed difference projection.
Pri. Date 20080929 App. Date 20080930 Pub. Date 20100401

April 2010 USPTO Patent Applications 195


G06N 05/02

G06K 09/62: Recognition of data Ü Methods or arrangements for reading


or recognising printed or written characters or for recognising patterns,
e.g. fingerprints Ü Methods or arrangements for recognition using
electronic means
App. No. 20100080450 Assignee MICROSOFT CORPORATION
Title Classification via semi-riemannian spaces
Abstract Described is using semi-Riemannian geometry in supervised learning to learn a discriminant
subspace for classification, e.g., labeled samples are used to learn the geometry of a semi-
Riemannian submanifold. For a given sample, the K nearest classes of that sample are
determined, along with the nearest samples that are in other classes, and the nearest samples
in that sample’s same class. The distances between these samples are computed, and used
in computing a metric matrix. The metric matrix is used to compute a projection matrix that
corresponds to the discriminant subspace. In online classification, as a new sample is received,
it is projected into a feature space by use of the projection matrix and classified accordingly.
Pri. Date 20080929 App. Date 20080930 Pub. Date 20100401

G06K 09/66: Recognition of data Ü Methods or arrangements for reading


or recognising printed or written characters or for recognising patterns,
e.g. fingerprints Ü Methods or arrangements for recognition using
electronic means Ü using simultaneous comparisons or correlations
of the image signals with a plurality of references, e.g. resistor matrix
Ü references adjustable by an adaptive method, e.g. learning
Patent applications also belong to this classification and have been already shown:
20100082612 page 148

G06N 05/00: Computer systems based on specific computational models


Ü Computer systems utilizing knowledge based models
Patent applications also belong to this classification and have been already shown:
20100106671 page 189

April 2010 USPTO Patent Applications 196


G06N 05/02

G06N 05/02: Computer systems based on specific computational models


Ü Computer systems utilizing knowledge based models Ü Knowledge
representation
App. No. 20100082516 Assignee Microsoft Corporation
Title Modifying a system in response to indications of user frustration
Abstract An illustrative frustration processing system modifies the operation of a target system to improve
its performance. In one case, the frustration processing system receives express indications that
a user is frustrated in the course of interacting with the target system. The frustration processing
system responds to these indications by modifying the operation of the target system to reduce
the likelihood that the user will be frustrated in the future. The frustration processing system can
modify the operation of the target system by applying a policy to the target system. The policy, in
turn, is created using a prediction model. The prediction model predicts when a user is likely to
be frustrated based on the user’s prior indications of frustration.
Pri. Date 20080930 App. Date 20080929 Pub. Date 20100401

App. No. 20100100517 Assignee MICROSOFT CORPORATION


Title Future data event prediction using a generative model
Abstract The prediction of future data events using a generative model is disclosed. One disclosed
embodiment comprises a method of predicting a search engine switch, by first tracking a
sequence of events in a user search. Next, a search engine switch based upon the sequence
of events tracked is predicted. Then, in response to predicting a search engine switch and prior to
the user requesting a search engine switch, an action is taken toward changing a user experience.
Pri. Date 20081020 App. Date 20081021 Pub. Date 20100422

April 2010 USPTO Patent Applications 197


G06N 07/04

App. No. 20100106673 Assignee Microsoft Corporation


Title Certainty factor decay
Abstract Various embodiments provide a way to decrease the certainty of a piece of information. In at
least some embodiments, a certainty factor and a decay rate are associated with the piece of
information. The certainty factor indicates the certainty of a piece of information. As time passes,
the decay rate is applied to the certainty factor to reduce the certainty factor, thereby providing an
indication that the certainty of the information has decreased.
Pri. Date 20081114 App. Date 20081029 Pub. Date 20100429

Patent applications also belong to this classification and have been already shown:
20100082512 page 140 20100088267 page 38 20100088679 page 61

April 2010 USPTO Patent Applications 198


G06Q 10/00

G06N 07/02: Computer systems based on specific computational models


Ü Computer systems based on specific mathematical models Ü using
fuzzy logic
Patent applications also belong to this classification and have been already shown:
20100106673 page 198

G06N 07/04: Computer systems based on specific computational models


Ü Computer systems based on specific mathematical models Ü using
fuzzy logic Ü Physical realisation
Patent applications also belong to this classification and have been already shown:
20100106678 page 50

G06Q 10/00: Data processing systems or methods, specially adapted


for administrative, commercial, financial, managerial, supervisory or
forecasting purposes Ü Administration, e.g. office automation or reservations
App. No. 20100082376 Assignee MICROSOFT CORPORATION
Title Suggesting things to do during time slots in a schedule
Abstract Architecture for suggesting activities to be performed during time slots of a user schedule, such
as a calendar application. In one implementation, a personal activity is suggested for a free time
slot. In another implementation, a personal activity can be suggested for both a free time slot and
a full time slot. The architecture can also apply filtering to generate suggestions based on user
location, preferences (stated or learned), user history, user interaction with content and candidate
activities, targeted advertising, and so on. The filtering can be applied to disparate sources of
activity information to provide relevant activities for suggestion to the user. Revenue models can
be applied as well. The architecture can be deployed as a client/server topology or solely on the
client.
Pri. Date 20070209 App. Date 20080926 Pub. Date 20100401

April 2010 USPTO Patent Applications 199


G06Q 10/00

App. No. 20100082380 Assignee MICROSOFT CORPORATION


Title Modeling and measuring value added networks
Abstract The present invention extends to methods, systems, and computer program products for modeling
and measuring value added networks. Value added networks are modeled in accordance
with a structured data model that defines data formats for business capability attributes. The
structured data model can include a capability modeling schema having data format definitions
that define how business capability attributes are to be represented. Value added networks can
also be mapped such that users can visualize and navigate a value added network. A pre-
defined resource vocabulary is utilized to assist in determining if a business capability change
is worthwhile. The pre-defined resource vocabulary provides a mechanism for a plurality of
participants in a value added network to consider business capability changes in a uniform,
repeatable, and consistent manner.
Pri. Date 20070209 App. Date 20080930 Pub. Date 20100401

April 2010 USPTO Patent Applications 200


G06Q 10/00

App. No. 20100082381 Assignee Microsoft Corporation


Title Linking organizational strategies to performing capabilities
Abstract The present invention extends to methods, systems, and computer program products for linking
organizational strategies to performing capabilities. Embodiments of the invention include
determining what impact proposed capability changes in an initiative/program/project for an
organizational strategy have on the organizational strategy’s performance. Schema-based
representations of organizational strategies and initiatives are used to provide a common
vocabulary for describing changes to organizational strategies. Proposed changes can be
evaluated against an impact/value contribution curve, potentially on an ongoing basis, to
determine their benefit. Corrective action can be taken when operations/tactics are trend outside
of specified metrics
Pri. Date 20070209 App. Date 20080930 Pub. Date 20100401

April 2010 USPTO Patent Applications 201


G06Q 10/00

App. No. 20100088234 Assignee MICROSOFT CORPORATION


Title Unified analytics across a distributed computing services infrastructure
Abstract Methods and systems for providing unified analytics across a distributed computing services
infrastructure are disclosed. Embodiments include providing an application identifier for an
application created by a developer and, during an execution of the application, collecting and
storing analytic data with an association with the application identifier and an authenticated
developer identifier. Other embodiments may include collecting and storing analytic data with the
association further including an authenticated user identifier and/or a device identifier for a device
of a user-defined group or mesh. Access mechanisms, report generation, and billing based on
the analytic data and associated application identifier are also disclosed. The disclosed methods
and systems allow for unified reporting and correlation of analytic data across multiple services of
a distributed computing services infrastructure.
Pri. Date 20011214 App. Date 20081003 Pub. Date 20100408

App. No. 20100088715 Assignee Microsoft Corporation


Title Content promotion to anonymous clients
Abstract Techniques involving anonymous content promotion are described. In an implementation, content,
which may include one or more advertisements embedded by a content provider, is promoted
to clients who anonymously indicate behaviors. A client may generate behavior data matching
behaviors of the client to unique codes. The client communicates the behavior data having the
matched behaviors/unique codes anonymously to a network operator. A network operator collects
behavior data from multiple clients. The network operator associates unique codes corresponding
to a behavior to content to promote the content to clients who anonymously indicate the behavior
through the unique codes in the behavior data. The network operator may output a promotion
having the associated unique codes to multiple clients to enable each client to identify its own
unique codes and obtain corresponding content recommendations and/or content.
Pri. Date 20030523 App. Date 20081002 Pub. Date 20100408

April 2010 USPTO Patent Applications 202


G06Q 30/00

Patent applications also belong to this classification and have been already shown:
20100082803 page 125

G06Q 30/00: Data processing systems or methods, specially adapted


for administrative, commercial, financial, managerial, supervisory or
forecasting purposes Ü Commerce, e.g. marketing, shopping, billing,
auctions or e-commerce
App. No. 20100088185 Assignee MICROSOFT CORPORATION
Title Utilizing extra text message space
Abstract Described is a technology that uses the unused (free) space (that is not occupied by text of
a text message) to encode metadata into the text message. The metadata may correspond
to an advertisement, a sender’s mood, a sender’s location, and the like. The inclusion of an
advertisement can help reduce the user’s cost, while the inclusion of other types of data can
reduce the number of messages that need to be sent, without requiring typing in the information.
The receiving device processes the metadata to determine an action to take, such as to display
an advertisement identified in the metadata, along with the text. The advertisement content may
have been previously downloaded in anticipation of its later display.
Pri. Date 20070314 App. Date 20081003 Pub. Date 20100408

April 2010 USPTO Patent Applications 203


G06Q 50/00

App. No. 20100100429 Assignee Microsoft Corporation


Title Systems and methods for using world-space coordinates of ad objects and camera information
for adverstising within a vitrtual environment
Abstract An ad system for use in a virtual environment. The ad system includes an ad engine integrated
in an advertising enabled application, an advertising scheduling system, reporting software,
impression metric processing software, and billing components wherein coordinates of ad object
and camera data were made available to the ad engine during development of the application.
Related methods of developing advertising enabled application software including an ad engine
and use of a computer system for delivering ad content within a virtual environment are also
provided.
Pri. Date 20081016 App. Date 20081017 Pub. Date 20100422

Patent applications also belong to this classification and have been already shown:
20100082397 page 10 20100082440 page 108 20100088234 page 202
20100088715 page 202 20100094939 page 119 20100106571 page 49

G06Q 50/00: Data processing systems or methods, specially adapted


for administrative, commercial, financial, managerial, supervisory or
forecasting purposes Ü Systems or methods specially adapted for a
specific business sector, e.g. health care, utilities, tourism or legal
services
App. No. 20100082372 Assignee MICROSOFT CORPORATION
Title Network-based healthcare data management
Abstract A web- or network-based healthcare management tool is provided. The innovation provides for
a browser-based version of a client that enables clinicians, from remote locations, to securely
review patient data retrieved from a healthcare data store. Remote locations include, but are not
limited to, from outside the hospital (e.g., at home) or from inside the hospital but in an office or
lab that does not have intranet access to the healthcare data store.
Pri. Date 20070209 App. Date 20090515 Pub. Date 20100401

April 2010 USPTO Patent Applications 204


G06Q 90/00

Patent applications also belong to this classification and have been already shown:
20100088715 page 202

April 2010 USPTO Patent Applications 205


G06T 15/00

G06Q 90/00: Data processing systems or methods, specially adapted


for administrative, commercial, financial, managerial, supervisory or
forecasting purposes Ü Systems or methods specially adapted for administrativ
commercial, financial, managerial, supervisory or forecasting purposes,
not involving significant data processing
App. No. 20100088143 Assignee Microsoft Corporation
Title Calendar event scheduling
Abstract The described implementations relate to calendar event scheduling. One system includes a
storage component configured to store scheduling constraints relating to at least one user. The
system also includes a declarative calendar component configured to automatically schedule
declarative calendar events for the at least one user based upon the scheduling constraints.
Pri. Date 20081008 App. Date 20081007 Pub. Date 20100408

G06T 01/00: Image data processing or generation, in general Ü General


purpose image data processing
Patent applications also belong to this classification and have been already shown:
20100088356 page 134

April 2010 USPTO Patent Applications 206


G06T 15/00

G06T 15/00: Image data processing or generation, in general Ü Three


dimensional (3D) image rendering, e.g. from a model to a bit-mapped
image
App. No. 20100085350 Assignee MICROSOFT CORPORATION
Title Oblique display with additional detail
Abstract A method and system of creating an oblique display with additional detail such as texture and
labels is disclosed. The footprint of objects on the image on a digital elevation map may be
determined and an outline of the objects may be determined by creating object polygons that
outline the bounds of the objects. The objects that are visible in the image and the objects that are
occluded are determined using the footprint of the objects and the object polygons. The occluded
object sections may be displayed in a modified form as part of the occluding object. Label display
locations may be evaluated for objects to determine an optimal label display location based on a
label criteria function and labels may be added to the objects in the image at the optimal label
display location.
Pri. Date 20081003 App. Date 20081002 Pub. Date 20100408

App. No. 20100085352 Assignee MICROSOFT CORPORATION


Title Parallel surface reconstruction
Abstract Described is a technology in which point cloud surface reconstruction is performed via parallel
processing on a graphics processing unit, achieving real-time reconstruction rates. An octree
is built for a given set of oriented points, with each node containing a set of points enclosed
by the node. The data structure is built on the GPU, in parallel, using level-order traversals to
process nodes at a same tree level. The surface is reconstructed based on data configured and
located via the traversals. To produce the surface, an implicit function over the volume spanned
by the octree nodes is computed using the GPU, e.g., based on a Poisson surface reconstruction
method. A sparse linear system is built and a multi-grid solver is employed to solve the system.
An adaptive marching cubes procedure is performed on the GPU to extract an isosurface of the
implicit function as a triangular mesh
Pri. Date 20081003 App. Date 20081004 Pub. Date 20100408

April 2010 USPTO Patent Applications 207


G06T 15/20

App. No. 20100085353 Assignee MICROSOFT CORPORATION


Title User-guided surface reconstruction
Abstract Described is a technology by which a user interacts with a surface representative of a point cloud
data to correct for imperfect scan data. The surface is reconstructed based on the interaction.
Real time viewing of the image is facilitated by parallel surface reconstruction. For example, the
user may draw strokes to reduce topological ambiguities in poorly-sampled areas. An algorithm
automatically adds new oriented sample points to the original point cloud based on the user
interaction. Then a new isosurface is generated for the augmented point cloud. The user also
may specify the geometry of missing areas of the surface. The user copies a set of points from
another point cloud, and places the points around the target area. A new isosurface is then
generated.
Pri. Date 20081003 App. Date 20081004 Pub. Date 20100408

April 2010 USPTO Patent Applications 208


G06T 15/50

G06T 15/20: Image data processing or generation, in general Ü Three


dimensional (3D) image rendering, e.g. from a model to a bit-mapped
image Ü Geometric effects Ü Perspective computation
App. No. 20100091021 Assignee MICROSOFT CORPORATION
Title Photo mantel view and animation
Abstract A system and computer-implemented method for rendering images on a two-dimensional display,
such as a computer, handheld device, or television screen, so that the images appear to be
positioned in a three-dimensional space is disclosed. The images may be graphics files or
standard files with an associated thumbnail image. Numerous layouts of the images on the display
are disclosed.
Pri. Date 20081015 App. Date 20091214 Pub. Date 20100415

G06T 15/50: Image data processing or generation, in general Ü Three


dimensional (3D) image rendering, e.g. from a model to a bit-mapped
image Ü Lighting effects, e.g. shading
App. No. 20100079451 Assignee MICROSOFT CORPORATION
Title Ray tracing on graphics hardware using kd-trees
Abstract Described is a technology by which a ray tracer incorporates a GPU-based kd-tree builder for
rendering arbitrary dynamic scenes. For each frame, the ray tracer builds a kd-tree for the scene
geometry. The ray tracer spawns and traces eye rays, reflective and refractive rays, and shadow
rays. For each ray to be traced, the ray tracer walks through the kd-tree until it reaches leaf
nodes and associated triangles. When a ray passes through both sides of a splitting plane, the
x201c;farx201d; sub-tree is pushed into the stack and the x201c;nearx201d; sub-tree is traversed
first.
Pri. Date 20080926 App. Date 20080930 Pub. Date 20100401

April 2010 USPTO Patent Applications 209


G06T 15/60

App. No. 20100085360 Assignee MICROSOFT CORPORATION


Title Rendering in scattering media
Abstract Techniques are described for rendering a volume of scattering media, in particular by computing
radiances of points or voxels in the scattering media. A set of sample points in the scattering media
are found. Radiances of the sample points are computed. Radiance gradients of the sample
points are computed from the radiances. The radiances and gradients are used to interpolate
radiances throughout the scattering media. The set of sample points may be computed in an
iterative dynamic manner in order to concentrate samples near features (e.g., shadow edges) of
the scattering media.
Pri. Date 20070330 App. Date 20081004 Pub. Date 20100408

April 2010 USPTO Patent Applications 210


G06T 15/60

G06T 15/60: Image data processing or generation, in general Ü Three


dimensional (3D) image rendering, e.g. from a model to a bit-mapped
image Ü Lighting effects, e.g. shading Ü Shadowing
App. No. 20100079452 Assignee MICROSOFT CORPORATION
Title Photon mapping on graphics hardware using kd-trees
Abstract Described is a technology by which a GPU-based photon mapping mechanism/algorithm uses a
kd-tree to render arbitrary dynamic scenes. For each frame, the mechanism emits and traces a set
of photons into the scene. When a photon hits a surface, it can either be reflected, transmitted,
or absorbed based on the surface material. Once photon tracing is done, a kd-tree is built for
the stored photons. To estimate the radiance value at an arbitrary surface point, the k-nearest
photons are located and filtered. The photon tracing and photon kd-tree construction, as well
as the radiance estimation using k-nearest neighbor (KNN) searches are performed on graphics
hardware, e.g., a GPU. In one example, only caustic photons are traced, whereby a photon is
terminated and stored once it hits a diffuse surface.
Pri. Date 20080926 App. Date 20080930 Pub. Date 20100401

App. No. 20100085359 Assignee MICROSOFT CORPORATION


Title Surface normal reconstruction from a single image
Abstract The construction of a surface normal map from a single image is disclosed herein. One disclosed
embodiment comprises determining an initial surface map comprising initial surface normals, and
then receiving an input requesting manual modification of a set of normals in the initial surface
map. Lastly, the set of surface normals is modified as requested by the input, to form the surface
normal map.
Pri. Date 20070330 App. Date 20081003 Pub. Date 20100408

April 2010 USPTO Patent Applications 211


G09G 05/00

G06T 15/70: Image data processing or generation, in general Ü Three


dimensional (3D) image rendering, e.g. from a model to a bit-mapped
image Ü Animation effects
App. No. 20100082345 Assignee MICROSOFT CORPORATION
Title Speech and text driven hmm-based body animation synthesis
Abstract An x201c;Animation Synthesizerx201d; uses trainable probabilistic models, such as Hidden
Markov Models (HMM), Artificial Neural Networks (ANN), etc., to provide speech and text driven
body animation synthesis. Probabilistic models are trained using synchronized motion and speech
inputs (e.g., live or recorded audio/video feeds) at various speech levels, such as sentences,
phrases, words, phonemes, sub-phonemes, etc., depending upon the available data, and the
motion type or body part being modeled. The Animation Synthesizer then uses the trainable
probabilistic model for selecting animation trajectories for one or more different body parts
(e.g., face, head, hands, arms, etc.) based on an arbitrary text and/or speech input. These
animation trajectories are then used to synthesize a sequence of animations for digital avatars,
cartoon characters, computer generated anthropomorphic persons or creatures, actual motions
for physical robots, etc., that are synchronized with a speech output corresponding to the text
and/or speech input.
Pri. Date 20080930 App. Date 20080926 Pub. Date 20100401

G06T 17/00: Image data processing or generation, in general Ü Three


dimensional (3D) modelling, e.g. data description of 3D objects
Patent applications also belong to this classification and have been already shown:
20100079451 page 209 20100079452 page 211

April 2010 USPTO Patent Applications 212


G09G 05/00

G09G 05/00: Arrangements or circuits for control of indicating devices


using static means to present variable information Ü Control arrangements
or circuits for visual indicators common to cathode-ray tube indicators
and other visual indicators
App. No. 20100079498 Assignee Microsoft Corporation
Title Multi-modal interaction for a screen magnifier
Abstract A multi-model magnification system is described that can be used with multiple forms of input,
including natural input such as touch-based devices. Users can zoom in/out and pan with their
preferred mode of interaction, including mouse, keyboard, pen, and touch interactions. The
system provides dedicated features for some modes, such as pinch/scroll gestures for touch input,
that allow users to easily zoom in/out and pan the magnified area (e.g., on a touch laptop). The
system provides an interactive panning mode in which the user the user can interact with the
desktop or applications (e.g., clicking on icons) and pan using special gestures. When the system
is in the panning mode, the system consumes received gestures or other input, otherwise the
system passes received input to a magnified application.
Pri. Date 20050630 App. Date 20080926 Pub. Date 20100401

App. No. 20100085371 Assignee MICROSOFT CORPORATION


Title Optimal 2d texturing from multiple images
Abstract One or more images of an object are obtained. These are then warped onto the object. The
object may be divided into sites where sites are overlapping circular regions of the object. For
each site, a neighborhood graph may be created where each site is a node in the graph and each
pair of sites with overlapping regions is connected by an edge. A list of covers of each site may
be created where the list contains all the possible labels for that node. Each image that covers
part of the site may be reviewed including all possible shifts up to some number of pixels. A cost
may be assigned to each cover and costs for each of the covers may be calculated. The cover
with the lowest cost may be selected. If the costs are too high, the resolution may be lowered,
one or more possible covers may be selected and then the analysis may be performed using the
selected covers at a higher resolution.
Pri. Date 20081007 App. Date 20081002 Pub. Date 20100408

April 2010 USPTO Patent Applications 213


G09G 05/10

App. No. 20100085383 Assignee MICROSOFT CORPORATION


Title Rendering annotations for images
Abstract Techniques are described for rendering annotations associated with an image. A view of an image
maybe shown on a display, and different portions of the image are displayed and undisplayed in
the view according to panning and/or zooming of the image within the view. The image may have
annotations. An annotation may have a location in the image and may have associated renderable
media. The location of the annotation relative to the view may change according to the panning
and/or zooming. A strength of the annotation may be computed, the strength changing based the
panning and/or zooming of the image. The media may be rendered according to the strength.
Whether to render the media may be determined by comparing the strength to a threshold.
Pri. Date 20070424 App. Date 20081006 Pub. Date 20100408

Patent applications also belong to this classification and have been already shown:
20100079369 page 20 20100080462 page 137

April 2010 USPTO Patent Applications 214


G09G 05/36

G09G 05/10: Arrangements or circuits for control of indicating devices


using static means to present variable information Ü Control arrangements
or circuits for visual indicators common to cathode-ray tube indicators
and other visual indicators Ü Intensity circuits
App. No. 20100103186 Assignee MICROSOFT CORPORATION
Title Enhanced user interface elements in ambient light
Abstract Enhanced user interface elements in ambient light is described. In embodiment(s), a sensor input
can be received from light sensor(s) that detect ambient light proximate an integrated display of
a portable device. A determination can be made that the ambient light detracts from the visibility
of user interface elements displayed in a user interface on the integrated display, and graphic
components of a user interface element can be modified to enhance the visibility of the user
interface element for display in the ambient light.
Pri. Date 20070329 App. Date 20081024 Pub. Date 20100429

G09G 05/36: Arrangements or circuits for control of indicating devices


using static means to present variable information Ü Control arrangements
or circuits for visual indicators common to cathode-ray tube indicators
and other visual indicators Ü characterised by the display of individual
graphic patterns using a bit-mapped memory
App. No. 20100079474 Assignee MICROSOFT CORPORATION
Title Methods for rendering source content of a file for display on a destination figure
Abstract A method for rendering source content of a file for display in a destination figure is provided.
The method may include receiving the source content of the file including a brush that defines
a viewbox having a first coordinate system, composing a viewport having a second coordinate
system to which a brush transform is applied, creating an empty destination bitmap sized
according to a destination figure transform, and rendering the source content onto the empty
destination bitmap such that the first coordinate system is transformed into the second coordinate
system.
Pri. Date 20081001 App. Date 20080930 Pub. Date 20100401

April 2010 USPTO Patent Applications 215


G10L 15/18

App. No. 20100079485 Assignee MICROSOFT CORPORATION


Title Compensating for anticipated movement of a device
Abstract Anticipating movement of a display device and compensating for the anticipated movement. As
a user performs an activity while viewing the device, the device experiences movement. The
movement is compared to pattern data associated with profiles. One of the profiles is selected
based on the comparison. Based at least on compensation data associated with the profile, image
data for display on the device is modified to compensate for the anticipated movement. In some
embodiments, the image data is shifted horizontally and/or vertically relative to a display area of
the device in the opposite direction of the anticipated movement.
Pri. Date 20080926 App. Date 20080926 Pub. Date 20100401

G10L 13/00: Speech analysis or synthesis Ü Speech synthesis


Patent applications also belong to this classification and have been already shown:
20100082345 page 212

April 2010 USPTO Patent Applications 216


G10L 15/26

G10L 13/08: Speech analysis or synthesis Ü Speech synthesis Ü Text


analysis or generation of parameters for speech synthesis out of text,
e.g. grapheme to phoneme translation, prosody generation or stress or
intonation determination
Patent applications also belong to this classification and have been already shown:
20100082345 page 212

G10L 15/18: Speech analysis or synthesis Ü Speech recognition Ü


Speech classification or search Ü using natural language modelling
App. No. 20100082343 Assignee Microsoft Corporation
Title Sequential speech recognition with two unequal asr systems
Abstract Sequential speech recognition using two unequal automatic speech recognition (ASR) systems
may be provided. The system may provide two sets of vocabulary data. A determination may be
made as to whether entries in one set of vocabulary data are likely to be confused with entries
in the other set of vocabulary data. If confusion is likely, a decoy entry from one set of the
vocabulary data may be placed in the other set of vocabulary data to ensure more efficient and
accurate speech recognition processing may take place.
Pri. Date 20080930 App. Date 20080929 Pub. Date 20100401

App. No. 20100100384 Assignee Microsoft Corporation


Title Speech recognition system with display information
Abstract A language processing system may determine a display form of a spoken word by analyzing
the spoken form using a language model that includes dictionary entries for display forms of
homonyms. The homonyms may include trade names as well as given names and other phrases.
The language processing system may receive spoken language and produce a display form of
the language while displaying the proper form of the homonym. Such a system may be used in
search systems where audio input is converted to a graphical display of a portion of the spoken
input.
Pri. Date 20080222 App. Date 20081021 Pub. Date 20100422

April 2010 USPTO Patent Applications 217


G11B 27/36

G10L 15/26: Speech analysis or synthesis Ü Speech recognition Ü


Speech to text systems
App. No. 20100080365 Assignee Microsoft Corporation
Title Offline voicemail
Abstract A method for accessing offline voicemail messages within a mobile messaging application may
be provided. First, a voice mail message may be received and the voicemail message may be
transcribed to text. Next, the voicemail message and the text transcription may be stored. The
recipient may then be presented with a list of voicemail messages and the voicemail message
may be retrieved in response to the recipient. The recipient may read or listen to the voicemail
message or both. The recipient may also annotate the voicemail message.
Pri. Date 20080926 App. Date 20080929 Pub. Date 20100401

G11B 27/36: Information storage based on relative movement between


record carrier and transducer Ü Editing Ü Monitoring, i.e. supervising
the progress of recording or reproducing
App. No. 20100085853 Assignee MICROSOFT CORPORATION
Title Protecting optical media using random, moving radio frequency scatterers
Abstract The subject innovation relates to systems and/or methodologies for using randomly positioned
electromagnetic scatterers deposited into a predetermined region of an optical storage medium
(e.g., Blue Ray DVD, HD DVD, CD, etc.) as a distinct three dimensional (
Pri. Date 20030416 App. Date 20090203 Pub. Date 20100408

April 2010 USPTO Patent Applications 218


H01H 13/70

H01H 13/70: Electric switches Ü Switches having rectilinearly-movable


operating part or parts adapted for pushing or pulling in one direction
only, e.g. push-button switch Ü having a plurality of operating members
associated with different sets of contacts, e.g. keyboard
App. No. 20100078303 Assignee MICROSOFT CORPORATION
Title Mechanical architecture for display keyboard keys
Abstract Mechanical architecture for providing maximum viewing area on key button tops of keys for a
user input device. The viewing area is for the display of information on the key buttons, and also
includes tactile feedback similar to standard laptop keyboards, all using low cost manufacturing
methods such as injection molding. The architecture optimizes an aperture through the core of
the key switch assembly in order to project an image through the aperture and onto the display
area of the key button. The architecture relocates in at least one embodiment the tactile feedback
mechanism (e.g., dome assembly) out from underneath the key button to the perimeter or side
of the key switch assembly. The architecture finds particular application to input devices such as
keyboards, game pods, data entry device, etc., that operate in combination with an optical surface
(e.g., wedge lens).
Pri. Date 20060329 App. Date 20080929 Pub. Date 20100401

April 2010 USPTO Patent Applications 219


H02J 09/00

April 2010 USPTO Patent Applications 220


H04B 05/00

H02J 09/00: Circuit arrangements or systems for supplying or distributing


electric power Ü Circuit arrangements for emergency or stand-by power
supply, e.g. for emergency lighting
App. No. 20100102633 Assignee MICROSOFT CORPORATION
Title Connection between machines and power source
Abstract Machines may be connected to power distribution units (PDU/STSs) in such a way that if one
PDU/STS fails or is taken out of service, the machines’ loads are shifted more-or-less evenly to the
other PDU/STSs. Several PDU/STSs may be provided for a group of dual-corded machines. The
two cords of each machine are connected to a pair of PDU/STSs. Different pairs of PDU/STSs
may be used for different machines. In normal operation, each machine may draw part of its
power through each of the two cords. If one PDU/STS to which a machine is connected fails or is
taken out of service, the entire load on that machine may be shifted to its remaining cord. Since
redistribution may be approximately even across PDU/STSs, tolerance for one PDU/STS failure
can be implemented with relatively little over-sizing of the PDU/STSs.
Pri. Date 20081028 App. Date 20081028 Pub. Date 20100429

H04B 01/18: Transmission Ü Details of transmission systems, not covered


by a single one of groups Ü Receivers Ü Circuits Ü Input circuits, e.g.
for coupling to an aerial or a transmission line
App. No. 20100081404 Assignee MICROSOFT CORPORATION
Title Obtaining and presenting metadata related to a radio broadcast
Abstract A system and method for presenting content related to a radio broadcast are provided. The
system may include a radio device having a receiver configured to receive a radio signal including
an audio component and digitally encoded data associated with the audio component. The radio
device may further include a decoder configured to decode the digitally encoded data from the
radio signal. The radio device may further include a processor configured to receive the digitally
encoded data from the decoder, extract a data parameter from the digitally encoded data, send
a search query including the data parameter to a content service, and receive from the content
service metadata associated with the data parameter. The system may further include a display
configured to display the metadata received from the content service.
Pri. Date 20070329 App. Date 20080926 Pub. Date 20100401

April 2010 USPTO Patent Applications 221


H04L 09/00

H04B 05/00: Transmission Ü Near-field transmission systems, e.g. inductive


loop type
App. No. 20100093278 Assignee Microsoft Corporation
Title Provisioning of wireless connectivity for devices using nfc
Abstract The claimed subject matter provides a system and/or a method that facilitates connecting a
wireless device to a secure network. A device can establish a near field communication link
with a verified device on a network, wherein the near field communication link can be a secure
and/or encrypted link to provision the device without comprising security constraints within the
network. An installation component can invoke the transfer of provisioning data to the network via
the near filed communication link to secure a wireless connection for the device to the network.
Pri. Date 20070307 App. Date 20091214 Pub. Date 20100415

April 2010 USPTO Patent Applications 222


H04L 09/00

H04L 09/00: Transmission of digital information, e.g. telegraphic communication


Ü Arrangements for secret or secure communication
App. No. 20100082990 Assignee MICROSOFT CORPORATION
Title Establishment of a relationship between wireless devices
Abstract Embodiments related to the establishment of a relationship between wireless devices are
disclosed. In one disclosed embodiment, a wireless device includes an image capture device,
a wireless transmitter and receiver, a logic subsystem, and memory comprising instructions
executable by the logic subsystem to capture a first image via the image capture device, identify
authentication features of the first image, and receive authentication data from a remote media
device via the wireless receiver that comprises authentication features of a second image. The
instruction further cause the logic subsystem to compare the authentication features of the second
image to the authentication features of the first image to establish a trusted relationship with the
remote media device if the authentication features of the second image exhibit a pre-determined
relationship to the authentication features of the first image.
Pri. Date 20080930 App. Date 20080929 Pub. Date 20100401

App. No. 20100095120 Assignee Microsoft Corporation


Title Trusted and confidential remote tpm initialization
Abstract Techniques are provided to allow remote initialization of a Trusted Platform Module. The results
may be trusted and confidential even if the target device has malicious operating system or other
software running.
Pri. Date 20090928 App. Date 20081010 Pub. Date 20100415

App. No. 20100100725 Assignee Microsoft Corporation


Title Providing remote user authentication
Abstract Providing a remote computer user authentication service involves providing a reference to a
user authentication service in a host server’s source code (e.g., website source code). Further,
integration code that may be used in an application programming interface (API) on the host
server for interaction with a user authentication service can be provided. Additionally, a user
interface (UI) for user authentication on the host server, and an authentication-test message
on the host server using the UI may be provided. Also, providing authentication can comprise
sending an authentication-request message to a mobile device designated by the user; and/or
can comprise the user responding with information from the authentication-test message. The
host server can be notified of the user’s authentication after a correct response is received by the
user authentication service.
Pri. Date 20070713 App. Date 20081020 Pub. Date 20100422

April 2010 USPTO Patent Applications 223


H04L 09/00

App. No. 20100100953 Assignee Microsoft Corporation


Title Passthru for client authentication
Abstract This disclosure pertains generally to client authentication. One aspect of the disclosure relates to
a first server for presenting evidence to a Domain Controller (DC) of a first authentication context
being submitted from a client to the first server to obtain a delegable credential, wherein the
credential can be used to request a second authentication context from that client to a second
server. Another aspect relates to the first server providing a pass-thru with evidence to a DC. The
evidence relates to a first authentication context being submitted from a client to the first server
that it obtained a delegable credential. The pass-thru is used in combination with the credential
to request a second authentication context from the client to a second server.
Pri. Date 20081022 App. Date 20091224 Pub. Date 20100422

April 2010 USPTO Patent Applications 224


H04L 09/06

Patent applications also belong to this classification and have been already shown:
20100088234 page 202 20100088523 page 104 20100100743 page 136

H04L 09/06: Transmission of digital information, e.g. telegraphic communication


Ü Arrangements for secret or secure communication Ü the encryption
apparatus using shift registers or memories for blockwise coding, e.g.
D.E.S. systems
App. No. 20100082992 Assignee Microsoft Corporation
Title Cryptographic applications of efficiently evaluating large degree isogenies
Abstract Techniques are disclosed for representing and evaluating large prime degree isogenies for use
in cryptographic signature and encryption schemes. An isogeny of prime degree 1 may be
represented as an ideal in the form (1, A*alpha+B), where 1 comprises the degree of a prime
number, the prime number is split into integers a and b, and alpha is a known endomorphism. For
a given degree 1, integers a and b define a unique isogeny, allowing the isogeny to be stored with
3 log(1) bits of information. Techniques are also disclosed to evaluate the isogeny at a given point
by decomposing the isogeny into an integer and a plurality of smaller degree isogenies, evaluating
the smaller degree isogenies at the point with traditional means, and multiplying the results of the
evaluations together and with the integer.
Pri. Date 20080930 App. Date 20080930 Pub. Date 20100401

April 2010 USPTO Patent Applications 225


H04L 09/06

App. No. 20100086134 Assignee MICROSOFT CORPORATION


Title Full volume encryption in a clustered environment
Abstract Full volume encryption can be applied to volumes in a clustering environment. To simplify the
maintenance of keys relevant to such encrypted volumes, a cluster key table construct can be
utilized, where each entry of the cluster key table corresponds to an encrypted volume and
comprises an identification of the encrypted volume and a key needed to access that volume.
Keys can be protected by encrypting them with a key specific to each computing device storing
the cluster key table. Updates can be propagated among the computing devices in the cluster
by first decrypting the keys and then reencrypting them with a key specific to each computing
device as they are stored on those computing devices. Access control requirements can also
be added to the entries in the cluster key table. Alternative access control requirements can be
accommodated by assigning multiple independent entries to a single encrypted volume.
Pri. Date 20070320 App. Date 20081003 Pub. Date 20100408

April 2010 USPTO Patent Applications 226


H04L 09/08

App. No. 20100091995 Assignee MICROSOFT CORPORATION


Title Simple protocol for tangible security
Abstract The claimed subject matter provides systems and/or methods that effectuate a simple protocol for
tangible security on mobile devices. The system can include devices that generate sets of keys
and associated secret identifiers, employs the one or more keys to encrypt a secret and utilizes
the identifiers and encryptions of the secret to populate a table associated with a security token
device that is used in conjunction with a mobile device to release sensitive information persisted
on the mobile device for user selected purposes.
Pri. Date 20060901 App. Date 20081013 Pub. Date 20100415

April 2010 USPTO Patent Applications 227


H04L 09/32

H04L 09/08: Transmission of digital information, e.g. telegraphic communication


Ü Arrangements for secret or secure communication Ü the encryption
apparatus using shift registers or memories for blockwise coding, e.g.
D.E.S. systems Ü Key distribution
App. No. 20100082974 Assignee Microsoft Corporation
Title Parallel document processing
Abstract Documents distributed in parallel are processed. One or more digital document packages are
received, where each digital document package includes a content portion and an identity-
verification code (IVC) verifying an identity of a source from which the digital document package
is received. Each IVC may be a private-key encryption of a content-verification code hashed
from the content portion of each digital document package. A master digital document package
is created, which includes a master content portion equivalent to the content portion in each
unmodified digital document package, and one or more different IVCs, each IVC obtained from a
digital document package received from a different source.
Pri. Date 20080926 App. Date 20080926 Pub. Date 20100401

Patent applications also belong to this classification and have been already shown:
20100082989 page 178

H04L 09/28: Transmission of digital information, e.g. telegraphic communication


Ü Arrangements for secret or secure communication Ü using particular
encryption algorithm
Patent applications also belong to this classification and have been already shown:
20100088520 page 118

H04L 09/30: Transmission of digital information, e.g. telegraphic communication


Ü Arrangements for secret or secure communication Ü using particular
encryption algorithm Ü Public key, i.e. encryption algorithm being
computationally infeasible to invert and users’ encryption keys not requiring
secrecy
Patent applications also belong to this classification and have been already shown:
20100082974 page 228 20100082992 page 225

April 2010 USPTO Patent Applications 228


H04L 09/32

H04L 09/32: Transmission of digital information, e.g. telegraphic communication


Ü Arrangements for secret or secure communication Ü including means
for verifying the identity or authority of a user of the system
App. No. 20100082984 Assignee MICROSOFT CORPORATION
Title Protocol-independent remote attestation and sealing
Abstract Messages, including messages in conformance with various protocols, can be hashed and the
hash values added to an event log and provided to a Trusted Platform Module (TPM), which
can extend one or more Platform Configuration Registers (PCRs) with the hash value, much as
it would with the hash of a component that was installed or executed on the computing device
with the TPM. Subsequently, the TPM can sign one or more of the PCRs and the signed PCRs
can be transmitted, together with the event log and a copy of the messages. The recipient
can verify the sender based on the signed PCRs, can confirm that the signed PCRs match the
event log, and can verify the hash of the message in the event log by independently hashing
it. In another embodiment, an intermediate hashing of the message can avoid transmission of
potentially malicious executable instructions within a message.
Pri. Date 20080930 App. Date 20080926 Pub. Date 20100401

App. No. 20100082987 Assignee MICROSOFT CORPORATION


Title Transparent trust validation of an unknown platform
Abstract A transparent trust validation of an unknown platform can be performed by communicationally
coupling it to a trusted device, such as a portable peripheral device carried by a user, or one or
more remote computing devices. Information from the unknown platform can be obtained by boot
code copied to it from the trusted device and such information can be validated by the trusted
device. The trusted device can then provide an encrypted version of decryption key to the boot
code which can request the Trusted Platform Module (TPM) of the unknown platform to decrypt
and return the decryption key. If the information originally obtained from the unknown platform and
validated by the trusted device was authentic, the TPM will be able to provide the decryption key
to the boot code, enabling it to decrypt an encrypted volume comprising applications, operating
systems or other components.
Pri. Date 20080930 App. Date 20080930 Pub. Date 20100401

April 2010 USPTO Patent Applications 229


H04L 09/32

App. No. 20100082998 Assignee Microsoft Corporation


Title Active hip
Abstract Computing services that unwanted entities may wish to access for improper, and potentially illegal,
use can be more effectively protected by using Active HIP systems and methodologies. An Active
HIP involves dynamically swapping one random HIP challenge, e.g., but not limited to, image,
for a second random HIP challenge, e.g., but not limited to, image. An Active HIP can also,
or otherwise, involve stitching together, or otherwise collecting and including, within Active HIP
software, i.e., a HIP web page, to be executed by a computing device of a user seeking access
to a HIP-protected computing service x number of software executables randomly selected from
a pool of y number of software executables. The x number of software executables, when run,
generates a random Active HIP key. If the generated Active HIP key accompanies a correct user
response to the valid HIP challenge the system and/or methodology can assume with a degree of
certainty that the current user is a legitimate human user and allow the current user access to the
requested computing service.
Pri. Date 20080526 App. Date 20080930 Pub. Date 20100401

April 2010 USPTO Patent Applications 230


H04L 09/32

App. No. 20100083363 Assignee Microsoft Corporation


Title Binding activation of network-enabled devices to web-based services
Abstract A method for associating a networked device with an online service is provided. The networked
device may be an appliance or other device that has limited input capabilities, making it difficult
to to download information such as digital media files from an online service without having to
input a significant amount of information using the device or appliance. The method begins by
establishing communication with a service over a network. A claim token is received from the
service over the network. The claim token is returned to the service over the network after the
claim token has been bound to an authorized user of the service. In response to return of the
claim token, a device identifier binds the networked device to an account with the service that is
associated with the authorized user.
Pri. Date 20080929 App. Date 20080926 Pub. Date 20100401

April 2010 USPTO Patent Applications 231


H04L 09/32

App. No. 20100083374 Assignee MICROSOFT CORPORATION


Title Techniques to manage access to organizational information of an entity
Abstract Techniques to manage access to organization information for an entity are described. An
apparatus may include a presentation component operative to present an organizational chart
on a presentation surface. The organizational chart may comprise multiple nodes associated
with members of an organization, and connections between the nodes representing hierarchical
relationships between the nodes. A security component may be communicatively coupled to
the presentation component. The security component may be operative to receive a request to
modify a characteristic of the organizational chart from an operator, access security settings for
the operator, and authorize the operator to modify a characteristic of the organizational chart.
Authorization may be granted, for example, when the operator is a delegate and a permission
level for the delegate allows a modification operation associated with the modify request. Other
embodiments are described and claimed.
Pri. Date 20080930 App. Date 20080930 Pub. Date 20100401

App. No. 20100107218 Assignee MICROSOFT CORPORATION


Title Secured compartment for transactions
Abstract Systems and methods that establish a secured compartment that manages sensitive user
transactions/information on a user’s machine. The secured compartment qualifies user interaction
with the machine, and separates such qualified interaction from other user activity on the machine.
A user is switched to such secured compartment upon occurrence of a predetermined event,
such as in form of an explicit request (e.g., a secure attention sequence); an implicit request
(e.g., inference of user activities); and presence of a peripheral device that is bound to the
secured compartment (e.g., a USB)x2014;wherein such actions typically cannot be generated
by an application running outside the secured compartment.
Pri. Date 20080804 App. Date 20081024 Pub. Date 20100429

April 2010 USPTO Patent Applications 232


H04L 12/26

Patent applications also belong to this classification and have been already shown:
20100082974 page 228 20100082989 page 178 20100088753 page 42
20100088759 page 180 20100100945 page 183 20100100953 page 224
20100107219 page 184

H04L 12/26: Transmission of digital information, e.g. telegraphic communication


Ü Data switching networks Ü Details Ü Monitoring arrangements
App. No. 20100080144 Assignee Microsoft Corporation
Title Resilient 1n first-hop gateway selection mechanism
Abstract Exemplary methods, systems, and computer program products describe selecting a gateway
based on health and performance information of a plurality of gateways. The techniques describe
gateways advertising health and performance information, computing devices creating a table of
this health and performance information, and selecting a gateway using the table. In response to
changes in the health and performance information, the computing device may select a different
gateway. The process allows network traffic load to be distributed across a plurality of gateways.
This process further provides resilience by allowing a plurality of active gateways to substitute for
a non-functioning gateway.
Pri. Date 20080929 App. Date 20080930 Pub. Date 20100401

April 2010 USPTO Patent Applications 233


H04L 12/28

H04L 12/28: Transmission of digital information, e.g. telegraphic communication


Ü Data switching networks Ü characterised by path configuration, e.g.
LAN [Local Area Networks] or WAN [Wide Area Networks]
App. No. 20100085975 Assignee Microsoft Corporation
Title Framework for optimizing and simplifying network communication in close proximity networks
Abstract A framework capable of providing transparent handling of network traffic in close proximity
networks such as home networks is provided. A single virtual network interface is exposed
to users/applications on connected devices. A virtual network interface manager determines
available physical network interfaces and switches to a different physical network interface or
a different configuration on the same physical network interface in a transparent manner to the
communicating application(s). This enables the framework to optimize network communications
for the communicating applications, devices, and users based on predefined criteria, application
requirements such as different data throughput, or changing environment conditions such as
interference. Network communication operations are also simplified for users since they are
no longer required to have the necessary knowledge for configuring physical network interfaces
manually in response to changing conditions.
Pri. Date 20081003 App. Date 20081007 Pub. Date 20100408

April 2010 USPTO Patent Applications 234


H04L 12/28

App. No. 20100098103 Assignee Microsoft Corporation


Title Hybrid tree/mesh overlay for data delivery
Abstract Hybrid tree/mesh overlays for data delivery involve using a tree overlay network and a mesh
overlay network to delivery a data stream via a push mechanism and a pull mechanism,
respectively. In an example embodiment, a network node enters a mesh overlay network and
attaches to a tree overlay network. In operation, the network node receives data blocks of a data
stream over the tree overlay network via a push mechanism. The network node ascertains if a
data block is not received over the tree overlay network. If a data block is missing, the network
node retrieves the missing data block over the mesh overlay network via a pull mechanism. In
another example embodiment, the tree overlay network includes a subset of nodes forming a
tree-based backbone. Network nodes that are identified as being stable may join the backbone
and provide the data stream to other nodes.
Pri. Date 20010704 App. Date 20091218 Pub. Date 20100422

April 2010 USPTO Patent Applications 235


H04L 12/58

H04L 12/56: Transmission of digital information, e.g. telegraphic communication


Ü Data switching networks Ü Stored and forward switching systems Ü
Packet switching systems
App. No. 20100085979 Assignee Microsoft Corporation
Title Models for routing tree selection in peer-to-peer communications
Abstract Peer-to-peer communications sessions involve the transmission of one or more data streams from
a source to a set of receivers that may redistribute portions of the data stream via a set of routing
trees. Achieving a comparatively high, sustainable data rate throughput of the data stream(s) may
be difficult due to the large number of available routing trees, as well as pertinent variations in the
nature of the communications session (e.g., upload communications caps, network link caps, the
presence or absence of helpers, and the full or partial interconnectedness of the network.) The
selection of routing trees may be facilitated through the representation of the node set according
to a linear programming model, such as a primal model or a linear programming dual model,
and iterative processes for applying such models and identifying low-cost routing trees during an
iteration.
Pri. Date 20081003 App. Date 20081008 Pub. Date 20100408

April 2010 USPTO Patent Applications 236


H04M 01/66

H04L 12/58: Transmission of digital information, e.g. telegraphic communication


Ü Data switching networks Ü Stored and forward switching systems Ü
Message switching systems
App. No. 20100087169 Assignee MICROSOFT CORPORATION
Title Threading together messages with multiple common participants
Abstract In a mobile communications device, a conversation identifier is generated for each of a plurality of
messages. Each conversation identifier is generated based on addresses of message participants
identified in the message. A request to display a particular message of the multiple messages is
received. In response to the request, one or more other messages of the plurality of messages
having a same conversation identifier as the particular message are identified based on the
generated conversation identifiers. At least two of the one or more other messages are displayed
concurrently.
Pri. Date 20081002 App. Date 20090609 Pub. Date 20100408

H04M 01/00: Telephonic communication Ü Substation equipment, e.g.


for use by subscribers
Patent applications also belong to this classification and have been already shown:
20100081476 page 21

H04M 01/64: Telephonic communication Ü Substation equipment, e.g.


for use by subscribers Ü Automatic arrangements for answering calls
Patent applications also belong to this classification and have been already shown:
20100080365 page 218

April 2010 USPTO Patent Applications 237


H04M 03/42

H04M 01/66: Telephonic communication Ü Substation equipment, e.g.


for use by subscribers Ü with means for preventing unauthorised or
fraudulent calling
App. No. 20100093310 Assignee Microsoft Corporation
Title Device authentication within deployable computing environment
Abstract A deployable computing environment may facilitate interaction and data sharing between users
and devices. Users, devices, and relationships between the users and devices may be
represented within the deployable computing environment. A relationship between a user and
a device may specify that the device is owned by the user and that the device is authorized to
perform operations within the deployable computing environment on behalf of the user. Secure
authentication of devices and users for interaction within the deployable computing environment
is achieved by authenticating tickets corresponding to the user, the device, and the relationship.
A device identification ticket and a user identification ticket are used to authenticate the device
and user for interaction within the deployable computing environment. A device claim ticket allows
the device to perform delegated operations (e.g., data synchronization, peer connectivity, etc.) on
behalf of the user without the user’s credentials (e.g., user identification ticket).
Pri. Date 20070328 App. Date 20081009 Pub. Date 20100415

April 2010 USPTO Patent Applications 238


H04N 05/225

H04M 03/42: Telephonic communication Ü Automatic or semi-automatic


exchanges Ü Systems providing special services or facilities to subscribers
App. No. 20100098235 Assignee Microsoft Corporation
Title Method and system for forwarding telephone calls based on presence information
Abstract A call forwarding system forwards telephone calls based on presence information of a user as
reported by computing devices associated with a telephone number. When a telephone system
receives an incoming call directed to one of the telephone numbers of the user’s computing
devices, it sends an incoming call event to each computing device. Upon receiving the incoming
call event from a telephone system, each computing device determines whether the user is
most likely present at that computing device based on the presence information. When a
computing device determines that the user is most likely present at that computing device, it
sends a notification to the telephone system to forward the incoming call to the telephone number
associated with that computing device to effect the automatic forwarding of a call based on
presence information.
Pri. Date 20080331 App. Date 20091110 Pub. Date 20100422

April 2010 USPTO Patent Applications 239


H04N 05/93

H04N 05/225: Pictorial communication, e.g. television Ü Details of


television systems Ü Studio circuitry Ü Television cameras
App. No. 20100103269 Assignee Microsoft Corporation
Title Determining orientation in an external reference frame
Abstract Orientation in an external reference is determined. An external-frame acceleration for a device
is determined, the external-frame acceleration being in an external reference frame relative
to the device. An internal-frame acceleration for the device is determined, the internal-frame
acceleration being in an internal reference frame relative to the device. An orientation of the device
is determined based on a comparison between a direction of the external-frame acceleration and
a direction of the internal-frame acceleration.
Pri. Date 20081023 App. Date 20090624 Pub. Date 20100429

H04N 05/445: Pictorial communication, e.g. television Ü Details of


television systems Ü Receiver circuitry Ü for displaying additional information
Patent applications also belong to this classification and have been already shown:
20100088715 page 202

H04N 05/93: Pictorial communication, e.g. television Ü Details of television


systems Ü Television signal recording Ü Television signal processing
therefor Ü Regeneration of the television signal or of selected parts
thereof
App. No. 20100086276 Assignee Microsoft Corporation
Title Movie making techniques
Abstract In an implementation, a plurality of media is collected, each having associated metadata that
describes respective media. A movie is made from the plurality of media having a credit sequence
and a title sequence that are generated automatically and without user intervention from the
metadata.
Pri. Date 20080314 App. Date 20081002 Pub. Date 20100408

April 2010 USPTO Patent Applications 240


H04N 07/14

H04N 07/025: Pictorial communication, e.g. television Ü Television


systems Ü Systems for transmission of digital non-picture data, e.g.
of text during the active part of a television frame
Patent applications also belong to this classification and have been already shown:
20100088715 page 202

H04N 07/12: Pictorial communication, e.g. television Ü Television systems


Ü Systems in which the television signal is transmitted via one channel
or a plurality of parallel channels, the bandwidth of each channel being
less than the bandwidth of the television signal
App. No. 20100080302 Assignee Microsoft Corporation
Title Perceptual mechanism for the selection of residues in video coders
Abstract A perceptual mechanism for residue selection in a video encoder may be provided. The
mechanism may comprise a method, system, or device for receiving video frames comprising
pluralities of pixels. For each video frame, a sensitivity threshold may be determined for each
pixel of a previous video frame. The pixels of the video frame may compared in turn to the pixels
of the previous video frame to determine a residue value. The residue value may be compared to
the sensitivity threshold such that when the residue value is less than the sensitivity threshold, the
pixel data in the video frame may be zeroed out prior to encoding the video frame for transmission.
Pri. Date 20021122 App. Date 20080929 Pub. Date 20100401

April 2010 USPTO Patent Applications 241


H04N 07/15

H04N 07/14: Pictorial communication, e.g. television Ü Television systems


Ü Systems for two-way working
App. No. 20100085416 Assignee Microsoft Corporation
Title Multi-device capture and spatial browsing of conferences
Abstract Multi-device capture and spatial browsing of conferences is described. In one implementation,
a system detects cameras and microphones, such as the webcams on participants’ notebook
computers, in a conference room, group meeting, or table game, and enlists an ad-hoc array of
available devices to capture each participant and the spatial relationships between participants.
A video stream composited from the array is browsable by a user to navigate a 3-dimensional
representation of the meeting. Each participant may be represented by a video pane, a foreground
object, or a 3-D geometric model of the participant’s face or body displayed in spatial relation to
the other participants in a 3-dimensional arrangement analogous to the spatial arrangement of the
meeting. The system may automatically re-orient the 3-dimensional representation as needed
to best show the currently interesting event such as current speaker or may extend navigation
controls to a user for manually viewing selected participants or nuanced interactions between
participants.
Pri. Date 20081008 App. Date 20081006 Pub. Date 20100408

April 2010 USPTO Patent Applications 242


H04N 07/15

H04N 07/15: Pictorial communication, e.g. television Ü Television systems


Ü Systems for two-way working Ü Conference systems
App. No. 20100079575 Assignee Microsoft Corporation
Title Processing aspects of a video scene
Abstract Embodiments are configured to provide video conferencing functionality including using pre-
processing and/or post-processing features to provide a video signal, but the embodiments are
not so limited. In an embodiment, components of a video conferencing system can operate to
provide a video signal based in part on the use of features of a pre-processing component and/or
post-processing component. In one embodiment, a video conference device can include a pre-
processing component and/or post-processing component to that can be used to compensate for
bandwidth constraints associated with a video conferencing environment.
Pri. Date 20070605 App. Date 20080926 Pub. Date 20100401

April 2010 USPTO Patent Applications 243


H04N 07/173

Patent applications also belong to this classification and have been already shown:
20100080302 page 241

H04N 07/16: Pictorial communication, e.g. television Ü Television systems


Ü Secrecy systems
Patent applications also belong to this classification and have been already shown:
20100088715 page 202

H04N 07/173: Pictorial communication, e.g. television Ü Television


systems Ü Secrecy systems Ü with two-way working, e.g. subscriber
sending a programme selection signal
App. No. 20100083324 Assignee Microsoft Corporation
Title Synchronized video playback among multiple users across a network
Abstract Synchronized video playback among multiple users across a network provides a fully social
experience where people in different locations may be enabled to watch the same video in a
x201c;virtual living room.x201d; The users may be represented graphically, as avatars, in front
of the video, and may be enabled to use animations, text chat, and voice chat to interact with
each other. Thus, a group of people may be enabled to share the experience of watching a video
together as if they were in the same room, without being physically present together.
Pri. Date 20080502 App. Date 20080930 Pub. Date 20100401

April 2010 USPTO Patent Applications 244


H04N 09/69

Patent applications also belong to this classification and have been already shown:
20100088715 page 202

H04N 07/26: Pictorial communication, e.g. television Ü Television systems


Ü Systems for the transmission of television signals using pulse code
modulation Ü using bandwidth reduction
App. No. 20100080297 Assignee MICROSOFT CORPORATION
Title Techniques to perform fast motion estimation
Abstract Techniques to perform fast motion estimation are described. An apparatus may comprise a motion
estimator operative to receive as input a current frame and a reference frame from a digital video
sequence. The motion estimator may generate and output a motion vector. The motion vector
may represent a change in position between a current block of the current frame and a matching
reference block of the reference frame. The motion estimator may utilize an enhanced block
matching technique to perform block matching based on stationary and spatially proximate blocks.
Other embodiments are described and claimed.
Pri. Date 20070221 App. Date 20080930 Pub. Date 20100401

April 2010 USPTO Patent Applications 245


H04N 11/02

H04N 09/69: Pictorial communication, e.g. television Ü Details of colour


television systems Ü Circuits for processing colour signals Ü for controlling
the amplitude of colour signals, e.g. automatic chroma control circuits
Ü for modifying the colour signals by gamma correction
App. No. 20100103322 Assignee MICROSOFT CORPORATION
Title Target display for gamma calibration
Abstract User interfaces are provided that allow for the display of a target element that may be used to
adjust a gamma value of a display device. The target element includes three layers. A bottom
static layer is alternating light and dark lines, which in one instance may be black and white lines of
equal height. A gray static layer is solid gray, and overlays some or all of the bottom static layer. A
progressive layer gradually changes from a fully transparent are to an opaque area, and overlays
some or all of the gray static layer. Additionally, a manipulation area is provided, which may be a
sliding mechanism. The user may adjust the gamma to a higher value when the fully transparent
area appears lighter than the opaque area, and may adjust the gamma to a lower value when the
fully transparent area appears darker than the opaque area.
Pri. Date 20081029 App. Date 20081024 Pub. Date 20100429

H04N 11/02: Pictorial communication, e.g. television Ü Colour television


systems Ü with bandwidth reduction
App. No. 20100080287 Assignee Microsoft Corporation
Title Adaptive video processing of an interactive environment
Abstract Embodiments are configured to provide interactive communication functionality including adaptive
video processing functionality that can be used to process aspects of a video signal, but the
embodiments are not so limited. In an embodiment, components of a video conferencing system
can operate to provide a video signal based in part on the use of adaptive processing features
which include scaling and/or other pixel processing features. In one embodiment, components
of an interactive video system can operate to adaptively manage and control video payload
parameters to adapt to various communication conditions associated with a real-time or near-
real time interactive video environment.
Pri. Date 20080926 App. Date 20080926 Pub. Date 20100401

April 2010 USPTO Patent Applications 246


H04N 11/02

App. No. 20100080290 Assignee Microsoft Corporation


Title Fine-grained client-side control of scalable media delivery
Abstract Techniques and tools for adjusting quality and bit rate of multiple chunks of media delivered over
a network are described. For example, each of the multiple chunks is encoded as multiple layers
(e.g., a base layer and multiple embedded residual layers) for fine-grained scalability at different
rate/quality points. A server stores the encoded data for the layers of chunks as well as curve
information that parameterizes rate-distortion curves for the chunks. The server sends the curve
information to a client. For the multiple chunks, the client uses the curve information to determine
rate-distortion preferences for the respective chunks, then sends feedback indicating the rate-
distortion preferences to the server. For each of the multiple chunks, the server, based at least in
part upon the feedback, selects one or more scalable layers of the chunk to deliver to the client.
Pri. Date 20080926 App. Date 20080930 Pub. Date 20100401

April 2010 USPTO Patent Applications 247


H04N 11/04

H04N 11/04: Pictorial communication, e.g. television Ü Colour television


systems Ü using pulse code modulation
App. No. 20100080283 Assignee Microsoft Corporation
Title Processing real-time video
Abstract Real-time video processing functionality may be provided using pre-processing and/or post-
processing features to provide a video signal. Components of a real-time video processing system
may operate to receive a real-time video signal. The real-time video signal may be downscaled
based in part on the use of features of a pre-processing component applying a downscale
polyphase filter that may be used to compensate for bandwidth constraints associated with a real-
time video conferencing environment. The downscaled real-time video may be communicated
across a network, such as the Internet. Upon receipt of the downscaled real-time video, the
downscaled real-time video may be upscaled based in part on the use of features of a post-
processing component applying an upscale polyphase filter.
Pri. Date 20080926 App. Date 20080929 Pub. Date 20100401

April 2010 USPTO Patent Applications 248


H04W 04/00

H04R 03/00: Loudspeakers, microphones, gramophone pick-ups or like


acoustic electromechanical transducers Ü Circuits for transducers
App. No. 20100092007 Assignee MICROSOFT CORPORATION
Title Dynamic switching of microphone inputs for identification of a direction of a source of speech
sounds
Abstract This disclosure describes techniques of automatically identifying a direction of a speech source
relative to an array of directional microphones using audio streams from some or all of the
directional microphones. Whether the direction of the speech source is identified using audio
streams from some of the directional microphones or from all of the directional microphones
depends on whether using audio streams from a subgroup of the directional microphones or
using audio streams from all of the directional microphones is more likely to correctly identify
the direction of the speech source. Switching between using audio streams from some of the
directional microphones and using audio streams from all of the directional microphones may
occur automatically to best identify the direction of the speech source. A display screen at a
remote venue may then display images having angles of view that are centered generally in the
direction of the speech source.
Pri. Date 20050729 App. Date 20081015 Pub. Date 20100415

April 2010 USPTO Patent Applications 249


H04W 04/00

H04W 04/00: Wireless communication networks Ü Services or facilities


specially adapted for wireless communication networks
App. No. 20100087173 Assignee Microsoft Corporation
Title Inter-threading indications of different types of communication
Abstract Different phones are identified as being part of different groups, and indications of communications
with the different phones are displayed on a particular phone by group. The indications
of communications of different types are displayed inter-threaded chronologically. These
communications with the different phones can include communications received from the different
phones and communications sent to the different phones.
Pri. Date 20010126 App. Date 20081002 Pub. Date 20100408

App. No. 20100093317 Assignee Microsoft Corporation


Title Targeted advertisements to social contacts
Abstract Targeted advertisements to social contacts is described. In embodiment(s), social contacts can
be correlated based on messaging interactions between mobile communication devices that are
associated with the social contacts. Feedback about an advertisement can be received from
mobile communication devices that are associated with the social contacts, and the advertisement
can then be targeted to one or more of the social contacts based on the feedback about the
advertisement.
Pri. Date 20081010 App. Date 20081009 Pub. Date 20100415

April 2010 USPTO Patent Applications 250


H04W 04/12

Patent applications also belong to this classification and have been already shown:
20100088185 page 203

H04W 04/02: Wireless communication networks Ü Services or facilities


specially adapted for wireless communication networks Ü Services making
use of the location of users or terminals
App. No. 20100081416 Assignee MICROSOFT CORPORATION
Title Virtual skywriting
Abstract Users with mobile computing devices author skywriting and submit them to a virtual skywriting
service. A mobile computing device having wireless network access is configured to capture
a digital image of a real world scene including sky. The image is captured while the mobile
computing device is in a geographical location or area. While the mobile computing device
is still in the geographical location or area, it transmits via the wireless network a request for
virtual skywriting. The request is received by a skywriting service that obtains or determines the
geographical location/area that the computing device is in or near. The skywriting service selects
a skywriting from among the previously submitted skywritings; the skywriting may be selected
based on its having been entered at or associated with the geographical location. The mobile
device receives the virtual skywriting from the service and displays a version of the digital image
with the virtual skywriting added to the sky in the version of the digital image. Either the service
or the mobile device may render the skywriting onto the image. Various effects may be applied in
rendering the skywriting to give it realistic or vapor-like appearance.
Pri. Date 20061017 App. Date 20080930 Pub. Date 20100401

April 2010 USPTO Patent Applications 251


H04W 04/12

H04W 04/12: Wireless communication networks Ü Services or facilities


specially adapted for wireless communication networks Ü Messaging,
e.g. SMS [Short Messaging Service]
App. No. 20100081461 Assignee Microsoft Corporation
Title Sms based social networking
Abstract Methods for retrieving and transmitting data associated with a social network of an entity through
short message service (SMS) protocol are disclosed herein. A system for transmitting the
data through SMS protocol is also disclosed. In one embodiment, input is transmitted through
SMS from a cellular telephone to a database, data related to the input is retrieved from the
database, and the retrieved data is transmitted through SMS protocol to the cellular telephone.
The transmitted data may be presented to a user as a representation on the cellular telephone,
for example. The representation may comprise a profile of the entity and/or a profile of another
entity associated with the entity’s social network, for example.
Pri. Date 20070418 App. Date 20081001 Pub. Date 20100401

App. No. 20100093379 Assignee Microsoft Corporation


Title Universal mobile device messaging
Abstract A unified messaging system allows the receipt and sending of different messages across devices
is established by creating relationships that leverage the capabilities of different devices. A
message server establishes a relationship with a mobile device. Through the relationship, the
message server can use the mobile device to send different types of messages that the server
computer cannot transmit. A relationship between a client and a server extends this capability to
the client. Through these relationships, a client can retrieve mobile device messages as well as
generate them. The generated mobile device messages are transmitted to the message server.
The message server determines that the received messages are mobile device messages that
the server cannot deliver and sends the mobile device messages to the user’s mobile device. The
mobile device receives the mobile device messages from the message server and transmits the
mobile device message to recipient mobile devices.
Pri. Date 20070427 App. Date 20081013 Pub. Date 20100415

April 2010 USPTO Patent Applications 252


H04W 64/00

H04W 64/00: Wireless communication networks Ü Locating users or


terminals for network management purposes, e.g. mobility management
App. No. 20100105409 Assignee MICROSOFT CORPORATION
Title Peer and composite localization for mobile applications
Abstract A system and method for peer based localization system using radio technology, such as
Bluetooth or Wi-Fi ad-hoc technology that enables mobile devices such as cell phones, smart
phones, laptops, handheld communication devices, handheld computing devices, satellite radios,
global positioning systems, PDAs, etc. to discover their physical location relative to one another.
In addition, the peer based localization can use a plurality of radio technologies to increase
the accuracy of the physical location estimates. Additionally or alternatively, the peer based
localization technique can be combined with infrastructure based location techniques, such
as triangulation, GPS, or infrastructure based Wi-Fi localization in order to transpose virtual
coordinates into physical coordinates.
Pri. Date 20070328 App. Date 20090227 Pub. Date 20100429

April 2010 USPTO Patent Applications 253


H04W 72/04

H04W 72/04: Wireless communication networks Ü Local resource management,


e.g. selection or allocation of wireless resources or wireless traffic
scheduling Ü Wireless resource allocation
App. No. 20100081440 Assignee Microsoft Corporation
Title Delegation of mobile communication to external device
Abstract Delegating voice and/or data traffic communication from a mobile computing device to an external
proxy device. The mobile computing device obtains identification of a traffic channel and a time
slot and provides the information to the proxy device. The proxy device monitors a cellular network
on the identified traffic channel during the identified time slot while the mobile computing device
goes into signaling mode. The proxy device exchanges voice and/or data traffic between the
user and the cellular network In some embodiments, the proxy device includes a speaker and
microphone. In other embodiments, the proxy device sends the voice and/or data traffic to the
user via the mobile computing device or another device. By delegating the voice and/or data traffic
communication to the proxy device, the battery life of the mobile computing device is preserved.
Pri. Date 20061114 App. Date 20080926 Pub. Date 20100401

April 2010 USPTO Patent Applications 254


H04W 74/00

H04W 74/00: Wireless communication networks Ü Wireless channel


access, e.g. scheduled or random access
App. No. 20100091715 Assignee Microsoft Corporation
Title Cognitive channel adaptation in wireless sensor networks
Abstract Cognitive radio adaptation is employed in WSNs to reduce effects of RF interference.
Communication channel quality is assessed locally at each node. Using beacons to propagate
channel quality and node related information among the nodes of the network, channel adaptation
decision is made either centrally by identifying a channel that is optimum for a majority of nodes
through a tree-structure dissemination (Majority Voting Scheme) or in a distributed manner by
identifying a channel where maximum interference for any node is less than maximum interference
on the other channels (Veto Voting Scheme). If two channels have the same level of maximal
interference, the channel with a lesser number is chosen. Channel quality assessment may be
optimized based on expected interference type and/or statistical methods.
Pri. Date 20071030 App. Date 20081010 Pub. Date 20100415

April 2010 USPTO Patent Applications 255


H04W 74/00

April 2010 USPTO Patent Applications 256


Patent Index

Patent Index
Patent Application Page Patent Application Page Patent Application Page
20100078303 219 20100079369 20 20100079451 209
20100079452 211 20100079474 215 20100079485 216
20100079498 213 20100079575 243 20100080017 9
20100080144 233 20100080283 248 20100080287 246
20100080290 247 20100080297 245 20100080302 241
20100080365 218 20100080450 196 20100080462 137
20100080466 190 20100080488 195 20100080489 192
20100080493 186 20100080551 12 20100081404 221
20100081416 251 20100081440 254 20100081461 252
20100081476 21 20100081507 6 20100082237 9
20100082300 107 20100082324 138 20100082343 217
20100082345 212 20100082372 204 20100082376 199
20100082380 200 20100082381 201 20100082397 10
20100082440 108 20100082510 43 20100082511 43
20100082512 140 20100082516 197 20100082534 140
20100082546 142 20100082548 143 20100082549 143
20100082550 105 20100082551 144 20100082566 145
20100082573 146 20100082577 44 20100082582 146
20100082604 147 20100082606 134 20100082612 148
20100082613 148 20100082614 44 20100082617 149
20100082639 149 20100082646 150 20100082649 151
20100082657 152 20100082661 45 20100082662 24
20100082683 46 20100082703 46 20100082704 153
20100082714 92 20100082733 109 20100082736 109
20100082750 110 20100082751 110 20100082753 111
20100082759 131 20100082802 125 20100082803 125
20100082804 88 20100082813 112 20100082825 112
20100082838 113 20100082851 14 20100082868 106
20100082918 93 20100082974 228 20100082984 229
20100082987 229 20100082989 178 20100082990 223
20100082992 225 20100082998 230 20100083036 85
20100083047 89 20100083048 90 20100083094 132
20100083098 113 20100083103 135 20100083111 25
20100083155 26 20100083165 26 20100083170 27
20100083186 27 20100083192 15 20100083210 53
20100083219 54 20100083230 54 20100083233 55
20100083238 68 20100083254 52 20100083255 71
20100083256 72 20100083257 73 20100083258 73
20100083261 74 20100083272 81 20100083274 81
20100083275 75 20100083276 76 20100083285 77
20100083318 16 20100083324 244 20100083363 231
20100083374 232 20100083375 153 20100084470 187
20100085350 207 20100085352 207 20100085353 208
20100085359 211 20100085360 210 20100085371 213
20100085383 214 20100085416 242 20100085853 218
20100085975 234 20100085979 236 20100086134 226
20100086208 191 20100086214 194 20100086227 192
20100086232 190 20100086276 240 20100087169 237
20100087173 250 20100087257 7 20100088026 11
20100088143 206 20100088185 203 20100088234 202
20100088267 38 20100088274 154 20100088283 155
20100088289 155 20100088295 47 20100088297 156
20100088300 48 20100088303 158 20100088309 158
20100088315 160 20100088325 163 20100088331 164
20100088342 164 20100088350 165 20100088356 134
20100088359 114 20100088372 114 20100088376 126
20100088380 115 20100088390 116 20100088405 116
20100088418 117 20100088431 16 20100088470 99
20100088495 52 20100088520 118 20100088523 104
20100088525 105 20100088546 92 20100088548 83
20100088582 37 20100088602 19 20100088630 28
20100088647 28 20100088651 29 20100088661 166
20100088665 56 20100088666 57 20100088669 58
20100088672 59 20100088674 60 20100088677 60

April 2010 USPTO Patent Applications 257


Patent Index

Patent Application Page Patent Application Page Patent Application Page

April 2010 USPTO Patent Applications 258


Patent Index

Patent Application Page Patent Application Page Patent Application Page


20100088679 61 20100088684 68 20100088685 62
20100088686 69 20100088689 63 20100088690 64
20100088692 64 20100088702 78 20100088704 78
20100088715 202 20100088727 17 20100088738 179
20100088753 42 20100088759 180 20100090403 6
20100091021 209 20100091254 11 20100091715 255
20100091995 227 20100092007 249 20100092098 193
20100093278 222 20100093310 238 20100093317 250
20100093379 252 20100093435 7 20100094784 130
20100094800 132 20100094809 167 20100094831 48
20100094900 39 20100094906 167 20100094912 168
20100094915 30 20100094926 119 20100094939 119
20100094991 126 20100095083 94 20100095120 223
20100095224 19 20100095272 65 20100095284 70
20100095310 17 20100095374 181 20100097820 8
20100098103 235 20100098235 239 20100100384 217
20100100416 169 20100100429 204 20100100517 197
20100100527 170 20100100564 171 20100100632 120
20100100637 122 20100100688 86 20100100689 95
20100100690 95 20100100701 101 20100100716 13
20100100725 223 20100100743 136 20100100808 133
20100100831 31 20100100838 31 20100100868 66
20100100885 82 20100100890 79 20100100943 182
20100100945 183 20100100953 224 20100102633 221
20100103117 23 20100103118 23 20100103186 215
20100103269 240 20100103322 246 20100104153 187
20100105409 253 20100105479 8 20100106426 175
20100106484 139 20100106486 138 20100106571 49
20100106671 189 20100106673 198 20100106678 50
20100106684 171 20100106695 172 20100106732 39
20100106734 51 20100106744 40 20100106753 173
20100106754 40 20100106756 41 20100106758 95
20100106767 122 20100106768 123 20100106808 128
20100106812 129 20100106813 129 20100106819 88
20100106831 124 20100106839 127 20100106895 96
20100106914 102 20100106915 103 20100106920 97
20100106930 98 20100106931 99 20100106934 100
20100107002 87 20100107015 67 20100107095 32
20100107101 33 20100107104 34 20100107115 34
20100107120 35 20100107123 35 20100107125 36
20100107128 38 20100107142 66 20100107177 80
20100107213 183 20100107218 232 20100107219 184
20100107240 185 20100107245 84

April 2010 USPTO Patent Applications 259


IPC Catchword Index

IPC Catchword Index

Catch Word IPC Page


ACCOUNT(S) electric digital computers for accounting G06F 17/00 132
ADDRESSING memories G06F 12/00 92
AMUSEMENT(S) A63 6
BANDWIDTH reduction for television signal transmission H04N 07/26 245
BANK(S) -accounting computers G06F 17/00 132
BAR(S) reading BAR(S)-codes G06K 09/18 190
CALLING-ARRANGEMENTS in near-field transmission systems H04B 05/00 222
CAMERA(S) television CAMERA(S) H04N 05/225 240
CHARACTERS recognition of CHARACTERS G06K 09/00 187
CODE(S) reading bar-CODE(S) G06K 09/18 190
COMPILERS G06F 09/44 53
COMPILING statistics G06 12
COMPUTER(S) G06 12
COMPUTER(S) learning machines G06F 15/18 130
COMPUTER(S) multimedia applications G06F 17/00 132
COMPUTER(S) using fuzzy logic models G06N 07/02 199
COMPUTER(S) using knowledge based models G06N 05/00 196
CONTOURS following CONTOURS for character recognition G06K 09/00 187
COURSES measuring COURSES G01C 21/00 9
DATA processing G06 12
DIOPTRICS G02 11
DRAG(S) measuring DRAG(S) in navigation G01C 21/00 9
DRIFT(S) measuring DRIFT(S) for navigation G01C 21/00 9
ELECTRICITY distribution of ELECTRICITY H02 220
EMERGENCIES electric stand-by supply arrangements for EMERGENCIES H02J 09/00 221
EMULATION G06F 09/44 53
EQUATIONS solving EQUATIONS G06 12
ERROR(S) -detection or ERROR(S) -correction, in electric digital computers G06F 11/00 83
FORTUNE-TELLING card games for FORTUNE-TELLING A63F 01/00 6
FUNCTIONS evaluating FUNCTIONS G06 12
FUZZY logic based computer system G06N 07/02 199
GENERATION of electricity H02 220
INDICATING control arrangements or circuits for visual indicators G09G 05/00 213
INDUCTION transmission systems using inductive loop H04B 05/00 222
INFORMATION electric digital computers for INFORMATION retrieval G06F 17/30 140
INPUT for electric digital computers G06F 03/00 14
INVENTORY electric digital computers for INVENTORY G06F 17/00 132
INVOICING electric digital computers for INVOICING G06F 17/00 132
JOYSTICK, JOY STICK JOYSTICK for data input in electric digital computers G06F 03/033 22
KEYBOARDS for electric digital computers G06F 03/02 20
LANGUAGE(S) natural LANGUAGE(S) modelling for speech recognition G10L 15/18 217
LEADER inductive LEADER -gear H04B 05/00 222
LETTER(S) identification or recognition of LETTER(S) G06K 09/00 187

April 2010 USPTO Patent Applications 260


IPC Catchword Index

Catch Word IPC Page


LIGHT-PEN(S) for electric digital computers G06F 03/033 22
MATCHING of digital data G06F 07/00 38
MEASURING G01 9
MERGING of digital data G06F 07/00 38
MOUSE used as input device in computers G06F 03/033 22
NAVIGATION G01C 21/00 9
NETWORKS local area NETWORKS H04L 12/28 234
OUTPUT for electric digital computers G06F 03/00 14
PAGING-SYSTEMS using near-field transmission H04B 05/00 222
PATH configuration in networks H04L 12/28 234
PLOTTING in navigation G01C 21/00 9
PREVENTING fraudulent or unauthorized calling H04M 01/66 238
PRINT(S) making or treatment of photographic PRINT(S) G03 12
PRINT(S) recognition of printed characters G06K 09/00 187
PROCESSING data PROCESSING equipment in general G06F 15/00 107
PROGRAMME(S), PROGRAM(S) PROGRAMME(S) control in electric digital G06F 09/00 52
computers
RANDOM access stores in electric digital computers G06F 12/00 92
READING printed or written characters G06K 09/00 187
RECOGNITION of printed or written characters G06K 09/00 187
RECREATION A63 6
REGENERATION of TV signals for recording H04N 05/93 240
RESERVATION electric computers for RESERVATION of seats G06F 17/00 132
RESONATORS for non-electric sound in particular musical instruments G10 216
ROUTES determining ROUTES G01C 21/00 9
SEAT(S) electric digital computers for SEAT(S) reservation G06F 17/00 132
SECRET digital communication, e.g. in telegraph systems H04L 09/00 223
SELECTING of digital data G06F 07/00 38
SORTING of record carriers in electric digital computers G06F 07/06 43
SPEECH synthesis G10L 13/00 216
STAND-BY arrangements for electric supply H02J 09/00 221
STATISTICS electric digital computers for STATISTICS G06F 17/00 132
STORES for storage of data combined with electric digital computers G06F 13/00 106
SYMBOLS recognition of SYMBOLS G06K 09/00 187
SYNTHESIS of speech G10L 13/00 216
TELEPHONE(S) answering H04M 01/64 237
TELEVISION conference systems (= video conference) H04N 07/15 243
TOTALISATORS for electrically computing outcome of betting G06F 17/00 132
TRAFFIC electric digital computers for TRAFFIC control G06F 17/00 132
TRANSFERRING in electric digital computers G06F 07/00 38
TRANSLATING of languages by computer G06F 17/28 138
TRANSPARENCY(-IES) bearing pictures for projection G03 12
VARIABLES measuring VARIABLES G01 9
VEHICLES measuring position or course of VEHICLES G01C 21/00 9
WEAPON(S) electric digital computers for WEAPON(S) G06F 17/00 132

April 2010 USPTO Patent Applications 261