Methods and systems for dynamic information transmission

• US 20060184691A1
• Filed: 02/14/2006
• Published: 08/17/2006
• Est. Priority Date: 02/15/2005
• Status: Active Grant

• Current Assignee: Qisda Corporation
• Original Assignee: BenQ Corporation (Qisda Corporation)
• Inventors: Hu, Chih-Lin
• Granted Patent: US 7,490,159 B2
• Time in Patent Office: Days
• US Class Current: 709/240
• CPC Class Codes: H04L 67/55 Push-based network services
• CPC Class Codes: H04L 67/62 Establishing a time schedule for servicing the requests

Abstract

Methods for dynamic information transmission. Data objects having the highest broadcast positions respectively in the data object sequences are acquired as multiple candidate data objects. A measure for each candidate data object is calculated using a GMF (gain measure function). One candidate data object is pushed in an output queue contingent upon the measures thereof, enabling the pushed candidate data object to be transmitted before the other candidate data objects to a client apparatus via the output queue.

Claims

1. A method for dynamic information transmission, executed by a processing unit, arranging a plurality of data object sequences respectively for a plurality of information service providers to an output queue, each data object sequence comprising a plurality of sequentially aligned data objects, the method comprising:

acquiring the data objects having the highest broadcast positions respectively in the data object sequences as a plurality of candidate data objects;

calculating a measure for each candidate data object using a GMF (gain measure function); and

pushing one candidate data object in the output queue contingent upon the measures thereof,

enabling the pushed candidate data object to be transmitted before the other candidate data objects to a client apparatus via the output queue.

2. The method of claim 1 wherein the pushed candidate data object has a greater measure than that of the other candidate data object.

3. The method of claim 1 wherein the GMF is utilized to arrange the data objects generated by the same information provider as densely as possible.

4. The method of claim 1 wherein the data object sequence corresponding to the pushed candidate data object has the lowest number of data objects.

5. The method of claim 4 wherein the GMF is:

G(d_i^k)=−

q_k·

n_k,

d_i^k representing one candidate data object being the i-th data object generated by the corresponding information provider S_k, q_k representing a weighted value indicating the subscribed extent of S_k, and n_k representing the number of data objects generated by S_k in a constant time interval.

6. The method of claim 1 wherein the GMF calculates the GMF scores by considering directed distances between the data objects in the corresponding data object sequences for the candidate data objects.

7. The method of claim 6 wherein the GMF is:

G(d_i^k)=q_k·

L−

q_k·

(dd_i+1,i+2^k+ . . . +dd_nk,1^k+ . . . +dd<sub>i−

1,i</sub>^k),

d_i^k representing one candidate data object being the i-th data object generated by the corresponding information provider S_k, q_k representing a weighted value indicating the subscribed extent of S_k, L representing the number of time slots allocated in the output queue, dd_i+1,i+2^k representing a directed distance between d_i+1^k and d_i+2^k, dd^nk,1k representing a directed distance between d_nk^k and d_l^k, and dd<sub>i−

1,i</sub>^k representing a directed distance between d<sub>i−

1</sub>^k, and d_i^k.

8. The method of claim 6 wherein the GMF is:

$G<br><br>\left(d_i^k\right)=q_k·<br><br>\frac{{\left(\frac{L}{n_k}-{\mathrm{dd}}_{i-1,i}^{\text{\hspace{1em}<br><br>}<br><br>k}\right)}^2}{{\left(\frac{L}{n_k}\right)}^2},$

d_i^k representing one candidate data object being the i-th data object generated by the corresponding information provider S_k, q_k representing a weighted value indicating the subscribed extent of S_k, L representing the number of time slots allocated in the output queue, n_k representing the number of data objects generated by S_k in a constant time interval, and dd<sub>i−

1,i</sub>^k representing a directed distance between d<sub>i−

1</sub>^k and d_i^k.

9. The method of claim 6 wherein the GMF is:

$G<br><br>\left(d_i^k\right)=q_k·<br><br>\frac{{\left(\frac{L}{n_k}-{\mathrm{dd}}_{i-1,i}^{\text{\hspace{1em}<br><br>}<br><br>k}\right)}^2}{{\left(\frac{L}{n_k}\right)}^2}·<br><br>\underset{1\le <br><br>i\le <br><br>n_k-1}{\sum <br><br>}<br><br>\left({\mathrm{dd}}_{i,i+1}^{\text{\hspace{1em}<br><br>}<br><br>k}-\left(2<br><br>\frac{L}{n_k}-{\mathrm{dd}}_{i-1,i}^{\text{\hspace{1em}<br><br>}<br><br>k}\right)\right),$

d_i^k representing one candidate data object being the i-th data object generated by the corresponding information provider S_k, L representing the number of time slots allocated in the output queue, n_k representing the number of data objects generated by S_k in a constant time interval, dd_i,i+1^k representing a directed distance between d_i^k and d_i+1^k, and dd<sub>i−

