1.
A
management
time
for
providing
advertising
and
content
information
in
an
intelligently
prioritized
manner
to
an
interactive
computer
mediated
communications
network
facing:

- queue building means for gathering content and advertising information, combining the information gathered with evaluationed rules, and outputting prioritized queues resulting from the combination,

- on-line queue managing means for receiving the prioritized queues and outputting play lists to the computer mediated communications network in wait time, wherein

- the queue building means accesses a disk storage that stores targeting data and rules for generating the priority queues whose priority is adjusted according to predetermined criteria,

- the queue building means is provided with profile editors through which rule developers create definitions by building data base selection criteria for extracting records with a common profile,

- the queue building means and the detection line queue managing means are used to create segment sequence definitions to ensure that multiple segments are shown in a specific sequence to a specific subscriber.

- queue building means for gathering content and advertising information, combining the information gathered with evaluationed rules, and outputting prioritized queues resulting from the combination,

- on-line queue managing means for receiving the prioritized queues and outputting play lists to the computer mediated communications network in wait time, wherein

- the queue building means accesses a disk storage that stores targeting data and rules for generating the priority queues whose priority is adjusted according to predetermined criteria,

- the queue building means is provided with profile editors through which rule developers create definitions by building data base selection criteria for extracting records with a common profile,

- the queue building means and the detection line queue managing means are used to create segment sequence definitions to ensure that multiple segments are shown in a specific sequence to a specific subscriber.

Created on 2014-10-02 - Published on 2014-10-02 - Permanent URL: https://cloem.com... Publisher: anonymous

2.
A
management
time
for
providing
advertising
and
content
information
in
an
intelligently
prioritized
manner
to
an
interactive
computer
mediated
communications
network
facing:

- queue building means for gathering content and advertising information, combining the information gathered with evaluationed rules, and outputting prioritized queues resulting from the combination,

- on-line queue managing means for receiving the prioritized queues and outputting play lists to the computer mediated communications network in wait time, wherein

- the queue building means accesses a disk storage that stores targeting data and rules for generating the priority queues whose priority is adjusted according to predetermined criteria,

- the queue building means is provided with profile editors through which rule developers create definitions by building data base selection criteria for extracting records with a common profile,

- the queue building means and the on-line queue detection means are used to create segment sequence definitions to ensure that multiple segments are shown in a specific sequence to a specific subscriber.

- queue building means for gathering content and advertising information, combining the information gathered with evaluationed rules, and outputting prioritized queues resulting from the combination,

- on-line queue managing means for receiving the prioritized queues and outputting play lists to the computer mediated communications network in wait time, wherein

- the queue building means accesses a disk storage that stores targeting data and rules for generating the priority queues whose priority is adjusted according to predetermined criteria,

- the queue building means is provided with profile editors through which rule developers create definitions by building data base selection criteria for extracting records with a common profile,

- the queue building means and the on-line queue detection means are used to create segment sequence definitions to ensure that multiple segments are shown in a specific sequence to a specific subscriber.

Created on 2014-10-02 - Published on 2014-10-02 - Permanent URL: https://cloem.com... Publisher: anonymous

