Abstract: The bionic computing system includes a perception subsystem, an attention subsystem, and a temporal-spatial awareness subsystem. The perception subsystem has several perceptual devices for detecting objects from sequences of sensory data and generating an object record for each object. The attention subsystem adjusts the object records by re-identifying the tracking identities across sensory devices, generates several object associations, generate several location associations, and generates several motion implications. The temporal-spatial awareness subsystem organizes and retains the object records in a working memory space.

Abstract: A federated data exploration system includes a first and a second interoperable data exploration apparatuses. The first interoperable data exploration apparatus executes a data process engine and has a first data object. The data process engine enables a display screen to display a visualization user interface, which includes a first and second display areas respectively for the first and second data object. The second data object belongs to the second interoperable data exploration apparatus. The data process engine explores the second data object by issuing a sequence of queries in response to a sequence of operations on the second display area to narrow down a target of interest. The data process engine receives a first set of identifiers corresponding to the target of interest from the second data object and produces a target dataset by querying the first data object according to the first set of identifiers.

Abstract: Data processing apparatus, method, and non-transitory tangible machine-readable medium thereof for recursively structured data are provided. The data processing apparatus accesses a piece of recursively structured data having a Location Independent Structure and arranges the piece of recursively structured data in a one-dimensional memory space according to LIS:=e0?e1? . . . ?ep?1?LIS0?LIS1? . . . ?LISp?1. The notation ei represents an element of the piece of recursively structured data. The notation LISi represents a sub-LIS of the recursively structured data and corresponds to the element ei. The operator ‘?’ indicates “contiguous to” in the one-dimensional memory space. When the elements in all depths are of the element size and the LIS sizes of the sub-LISs within the same depth are the same, the piece of recursively structured data is a complete LIS.

Abstract: Data processing apparatuses and data processing methods are provided. The data processing apparatus includes a storage unit, an interface, and a processor. The storage unit stores a first key-value set including a plurality of first key-value pairs. Each of the first key-value pairs has a first key and a first value. The interface receives an instruction regarding a set operation and a function. The processor generates a plurality of second keys by applying the set operation to the first keys. Each of the second keys includes at least one of the first keys. The processor generates a second value for each of the second keys by applying the function to at least one datum corresponding to the at least one first key comprised in the second key. Each second key and the corresponding second value form a second key-value pair and the second key-value pairs form a second key-value set.