IP Library Granted Patent US 7,290,006
Granted Patent B2
US 7,290,006 · App. 10/676,518 · Granted Oct 30, 2007

Document representation for scalable structure

View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 7,290,006
App. No.
10/676,518
Granted
Oct 30, 2007
Kind
B2
Abstract

An exemplary system includes a browser to browse a web page based on a web page definition having a slicing tree defining an arrangement of rectangular regions in the web page. The web page definition can include parametric data describing adaptability parameters associated with a rectangular region. A rendering module renders an adapted web page based on the web page definition, and a proxy module generates an intermediary adapted web page definition. A method includes rendering the web page according to a slicing tree and block property data in an associated web page definition. The method may include determining a set of unsummarized blocks that maximize information fidelity.

Claims (66)

1. A method comprising:

receiving a web page definition at a computing device, the web page definition having a slicing tree describing an arrangement of a plurality of blocks in the web page;

selected a combination of the plurality of blocks to be adapted such that information fidelity is maximized according to the expression:

IF

(

P

)

=

B

i

P

IMP

i

·

IF

B

i

,

where IMP i is a value representing importance of block B i , IF B i is a value representing information fidelity of block B i , and IF(P) is the total information fidelity of the web page; and

rendering the web page on a display screen according to the slicing tree.

2. A method as recited in claim 1 wherein the web page definition further includes block property data associated with one or more of the plurality of blocks.

3. A method as recited in claim 2 further comprising scaling one or more of the plurality of blocks according to a function of display screen size and the block property data.

4. A method as recited in claim 2 wherein the block property data comprises:

an importance field;

a minimal perceptible size field;

a minimal perceptible height field;

a minimal perceptible width field;

an adjustability field; and

an alternative field.

5. A method as recited in claim 4 further comprising determining a scaling number using a capacity based ratio algorithm.

6. A method as recited in claim 1 further comprising summarizing one or more of the plurality of blocks.

7. A method as recited in claim 1 further comprising associating a scaling factor with one or more of the plurality of blocks.

8. A method as recited in claim 1 further comprising generating a binary tree having a plurality of nodes, wherein each node corresponds to a combination of the plurality of blocks.

9. A method as recited in claim 8 further comprising maximizing information fidelity subject to:

B

i

P

size

(

ALT

i

)

+

B

i

P

MPS

i

Area

,

where ALT i is an adapted representation of block B i , size(ALT i ) is a function that returns the size of ALT i , MPS i is a value representing a minimum perceptible size of block B i , and Area is a value representing the size of the target area in which the web page is rendered.

10. A method as recited in claim 1 further comprising scaling one or more of the blocks to maximize information fidelity subject to a target area on the display screen.

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 9, 2014
From: MICROSOFT CORPORATION
To: MICROSOFT TECHNOLOGY LICENSING, LLC
Reel/Frame 034541/0477 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 30, 2003
From: XIE, XING; MA, WEI-YING; ZHANG, HONG-JIANG; CHEN, LIQUN
To: MICROSOFT CORPORATION
Reel/Frame 014593/0440 →