Application of the invoke facility service to restrict invocation of compound wireless mobile communication services

• US 20120220276A1
• Filed: 04/13/2012
• Published: 08/30/2012
• 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 8,577,344 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

The principal purpose of this invention is to provide the mechanism for enhancing the safe use of a wireless mobile terminal (smartphone) in a moving vehicle. The Invoke facility service'"'"'s Boolean expression controls the conditions for which a smartphone app will be invoked into execution. Hence, smartphone apps, which create dangerous circumstances when executed in a moving vehicle, can be prevented from invocation. The total elimination of smartphone use in a moving vehicle is inadvisable. For example, an app that deploys an accelerometer to sense the impact of a vehicle'"'"'s serious collision and thereby calls “911” to transmit a recorded message that includes the vehicle'"'"'s GPS location should be allowed to execute when a vehicle is moving. This invention allows an app builder to select suitable invocation conditions for an app.

Significant and pertinent to the invention is the manner in which the Boolean logic operation “Not” is used. Whereas conventional apps are invoked by a positive assertion of an event; the use of the operation “Not” avails negative event assertions in the Boolean expression of an Invoke facility service. That is, the contradiction of an event is also an event; meaning that if an event is false, its contradictory event is true. Another important Boolean logic aspect of this invention is the conjunctive operation of “and then”. The “And Then” operation possesses the same functionality as the conjunctive operation of “And”, but “And Then” also possesses a sequential implication for determining the occurrence of events. The sequential implication provides an efficient means to evaluate the Boolean expressions of the Invoke facility service.

Claims

1. A method to invoke or initiate the execution of a compound wireless mobile communication service, also known as an app or smartphone application or wireless mobile terminal application, by using a Boolean expression of events, which when a combination of events occur or do not occur result in a “

True”

evaluation of the Boolean expression, the associated 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 Invoke facility service was built as the first Component Service of the said compound wireless mobile communication service;

having the Boolean expression 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, meaning that an event and its contradictory event are both 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 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.

2. The method of claim 1, wherein further improvements include the use of an Invoke facility service with any Android, iOS, webOS, Blackberry OS, or Windows Phone smartphone app by making the smartphone app a Fundamental Wireless Service in the repertoire of Component Services;

such that a common platform is deployed, in a computer language as C, C++, Java, HTML, for the smartphone app and the Invoke facility service; and

then concatenating the Invoke facility service for execution prior to the smartphone app in the built compound wireless mobile communication service.

3. The method of claim 1, wherein further improvements include the Invoke facility service as a Component Service of a compound wireless mobile communication service, such that it can appear anywhere and in multiple times of a compound wireless mobile communication service and thereby also control the internal execution of Component Services within a compound wireless mobile communication service.

4. The method of claim 1, wherein further improvements include having a events initially assigned a flag of “

Untested”

;

meaning that no knowledge exists as to whether the event has or has not occurred and a test needs to be made in order to provide a “

True”

value, meaning the event has occurred, or a “

False”

value, meaning the event has not occurred, and having the event values reset to “

Untested”

after a compound wireless mobile communication service builder prescribed time interval has elapsed following an event test and only reset when the evaluation of the Boolean expression is taking place to ascertain invocation.

5. The method of claim 4, wherein further improvements include a testing repetition rate, prescribed by the compound wireless mobile communication service builder, for observing whether events have occurred for those events designated as “

Sustained”

, meaning the event occurrence must persist from the time first observed and then for each repeated observation for a “

True”

value, which continues beyond invocation of the Compound Wireless Service app and onto the entire execution of the Compound Wireless Service app, but ends when the Compound Wireless Service app execution ends;

whereas events designated as “

Momentary”

, meaning the event occurrence only needs to be observed once for a “

True”

value, retain their values beyond invocation of the Compound Wireless Service app and onto the entire execution of the Compound Wireless Service app without repeated tests, wherein the “

Sustained”

event parameters and the “

Momentary”

event parameters are accessible throughout the entire execution of a Compound Wireless Service app.

6. The method of claim 1, wherein the Boolean expression is evaluated according to schema provided by:

a) an inverted binary tree, termed event test path tree, having its root node at the top and said to be in level 0;

b) each node, including the root node, of the tree represents an event of the Boolean expression;

c) two branches subtend from an event node, wherein one branch represents a “

True”

value for its event from which the branch is subtended and the other branch represents a “

False”

value for its event from which the branch is subtended;

