All The Claims

What is claimed is:

1. Method for computing an interface of a fluid in a space, the space being represented by a grid having cells, comprising
providing, for a current time step, a quantity of the fluid in a cell and populations of the fluid in the cell, wherein each population has associated therewith a fluid moving in a direction from a predefined set of directions, wherein all populations for all directions of the predetermined set of directions in the cell sum up to a density in the cell, and the quantity of the fluid in the cell lies between zero and the density;
computing, for a subsequent time step, the quantity of the fluid in the cell based upon the populations of the fluid in surrounding cells from the current time step which are associated with directions directed into the cell;
determining at least one population of the cell for the subsequent time step by propagating the populations from the current time step of the fluid from the surrounding cells into the cell; and
calculating remaining populations of the cell, which have not been determined by the step of determining, by means of the following substeps:
deriving an extrapolated macroscopic velocity value of the fluid for the cell for the subsequent time step by extrapolating a macroscopic velocity value from a preceding time step andor surrounding cells;
computing coefficients describing the relation between the populations for the cell and the actual macroscopic density and the actual macroscopic momentum for the cell, by developing the relation between populations on the one hand and space and time on the other hand around an equilibrium condition, and by using the extrapolated macroscopic velocity value;
computing a macroscopic density value and a macroscopic momentum value by using the coefficients and the populations of the cell determined by the step of propagating; and
computing the remaining populations using the macroscopic density value and the macroscopic momentum value and the coefficients whereby all populations for the cell at the interface of the fluid in the space are obtained.
2. Method according to claim 1, wherein the step of calculating remaining populations of the cell is performed for all cells of the grid where the quantity in the subsequent time step is non-zero, and into which at least one population has been propagated from the surrounding cells.
3. Method according to one of claims 1, wherein the steps of providing, computing and determining are performed with respect to all cells where the quantity of the fluid in the current time step is non-zero.
4. Method according to one of claims 1, further comprising
consecutively performing a collision in all cells in which the directions of the populations determined by propagating form the entire predetermined set of directions and, after the step of calculating remaining populations of the cell, in the cell, the collision being performed by solving an equation indicating the relation between populations on the one hand and space and time on the other hand.
5. Method according to one of claims 1, wherein the relation between populations on the on hand and times and space on the other hand is described by a Lattice-Boltzmann equation.
6. Method according to one of claims 1, the substep of computing coefficients comprising
using a Chapman-Enskog expansion as a development of a Lattice-Boltzmann equation defining the relation between populations on the one hand and space and time on the other hand around the equilibrium condition.
7. Method according to claim 6, the substep of computing coefficients further comprising
linearizing the Chapmann-Enskog expansion by use of the extrapolated macroscopic velocity value such that
NiBijXibi
where 0<i<bm1, 1<j<1, bm is the number of directions in the predetermined set of directions minus 1, Ni is the population moving in direction associated with i, Bij and bi are the coefficients, Xi are, in the case of 2D space, variables for macroscopic density and components of the macroscopic momentum, and, in the case of 3D space, variables for macroscopic density, components of the macroscopic momentum and derivatives of the latter, and l is the number of components in {overscore (X)}.
8. Method according to claim 7, wherein
the predetermined set of directions comprises the zero-vector and, in case of 2D space, the directions leading from a center of a square to the corners and the medians of the square, and, in case of 3D space, the directions leading from a center of a cube to the corners and face-centers of the cube;
wherein the Chapman-Enskog expansion is used in the following form
Ni({right arrow over (r)},t)Nieq.({right arrow over (r)},t)Ni(1)({right arrow over (r)},t) with i0, . . . ,bm,
wherein
66
N
i

eq
.
=
t
p
*
c
s
2
+
J
C

i
+
u
u
2
(
3
C

i
C

i
–
)
,
u
=
j
,
J
=
j
–
1
2
F
,
N
i

(
1
)
=
1
j
Q

i
+
1
e
j
E
i
im
,
Q

i
=
t
p
*
(
C

i
C

i
–
c
i
2

D
)
,
E
i
im

=
t
p
*
(
c
i
2

D

–

c
s
2
)
,
p
=
C
i
2
,
=
i
=
0
b
m
N
i
,
J
=
i
=
0
b
m
N
i
C
i
,
C
i
2

=
c
i
2
,
=
–

(
–

c
s
2
)
(
1
e
+

1
2
)
,
=
D
+
2
3

