Application of the invoke facility service to restrict invocation of compound wireless mobile communication services: Division 1- Formation of restricted spatial boundaries

• US 20150126164A1
• Filed: 11/04/2013
• Published: 05/07/2015
• Est. Priority Date: 02/16/2010
• Status: Active Grant

• Current Assignee: Thaddeus John Kobylarz
• Original Assignee: Thaddeus John Kobylarz
• Inventors: Kobylarz, Thaddeus John
• Granted Patent: US 9,131,328 B2
• Time in Patent Office: Days
• US Class Current: 455/414.1
• CPC Class Codes: H04M 1/72463 to restrict the functionality of the device
• CPC Class Codes: H04W 4/00 Services specially adapted for wireless communication networks; Facilities therefor
• CPC Class Codes: H04W 4/027 using movement velocity, acceleration information
• CPC Class Codes: H04W 4/50 Service provisioning or reconfiguring
• CPC Class Codes: H04W 8/245 from a network towards a terminal

Abstract

This invention provides a mechanism for invocation of wireless mobile terminal (Smartphone) apps according to spatial events. The spatial events relate to either entering or being within or exiting or being outside of a physical space. For planes, the spatial boundary may be a circle or the perimeter of an arbitrary polygon. For a three dimensional space, the spatial boundary may be a spherical surface or the surface of an arbitrary polyhedron. Spatial parameters, that identify a boundary, are provided by a Smartphone app builder to an interactive compiler for defining a spatial region. The algorithms for doing so are provided herein. The name of the spatial configuration is afterwards inserted within an Invoke facility service'"'"'s Boolean expression by the builder of an Invoke facility service. The builder defines which manner of spatial event activity is to be utilized within the Boolean expression.

Claims

1. A process, residing in the memory of a Smartphone or cellular phone, that is used to invoke a compound wireless mobile communication service also known as a Smartphone app or its diminutive app, by using a Boolean expression of events, which when a combination of events that either occur or events that do not occur result in a “

True”

evaluation of the Boolean expression, the aforementioned compound wireless mobile communication service will commence its execution, where the Boolean expression is contained within a service termed Invoke facility service;

such that the builder of an Invoke facility service associated the said Invoke facility service with the aforementioned compound wireless mobile communication service;

wherein the contained Boolean expression is built with events interconnected by the logical connectives of “

And”

, “

Or”

, “

Not”

, “

If X, Then Y”

, “

And Then”

;

such that the negation operation “

Not”

establishes a contradictory event, signifying that an event and its contradictory event are both considered to be events, where if the event did not occur (is “

False”

), then its contradictory event did occur (is “

True”

) and conversely; and

such that “

And Then”

is a conjunctive connective, meaning it has the same logical operation as “

And”

;

whereas, “

And Then”

includes a sequential implication for testing the occurrence of events;

as illustrated in the partial Boolean expression “

PrecedingExpression And Then FollowingExpression”

, for which “

PrecedingExpression” and

“

FollowingExpression”

are both logic expressions each containing one or more events, wherein the events within “

PrecedingExpression”

are tested for occurrences prior to testing occurrences of the events within “

FollowingExpression”

;

where both logic expressions contain events or their contradictory events that are observable when tested by the wireless mobile terminal;

such that events observed by or linked to the Smartphone or cellular telephone, wherein a category of events or their contradictions result from the spatial position of a wireless mobile terminal with respect to a range of planar space;

which can be of a circular shape or in the shape of an arbitrary polygonal, where a circular plane is identified by a center with a specified radius and where a polygon is defined as a closed figure in a plane, identified by set of geographic points in that plane;

with each point being a pair (x, y) connected to exactly two edges, with as many edges as points, where no edges intersect, and the edges enclose an area by means of an edge subtended from the final point to the first point;

with an event occurrence of either the wireless mobile terminal being moved outside the polygon'"'"'s boundary or being moved inside the polygon'"'"'s boundary.

2. The process of claim 1, wherein the algorithmic method refinement, termed the “

polygon construction algorithm”

, deploys an n-tuple of successive points, of the form ((x₁, y₁), (x₂, y₂), (x₃, y₃), . . . , (x_n, y_n)), that the Compound Wireless Services interactive graphical compiler will regard to represent the boundary of the polygon;

such that the subscripts of the pairs are indicative of the sequence of the presented points and imply the edges of the polygon between successive points, having the steps;

a) for i=1, . . . , n−

1, identify point (x_i, y_i);

b) for i=1, . . . , n−

1 compute and connect a straight line, of the form Y=mX+b, between the point (x_i, y_i) and the point (x_i+1, y_i+1);

c) compute and connect a straight line, of the form Y=mX+b, between point (x_n, y_n) and (x₁, y₁).