d) each branch is directed to the next event node of the Boolean expression to be considered and increases the subsequent event level by 1;

e) a sequence of nodes and branches, termed an “

event test path”

, is concluded at a leaf where the Boolean expression possesses a value of either “

True”

or “

False”

.

7. The schema of claim 6, whereby its event test path tree is used to guide an Invoke facility service'"'"'s evaluation of its Boolean expression according to the values of the tested events and in the sequence of an event test path;

which originates at the event root node and continues until a leaf representing the Boolean expression value is reached, wherein encountered “

Untested”

events are first tested for occurrence before proceeding farther in the event test path.

13. The method of claim 1, wherein wireless mobile terminal timing event types include:

a) an existing time of day that does not match a time of day stored by the builder in the wireless mobile terminal;

b) an existing day of the week that does not match the day of a week stored by the builder in the wireless mobile terminal;

c) an existing day of the month that does not match a day of the month stored by the builder in the wireless mobile terminal;

d) an existing day of the year that does not match a day of the year stored by the builder in the wireless mobile terminal;

e) a combination of the aforementioned day types that does not match a combination of the aforementioned day types stored by the builder in the wireless mobile terminal.

14. The method of claim 1, wherein a wireless mobile terminal timing event is specified by a range of time, identified by a start time and an end time pair, having a combination of time of a day, days of a week, weeks of a month, months of a year, and years;

such that an event has occurred when the time is either outside the specified range of time or the contradiction of not outside the specified range of time.

15. The method of claim 14, wherein further improvements include the temporal tolerance embodiment of +Δ

T for time values, as yielded, when known, by the Compound Wireless Service interactive graphical compiler to the Compound Wireless Service app builder;

such that an indeterminate temporal region of T−

Δ

T≦

t≦

T+Δ

T is identified;

to avail the possibility of providing a warning notification to a user when a time measurement is within the indeterminate temporal region, during the execution of the Invoke facility service.

16. The method of claim 1, wherein events 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 outside the polygon'"'"'s boundary or the contradiction of not being outside the polygon'"'"'s boundary.

20. The method of claim 16, wherein further improvements include the spatial tolerance embodiment of +Δ

A for area values, as yielded, when known, 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 of the same shape as and straddle the said range 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.

21. The method of claim 1, 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 outside the volume'"'"'s boundary or the contradiction of not being outside the volume'"'"'s boundary.

22. The method of claim 21, wherein further improvements include 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.

23. The method of claim 22, 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.

26. The method of claim 21, 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<

V+Δ

V is identified that represents two volumes of the same shape as and straddle the said range of volume space, 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.

27. The method of claim 1, wherein events that are either sent or received by the wireless mobile terminal include:

a) an audio signal that does not match an audio signal stored by the builder in the wireless mobile terminal;

b) an audio signal'"'"'s address that does not match an address stored by the builder in the wireless mobile terminal;

c) a video signal that does not match a video signal stored by the builder in the wireless mobile terminal;

d) a video signal'"'"'s address that does not match an address stored by the builder within the wireless mobile terminal;

e) a text message that does not match a text message stored by the builder in the wireless mobile terminal;

f) a text message'"'"'s address that does not match an address stored by the builder in the wireless mobile terminal;

g) a photograph that does not match a photograph stored by the builder in the wireless mobile terminal;

h) a photograph'"'"'s address that does not match an address stored by the builder in the wireless mobile terminal;

i) an e-mail'"'"'s subject that does not match a subject stored by the builder within the wireless mobile terminal;

j) an e-mail'"'"'s address that does not match one stored by the builder within the wireless mobile terminal;

k) an Internet address that does not match an Internet address stored by the builder in the wireless mobile terminal;

l) a “

caller ID”

that does not match one stored by the builder within the wireless mobile terminal;

m) an Internet signal with an address that does not match one stored by the builder within the wireless mobile terminal;

n) a wireless service provider signal that does not match one stored by the builder within the wireless mobile terminal;

o) the date of an e-mail that does not match one stored by the builder within the wireless mobile terminal;

p) a transducer signal that does not match a signal value stored by the builder within the wireless mobile terminal.

28. The method of claim 1, wherein events of the following event types and their contradictions included:

A) audio events such as a) a vehicle engine running, b) glass being broken, c) an automobile accident, d) a child crying, e) an explosion, f) the sound of thunder, g) the sound of gushing wind, h) the sound of falling rain, i) the sound of falling hail, j) a person'"'"'s scream, k) a dog barking, l) screeching tires from excessive vehicular braking, m) an alarm siren, n) a gunshot, o) footsteps, p) a turning door knob, q) a door closing;