D
,
v
=
1
3
(
–

1
–

1
2
)
wherein ,1 . . . D, is perturbation parameter, D is dimension of space, bm is the number of directions in the predetermined set of directions minus 1, cs2 is the squared sound velocity, is macroscopic density, {right arrow over (i)} is the macroscopic momentum, {right arrow over (u)} is macroscopic velocity, {right arrow over (F)} is an external force, Ci and Ci are components of the velocity {right arrow over (C)}i of population Ni, is kinematic viscosity, is bulk viscosity, and t*p are predefined model parameters.
9. Method according to claim 8, the subset of deriving comprising
extrapolating the macroscopic velocity value and a macroscopic density value in order to obtain the extrapolated macroscopic velocity value and the extrapolated macroscopic density value, from a preceding time step andor a surrounding cell,
and the step of linearizing comprises:
replacing the non-linear term uu in the first order Chapman-Enskog expansion by a product of the macroscopic momentum value and the extrapolated macroscopic velocity.
10. Method according to one of claims 6, the substep of computing the macroscopic density value and macroscopic momentum value comprising
if the number of populations of the cell determined by propagating plus 1 is smaller than the number of components of vector {overscore (X)}, extrapolating populations of the cell not being determined by propagating from a preceding time step andor a surrounding cell.
11. Method according to one of claims 6, wherein the substep of computing the macroscopic density value and the macroscopic momentum value further comprises the following step:
solving a linearized system which is based on equations
67
j
B
ij
X
j
=
N
i

–

b
i
,
i
I
+
and
–
i
I
–
N
i
=
i
I
+
N
i
,
where I is the set of indices corresponding to populations being determined by the step of propagating, I is the set of indices corresponding to the remaining populations, is the actual macroscopic density, in least-square sense or by use of a single value decomposition method.
12. Method according to one of claims 1, wherein the subsets of computing the coefficients, computing the actual macroscopic density and macroscopic momentum and of computing the remaining populations are iteratively repeated, the macroscopic density value and the macroscopic momentum value obtained in a previous iteration step in the substep of computing the actual macroscopic density and the actual macroscopic momentum, being used, in the next iteration step, for extrapolation.
13. Method according to one of claims 1, wherein the method is applied to a simulation of a filling process of the fluid into a cavity.
14. Method according to one of claims 1, wherein the computational fault increases by nD1, wherein D is the dimension of space, if the grid is refined by n.
15. Method according to one of claims 1, the step of providing comprising
Scaling the grid based on experimental or physical Reynold and Froud numbers.
initializing the quantity of fluid in each cell in which the fluid is at the beginning of the simulation;
initializing all populations of all cells based on an initial density and velocity; and
performing a collision on the initialized cells.
16. Method for computing an interface of a fluid in a space, the space being represented by a grid having cells, comprising
providing, for a current time step, a quantity of the fluid in at least one of surrounding cells of a cell and populations of the fluid in the at least one of surrounding cells, wherein each population has associated therewith a fluid moving in a direction from a predefined set of directions, wherein all populations for all directions of the predetermined set of directions in the cell sum up to a density in the at least one of surrounding cells, and the quantity of the fluid in the cell lies between zero and the density;
computing, for a subsequent time step, the quantity of the fluid in the cell, the quantity of which is zero for the current time step, based upon the population of the fluid in the at least one of surrounding cells from the current time step which is associated with a direction directed into the cell;
determining at least one population of the cell for the subsequent time step by propagating the population from the current time step of the fluid from the at least one surrounding cell into the cell; and
calculating remaining populations of the cell, which have not been determined by the step of determining, by means of the following substeps;
deriving an extrapolated macroscopic velocity value of the fluid for the cell for the subsequent time step by extrapolating a macroscopic velocity value from a preceding time step andor surrounding cell;
computing coefficients describing the relation between the population for the cell and the actual macroscopic density and the actual macroscopic momentum for the cell, by developing the relation between populations on the one hand and space and time on the other hand around an equilibrium condition, and by using the extrapolated macroscopic velocity value;
computing a macroscopic density value and a macroscopic momentum value by using the coefficients and the populations of the cell determined by propagating; and
computing the remaining populations using the macroscopic density value and the macroscopic momentum value and the coefficients whereby all populations for the cell at the interface of the fluid in the space are obtained.
17. Method according to claim 16, wherein the step of calculating remaining populations of the cell is performed for all cells of the grid, where the quantity in the subsequent time step is non-zero, whereas the quantity in the current time step is zero.
18. Method according to one of claims 16, wherein the steps of providing, computing and determining are performed with respect to all cells where the quantity of the fluid in the current time step is non-zero.
19. Method according to one of claims 16, further comprising
consecutively performing a collision in all cells in which the directions of the populations determined by propagating form the entire predetermined set of directions and, after the step of calculating remaining populations of the cell, in the cell, the collision being performed by solving an equation indicating the relation between populations on the one hand and space and time on the other hand.
20. Method according to one of claims 16, wherein the relation between populations on the on hand and times and space on the other hand is described by a Lattice-Boltzmann equation.
21. Method according to one of claims 16, the substep of computing coefficients comprising
using a Chapman-Enskog expansion as a development of a Lattice-Boltzmann equation defining the relation between populations on the one hand and space and time on the other hand around the equilibrium condition.
22. Method according to claim 21, the substep of computing coefficients further comprising
linearizing the Chapmann-Enskog expansion by use of the extrapolated macroscopic velocity value such that
NiBijXibi
where 0<i<bm1, 1<j<1, bm is the number of directions in the predetermined set of directions minus 1, N1 is the population moving in direction associated with i, Bij and bi are the coefficients, Xi are, in the case of 2D space, variables for macroscopic density and components of the macroscopic momentum, and, in the case of 3D space, variables for macroscopic density, components of the macroscopic momentum and derivatives of the latter, and l is the number of components in {fraction (X)}.
23. Method according to claim 22, wherein
the predetermined set of directions comprises the zero-vector and, in case of 2D space, the directions leading from a center of a square to the corners and the medians of the square, and, in case of 3D space, the directions leading from a center of a cube to the corners and face-centers of the cube;
wherein the Chapman-Enskog expansion is used in the following form
Ni({right arrow over (r)},t)Nieq.({right arrow over (r)},t)Ni(1)({right arrow over (r)},t) with i0, . . . ,bm,
wherein
68
N
i