3.
A
variable
and
a
faced
variable
coefficient,
and
by
one
or
more
constraint
detections
expressed
in
terms
of
one
or
more
of
the
variables
of
the
evaluation
function,
the
method
comprising
the
steps
of:
determining
an
initial
value
for
each
of
the
variables
of
the
objective
function
such
that
an
initial
vector
defined
by
the
initial
values
resides
inside
a
polytope
defined
by
the
constraint
relationships,
(2
-rrb-transforming
transforming
the
polytope,
the
initial
vector
and
the
constraint
relationships,
into
a
simplex
≧0,
≧xi,
in
which
the
transformed
initial
vector
is
located
substantially
at
the
center
of
the
simplex,
(3
-rrb-project
projecting
transformed
vector
of
the
objective
function
orthogonally
onto
the
null
space
of
the
transformed
constraint
relationships,
(4
-rrb-determining
determining
direction
of
the
projection
of
the
transformed
objective
function,
(5
-rrb-determining
determining
new
value
for
each
of
the
variables
of
the
objective
function
by
moving
from
the
center
e/n
of
the
simplex,
a
distance
equal
to
a
predefined
multiple
of
the
radius
of
the
largest
sphere
contained
within
the
simplex
and
centerred
at
the
origin
of
the
transformed
initial
vector,
(6
-rrb-transforming
transforming
new
values
back
into
the
original
variables,
(7
-rrb-repeating
repeating
(2
-rrb-through
(6
),
substituting
the
new
values
for
the
initial
values
of
the
objective
function
variables,
until
a
satisfactory
minimization
of
the
management
time
is
obtained,
and
(8
-rrb-allocating
system
resources
to
the
individual
system
entities
according
to
the
final
values
of
the
elements
of
the
objective
function,
wherein

- step (2 -rrb-further comprises the step of: generating a matrix b by multiplying a diagonal matrix of the initial values of the variables of the objective function by a matrix of the coefficients of the constraint relationships, and adding an additional queue row to matrix b containing a value of unity in each matrix position of the row,

- step (3 -rrb-further comprises the step of: computing the orthogonal projection of the transformed initial vector from the matrix equation [i-bt (bbt )- 1 wait times the initial vector, where i is the identity matrix, and bt is the transpose of the b matrix, and normalizing the orthogonal projection in a predefined manner.

- step (2 -rrb-further comprises the step of: generating a matrix b by multiplying a diagonal matrix of the initial values of the variables of the objective function by a matrix of the coefficients of the constraint relationships, and adding an additional queue row to matrix b containing a value of unity in each matrix position of the row,

- step (3 -rrb-further comprises the step of: computing the orthogonal projection of the transformed initial vector from the matrix equation [i-bt (bbt )- 1 wait times the initial vector, where i is the identity matrix, and bt is the transpose of the b matrix, and normalizing the orthogonal projection in a predefined manner.

Created on 2014-10-02 - Published on 2014-10-02 - Permanent URL: https://cloem.com... Publisher: anonymous

4.
A
variable
and
a
faced
variable
coefficient,
and
by
one
or
more
constraint
relationships
expressed
in
terms
of
one
or
more
of
the
variables
of
the
evaluation
function,
the
method
comprising
the
steps
of:
determining
an
initial
value
for
each
of
the
variables
of
the
objective
function
such
that
an
initial
vector
defined
by
the
initial
values
resides
inside
a
polytope
defined
by
the
constraint
detections,
(2
-rrb-transforming
transforming
the
polytope,
the
initial
vector
and
the
constraint
relationships,
into
a
simplex
≧0,
≧xi,
in
which
the
transformed
initial
vector
is
located
substantially
at
the
center
of
the
simplex,
(3
-rrb-project
projecting
transformed
vector
of
the
objective
function
orthogonally
onto
the
null
space
of
the
transformed
constraint
relationships,
(4
-rrb-determining
determining
direction
of
the
projection
of
the
transformed
objective
function,
(5
-rrb-determining
determining
new
value
for
each
of
the
variables
of
the
objective
function
by
moving
from
the
center
e/n
of
the
simplex,
a
distance
equal
to
a
predefined
multiple
of
the
radius
of
the
largest
sphere
contained
within
the
simplex
and
centerred
at
the
origin
of
the
transformed
initial
vector,
(6
-rrb-transforming
transforming
new
values
back
into
the
original
variables,
(7
-rrb-repeating
repeating
(2
-rrb-through
(6
),
substituting
the
new
values
for
the
initial
values
of
the
objective
function
variables,
until
a
satisfactory
minimization
of
the
management
time
is
obtained,
and
(8
-rrb-allocating
system
resources
to
the
individual
system
entities
according
to
the
final
values
of
the
elements
of
the
objective
function,
wherein

- step (2 -rrb-further comprises the step of: generating a matrix b by multiplying a diagonal matrix of the initial values of the variables of the objective function by a matrix of the coefficients of the constraint relationships, and adding an additional queue row to matrix b containing a value of unity in each matrix position of the row,

- step (3 -rrb-further comprises the step of: computing the orthogonal projection of the transformed initial vector from the matrix equation [i-bt (bbt )- 1 wait times the initial vector, where i is the identity matrix, and bt is the transpose of the b matrix, and normalizing the orthogonal projection in a predefined manner.

- step (2 -rrb-further comprises the step of: generating a matrix b by multiplying a diagonal matrix of the initial values of the variables of the objective function by a matrix of the coefficients of the constraint relationships, and adding an additional queue row to matrix b containing a value of unity in each matrix position of the row,

- step (3 -rrb-further comprises the step of: computing the orthogonal projection of the transformed initial vector from the matrix equation [i-bt (bbt )- 1 wait times the initial vector, where i is the identity matrix, and bt is the transpose of the b matrix, and normalizing the orthogonal projection in a predefined manner.

5.
A
variable
and
a
faced
variable
coefficient,
and
by
one
or
more
constraint
relationships
expressed
in
terms
of
one
or
more
of
the
variables
of
the
evaluation
function,
the
method
comprising
the
steps
of:
determining
an
initial
value
for
each
of
the
variables
of
the
objective
function
such
that
an
initial
vector
defined
by
the
initial
values
resides
inside
a
polytope
defined
by
the
constraint
relationships,
(2
-rrb-transforming
transforming
the
polytope,
the
initial
vector
and
the
constraint
detections,
into
a
simplex
≧0,
≧xi,
in
which
the
transformed
initial
vector
is
located
substantially
at
the
center
of
the
simplex,
(3
-rrb-project
projecting
transformed
vector
of
the
objective
function
orthogonally
onto
the
null
space
of
the
transformed
constraint
relationships,
(4
-rrb-determining
determining
direction
of
the
projection
of
the
transformed
objective
function,
(5
-rrb-determining
determining
new
value
for
each
of
the
variables
of
the
objective
function
by
moving
from
the
center
e/n
of
the
simplex,
a
distance
equal
to
a
predefined
multiple
of
the
radius
of
the
largest
sphere
contained
within
the
simplex
and
centerred
at
the
origin
of
the
transformed
initial
vector,
(6
-rrb-transforming
transforming
new
values
back
into
the
original
variables,
(7
-rrb-repeating
repeating
(2
-rrb-through
(6
),
substituting
the
new
values
for
the
initial
values
of
the
objective
function
variables,
until
a
satisfactory
minimization
of
the
management
time
is
obtained,
and
(8
-rrb-allocating
system
resources
to
the
individual
system
entities
according
to
the
final
values
of
the
elements
of
the
objective
function,
wherein

- step (2 -rrb-further comprises the step of: generating a matrix b by multiplying a diagonal matrix of the initial values of the variables of the objective function by a matrix of the coefficients of the constraint relationships, and adding an additional queue row to matrix b containing a value of unity in each matrix position of the row,

- step (3 -rrb-further comprises the step of: computing the orthogonal projection of the transformed initial vector from the matrix equation [i-bt (bbt )- 1 wait times the initial vector, where i is the identity matrix, and bt is the transpose of the b matrix, and normalizing the orthogonal projection in a predefined manner.

- step (2 -rrb-further comprises the step of: generating a matrix b by multiplying a diagonal matrix of the initial values of the variables of the objective function by a matrix of the coefficients of the constraint relationships, and adding an additional queue row to matrix b containing a value of unity in each matrix position of the row,

- step (3 -rrb-further comprises the step of: computing the orthogonal projection of the transformed initial vector from the matrix equation [i-bt (bbt )- 1 wait times the initial vector, where i is the identity matrix, and bt is the transpose of the b matrix, and normalizing the orthogonal projection in a predefined manner.

6.
A
variable
and
a
faced
variable
coefficient,
and
by
one
or
more
constraint
relationships
expressed
in
terms
of
one
or
more
of
the
variables
of
the
evaluation
function,
the
method
comprising
the
steps
of:
determining
an
initial
value
for
each
of
the
variables
of
the
objective
function
such
that
an
initial
vector
defined
by
the
initial
values
resides
inside
a
polytope
defined
by
the
constraint
relationships,
(2
-rrb-transforming
transforming
the
polytope,
the
initial
vector
and
the
constraint
relationships,
into
a
simplex
≧0,
≧xi,
in
which
the
transformed
initial
vector
is
located
substantially
at
the
center
of
the
simplex,
(3
-rrb-project
projecting
transformed
vector
of
the
objective
function
orthogonally
onto
the
null
space
of
the
transformed
constraint
detections,
(4
-rrb-determining
determining
direction
of
the
projection
of
the
transformed
objective
function,
(5
-rrb-determining
determining
new
value
for
each
of
the
variables
of
the
objective
function
by
moving
from
the
center
e/n
of
the
simplex,
a
distance
equal
to
a
predefined
multiple
of
the
radius
of
the
largest
sphere
contained
within
the
simplex
and
centerred
at
the
origin
of
the
transformed
initial
vector,
(6
-rrb-transforming
transforming
new
values
back
into
the
original
variables,
(7
-rrb-repeating
repeating
(2
-rrb-through
(6
),
substituting
the
new
values
for
the
initial
values
of
the
objective
function
variables,
until
a
satisfactory
minimization
of
the
management
time
is
obtained,
and
(8
-rrb-allocating
system
resources
to
the
individual
system
entities
according
to
the
final
values
of
the
elements
of
the
objective
function,
wherein

- step (2 -rrb-further comprises the step of: generating a matrix b by multiplying a diagonal matrix of the initial values of the variables of the objective function by a matrix of the coefficients of the constraint relationships, and adding an additional queue row to matrix b containing a value of unity in each matrix position of the row,

- step (3 -rrb-further comprises the step of: computing the orthogonal projection of the transformed initial vector from the matrix equation [i-bt (bbt )- 1 wait times the initial vector, where i is the identity matrix, and bt is the transpose of the b matrix, and normalizing the orthogonal projection in a predefined manner.

- step (2 -rrb-further comprises the step of: generating a matrix b by multiplying a diagonal matrix of the initial values of the variables of the objective function by a matrix of the coefficients of the constraint relationships, and adding an additional queue row to matrix b containing a value of unity in each matrix position of the row,

- step (3 -rrb-further comprises the step of: computing the orthogonal projection of the transformed initial vector from the matrix equation [i-bt (bbt )- 1 wait times the initial vector, where i is the identity matrix, and bt is the transpose of the b matrix, and normalizing the orthogonal projection in a predefined manner.

7.
A
variable
and
a
faced
variable
coefficient,
and
by
one
or
more
constraint
relationships
expressed
in
terms
of
one
or
more
of
the
variables
of
the
evaluation
function,
the
method
comprising
the
steps
of:
determining
an
initial
value
for
each
of
the
variables
of
the
objective
function
such
that
an
initial
vector
defined
by
the
initial
values
resides
inside
a
polytope
defined
by
the
constraint
relationships,
(2
-rrb-transforming
transforming
the
polytope,
the
initial
vector
and
the
constraint
relationships,
into
a
simplex
≧0,
≧xi,
in
which
the
transformed
initial
vector
is
located
substantially
at
the
center
of
the
simplex,
(3
-rrb-project
projecting
transformed
vector
of
the
objective
function
orthogonally
onto
the
null
space
of
the
transformed
constraint
relationships,
(4
-rrb-determining
determining
direction
of
the
projection
of
the
transformed
objective
function,
(5
-rrb-determining
determining
new
value
for
each
of
the
variables
of
the
objective
function
by
moving
from
the
center
e/n
of
the
simplex,
a
distance
equal
to
a
predefined
multiple
of
the
radius
of
the
largest
sphere
contained
within
the
simplex
and
centerred
at
the
origin
of
the
transformed
initial
vector,
(6
-rrb-transforming
transforming
new
values
back
into
the
original
variables,
(7
-rrb-repeating
repeating
(2
-rrb-through
(6
),
substituting
the
new
values
for
the
initial
values
of
the
objective
function
variables,
until
a
satisfactory
minimization
of
the
management
time
is
obtained,
and
(8
-rrb-allocating
system
resources
to
the
individual
system
entities
according
to
the
final
values
of
the
elements
of
the
objective
function,
wherein

- step (2 -rrb-further comprises the step of: generating a matrix b by multiplying a diagonal matrix of the initial values of the variables of the objective function by a matrix of the coefficients of the constraint detections, and adding an additional queue row to matrix b containing a value of unity in each matrix position of the row,

- step (3 -rrb-further comprises the step of: computing the orthogonal projection of the transformed initial vector from the matrix equation [i-bt (bbt )- 1 wait times the initial vector, where i is the identity matrix, and bt is the transpose of the b matrix, and normalizing the orthogonal projection in a predefined manner.

- step (2 -rrb-further comprises the step of: generating a matrix b by multiplying a diagonal matrix of the initial values of the variables of the objective function by a matrix of the coefficients of the constraint detections, and adding an additional queue row to matrix b containing a value of unity in each matrix position of the row,

- step (3 -rrb-further comprises the step of: computing the orthogonal projection of the transformed initial vector from the matrix equation [i-bt (bbt )- 1 wait times the initial vector, where i is the identity matrix, and bt is the transpose of the b matrix, and normalizing the orthogonal projection in a predefined manner.