May 2010 Microsoft USPTO Published Patent Applications

US Patent Application Review Series
Microsoft
May 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.
May 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.

Table of Contents
G06F 12/00 - Accessing, addressing or

allocating within memory systems or
architectures . . . . . . . . . . . . . . . 46
G06F 12/02 - Addressing or allocation . . . . 49
G06F 12/14 - Protection against
unauthorised use of memory . . . . . . 49
Table of Contents G06F 12/16 - Protection against loss of
memory contents . . . . . . . . . . . . . 49
G06F 15/16 - 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 . . . 49
A few words from the editor 2
G06F 15/167 - using a common memory,
Table of Contents 3 e.g. mailbox . . . . . . . . . . . . . . . . 58
G06F 15/173 - using an interconnection
A61 - Physical therapy apparatus, e.g. devices network, e.g. matrix, shuffle, pyramid,
for locating or stimulating reflex points in star, snowflake . . . . . . . . . . . . . . 58
the body 5 G06F 15/177 - Initialisation or configuration
A61H 01/00 - Apparatus for passive exercising 5 control . . . . . . . . . . . . . . . . . . . 59
G06F 17/00 - Digital computing or data
A63 - Card, board, or roulette games 5 processing equipment or methods,
A63F 09/24 - Games using electronic circuits specially adapted for specific functions . 64
not otherwise provided for . . . . . . . . 5 G06F 17/10 - Complex mathematical
A63F 13/00 - Aspects of games using operations . . . . . . . . . . . . . . . . . 68
an electronically generated display G06F 17/21 - Text processing . . . . . . . . . 68
having two or more dimensions, G06F 17/28 - Processing or translating of
e.g. on a television screen, showing natural language . . . . . . . . . . . . . 69
representations related to the game . . 7 G06F 17/30 - Information retrieval . . . . . . 70
G06F 17/50 - Computer-aided design . . . . 85
G01 - Measuring distances, levels or bearings 7 G06F 21/00 - Security arrangements for
G01C 21/00 - Navigation . . . . . . . . . . . 7 protecting computers or computer
systems against unauthorised activity . 88
G06 - Electric digital data processing 8 G06F 21/20 - by restricting access to nodes
G06F 03/033 - Pointing devices displaced in a computer system or computer
or positioned by the user, e.g. mice, network . . . . . . . . . . . . . . . . . . 88
trackballs, pens or joysticks . . . . . . . 8 G06G 07/48 - Analogue computers for
G06F 03/048 - Interaction techniques specific processes, systems, or
for graphical user interfaces, e.g. devices, e.g. simulators . . . . . . . . . 88
interaction with windows, icons or menus 10 G06K 09/00 - Methods or arrangements for
G06F 07/00 - Methods or arrangements for reading or recognising printed or written
processing data by operating upon the characters or for recognising patterns,
order or content of the data handled . . 18 e.g. fingerprints . . . . . . . . . . . . . . 90
G06F 07/04 - Identity comparison, i.e. for like G06K 09/34 - Segmentation of touching or
or unlike values . . . . . . . . . . . . . . 29 overlapping patterns in the image field . 90
G06F 07/06 - Arrangements for sorting, G06K 09/36 - Image preprocessing, i.e.
selecting, merging, or comparing data processing the image information
on individual record carriers . . . . . . . 30 without deciding about the identity of
G06F 07/08 - Sorting, i.e. grouping
the image . . . . . . . . . . . . . . . . . 93
record carriers in numerical or other
ordered sequence according to the G06K 09/54 - Combinations of
classification of at least some of the preprocessing functions . . . . . . . . . 93
information they carry . . . . . . . . . . 32 G06K 19/06 - characterised by the kind of the
G06F 07/10 - Selecting, i.e. obtaining data digital marking, e.g. shape, nature, code 94
of one kind from those record carriers G06K 19/07 - with integrated circuit chips . . 94
which are identifiable by data of a G06N 05/00 - Computer systems utilizing
second kind from a mass of ordered or knowledge based models . . . . . . . . 94
randomly-distributed record carriers . . 33 G06N 05/02 - Knowledge representation . . . 95
G06F 09/00 - Arrangements for programme G06N 05/04 - Inference methods or devices . 95
control, e.g. control unit . . . . . . . . . 34 G06Q 10/00 - Administration, e.g. office
G06F 09/44 - Arrangements for executing automation or reservations . . . . . . . 95
specific programmes . . . . . . . . . . . 36 G06Q 30/00 - Commerce, e.g. marketing,
G06F 09/445 - Programme loading or initiating 40 shopping, billing, auctions or e-commerce 97
G06F 09/45 - Compilation or interpretation of G06Q 40/00 - Finance, e.g. banking,
high level programme languages . . . . 41 investment or tax processing . . . . . . 100
G06F 09/46 - Multiprogramming arrangements 41 G06Q 50/00 - Systems or methods specially
G06F 09/54 - Interprogramme communication 45 adapted for a specific business sector,
G06F 11/07 - Responding to the occurrence e.g. health care, utilities, tourism or
of a fault, e.g. fault tolerance . . . . . . 45 legal services . . . . . . . . . . . . . . . 100
G06F 11/34 - Recording or statistical G06T 01/00 - General purpose image data
evaluation of computer activity, e.g. of processing . . . . . . . . . . . . . . . . 100
down time, of input/output operation . . 45 G06T 15/70 - Animation effects . . . . . . . . 103

Table of Contents
G08 - Signalling or calling systems 103 H04B 07/24 - for communication between
G08B 05/22 - using electric transmission . . 103 two or more posts . . . . . . . . . . . . 111
H04L 09/00 - Arrangements for secret or
G09 - Arrangements or circuits for control of secure communication . . . . . . . . . . 111
indicating devices using static means to H04L 09/06 - the encryption apparatus
present variable information 103 using shift registers or memories for
G09G 03/20 - for presentation of an blockwise coding, e.g. D.E.S. systems . 113
assembly of a number of characters, H04L 09/30 - Public key, i.e. encryption
e.g. a page, by composing the algorithm being computationally
assembly by combination of individual infeasible to invert and users’
encryption keys not requiring secrecy . 113
elements arranged in a matrix . . . . . . 103
G09G 05/00 - Control arrangements or H04L 09/32 - including means for verifying
circuits for visual indicators common to the identity or authority of a user of the
cathode-ray tube indicators and other system . . . . . . . . . . . . . . . . . . . 114
visual indicators . . . . . . . . . . . . . 104 H04L 12/26 - Monitoring arrangements . . . 115
G09G 05/02 - characterised by the way in H04L 12/56 - Packet switching systems . . . 118
which colour is displayed . . . . . . . . 105 H04L 29/06 - characterised by a protocol . . 118
H04M 01/00 - Substation equipment, e.g. for
G10 - Speech analysis or synthesis 105 use by subscribers . . . . . . . . . . . . 118
G10L 15/00 - Speech recognition . . . . . . . 105 H04M 01/64 - Automatic arrangements for
G10L 15/04 - Segmentation or word limit answering calls . . . . . . . . . . . . . . 119
detection . . . . . . . . . . . . . . . . . 106 H04M 03/00 - Automatic or semi-automatic
G10L 15/18 - using natural language modelling106 exchanges . . . . . . . . . . . . . . . . 119
G10L 19/08 - Determination or coding of the H04N 05/445 - for displaying additional
excitation function . . . . . . . . . . . . 107 information . . . . . . . . . . . . . . . . 120
G10L 21/00 - Processing of the speech H04N 07/173 - with two-way working,
signal to produce another audible or e.g. subscriber sending a programme
non-audible signal, e.g. visual or tactile, selection signal . . . . . . . . . . . . . . 121
in order to modify its quality or its H04N 07/26 - using bandwidth reduction . . . 123
intelligibility . . . . . . . . . . . . . . . . 108 H04N 07/30 - involving transform coding . . . 124
H04W 04/00 - Services or facilities specially
H01 - Aerials 108 adapted for wireless communication
H01Q 01/24 - with receiving set . . . . . . . . 108 networks . . . . . . . . . . . . . . . . . 124
H01Q 05/00 - Arrangements for H04W 48/00 - Access restriction . . . . . . . 125
simultaneous operation of aerials on
two or more different wavebands . . . . 109 H05 - Printed circuits 126
H01Q 09/04 - Resonant aerials . . . . . . . . 109 H05K 07/20 - Modifications to facilitate
H01Q 15/14 - Reflecting surfaces . . . . . . . 109 cooling, ventilating, or heating . . . . . . 126
H04 - Transmission 110 Patent Index 128

H04B 07/00 - Radio transmission systems,
i.e. using radiation field . . . . . . . . . 110 IPC Catchword Index 129

A63F 09/24
A61H 01/00: Physical therapy apparatus, e.g. devices for locating or

stimulating reflex points in the body Ü Apparatus for passive exercising
App. No. 20100113983 Assignee MICROSOFT CORPORATION
Title Utilizing ultrasound to disrupt pathogens
Abstract Provided are systems and/or methods that treat illnesses and conditions using ultrasound tuned
to a resonant frequency of a target material with the assistance of computer processing. The
ultrasound tuned to the resonance frequency of a target material destroys the target material
without harming healthy material that surrounds the target material. A resonance frequency
database can be employed to ensure that local healthy material surrounding a target has a natural
resonance frequency dissimilar enough from the tuned resonance frequency.
Pri. Date 20080509 App. Date 20081031 Pub. Date 20100506
A63F 09/24: Card, board, or roulette games Ü Games not otherwise

provided for Ü Games using electronic circuits not otherwise provided
for
App. No. 20100120513 Assignee Microsoft Corporation
Title Game of chance
Abstract A game of chance includes receiving a stake corresponding to a target game-item from a player.
In each phase of the game, a random integer is selected and a game-item corresponding to that
integer is removed from play. If the target game-item is removed from play, the player is awarded
a return and the game of chance ends. If specific game-items or combinations of game items are
removed from play, the player is defeated, and the game of chance ends. A subsequent phase of
the game of chance begins if the player is not defeated or awarded a return.

A63F 09/24

Title Audio content management for video game systems
Abstract Techniques and systems for managing audio content for use with a video game playable via
a video game system. A graphical user interface (x201c;GUIx201d;) associated with the video
game presents visual objects representing audio content in any format aggregated from a number
of different sources. Aggregation is achieved by dynamically populating a data structure with data
objects configured to store information about various audio sources and audio content stored
thereby. The data objects are used to dynamically render the graphical user interface. Via the GUI,
a user browses aggregated audio content and selects particular audio content for use with the
video game. The data objects and the information stored or referenced thereby (e.g., metadata)
may also be used for searching/sorting, translating/transferring, or playing available audio content.

Title Game of chance
Abstract A game of chance includes receiving a stake from a player. Each phase of the game of chance
comprises assigning randomly selected elements to a number of game stops in the form of a
pyramidal matrix. Random selection of an element for each game stop is performed independently
of random selection for all other game stops. The player is awarded a return based on a
composition of elements assigned to the plurality of game stops.

G01C 21/00
A63F 13/00: Card, board, or roulette games Ü Aspects of games using

an electronically generated display having two or more dimensions,
e.g. on a television screen, showing representations related to the
game
Patent applications also belong to this classification and have been already shown:
20100120513 page 5 20100130277 page 6
G01C 21/00: Measuring distances, levels or bearings Ü Navigation

Title Selecting between client-side and server-side market detection
Abstract In accordance with one or more aspects of selecting between client-side and server-side market
detection, a determination is made at a device as to which of a client-side detected market and
a server-side detected market is to have priority for a service. An application of the device is
configured in accordance with a client-side market configuration setting if the client-side detected
market has priority, and is configured in accordance with a server-side market configuration setting
if the server-side detected market has priority.

G06F 03/033
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
Title In-air cursor control
Abstract Embodiments related to in-air cursor control solutions are disclosed. For example, one disclosed
embodiment provides a method of moving a cursor on a display. The method comprises receiving
an external motion signal from an image sensor that is external to a handheld cursor control
device, receiving an internal motion signal from a motion detector internal to the handheld cursor
control device, and sending an output signal to the display to change a location of the cursor on
the display based upon the external motion signal and the internal motion signal.
App. No. 20100127985 Assignee Microsoft

Title Input device with forward/backward control
Abstract In a computer system having a display and a keyboard, a computer readable medium includes
instructions for invoking a message hook procedure based on a mouse message indicative of
a mouse event. Instructions also provide for identifying at least one focus application that has
a current keyboard focus and of converting the mouse message into a command for the focus
application. The command is then sent to the focus application and the mouse message is
prevented from being routed to any other applications. In one embodiment, the commands
include the command to page forward or backward through pages of Internet documents. In
other embodiments, instead of converting the mouse message into a command, the message
hook procedure displays a graphical user interface based on the focus application and the mouse
message. The graphical user interface includes one or more commands that the user may select.
Based on the selection made by the user, the message hook procedure sends a corresponding
command to the focus application.

G06F 03/033

Title Tiltable user interface
Abstract A programmable effects system for graphical user interfaces is disclosed. One embodiment
comprises adjusting a graphical user interface in response to a tilt of a device. In this way, a
graphical user interface may have viewable content not shown in a first view, where the viewable
content may be displayed in a tilted view in response to the device tilt.

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
Title Facet, logic and textual-based query composer
Abstract Described is a technology for composing queries by user interaction with objects and facets. A
facet-based user interface allows users to select facets for use as filtering criteria, and a logic-
based user interface allows users to logically combine object data. Query logic that processes
the filtering criteria and/or logically combines the object data into a query. The facet-based user
interface and logic-based user interface may be accessed via a unified user interface. The unified
user interface may also provide a text editor for composing a text-based query.

G06F 03/048

Title Web-based language translation memory compilation and application
Abstract Suggested edits to translated text are enabled to be provided by users. The suggested edits
are associated with the translated text in a content database. A subsequent user may view the
translated text and any associated suggested edits. The subsequent user may be enabled to
approve a suggested edit to the translated text. The translated text is enabled to be displayed as
modified according to the approved suggested edit. This may include enabling multiple instances
of the translated text to be displayed as modified according to the suggested edit if the translated
text occurs multiple times (e.g., appears multiple times in one or more documents) in the content
database. Further users that attempt to view the translated text in a document of the content
database will be provided with the modified version of the translated text.