eq
.
=
t
p
*
c
s
2
+
J
C

i
+
u
u
2
(
3
C

i
C

i
–
)
,
u
=
j
,
J
=
j
–
1
2
F
,
N
i

(
1
)
=
1
j
Q

i
+
1
e
j
E
i
im
,
Q

i
=
t
p
*
(
C

i
C

i
–
c
i
2

D
)
,
E
i
im

=
t
p
*
(
c
i
2

D

–

c
s
2
)
,
p
=
C
i
2
,
=
i
=
0
b
m
N
i
,
J
=
i
=
0
b
m
N
i
C
i
,
C
i
2

=
c
i
2
,
=
–

(
–

c
s
2
)
(
1
e
+

1
2
)
,
=
D
+
2
3

D
,
v
=
1
3
(
–

1
–

1
2
)
wherein ,1 . . . D, is perturbation parameter, D is dimension of space, bm is the number of directions in the predetermined set of directions minus 1, cs2 is the squared sound velocity, is macroscopic density, {right arrow over (i)} is the macroscopic momentum, {right arrow over (u)} is macroscopic velocity, {right arrow over (F)} is an external force, Ci and Ci are components of the velocity {right arrow over (C)}i of population Ni, is kinematic viscosity, is bulk viscosity, and t*p are predefined model parameters.
24. Method according to claim 23, the subset of deriving comprising
extrapolating the macroscopic velocity value and a macroscopic density value in order to obtain the extrapolated macroscopic velocity value and the extrapolated macroscopic density value, from a preceding time step andor a surrounding cell,
and the step of linearizing comprises:
replacing the non-linear term uu in the first order Chapman-Enskog expansion by a product of the macroscopic momentum value and the extrapolated macroscopic velocity.
25. Method according to one of claims 21, the substep of computing the macroscopic density value and macroscopic momentum value comprising
if the number of populations of the cell determined by propagating plus 1 is smaller than the number of components of vector {overscore (X)}, extrapolating populations of the cell not being determined by propagating from a preceding time step andor a surrounding cell.
26. Method according to one of claims 21, the substep of computing the macroscopic density value and the macroscopic momentum value further comprising
solving a linearized system which is based on equations
69
j
B
ij
X
j
=
N
i

–

