Abstract: A system and method for synchronizing two-dimensional (“2D”) camera data for object recognition. An object recognition kiosk includes a plurality of 2D cameras and a stage for placement of one or more items. The plurality of 2D cameras capture images of items on the stage from multiple angles. The images received from the 2D cameras are concatenated into a single image. The concatenated image is processed by a trained machine learning model that analyzes and detects items present in each of the camera images that make up the concatenated image and generates 2D bounding boxes around each item. Once items are detected in the concatenated image, sensor fusion is performed based on the detected items and the bounding boxes to synchronize the image data from each of the cameras. The sensor fusion process enables the system to accurately identify the one or more items that are present on the stage.

Abstract: Source data of an event stream is parsed and supplemented with additional data from reference data sources, producing an enriched event stream from the parsed event stream data. The data records of the enriched event stream are partitioned into data fields designated as a dimension partition and a metric partition, which are partitioned into sub-dimension projections mapped to a plurality of storage keys, such that each of the storage keys includes one or more placeholder wildcard values and each of the storage keys is stored into a database of the computer system by the computer processor.

Abstract: Source data of an event stream is parsed and supplemented with additional data from reference data sources, producing an enriched event stream from the parsed event stream data. The data records of the enriched event stream are partitioned into data fields designated as a dimension partition and a metric partition, which are partitioned into sub-dimension projections mapped to a plurality of storage keys, such that each of the storage keys includes one or more placeholder wildcard values and each of the storage keys is stored into a database of the computer system by the computer processor.

Abstract: The present invention relates to a method of and system for managing sensor data in a computer database environment. An exemplary method of the invention is described, comprising the steps of: defining a Sensor Network environment in terms of zones, each zone being defined by its entrance or exit condition, and having a distinct and consistent property associated with it; collecting sensor data regarding the state of objects within the Sensor Network environment; analyzing the collected sensor data in the context of said Sensor Network environment and the zones; and storing the analyzed sensor data as records in a database, in an application agnostic form, and in terms of the zones. A corresponding system is also described.

Abstract: The present invention relates to a method of and system for managing sensor data in a computer database environment. An exemplary method of the invention is described, comprising the steps of: defining a Sensor Network environment in terms of zones, each zone being defined by its entrance or exit condition, and having a distinct and consistent property associated with it; collecting sensor data regarding the state of objects within the Sensor Network environment; analyzing the collected sensor data in the context of said Sensor Network environment and the zones; and storing the analyzed sensor data as records in a database, in an application agnostic form, and in terms of the zones. A corresponding system is also described.

Abstract: A shareable application program interface infrastructure which is used in combination with a relational database to provide data storage and processing functions for location-dependent objects, and includes a mechanism for easily associating an object, such a service, with a geographic region, such as an area served by the service. The service designer is provided with a tool to choose a geographic region or a point location (specified by an address), and to associate that selected geographic region with a service. Each service is associated with a geographic region chosen from a hierarchy of predetermined system-defined regions that are preferably organized into a hierarchy composed of levels organized in order of decreasing size so that the boundaries of each child region lie within the boundaries of its parent region. The services designer is also provided with the option of creating “user defined regions” that are composed of existing system defined regions or a region centered around a selected location.

Abstract: A shareable application program interface (API) infrastructure which is used in combination with a relational database to provide data storage and processing functions for location-aware objects, including particularly mobile objects whose current position is periodically updated by a position determining system. Client and service tables in the relational database are used to store the current point location, and other data, representing virtual objects, including mobile objects. A region table stores that describing the geometry and characteristics of geographical regions having defined boundaries within which the client and service objects reside. For each client, the set of services used by that client is recorded in a client profile database table. The services available on the system which are position-dependent have a geographical location associated with them. The API makes available an assortment of location dependent processing functions which may be used by location aware applications.

Abstract: A method, system, and computer program product for providing event service based on locations of mobile users provides improved efficiency by using a location cache to store recent location information for mobile users, reducing the need for expensive and time consuming positioning requests, and by intelligently scheduling times when location determinations are to be made.

Abstract: A shareable application program interface infrastructure which is used in combination with a relational database to provide data storage and processing functions for location-dependent objects, and includes a mechanism for easily associating an object, such a service, with a geographic region, such as an area served by the service. The service designer is provided with a tool to choose a geographic region or a point location (specified by an address), and to associate that selected geographic region with a service. Each service is associated with a geographic region chosen from a hierarchy of predetermined system-defined regions that are preferably organized into a hierarchy composed of levels organized order of decreasing size so that the boundaries of each child region lie within the boundaries of its parent region.

Abstract: A method and apparatus for buffering is provided. A set of buffers is maintained in an ordered list based on a profit value generated for each buffer. The profit value for a buffer reflects multiple access characteristics of the buffer. The list of buffers is partitioned into divisions referred to as buckets. Each bucket contains a set of buffers and is associated with a subrange of the fall range of profit values that may be generated. The bucket that covers the very top of the list is associated with highest profit value subrange, the bucket that covers the bottom of the list is associated with the lowest profit value subrange. When data is first placed in a buffer, the buffer's position within the buffer list is not immediately based on its profit value. Instead, an access history is first accumulated for the buffer and, once accumulated, the buffer's profit value earns the buffer's place in the list.

Abstract: A method, and apparatus for its use, for reducing the number of disk accesses needed to satisfy requests for reading data from and writing data to a hard disk. A non-volatile cache memory used to hold data blocks for which write requests have been made is purged of "dirty" blocks, not yet written to the disk, based on the proportion of dirty blocks in relation to an upper threshold and a lower threshold. A purge request flag is set when the proportion of dirty blocks goes above the upper threshold, but is not cleared until the proportion of dirty blocks goes below the lower threshold. So long as the purge request flag is set, dirty blocks are purged when the disk is not busy with read requests. Immediate purging is initiated when the write cache becomes totally full of dirty blocks.

Abstract: Information needed by application programs from a secondary storage is cached in a cache memory which is organized in multiple levels, each level having multiple entries, the entries of each level receiving information of a predetermined category, each entry being accessible independently. Links are defined between entries of one level of the cache memory and entries at another level of the cache memory, the links corresponding to information relationships specified by a user of information stored in the secondary storage. In response to a request to a file system from an application for needed information, the needed information is fetched into the cache, and in connection with fetching the needed information, other information is prefetched from the system of files which is not immediately needed. Quotas are established on information which may be fetched from a secondary storage into the cache, the quotas being applicable to file contents within a file and to the number of files within a directory.