G06F 03/048

Title Combinable tabs for a tabbed document interface
Abstract A method and system for combining tabs of a tabbed document interface (x201c;TDIx201d;) is
provided. A combinable TDI system allows tabs of a TDI to be combined to form a single tab of
the TDI. To combine tabs, the combinable TDI system generates a combined tab name from the
tab names of the tabs to be combined and combined tab content from the content of the tabs to
be combined. If the width of the content is greater than what can be currently displayed in the
window, the combinable TDI system may add a scroll bar to the TDI so that the user can scroll and
make visible portions of the content that were previously not visible. The combinable TDI system
then displays the combined tab and removes the tabs that have been combined. The combinable
TDI system may also allow a user to split a combined tab into separate tabs.

G06F 03/048

Title Browser tab management
Abstract The management of tabs in browser applications may be at least partially automated. In a
described implementation, a link present in browser content information may include a link
property indicating that the new browser content information targeted by the link is to be opened
in a new tab. A browser application can therefore automatically launch a new tab without a user
request. In another described implementation, a new travelogue created for a new tab may be
initially populated with an historical entry that points to spawning browser content information and
identifies the originating tab. When a user attempts to move backward from an initial page of
the new tab, a browser application can therefore automatically redisplay the spawning browser
content information at the originating tab.

Title Sidebar engine, object model and schema
Abstract An engine is provided for displaying an application for hosting a second application. The hosting
application can be a sidebar on a display. The engine can contain a part or program which can
include a manifest file, a definition file and/or a script file. The manifest file may contain a pointer
to at least one of the definition file and the script file. The engine may also contain a loader that
can locate the definition file and/or script file (e.g., via pointers in the manifest file) and load the
definition file and/or script files of the part for processing. The engine may also execute script
associated with the part and convert an object model into a user interface which can be displayed
at a predetermined location on a display or docked onto a sidebar. The user interface can further
be manipulated or relocated within the sidebar or removed (i.e., undocked) from the sidebar. The
sidebar may be exploded or imploded with the corresponding parts on the sidebar displayed on
the desktop or another application (exploded) or returned to the sidebar (imploded).

G06F 03/048

Title Programmable effects for a user interface
Abstract A programmable effects system for graphical user interfaces is disclosed. One embodiment
comprises receiving one or more effect elements to apply to an element in a graphical user
interface for a device, ordering the effect elements in a pipeline of operations, and storing the
pipeline of operations in an effect template. Then, after the graphics hardware capability for a
device is determined, the effect template may be used to create a shader that includes supported
effects to render an element in the graphical user interface.

G06F 03/048

Title Scrolling web pages using direct interaction
Abstract Aspects of the present invention provide a system and method for scrolling or dragging information
on a display. A panning tool is provided that may scroll information, such as a web page, on a
display in tandem with movement of a cursor. If interactive elements are present on the page or
document, an interactive element may be activated as desired. Scrolling may be accomplished
with the panning tool either on non-interactive elements or interactive elements that are not
required to be activated. Furthermore, inertia of movement of the information on a display is
optimized and autoscrolling is provided in which a page or document may be scrolled without
dragging.

Title Computer input control for specifying scope with explicit exclusions
Abstract Methods and systems providing a user interface control allowing a user to specify a scope of
items on a computer system or network is disclosed. Certain aspects provide an input control
through which a user can specify an explicit scope, or range, of items, while also identifying explicit
exclusions from the specified scope, thereby reducing ambiguity regarding identification of items
included and items excluded from the scope. When a user explicitly selects an item for inclusion
in the scope, the explicitly selected item is added to the scope definition, and all descendants of
the explicitly selected item are implicitly selected for inclusion. When a user explicitly selects an
item for exclusion from the scope, the explicitly selected item is added to the scope definition as
an exclusion from an explicitly included item, and all descendants of the explicitly selected item
are implicitly selected for exclusion.

G06F 03/048

Title Visualizing hyperlinks in a search results list
Abstract Generating and displaying an enhanced list of search results appropriate for web searching are
described. A method for generating an enhanced list of search results includes identifying web
pages that are relevant to a query, identifying other web pages hyperlinked to the relevant web
pages, creating a graph of the web pages and connecting hyperlinks, and displaying a list of
search results ordered in part by the connecting hyperlinks and showing the connecting hyperlinks
as part of the list. The method also includes the ability to regenerate the list based on an indication
of subjective relevance of a one of the list items. The method enhances the experience of a user
in World Wide Web searching and browsing.

G06F 03/048

Title Managing media content
Abstract A computing device for managing media content and a method of its operation are provided.
The computing device may be configured to execute a computer program including a media
manager. The media manager may be configured to present a graphical user interface including
a static media menu for enabling a user to select one of an automated mode or a manual mode
for managing synchronization of static media content; transfer static media content between the
computing device and a remote media device according to a user interaction if the manual mode
is selected at the static media menu; transfer static media content according to a predefined
programmatic process for the static media content if the automated mode is selected at the static
media menu; and transfer dynamic media content between the computing device and the remote
media device according to a predefined programmatic process for the dynamic media content.

Title Form validation with table driven error handling
Abstract Various embodiments provide a validation framework to validate whether data entered in a web
application is valid. The framework includes a validation resource that contains a validation rule
for the web application. The framework also includes a validation group web control that can
generate client validation script that is useable by a client to validate whether the entered data is
valid. In at least some embodiments, an event table that specifies the validation rules is used to
present an error message when the entered data is not valid.

G06F 07/00

Title Automatically showing more search results
Abstract This disclosure describes various exemplary application user interfaces, methods, and computer
program products for information retrieval or search technology by automatically showing
additional relevant search results based on user feedback. The search describes receiving
a submitted query from a user, identifying multiple query search results in a relationship to
the submitted query, and presenting the multiple query search results in a single structured
presentation with a thumbs-up icon, a thumbs-down icon, or an unmarked status to enhance
the user experience. Furthermore, the search results illustrate the relationships between each of
the multiple query search results and the submitted query in a textual description.

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

for processing data by operating upon the order or content of the data
handled
Title Query submission pipeline using linq
Abstract Described is a technology comprising a query processing pipeline in which a SPARQL query is
processed into an intermediate LINQ query, which is then processed by a LINQ provider. The
LINQ provider decides which instructions correspond to flat database queries, and routes those
instructions a database engine (e.g., SQL server) for querying a database. Other instructions
are provided to a reasoning engine for processing, e.g., by performing a graph traversal and/or
database queries. The pipeline may include a parser that parses the query into an abstract syntax
tree, and an optimizer that processes the abstract syntax tree into a LINQ query, including by
reordering LINQ instructions and/or associating a flag with each of the instructions that indicates
whether to query the database or provide the instruction to a reasoning engine.

Title Relevant navigation with deep links into query
Abstract Methods and computer-readable media for determining relevant search categories, such as
images, videos, news, health, maps, products, etc., and subcategories that are associated with
the search categories based on a query submitted by a user on a search page and displaying the
relevant search categories and subcategories on an initial search results page. A query may be
inputted by a user and may be received. A set of suggested refinement links, which may include
search categories and subcategories, may be identified as being relevant to the query. Further,
the subcategories, when selected, may return narrower search results than when a selection is
made of a search category. Additionally, the initial search results page may be generated and
may include the set of suggested refinement links determined to be relevant to the query, as well
as search results.

G06F 07/00
App. No. 20100114986 Assignee MICROSOFT CORPORATION;MATSUSHITA ELECTRIC

INDUSTRIAL CO., LTD.
Title Navigating media content by groups
Abstract Grouping media files via playlists on a computer-readable medium. One or more media files are
selected according to a grouping criterion to define one or more playlists from the media files. A
folder is associated with the playlists and stores values identifying each of the playlists associated
with the folder along with references to each of the playlists.

G06F 07/00

Title Automatic designation of footnotes to fact data
Abstract Architecture where footnotes can be tied directly to fact data on a line-by-line basis, for example,
and presented to a consumer of the data in a desired language. A reporter mechanism is provided
for associating footnotes to fact data at report preparation time. Using a report/building block
metaphor, the architecture provides the ability to tie footnotes to one or many fact data. In the
context of financial data, building blocks are rows (which usually define account information),
columns (which usually define book codes and reporting periods) and optional trees (which define
departmental structure for a report). Once the footnote or multiple footnotes are associated with
a building block or logical operations on building blocks (e.g., intersection), the footnotes are also
auto-generated for each report, and at the desired block locations. Moreover, the user can select
one or more languages in which to present the footnotes.

G06F 07/00

Title Maintaining client data integrity in a distributed environment using asynchronous data submission
Abstract Data processing architecture where submitters can write data and/or metadata changes to a
destination through an asynchronous interface. The architecture includes a ticketing system that
issues a ticket (a unique identifier) to the submitter in response to receiving a changelist from
the submitter. When the changes are successfully completed at the destination, the cached
destination data can be re-downloaded to the submitter, and the changes cached in the submitter,
discarded. Absent this capability, a user has to manually manage the cached changes and cached
data. The architecture can be distributed in that multiple submitters can submit changelists. The
destination provides data integrity by managing submissions to assist in ensuring data integrity
across multiple submissions. Automatic changelist cleanup is provided on the submitter so that
changelists do not impact performance, memory, and storage.

G06F 07/00

Title Origination based conflict detection in peer-to-peer replication
Abstract Systems and methods that enable conflict detection in a peer-to-peer replication by embedding
origination information in data records. A tracing component can track embedded information in
form of peer ID and transaction ID, wherein conflicts can be detected by comparing a pre-version
(prior to current version) of data on the source nodex2014;withx2014;a current version of the data
on the destination node.

G06F 07/00

Title Modifying delete notifications in a storage stack
Abstract A filter between a filesystem and a storage device in a storage stack can be configured to modify
a delete notification, such as by modifying an existing delete notification or creating a new delete
notification. A storage stack filter can receive an existing delete notification and determine a
modified range of deleted data in response to receiving the existing notification, where a modified
delete notification indicates the modified range of deleted data. A new delete notification can be
created with a storage stack filter positioned below a filesystem in a storage stack, where the new
delete notification indicates a range of deleted data. The new or modified delete notification can
be passed down the storage stack.

G06F 07/00

Title Multi-tenancy using suite of authorization manager components
Abstract Embodiments described herein are directed to implementing a multi-tenancy service component
configured to provide multi-tenancy capabilities for submitted services. In one embodiment,
a computer system instantiates a hosting service that includes a multi-tenancy component
configured to provide resource access to multiple users through a single multi-tenant resource
instance. The computer system receives a submitted service submitted to be hosted by the
hosting service. The submitted service includes a portion of use information usable to configure
parameters of the multi-tenancy component. The computer system configures the multi-tenancy
component to provide resource access for multiple users through a single multi-tenant resource
instance, where each user provides a resource instance claim indicating a resource instance level
authorization for the user. The computer system also provides resource access to each of the
users through the single multi-tenant resource instance, based on the resource instance level
authorization included in the resource instance claim.

Title Method and system for rapid and cost-effective development of user generated content
Abstract An express content metadata system (x201c;ECMx201d;) may provide functionality for uploading,
querying and downloading game content without heavy coding requirements on the part of the
developers. The ECM may provide fast indexing, searching and data retrieval of content. The
ECM may manage evolving changes to content definitions by providing flexible and efficient
versioning control over content definitions that allows multiple versions of game content to coexist
and be independently searchable.

G06F 07/00

Title Analyzer engine
Abstract Methods and systems provide a tool for searching and analyzing XPS files. In accordance
with the described embodiments, a user can search and analyze XPS files without having a
full understanding of an associated software development kit (SDK). Further, in at least some
embodiments, the tool can load an XPS file, analyze XPS/OPC/ZIP metadata information, and
store the metadata information into a set of predefined rules.

G06F 07/00

Title Http cache with url rewriting
Abstract URL rewriting is a common technique for allowing users to interact with internet resources using
easy to remember and search engine friendly URLs. When URL rewriting involves conditions
derived for sources other than the URL, inconsistencies in HTTP kernel cache and HTTP user
output cache may arise. Methods and a system for rewriting a URL while preserving cache
integrity are disclosed herein. Conditions used by a rule set to rewrite a URL may be determined
as cache friendly conditions or cache unfriendly conditions. If cache unfriendly conditions exist,
the HTTP kernel cache is disabled and the HTTP user output cache is varied based upon a key.
If no cache unfriendly conditions exist, then the HTTP kernel cache is not disabled and the HTTP
user output cache is not varied. A rule set is applied to the URL and a URL rewrite is performed
to create a rewritten URL.

G06F 07/00

Title Unified event programming and queries
Abstract Event processing is transformed into query processing. Furthermore, asynchronous computation
can be modeled as an event processing. Moreover, any computation that is or can be represented
as push-based can be unified under an event-based processing approach subject to processing
with query operators. Query processing can be performed with respect to one or more streams
of events, wherein events identify a response to a raised value, among other things.

G06F 07/04
20100114931 page 10

handled Ü Comparing digital values Ü Identity comparison, i.e. for like
or unlike values
Title Radio frequency certificates of authenticity and related scanners
Abstract Radio frequency certificates of authenticity (RFCOAs) and associated scanners and methods
are presented. In one implementation, an array of miniaturized antenna elements in an RFCOA
scanner occupies an area smaller than a credit card yet obtains a unique electromagnetic
fingerprint from an RFCOA associated with an item, such as the credit card. The antenna
elements are miniaturized by a combination of both folding and meandering the antenna patch
components. The electromagnetic fingerprint of an exemplary RFCOA embeddable in a credit
card or other item is computationally infeasible to fake, and the RFCOA cannot be physically
copied or counterfeited based only on possession of the electromagnetic fingerprint.

