Abstract:
A method for optimal placement of microservices of a micro-services-based application in a multi-tiered computing network environment employing 5G technology is presented. The method includes accessing a centralized server or cloud to request a set of services to be deployed on a plurality of sensors associated with a plurality of devices, the set of services including launching an application on a device of the plurality of devices, modeling the application as a directed graph with vertices being microservices and edges representing communication between the microservices, assigning each of the vertices of the directed graph with two cost weights, employing an edge monitor (EM), an edge scheduler (ES), an alerts-manager at edge (AM-E), and a file transfer (FT) at the edge to handle partitioning of the microservices, and dynamically mapping the microservices to the edge or the cloud to satisfy application-specific response times.
Abstract:
A computer-implemented method includes obtaining a usecase specification and a usecase runtime specification corresponding to the usecase. The usecase includes a plurality of applications each being associated with a micro-service providing a corresponding functionality within the usecase for performing a task. The method further includes determining that at least one instance of the at least one of the plurality of applications can be reused during execution of the usecase based on the usecase specification and the usecase runtime specification, and reusing the at least one instance during execution of the usecase.
Abstract:
Systems and methods are disclosed for distributed real-time security monitoring and alerting. The methods include transmitting a selected portion of biometrics data as a watchlist to each worker unit. The portion of biometrics data is selected in response to respective characteristic data received from each worker unit. Facial recognition data is received from each worker unit. The facial recognition data includes a person of interest with an associated match confidence value calculated by each worker unit based on respective watchlists received by each worker unit. A combined match confidence value is calculated between a same person of interest identified in multiple facial recognition data received from each worker unit and the biometric data associated with an individual. The combined match confidence value is calculated in response to match confidence values associated with the same person of interest in respective facial recognition data being below a match confidence threshold.
Abstract:
Systems and methods are disclosed for distributed real-time security monitoring and alerting. The methods include transmitting a selected portion of biometrics data as a watchlist to each worker unit. The portion of biometrics data is selected in response to respective characteristic data received from each worker unit. Facial recognition data is received from each worker unit. The facial recognition data includes a person of interest with an associated match confidence value calculated by each worker unit based on respective watchlists received by each worker unit. A combined match confidence value is calculated between a same person of interest identified in multiple facial recognition data received from each worker unit and the biometric data associated with an individual. The combined match confidence value is calculated in response to match confidence values associated with the same person of interest in respective facial recognition data being below a match confidence threshold.
Abstract:
Methods and systems for authentication include determining, at a first worker system, that a master system that stores a current authentication-list cannot be reached by a first network. Authentication is performed on an authentication request using a previously stored copy of the authentication-list at the first worker system. The authentication includes facial recognition that is performed on detected face images for a first time window, before receiving the authentication request, and for a second time window, after receiving the authentication request. Authentication removes matching detected face images after completing an authentication request to prevent other individuals from using a same identifier. Access is granted to a secured area responsive to the authentication.
Abstract:
A method for detecting abnormal changes in real-time in dynamic graphs. The method includes extracting, by a graph sampler, an active sampled graph from an underlying base graph. The method further includes merging, by a graph merger, the active sampled graph with graph updates within a predetermined recent time period to generate a merged graph. The method also includes computing, by a graph diameter computer, a diameter of the merged graph. The method additionally includes determining, by a graph diameter change determination device, whether a graph diameter change exists. The method further includes generating, by an alarm generator, a user-perceptible alarm responsive to the graph diameter change.
Abstract:
A system for planning a trip includes heterogeneous data sources including map data, traffic information, vehicle trace data, weather reports, social media data, commuter feedback data, GIS data, travel time data; a stream analytics engine coupled to the heterogeneous data sources; a batch analytics engine coupled to the heterogeneous data sources; and a multi-modal journey planner coupled to the stream analytics engine and the batch analytics engine, the multi-modal journey planner processing indoor travel information and providing real-time updates while a journey is under progress, the multi-modal journey planner providing a journey time forecast as the journey time reflects indoor travel time.
Abstract:
A method in a graph storage and processing system is provided. The method includes storing, in a scalable, distributed, fault-tolerant, in-memory graph storage device, base graph data representative of graphs, and storing, in a real-time, in memory graph storage device, update graph data representative of graph updates for the graphs with respect to a time threshold. The method further includes sampling the base graph data to generate sampled portions of the graphs and storing the sampled portions, by an in-memory graph sampler. The method additionally includes providing, by a query manager, a query interface between applications and the system. The method also includes forming, by the query manager, graph data representative of a complete graph from at least the base graph data and the update graph data, if any. The method includes processing, by a graph computer, the sampled portions using batch-type computations to generate approximate results for graph-based queries.
Abstract:
Systems and methods for swapping out and in pinned memory regions between main memory and a separate storage location in a system, including establishing an offload buffer in an interposing library; swapping out pinned memory regions by transferring offload buffer data from a coprocessor memory to a host processor memory, unregistering and unmapping a memory region employed by the offload buffer from the interposing library, wherein the interposing library is pre-loaded on the coprocessor, and collects and stores information employed during the swapping out. The pinned memory regions are swapped in by mapping and re-registering the files to the memory region employed by the offload buffer, and transferring data of the offload buffer data from the host memory back to the re-registered memory region.
Abstract:
A method is disclosed to manage a multi-processor system with one or more multiple-core coprocessors by intercepting coprocessor offload infrastructure application program interface (API) calls; scheduling user processes to run on one of the coprocessors; scheduling offloads within user processes to run on one of the coprocessors; and affinitizing offloads to predetermined cores within one of the coprocessors by selecting and allocating cores to an offload, and obtaining a thread-to-core mapping from a user.