International Business Machines Corporation

Vijay R Kalangumvathakkal

Sudheesh S Kairali

Jagdish Kumar

Sunil Kumar S Singh

Nataraj Nagaratnam

Sreekanth Ramakrishna Iyer

Vinit Jain

Gal A Shachor

Ankur Tagra

Karunakar Bojjireddy

Madhuri Madhavan Pillai

Ashish Kumar Thakur

Sarbajit Kumar Rakshit

Rohit Pradeep Shetty

Gaurav Gupta

Rahul Gupta

Anil Kv Kumar

Lohitashwa Thyagaraj

Albee Jhoney

Naveen G Balani

Paul Andrew Titheridge

Sowmya H Dayananda

Yochana S Honnavar

Sunil Kumar S Gingade

Amrutha S Shenoy

A method includes: receiving, by a computing device, a microservice code from a user device; identifying, by the computing device, a service used by the microservice code; identifying, by the computing device, the service in a target cloud platform; generating, by the computing device, a modified microservice code by adding a predefined code template to the microservice code, the predefined code template being associated with the service in the target cloud platform; receiving, by the computing device, user input defining a value of a parameter in the predefined code template in the modified microservice code; and generating, by the computing device, a new deployment file for the target cloud platform based on the modified microservice code.

Adapting microservices to multi-platform deployments

An approach for dynamically transitioning mobile client devices from one location to another within edge computing is disclosed. The approach includes retrieving locations for near edges and far edges and collecting one or more SCC (security compliance center) rules. The approach includes identifying edge access from one or more client devices and determining mobility pattern associated with the edge access. The approach includes determining edge recommendation based on the mobility patterns and applying the edge recommendation.

Mobile edges with smart collectors in cloud security and compliance center

Embodiments relate to a system, program product, and method for leveraging cognitive systems to facilitate the management of word and image relationships in a combined vector space. More specifically, the system, computer program product, and method disclosed herein facilitate establishing one or more continuous semantic relationships with word vectors, sentence vectors, and image vectors within an image-word combined vector space with N-dimensional coordinates. In general, the word vectors, sentence vectors, and image vectors are generated within their respective domains that are resident within the image-word combined vector space. Such domains of word vectors, sentence vectors, and image vectors include inherent semantic relationships between respective members of each domain that facilitate establishing continuous, formal, virtual relationships between respective word vectors, image vectors, and sentence vectors within the image-word combined vector space.

Word and image relationships in combined vector space

In an approach to summarizing contextually sensitive text documents based on long short-term memory networks, one or more computer processors create a model based on a vectorized document corpus. The one or more computer processors determine one or more contextually relevant sections utilizing the created model. The one or more computer processors generate a relevancy level for each of the one or more respective determined sections. The one or more computer processors prioritize each of the one or more determined sections based on the respective relevancy level. The one or more computer processors generate one or more textual summaries based on the prioritized sections, wherein the generated one or more textual summaries are aggregated into a document.

Contextually sensitive document summarization based on long short-term memory networks

Aspects of the present invention provide an approach for providing network intrusion detection and prevention service (NIDPS) capabilities to a microservice in a networked computing environment. In an embodiment, a set of rules for accessing the microservice is retrieved. A NIDPS microservice is created within the environment of the microservice fabric that supports the microservice using the set of rules. The NIDPS microservice is established as a proxy communications destination for communications to the microservice such that communications that are intended for the microservice are instead rerouted to the NIDPS microservice. These communications are filtered by the NIDPS microservice according to the set of rules (e.g., to remove any communications that are determined to be threats).

Microservice integration fabrics network intrusion detection and prevention service capabilities

Embodiments of the present invention provide systems and methods for organization of data logging in a networked computing environment. A plurality of logging and monitoring zones, referred to as 'logmon' zones are defined. Each zone is associated with one or more policies. The policies specify various parameters such as storage limits, priority, periodicity, and retention time, among others. A networked application operating in a cloud (networked) environment is associated with a zone. The tenant for the application can be billed according to the zone.

Execution of data logging in a networked computing environment

A computer-implemented method for distributing digital certificates. A request for a digital certificate is received from a requesting system. A deployment challenge is sent to the trust agent running on the requesting system. A response to the deployment challenge is received from the trust agent running on the requesting system. The response to the deployment challenge is evaluated to determine whether the response is correct. The digital certificate is distributed to the requesting system in response to a determination that the response to the deployment challenge is correct.

Secure trust based distribution of digital certificates

A system and non-transitory computer program product for distributing digital certificates. A request for a digital certificate is received from a requesting system. A deployment challenge is sent to the trust agent running on the requesting system. A response to the deployment challenge is received from the trust agent running on the requesting system. The response to the deployment challenge is evaluated to determine whether the response is correct. The digital certificate is distributed to the requesting system in response to a determination that the response to the deployment challenge is correct.

A method, computer program product, and system includes a processor(s) obtaining historical data related to buffer space usage of a common shared storage resource by a group of journals. The processor(s) monitors each journal over repeating temporal periods and determined a predictability for each journal (i.e., predictable or unpredictable. The processor(s) generates usage statistics for each journal during each monitored period dependent on whether the journal was predictable or unpredictable during the monitored period. For each monitored period, the processor(s) ranks predictable journals by a buffer space requirement for each journal of the predictable journals. Based on the rankings, the processor(s) determined a buffer space requirement for each journal for a current period, where the current period shares temporal qualities with the given monitored period. The processor(s) allocates, for use during the current period, based on the buffer space requirement, buffer space to each journal.

Dynamic buffer allocation in similar infrastructures

A method, computer program product, and system includes a processor(s) obtaining historical data related to buffer space usage of a common shared storage resource by a group of journals. The processor(s) monitors each journal over repeating temporal periods and determined a predictability for each journal (i.e., predictable or unpredictable. The processor(s) generates usage statics for each journal during each monitored period dependent on whether the journal was predictable or unpredictable during the monitored period. For each monitored period, the processor(s) ranks predictable journals by a buffer space requirement for each journal of the predictable journals. Based on the rankings, the processor(s) determined a buffer space requirement for each journal for a current period, where the current period shares temporal qualities with the given monitored period. The processor(s) allocates, for use during the current period, based on the buffer space requirement, buffer space to each journal.

According to embodiments of the present invention, one or more computer processors publish a resource detail displayed and an associated first usage context, wherein the resource detail is displayed by a dashboard associated with a leader application. The one or more computer processors determine an appropriate graphical representation for a follower application, to display a first resource having a relationship to a second resource, wherein the second resource is displayed in the dashboard associated with the leader application. The one or more computer processors generate a dashboard universal resource locator for the follower application utilizing the resource detail. The one or more computer processors instruct the follower application to update an associated dashboard with information included in the generated dashboard universal resource locator.

Automated synchronization of distributed dashboards

A first queue stores messages to be consumed. A second queue temporarily stores completely duplicative messages that have message identifiers equal to message identifiers of messages currently being processed s and that have times equal to times of the messages being processed; processing of the completely duplicative messages never occurs. By comparison, a partially duplicative message has its processing delayed until the message of which it is partially duplicative has been finished being processed. A partially duplicative message has a message identifier equal to a message identifier of a message referenced within the non-persistent store and has a time unequal to a time of the message referenced within the non-persistent store is moved from the first to the second queue. A non-persistent store stores references to the messages currently being processed. Once the messages are finished being processed, the references to them are removed from the non-persistent store.

Growing community of inventors

Pathanamthitta, India

Vijay R Kalangumvathakkal