G06F 07/06
20100125612 page 25

handled Ü Arrangements for sorting, selecting, merging, or comparing
data on individual record carriers
Title Dynamic search result highlighting
Abstract A dynamic highlighting system initially applies a high-level highlight to occurrences of one or
more keywords in a search result that fades to a low-level highlight effect. The system receives
search results from a search engine and identifies occurrences of keywords in the search results.
The system applies a first highlight effect to identified occurrences of the keywords and displays
the search results incorporating the highlighted keywords. Upon detecting the occurrence of a
highlighting change event, such as the expiration of a timer, the system applies a second highlight
effect to the displayed search results. The second highlight effect may include removing the
highlight or displaying a muted highlight effect. Thus, the dynamic highlighting system provides
an initial noticeable highlight that fades to a level that is still noticeable but is less likely to distract
the user from other elements of the user interface.

G06F 07/06

Title Framework for open dynamic reflective applications
Abstract A framework for open, dynamic, and reflective applications contains high level metadata that
define blocks of composable elements using a service definition, which defines specific keys for
using the block of code. The service definition may be exported from the code using reflection
without having to load the code into memory, and decisions on which block of code and how to load
the code may be made at runtime. The composable elements may be grouped into composable
parts. Composable part definitions may be used to instantiate or produce composable parts. At
runtime, dynamic applications may search from many composable elements, and instantiate and
execute the composable element as part of the application.

Title Scalable selection management
Abstract Architecture for handling large data selections with small and substantially constant memory
footprints. The architecture facilitates the creation of sets of data objects (e.g., rows) of a data
source based on selection of the data objects. The set structures can be defined according to a
range (span) of data objects selected and a pattern of the objects selected. These set structures
are then saved in memory, rather than the data objects, to provide optimized memory usage. In
a database implementation, the solution stores the set representation (the structure) in nearly a
constant amount of memory, regardless of the number of rows in the grid, and regardless of the
number of rows selected. Memory usage can be proportional to the number of discontinuous
spans of rows selected by the user. Structures in memory can be consolidated, replaced, or
eliminated dynamically as the user changes row selections and pattern criteria.

G06F 07/08
20100125612 page 25 20100125613 page 25 20100131486 page 26
20100131487 page 27

data on individual record carriers Ü Sorting, i.e. grouping record carriers
in numerical or other ordered sequence according to the classification
of at least some of the information they carry
App. No. 20100114846 Assignee MICROSOFT CORPORATION;MATSUSHITA ELECTRIC
INDUSTRIAL CO., LTD.
Title Optimizing media player memory during rendering
Abstract Optimizing operation of a media player during rendering of media files. The invention includes
authoring software to create a data structure and to populate the created data structure with
obtained metadata. The invention also includes rendering software to retrieve the metadata from
the data structure and to identify media files to render. In one embodiment, the invention is
operable as part of a compressed media format having a set of small files containing metadata,
menus, and playlists in a compiled binary format designed for playback on feature-rich personal
computer media players as well as low cost media players.

G06F 07/10

data on individual record carriers Ü Selecting, i.e. obtaining data of
one kind from those record carriers which are identifiable by data of
a second kind from a mass of ordered or randomly-distributed record
carriers
Title Automatic diagnosis of search relevance failures
Abstract Search relevance failures are diagnosed automatically. Users presented with unsatisfactory
search results can report their dissatisfaction through various mechanisms. Dissatisfaction
reports can trigger automatic investigation into the root cause of such dissatisfaction. Based
on the identified root cause, a search engine can be modified to resolve the issue creating
dissatisfaction thereby improving search engine quality.

G06F 09/00
20100114846 page 32 20100114908 page 19
G06F 09/00: Electric digital data processing Ü Arrangements for programme

control, e.g. control unit
Title Lazy and stateless events
Abstract Event-based processing is employed in conjunction with lazy and stateless events. Addition of any
handlers is deferred until a user-specified handler is identified. Furthermore, event handlers can
be composed at this time including the same properties as underlying events. More specifically,
handlers specified on composite events can be composed and propagated up to a one or more
related source events. As a result, handlers are not accumulated on composite events thereby
making them stateless while allowing equivalent functionality upon invocation of the composed
top-level handler.

G06F 09/00

Title Exceptional events
Abstract An event-driven system enables handlers to be specified for success and failure, among other
things. In other words, events can be explicitly encoded with an option of returning either a
success or a failure result. In this manner, asynchronous programming and events can be
unified. Multiple event streams can be employed to represent success and/or exceptional values.
Alternatively, a disjoint union of regular and exceptional values can be employed with respect to a
single event stream.

G06F 09/44

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
Title Diagram layout patterns
Abstract Defining a layout of diagram elements. A method includes receiving user input. The user
input includes one or more declarative statements specifying conditional patterns based on
attributes of diagram elements. The conditional patterns define layouts of diagram elements.
Implementation of the layouts is dependent on conditions defined in the declarative statements
and one or more values of one or more of the attributes. The method further includes organizing
the conditional patterns as a pattern definition. The pattern definition is stored on a computer
readable medium. The pattern definition is stored such that the pattern definition is retrievable
by an application program that uses the pattern definition to evaluate the conditional patterns
using values of attributes of one or more diagram elements. The application is also configured
to display representations of the diagram elements according to the layouts when conditions for
implementing the layouts are satisfied.

G06F 09/44

Title Workflow engine for execution of web mashups
Abstract A software-implemented workflow engine is described that executes a Web mashup within the
context of a Web browser running on a computer. The workflow engine is configured to parse
a Web mashup definition obtained from a remote server to identify distinct units of execution
within the Web mashup, referred to as components. The workflow engine is further configured to
obtain programming logic and metadata associated with each type of component identified in the
Web mashup definition from the remote server and to use such information to generate executable
versions of the identified components. Finally, the workflow engine is configured to run each of the
executable components, thereby executing the Web mashup. The workflow engine is configured
to manage the order of execution of each of the executable components so that the Web mashup
runs in an optimized and reliable fashion.

G06F 09/44

Title Exposing asynchronous mechanisms as first-class events
Abstract Conversions can be applied to various asynchronous and/or concurrent mechanisms. In
particular, such mechanism can be transformed into first-class events to facilitate processing with
respect to first-class events including but not limited to querying. Both conventional events and
asynchronous computations can be transformed to these events, for example by generating and
linking a proxy event thereto.

G06F 09/44

Title Efficient invariant inference for program verification
Abstract In one embodiment, a computer system identifies a portion of software code that is to be verified
using invariants. The computer system infers invariants from the software code portion at a
join point. The linear inequalities of the invariants include a first abstract domain that includes
linear equalities among variables, and a second, different abstract domain that includes intervals
for variables. The computer system selects variables that are to be applied within the linear
inequalities to form a linear equality and an interval based on the linear inequality and performs a
reduction operation on the variables to determine the substantially tightest numerical bounds for
the variable’s interval. The computer system also performs a join operation of the first and second
abstract domains, where the join results in a precise abstraction of various possible software
program states at the join point in the software program.

Title Sampling techniques for dynamic data-race detection
Abstract This document describes a dynamic data race detector that utilizes adaptive sampling techniques.
The adaptive sampling techniques include locating threads during execution of a multi-threaded
program and identifying thread-specific hot paths, thread-specific cold paths and lockset paths
during execution of the program. Once these paths are identified, they are sampled, potentially
at different rates. Any information gained during the sampling may be stored in a data race log,
which a developer may use to correct any identified program bugs

Title Cloud based source code version control
Abstract Source code version control is a technique for coordinating source code data and modifications
to the source code data between developers. Source code data and/or modifications may be
managed as archives. Systems and methods for source code version control operable within a
cloud computing environment are disclosed herein. A storage component may be configured
to store archive versions deriving from an archive. A root coordinator may be configured to
designate a current version of an archive. The root coordinator may change the designation of a
current archive upon determining a submitted archive version is a direct successor of a current
archive version. If a conflict exists and/or the submitted archive version is not a direct successor,
then a reconciler may mechanically resolve conflicts between the submitted archive version and
the current archive version to create a reconciled archive version for reconsideration by the root
coordinator.

G06F 09/445
20100131743 page 34 20100131745 page 35

for executing specific programmes Ü Programme loading or initiating
Title Suite-based integration and deployment of business products
Abstract Architecture having a single (or workbench) application via which a user can select and integrate
products for deployment to machines. The user can interact with the workbench application to
define an ERP (enterprise resource planning) system, for example. Products are added to the
workbench where the user has the option to configure product settings. Product dependencies are
automatically resolved such that settings previously input and that apply as passed to subsequent
products. The user then maps these product settings into roles which are assigned to individual
machines. The workbench then determines and ultimately queues up the actual deployment tasks
which need to occur on individual machines to configure each machine to match its associated
role(s). The user can then select which tasks (or all) to execute at which point the workbench
invokes remote configuration of said machines. Live progress and logging information is returned
through the workbench.

G06F 09/46

for executing specific programmes Ü Compilation or interpretation of
high level programme languages
20100131921 page 38

store of processing equipment to receive and retain programme Ü Multiprogram
arrangements
Title Leveraging low-latency memory access
Abstract Computational units of any task may run in different silos. In an embodiment, a search query may
be evaluated efficiently on a non-uniform memory architecture (NUMA) machine, by assigning
separate chunks of the index to separate memories. In a NUMA machine, each socket has an
attached memory. The latency time is low or high, depending on whether a processor accesses
data in its attached memory or a different memory. Copies of an index manager program, which
compares a query to an index, run separately on different processors in a NUMA machine. Each
instance of the index manager compares the query to the index chunk in the memory attached
to the processor on which that instance is running. Thus, each instance of the index manager
may compare a query to a particular portion of the index using low-latency accesses, thereby
increasing the efficiency of the search.

G06F 09/46

Title Multithreaded kernel for graphics processing unit
Abstract Systems and methods are provided for scheduling the processing of a coprocessor whereby
applications can submit tasks to a scheduler, and the scheduler can determine how much
processing each application is entitled to as well as an order for processing. In connection with this
process, tasks that require processing can be stored in physical memory or in virtual memory that
is managed by a memory manager. The invention also provides various techniques of determining
whether a particular task is ready for processing. A x201c;run listx201d; may be employed to
ensure that the coprocessor does not waste time between tasks or after an interruption. The
invention also provides techniques for ensuring the security of a computer system, by not allowing
applications to modify portions of memory that are integral to maintaining the proper functioning
of system operations.

G06F 09/46

G06F 09/46

Title Delete notifications for an entire storage volume
Abstract A delete notification can be received at a storage stack filter in a storage stack. It can be
determined whether the delete notification applies to an entire storage volume. If the delete
notification does not apply to the entire storage volume, a first set of actions can be taken with
the storage stack filter in response to the delete notification. If the delete notification does apply
to the entire storage volume, a second set of actions can be taken with the storage stack filter in
response to the delete notification.

G06F 11/34

store of processing equipment to receive and retain programme Ü Multiprogram
arrangements Ü Interprogramme communication
Title Instrumenting a website with dynamically generated code
Abstract A method, system, and medium are provided that relate to dynamically instrumenting a website.
In general, an exemplary aspect of the invention includes storing configuration information in a
datastore. A unique identifier, which corresponds to configuration information, is inserted within
code of one or more web pages that relate to the website. When content is requested from
the website, such as by a browser, the unique identifier can be used to retrieve corresponding
configuration information. Using corresponding configuration information, instrumenting code may
be generated and communicated, thereby instrumenting the website.
G06F 11/07: Electric digital data processing Ü Error detection Ü Responding

to the occurrence of a fault, e.g. fault tolerance
20100125762 page 17
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
Title Distributed system checker
Abstract A distributed system checker may check a distributed system against events to detect bugs in the
distributed system. The events may include machines crashes, network partitions, and packet
losses, for example. The distributed system checker may check a distributed system that can
have multiple threads and multiple processes running on multiple nodes. To obtain control over
a distributed system, a distributed system checker may insert an interposition layer between a
process and the operating system on each node.

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

or allocating within memory systems or architectures
Title Virtualized boot block with discovery volume
Abstract A file system independent virtualized boot block with discovery volume and cover files renders a
volume visible when accessed by an accessing system which differs from a source system. For
example, a downlevel operating system recognizes that data is present on a volume created in an
uplevel operating system, even where the uplevel data itself may not be accessible.

G06F 12/00

Title Data allocation and replication across distributed storage system
Abstract In a distributed storage system such as those in a data center or web based service, user
characteristics and characteristics of the hardware such as storage size and storage throughput
impact the capacity and performance of the system. In such systems, an allocation is a mapping
from the user to the physical storage devices where data/information pertaining to the user
will be stored. Policies regarding quality of service and reliability including replication of user
data/information may be provided by the entity managing the system. A policy may define an
objective function which quantifies the value of a given allocation. Maximizing the value of the
allocation will optimize the objective function. This optimization may include the dynamics in terms
of changes in patterns of user characteristics and the cost of moving data/information between
the physical devices to satisfy a particular allocation.

Title Using delete notifications to free related storage resources
Abstract A storage stack delete notification can be received at a storage stack filter. The delete notification
can indicate deletion of primary data in a primary storage region. Secondary data that is taking up
storage resources managed by the storage stack filter can be identified. The secondary data can
be associated with the primary storage region, and the storage resources can be resources other
than the primary storage region. It can be determined whether it is useful to have the secondary
data continue taking up the storage resources. If having the secondary data continue taking up
the storage resources is not useful, then the storage resources can be freed.

G06F 12/02

Title Management of ownership control and data movement in shared-memory systems
Abstract A method to exchange data in a shared memory system includes the use of a buffer in
communication with a producer processor and a consumer processor. The cache data is
temporarily stored in the buffer. The method includes for the consumer and the producer to
indicate intent to acquire ownership of the buffer. In response to the indication of intent, the
producer, consumer, buffer are prepared for the access. If the consumer intends to acquire the
buffer, the producer places the cache data into the buffer. If the producer intends to acquire the
buffer, the consumer removes the cache data from the buffer. The access to the buffer, however,
is delayed until the producer, consumer, and the buffer are prepared.

