International Business Machines Corporation

Broadcom Corporation

Avago Technologies International Sales Pte. Limited

Globalfoundries Inc.

Avago Technologies General IP (singapore) Pte. Ltd.

Sachin Gupta

Prasanna Desai

Neeraj Poojary

Sanjay Saha

Sudhirkumar Prajapati

Venkatesh Sainath

Mark Gonikberg

Steven Deane Hall

Shawn Ding

Florin Baboescu

Yury Gonikberg

Pawan Kumar

Prem Shanker Jha

Gabriel Marc Desjardins

Asish Makkattil Ratnan

Payel Banerjee

Nethi Kashi Viswanath

Knut Terje Hermod Odman

Dimitri Kanevsky

Matthew James Fischer

Tara N Sainath

Sara H Basson

James Douglas Warnock

Sunil Kumar

Kamesh Medapalli

Vasant B Rao

Bijoy Bhukania

Kameswara Rao Medapalli

Sandeep Korrapati

Santosh Balasubramanian

Raja Das

Suriya T Skariah

Suryakant Maharana

James E Sundquist

Amit J Tendolkar

Surendra Babu Mandava

Sudhir Prajapati

Basabjit Sengupta

Mukesh Kumar Mohania

Arun Kumar

Prasad Manikarao Deshpande

Jagabondhu Hazra

Sumit Negi

Vishal Singh Batra

Ranjini Bangalore Guruprasad

Sambaran Bandyopadhyay

Dan Jiang

Aanchal Goyal

Kamal Das

Pam Nesbitt

Shakeeb A PashaBK

Shakeeb A Pasha B K

Shakeeb Pasha Bk

Providing a method and a corresponding system for encrypting customer workload data through a trusted entity such as a self-boot engine (SBE). More specifically, there is a method and a corresponding system for securely extracting out customer centric data in a manner that requires the customer payloads and/or workloads to register with the SBE and share the encryption key.

Securing customer data and internal register data during hardware checkstops in a multi-tenant environment

A dynamic graph includes a plurality of nodes and edges at a plurality of time steps; each node corresponds to a geographic location in a first area where pest infestation information is available for a subset of locations. Each edge connects two of the nodes which are geographically proximate, has a direction based on wind direction, and has a weight based on relative wind speed. Assign node features based on weather data as well as labels corresponding to pest infestation severity. Train a graph convolutional network on the dynamic graph. Based on predicted future weather conditions for a second area different than the first area, use the trained graph convolutional network to predict, via inductive learning, pest infestation severity for future times for a new set of nodes corresponding to new geographic locations in the second area for which no pest infestation information is available.

System and method for predicting fall armyworm using weather and spatial dynamics

Methods, systems, and computer program products for dynamic determination of irrigation-related data using machine learning techniques are provided herein. A computer-implemented method includes obtaining irrigation-related data pertaining to a region of interest; determining temporal values corresponding to irrigation activity at the region of interest by performing spatiotemporal analysis of the irrigation-related data; determining amounts of water utilized in connection with the irrigation activity corresponding to the temporal values by applying machine learning techniques to the irrigation-related data; determining types of irrigation activity attributed to the irrigation activity by applying machine learning techniques to the irrigation-related data and determined amounts of water; determining irrigation-related variables pertaining to the region of interest by executing a physical model using, as inputs, the determined temporal values, amounts of water, and types of irrigation activity, wherein the irrigation-related variables include an extent of irrigation activity; and outputting the determined irrigation-related variables to a user.

Dynamic determination of irrigation-related data using machine learning techniques

Embodiments provide a mutable CRTM schema for ensuring the integrity of a client workload on a single system as updates are made to the firmware used to initialize and run that system by booting a computing system in a secure mode; when successfully validating a boot image for the computing system via a secure verification code that is blocked from write access when the system is booted in a unsecure mode, allowing write access to the secure verification code; and continuing to boot the computing system in the secure mode according to the boot image. When booting the system and unseccessfully validating the boot image at the third time, the system boot is failed.

Unsecure to secure transition of mutable core root of trust

