Abstract: This disclosure provides a method, apparatus and computer program product to create a full homomorphic encryption (FHE)-friendly machine learning model. The approach herein leverages a knowledge distillation framework wherein the FHE-friendly (student) ML model closely mimics the predictions of a more complex (teacher) model, wherein the teacher model is one that, relative to the student model, is more complex and that is pre-trained on large datasets. In the approach herein, the distillation framework uses the more complex teacher model to facilitate training of the FHE-friendly model, but using synthetically-generated training data in lieu of the original datasets used to train the teacher.

Abstract: Privacy-preserving homomorphic inferencing utilizes batch processing on encrypted data records. Each data record has a private data portion of interest against which the inferencing is carried out. Batch processing is enabled with respect to a set of encrypted data records by techniques that ensure that each encrypted data record has its associated private data portion in a unique location relative to the other data records. The set of encrypted data records are then summed to generate a single encrypted data record against which the inferencing is done. In a first embodiment, the private data portions of interest are selectively and uniquely positioned at runtime (when the inferencing is being applied). In a second embodiment, the private data portions of interest are initially positioned with the data-at-rest, preferably in an off-line process; thereafter, at runtime individual encrypted data records are processed as necessary to adjust the private data portions to unique positions prior to batching.

Abstract: An example operation may include one or more of receiving, via a network, tag data that is read from a tag associated with a physical object and signed with a key assigned to the tag, determining, via a blockchain peer, that the signed tag data is validly signed based on a corresponding key pair of the tag which is accessible to the blockchain peer, determining, via the blockchain peer, whether the tag data satisfies of one or more predefined conditions of the physical object, and storing the determination via a blockchain database.

Abstract: A method verifies an authenticity, integrity, and provenance of outputs from steps in a process flow. One or more processor(s) validate one or more inputs to each step in a process flow by verifying at least one of a hash and a digital signature of each of the one or more inputs. The processor(s) then generate digital signatures that cover outputs of each step and the one or more inputs to each step, such that the digital signatures result in a chain of digital signatures that are used to verify an authenticity, an integrity and a provenance of outputs of the one or more steps in the process flow.

Abstract: This disclosure provides a method, apparatus and computer program product to create a full homomorphic encryption (FHE)-friendly machine learning model. The approach herein leverages a knowledge distillation framework wherein the FHE-friendly (student) ML model closely mimics the predictions of a more complex (teacher) model, wherein the teacher model is one that, relative to the student model, is more complex and that is pre-trained on large datasets. In the approach herein, the distillation framework uses the more complex teacher model to facilitate training of the FHE-friendly model, but using synthetically-generated training data in lieu of the original datasets used to train the teacher.

Abstract: A method verifies an authenticity, integrity, and provenance of outputs from steps in a process flow. One or more processor(s) validate one or more inputs to each step in a process flow by verifying at least one of a hash and a digital signature of each of the one or more inputs. The processor(s) then generate digital signatures that cover outputs of each step and the one or more inputs to each step, such that the digital signatures result in a chain of digital signatures that are used to verify an authenticity, an integrity and a provenance of outputs of the one or more steps in the process flow.

Abstract: An example operation may include one or more of receiving, via a network, tag data that is read from a tag associated with a physical object and signed with a key assigned to the tag, determining, via a blockchain peer, that the signed tag data is validly signed based on a corresponding key pair of the tag which is accessible to the blockchain peer, determining, via the blockchain peer, whether the tag data satisfies of one or more predefined conditions of the physical object, and storing the determination via a blockchain database.

Abstract: Techniques for constructing a software application are provided. A data model of the application is represented as a relational model. Control logic of the application is defined to specify each of a plurality of operations of the application as a mapping from a current state of the application data model and one or more current application inputs to a new state of the application data model and one or more application outputs, described by one or more relational algebra operations selected from the group consisting of a relation-complement operation, a disjunction operation and a conjunction operation.

Abstract: An on-demand manager provides an improved distributed data processing system for facilitating dynamic allocation of computing resources among multiple domains based on a current workload and service level agreements. Based on a service level agreement, the on-demand manager monitors and predicts the load on the system. If the current or predicted load cannot be handled with the current system configuration, the on-demand manager determines additional resources needed to handle the workload. If the service level agreement violations cannot be handled by reconfiguring resources at a domain, the on-demand manager sends a resource request to other domains. These other domains analyze their own commitments and may accept the resource request, reject the request, or counter-propose with an offer of resources and a corresponding service level agreement.

Abstract: A cache is configured as a hybrid disk-overflow system in which data sets generated by applications running in a distributed computing system are stored in a fast access memory portion of cache, e.g., in random access memory and are moved to a slower access memory portion of cache, e.g., persistent durable memory such as a solid state disk. Each data set includes application-defined key data and bulk data. The bulk data are moved to slab-allocated slower access memory while the key data are maintained in fast access memory. A pointer to the location within the slower access memory containing the bulk data is stored in the fast access memory in association with the key data. Applications call data sets within the cache using the key data, and the pointers facilitate access, management and manipulation of the associated bulk data. Access, management and manipulation occur asynchronously with the application calls.