1,i</sub>^k, representing a directed distance between d<sub>i−

1</sub>^k and d_i^k.

16. The system of claim 1 wherein the GMF calculates the GMF scores by considering directed distances between the data objects in the corresponding data object sequences for the candidate data objects.

17. The system of claim 16 wherein the GMF is:

G(d_i^k)=q_k·

L−

q_k·

(dd_i+1,i+2^k+ . . . +dd_nk,1^k+ . . . +dd<sub>i−

1,i</sub>^k),

d_i^k representing one candidate data object being the i-th data object generated by the corresponding information provider S_k, q_k representing a weighted value indicating the subscribed extent of S_k, L representing the number of time slots allocated in the output queue, dd_i+1,i+2^k representing a directed distance between d_i+1^k and d_i+2^k, dd_nk,1^k representing a directed distance between d_nk^k and d_l^k, and dd<sub>i−

1,i</sub>^k representing a directed distance between d<sub>i−

1</sub>^k and d_i^k.

18. The system of claim 16 wherein the GMF is:

$G<br><br>\left(d_i^k\right)=q_k·<br><br>\frac{{\left(\frac{L}{n_k}-{\mathrm{dd}}_{i-1,i}^{\text{\hspace{1em}<br><br>}<br><br>k}\right)}^2}{{\left(\frac{L}{n_k}\right)}^2},$

d_i^k representing one candidate data object being the i-th data object generated by the corresponding information provider S_k, q_k representing a weighted value indicating the subscribed extent of S_k, L representing the number of time slots allocated in the output queue, n_k representing the number of data objects generated by S_k in a constant time interval, and dd<sub>i−

1,i</sub>^k representing a directed distance between d<sub>i−

1</sub>^k and d_i^k.

19. The system of claim 16 wherein the GMF is:

$G<br><br>\left(d_i^k\right)=q_k·<br><br>\frac{{\left(\frac{L}{n_k}-{\mathrm{dd}}_{i-1,i}^{\text{\hspace{1em}<br><br>}<br><br>k}\right)}^2}{{\left(\frac{L}{n_k}\right)}^2}·<br><br>\underset{1\le <br><br>i\le <br><br>n_k-1}{\sum <br><br>}<br><br>\left({\mathrm{dd}}_{i,i+1}^{\text{\hspace{1em}<br><br>}<br><br>k}-\left(2<br><br>\frac{L}{n_k}-{\mathrm{dd}}_{i-1,i}^{\text{\hspace{1em}<br><br>}<br><br>k}\right)\right),$

d_i^k representing one candidate data object being the i-th data object generated by the corresponding information provider S_k, L representing the number of time slots allocated in the output queue, n_k representing the number of data objects generated by S_k in a constant time interval, dd_i,i+1^k representing a directed distance between d_i^k and d_i+1^k, and dd<sub>i−

1,i</sub>^k representing a directed distance between d<sub>i−

1</sub>^k and d_i^k.

10. A machine-readable storage medium storing a computer program which, when executed, performs a method for dynamic information transmission, the method arranging a plurality of data object sequences respectively for a plurality of information service providers to an output queue, each data object sequence comprising a plurality of sequentially aligned data objects, the method comprising:

acquiring the data objects having the highest broadcast positions respectively in the data object sequences as a plurality of candidate data objects;

calculating a measure for each candidate data object using a GMF (gain measure function); and

pushing one candidate data object in the output queue contingent upon the measures thereof,

enabling the pushed candidate data object to be transmitted before the other candidate data objects to a client apparatus via the output queue.

11. A system for dynamic information transmission, capable of arranging a plurality of data object sequences respectively for a plurality of information service providers to an output queue, each data object sequence comprising a plurality of sequentially aligned data objects, the system comprising:

an input queue;

a processing unit coupling to the input queue, acquiring the data objects having the highest broadcast positions respectively in the data object sequences as a plurality of candidate data objects, calculating a measure for each candidate data object using a GMF (gain measure function), pushing one candidate data object in the output queue contingent upon the measures thereof,

enabling the pushed candidate data object to be transmitted before the other candidate data objects to a client apparatus via the output queue.

12. The system of claim 11 wherein the pushed candidate data object has a greater measure than that of the other candidate data object.

13. The system of claim 11 wherein the GMF is utilized to arrange the data objects generated by the same information provider as densely as possible.

14. The system of claim 11 wherein the data object sequence corresponding to the pushed candidate data object has the lowest number of data objects.

15. The system of claim 14 wherein the GMF is:

G(d_i^k)=−

q_k·

n_k,

d_i^k representing one candidate data object being the i-th data object generated by the corresponding information provider S_k, q_k representing a weighted value indicating the subscribed extent of S_k, and n_k representing the number of data objects generated by S_k in a constant time interval.