WO2008030236A1

WO2008030236A1 - Parallel temporal synchronization of inter-looping circular chained indexes

Info

Publication number: WO2008030236A1
Application number: PCT/US2006/034691
Authority: WO
Inventors: Ken Launais
Original assignee: Ken Launais
Priority date: 2006-09-06
Filing date: 2006-09-06
Publication date: 2008-03-13
Also published as: EP2069883A1; EP2069883A4

Abstract

The invention describes a Motion User Interface (MUI) with a data viewing terminal for displaying graphical indices pointing to elements of a database of information that displays the graphical indices as images moving across a viewing screen. The screen is divided into viewing segments, each of which displays graphical indices in motion in a direction predetermined for that segment where the information in at least one pair of adjacent viewing segment moves in anti-parallel directions.

Description

PARALLEL TEMPORAL SYNCHRONIZATION OF EVTER-LOOPING CIRCULAR CHAINED INDEXES

FIELD OF THE INVENTION

This invention relates to the use of specially structured list indexes to enable a computer program to access data located on computer servers or on a local computer disk in order to present the data in a manner which is compatible or consistent with a specific visual interface.

BACKGROUND OF THE INVENTION

U.S. Patent No. 6,198,483 describes a Motion User Interface (MUI) with a data viewing terminal for displaying graphical indices pointing to elements of a database of information that displays the graphical indices as images moving across a viewing screen. The screen is divided into viewing segments, each of which displays graphical indices in motion in a direction predetermined for that segment where the information in at least one pair of adjacent viewing segment moves in anti-parallel directions.

However, U.S. Patent No. 6,198,483 does not guaranty a continuous progression flow of image sequences along with real-time accurate mapping of image positions to offset current computer memory limitations. The present invention addresses such a need.

BRIEF DESCRIPTION OF THE INVENTION

In order for the MUI to work, a buffer memory needs to be filled with a considerable amount of data (images, text or combination of both). The buffer needs to distribute the data to a list index. The distribution method is unique and was invented solely for the purpose of feeding the MUI. The result was a specially structured list index which, by its own merit is a unique invention.

The invention was made necessary because the MUI allows users to navigate backward or forward very quickly through two or more segments of graphical indices in motion. The MUI's resulting visual cognitive effects can only be achieved if users are able to navigate via a continuous progression flow of image sequences. This requirement prohibits the introduction of regularly short interval based interruptions in the display of the image sequences caused by computer memory limitations in the viewing segments. Due to current physical limitations of computer memory (RAM), interruptions do in fact occur, but need to be interspaced at humanly acceptable time intervals (For example interruptions may occur every 20 seconds minimum but not every 2 to 10 seconds. Note that 20 seconds feels like an eternity compared to 2-10 seconds). To achieve this, image sequences need to be broken down into manageable inter-parsed subsequences. A good analogy would be to think of the image sequence as made up of a set of feed cartridges where each sub-sequence is equivalent to a single cartridge.

Per U.S. Patent No. 6,198,483, once a user has identified an image of interest, the image can be clicked on and opened in another window for a 2D (page like) presentation. The list index must provide both a mechanism for a continuous progression flow as well as real-time accurate mapping of every image's position in relation to others in the sequence at all times. If accurate mapping is not achieved, every time users click on an image, the wrong result will be shown, making the overall system useless.

Although only the case scenario of two segments will be described below, any number of segments may be used without departing from the spirit and scope of the present invention.

Because both viewing segments containing or showing image sequences can be controlled independently or synchronously (at the same time), additional complexity is introduced to the management of the list indexes.

Once the buffer has been filled with an optimal volume of data to satisfy the requirements of two fast moving segments, streaming can take place.

At the start position, both segments start from adjacent numbered position. As they are two channel sequences of images, a right and left channel, images are distributed evenly to both channels (the viewing segments) with even numbered images on the left and odd numbered images on the right.

Navigating in Synchronized mode, the list index would therefore start with images 01-03-05-07 etc. on the left side and 02-04-06-08 etc. on the right side.

As long as the user continues to navigate in synchronized mode, only the mechanism for a continuous progression is made necessary. But once a user decides do desynchronize the channels to move backward in one channel or forward in another, the need for an accurate mapping layer becomes evident. DETAILED DESCRIPTION OF A PREFERED EMBODIMENT OF THE PRESENT INVENTION

In a preferred embodiment, the present invention is a computer list index structure made necessary by the unique attributes of the prior art MUI, which enables users to navigate through two channels of information in parallel, coupled with current computer memory limitations. Up to date image and textual information has been presented to users on computer screens statically (except for real-life motion video which is displayed at rates of 24 and 30 fps) and through a flat 2D format presentation that reproduces the page metaphor.

The differentiator with prior art MUI # 6,198,483 is the juxtaposition of viewing segments that seemingly stream in parallel while in real geometrical terms, are moving in anti-parallel directions. To work # 6,198,483 requires a specialized list index architecture that can facilitate the desired cognitive effects.

A detailed breakdown of the parts that make up the list index architecture is as follows:

1. General Mass Index

Assuming an image sequence of 800 images, a General Index representation of the images is created that serially lists images 001-800. Per Fig. 1, the General Mass Index is created at the buffer level and is the feed source for a sub-index, the Local Channel Index

2. Local Channel Index

A local channel index is created for each of the two viewing segments, referred to as Channels. The Local Left Channel Index lists odd numbered images 001-799 (001...075...799) as a circular representation where image numbers are daisy chained starting at point 001 followed by 003 all the way to 799, with 799 intersecting start point 001 so that a forward motion in the viewing segments is made possible by simply feeding images 001-799 in ascending order and a backward motion is equally possible by feeding in a counter-clockwise descending order 799-001. As they are two viewing segments or Channels, each Channel is represented by half the total number of the General Mass Index, in this case 400 images is the number assigned to each Local Channel Indexes. Fig. 1 illustrates the Circular Chained Index as a schematic. 3. Feed Cartridge

