Application of the invoke facility service to restrict invocation of compound wireless mobile communication services: division 3—invocation test path efficiency
First Claim
Patent Images
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 and 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 Boolean expression 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;
such that “
And Then”
is a conjunctive connective, meaning it is 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 are examined for their truth value by tracing a path within an event test path tree, with improved efficiency for processing event test paths by the utilization of an algorithm that reduces the quantity of tested events and correctly determines 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, concatenated with the event tree algorithm, form an algorithm possessing 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 the sum of products expression and thereby 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 current switching function, where the current switching function at the beginning of the algorithm is the original minimized product of sums switching function;
e) order the event variables positions in each sum according to 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 entire current 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;
j) if no nodes exist, create the root node;
k) consider the node without an event assignment and assign the left most event of the first sum, contained in the ordering formed by step h), to the tree node;
l) associate the current switching function with the newly formed event node, and assign this event node to be at a level equal to the number of branches subtended to reach this event node from the root node, where the first assigned level is “
0” and
original minimized switching function is the associated current switching function with the root node;
m) subtend a “
1”
(“
True”
) branch from the preceding left most event node of step k) to a newly created node and substitute the “
1”
(“
True”
) value for the prior event node'"'"'s appearances in its associated switching function, where the substitutions of “
1”
(“
True”
) will form a modified switching function to become the newly created node'"'"'s associated switching function;
n) if the modified switching function is not a tautology, meaning that the value of the modified switching function has not become “
1”
(“
True”
), associate the modified switching function to the newly created node at the branch'"'"'s end, assign the modified switching function as the current switching function, and the return to step d) to assign an event to the newly created node;
o) otherwise, since the value has become “
1”
(“
True”
), this path is to terminate with a “
1”
(“
True”
) leaf of the tree and return to the previous event node;
p) subtend a “
0”
(“
False”
) branch from the event node being considered and create a new node at the end of this branch, then substitute the “
0”
(“
False”
) value for the event appearing in the switching function associated with the prior event node, where the substitutions of “
0”
(“
False”
) will form a modified switching function current switching function to become the newly created node'"'"'s associated switching function;
q) if the modified switching function is not a contradiction, meaning that the value of the modified switching function has not become “
0”
(“
False”
), associate the modified switching function to the new event node, assign the modified switching function as the current switching function, and return to step d) to assign an event to the new node;
r) otherwise, since value has become “
0”
(“
False”
), this path is to terminate with a “
0”
(“
False”
) leaf of the tree;
s) traverse “
0”
branches to lower levels, meaning toward the root node, repeatedly;
t) if a “
1”
(“
True”
), branch is reached, traverse the branch to its source event node, note the level, assign its associated switching function as the current switching function, and return to step p);
u) otherwise, the tree is complete; and
afterwards used by the Smartphone'"'"'s Invoke facility service to evaluate Boolean expressions by tracing paths, within the logical computation tree, according to the truth values of the events, in order to conclude whether the associated app is to be invoked;
wherein the following event types or their contradictions are recognized by a Smartphone;
A) visual events such asa) 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;
B) status events asa) heart pacer malfunction occurred,b) blood monitor sensed excessive glucose level,c) insulin pump level below threshold,d) epileptic seizure sensed,e) stroke precursor symptom(s) observed,f) heart rate is dangerous,g) temperature level above threshold,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) heating system malfunctioned,p) home alarm system is triggered,q) breathing support system operating unsatisfactorily,r) password protection is violated,s) credit card charge beyond maximum,t) bank transfer beyond maximum,u) check cashed beyond maximum,v) sale made, w) purchase made;
C) audio events such asa) a vehicle engine running,b) glass being broken,c) an automobile crash,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,m) an alarm siren,n) a gunshot,o) footsteps,p) a turning door knob,q) a door closing.
0 Assignments
0 Petitions
Accused Products
Abstract
This invention provides the processes to efficiently evaluate a Boolean expression of events used to determine if a Smartphone app is to be invoked. Its basis is to establish, for each app, a minimal inverted tree that terminates with leaves that indicate the Boolean expression evaluation of “True” or “False”, where a “True” value indicates the associated app is to be invoked or a “False” indicates the associated app is not to be invoked. The process for minimizing the inverted tree is part of this invention. A metric to measure the efficacy of any inverted tree is also included.
-
Citations
6 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 and 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 Boolean expression 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;
such that “
And Then”
is a conjunctive connective, meaning it is 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 are examined for their truth value by tracing a path within an event test path tree, with improved efficiency for processing event test paths by the utilization of an algorithm that reduces the quantity of tested events and correctly determines 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, concatenated with the event tree algorithm, form an algorithm possessing 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 the sum of products expression and thereby 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 current switching function, where the current switching function at the beginning of the algorithm is the original minimized product of sums switching function; e) order the event variables positions in each sum according to 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 entire current 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;j) if no nodes exist, create the root node; k) consider the node without an event assignment and assign the left most event of the first sum, contained in the ordering formed by step h), to the tree node; l) associate the current switching function with the newly formed event node, and assign this event node to be at a level equal to the number of branches subtended to reach this event node from the root node, where the first assigned level is “
0” and
original minimized switching function is the associated current switching function with the root node;m) subtend a “
1”
(“
True”
) branch from the preceding left most event node of step k) to a newly created node and substitute the “
1”
(“
True”
) value for the prior event node'"'"'s appearances in its associated switching function, where the substitutions of “
1”
(“
True”
) will form a modified switching function to become the newly created node'"'"'s associated switching function;n) if the modified switching function is not a tautology, meaning that the value of the modified switching function has not become “
1”
(“
True”
), associate the modified switching function to the newly created node at the branch'"'"'s end, assign the modified switching function as the current switching function, and the return to step d) to assign an event to the newly created node;o) otherwise, since the value has become “
1”
(“
True”
), this path is to terminate with a “
1”
(“
True”
) leaf of the tree and return to the previous event node;p) subtend a “
0”
(“
False”
) branch from the event node being considered and create a new node at the end of this branch, then substitute the “
0”
(“
False”
) value for the event appearing in the switching function associated with the prior event node, where the substitutions of “
0”
(“
False”
) will form a modified switching function current switching function to become the newly created node'"'"'s associated switching function;q) if the modified switching function is not a contradiction, meaning that the value of the modified switching function has not become “
0”
(“
False”
), associate the modified switching function to the new event node, assign the modified switching function as the current switching function, and return to step d) to assign an event to the new node;
r) otherwise, since value has become “
0”
(“
False”
), this path is to terminate with a “
0”
(“
False”
) leaf of the tree;
s) traverse “
0”
branches to lower levels, meaning toward the root node, repeatedly;t) if a “
1”
(“
True”
), branch is reached, traverse the branch to its source event node, note the level, assign its associated switching function as the current switching function, and return to step p);u) otherwise, the tree is complete; and afterwards used by the Smartphone'"'"'s Invoke facility service to evaluate Boolean expressions by tracing paths, within the logical computation tree, according to the truth values of the events, in order to conclude whether the associated app is to be invoked;
wherein the following event types or their contradictions are recognized by a Smartphone;A) visual 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; B) status events as a) heart pacer malfunction occurred, b) blood monitor sensed excessive glucose level, c) insulin pump level below threshold, d) epileptic seizure sensed, e) stroke precursor symptom(s) observed, f) heart rate is dangerous, g) temperature level above threshold, 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) heating system malfunctioned, p) home alarm system is triggered, q) breathing support system operating unsatisfactorily, r) password protection is violated, s) credit card charge beyond maximum, t) bank transfer beyond maximum, u) check cashed beyond maximum, v) sale made, w) purchase made; C) audio events such as a) a vehicle engine running, b) glass being broken, c) an automobile crash, 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, m) an alarm siren, n) a gunshot, o) footsteps, p) a turning door knob, q) a door closing. - View Dependent Claims (2, 3, 4, 5, 6)
- True”
Specification
-
- Resources
Litigation Campaign Assessment
Thank you for your request. You will receive a custom alert email when the Litigation Campaign Assessment is available.
×
-
Current AssigneeThaddeus John Kobylarz
-
Original AssigneeThaddeus John Kobylarz
-
InventorsKobylarz, Thaddeus John
-
Primary Examiner(s)Agosta, Steve D
-
Application NumberUS13/998,469Publication NumberTime in Patent Office673 DaysField of Search455/414.1, 455418-420, 455/466, 455/550.1, 455/566, 455/556.2, 379/93.23, 379/93.24, 705/39US Class Current1/1CPC Class CodesH04M 1/72463 to restrict the functionali...H04W 4/00 Services specially adapted ...H04W 4/027 using movement velocity, ac...H04W 4/50 Service provisioning or rec...H04W 8/245 from a network towards a te...