3. The enhancement, of the claim 2 polygon algorithm method, to avoid intersections of straight line segments used to bound the planar polygon by incorporating the following “

intersection avoidance algorithm”

which consists of determining the straight line equation between two points of a plane and then ascertaining if the equations of two straight lines, each between a pair of points in the same plane, intersect within their segment'"'"'s end points;

being determined by the Compound Wireless Service interactive compiler'"'"'s performance of the following steps;

step 1—

for i=1, . . . , n−

1 (iterating after step 3 or step

     6), use the points (x_i, y_i) and (x_i+1, y_i+1) to select a straight line equation Y₁=m_ix+b_i, where m_i=(y_i+1−

y_i)/(x_i+1−

x_i) and b_i=(x_i+1y_i−

x_iy_i+1)/(x_i+1−

x_i);

step 2—

for k=i+1, . . . , n (iterating after step 3 or step

     6), use the points (X_k, y_k) and (x_k, y_k) to select a straight line equation y_k=m_k x+b_k

where m_k=(y_k+1−

y_k)/(x_k+1−

x_k) and b_k=(x_k+1y_k−

x_ky_k+1)/(x_k+1−

x_k);

step 3—

if m_i=m_k, increment “

i”

by one and return to step 1 (the lines are parallel and do not intersect);

step 4—

otherwise, compute the potential intersection point for the straight lines of Y_i and Y_k from x_m=(b_k−

b_i)/(m_i−

m_k) and y=(b_k m_i−

b_im_k)/(m_i−

m_k);

step 5—

if the point (x_m, y_m) is simultaneously between the pair of points ((x_i, y_i), (x_i+1, y_j+1)) and between the pair of points ((x_k, y_k), (x_k+1, y_k+1)), then warn the Invoke facility service builder that the straight line segment data corresponding to Y_i and Y_k intersect at other than end points, then permit the Invoke facility service builder to revise entries and go to step 7;

step 6—

if the point (x_m, y_m) is not simultaneously between the pair of points ((x_i, y_i), (x_i+1, y_i+1)) and between the pair of points ((x_k, y_k), (x_k+1, y_k+1)), then increment “

i”

by one and return to step 1 (the lines do not intersect).

step 7—

re-start the polygon construction algorithm, if the Invoke facility service builder elected to revise entries or otherwise stop the polygon generation.

4. Further improvements of the polygon algorithm method of claim 2 that include the presentation on a planar surface of a monitor screen that portrays an image of a map, with the Invoke facility service builder using a curser to select the points of the polygon and thereby relieve the burden of listing the coordinate values for (x, y);

or using an apparatus with GPS communication and a memory to record a GPS position by depressing a button on the apparatus to store the apparatus'"'"' GPS position and thereby relieve the burden of listing the coordinate values for (x, y);

whereby the Compound Wireless Services interactive graphical compiler forms a closed set of straight line boundaries, identified by the (x, y) pairs, from the computer monitor'"'"'s polygon portrayal or the GPS communication apparatus'"'"' GPS position data and then translates the boundaries into a polygon that is geographically congruent to polygon consisting of GPS coordinates.

5. The process of claim 1, wherein further improvements of events from the planar position of a wireless mobile terminal include the planar tolerance embodiment of +Δ

A for area values, as yielded by the Compound Wireless Service interactive graphical compiler to the Compound Wireless Service app builder;

such that an indeterminate area region of A−

Δ

A<

A₁<

A+Δ

A represent two areas congruent to the said range A of planar space, where A−

Δ

A represents the inner area and A+Δ

A represents the outer area, to avail the possibility of providing a warning notification to a user when an area measurement is within its indeterminate area region, during the execution of the Invoke facility service.

6. The extension of the claim 1 process, wherein events result from spatial position of a wireless mobile terminal with respect to a volume;

which can be of a spherical shape or in the shape of an arbitrary polyhedron, where a spherical volume is identified by a center with a specified radius and where a polyhedron is a closed volume in space;

such that the polyhedron base is a planar polygon and a point in the third dimension exists above or below the plane of the base planar polygon, having a specified height or depth;

whereby straight lines, extending from each corner point of the base polygon to the third dimension point, are paired at the base polygon adjacent corner points to define triangular planar boundaries for the volume, with the planes all converging at the third dimension point;

with an event occurrence of either the wireless mobile terminal being moved outside the volume'"'"'s boundary or being inside the volume'"'"'s boundary.

7. The process extension of claim 6, wherein a further enhancement constructs a frustum of the polyhedron configuration, created by identifying two points in the third dimension, both of which are aligned above or below the plane of the base planar polygon;