G06F 15/16
20100125549 page 22 20100125588 page 24 20100125714 page 44

or allocating within memory systems or architectures Ü Addressing or
allocation
20100114990 page 46 20100115216 page 47 20100125588 page 24

or allocating within memory systems or architectures Ü Protection against
unauthorised use of memory
Title Estimating and visualizing security risk in information technology systems
Abstract Security risk for a single IT asset and/or a set of IT assets in a network such as an enterprise or
corporate network may be estimated and represented in a visual form by categorizing risk into
different discrete levels. The IT assets may include both computing devices and users. The risk
categorization uses a security assessment of an IT asset that is generated to indicate the type
of security problem encountered, the severity of the problem, and the fidelity of the assessment.
The asset value of an IT asset to the enterprise is also assigned. Security risk is then categorized
(and a numeric risk value provided) for each IT asset for different problem types by considering
the IT asset value along with the severity and fidelity of the security assessment. The security risk
for the enterprise is estimated using the numeric risk value and then displayed in visual form.

or allocating within memory systems or architectures Ü Protection against
loss of memory contents
20100115216 page 47 20100125705 page 47
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
Title Remote computing platforms providing high-fidelity display and interactivity for clients
Abstract A x201c;Remote Display Generator,x201d; as described herein, provides various techniques
for providing high-fidelity displays with highly responsive interactive application experiences to
clients across a wide range of network bandwidths for remotely hosted applications. In general,
the Remote Display Generator uses a compression-friendly remote display architecture as a
core. With this compression architecture, actual screen data from a remote server is read
out from the display buffer frame by frame, and then compressed with a unified screen codec.
Other technologies, including timer-driven screen update models and adaptive transmission
mechanisms, are then integrated with various embodiments of the Remote Display Generator
to improve overall user experience by improving display quality and responsiveness to user
interaction with remotely hosted applications.

G06F 15/16

Title Do not disturb filter for electronic messages
Abstract Data is received defining a time period during which a notification of receipt should not be provided
when an electronic message is received. Data may also be received defining certain types of
messages for which notification of receipt should be provided during the time period. During the
duration of the time period, no notification of receipt is provided for received electronic messages
that are not within one of the specified types. After the time period has elapsed, notification
of receipt is provided for electronic messages received during the time period and for which no
notification of receipt was previously provided. Electronic messages may be sent during the time
period and electronic messages received prior to the time period may be displayed for reading
during the time period.

G06F 15/16

Title Content-recommendation message
Abstract Digital content items are shared using content-recommendation messages by recognizing an
indication of a digital content item to be recommended and recognizing an indication of an
intended recipient of the digital content item. A content-recommendation message for that digital
content item is then built. The content-recommendation message includes first instructions for
displaying, with a first visual appearance and a first feature set, information relating to the digital
content item if the intended recipient belongs to a first class. The content-recommendation
message includes second instructions for displaying, with a second visual appearance and a
second feature set, information relating to the digital content item if the intended recipient belongs
to a second class.

G06F 15/16

Title Authentication of a server by a client to prevent fraudulent user interfaces
Abstract Protecting a user against web spoofing in which the user confirms the authenticity of a web
page prior to submitting sensitive information such as user credentials (e.g., a login name and
password) via the web page. The web page provides the user with an identifiable piece of
information representing a shared secret between the user and the server. The user confirms
the correctness of the shared secret to ensure the legitimacy of the web page prior to disclosing
any sensitive information via the web page.

Title Service delivery online
Abstract In one embodiment, a computer system configures an online service to function as a service
delivery platform, where the online service includes a plurality of service delivery platform
components configured to process inputs received from services that are to be hosted by the
online service. The computer system receives an indication that a service is to be hosted using
the online service, where the indication includes a service configured for hosting by the online
service and a portion of use information indicating how the service delivery platform components
are to be used to host the service for various computer clients. The computer system processes
the portion of use information received with the indication to configure the service delivery platform
components in an appropriate manner for hosting the service and provides the hosted service to
computer clients in the appropriate manner as determined by the accessed use information.

G06F 15/16

Title Auto-resolve recipients cache
Abstract In embodiments, mobile devices request and utilize recipient caches. Recipient caches store
information regarding previous recipients of communications. The information on recipients
includes when the recipient was last contacted and the frequency with which a recipient is
contacted. In embodiments, a mobile device requests a recipient cache from a server. When
a user types a string of text, the mobile device then uses the recipient cache as well as the
contacts and emails on the mobile device and resolves a recipient list. In other embodiments, a
recipient cache on a server is updated when a mobile device sends a message with new recipient
information. In another embodiment, a server resolves conflicting messages by using recipient
information

Title Cross-domain communication technique for execution of web mashups
Abstract A system and method is described for communicating requests from a Web mashup being
executed within the context of a Web browser to third-party Web services in a manner that does
not violate the Same Origin Policy (SOP) observed by many Web browsers. In one embodiment,
a workflow engine operating in the context of a Web browser executes a plurality of executable
components comprising a Web mashup. The workflow engine transparently redirects Web service
requests generated by the executing components to a proxy server that acts as an intermediate
between the workflow engine and third-party Web services. The proxy server, which is not subject
to SOP, transmits the Web service requests to the third-party Web service and obtains requested
data therefrom. The proxy server further returns the requested data in a manner that is useable
by the Web mashup components.

G06F 15/16

Title Unified proxy location selection mechanism
Abstract Various embodiments enable network users to efficiently discover network proxies. A computing
device may employ various techniques to discover and collect network proxies from various
network domains. A user, through a network client or network device, can select one or more
proxies from the collected proxies and then query the selected proxies for information related to
a network service or resource. The user can then select a network service or resource based in
part on the proxy information.

G06F 15/16

Title Minimizing conflicts when synchronizing interrelated data between two systems
Abstract A method is presented for resolving conflicts between interrelated data on a client computer and
a server computer. Information for one or more tasks stored on a client computer is published to
a server computer. When one or more of the tasks are edited, at least one bit is set in a data
structure for each task in which a task attribute is changed. When a sync operation is performed,
tasks on the client computer are compared with a task list from the server computer. If any of the
bits in the data structure for the task are set, and the date and time that the task was last modified
on the server computer is later than the date and time that the client computer last initiated a sync
operation, the user is alerted to a conflict in the task and is permitted to manually resolve the
conflict.

Title Platform for enabling terminal services virtualization
Abstract Disclosed are techniques for providing a platform and application program interface (API)
that leverages a terminal services session broker infrastructure to support third party plug-in
applications. In a typical scenario, when a user requests for a connection to access third
party plug-in applications, the application program interface may interact with the session broker
process to identify sessions or suitable servers to which the user can be connected. The user
may access the third party plug-in applications through the identified sessions or suitable servers.

G06F 15/16

G06F 15/167

Title Hardware acceleration for remote desktop protocol
Abstract A method for offloading remote terminal services processing tasks to a peripheral device
that would otherwise be performed in a computer system’s processor and memory. In one
embodiment, the disclosed method is utilized in a layered network model, wherein computing
tasks that are typically performed in network applications are instead offloaded to a peripheral
such as a network interface card (NIC).

G06F 15/173
20100115424 page 11 20100125549 page 22 20100125612 page 25
20100125644 page 17

at least an arithmetic unit, a programme unit and a register, e.g. for
a simultaneous processing of several programmes Ü Interprocessor
communication Ü using a common memory, e.g. mailbox
20100122259 page 42

a simultaneous processing of several programmes Ü Interprocessor
communication Ü using an interconnection network, e.g. matrix, shuffle,
pyramid, star, snowflake
Title Lookup partitioning storage system and method
Abstract A method, system, and computer-readable medium for accessing and managing an online storage
system is disclosed. Access to a storage resource in a multiple server storage system is provided
by sending to a lookup partitioning service server a resource identifier that is associated with a
storage resource stored in a particular storage partition of a storage server. The LPS returns
the looked-up partition that stores the storage resource associated with the resource identifier.
Access to the storage resource is then enabled to the looked-up storage partition.

G06F 15/177

Title Service facade design and implementation
Abstract In one embodiment, a computer system receives registration information for available services
provided by a service provider. The registration information includes information identifying
functionality provided by the available services, and the registration information is used to register
the available services with the intermediary service. The computer system receives a service
request from a client computer system identifying a function that is to be performed by at least one
of the available services registered at the intermediary service. The computer system determines
which of the registered available services is configured to provide the functionality requested
by the client and processes the received service request using various system functionality
components, so that the service request is configured for service-specific processing provided by
a registered available service. The computer system also sends the processed service request to
the registered service determined to be configured to provide the functionality requested by the
client.

G06F 15/177

a simultaneous processing of several programmes Ü Initialisation or
configuration control
Title Common configuration application programming interface
Abstract A network and connection provisioning framework for configuring and provisioning multiple
aspects of network connectivity (e.g., multiple networks, media types, and/or connections).
The framework may comprise a unified configuration interface that enables an administrator to
configure multiple different types of network connectivity. A single configuration file comprising
settings for multiple aspects of network connectivity may be generated based on preferences
entered by a system administrator, or by exporting current settings from a particular computing
device. Global configuration policies or other configuration settings that span multiple types
of network connectivity may be also created and stored in one or more configuration files.
Stand-alone media managers and/or plug-in modules may implement one or more standardized
application programming interface functions so that they may interoperate with the network
and connection provisioning framework. The standardized API may be used to ensure that
configuration information is handled and stored in a standardized manner by different media
managers and/or plug-in modules.

G06F 15/177

Title Creating cross-technology configuration settings

G06F 15/177

Title Unified storage for configuring multiple networking technologies

G06F 15/177

Title Discovering and interacting with service providers
Abstract Embodiments provide searching features and functionality that can be used to provide service
provider data, but are not so limited. In an embodiment, a computing system can include a client
application or client that includes functionality to provide a number of service providers associated
with a particular function, service, and/or other provider feature(s). In one embodiment, a
computing device can include a client that can be used in conjunction with other end-user
applications to automatically provide a number of service providers based in part on a user
request.

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

data processing equipment or methods, specially adapted for specific
functions
Title Authentication in a network using client health enforcement framework
Abstract A network with authentication implemented using a client health enforcement framework.
The framework is adapted to receive plug-ins on clients that generate health information.
Corresponding plug-ins on a server validate that health information. Based on the results
of validation, the server may instruct the client to remediate or may authorize an underlying
access enforcement mechanism to allow access. A client plug-in that generates authentication
information formatted as a statement of health may be incorporated into such a framework.
Similarly, on the server, a validator to determine, based on the authentication information,
whether the client should be granted network access can be incorporated into the framework.
Authentication can be simply applied or modified by changing the plug-ins, while relying on the
framework to interface with an enforcement mechanism. Functions of the health enforcement
framework can be leveraged to provide authentication-based functionality, such as revoking
authorized access after a period of user inactivity or in response to a user command.

Title Multiple conditional formatting
Abstract Generally described, embodiments of the present invention relate to applying and evaluating
conditional formatting rules to a given range of cells. Additionally, multiple conditional formatting
rules may be evaluated to TRUE for the same cell contained in a user interface and multiple
formats applied to that cell.

G06F 17/00

G06F 17/00

Title Reference model for data-driven analytics
Abstract A taxonomy reference model for use in an analytical modeling component. The analytical
modeling component defines analytical relationships between the model parameters using
analytical relations. The analytical modeling component uses the analytical relations to identify
which of the model parameters are known and which are unknown, and solves for the identified
unknown model parameter(s). An analytics taxonomy categorizes the analytics relations into
analytics categories. This analytics taxonomy may be domain-specific. Also, if the analytics drive
visuals, the visuals could be taxonomized as well. If the analytics is driven by data, the data could
also be taxonomized.

G06F 17/00

Title User-authored notes on shared documents
Abstract User-authored notes on shared documents may be provided. A shared document may be stored
and at least one note may be associated with the document. When a user displays the document,
the associated not may be retrieved and a user interface element may be provided to allow the
user to view the note.

G06F 17/21
20100114986 page 20 20100120531 page 6

functions Ü Complex mathematical operations
20100131248 page 66

functions Ü Handling natural language data Ü Text processing
Title Data-driven actions for network forms
Abstract Systems and/or methods are described that enable a data-driven action associated with altering a
data instance of a network form without altering and/or having access to the data instance. These
systems and/or methods, in one embodiment, render a result of a data-driven action for a network
form without transforming the network form’s data instance. In another embodiment, the systems
and/or methods map a data-driven action to a view-centric logical representation of the electronic
form.

G06F 17/28
20100125573 page 16

functions Ü Handling natural language data Ü Processing or translating
of natural language
Title Transforming math text objects using build down and build up
Abstract Architecture that transforms a built-up mathematical object into a modified linear format object
using a customized build down. To transform objects, appropriate changes can be introduced
in association with (e.g., prior to or as part of) the build down process to obtain linear format
representations for the modified math objects. For example, prior to build-down, linear format
operators can be inserted. As part of the build-down, linear format operators can be deleted or
changed, and object arguments can be deleted. The modified linear format math object is then
built back up into a modified built-up object.

G06F 17/30

functions Ü Information retrieval
Title Transcode matrix
Abstract A transcode architecture determines if a media source file needs to be transcoded for playback
on a target playback device, and if so, the proper format needed for transcoding the source file.
A transcode architecture includes a transcode manager, a transcode matrix, a transcode engine
and a cache for storing transcoded media files. A media library stores media source files and
device capabilities information. The transcode manager controls a transcode process in which
the transcode matrix generates a profile for a media source file and accesses device capabilities
that indicate playback capabilities for a target playback device. The transcode matrix compares
parameters of the source profile with the device capabilities to decide whether the source file must
be transcoded to enable playback of the file on the target playback device, and if so, the proper
format needed for transcoding the source file.

G06F 17/30

