US2018255106A1PendingUtilityA1

Systems, methods and computer program products for combining pets

Assignee: AGT INT GMBHPriority: Feb 27, 2017Filed: Feb 27, 2018Published: Sep 6, 2018
Est. expiryFeb 27, 2037(~10.6 yrs left)· nominal 20-yr term from priority
G06F 21/60G06F 17/10G06F 16/90348G06F 16/9027H04L 63/205G06F 17/30988G06F 17/30961H04W 12/02H04W 12/03
43
PatentIndex Score
0
Cited by
0
References
0
Claims

Abstract

A system configured to combine plural PETs, the system comprising a user interface operative to provide evaluations of each of plural raw aka known aka input PETs, in accordance with a PET taxonomy comprising a tree defining ordered and unordered dimensions comprising sub-trees along which PETs are classified; and a processor configured to automatically generate an evaluation of at least one composition of at least two of the plural raw PETs.

Claims

exact text as granted — not AI-modified
1 . A system configured to combine plural PETs, the system comprising:
 I. A user interface operative to provide evaluations of each of plural raw aka known aka input PETs, in accordance with a PET taxonomy comprising a tree defining ordered and unordered dimensions comprising sub-trees along which PETs are classified; and   II. A processor configured to automatically generate an evaluation of at least one composition of at least two of the plural raw PETs.   
     
     
         2 . A system according to  claim 1  wherein the taxonomy is formalized using nested sets, thereby to generate a set-based formalized taxonomy in which each PET comprises a set of attributes each represented by a set of possible values and wherein at least one possible value itself comprises a set. 
     
     
         3 . A system according to  claim 1  wherein the taxonomy defines privacy dimensions aka attributes and defines quantifiability of at least one dimension aka capability from among the dimensions where quantifiability comprises assigning one of at least 2 (or even 3 degrees) or levels of strength to a capability. 
     
     
         4 . A system according to  claim 1  wherein the quantifiability of at least one dimension of the taxonomy uses at least one of the N, Q or R sets where R=real numbers, Q=rational numbers, N=natural numbers. 
     
     
         5 . A system according to  claim 1  wherein the quantifiability of at least one dimension of the taxonomy uses a set with a finite number of elements. 
     
     
         6 . A system according to  claim 2  wherein the processor uses an algebra, for composition of the plural PETs, which is defined on the formalized taxonomy. 
     
     
         7 . A system according to  claim 6  wherein the algebra automatically determines which attributes of raw PETs being combined, are preserved in a composition of the raw PETs by using at least one use-case specific constraint, introduced into the algebra thereby to allow for special composition behavior characterizing (or unique to) less than all use-cases. 
     
     
         8 . A system according to  claim 7  wherein the at least one use-case specific constraint comprises a Weakest link constraint W applied to at least one dimension of the taxonomy. 
     
     
         9 . A system according to  claim 7  wherein the Weakest link constraint W is applied to dimension G. 
     
     
         10 . A system according to  claim 9  wherein the Weakest link constraint W for dimension G comprises minimum goal strength composition (∪min). 
     
     
         11 . A system according to  claim 7  wherein the Weakest link constraint W is applied to dimension R. 
     
     
         12 . A system according to  claim 11  wherein the Weakest link constraint W for dimension R comprises maximum reversibility degree composition (∪to). 
     
     
         13 . A system according to  claim 2  wherein the system is also configured to compute a privacy metric, from the formalized taxonomy, which computes strength achieved by all goals (dimension) in the combined PET relative to the maximum achievable goal strength. 
     
     
         14 . A system according to  claim 6  wherein the algebra is a commutative monoid. 
     
     
         15 . A system according to  claim 6  wherein an attribute-value pair based representation is used in an API to exchange data by exporting data structures represented using the attribute-value pair based representation from the system. 
     
     
         16 . A system according to  claim 1  wherein the user interface imports PETs including data structures represented using an attribute-value pair based representation. 
     
     
         17 . A system according to  claim 1  wherein service providers' end-users respective digital privacy is adjusted automatically during service-usage by negotiating PET combination/s and/or configuration policies. 
     
     
         18 . A method configured to combine plural data operators, the method comprising:
 I. Providing evaluations of each of plural raw aka known aka input data operators, in accordance with a data operator taxonomy comprising a tree defining ordered and unordered dimensions comprising sub-trees along which data operators are classified; and   II. Providing a processor configured to automatically generate an evaluation of at least one composition of at least two of the plural raw data operators.   
     
     
         19 . A method according to  claim 18  wherein the data operators comprise PETs. 
     
     
         20 . A system according to  claim 1  wherein the tree also comprises at least one hybrid dimension which is neither purely ordered nor purely unordered and or quantified or not quantified. 
     
     
         21 . A system according to  claim 1  and also comprising a Combination Builder. 
     
     
         22 . A computer program product, comprising a non-transitory tangible computer readable medium having computer readable program code embodied therein, the computer readable program code adapted to be executed to implement a method configured to combine plural data operators, the method comprising:
 I. Providing a user interface operative to provide evaluations of each of plural raw aka known aka input data operators, in accordance with a data operator taxonomy comprising a tree defining ordered and unordered dimensions comprising sub-trees along which data operators are classified; and   II. Providing a processor configured to automatically generate an evaluation of at least one composition of at least two of the plural raw data operators.

Join the waitlist — get patent alerts

Track US2018255106A1 — get alerts on status changes and closely related new filings.

We store only your email — no account needed. See our privacy policy.