B) video events such as a) the retina of an eye, b) a door opening, c) a license plate number, d) a fire, e) an explosion, f) a bolt of lightning, g) a bar code, h) a person'"'"'s face, i) an automobile, j) a gun, k) an animal;

C) transducer signal event types such as a) biological sensors that measure heart rate, systolic blood pressure, diastolic blood pressure, red blood cell oxygen level, blood glucose, body temperature, or electroencephalogram brain activity into a binary digital signal representation that is communicated to the wireless mobile terminal;

b) mechanical sensors that convert acceleration force, deceleration force, temperature in a solid, temperature in a liquid, temperature in a gas, pressure upon a solid, pressure upon a liquid, pressure upon a gas, or altitude to a binary digital signal representation that is communicated to the wireless mobile terminal;

c) chemical sensors that convert acidity, specific gravity, temperature of a solution, viscosity of a liquid, or molarity of a chemical solution to a binary digital signal representation that is communicated to the wireless mobile terminal;

d) electrical sensors that convert voltage, current, power, magnetic flux, resistance, reactance, impedance, capacitance, inductance, electrical signal bit rate, or electrical signal frequency to a binary digital signal representation that is communicated to the wireless mobile terminal;

e) any combination of the aforementioned four sensor types and constituent signal;

D) electro-mechanical system communication links that provide status data events as a) heart pacer malfunction occurred, b) blood monitor sensed excessive glucose level, c) insulin pump nearly empty, d) epileptic seizure sensed, e) stroke precursor symptoms observed, f) heart rate is dangerous, g) temperature too high, h) carbon monoxide level dangerous, i) smoke level suggests fire, j) vehicle engine is running, k) vehicle speed is above a set maximum, l) vehicle brake fluid low, m) vehicle engine malfunction warning, n) accelerometer sensed impact, o) malfunctioning heating system at home, p) home alarm system is triggered, q) breathing support system is unsatisfactorily functioning, r) password protection is violated, s) credit card charge beyond maximum, t) bank transfer beyond maximum, u) check cashed beyond maximum, v) sold something, w) bought something.

29. The method of claim 1, wherein vehicular safety measures include:

a) a wireless mobile terminal moving beyond a specified threshold speed, as can be determined via a GPS measurement differential of known time duration or a communication link to the vehicle'"'"'s speedometer;

b) a wireless mobile terminal detected to be in proximity of the vehicle driver'"'"'s seat, as can be determined using a Bluetooth or other radio wave position detection via a high directivity antenna;

c) a voice actuated wireless mobile terminal Compound Wireless Service app that detects the voice of the vehicle driver, as can be determined by means of a high directivity microphone for a stationary wireless mobile terminal or voice recognition of a driver'"'"'s recording issuing the command to actuate the Compound Wireless Service app;

d) a Compound Wireless Service app execution disapproval by an outside source communication denial, as can be performed by a service provider or law enforcement that remotely sets a parameter state to restrict invocation of the Compound Wireless Service app;

e) a wireless mobile terminal is in a restricted area, as can be determined when on a roadway by means of a GPS measurement or by means of a service provider'"'"'s location service;

f) denial of a Compound Wireless Service app when the wireless mobile terminal is in a particular vehicle, as can be determined when the particular vehicle possesses a Bluetooth or other radio wave generator that signals an invocation restriction of one or more Compound Wireless Service apps;

g) denial of a Compound Wireless Service app when the driver'"'"'s seat of a vehicle is occupied and the vehicle'"'"'s engine is running, as can be determined via a pressure transducer that senses weight on the seat and communicates with the wireless mobile terminal to restrict one or more Compound Wireless Service apps.

30. The method of claim 29, wherein further improvements provide for safety enhancing Boolean expressions that include:

a) not being able to send a text message while in a moving vehicle, that may be expressed as {SendTextMessage And Then (Not VehicleIsMoving)};

b) not invoking a voice command by a vehicle'"'"'s driver, unless the vehicle is not moving, that may be expressed as {AppVoiceCommand And Then ((Not Driver Voice) Or (Not VehicleMoving))}

c) not invoking a voice command in a vehicle unless the vehicle'"'"'s engine is not running or the mobile communication terminal is in the vehicle'"'"'s cradle and either the vehicle is not moving or the voice command was not spoken by the driver, that may be expressed as {AppVoiceCommand And Then ((Not EngineRunning) Or (In Cradle And ((Not VehicleMoving) Or (Not Driver Voice))))}