Title Replication for common availability substrate
Abstract Systems and methods that supply a replication layer/agent that is generic to supporting a plurality
of storage configuration as part of a distributed store. Such distributed store employs a Common
Availability Substrate (CAS) for data transport and consistency, to render the distributed store
scalable and available. Such an arrangement enables continuous operation of the store, while the
replication subsystem creates new replicas (e.g., for load balancing, failover, and the like).

Title Configuration management in distributed data systems
Abstract Systems and methods for managing configurations of data nodes in a distributed environment A
configuration manager is implemented as a set of distributed master nodes that may use quorum-
based processing to enable reliable identification of master nodes storing current configuration
information, even if some of the master nodes fail. If a quorum of master nodes cannot
be achieved or some other event occurs that precludes identification of current configuration
information, the configuration manager may be rebuilt by analyzing reports from read/write
quorums of nodes associated with a configuration, allowing automatic recovery of data partitions.

G06F 17/30

Title Atomic mulitple modification of data in a distributed storage system
Abstract Atomic multiple modifications of streams is provided. Streams are selected for the application of
an atomic multiple modification. A lock is acquired on the meta-data associated with the streams.
Each stream is de-coupled from its name. Multiple modifications are applied to the selected
streams. After performing the modifications, names are coupled to the streams. The lock on the
meta-data associated with each stream is released.

G06F 17/30

Title Inferred relationships from user tagged content
Abstract A tagged content inference system and method is provided. The system facilitates browsing
of content with a pseudo-hierarchical feel using algorithmically-deduced relationships between
items based on user applied tags. Based, at least in part, upon tagged content, an inference
component can infer relationships between items (e.g., creating a pseudo-hierarchy) in order to
facilitate browsing of the items.

Title Dynamic fragmentation of digital media
Abstract Media fragmentation may be provided. First, a request for a manifest may be received from a
client. Then, in response to the received request for the manifest, the manifest may be sent to the
client. Next, a request may be received from the client for a file fragment. The request may indicate
a start time and an end time corresponding to the file fragment. The request may be in a format
defined by the manifest. Then a lookup table may be queried for a first byte location in a media
file corresponding to the start time and a second byte location in the media file corresponding to
the end time. Next, a portion of the media file between the first byte location and the second byte
location may be extracted from the media file. The portion may comprise the file fragment. The
file fragment may be sent to the client.

G06F 17/30

Title Customized search
Abstract Techniques are disclosed herein for providing a custom search engine. In one aspect, a first
search query is received from a requestor. First search results contain search result items that
match the first search query are obtained. A least one sub-query is generated from the first search
results. The generating is based on rules for a particular custom search engine. Second search
results that match the sub-query are then obtained. A search result set is formed from a corpus
that includes the first search results and the second search results. The generating of the search
result set is based on the rules for the particular custom search engine. The search result set
is provided to the requester. In one aspect an interface for designing a custom search engine is
provided. The interface allows the designer to specify the layout of a search results page.

G06F 17/30

Title Realtime popularity prediction for events and queries
Abstract A system, media, and method for realtime popularity prediction for event and queries are provided.
The popularity prediction is made by a prediction engine that is coupled to a search engine, a
crawler, and a sentiment component. The prediction engine determines a change in popularity
for an event or a query based on content provided by the crawler, sentiments identified by the
sentiment component, and queries received in realtime by the search engine. The prediction
engine may also use the content, sentiments, and queries to predict an outcome for a popularity
based event.

Title Modeling party identities in computer storage systems
Abstract The present invention extends to methods, systems, and computer program products for modeling
party identities in computer storage systems. A federated identity fabric models identity data
and relationships between portions of indentify data in computer storage systems in accordance
with a uniform schema. The federated identity fabric can federate distributed identity and
identity relationship data from computer storage systems within the variety of different computing
environments. Code and metadata at computing environments associated with the federated
identity fabric can interoperate to facilitate uniformly storing, accessing, modifying, deleting, and
securing identity and identity relationship data within the federated identify fabric. Embodiments
of the invention include utilizing an identity key table entry to locate party identity information and
performing key transformations between different types of identity keys.

G06F 17/30

Title Incremental lock-free stack scanning for garbage collection
Abstract Concurrent, incremental, and lock-free stack scanning for garbage collectors is disclosed. This
method uses a summary table and return barriers to allow high responsiveness. The method also
supports programs that employ fine-synchronization to avoid locks, imposes negligible overhead
on program execution, can be used with existing concurrent collectors, and supports the special
in-stack references existing in languages such as C.

G06F 17/30

Title Computing device with relatively limited storage space and operating/file system thereof
Abstract A computing device includes a storage device and a file system for storing and retrieving files on
the storage device. The storage device includes storage space divided into sectors and the file
system externally addresses the storage device on a per-sector basis, but internally divides each
sector of the storage device into chunks and manages data within each sector on a per-chunk
basis. Thus, the file system reads a chunk from or writes a chunk to the storage device by reading
or writing the sector having the chunk.

Title Aggregating discovery data in a discovery interface
Abstract A discovery interface presents aggregated discovery data in a discovery interface through which a
user may select between television content and Internet Protocol content. In one implementation,
the discovery interface includes a television channel region associated with a television channel
that lists television programs. The discovery interface further includes an Internet Protocol content
region associated with the television channel that lists Internet Protocol content based on user
navigation within the television channel region.

G06F 17/30

Title Selection of media content item having preferred instance attributes
Abstract The selection of a media content item having preferred instance attributes includes finding a
preferred instance of a media content item having two or more different instances by recognizing
a first instance of the media content item having a first set of instance attributes and recognizing
a second instance of the media content item having a second set of instance attributes. The
selection of a media content item having preferred instance attributes further includes selecting
either the first instance of the media content item or the second instance of the media content item
based on differences between the first set of instance attributes and the second set of instance
attributes.

G06F 17/30

Title Index optimization for ranking using a linear model
Abstract Technologies are described herein for providing a more efficient approach to ranking search
results. An illustrative technology reduces an amount of ranking data analyzed at query time.
In the technology, a term is selected, at index time, from a master index. The term corresponds
to a number of documents greater than a threshold. A set of documents that includes the term
is selected based on the master index. A rank is determined for each document in the set of
documents that contains the term. Each document in the set of documents that contains the term
is assigned to a top document list or a bottom document list based on the rank. Predefined values
of at least part of the rank are stored in the top document list for documents in the top document
list and are not stored in the bottom document list for documents in the bottom document list.

Title Reporting language filtering and mapping to dimensional concepts
Abstract Architecture that translates a complex dimensional hierarchy (e.g., XBRL) into an understandable
member picker which removes the complexities that the user would otherwise have to face. Using
a building block metaphor, the architecture provides element and dimension tagging. The building
blocks can include rows, columns, and optional trees. Building blocks are selected and grouped
into a report definition, which definition is utilized to retrieve and process basis data into fact data
in the final reports. The reporter mechanism removes the complexities in both the XBRL standard
and XML, and ensures that the user associates the information appropriately within the report
definition. The architecture extends the building block metaphor to include dimension tagging. A
portion of the information from each building block is used to produce a fully qualified dimension
context and logical validation is performed to ensure accuracy.

G06F 17/30

Title Network-accessible virtual shopping cart
Abstract The network-accessible virtual shopping cart includes shopping for digital content with a portable
device. The portable device receives an instruction to add a digital content item to a virtual
shopping cart. If a network connection to a network-accessible virtual shopping cart is available,
the digital content item is added to the network-accessible virtual shopping cart. If a network
connection to the network-accessible virtual shopping cart is not available, the digital content
item is added to a local virtual shopping cart. Upon the network-accessible virtual shopping cart
becoming available, digital content items are moved from the local virtual shopping cart to the
network-accessible virtual shopping cart.

G06F 17/30

Title Deterministic selection of domain controllers in a multi-master database distributed directory
service
Abstract Data is maintained that identifies the available domain controllers for performing management
actions with respect to a distributed directory service database. When a request is received
to perform a management action on a directory service database object, the particular domain
controller that is to perform the management action, called the master domain controller, is
selected deterministically. Once the master domain controller has been identified, a request to
perform the management action is transmitted to the master domain controller. The failure of
a master domain controller will cause the identification of that domain controller to be removed
from the data that identifies the available domain controllers and a deterministic failover to be
performed to another master domain controller.

Title Linking enterprise resource planning data to business capabilities
Abstract The present invention extends to methods, systems, and computer program products for linking
enterprise resource planning data to business capabilities. Embodiments provide a linkage
between schematized ERP data (e.g., financial data) and schematized business capabilities. The
linkage provides the ability to report in a visual way that permits the linkage of such things as
business value, performance, maturity, interconnectedness, process standardization, compliance,
etc. As such, businesses capabilities can be linked to specific spend amounts in ERP data.

G06F 17/30

Title Flattening multi-dimensional data sets into de-normalized form
Abstract Performance metrics data in a multi-dimensional structure such as a nested scorecard matrix
is transformed into a flat structure or de-normalized for efficient querying of individual records.
Each dimension and header is converted to a column and data values resolved at intersection
of dimension levels through an iterative process covering all dimensions and headers of the data
structure. A key corresponding to a tuple representation of each cell or a transform of the tuple
may be used to identify rows corresponding to the resolved data in cells for further enhanced
query capabilities.

G06F 17/30

Title Implementation of stream algebra over class instances
Abstract Creating and executing a distributed stream processing operator graph based on a query. The
operator graph includes movable stream algebra operators for processing events received from
high volume data streams. The operators are partially compiled and distributed to computing
devices for completion of the compilation and subsequent execution. During execution, the
operators maintain minimal state information associated with received events via an expiration
time assigned to each of the event instances. Additional events are generated and aggregated by
the operators for communication to a service responsible for the query.

G06F 17/30
App. No. 20100131546 Assignee Microsoft Way

Title Search and exploration using analytics reference model
Abstract Searching and exploration using a data-driven analytics model. The analytics model includes
an analytical modeling component that defines analytical relationships between model variables
using a number of analytical relations. In response to a search request, the output variable(s) of
the solve operation are identified. The output variable(s) may have even been identified based
on the search request. The analytical relations of the model may then be used to solve for the
identified output variable(s). The resulting value(s) for the now solved-for output variable(s) may
then be used to formulate the response to the search request. The nature of the response may
vary depending on the scope of the application that embodied the search request capability. The
results of the search request may be used for further exploration of the model by, for example,
submitting follow-up search requests, resulting in follow-up solve operations.

G06F 17/50
20100110099 page 30 20100114846 page 32 20100114885 page 19
20100114908 page 19 20100114931 page 10 20100114986 page 20
20100114990 page 46 20100121841 page 33 20100121855 page 58
20100121865 page 41 20100121888 page 21 20100121922 page 53
20100125549 page 22 20100125557 page 23 20100125558 page 31
20100125573 page 16 20100125578 page 31 20100125588 page 24
20100125612 page 25 20100125613 page 25 20100131486 page 26
20100131487 page 27 20100131494 page 18 20100131556 page 28

G06F 17/50

functions Ü Computer-aided design
Title Financial journals in financial models of performance servers
Abstract Architecture that employs a journal assignment that can be created on demand when journal is
created, and operates outside the business cycle. The assignment is routed to reviewers and
approvers based on predefined company policy that users define. The assignment encloses
a changelist of data changes created by the journal. The changelist is used for rendition and
calculation for reviewers and approvers (in addition to the journal contributor) to view/verify and
modify the data as if the data is already written into the model. At the time that other users access
this model, the data is not present. At the end of the successful workflow chain the changelist is
written into the model. If failed, the changelist will be used as that basis for correction or the user
can discard the changelist.

Title Use of taxonomized analytics reference model
Abstract The composition of a data-driven analytics model that includes at least an analytical modeling
component that defines analytical relationships between the model parameters using multiple
analytical relations. The analytical modeling component uses the analytical relations to identify
which of the model parameters are known and which are unknown, and solves for the identified
unknown model parameter(s). The analytics modeling component also includes an analytics
taxonomy in which the analytical relations are categorized into related analytics categories.
Navigation through the analytics taxonomy assists in the composition of an analytics model. The
analytics taxonomy may, but need not, be domain specific.

G06F 17/50

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

for protecting computers or computer systems against unauthorised
activity
Title Combining a mobile device and computer to create a secure personalized environment
Abstract A mobile device, such as a mobile phone, smart phone, personal music player, handheld game
device, and the like, when operatively combined with a PC, creates a secure and personalized
computing platform through configuration of the mobile device’s CPU (central processing unit)
and OS (operating system) to function as an immutable trusted core. The trusted core in the
mobile device verifies the integrity of the PC including, for example, that its drivers, applications,
and other software are trusted and unmodified, and thus safe to use without presenting a threat to
the integrity of the combined computing platform. The mobile device can further optionally store
and transport the user’s personalization datax2014;including, for example, the user’s desktop,
applications, data, certificates, settings, and preferencesx2014;which can be accessed by the PC
when the devices are combined to thus create a personalized computing environment.
G06F 21/20: Electric digital data processing Ü Security arrangements

for protecting computers or computer systems against unauthorised
activity Ü by restricting access to nodes in a computer system or computer
network
20100115578 page 64
G06G 07/48: Analogue computers Ü Devices in which the computing

operation is performed by varying electric or magnetic quantities Ü
Analogue computers for specific processes, systems, or devices, e.g.
simulators
Title Hybrid solver for data-driven analytics
Abstract A complex solver that is able to solve a diverse variety of model analytics. Upon identifying the
various input variable(s) and output variable(s) of the model variables, if a straight forward solve
is not to be performed, it is determined whether the model analytics is to be inverted such that a
forward solve can be performed. For instance, it might not be known generally, or at least to the
solver, how to invert a particular equation of other model analytics. If the model analytics is to be
inverted, the model analytics is inverted, and the forward solve is performed. On the other hand,
if the inversion of the model analytics is not to be performed, then a numerical analysis solve is
performed.

G06K 09/00

G06K 09/34
20100131254 page 86 20100131546 page 84
G06K 09/00: Recognition of data Ü Methods or arrangements for reading

