Abstract: Systems and methods include responsive to a user initiating a session with a resource, determining a master fingerprint of a device associated with the user; collecting, at predefined time intervals, one or more additional fingerprints during the session; comparing the one or more additional fingerprints with the master fingerprint; and performing one or more actions based on the comparing.

Abstract: Systems, methods, and apparatus are provided for intelligent, integrated, and interactive remote reporting. A remote natural language request for a report may be received from a user at an edge device. A first machine learning model may generate a list of existing reports based on past usage by the user. If no existing report satisfies the request, a second, enterprise-level machine learning model may map the request to relevant data sets and rank the mapped data sets along with additional related data sets based on enterprise-wide usage. An integrated reporting platform may receive selected data sets and report parameters as a JSON request, convert the request to compatible executable instructions, and generate the report. The integrated reporting platform may be a wrapper layer encompassing multiple proprietary reporting engines. Feedback from the integrated reporting platform may be applied to update the machine learning models.

Abstract: A system and computer-implemented method for predicting a search term of a search are disclosed. The method includes building, by a server, a search prediction dictionary database, the search prediction dictionary database including a plurality of search terms and a plurality of prediction scores corresponding to the plurality of search terms; receiving, by the server, one or more characters from a user device over a network, the one or more characters corresponding to the search; identifying, by the server, one or more predicted search terms based on the one or more characters, the identifying including determining one or more of the plurality of search terms including the one or more characters; and providing, by the server, a search term prediction list including the one or more predicted search terms to the user device for display on a display device of the user device.

Abstract: A system and computer-implemented method for predicting a search term of a search are disclosed. The method includes building, by a server, a search prediction dictionary database, the search prediction dictionary database including a plurality of search terms and a plurality of prediction scores corresponding to the plurality of search terms; receiving, by the server, one or more characters from a user device over a network, the one or more characters corresponding to the search; identifying, by the server, one or more predicted search terms based on the one or more characters, the identifying including determining one or more of the plurality of search terms including the one or more characters; and providing, by the server, a search term prediction list including the one or more predicted search terms to the user device for display on a display device of the user device.

Abstract: A method, apparatus, and computer program product for scheduling stream-based applications in a distributed computer system with configurable networks are provided. The method includes choosing, at a highest temporal level, jobs that will run, an optimal template alternative for the jobs that will run, network topology, and candidate processing nodes for processing elements of the optimal template alternative for each running job to maximize importance of work performed by the system. The method further includes making, at a medium temporal level, fractional allocations and re-allocations of the candidate processing elements to the processing nodes in the system to react to changing importance of the work. The method also includes revising, at a lowest temporal level, the fractional allocations and re-allocations on a continual basis to react to burstiness of the work, and to differences between projected and real progress of the work.

Abstract: A storage system includes a plurality of data vats, and a processor including an optimizing unit that optimizes a value of data stored in the storage system. The optimizing unit optimizes the value by computing and implementing an optimal decision for allocating new data to a first data vat of the plurality of data vats, moving existing data from at least a second data vat of the plurality of data vats to the first data vat, and deleting existing data from the first data vat, based on an amount of data in each of the plurality of data vats.

Abstract: An apparatus and method for making fractional assignments of processing elements to processing nodes for stream-based applications in a distributed computer system includes determining an amount of processing power to give to each processing element. Based on a list of acceptable processing nodes, a determination of fractions of which processing nodes will work on each processing element is made. To update allocations of the amount of processing power and the fractions, the process is repeated.

Abstract: A system and method for choosing non-continual jobs to run in a stream-based distributed computer system includes determining a total amount of resources to be consumed by non-continual jobs. A priority threshold is determined above which jobs will be accepted, below which jobs will be rejected. Overall penalties are minimized relative to the priority threshold based on estimated completion times of the jobs. System constraints are applied to ensure that jobs meet set criteria such that a plurality of non-continual jobs are scheduled which consider the system constraints and minimize overall penalties using available resources.

Abstract: A method of choosing jobs to run in a stream based distributed computer system includes determining jobs to be run in a distributed stream-oriented system by deciding a priority threshold above which jobs will be accepted, below which jobs will be rejected. Overall importance is maximized relative to the priority threshold based on importance values assigned to all jobs. System constraints are applied to ensure jobs meet set criteria.