Abstract: Techniques for constructing a software application are provided. A data model of the application is represented as a relational model. Control logic of the application is defined to specify each of a plurality of operations of the application as a mapping from a current state of the application data model and one or more current application inputs to a new state of the application data model and one or more application outputs, described by one or more relational algebra operations selected from the group consisting of a relation-complement operation, a disjunction operation and a conjunction operation.

Abstract: Techniques for constructing a software application are provided. A data model of the application is represented as a relational model. Control logic of the application is defined to specify each of a plurality of operations of the application as a mapping from a current state of the application data model and one or more current application inputs to a new state of the application data model and one or more application outputs, described by one or more relational algebra operations selected from the group consisting of a relation-complement operation, a disjunction operation and a conjunction operation.

Abstract: Techniques are disclosed for network distribution and provisioning of applications, such as transactional applications and parallel applications, across multiple administrative domains that ensure compliance with service level agreements. For example, a method of provisioning one or more resources in a distributed computing network to ensure compliance with a service level agreement associated with a computer application includes the following steps. Network performance is monitored between a local domain and one or more cooperating domains connected to the local domain by network paths. A present or predicted violation of the service level agreement is identified based on at least a portion of results of the monitoring step. One or more cooperating domains are selected that can effect compliance with the service level agreement by instantiating one or more network resources within at least one of the selected cooperating domains in response to a request from the local domain.

Abstract: Techniques are provided which enable relaxed transactional isolation and optimistic concurrency control in a distributed client-server architecture, and which address the problems of server overloading and network delays known to exist in conventional distributed client-server architectures. In particular, the invention preferably provides client-side caching techniques which advantageously serve to reduce server overloading and effects of network delay.

Abstract: In accordance with a dual-MVC (Model-View-Controller) approach of the invention, the client machine maintains part of the Model, eliminating many round-trips to the server. The invention provides an implementation approach for constructing the frame(s) contained in the client's browser software to allow it to be refreshed locally. The invention addresses development and maintenance by specifying a library of functions that a programmer can use to construct the View and Controller on the client machine. When part of the Model is maintained on the client, the client has the ability to respond to user interaction without paying the performance penalty of continually interacting with the server.

Abstract: Techniques for constructing a software application are provided. A data model of the application is represented as a relational model. Control logic of the application is defined to specify each of a plurality of operations of the application as a mapping from a current state of the application data model and one or more current application inputs to a new state of the application data model and one or more application outputs, described by one or more relational algebra operations selected from the group consisting of a relation-complement operation, a disjunction operation and a conjunction operation.

Abstract: Techniques are disclosed for network distribution and provisioning of applications, such as transactional applications and parallel applications, across multiple administrative domains that ensure compliance with service level agreements. For example, a method of provisioning one or more resources in a distributed computing network to ensure compliance with a service level agreement associated with a computer application includes the following steps. Network performance is monitored between a local domain and one or more cooperating domains connected to the local domain by network paths. A present or predicted violation of the service level agreement is identified based on at least a portion of results of the monitoring step. One or more cooperating domains are selected that can effect compliance with the service level agreement by instantiating one or more network resources within at least one of the selected cooperating domains in response to a request from the local domain.

Abstract: A method and apparatus for performing general integrity checks using rules in an application running on a data processing system. A point is identified at which a unit of work is to complete. The unit of work includes a plurality of participants. Responsive to determining that the unit of work is to complete, rules associated with each participant in the unit of work are obtained. Responsive to obtaining the rules, the rules obtained for each of the participants are run. Responsive to running the rules, the general integrity of the application state with respect to the unit of work is determined. Responsive to determining the general integrity of the application state, the unit of work is completed by committing it or aborting it.

Abstract: A method of communicating between two business entities, each of the business entities utilizing a different communication protocol, wherein a business conversation is established between the entities, comprises the steps of: providing a business-to-business (B2B) protocol exchange for facilitating communications between the business entities, the B2B protocol exchange being operatively connected to the business entities. The method further includes the step of receiving, at the B2B protocol exchange, a message from one of the business entities in a first communication protocol, translating the received message in the first communication protocol into a translated message in a second protocol used by another of the business entities and sending the translated message to the other business entity. In this manner, the present invention provides a framework for facilitating communication between two business entities implemented using different communication protocols.

Abstract: Methods and apparatus for dynamic runtime partitioning of network-based client/server applications using a Model-View-Controller pattern are provided. Such dynamic partitioning is accomplished by requiring that the application specify: (i) that access to the Model be done through an application programming interface (API) which allows the system runtime to dynamically allocate and access Model storage on the client and/or server; and (ii) that access to the View be done through an API which allows the system runtime to dynamically allocate and access View components on the client and/or server. This enables applications written and tested in such a manner (referred to herein as the “canonical form”) to execute in a non-distributed mode or in a dynamically partitioned mode in which client/server issues are not a factor. This greatly facilitates development of the application.