b
i
,
i
I
+
and
–
i
I
–
N
i
=
i
I
+
N
i
,
where I is the set of indices corresponding to populations being determined by the step of propagating, I is the set of indices corresponding to the remaining populations, is the actual macroscopic density, in least-square sense or by use of a single value decomposition method.
27. Method according to one of claims 16, wherein the subsets of computing the coefficients, computing the actual macroscopic density and macroscopic momentum and of computing the remaining populations are iteratively repeated, the macroscopic density value and the macroscopic momentum value obtained in a previous iteration step in the substep of computing the actual macroscopic density and the actual macroscopic momentum, being used, in the next iteration step, for extrapolation.
28. Method according to one of claims 16, wherein the method is applied to a simulation of a filling process of the fluid into a cavity.
29. Method according to one of claims 16, wherein the computational fault increases by nD1, wherein D is the dimension of space, if the grid is refined by n.
30. Method according to one of claims 1 to 16, the step of providing comprising
Scaling the grid based on experimental or physical Reynold and Froud numbers.
initializing the quantity of fluid in each cell in which the fluid is at the beginning of the simulation;
initializing all populations of all cells based on an initial density and velocity; and
performing a collision on the initialized cells.
31. Apparatus for computing an interface of a fluid in a space, the space being represented by a grid having cells, comprising:
provider for providing, for a current time step, a quantity of the fluid in a cell and populations of the fluid in the cell, wherein each population has associated go therewith a fluid moving in a direction from a predefined set of directions, wherein all populations for all directions of the predetermined set of directions in the cell sum up to a density in the cell, and the quantity of the fluid in the cell lies between zero and the density;
first calculator for computing, for a subsequent time step, the quantity of the fluid in the cell based upon the populations of the fluid in surrounding cells from the current time step which are associated with directions directed into the cell;
first processor for determining at least one population of the cell for the subsequent time step by propagating the populations from the current time step of the fluid from the surrounding cells into the cell; and
second calculator for calculating remaining populations of the cell, which are not determined by the means for determining, the second calculator comprising
second processor for deriving an extrapolated macroscopic velocity value of the fluid for the cell for the subsequent time step by extrapolating a macroscopic velocity value from a preceding time step andor surrounding cells;
third calculator for computing coefficients describing the relation between the populations for the cell and the actual macroscopic density and the actual macroscopic momentum for the cell, by developing the relation between populations on the one hand and space and time on the other hand around an equilibrium condition, and by using the extrapolated macroscopic velocity value;
fourth calculator for computing a macroscopic density value and a macroscopic momentum value by using the coefficients and the populations of the cell determined by the means for propagating; and
fifth calculator for computing the remaining populations using the macroscopic density value and the macroscopic momentum value and the coefficients whereby all populations for the cell at the interface of the fluid in the space are obtained.
32. Apparatus for computing an interface of a fluid in a space, the space being represented by a grid having cells, comprising:
provider for providing, for a current time step, a quantity of the fluid in at least one of surrounding cells of a cell and populations of the fluid in the at least one of surrounding cells, wherein each population has associated therewith a fluid moving in a direction from a predefined set of directions, wherein all populations for all directions of the predetermined set of directions in the cell sum up to a density in the at least one of surrounding cells, and the quantity of the fluid in the cell lies between zero and the density value;
first calculator for computing, for a subsequent time step, the quantity of the fluid in the cell, the quantity of which is zero for the current time step, based upon the population of the fluid in the at least one of surrounding cells from the current time step which is associated with a direction directed into the cell;
first processor for determining at least one population of the cell for the subsequent time step by propagating the population from the current time step of the fluid from the at least on surrounding cell into the cell; and
second calculator for calculating remaining populations of the cell, which are not determined by the means for determining, the means for calculating remaining populations comprising
second processor for deriving an extrapolated macroscopic velocity value of the fluid for the cell for the subsequent time step by extrapolating a macroscopic velocity value from a preceding time step andor surrounding cell;
third calculator for computing coefficients describing the relation between the population for the cell and the actual macroscopic density and the actual macroscopic momentum for the cell, by developing the relation between populations on the one hand and space and time on the other hand around an equilibrium condition, and by using the extrapolated macroscopic velocity value;
fourth calculator for computing a macroscopic density value and a macroscopic momentum value by using the coefficients and the populations of the cell determined by the means for propagating; and
fifth calculator for computing the remaining populations using the macroscopic density value and the macroscopic momentum value and the coefficients whereby all populations for the cell at the interface of the fluid in the space are obtained.
33. Computer-readable medium having stored thereon a computer program which is executable by an computer, the computer program having a method for computing an interface of a fluid in a space, the space being represented by a grid having cells, the method comprising
providing, for a current time step, a quantity of the fluid in a cell and populations of the fluid in the cell, wherein each population has associated therewith a fluid moving in a direction from a predefined set of directions, wherein all populations for all directions of the predetermined set of directions in the cell sum up to a density in the cell, and the quantity of the fluid in the cell lies between zero and the density;
computing, for a subsequent time step, the quantity of the fluid in the cell based upon the populations of the fluid in surrounding cells from the current time step which are associated with directions directed into the cell;
determining at least one population of the cell for the subsequent time step by propagating the populations from the current time step of the fluid from the surrounding cells into the cell; and
calculating remaining populations of the cell, which have not been determined by the step of determining, by means of the following substeps:
deriving an extrapolated macroscopic velocity value of the fluid for the cell for the subsequent time step by extrapolating a macroscopic velocity value from a preceding time step andor surrounding cells;
computing coefficients describing the relation between the populations for the cell and the actual macroscopic density and the actual macroscopic momentum for the cell, by developing the relation between populations on the one hand and space and time on the other hand around an equilibrium condition, and by using the extrapolated macroscopic velocity value;
computing a macroscopic density value and a macroscopic momentum value by using the coefficients and the populations of the cell determined by the step of propagating; and
computing the remaining populations using the macroscopic density value and the macroscopic momentum value and the coefficients whereby all populations for the cell at the interface of the fluid in the space are obtained.
34. Computer-readable medium having stored thereon a computer program which is executable by an computer, the computer program having a method for computing an interface of a fluid in a space, the space being represented by a grid having cells, comprising
providing, for a current time step, a quantity of the fluid in at least one of surrounding cells of a cell and populations of the fluid in the at least one of surrounding cells, wherein each population has associated therewith a fluid moving in a direction from a predefined set of directions, wherein all populations for all directions of the predetermined set of directions in the cell sum up to a density in the at least one of surrounding cells, and the quantity of the fluid in the cell lies between zero and the density;
computing, for a subsequent time step, the quantity of the fluid in the cell, the quantity of which is zero for the current time step, based upon the population of the fluid in the at least one of surrounding cells from the current time step which is associated with a direction directed into the cell;
determining at least one population of the cell for the subsequent time step by propagating the population from the current time step of the fluid from the at least one surrounding cell into the cell; and
calculating remaining populations of the cell, which have not been determined by the step of determining, by means of the following substeps;
deriving an extrapolated macroscopic velocity value of the fluid for the cell for the subsequent time step by extrapolating a macroscopic velocity value from a preceding time step andor surrounding cell;
computing coefficients describing the relation between the population for the cell and the actual macroscopic density and the actual macroscopic momentum for the cell, by developing the relation between populations on the one hand and space and time on the other hand around an equilibrium condition, and by using the extrapolated macroscopic velocity value;
computing a macroscopic density value and a macroscopic momentum value by using the coefficients and the populations of the cell determined by propagating; and
computing the remaining populations using the macroscopic density value and the macroscopic momentum value and the coefficients whereby all populations for the cell at the interface of the fluid in the space are obtained.
The claims below are in addition to those above.
All refrences to claim(s) which appear below refer to the numbering after this setence.

