Abstract: Techniques are described herein that are capable of reordering a multi-level layout using a hierarchical tree. A hierarchical tree is a tree that includes multiple hierarchical levels. Elements of a document may be arranged among the hierarchical levels to provide a logical representation of the document. The elements may be rearranged among the hierarchical levels to cause portions of content that are represented by the elements to be rearranged in a multi-level layout (e.g., a web page).

Abstract: Techniques are described herein that are capable of reordering a multi-level layout using a hierarchical tree. A hierarchical tree is a tree that includes multiple hierarchical levels. Elements of a document may be arranged among the hierarchical levels to provide a logical representation of the document. The elements may be rearranged among the hierarchical levels to cause portions of content that are represented by the elements to be rearranged in a multi-level layout (e.g., a web page).

Abstract: Technologies related to representing positions of graphical elements in a page through use of hierarchical position identifiers are described. A design canvas represents a page using zones, sections, and subsections, where a zone includes 1-m sections, and a subsection includes 1-p subsections. A position of a graphical element in a subsection is represented as a hierarchical position identifier, in the form of a tuple. The hierarchical position identifier includes an index value for a zone, an index value for a section, and an index value for a subsection. When the page is rendered, the graphical element is positioned in the page based upon its hierarchical position identifier.

Abstract: The present disclosure is directed to a process for generating a random access, frame accurate searchable file from a non-indexed video content file having an inconsistent frame rate. The process includes generating a fixed frame rate into the settings of the non-indexed video content file such as preprocessing video frame time-stamps to include frame_timestamp=frame_index*time_per_frame, where: time_per_frame=1/frame_rate. The non-indexed video content including the video frame time-stamps is encoded so that frame accurate searching includes conversions on frame rate settings using media time and a constant frame rate to convert from media time to frame number.