International Business Machines Corporation

Lenovo (singapore) Pte. Ltd.

Sathiskumar Palaniappan

Vijay Sundaresan

Prashanth K Nageshappa

Timothy P Ellison

Amit S Mane

Eric B Libow

Patrick R Doyle

Prasanna Alur Mathada

Srinivas Varma Chitiveli

Aruna A Kalagananam

Prashanth S Krishna

Andrew Russell Low

Geetha Adinarayan

Balbir Singh

Anshu Verma

Venkataraghavan Lakshminarayanachar

Amit Mohan Mangalvedkar

Pramod B Nagaraja

Amar Devegowda

Hari Hara Prasad Viswanathan

Deepti Verma

Aspects of the present invention disclose a method for generating a reasoning query based on a user selection of a generated data visualization of a knowledge graph. The method includes one or more processors generating a knowledge graph of a domain. The method further includes constructing a hierarchy of the knowledge graph. The method further includes generating a data visualization of the domain based at least in part on the hierarchy of the knowledge graph. The method further includes identifying a user selection of one or more nodes of the data visualization. The method further includes generating a reasoning query corresponding to the domain based on the data visualization of the domain and the user selection. The method further includes determining whether the knowledge graph includes a collection of nodes that are on a level of the constructed hierarchy that corresponds to a level of the one or more nodes.

Auto generating reasoning query on a knowledge graph

A data-serialization system initially uses a recursive serialization algorithm to serialize a hierarchy of nested data objects by translating those objects into a serial stream of data. The system determines that a stack-overflow error is likely to occur whenever the number of objects serialized by the system exceeds a threshold value, or whenever the stack has reached an unacceptable level of utilization. When the system determines that a stack-overflow error is likely or if the system detects that a stack-overflow error will definitely occur if another object is serialized, the system either transfers control to a nonrecursive algorithm that does not require a stack data structure or reduces stack utilization by transferring contents of the stack to a variable-size queue-like data structure.

Recursive stack-based serialization of hierarchical data

Processors configured by aspects of the present invention optimize reference cache maintenance in a serialization system by serializing a plurality of objects into a buffer and determining whether any of the objects are repeated within the buffered serialized plurality. The configured processors insert an object repetition data signal within the serialized plurality of objects that indicates to a receiver whether or not any objects are determined to be repeated within the buffered serialized plurality of objects, and send the serialized plurality of objects with the inserted object repetition data signal as a single chunk to a receiver, wherein the inserted object repetition data signal conveys reference cache management instructions to the receiver.

Reference cache maintenance optimizer

Recursive serialization of a hierarchy of data objects

A method for providing an interactive elevator assistant is provided. The method may include identifying amenities associated with a property and location-based features within a vicinity of the property. The method may further include mapping the amenities to floor levels associated with the property. The method may further include receiving user input from a user located on an elevator associated with the property. The method may further include, in response to determining that the received user input comprises an amenity, determine the one or more floor levels on the property that are associated with the amenity and triggering the elevator to navigate to the determined one or more floor levels. The method may also include, in response to determining that the received user input comprises a location-based feature, sending the received user input to an application for processing. The method may further include providing a response via the elevator.

Cognitive interactive elevator assistant

Dynamic reduction of stack-overflow errors in a recursive data-serialization algorithm

A computer-implemented method for class load optimizing. The method determines whether a caller method within the class has a specific signature call using the context of the class. The method determines a callee method within the class using the context of the class. Furthermore, the method retrieves a class object of the class and converts the callee method to a second method, in response to the caller method having the specific signature, the callee method being of the specific signature and callee method being the first argument of the caller method.

Optimizing latest user defined class loader

A computer-implemented method for class load optimizing. The method identifies a class in which a context can be determined at a compile time, using a compiler. The method determines whether a caller method within the class has a specific signature call using the context of the class. The method determines a callee method within the class using the context of the class. The method determines whether the callee method's receiver is a first argument of the caller method. Furthermore, the method retrieves a class object of the class and converts the callee method to a second method, in response to the caller method having the specific signature, the callee method being of the specific signature and callee method being the first argument of the caller method.

A data processing system includes a processor and data storage coupled to the processor. The data storage includes program code, that when executed by the processor, causes the data processing system to serialize a mutable object utilizing a full serialization process and to cache primitive data and metadata regarding the mutable object in binary format in cache. Thereafter, the mutable object is again serialized utilizing an abbreviated serialization process by reference to the cached primitive data and metadata, and the serialized mutable object is communicated to a distributed code element.

Efficient serialization of mutable objects

A method of serialization in a data processing system includes serializing a mutable object utilizing a full serialization process, caching primitive data and metadata regarding the mutable object in binary format in cache and then checking whether primitive fields of the mutable object are modified. Thereafter, the mutable object is again serialized utilizing an abbreviated serialization process by reference to the cached primitive data and metadata if the primitive fields of the object are not modified. In the event that primitive fields of the object are modified, the full serialization process is utilized. Thereafter, the serialized mutable object is communicated to a distributed code element.

Methods and systems may track the invocation path of a system or a library call from Java native interface (JNI) in Java applications. A native call of interest having an associated failure condition, an invocation path associated with the native call of interest, and a Java boundary crossover method (Java method invoking a JNI method) within the invocation path may all identified based on failure diagnostic information. The identified information may also be fed to a Java virtual machine (JVM). When the application is re-run, a check can be made prior to execution of the JNI method, as to whether the Java boundary crossover method is being executed. If so, then the execution stack may be compared to the invocation path of interest.

Tracking specific Java native interface invocations of system and library calls

A method, system and computer program product for caching socket connections while ensuring that there are file descriptors available for the applications. File descriptor references and their referenced objects are stored in a predefined memory region of the heap ('file descriptor heap'). Each time a socket connection is cached, a file descriptor reference may be created to be associated with the socket connection's file descriptor, where the file descriptor reference references the object of the cached socket connection. In order to ensure that there are available file descriptors for the applications, the file descriptor references and their referenced objects are collected by the garbage collector in response to various events (e.g., too many file descriptors are open) thereby freeing the file descriptors that were previously associated with the collected connection objects to be used by the applications.

Caching socket connections while ensuring that there are file descriptors available for the applications

A computer-implemented method is provided for reducing network traffic associated with live migration. The method comprises selecting a virtual machine on a first physical host for migration to a second physical host, and providing each application running in the selected virtual machine with notification that the migration has started. In response to receiving the notification that the migration has started, each application reducing the number of memory pages in use during the migration. The selected virtual machine and each application is then migrated from the first physical host to the second physical host, wherein the migration of each application includes migration of the reduced number of memory pages. Non-limiting examples of methods that may be used to reduce the number of memory pages includes identifying memory that contains garbage, reducing the size of the heap, increasing the pause time used for garbage collection, deferring just-in-time compilation of hot methods, and releasing caches and buffers.

Growing community of inventors

Namakkal, India

Sathiskumar Palaniappan