1. An apparatus for determining user authentication requirements, the apparatus comprising:
a computing platform including a memory and a processor in communication with the memory;
an authentication requirements module stored in the memory, executable by the processor and configured to,
receive a request for a user to access a service requiring authentication,
in response to receiving the request, determine (1) a current physical location of the user and a current time, and (2) that the user is associated with a predetermined pattern of movement having location boundaries and a time period,
determine proximity in distance and time of the current physical location of the user and current time to the predetermined pattern of movement associated with the user, and
determine authentication requirements for the user to access the service based on the proximity in distance and time of the current physical location of the user and the current time to the predetermined pattern of movement,

wherein the user is provided access to the service in response to the user meeting the determined authentication requirements.
2. The apparatus of claim 1, wherein the authentication requirements module is further configured to determine a level of authentication required for the user to access the service based on the proximity in distance and time of the current physical location of the user to the predetermined pattern of movement, wherein the level of authentication is from amongst a plurality of levels of authentication.
3. The apparatus of claim 2, wherein the authentication requirements module is further configured to determine the level authentication required based on the proximity in distance and time of the current physical location of the user to the predetermined pattern of movement, wherein each level of authentication is defined by at least one of a predetermined distance threshold or a predetermined time threshold.
4. The apparatus of claim 2, wherein the authentication requirements module is further configured to determine the level of authentication as a no-authentication-required level based on the user currently being physically located within predetermined boundaries of the pattern of movement and the current time being within a predetermined time period for the user to be located within the pattern of movement, wherein the no-authentication-required level does not require the user to provide authentication to access the service.
5. The apparatus of claim 2, wherein the authentication requirements module is further configured to determine the level of authentication as a partial authentication level based on one of either (a) the user currently being physically located within predetermined boundaries of the pattern of movement, or (b) the user currently being physically located outside of the pattern of movement by a predetermined distance and the current time being within a predetermined time period for the user to be located within the pattern of movement, wherein the partial authentication requires the user to provide less than full authentication credentials to access the service.
6. The apparatus of claim 2, wherein the authentication requirements module is further configured to determine the level of authentication as a full authentication level based on one of (1) the user currently being physically located outside of the pattern of movement by a predetermined distance, or (2) the current time being outside of a predetermined time period for the user to be located within on the pattern of movement.
7. The apparatus of claim 1, wherein the authentication requirements module is further configured to determine a point along an authentication continuum based on the proximity in distance and time of the current physical location of the user and the current time to the predetermined pattern of movement, wherein the point along the authentication continuum corresponds to predetermined authentication requirements.
8. The apparatus of claim 1, further comprising a service access module stored in the memory, executable by the processor and configured to determine a level of access available to the user of the service upon the user providing the determined authentication requirements, wherein the level of access defines functionality available to the user within the service based on the determined authentication requirements, wherein the level of access is granted to the user in response to the user providing the determined authentication requirements.
9. A method for determining user authentication requirements, the method comprising:
receiving, by a computing device, a request for a user to access a service requiring authentication;
in response to receiving the request, determining, by a computing device processor, (1) a current physical location of the user and a current time and (2) that the user is associated with a predetermined pattern of movement having location boundaries and a time period;
determining, by a computing device processor, proximity in distance and time of the current physical location of the user and current time to the predetermined pattern of movement; and
determining, by a computing device processor, authentication requirements for the user to access the service based on the proximity in distance and time of the current physical location of the user and the current time to the predetermined pattern of movement,
wherein the user is provided access to the service in response to the user meeting the determined authentication requirements.
10. The method of claim 9, wherein determining the authentication requirements further comprises determining, by the computing device processor, a level of authentication required for the user to access the service based on the proximity in distance and time of the current physical location of the user and the current time to the predetermined pattern of movement, wherein the level of authentication is from amongst a plurality of levels of authentication.
11. The method of claim 10, wherein determining the level of authentication further comprises determining, by a computing device processor, the level of authentication required based on the proximity in distance and time of the current physical location of the user and the current time to the predetermined pattern of movement, wherein each level of authentication is defined by at least one of a predetermined distance threshold or a predetermined time threshold.
12. The method of claim 10, wherein determining the level of authentication further comprises determining, by a computing device processor, the level of authentication as a no-authentication-required level based on the user currently being physically located within predetermined boundaries of the pattern of movement and the current time being within a predetermined time period for the user to be travelling on the pattern of movement, wherein the no-authentication-required level does not require the user to provide authentication to access the service.
13. The method of claim 10, wherein the level of authentication further comprises determining, by a computing device processor, the level of authentication as a partial authentication level based on one of either (a) the user currently being physically located within predetermined boundaries of the pattern of movement or (b) the user currently being physically located outside of the pattern of movement by a predetermined distance and the current time being within a predetermined time period for the user to be travelling on the pattern of movement, wherein the partial authentication requires the user to provide less than full authentication credentials to access the service.
14. The method of claim 10, wherein the determining the level of authentication further comprises determining, by a computing device processor, the level of authentication as a full authentication level based on one of (1) the user currently being physically located outside of the pattern of movement by a predetermined distance, or (2) the current time being outside of a predetermined time period for the user to be located within the pattern of movement.
15. The method of claim 9, wherein determining the authentication requirements further comprises determining, by the computing device processor, a point along an authentication continuum based on the proximity in distance and time of the current physical location of the user and the current time to the predetermined pattern of movement, wherein the point along the authentication continuum corresponds to predetermined authentication requirements.
16. The method of claim 9, further comprising determining, by a computing device processor, a level of access available to the user of the service upon the user providing the determined authentication requirements, wherein the level of access defines functionality available to the user within the service based on the determined authentication requirements, wherein the level of access is granted to the user in response to the user providing the determined authentication requirements.
17. A computer program product comprising:
a non-transitory computer-readable medium comprising:
a first set of codes for causing a computer to receive a request for a user to access a service requiring authentication;
a second set of codes for causing a computer to, in response to receiving the request, determine (1) a current physical location of the user and a current time and (2) that the user is associated with a predetermined pattern of movement having location boundaries and a time period;
a third set of codes for causing a computer to determine proximity in distance and time of the current physical location of the user and current time to a predetermined pattern of movement; and
a fourth set of codes for causing a computer to determine authentication requirements for the user to access the service based on the proximity in distance and time of the current physical location of the user and the current time to the predetermined pattern of movement,