or recognising printed or written characters or for recognising patterns,
e.g. fingerprints
Title Determining user similarities based on location histories
Abstract Method for determining similarities between a first user and a second user in a network, including
receiving one or more Global Positioning System (GPS) logs from each user in the network,
constructing a first hierarchal graph for the first user’s GPS log and a second hierarchical graph
for the second user’s GPS log, and calculating a similarity score between the first user and the
second user based on the first hierarchal graph and the second hierarchical graph.

e.g. fingerprints Ü Image acquisition Ü Segmentation of touching or
overlapping patterns in the image field
Title Converting 2d video into stereo video
Abstract Two-dimensional (2D) video is converted into multi-view video. The 2D video is segmented
to generate a temporally consistent segmented 2D video which is made up of a sequence of
segmented frames. The multi-view video is generated by employing user-guided operations
to generate depth assignments for the segments associated with user-assigned regions of the
segmented frames, where a user-assigned region is formed from a group of contiguous segments
selected by the user.

G06K 09/34

Title Image segmentation
Abstract Segmentation of foreground from background layers in an image may be provided by a
segmentation process which may be based on one or more factors including motion, color,
contrast, and the like. Color, motion, and optionally contrast information may be probabilistically
fused to infer foreground and/or background layers accurately and efficiently. A likelihood of
motion vs. non-motion may be automatically learned from training data and then fused with a
contrast-sensitive color model. Segmentation may then be solved efficiently by an optimization
algorithm such as a graph cut. Motion events in image sequences may be detected without explicit
velocity computation.

G06K 09/34

Title System and method for binary persistence format for a recognition result lattice
Abstract A system and method for storing document data in a serialized binary format recognition lattice
structure so that the data is accessible to other applications. The lattice structure is generated
that includes root node data. Child nodes correspond to columns of the recognition lattice. Each
node includes a descriptor that is a collection of flags indicating presence of specific components
of the node. The child nodes may include grandchild nodes with similar structure corresponding
to elements within the columns. Each node further includes property information associated with
the node. The recognition lattice is stored in a serial binary data format.

Title Labeling image elements
Abstract An image processing system is described which automatically labels image elements of a digital
image. In an embodiment an energy function describing the quality of possible labelings of an
image is globally optimized to find an output labeled image. In the embodiment, the energy
function comprises terms that depend on at least one non-local parameter. For example, the
non-local parameter describes characteristics of image elements having the same label. In an
embodiment the global optimization is achieved in a practical, efficient manner by using a tree
structure to represent candidate values of the non-local parameter and by using a branch and
bound process. In some embodiments, the branch and bound process comprises evaluating a
lower bound of the energy function by using a min-cut process. For example, the min-cut process
enables the lower bound to be evaluated efficiently using a graphical data structure to represent
the lower bound.

G06K 09/54

e.g. fingerprints Ü Image preprocessing, i.e. processing the image
information without deciding about the identity of the image
20100111410 page 49

e.g. fingerprints Ü Image preprocessing, i.e. processing the image
information without deciding about the identity of the image Ü Combinations
of preprocessing functions
Title Identifying portions of an image for cropping
Abstract Cropping images while retaining the relevant portions of the images. The images are cropped
based on an orientation of the images. For the images having a portrait orientation, the images
are cropped outside a region defined by a parallelogram centered along a golden section line. For
the images having a landscape orientation, the images are cropped outside a region defined by
a parallelogram centered along a midpoint line. In some embodiments, the images are cropped
into squares for display on a mobile computing device having a 169 aspect ratio.

G06N 05/00
G06K 19/06: Recognition of data Ü Record carriers for use with machines
and with at least a part designed to carry digital markings Ü characterised
by the kind of the digital marking, e.g. shape, nature, code
20100127823 page 29
G06K 19/07: Recognition of data Ü Record carriers for use with machines
and with at least a part designed to carry digital markings Ü characterised
by the kind of the digital marking, e.g. shape, nature, code Ü Record
carriers with conductive marks, printed circuits or semiconductor circuit
elements, e.g. credit or identity cards Ü with integrated circuit chips
20100127823 page 29
G06N 05/00: Computer systems based on specific computational models

Ü Computer systems utilizing knowledge based models
Title Providing suggested sites associated with target sites
Abstract Systems, methods, and computer storage media having computer-executable instructions
embodied thereon that facilitate providing suggested sites in accordance with target sites are
provided. Web-browsed data is locally stored on a user device and uploaded to a suggestion
engine. Additional web-browsed data is communicated to the suggestion engine via a suggested
site request that provides a request for suggested sites related to a target site. In embodiments,
the web-browsed data contained in the suggested site request includes data not previously
uploaded to the suggestion engine. The suggestion engine utilizes the web-browsed data
uploaded to the suggestion engine and the web-browsed data communicated via the suggested
site request to provide suggested sites in association with the target site.

G06Q 10/00

Ü Computer systems utilizing knowledge based models Ü Knowledge
representation
20100121841 page 33

Ü Computer systems utilizing knowledge based models Ü Inference
methods or devices
20100114881 page 73 20100125912 page 49
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
Title Priority and cost based deadlock victim selection via static wait-for graph
Abstract Systems and methods that enable resolving deadlock cycles by victim selection based on cost
and/or priority of strongly connected components in a static wait-for graph. As such, victims
can be selected by iteratively estimating total deadlock resolution cost (based on cost of strongly
connected components) for remaining deadlock participants, selecting the participant with the
least estimated total cost as the next victim, and reducing the wait-for graph after removing the
victim vertex. The victim selection algorithm can be a cost-based greedy algorithm, wherein
during each victim selection iteration, a single optimal victim is selected based on estimated
remaining cost.

G06Q 10/00

Title Review summaries for the most relevant features
Abstract A method, system, and medium are provided for capsule summaries of reviews, such as product
and service reviews. Raw comments and reviews are collected from several sources, which can
be obtained from different locations, such as Internet sites. A number of features for each product
or service category are developed, which are then correlated to the collected comments and
reviews. A rating is assigned to each comment and review, which indicates the level of positivity
or negativity of the comment or review. Ratings for each feature are combined to give an overall
rating of the product or service under review. More relevant results, such as the most positive and
the most negative reviews of each feature, along with the overall rating, are returned to a user
to provide a quick summary of the selected product or service. If a user would like more details
or more results, options are provided to go deeper into the capsule summary to obtain as much
information or detail as desired.

G06Q 30/00
20100131330 page 81

forecasting purposes Ü Commerce, e.g. marketing, shopping, billing,
auctions or e-commerce
Title Social discovery of digital content
Abstract Shopping for digital content may be facilitated by offering to a shopper a plurality of digital content
items available for acquisition via a network-accessible virtual storefront. Further, for a digital
content item selected within the network-accessible virtual storefront, one or more shopper-
confirmed friends having a usage history with the selected digital content item can be identified.

G06Q 30/00

Title Social network referral coupons
Abstract The claimed subject matter provides a system and/or a method that facilitates enhancing coupon
distribution in a non-evasive manner based upon a referral. A social network can include two
or more users with at least one actively acknowledged connection that indicates a relationship
between a first user and a second user. An interface can receive a referral from the first user
associated with the social network, wherein the referral describes an experience related to at least
one of a business or a service. A viral coupon component can implement a non-evasive delivery
of a coupon to the second user based upon leveraging the relationship between the first user and
the second user, wherein the coupon is incorporated within at least one of an advertisement or
a listing. The vial coupon component delivery of the coupon can be triggered based upon the
second user actively investigating at least one of the business or the service.

G06Q 30/00

Title Context-sensitive advertising for mobile content
Abstract Various embodiments provide context-sensitive advertising for content on a mobile device.
In some embodiments, context information about a mobile device, a user of the device,
and/or content to be consumed on the device is used to formulate an advertisement request.
The advertisement request is submitted to an advertisement source, which gathers relevant
advertisements that correspond to the context information. The relevant advertisements are
provided to the mobile device, and one or more of the relevant advertisements are injected into
content, by the mobile device, before the content is consumed by a user of the device. In some
embodiments, an advertisement is marked with a sentinel marker when it is injected into content.
When the content is to be sent from the device, the sentinel marker is detected and the marked
advertisement is removed from the content before the content leaves the device.

G06T 01/00

Title Online service syndication
Abstract Embodiments described herein are directed to syndicating an online service to at least one
syndication partner of a syndicator. In one embodiment, a computer system determines that
a syndication relationship has been established between a syndicator and a syndication partner,
where the syndication relationship is established to provide syndicated services to syndication
partners and clients. The computer system indicates which services provided by the syndicator
are available for syndication to the syndication partner and which type of usage information the
partner is to provide in order to use the syndicator’s services. The computer system receives
usage information from the syndication partner specifying which services are to be syndicated and
specifying parameters for those services indicating operating parameters specific to the use of the
syndicated services. Based on the received usage information, the computer system provides the
service to the syndication partner in the manner indicated by the received usage information.
20100125484 page 96 20100125512 page 80 20100131351 page 7

forecasting purposes Ü Finance, e.g. banking, investment or tax processing
20100125471 page 86

forecasting purposes Ü Systems or methods specially adapted for a
specific business sector, e.g. health care, utilities, tourism or legal
services
20100114726 page 97

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

purpose image data processing
Title Mode information displayed in a mapping application
Abstract Provided is a single repository for capturing, connecting, sharing, and visualizing information
based on a geographic location, for example. Detailed information about a structure or other
object information can be displayed as mode information. An object of interest can be identified
by monitoring a user activity or inactivity with regard to a displayed map. If the user hovers a
pointing device over an object within the displayed map for longer than a predetermined amount
of time, it can be inferred that the user should be presented with additional information regarding
the object.

G06T 15/70

G09G 03/20
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
Title Software-aided creation of animated stories
Abstract Software-assistance that allows a child or other author to generate a story. The author may
generate their own content and add that author-generated content to the story. For instance,
the author could drawn their own background, background items, and/or characters. These
drawn items could even be added to a library so that they could be reused in other stories. The
author can define their own animations associated with characters and background items, rather
than selecting predefined animations. The story timeline may also keep track of events that are
caused by the author interacting with the story in particular ways, and that represents significant
story changes. The author may then jump to these navigation points to delete the event thereby
removing the effects of the story change.
G08B 05/22: Signalling or calling systems Ü Visible signalling systems,

e.g. personal calling systems, remote indication of seats occupied Ü
using electric transmission
20100111372 page 90

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

using static means to present variable information Ü Control arrangements
or circuits, of interest only in connection with visual indicators other
than cathode-ray tubes Ü for presentation of an assembly of a number
of characters, e.g. a page, by composing the assembly by combination
of individual elements arranged in a matrix
Title Functional image representation
Abstract A display apparatus described herein includes a display screen and a display processor.
The display processor includes a plurality of function units that comprise functions that are
representative of data that is desirably displayed on the display screen. The display processor is
configured to receive configurations, compositions, and/or parameters for the plurality of function
units. In addition, the display processor displays data on the display screen based at least in part
upon output of the plurality of function units.

G10L 15/04

or circuits for visual indicators common to cathode-ray tube indicators
and other visual indicators
Title Parallel poisson disk sampling
Abstract Stochastic sample sets with blue noise statistical characteristics are obtained by subdividing
a sample domain into cells and drawing samples concurrently from multiple cells which are
sufficiently far apart that their samples cannot conflict one another. Cells are traversed in various
orders for sampling, such as scanline, grid-partition-plus-scanline, random-partition, random-with-
multi-resolution, and grid-partition-plus-random. Sampling may be uniform or adaptive. Poisson
disks, Poisson spheres and other higher-dimensional stochastic sample sets may be generated.

or circuits for visual indicators common to cathode-ray tube indicators
and other visual indicators Ü characterised by the way in which colour
is displayed
20100110099 page 30
G10L 15/00: Speech analysis or synthesis Ü Speech recognition

Title Speech processing
Abstract The described implementations relate to speech spelling by a user. One method identifies one or
more symbols that may match a user utterance and displays an individual symbol for confirmation
by the user.

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

Segmentation or word limit detection
Title Retrieval using a generalized sentence collocation
Abstract A method and system for identifying documents relevant to a query that specifies a part of speech
is provided. A retrieval system receives from a user an input query that includes a word and a
part of speech. Upon receiving an input query that includes a word and a part of speech, the
retrieval system identifies documents with a sentence that includes that word collocated with a
word that is used as that part of speech. The retrieval system displays to the user an indication of
the identified documents.
G10L 15/18: Speech analysis or synthesis Ü Speech recognition Ü

Speech classification or search Ü using natural language modelling
Title Facilitating multimodal interaction with grammar-based speech applications
Abstract Multimodal interaction with grammar-based speech applications may be facilitated with a device
by presenting permissible phrases that are in-grammar based on acceptable terms that are in-
vocabulary and that have been recognized from a spoken utterance. In an example embodiment,
a spoken utterance having two or more terms is received. The two or more terms include one or
more acceptable terms. An index is searched using the acceptable terms as query terms. From
the searching of the index, permissible phrase(s) are produced that include the acceptable terms.
The index is a searchable data structure that represents multiple possible grammar paths that
are ascertainable based on acceptable values for each term position of a grammar-based speech
application. The permissible phrase(s) are presented to a user as option(s) that may be selected
to conduct multimodal interaction with the device.

G10L 19/08
20100121639 page 105
G10L 19/08: Speech analysis or synthesis Ü Speech or audio signal

analysis-synthesis techniques for redundancy reduction, e.g. in vocoders
Ü using predictive techniques Ü Determination or coding of the excitation
function
Title Audio encoding and decoding with intra frames and adaptive forward error correction
Abstract Various strategies for rate/quality control and loss resiliency in an audio codec are described.
The various strategies can be used in combination or independently. For example, a real-time
speech codec uses intra frame coding/decoding, adaptive multi-mode forward error correction
[x201c;FECx201d;], and rate/quality control techniques. Intra frames help a decoder recover
quickly from packet losses, while compression efficiency is still emphasized with predicted frames.
Various strategies for inserting intra frames and signaling intra/predicted frames are described.
With the adaptive multi-mode FEC, an encoder adaptively selects between multiple modes to
efficiently and quickly provide a level of FEC that takes into account the bandwidth currently
available for FEC. The FEC information itself may be predictively encoded and decoded relative
to primary encoded information. Various rate/quality and FEC control strategies allow additional
adaptation to available bandwidth and network conditions.