whereby straight lines, extending from each corner point of the base polygon to the more distant third dimension point, are paired at the base polygon adjacent corner points to define triangular planes, with the planes all converging at the more distant third dimension point;

where the third dimension point, closer the base polygon, is the frustum point which identifies the location of plane, to be placed parallel to the base polygon, to form a parallel polygon boundary, with corner points formed by the lines subtended from the base polygon points to the convergent third dimension point, resulting in a polyhedron bounded by a polygon base, a polygon parallel the polygon base, and the portions of the triangular planes in the form of quadrilaterals that interconnect the base polygon to the parallel polygon;

with an event occurrence of either the wireless mobile terminal being outside the volume'"'"'s boundary or the contradiction of not being outside the volume'"'"'s boundary.

8. The enhancement of claim 7, wherein further improvements are achieved by locating the more distant third dimension point at infinity and thereby establishing all of the lines from the base polygon corner points to be at right angles to the base polygon'"'"'s plane;

which, for a finite located frustum point, results in a polygon at the frustum point that is identical to the base polygon and with rectangular planes interconnecting the base polygon to the parallel polygon;

resulting in a polyhedron bounded by the base polygon, the parallel polygon, and the rectangular planes that interconnect the base polygon to the parallel polygon;

with an event occurrence of either the wireless mobile terminal being outside the volume'"'"'s boundary or the contradiction of not being outside the volume'"'"'s boundary.

9. The process extension of claim 6, wherein further improvements include the spatial tolerance embodiments of Δ

V for volume values, as yielded by the Compound Wireless Service interactive graphical compiler, when known, to the Compound Wireless Service app builder, such that an indeterminate volume region of V−

Δ

V<

V_I<

V+Δ

V is identified that represent two volumes congruent to the said range of volume space V, where V−

Δ

V is the inner volume and V+Δ

V is the outer volume, to avail the possibility of providing a warning notification to a user when a volume measurement is within its indeterminate volume region, during the execution of the Invoke facility service.

10. The process extension of claim 6, wherein the algorithmic method refinement, termed the “

polyhedron construction algorithm”

, utilizes a polygon in prescribing a volume by deploying an n-tuple of successive points, ((x₁, y₁), (x₂, y₂), (x₃, y₃), . . . , (x_n, y_n), (x_c, y_c, z_c, z_f)), that the Compound Wireless Services interactive graphical compiler will regard to represent the points for a polyhedron;

consisting of a polygon base, for which the height is zero (i.e., z_i=0) and are oriented according to their entry sequence of the presented points;

for which the quadruple (x_c, y_c, z_c, z_f) provides x, y, z coordinates for the third dimension edge convergence point (z_c) and the third dimension frustum plane point (z_f);

for which z_c=z_f is assigned, when the volume is not to be a polyhedron frustum;

where also positive values for z_c, z_f indicate the points are above the polygon plane or negative values for z_c, z_f indicate the points are below the polygon plane;

requiring that z_c, z_f have the same sign;

where the polyhedron construction algorithm performs the following steps;

a) define a polygon by the n-tuple ((x₁, y₁), (x₂, y₂), (x₃, y₃), . . . , (x_n, y_n));

b) locate the reflection of the convergence point in the polygon'"'"'s plane (x_c, y_c);

c) locate the third dimension convergence point (x_c, y_y, z_c) according to its reflection position;

d) subtend the “

n”

straight lines between each point of the polygon base and the convergence point;

e) if z_c=z_f, then stop here;

f) otherwise, provide the third dimension frustum point (x_c, y_c, z_f);

g) pass a plane parallel to the base polygon through the frustum point (x_c, y_c, z_f);

h) establish the “

n”

frustum plane points from the “

n”

intersecting lines subtended between the points of the base polygon and the third dimension edge convergence point (z_c) to a distance of z_f from the base plane.

11. The polyhedron algorithmic method of claim 10, wherein further improvements include the polyhedron algorithm'"'"'s representation on a planar surface of a computer'"'"'s monitor screen, that portrays an image of a map, to establish the planar polygon base of the polyhedron by having the Invoke facility service builder use a curser to select the points of the polygon, and providing the third dimension convergence point and the third dimension frustum point by specifying values in a suitable metric;

or establishing the polygon base by means of an apparatus with GPS communication and a memory to record a GPS position by depressing a button on the apparatus to store the apparatus'"'"' GPS position, and providing the third dimension convergence point and the third dimension frustum point by specifying values in a suitable metric;

whereby the Compound Wireless Services interactive graphical compiler forms a closed set of planes having straight line boundaries, that is geographically congruent to the volume consisting of GPS coordinates, including the specified third dimension convergence point and the third dimension frustum point.