wherein the user is provided access to the service in response to the user meeting the determined authentication requirements.
18. The computer program product of claim 17, wherein the fourth set of codes is further configured to cause the computer to determine a level of authentication required for the user to access the service based on the proximity in distance and time of the current physical location of the user and the current time to the predetermined pattern of movement, wherein the level of authentication is from amongst a plurality of levels of authentication.
19. The computer program product of claim 18, wherein the fourth set of codes is further configured to cause the computer to determine the level of authentication the level of authentication required based on the proximity in distance and time of the current physical location of the user and the current time to the predetermined pattern of movement, wherein each level of authentication is defined by at least one of a predetermined distance threshold or a predetermined time threshold.
20. The computer program product of claim 18, wherein the fourth set of codes is further configured to cause the computer to determine the level of authentication as a no-authentication-required level based on the user currently being physically located within predetermined boundaries of the pattern of movement and the current time being within a predetermined time period for the user to be located within the pattern of movement, wherein the no-authentication-required level does not require the user to provide authentication to access the service.
21. The computer program product of claim 18, wherein the fourth set of codes is further configured to cause the computer to determine the level of authentication as a partial authentication level based on one of either (a) the user currently being physically located within predetermined boundaries of the pattern of movement or (b) the user currently being physically located outside of the pattern of movement by a predetermined distance and the current time being within a predetermined time period for the user to be located within the pattern of movement, wherein the partial authentication requires the user to provide less than full authentication credentials to access the service.
22. The computer program product of claim 18, wherein the fourth set of codes is further configured to cause the computer to determine the level of authentication as a full authentication level based on one of (1) the user currently being physically located outside of the pattern of movement by a predetermined distance, or (2) the current time being outside of a predetermined time period for the user to be located within the pattern of movement.
23. The computer program product of claim 17, wherein the fourth set of codes is further configured to cause the computer to determine a point along an authentication continuum based on the proximity in distance and time of the current physical location of the user and the current time to the predetermined pattern of movement, wherein the point along the authentication continuum corresponds to predetermined authentication requirements.
24. The computer program product of claim 17, further comprising a fifth set of codes for causing a computer to determine a level of access available to the user of the service upon the user providing the determined authentication requirements, wherein the level of access defines functionality available to the user within the service based on the determined authentication requirements, wherein the level of access is granted to the user in response to the user providing the determined authentication requirements.

