US2017132263A1PendingUtilityA1

Space-time-node engine signal structure

Assignee: SPACE TIME INSIGHT INCPriority: May 3, 2011Filed: Oct 28, 2016Published: May 11, 2017
Est. expiryMay 3, 2031(~4.8 yrs left)· nominal 20-yr term from priority
Inventors:Krishna Kumar
G06F 17/30327G06F 2212/702G06F 17/30333G06F 17/30569G06F 12/0276H04L 41/145G06F 3/0638G06Q 10/06G06F 16/2246G06F 16/2264G06F 16/258G06F 3/0671Y02P90/80G06F 3/0604
49
PatentIndex Score
0
Cited by
0
References
0
Claims

Abstract

Example methods, apparatuses, or articles of manufacture are disclosed that may be implemented using one or more computing devices or platforms to facilitate or otherwise support one or more processes or operations associated with a space-time-node engine signal structure.

Claims

exact text as granted — not AI-modified
1 . A method comprising:
 processing one or more digital signals in a spatial-temporal-nodal format; and   organizing said processed one or more digital signals based, at least in part, on said format.   
     
     
         2 . The method of  claim 1 , wherein said processing said one or more digital signals in said spatial-temporal-nodal format comprises:
 electronically identifying one or more dominant attributes among a number of attributes associated with said one or more digital signals; and   electronically applying a memory sweep operation to said one or more identified dominant attribute.   
     
     
         3 . The method of  claim 2 , wherein said one or more dominant attribute is identified based, at least in part, on an application of a dominance principle. 
     
     
         4 . The method of  claim 3 , wherein said dominance principle is based, at least in part, on determining a degree of cardinality of said number of attributes associated with said one or more digital signals. 
     
     
         5 . The method of  claim 2 , wherein said electronically applying said memory sweep operation comprises applying said operation to one or more clusters of said one or more digital signals in said spatial-temporal-nodal format. 
     
     
         6 . The method of  claim 5 , wherein said one or more clusters comprises at least one cluster generated based, at least in part, on at least one of the following: an R-tree-type indexing; a KD-tree-type indexing; or any combination thereof. 
     
     
         7 . The method of  claim 2 , wherein said memory sweep operation comprises transforming said one or more digital signals in said spatial-temporal-nodal format from an n-dimensional representation into a reduced-dimensional representation. 
     
     
         8 . The method of  claim 7 , wherein said reduced-dimensional representation comprises a two-dimensional representation. 
     
     
         9 . The method of  claim 7 , wherein said transforming is based, at least in part, on an application of a dominant metric weighting factor. 
     
     
         10 . The method of  claim 7 , and further comprising applying one or more linearization operations to said transformed one or more digital signals. 
     
     
         11 . The method of  claim 10 , wherein said one or more linearization operations are based, at least in part, on one or more distance calculations with respect to said transformed one or more digital signals. 
     
     
         12 . The method of  claim 2 , wherein said memory sweep operation comprises transforming said one or more digital signals in said spatial-temporal-nodal format from a reduced-dimensional representation into a two-dimensional representation. 
     
     
         13 . The method of  claim 2 , wherein said memory sweep operation comprises transforming said one or more digital signals in said spatial-temporal-nodal format from a two-dimensional representation into a one-dimensional representation. 
     
     
         14 . The method of  claim 2 , wherein said applying said memory sweep operation to said one or more identified dominant attributes further comprises electronically generating a transitioning curve to locate said one or more identified dominant attributes. 
     
     
         15 . The method of  claim 14 , wherein said transitioning curve is generated based, at least in part, on electronically specifying an incremental sweep angle and an incremental radius. 
     
     
         16 . The method of  claim 15 , and further comprising electronically specifying a radius to form a resulting circle having a central point corresponding to said one or more dominant attributes located by said transitioning curve. 
     
     
         17 . The method of  claim 16 , and further comprising electronically performing at least one distance calculation with respect to at least one signal located within said formed circle. 
     
     
         18 . The method of  claim 1 , wherein said organizing said processed one or more digital signals comprises arranging said processed signals as a function of mutually relative distance. 
     
     
         19 - 38 . (canceled) 
     
     
         39 . An article comprising:
 a storage medium having instructions stored thereon executable by a special purpose computing platform to:
 process one or more digital signals in a spatial-temporal-nodal format; and 
 organize said processed one or more digital signals based, at least in part, on said format. 
   
     
     
         40 - 48 . (canceled) 
     
     
         49 . An apparatus comprising:
 a computing platform having a capability to:
 acquire one or more sampled signals comprising digital signal vectors having one or more attributes; and 
 format said digital signal vectors based, at least in part, on features of said one or more attributes. 
   
     
     
         50 - 53 . (canceled)

Join the waitlist — get patent alerts

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

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