Disclosed aspects relate to data packet management in a memory-constrained environment. A data packet having a command may be received by a first device. The data packet may be processed by the first device using the command. A first portion of processed data may be loaded in the memory component by the first device. The first portion of processed data may be communicated by the first device to a second device. A second portion of processed data may be loaded in the memory component by the first device. The second portion of processed data may be communicated by the first device to the second device. A trailer may be loaded in the memory component by the first device. The trailer may be communicated by the first device to the second device.

Data packet management in a memory constrained environment

Various methods and systems are provided for space, frequency and time domain coexistence of RF signals. In one example, among others, a communication device includes a coexistence manager capable of monitoring operating conditions of a cellular modem and a coexistence assistant capable of monitoring operating conditions of a wireless connectivity unit. The coexistence manager is capable of modifying operation of the modem and/or unit based on an operating condition change. In another example, a method includes detecting a change in antenna isolation and/or operating temperature of a FE filter, determining filtering characteristics of the FE filter based at least in part upon the change, and modifying communications of coexisting communication protocols based at least in part upon the filtering characteristics. In another example, a TX/RX configuration for coexisting communication protocols is determined and communications in a protocol is modified based at least in part upon the TX/RX configuration.

Dynamic space, frequency and time domain coexistence

A method, computer program product, and system for selective memory mirroring including identifying, by a computer during an initial program load, predictively deconfigured memory units and memory interfaces, wherein the predictively deconfigured memory units and memory interfaces are marked by the computer for removal from a computer configuration prior to the initial program load, analyzing the predictively deconfigured memory units and memory interfaces to determine a level of granularity for selective memory mirroring and initiating selective memory mirroring at the determined level of granularity using the analyzed predictively deconfigured memory units and memory interfaces.

Selective mirroring of predictively isolated memory

Various methods and systems are provided for time domain coexistence of RF signals. In one example, among others, a method includes obtaining access to a WLAN channel during a free period of a coexisting cellular connection, providing a RDG to allow another device to transmit for a duration corresponding to at least a portion of a TXOP, and receiving a transmission during the duration. In another example, a method includes obtaining access to a WLAN channel during a transmission period of a coexisting cellular connection and providing a protection frame to defer transmissions from another device for a duration corresponding to at least a portion of a TXOP. In another example, a method includes determining a shift of a BT transaction based at least in part upon a schedule of cellular communications and shifting at least a portion of the BT transaction based upon the determined shift.

Time domain coexistence of RF signals

A computer-implemented method of assisting code review comprises updating a profile to indicate types of errors in a first code base based on a first code version history maintained by a code versioning system for the first code base. The first code version history is a record of changes made to the first code base. The method also includes receiving a second code base developed by a first developer having an association with the profile and displaying the second code base on a display together with assistance data based on the profile. The assistance data indicates focus areas for code review based on the types of errors identified in the profile.

User profile based code review

A method for compressing a data structure generated for a computing system includes: generating a table comprising block values of a set of blocks in the data structure, where a block size of each block in the set of blocks is determined by an architecture of the computing system and the values are a threshold number of the most frequently occurring values; determining whether a first value of a block is stored in the table, where the block occurs; storing, in response to determining that the first value is stored in the table, a table index of the first value in a first data structure; storing, in a second data structure, a second value indicating whether the first value is stored in the table; generating a compressed data structure, where the compressed data structure comprises the table, first data structure and the second data structure.

Lossless binary compression in a memory constrained environment

A method for decompressing a compressed data structure generated for a computing system includes generating a first block from the compressed data structure value by: reading a first indicator from a first field of the compressed data structure; reading a first symbol from a second field of the compressed data structure; determining, using the first indicator, whether the first symbol is compressed; reading, in response to determining that the first symbol is compressed, a block value of the first block from a third field of the compressed data structure, where the block value is stored in the third field at an index indicated by the first symbol, and a block size of each block value of the third field is determined by an instruction set of the computing system. The method further includes generating an uncompressed data structure by storing the first block in an uncompressed data structure.

Growing community of inventors

Bengaluru, India

Sachin Gupta