d) not invoking a voice command in a vehicle unless the vehicle'"'"'s engine is not running or the vehicle is not moving or the voice command was not spoken by the driver, that may be expressed as {AppVoiceCommand And Then ((Not EngineRunning) Or (Not VehicleMoving) Or (Not DriverVoice))}

e) not invoking a manufacturer'"'"'s default app in a vehicle unless the vehicle'"'"'s engine is not running or the vehicle is not moving or the driver is not in possession of the smartphone, that may be expressed as {ManufacturerDefault And Then ((Not EngineRunning) Or (Not VehicleMoving) Or (Not DriverHasSmartphone))}

f) not invoking a voice command in a vehicle unless the vehicle'"'"'s engine is not running, that may be expressed as {AppVoiceCommand And Then (Not EngineRunning)}

g) not invoking a manufacturer'"'"'s default app in a vehicle unless the vehicle'"'"'s engine is not running, that may be expressed as {ManufacturerDefault And Then (Not EngineRunning)}

h) not invoking a voice command in a vehicle unless the vehicle is not moving, that may be expressed as {AppVoiceCommand And Then (Not VehicleMoving)}

i) not invoking a manufacturer'"'"'s default app in a vehicle unless the vehicle is not moving, that may be expressed as {ManufacturerDefault And Then (Not VehicleMoving)}

31. The method of claim 1, wherein the Invoke facility service possesses the enhancement parameters:

(OptionalEventDurationList)—

an optional list of triples;

where each triple designates

     1) an event name,

     2) its value of “

Sustained”

or “

Momentary”

,

     3) the testing repetition interval for a “

Sustained”

event or a null entry for a “

Momentary”

event;

(OptionalObservationRepetitionInterval)—

a pair that specifies two time intervals;

     1) the interval between successive evaluations the Boolean expression parameter {OptionalEventExpression} and

     2) the time interval to reset all event test values to an “

Untested”

flag;

(OptionalEventFailureNotification)—

a means to provide a notification when an event test path results in a “

False”

evaluation of a wireless mobile terminal Compound Wireless Service app'"'"'s Invoke facility service Boolean expression;

such that the notification can be visually displayed on the wireless mobile terminal and/or by a recorded audio message;

where the manner of presentation and precise representation are at the discretion of the Compound Wireless Service app builder.

(OptionalEventPathData)—

represents the potential event test paths to evaluate the Compound Wireless Service app'"'"'s Boolean expression;

in the schema of an inverted, binary, directed tree;

consisting of set of triples and a set of pairs, for which the triples define the tree, whose nodes are pointers to the events and two subtended branches represent the “

True”

or “

False”

possibilities for an event node;

such that the end nodes are leaves that point to pairs, for which each pair contains the Boolean expression value (either “

True”

or “

False”

) and a label for the traced event test path leading to a leaf.

(OptionalEventFailureNotificationSchema)—

is a set of pairs, of the form (event test path label, notification) or (event test path label, notification pointer), to provide the failure notification parameter value to be displayed by the (OptionalEventFailureNotification) parameter output;

after acquiring the event test path label from the (OptionalEventNotificationData) parameter, which specifies an event test path label from the traced event test path, to point to the notification part of the pair;

such that the notification or the notification pointer can be provided to the (OptionalEventFailureNotification) parameter, and thereby identify the notification to be displayed by the output (OptionalEventFailureNotification).

8. The algorithm, termed the test path efficiency algorithm, to format a Boolean expression so that it implies an event test path tree with improved efficiency for processing event test paths by reducing the quantity of tested events and correctly determining the event test paths to evaluate a Boolean expression'"'"'s truth value;

such that the algorithm is performed using switching algebra, permitted by a transformation between Boolean logic to and from switching algebra;

wherein the operator symbols of Boolean algebra of “

And Then”

or “

And”

are converted to and from the algebraic notation of“

*”

, named “

product” and

may have its notation omitted without confusion, and “

Or”

is converted to and from the algebraic notation of “

+”

, named “

sum”

;

also including variables transformed between their identifications by words to and from single letters, which may contain subscripts; and

having the operation of “

Not”

transformed to and from an apostrophe following a negated variable;

wherein the binary values “

True” and

“

False”

possess a transformation to and from “

1” and

“

0”

, respectively;

wherein the test path efficiency algorithm possesses the following steps;

