Application of the invoke facility service to restrict invocation of compound wireless mobile communication services: division 3 - Invocation test path efficiency

• US 20150126165A1
• 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,329 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 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.

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, and examined for their truth value by means of an 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 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 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.

2. The extension, of the claim 1 test path efficiency algorithm, whereby an 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;

wherein the event test path tree algorithm and its extension contain the steps;

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.

3. The method of claim 2, 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.

4. The alternate extension, of the claim 1 test path efficiency algorithm, wherein the algorithmic extension 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.

5. The method of claim 2, 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;