1. A method of access control of a field of a record in computer memory of a computing system, the computer memory of the computing system comprising a plurality of disparate memory types, the method comprising:
defining, by an application, a record, the record comprising one or more fields, the one or more fields including a restricted field having a specification of restricted accessibility when the restricted field is allocated in a particular memory type;
allocating, by the application, an instance of the record in memory of the particular memory type; and
while the record is allocated in the particular memory type, denying, by the application, each attempted access of the restricted field.
2. The method of claim 1, wherein allocating an instance of the record in memory of the particular memory type further comprises executing, for each field of the record, a function call to allocate the field in memory, the function call to allocate the restricted field comprising a memory type-specific function call.
3. The method of claim 1, wherein the computer memory comprises one or more modules of persistent non-volatile, addressable memory and one or more modules of volatile random access memory (\u2018RAM\u2019).
4. The method of claim 1, wherein the persistent non-volatile, addressable memory comprises Phase Change Memory (\u2018PCM\u2019).
5. The method of claim 1, wherein the record comprises one of a union, a struct, a class, or an object.
6. An apparatus for access control of a field of a record in computer memory of a computing system, the computer memory of the computing system comprising a plurality of disparate memory types, the apparatus comprising a computer processor, a computer memory operatively coupled to the computer processor, the computer memory having disposed within it computer program instructions that, when executed by the computer processor, cause the apparatus to carry out the steps of:
defining, by an application, a record, the record comprising one or more fields, the one or more fields including a restricted field having a specification of restricted accessibility when the restricted field is allocated in a particular memory type;
allocating, by the application, an instance of the record in memory of the particular memory type; and
while the record is allocated in the particular memory type, denying, by the application, each attempted access of the restricted field.
7. The apparatus of claim 6, wherein allocating an instance of the record in memory of the particular memory type further comprises executing, for each field of the record, a function call to allocate the field in memory, the function call to allocate the restricted field comprising a memory type-specific function call.
8. The apparatus of claim 6, wherein the computer memory comprises one or more modules of persistent non-volatile, addressable memory and one or more modules of volatile random access memory (\u2018RAM\u2019).
9. The apparatus of claim 6, wherein the persistent non-volatile, addressable memory comprises Phase Change Memory (\u2018PCM\u2019).
10. The apparatus of claim 6, wherein the record comprises one of a union, a struct, a class, or an object.
11. A computer program product for access control of a field of a record in computer memory of a computing system, the computer memory of the computing system comprising a plurality of disparate memory types, the computer program product disposed upon a non-transitory, computer readable medium, the computer program product comprising computer program instructions that, when executed, cause a computer to carry out the steps of:
defining, by an application, a record, the record comprising one or more fields, the one or more fields including a restricted field having a specification of restricted accessibility when the restricted field is allocated in a particular memory type;
allocating, by the application, an instance of the record in memory of the particular memory type; and
while the record is allocated in the particular memory type, denying, by the application, each attempted access of the restricted field.
12. The computer program product of claim 11, wherein allocating an instance of the record in memory of the particular memory type further comprises executing, for each field of the record, a function call to allocate the field in memory, the function call to allocate the restricted field comprising a memory type-specific function call.
13. The computer program product of claim 11, wherein the computer memory comprises one or more modules of persistent non-volatile, addressable memory and one or more modules of volatile random access memory (\u2018RAM\u2019).
14. The computer program product of claim 11, wherein the persistent non-volatile, addressable memory comprises Phase Change Memory (\u2018PCM\u2019).
15. The computer program product of claim 11, wherein the record comprises one of a union, a struct, a class, or an object.
16. The computer program product of claim 11 wherein the computer readable medium comprises a storage medium.
17. A method of compiling source code configured for access control of a field of a record in computer memory, the computer memory comprising a plurality of disparate memory types, the method comprising:
during compilation of the source code into an executable application:
determining, for each access of a field of a record, whether the field was defined as having a specification of restricted accessibility when the field is allocated in a particular memory type;
if the field was defined as having a specification of restricted accessibility when the field is allocated in the particular memory type:
generating, when all allocations in the source code of the field comprise allocations in the restricted memory type, an error indicating one or more attempted accesses of a restricted field; and
generating, when at least one but less than every allocation in the source code of the field comprises an allocation in the restricted memory type, computer program instructions of the executable application that execute upon each attempted access of the field and carry out the steps of: determining whether the field is currently allocated in the particular memory type and denying access to the field if the field is currently allocated in the particular memory type.
18. The method of claim 17, wherein the computer memory comprises one or more modules of persistent non-volatile, addressable memory and one or more modules of volatile random access memory (\u2018RAM\u2019).
19. The method of claim 17, wherein a source code allocation of a field in the particular memory type comprises a memory type-specific function call to allocate the field in the particular memory type.