a) transform the Boolean expression into a switching function;

b) apply the negation of the switching function to a minimization procedure to obtain a sum of products expression;

c) apply De Morgan'"'"'s theorem to obtain the minimized product of sums form of the switching function, where the second negation operation, achieves the non-negated switching function;

d) count each of the event variables appearances in the switching function;

e) order the event variables positions in each sum according their number of appearances in the switching function, such that the number of appearances of the event variables increases to the left in each sum;

f) order the sums positions in the product of sums function to have the sums containing the fewest event variables to the left;

g) for those sums having the same number of event variables, use the counts of the event variables appearances in the switching function to establish a total count for the event variables appearing in each of these sums;

h) order the sums having the same number of event variables in the switching function according the total counts for the event variables appearing in each sum, such that their count totals increase to the left, when the number of events within a sum are equal;

i) transform the resultant switching function into the Boolean expression of the Invoke facility service, using “

And Then”

between the sums in the product of sums expression.

9. Extension of the test path efficiency algorithm of claim 8, whereby the event test path tree is established from the minimized product of sums function for which the product operation connotes “

And Then”

, signifying that the implied event test path proceeds from left to right for the sums of the function;

also applying the left to right event variable sequence within a sum, and if a sum of event variables is discovered to be “

False”

, an event test path terminates with a “

False”

Boolean expression evaluation;

or if a sum is discovered to be “

True”

, the event test path continues to the next sum to the right, until all sums have been discovered to be “

True”

, which indicates a “

True”

evaluation for the Boolean expression;

with this process of event variables evaluation'"'"'s continuing until all event test paths terminate in a “

False”

or “

True”

leaf;

whereby the following event test path tree algorithm results;

a) perform the test path efficiency algorithm to form the sum of products switching function;

b) make the left most (first) event of the first sum the tree root node, associate the switching function with the root node, and assign this event to be at level 0;

c) subtend a “

True”

(1) branch from the preceding first event and substitute this value for the first event'"'"'s appearances into the associated switching function;

d) operate on the associated switching function, following the substitutions of “

True”

(1), to form a modified (reduced) switching function;

e) if the modified switching function'"'"'s value has become 1 (“

True”

), this path is to terminate with “

True”

leaf of the tree;

f) otherwise, repeat step d) through step h) of the test path efficiency algorithm on the modified switching function and associate the resultant reduced switching function with the node at the end of the “

True”

(1) branch;

g) assign the first event of the first sum, in the associated reduced switching function of step f) above, to the tree node and assign this event to be at one higher numbered level than its connected event node;

h) return to the first event node of step b) above and extend a “

False”

(0) branch from the preceding first event and substitute this value for the first event'"'"'s appearances in the switching function;

i) operate on the switching function, following the substitution “

False”

(0), to form a modified switching function;

j) if the modified switching function'"'"'s value has become 0 (“

False”

), this path is to terminate with “

False”

leaf of the tree;

k) otherwise, perform step d) through step h) of the test path efficiency algorithm on the modified switching function and associate the resultant reduced switching function with the node at the end of the “

False”

(0) branch;

l) assign the first event of the first sum, in the associated reduced switching function of step k) above, to the tree node and assign this event to be one higher numbered level than its connected event node;

m) repeat step c) through step

     1) above for all events at the current level;

n) if all branches have terminated in a leaf, the algorithm is completed;

o) otherwise consider all of the above newly created nodes as roots of sub-trees and repeat step c) through step n) for each sub-tree.

10. The method of claim 9, wherein further improvements include having the first examined event uniquely assigned to a single Compound Wireless Service app;

such that no invocation is to occur, due to a “

False”

evaluation of the Boolean expression, if the first event is “

False”

, and thereby assuring that each wireless mobile terminal Compound Wireless Service app has its own unique invocation means and also avoiding Compound Wireless Service app invocation confusion.

11. Enhancements to the method of claim 9, wherein an equivalent algorithm, that yields a product of sums expression, for which products are examined from right to left and event variable sequences of the sums proceed from right to left in the switching function to determine an efficient event test path tree, by reversing the ordering of the sums and reversing the ordering of the event variables within the sums;

or to deploy another equivalent algorithm that yields a sum of products expression, for which sums are examined from left to right and event variable sequences of the products proceed from left to right in examining the switching function to determine an efficient event test path tree;

or to deploy another equivalent algorithm that yields a sum of products expression, for which sums are examined from right to left and has event variable sequences of the products proceed from right to left in examining the switching function to determine an efficient event test path tree.