Abstract: A storage system includes a plurality of data vats, and a processor including an optimizing unit that optimizes a value of data stored in the storage system. The optimizing unit optimizes the value by computing and implementing an optimal decision for allocating new data to a first data vat of the plurality of data vats, moving existing data from at least a second data vat of the plurality of data vats to the first data vat, and deleting existing data from the first data vat, based on an amount of data in each of the plurality of data vats.

Abstract: A method (and system) of storing data in a value-based storage system, includes optimizing a value of data stored in the value-based storage system.

Abstract: A system and method for allocating distributed processing systems includes inputting component descriptions in a distributed processing system and determining importance of each component. Capacity and failure characteristics of resource groups representing units of available processing capacity are also input. Components are assigned to a plurality of resource groups based on the capacity. Each resource group includes components where the failure characteristics permit simultaneous failures, such that in the event of such failures, an output value of the application is maximized.

Abstract: A method of choosing jobs to run in a stream based distributed computer system includes determining jobs to be run in a distributed stream-oriented system by deciding a priority threshold above which jobs will be accepted, below which jobs will be rejected. Overall importance is maximized relative to the priority threshold based on importance values assigned to all jobs. System constraints are applied to ensure jobs meet set criteria.

Abstract: A method of choosing jobs to run in a stream based distributed computer system includes determining jobs to be run in a distributed stream-oriented system by deciding a priority threshold above which jobs will be accepted, below which jobs will be rejected. Overall importance is maximized relative to the priority threshold based on importance values assigned to all jobs. System constraints are applied to ensure jobs meet set criteria.

Abstract: An apparatus and method for making fractional assignments of processing elements to processing nodes for stream-based applications in a distributed computer system includes determining an amount of processing power to give to each processing element. Based on a list of acceptable processing nodes, a determination of fractions of which processing nodes will work on each processing element is made. To update allocations of the amount of processing power and the fractions, the process is repeated.

Abstract: Efficient routing techniques that meet performance objectives associated with an ad-hoc network environment and the like. More specifically, the invention provides a routing methodology proven to provide high (e.g., close-to-optimal) throughput and low delay guarantees. Further, the present invention preferably considers a network with both static and mobile nodes. The mobile nodes preferably follow a particular model of movement, referred to herein as a mobility model.

Abstract: An apparatus and method for scheduling stream-based applications in a distributed computer system includes a scheduler configured to schedule work using three temporal levels. Each temporal level includes a method. A macro method is configured to schedule jobs that will run, in a highest temporal level, in accordance with a plurality of operation constraints to optimize importance of work. A micro method is configured to fractionally allocate, at a medium temporal level, processing elements to processing nodes in the system to react to changing importance of the work. A nano method is configured to revise, at a lowest temporal level, fractional allocations on a continual basis.

Abstract: A method of choosing jobs to run in a stream based distributed computer system includes determining jobs to be run in a distributed stream-oriented system by deciding a priority threshold above which jobs will be accepted, below which jobs will be rejected. Overall importance is maximized relative to the priority threshold based on importance values assigned to all jobs. System constraints are applied to ensure jobs meet set criteria.

Abstract: A system and method for choosing non-continual jobs to run in a stream-based distributed computer system includes determining a total amount of resources to be consumed by non-continual jobs. A priority threshold is determined above which jobs will be accepted, below which jobs will be rejected. Overall penalties are minimized relative to the priority threshold based on estimated completion times of the jobs. System constraints are applied to ensure that jobs meet set criteria such that a plurality of non-continual jobs are scheduled which consider the system constraints and minimize overall penalties using available resources.

Abstract: A method, apparatus, and computer program product for scheduling stream-based applications in a distributed computer system with configurable networks are provided. The method includes choosing, at a highest temporal level, jobs that will run, an optimal template alternative for the jobs that will run, network topology, and candidate processing nodes for processing elements of the optimal template alternative for each running job to maximize importance of work performed by the system. The method further includes making, at a medium temporal level, fractional allocations and re-allocations of the candidate processing elements to the processing nodes in the system to react to changing importance of the work. The method also includes revising, at a lowest temporal level, the fractional allocations and re-allocations on a continual basis to react to burstiness of the work, and to differences between projected and real progress of the work.