Since current average computer memory or RAM is found to be 512 MB and the Windows operating system retains a quarter of that space for its own use and other software applications will likewise be using portions of RAM, it would be impossible for the memory to actually hold 800 images at once. The technique of utilizing a buffer is unavoidable.

The buffer will actually hold only a portion of the 800 images to create the continuous progression flow of image sequence. This portion is the data in the buffer of the MUI application that is made available to a "Feed Cartridge". Buffers are usually case sensitive depending on the amount of RAM available on any given computer so that a computer with 1024 MB RAM can hold a greater buffer at any time than say a computer with 256 MB RAM.

Irrespective of the size of the amount of RAM, it was determined that a minimum feed cartridge should hold 40 images per viewing segment (channel) since humans will comfortably view 4.75 images per second or in some cases twice as much. See Fig 1.

4. Register

A final element is needed for both the continuous progression flow and accurate real-time mapping mechanisms to work as a single system. A Register (See Fig 1.) is required to track image positions in both ascending and descending orders. By continuously keeping a tally and updating the ascending/descending positions of images, users can move forward or backward accurately in the List Channel Indexes.

Further, synchronization is maintained between a first subset's current position and a second subset's current position, such that the first and second subsets' current positions move forward or in reverse together. A first subset's current position and a second subset's current position may move independently in different directions or at different speeds.

5. Parallel co-location of Local Channel Indexes

Once all the elements have been created for a single Circular Running Chained Index to work accurately, two need to be able to run concurrently creating the architecture of inter-looping wheels in the figure of an 8 (See Fig. 2). Though both need to run in parallel contiguously (over a time dimension, hence the term temporally), each Circular Running Chained Index is designed to run independently of the other so that users may control each viewing segments in Desynchronized mode or in Synchronized. In reality the Circular Running Chained Indexes are interconnected since each is a representation of half of the General Mass Index, making them interdependent. The result is therefore a novel computer list index architecture that is best described as a Parallel Temporally Synchronized Inter-Looping Circular Chained List Indexes.

6. Synchronized and Desynchronized Single Source Data Mode

Description 1 - 4 describes the elements that make up a single Circular Chained List Index and the resulting architecture when two are running in co-location. It must be noted that the Parallel Temporally Synchronized Inter-Looping Chained List Index architecture is a direct result of users navigating in De/Synchronized Mode of a single data source.

In Synchronized mode both viewing segments are moving at the same speed and in the same direction while displaying data from a single source.

In Desynchronized mode both viewing segments may be moving at different speed and in opposite direction while displaying data from a single source.

However the MUI described in U.S. Patent No. 6,198,483 viewing segments may display data from two different sources. This leads to a variation. The model variation is described in Desynchronized Dual Source Data Mode.

7. De/Synchronized Dual Source Data Mode

The key difference between De/Synchronized Single Source Data Mode and De/Synchronized Dual Source Data Mode is the division of the Mass General Index into two separate units. When this occurs, both odd and even numbered images are distributed from different data sources (different content) to each Mass General Index units as 01-02- 03-04-05. Note that both viewing segments can still be navigated simultaneously in Synchronized Mode or in Desynchronized Mode (See Fig. 3).

Claims

CLAIMSWe claim:

1. A method for managing circular indices for presenting a continuous flow of data, comprising: providing a global circular index for a set of sequentially ordered data sets, and one or more local circular indices for one or more subsets of the set of data sets; and for each subset: initializing a current position within the local index, the current position indicating a data set that is currently presented; populating a forward buffer and a reverse buffer, the forward buffer populated with a plurality of data sets immediately following the current position in the sequential ordering, and the reverse buffer populated with a plurality of data sets immediately preceding the current position in the sequential ordering; moving the current position forwards or in reverse within the local index in order to stream the subset forwards or in reverse; and maintaining the forward and reverse buffers populated such that the moving current position remains between them.

2. The method of Claim 1, wherein for each subset the maintaining step comprises discarding those data sets which have moved past the moving current position.

3. The method of Claim 2, wherein for each subset the maintaining step further comprises pre-fetching one or more fresh data sets from the set of data sets in order to keep the forwards and reverse buffers populated to capacity.

4. The method of Claim 1, further comprising: maintaining a synchronization between a first subset's current position and a second subset's current position, such that the first and second subsets' current positions move forward or in reverse together.

5. The method of Claim 1, wherein a first subset's current position and a second subset's current position move independently in different directions or at different speeds.

6. The method of Claim 1, wherein the set of data sets is a disjoint union of the one or more subsets.

7. The method of Claim 1, wherein the forward and reverse buffers each hold at least four data sets.

8. The method of Claim 1, wherein a subset's current position moves at a rate of about two to eight positions per second.

9. The method of Claim 1, wherein the data sets comprise formatted or unformatted textual or image data for visual presentation.

10. The method of Claim 9, further comprising: for each subset: transmitting the data set at the subset's current position to a local display for visual presentation.

11. The method of Claim 9, further comprising: for each subset: transmitting the data set at the subset's current position to a remote display for visual presentation.

12. The method of Claim 11, wherein the transmitting proceeds via a wired or wireless local area network or wide area network, or via a cellular network.

13. The method of Claim 11, wherein the transmitting proceeds according to a client-server protocol or a peer-to-peer protocol.

14. The method of Claim 11, wherein the remote display is attached to a computer, a set-top box or a mobile device.