12. The method of claim 9, where quantitative measures of its efficacy are provided by the event test path tree efficiency (η

_E), the leaf efficiency of a tree (η

_L), and the total event test path tree efficiency (η

_T), computed by the ensuing equations;

17. The algorithm, termed the polygon algorithm, to deploy an n-tuple of points, of the form ((x₁, y₁), (x₂, y₂), (x₃, y₃), . . . , (x_n, y_n)), that the Compound Wireless Services interactive graphical compiler will regard represents 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) locate point (x₁, y₁);

b) locate point (x₂, y₂);

c) connect a straight line (i.e., edge) boundary between the preceding and succeeding points, where this step is done automatically by the Compound Wireless Services interactive graphical compiler;

d) if the straight line boundary intersects another straight line, provide an error message to choose a different succeeding point, where this step is done automatically by the Compound Wireless Services interactive graphical compiler;

e) repeat step b) through step d) until point (x_n, y_n) is located, for which repetition of step c) and step d) is done automatically by the Compound Wireless Services interactive graphical compiler;

f) connect a straight line boundary between point (x_n, y_n) and (x₁, y₁), where this step is done automatically by the Compound Wireless Services interactive graphical compiler;

g) if the straight line boundary intersects another straight line, provide an error message to choose a different succeeding point, where this step is done automatically by the Compound Wireless Services interactive graphical compiler;

h) if no intersection exists, the polygon is completed.

18. The polygon algorithm of claim 17 that utilizes an algorithm, termed intersection avoidance algorithm, to avoid intersections of straight line segments used to bound the planar polygon;

which consists of the parts a) to determine the straight line equation between two points of a plane and b) to ascertain if the equations of two straight lines, each between a pair of points in the same plane, intersect within their segment'"'"'s end points;

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

a) Use the entered points (x₁, y₁) and (x₂, y₂) to compute the straight line equation for y₁=m₁x+b₁, using the equations m₁=(y₂−

y₁)/(x₂−

x₁) and b₁=(x₂y₁−

x₁y₂)/(x₂−

x₁);

b) If step a) was the first straight line equation computation, then store the straight line segment data for y₁ and return to step a) to await the next entered pair of points;

c) Otherwise, select a previously computed straight line equation, for which no intersection test has been made with respect to the entered y₁ straight line segment data;

d) If no selection of a previously computed straight line equation is possible because all straight lines have been tested with respect to the straight line segment data for y₁, then store the straight line segment data for y₁ and go to step j);

e) Otherwise, temporarily label the selected previously computed straight line equation to be y₂=m₂x+b₂, with the straight line segment end points designated as (x₃, y₃) and (x₄, y₄);

f) If m₁=m₂ go to step c) (the lines are parallel and do not intersect);

g) Otherwise, compute the intersection point for the straight lines of y₁ and y₂ from x_i=(b₂−

b₁)/(m₁−

m₂) and y_i=(b₂m₁−

b₁m₂)/(m₁−

m₂);

h) If the point (x_i, y_i) is between the pair of points ((x₁, y₁), (x₂, y₂)) and between the pair of points ((x₃, y₃), (x₄, y₄)), then warn the Invoke facility service builder that the straight line segment data corresponding to y₁ and y₂ intersect, and permit the Invoke facility service builder to delete entries or abort the polygon generation, and then go to step a) if segment correction selected or, if no segment correction is chosen, stop the polygon generation;

i) Otherwise, store the straight line segment data for y₁ and go to step c);

j) Otherwise, if the pair (x₂, y₂) of the straight line segment data is the initial point entered for the polygon, then end the computations (the polygon is closed);

k) Otherwise, go to step c).

19. The algorithm of claim 17, wherein further improvements include the polygon algorithm'"'"'s deployment on a planar surface of a computer'"'"'s 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.

24. The method of claim 17, wherein further improvements provide an extension to the algorithm, termed the polyhedron algorithm, to prescribe an n-tuple of 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;

a) build the polygon as described by the polygon construction algorithm;

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_c, z_c) according to its reflection position;

d) subtend the “

n”

straight lines between each point of the polygon base and the convergence point, where subtending of the straight lines is done automatically by the interactive graphical compiler;

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), which is done automatically by the interactive graphical compiler;

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, which is done automatically by the interactive graphical compiler.

25. The algorithm of claim 24, wherein further improvements include the polyhedron algorithm'"'"'s deployment 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.