H01Q 01/24
G10L 21/00: Speech analysis or synthesis Ü Processing of the speech

signal to produce another audible or non-audible signal, e.g. visual or
tactile, in order to modify its quality or its intelligibility
20100121639 page 105
H01Q 01/24: Aerials Ü Details of, or arrangements associated with,

aerials Ü Supports Ü by structural association with other equipment
or articles Ü with receiving set
Title Bent monopole antenna with shared segments
Abstract A bent monopole antenna with shared segments is capable of tri-band communication. In an
example embodiment, an antenna assembly includes a substrate, a first bent monopole, a second
bent monopole, and a third bent monopole. The first, second, and third bent monopoles are
disposed on the substrate. The first bent monopole includes a feedline segment and a first
segment. The second bent monopole includes the feedline segment and the first segment. The
third bent monopole includes the feedline segment and a second segment. The first, second, and
third bent monopoles share the feedline segment, while the first and second bent monopoles also
share the first segment. A T-junction is formed by the feedline segment, the first segment, and
the second segment. In an example implementation, the first segment has a first width, and the
second segment has a second width, with the first width being greater than the second width.

H01Q 15/14
H01Q 05/00: Aerials Ü Arrangements for simultaneous operation of

aerials on two or more different wavebands
20100117909 page 108
H01Q 09/04: Aerials Ü Electrically-short aerials having dimensions not

more than twice the operating wavelength and consisting of conductive
active radiating elements Ü Resonant aerials
20100117909 page 108
H01Q 15/14: Aerials Ü Devices for reflection, refraction, diffraction, or

polarisation of waves radiated from an aerial, e.g. quasi-optical devices
Ü Reflecting surfaces
Title Wireless antenna for emitting conical radiation
Abstract An antenna described herein includes a driven patch that is configured to emit radiation in a
broadside direction in response to receiving excitation current, wherein the driven patch has a
first radiating edge and a second radiating edge that are approximately parallel to one another.
The antenna also includes a reflector element that is configured to reflect radiation emitted from
the first radiating edge in a quasi-endfire direction. The antenna can also include two director
elements that are configured to direct radiation emitted from the second radiating edge of the
driven patch in a quasi-endfire direction.

H04B 07/00
H04B 07/00: Transmission Ü Radio transmission systems, i.e. using

radiation field
Title Channel reuse with cognitive low interference signals
Abstract A computing system in which devices communicate wirelessly as secondary users in a band
assigned to primary users. The computers communicate using new signals developed to reduce
disruption to primary users of the band. The new signals may be produced by sensing, or
otherwise determining, signals used by primary users and developing signals using a modulation
scheme or other signal parameters that provides little disruption to primary users. These
techniques make available to users unused and/or underused portions of the radio spectrum, such
as whitespaces between television channels. The new signals may be generated by software
defined radios within the computing devices or by switching between modulation schemes
supported by conventional wireless network interface card.

H04L 09/00
H04B 07/24: Transmission Ü Radio transmission systems, i.e. using

radiation field Ü for communication between two or more posts
20100117926 page 109
H04L 09/00: Transmission of digital information, e.g. telegraphic communication

Ü Arrangements for secret or secure communication
Title Universal secure token for obfuscation and tamper resistance
Abstract Program obfuscation is accomplished with tamper proof token including an embedded oracle. A
public obfuscation function can be applied to any program/circuit to produce a new obfuscated
program/circuit that makes calls to the corresponding oracle to facilitate program execution. A
universal circuit representation can be employ with respect to obfuscation to hide circuit wiring
and allow the whole circuit to be public. Furthermore, the token or embedded oracle can be
universal and stateless to enable a single token to be employed with respect to many programs.

H04L 09/00

Title Digital rights management scheme for an on-demand distributed streaming system
Abstract A DRM scheme that may be optionally invoked by the owner. With the DRM protection turned
on, the media is encrypted before it is distributed in a P2P network, and is decrypted prior to
its use (play back). The peers may still efficiently distribute and serve without authorization
from the owner. Nevertheless, when the media is used (played back), the client node must
seek proper authorization from the owner. The invention further provides a hierarchical DRM
scheme wherein each packet of the media is associated with a different protection level. In the
hierarchical DRM scheme of the invention there is usually an order of the protection level. As a
result, in one embodiment of the invention, the decryption key of a lower protection layer is the
hash of the decryption key at the higher protection level. That way, a user granted access to the
high protection layer may simply hold a single license of that layer, and obtain decryption keys
of that layer and below. The invention further provides for a process for managing digital rights
to a scalable media file wherein a different encryption/decryption key is used to encrypt each
truncatable media packet with a base layer without requiring additional storage space to store the
key.

H04L 09/30
20100115594 page 52

Ü Arrangements for secret or secure communication Ü the encryption
apparatus using shift registers or memories for blockwise coding, e.g.
D.E.S. systems
Title Anonymous verifiable public key certificates
Abstract The anonymity of a user at a client computer may be preserved when authenticating with
an on-line service or content provider through the use of an anonymous and verifiable (i.e.,
x201c;blindx201d;) certificate set that is created by a certificate authority from a fixed-size set
of PKI key pairs. The certificate authority randomly selects a subset of PKI key pairs to generate
the blind certificate set where each certificate in the set includes a respective public key from the
PKI key pair subset. The certificate authority also sends the private keys from the PKI key pair
subset to the user. During authentication, the client computer is configured to randomly select a
subset of one or more certificates from the set to present to the provider. The provider will encrypt
content using the public keys in the subset of certificates and the client will decrypt the content
with the corresponding private keys.

H04L 09/32

Ü 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
Title Support of multiple pre-shared keys in access point
Abstract A method of operating an access point (AP) configured to support multiple pre-shared keys at a
given time to authenticate its associated client devices. Each client device associated with the
AP is provisioned with a key. To authenticate the client device tat attempts to connect to the
AP, the AP determines which pre-shared key (PSK) of the multiple supported pre-shared keys
(PSKs). if any, matches information including the key received from the client device. When the
information matches, the client device is allowed to connect to the AP. Provisioning the AP with
multiple PSKs allows selectively disconnecting associated client devices from the AP. The AP
may be configured to support PSKs of different lifetime and complexity. Removing a PSK of the
multiple PSKs supported by the AP and disconnecting a client device that uses this PSK does not
disconnect other client devices using different keys to access the AP.

Ü Arrangements for secret or secure communication Ü including means
for verifying the identity or authority of a user of the system
Title Trusted network transfer of content using of network input code
Abstract Systems and methods for use in connection with the trusted transmission and reception of
content, such as encryption key information, from one computing device in a network to a second
computing device are provided. In one embodiment, the invention provides a way to trust or
validate the transfer of a public key using a very short code entered out of band of the network
that is easy for end-users to remember, or write down.

H04L 12/26

Title Distributed single sign on technologies including privacy protection and proactive updating
Abstract Technologies for distributed single sign-on operable to provide user access to a plurality of
services via authentication to a single entity. The distributed single sign-on technologies provide
a set of authentication servers and methods for privacy protection based on splitting secret keys
and user profiles into secure shares and periodically updating shares among the authentication
servers without affecting the underlying secrets. The correctness of the received partial token or
partial profiles can be verified with non-interactive zero-knowledge proofs.
20100115578 page 64 20100125612 page 25 20100125666 page 59

H04L 12/26

Ü Data switching networks Ü Details Ü Monitoring arrangements
Title System and method for link quality source routing
Abstract Systems and methods for routing packets by nodes in an ad hoc network in accordance with
a link quality source routing protocol are disclosed. Route discovery, route maintenance, and
metric maintenance are designed to propagate and keep current link quality measurements.
Metric maintenance includes a reactive approach for links that a node is currently using to route
packets, and a proactive mechanism for all links. Nodes are configured to include a send buffer, a
maintenance buffer, a request table, link quality metric modules, and preferably a neighbor cache
and a link cache. The invention allows for asymmetric links in the network. The invention may be
implemented within a virtual protocol interlayer between the link and network layers. The invention
may employ any particular link quality metrics, including metrics based on probing techniques as
well as metrics based on knowledge gained in other ways.

H04L 12/56

Title Context-based routing in multi-hop networks
Abstract Context-based routing in multi-hop networks involves using a context-based routing metric. In a
described implementation, respective path values are calculated for respective ones of multiple
paths using the context-based routing metric. A path is selected from the multiple paths
responsive to the calculated path values. Data is transmitted over at least one link of the selected
path. In an example embodiment, the context-based routing metric is ascertained responsive
to an estimated service interval (ESI) of a bottleneck link of each path of the multiple paths. In
another example embodiment, the context-based routing metric is ascertained responsive to an
expected resource consumption (ERC) metric. In an example embodiment of path selection, the
path is selected using a context-based path pruning (CPP) technique that involves maintaining
multiple local contexts at each intermediate node, with each local context representing at least
one partial path.

H04M 01/00

Ü Data switching networks Ü Stored and forward switching systems Ü
Packet switching systems
Title Secure network optimizations when receiving data directly in a virtual machine’s memory address
space
Abstract Techniques are disclosed for increasing the security of a system where incoming network packets
are directly placed into the memory space of a virtual machine (VM) operating system (OS)
running on the system via direct memory access (DMA). In an embodiment, each packet is
split into a first portion, which requires further processing, and a second portion, which may be
immediately placed into the VM OS’s memory address space. When the host OS running on the
system completes processing the first portion, it places it directly before the second portion in the
VM OS memory space and indicates to the VM OS that a packet is available. Techniques are
further disclosed that mitigate the security risk in such systems related to VLAN ID configuration.

Ü Arrangements, apparatus, circuits or systems, not covered by a single
one of groups Ü Communication control Ü characterised by a protocol
20100115594 page 52
H04M 01/00: Telephonic communication Ü Substation equipment, e.g.

for use by subscribers
Title Acoustic pass through for handsets
Abstract An acoustic pass through is provided in telephone handsets for sounds transmitted from a hands
free operation speaker laid out underneath the handset. One or more cutouts in a middle portion of
the handset in various shapes such as rectangular, round, elliptical, and similar allows enhanced
sound quality when the speakerphone feature is used and flexibility in handset design.

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

for use by subscribers Ü Automatic arrangements for answering calls
Title Marking voice messages as heard
Abstract In response to receiving a voice message, a telephony service creates an e-mail message
directed to the intended recipient of the voice message. The e-mail message includes the voice
message as an attachment and an embedded image file. Once the e-mail message has been
created, a mail system is utilized to transmit the e-mail message to the intended recipient of the
voice message. An e-mail client application program may be used to retrieve the e-mail message
and to view the message content. In order to render the message content, the e-mail client
application program will transmit a request for the image file. In response to receiving the request
for the image file, an indication is transmitted to the telephony service indicating that the intended
recipient has heard the voice message. In response to receiving the indication, the telephony
service marks the voice message as heard.

H04N 05/445
H04M 03/00: Telephonic communication Ü Automatic or semi-automatic

exchanges
Title Modification of system call behavior
Abstract The behavior of a system call may be modified. A modification component may pre-processes
and/or post-process a system call to change the behavior of the system call. Pre-processing
may involve modifying arguments to the system call, replacing one system call with another,
intercepting the system call, etc. Post-processing may involve modifying results and/or side
effects of a system call. The modification component may pre-process and/or post-process the
system call without changes to the underlying kernel service routine that is normally invoked in
response to the system call. Modifying the system call’s behavior may be used to implement
quality of service (QoS) constraints, to allow one operating system to emulate another, to provide
information about memory layout to an application, or to serve other goals.

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

television systems Ü Receiver circuitry Ü for displaying additional information
Title Interactive media portal
Abstract Techniques are disclosed herein for a media center portal. One implementation includes
displaying first content in an expanded state and second content in a contracted state. At least a
portion of the first content is presented in a viewport. A request is received to expand the second
content. The first content is contracted for display in the contracted state. The second content
is expanded for display in the expanded state. The contracted first content is displayed while
displaying the expanded second content. At least a portion of the second content is presented in
a text reader when in the expanded state.
20100115553 page 77

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

systems Ü Secrecy systems Ü with two-way working, e.g. subscriber
sending a programme selection signal
Title Synchronized media experience
Abstract A synchronized media experience is described. A media server identifies a group of two or more
remote media entertainment systems through which user-controlled play of media content may
be presented. The server generates and transmits one or more synchronization commands to the
remote media entertainment systems to synchronize presentation of a particular media content
through the two or more remote media entertainment systems. A control command entered by
a user of one of the remote media entertainment systems may be communicated to each of
the two or more remote media entertainment systems to enable synchronized, user controlled
presentation of the particular media content.

Title Community generated content channels
Abstract A method and system are disclosed for providing community defined and/or controlled channels
where content for a channel may be continuously streamed to users based on input from users that
participate in the channel. Channel definitions and content for different community channels may
be stored in a community channel store within an on-demand media server capable of streaming
content to subscribing users. One or more channels may be defined in the community channel
store by a server administrator. Certain users may also have the ability to create channels within
the community channel store. Each channel may be related to a topic, theme, type of content or
anything of interest to a particular community of users. Content is added to each channel, which
content is streamed to users continuously in a predetermined channel lineup. Ideally, there will
be one or more channels that are tailored to a given community of users’ viewing wishes, so that
a user in that community may simply access a community channel and receive content that they
are interested in without having to actively select the content they receive.

Title Reducing unicast session duration with restart tv
Abstract A first portion of programming aired prior to a first time is obtained via a unicast session with a
server, the first portion including previously aired programming. When the programming data
being sent via the unicast session catches up to a multicast broadcast of the programming,
the unicast session is terminated and a switch is made to obtaining a remaining portion of the
programming from a different source other than the server. This different source can be, for
example, a local storage device or a multicast broadcast of the programming.

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