The claims below are in addition to those above.
All refrences to claim(s) which appear below refer to the numbering after this setence.

1-14. (canceled)
15. A device to change a belt in a machine assembly, comprising:
a gripper with two flat legs;
said legs being held at one end and are free at the other ends;
said legs being provided with a respective protective film on side surfaces facing towards one another to protect the belt;
a first of the two legs facing towards the machine assembly in an exchange of the belt having a sliding film on its outer surface; and
said legs being designed such that they exert a gripping force over a width of the belt after sliding onto said belt and grip the belt so that the belt can be slid onto or removed from rollers of at least one of the roller types selected from the group consisting of a drive roller and a deflection roller provided in the machine assembly.
16. The device according to claim 15, wherein:
said first of the two legs of the gripper having a metal part; and
at least one magnet is arranged on a second of the two legs, said magnet exerting an attraction force on the first leg.
17. The device according to claim 15 in which the gripper has at one end a handle in which the legs are clamped.
18. The device according to claim 15 in which sliding films are arranged on the inner side of the belt at least at regions that are slid onto the rollers.
19. The device according to claim 15 in which sliding films are arranged around the rollers.
20. The device according to claim 15 in which an adjustment device is provided via which the belt is moved into its desired position upon feeding the belt into the machine assembly.
21. The device according to claim 15 in which said machine assembly comprises an electrographic printing or copying apparatus.
22. The device according to claim 21 wherein said belt comprises a plastic belt for at least one of image development, image transfer, or to transport toner in said electrographic printing or copying apparatus.
23. A method for changing a belt in a machine assembly, comprising the steps of:
providing a gripper with two flat legs held at one end and free at the other ends, the legs having a respective protective film on side surfaces facing towards one another, a first of the two legs facing towards the machine assembly having a sliding film on its outer surface, and the legs being designed such that they exert a gripping force over a width of the belt after sliding onto the belt and gripping the belt;
gripping the belt between the legs of the gripper;
sliding the belt onto rollers of at least one of the roller types selected from the group consisting of a drive roller and a deflection roller arranged at the machine assembly; and
de-tensioning the gripper so that the legs of the gripper release the belt, then withdrawing the gripper from the machine assembly.
24. The method according to claim 23 wherein the belt is tensioned after the insertion via a tensioning roller actuated by a clamping lever.
25. The method according to claim 23 wherein sliding films are placed around the rollers before the insertion of the belt in order to improve the sliding of the belt on the rollers.
26. The method according to claim 25 wherein the sliding films are removed again after the insertion of the belt.
27. The method according to claim 26 wherein before the sliding films are removed, the belt is moved in a feed direction until the sliding films are uncovered.
28. The method according to claim 25 wherein:
tubes are placed into recesses in the machine assembly;
the belt is grasped with the gripper and is slid by the gripper from the tubes onto the rollers;
the belt is moved by the gripper in a feed direction until the sliding films are uncovered;
the gripper and the sliding films are drawn from the machine assembly; and
the belt is tensioned.
29. The method according to claim 28 wherein the belt feed is activated in order to bring the belt into the desired position in the machine assembly.
30. The method according to claim 28 in which said machine assembly comprises an electrographic printing or copying apparatus.
31. The device according to claim 30 wherein said belt comprises a plastic belt for at least one of image development, image transfer, or to transport toner in said electrographic printing or copying apparatus.
32. A method to remove a belt arranged in a machine assembly, comprising the steps of:
providing a gripper with two flat legs held at one end and free at the other ends, the legs having a respective protective film on side surfaces facing towards one another, a first of the two legs facing towards the machine assembly having a sliding film on its outer surface, and the legs being designed such that they exert a gripping force over a width of the belt after sliding onto the belt and gripping the belt;
sliding additional sliding films under the belt after de-tensioning the belt;
sliding the gripper onto the belt;
moving the belt by the gripper in a feed direction of the belt until the additional sliding films loop around the rollers;
placing tubes into recesses in the machine assembly; and
withdrawing the belt and the sliding films from the machine assembly with the gripper by use of the tubes.