Ü Systems for the transmission of television signals using pulse code
modulation Ü using bandwidth reduction
Title Adjusting hardware acceleration for video playback based on error detection
Abstract Adjustment of hardware acceleration level in a video decoder utilizing hardware acceleration is
described. Errors are detected in a bitstream as it is decoded using different levels of error
detection based on decoding characteristics. A statistical analysis is performed on the error
values as they are detected. In one technique, if the bitstream is categorized as fitting a high error
rate state in a bitstream model, then hardware acceleration is dropped. In another technique,
error statistics based on run-lengths of good and bad bitstream units are kept, and compared
to predetermined thresholds. If the thresholds are exceeded, the hardware acceleration level is
dropped. The level is dropped in order to take advantage of superior error handing abilities of
software-based decoding over hardware-accelerated decoding.

H04W 04/00
20100120531 page 6
H04N 07/30: Pictorial communication, e.g. television Ü Television systems

Ü Systems for the transmission of television signals using pulse code
modulation Ü using bandwidth reduction Ü involving transform coding
20100128778 page 123
H04W 04/00: Wireless communication networks Ü Services or facilities

specially adapted for wireless communication networks
Title Cognitive error control coding for channels with memory
Abstract Techniques for adapting error control codes (ECCs) based on memory conditions in a channel.
A wireless communication system may be adapted to detect and quantify memory in a channel,
such as memory resulting from multipath fading, and adjust an ECC to reduce the possibility of
errors impacting communication in the channel. In some implementations, adjusting the ECC
may comprise determining a probability that a channel in an error-prone state will remain in an
error-prone state, and selecting an ECC based on that probability. In other implementations, a
concatenated code may be used, and the relative size of an inner and outer code may be adjusted,
and/or an interleaver between the inner and outer code may be adjusted, based on the parameter
quantifying the memory in the channel.

H04W 48/00
H04W 48/00: Wireless communication networks Ü Access restriction

Title Positioning service utilizing existing radio base stations
Abstract Location position information of a mobile device utilizing Wi-Fi, FM, AM, television
transmissions(s), other radio transmission(s), electromagnetic, acoustic, or other signals received
from base stations or access points. The position information can be provided through a Web
service and/or locally on a mobile user device. The position information can be provided with
a certainty and/or uncertainty probability percentage or other perceivable means for the user
to determine the expected accuracy of the location information. Also provided is a means for
updating base station information to include newly detected base stations through information
from a plurality of user devices, wherein each user device is given a reliance factor. User devices
that have a low reliance factor are disregarded and/or scrutinized to determine accuracy prior to
such information being utilized to update information. Functioning of the system can be improved
through analysis of usage data and/or the additions to the database.

H05K 07/20
H05K 07/20: Printed circuits Ü Constructional details common to different

types of electric apparatus Ü Modifications to facilitate cooling, ventilating,
or heating
Title Splash resistant power adapter
Abstract An external AC power adapter defines a power conversion chamber that retains power conversion
circuitry operable to convert an input power to an output power. The power adapter further include
an intake chamber and an outlet chamber, both having an aperture that places the respective
chamber in fluid communication with the power conversion chamber. Each chamber may have at
least one vent to the ambient environment such that an air mover is operable to circulate ambient
air through the power conversion chamber. Each chamber may include a guard that deters liquid
that has entered the respective chamber from flowing into the associated aperture.

H05K 07/20

Patent Index
Patent Index
Patent Application Page Patent Application Page Patent Application Page
20100110081 103 20100110099 30 20100110631 126
20100111372 90 20100111410 49 20100111417 90
20100113983 5 20100114574 106 20100114726 97
20100114816 70 20100114824 71 20100114826 71
20100114846 32 20100114848 72 20100114881 73
20100114885 19 20100114908 19 20100114921 73
20100114925 74 20100114931 10 20100114954 75
20100114984 75 20100114986 20 20100114990 46
20100114998 76 20100115006 77 20100115033 50
20100115037 51 20100115216 47 20100115260 111
20100115278 114 20100115403 69 20100115424 11
20100115450 12 20100115451 13 20100115453 13
20100115553 77 20100115578 64 20100115594 52
20100115628 112 20100117909 108 20100117926 109
20100117931 104 20100118025 101 20100118727 116
20100118795 124 20100118868 118 20100119147 91
20100119151 92 20100120422 125 20100120513 5
20100120531 6 20100121639 105 20100121815 78
20100121838 79 20100121841 33 20100121855 58
20100121865 41 20100121883 79 20100121888 21
20100121902 52 20100121922 53 20100122152 64
20100122191 14 20100122205 15 20100122219 15
20100122259 42 20100122304 122 20100123659 8
20100124327 118 20100124940 110 20100125455 107
20100125471 86 20100125480 95 20100125484 96
20100125490 98 20100125512 80 20100125549 22
20100125557 23 20100125558 31 20100125573 16
20100125578 31 20100125588 24 20100125612 25
20100125613 25 20100125619 81 20100125623 53
20100125644 17 20100125666 59 20100125705 47
20100125714 44 20100125758 45 20100125762 17
20100125778 68 20100125825 36 20100125826 37
20100125852 45 20100125880 122 20100125896 114
20100125904 88 20100125912 49 20100127823 29
20100127985 8 20100128046 105 20100128628 117
20100128778 123 20100128856 119 20100128866 120
20100128984 92 20100128986 93 20100130277 6
20100131248 66 20100131254 86 20100131255 88
20100131275 106 20100131330 81 20100131351 7
20100131365 99 20100131380 100 20100131441 94
20100131457 82 20100131486 26 20100131487 27
20100131494 18 20100131543 83 20100131546 84
20100131556 28 20100131582 54 20100131587 55
20100131618 60 20100131619 61 20100131622 62
20100131629 63 20100131654 55 20100131669 57
20100131720 48 20100131743 34 20100131745 35
20100131755 115 20100131765 113 20100131836 67
20100131904 9 20100131921 38 20100131929 39
20100131931 39 20100131940 39 20100131942 40
20100131977 121 20100131995 122

IPC Catchword Index
IPC Catchword Index
Catch Word IPC Page

ACCOUNT(S) electric digital computers for accounting G06F 17/00 64
ADDRESSING memories G06F 12/00 46
AMUSEMENT(S) A63 5
BANDWIDTH reduction for television signal transmission H04N 07/26 123
BANK(S) -accounting computers G06F 17/00 64
BAR(S) record carriers characterised by BAR(S)-codes G06K 19/06 94
CHARACTERS recognition of CHARACTERS G06K 09/00 90
CHIROPRACTIC devices A61H 01/00 5
CODE(S) record carriers characterised by bar-CODE(S) G06K 19/06 94
COMPILERS G06F 09/44 36
COMPILING statistics G06 8
COMPUTER(S) G06 8
COMPUTER(S) equipment for CAD G06F 17/50 86
COMPUTER(S) multimedia applications G06F 17/00 64
COMPUTER(S) using knowledge based models G06N 05/00 94
CONTOURS following CONTOURS for character recognition G06K 09/00 90
COURSES measuring COURSES G01C 21/00 7
DATA processing G06 8
DISTENDING parts of the body for medical purposes A61 5
DRAG(S) measuring DRAG(S) in navigation G01C 21/00 7
DRIFT(S) measuring DRIFT(S) for navigation G01C 21/00 7
EMULATION G06F 09/44 36
EQUATIONS solving EQUATIONS G06 8
EXERCISING apparatus for passive EXERCISING A61H 01/00 5
FUNCTIONS evaluating FUNCTIONS G06 8
HEALTH medical or surgical treatment for HEALTH A61 5
HEAT dissipating HEAT in electric components or apparatus in general H05K 07/20 126
HYGIENE A61 5
INDICATING control arrangements or circuits for visual indicators G09G 05/00 105
INFORMATION electric digital computers for INFORMATION retrieval G06F 17/30 70
INOCULATION A61 5
INVENTORY electric digital computers for INVENTORY G06F 17/00 64
INVOICING electric digital computers for INVOICING G06F 17/00 64
JOYSTICK, JOY STICK JOYSTICK for data input in electric digital computers G06F 03/033 8
LANGUAGE(S) natural LANGUAGE(S) modelling for speech recognition G10L 15/18 106
LETTER(S) identification or recognition of LETTER(S) G06K 09/00 90
LIGHT-PEN(S) for electric digital computers G06F 03/033 8
MATCHING of digital data G06F 07/00 19
MEASURING G01 7
MERGING of digital data G06F 07/00 19
MOUSE used as input device in computers G06F 03/033 8
NAVIGATION G01C 21/00 7
OPERATION(S) appliances for performing surgical or medical A61 5
OPERATION(S)

IPC Catchword Index
Catch Word IPC Page

PLOTTING in navigation G01C 21/00 7
PRINT(S) recognition of printed characters G06K 09/00 90
PROCESSING text PROCESSING G06F 17/21 68
PROGRAMME(S), PROGRAM(S) PROGRAMME(S) control in electric digital G06F 09/00 34
computers
PROTOCOL for digital communication control H04L 29/06 118
RANDOM access stores in electric digital computers G06F 12/00 46
READING printed or written characters G06K 09/00 90
RECOGNITION of printed or written characters G06K 09/00 90
RECOGNITION of speech G10L 15/00 105
RECREATION A63 5
REFLECTION(S) of electromagnetic waves H01Q 15/14 109
RESERVATION electric computers for RESERVATION of seats G06F 17/00 64
RESONATORS for non-electric sound in particular musical instruments G10 105
ROUTES determining ROUTES G01C 21/00 7
SEAT(S) electric digital computers for SEAT(S) reservation G06F 17/00 64
SECRET digital communication, e.g. in telegraph systems H04L 09/00 111
SELECTING of digital data G06F 07/00 19
SORTING of record carriers in electric digital computers G06F 07/06 30
SPEECH recognition G10L 15/00 105
STATISTICS electric digital computers for STATISTICS G06F 17/00 64
SYMBOLS recognition of SYMBOLS G06K 09/00 90
TELEPHONE(S) answering H04M 01/64 119
TEXT processing G06F 17/21 68
TOTALISATORS for electrically computing outcome of betting G06F 17/00 64
TRAFFIC electric digital computers for TRAFFIC control G06F 17/00 64
TRANSFERRING in electric digital computers G06F 07/00 19
TRANSLATING of languages by computer G06F 17/28 69
VARIABLES measuring VARIABLES G01 7
VEHICLES measuring position or course of VEHICLES G01C 21/00 7
VENTILATION of electric components of apparatus in general H05K 07/20 126
WEAPON(S) electric digital computers for WEAPON(S) G06F 17/00 64

May 2010 Microsoft USPTO Published Patent Applications

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

May 2010 Microsoft USPTO Published Patent Applications

Uploaded by

Copyright:

Available Formats

US Patent Application Review Series

May 2010 issue

Provide to you by:

May 2010 USPTO Patent Applications 1

A few words from the editor

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

May 2010 USPTO Patent Applications 2

G06F 12/00 - Accessing, addressing or

May 2010 USPTO Patent Applications 3

H04 - Transmission 110 Patent Index 128

May 2010 USPTO Patent Applications 4

A61H 01/00: Physical therapy apparatus, e.g. devices for locating or

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

May 2010 USPTO Patent Applications 5

App. No. 20100120531 Assignee MICROSOFT CORPORATION

App. No. 20100130277 Assignee Microsoft Corporation

May 2010 USPTO Patent Applications 6

A63F 13/00: Card, board, or roulette games Ü Aspects of games using

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

May 2010 USPTO Patent Applications 7

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

App. No. 20100127985 Assignee Microsoft

May 2010 USPTO Patent Applications 8

App. No. 20100131904 Assignee MICROSOFT CORPORATION

May 2010 USPTO Patent Applications 9

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

May 2010 USPTO Patent Applications 10

App. No. 20100115424 Assignee Microsoft Corporation

May 2010 USPTO Patent Applications 11

App. No. 20100115450 Assignee Microsoft Corporation

May 2010 USPTO Patent Applications 12

App. No. 20100115451 Assignee Microsoft Corporation

App. No. 20100115453 Assignee MICROSOFT CORPORATION

May 2010 USPTO Patent Applications 13

App. No. 20100122191 Assignee MICROSOFT CORPORATION

May 2010 USPTO Patent Applications 14

App. No. 20100122205 Assignee MICROSOFT CORPORATION

App. No. 20100122219 Assignee MICROSOFT CORPORATION

May 2010 USPTO Patent Applications 15

App. No. 20100125573 Assignee Microsoft Corporation

May 2010 USPTO Patent Applications 16

App. No. 20100125644 Assignee MICROSOFT CORPORATION

App. No. 20100125762 Assignee MICROSOFT CORPORATION

May 2010 USPTO Patent Applications 17

App. No. 20100131494 Assignee MICROSOFT CORPORATION

May 2010 USPTO Patent Applications 18

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

App. No. 20100114908 Assignee Microsoft Corporation

May 2010 USPTO Patent Applications 19

App. No. 20100114986 Assignee MICROSOFT CORPORATION;MATSUSHITA ELECTRIC

May 2010 USPTO Patent Applications 20

App. No. 20100121888 Assignee MICROSOFT CORPORATION

May 2010 USPTO Patent Applications 21

App. No. 20100125549 Assignee Microsoft Corporation

May 2010 USPTO Patent Applications 22

App. No. 20100125557 Assignee MICROSOFT CORPORATION

May 2010 USPTO Patent Applications 23

App. No. 20100125588 Assignee MICROSOFT CORPORATION

May 2010 USPTO Patent Applications 24

App. No. 20100125612 Assignee Microsoft Corporation

App. No. 20100125613 Assignee MICROSOFT CORPORATION

May 2010 USPTO Patent Applications 25

App. No. 20100131486 Assignee Microsoft Corporation

May 2010 USPTO Patent Applications 26