International Business Machines Corporation

Beihang University

Xi Bo Zhu

Cheng Fang Wang

Xue Yong Zhang

Jun Gao

Guan Jun Liu

Bei Chun Zhou

Xianbin Cao

Ping Ping Cheng

Wenbo Du

Yumeng Li

Di Wu

Joey H Y Tseng

Guo Qiang Li

Yan Feng

Dong Jun Zong

Xin Zheng

Qin Li

Lu Zhao

Shi Yu Wang

Xiao Xiao Pei

Qi En Jiang

Xiao Ling Chen

Jing Jing Zhang

Ping Xiao

Xue Liang Zhao

Bo Chen Zhu

Wu Song Fang

Biyue Li

Guang Yu Ye

Haichao An

Jintong Zhang

Embodiments of the present disclosure relate to a method, system and computer program product for trace data protection. In some embodiments, a method is disclosed. According to the method, a target task is determined from a plurality of tasks, where trace data of the target task is to be protected. The trace data of the target task is transferred from a first area to a second area of a memory. Existing trace data in the second area is offloaded to a storage device before being overwritten. In other embodiments, a system and a computer program product are disclosed.

Trace data protection

This application provides an airspace complexity evaluation method based on deep unsupervised learning for air traffic management, which includes the following parts. A stacked autoencoder is used to establish an airspace complexity evaluation model. Input the airspace complexity factors into the stacked autoencoder to obtain the low-dimensional embedded representations of the airspace complexity factors. Cluster the low-dimensional embedded points to capture the centroids of the airspace complexity data. The application utilizes the soft assignment distribution and real assignment distribution of the embedded representations to construct a training loss function which optimizes the airspace complexity evaluation model by gradient descent algorithm. The trained airspace complexity evaluation model and the three obtained cluster centroids describing the airspace complexity level are used to evaluate the current airspace complexity.

Deep unsupervised learning approach, device and storage medium for airspace complexity evaluation

A method, system and computer program product for optimizing scheduling of batch jobs are disclosed. The method may include obtaining, by one or more processors, a set of batch jobs, connection relationships among batch jobs in the set of batch jobs, and a respective execution time of each batch job in the set of batch jobs. The method may also include generating, by the one or more processors, a directed weighted graph for the set of batch jobs, wherein in the directed weighted graph, a node represents a batch job, a directed edge between two nodes represents a directed connection between two corresponding batch jobs, a weight of a node represents the execution time of the batch job corresponding to the node. The method may also include obtaining, by one or more processors, information of consumption of same resource(s) among the batch jobs in the set of batch jobs.

Optimization for scheduling of batch jobs

Embodiments of the present invention provide computer-implemented methods, computer program products and computer systems. Embodiments of the present invention can, in response to receiving performance data associated with records, identify whether the received performance data is associated with long transactions. Embodiments of the present invention can then, in response to determining that the received performance data is associated with long transactions, storing the performance data. Embodiments of the present invention can then classify the stored performance data according to types of transactions the performance data and aggregate the stored performance data based on the classification.

Dynamic data aggregation

A computer-based airplane flight path planning method based on the pigeon-inspired optimization (PIO) algorithm includes steps of establishing an uncertainty prediction model, determining the path to be optimized, and obtaining an optimal path using the PIO algorithm for a flight controller onboard to execute. The PIO algorithm treats a pigeon flock as a scale-free network, applies map and compass operators to the scale-free network, and performs landmark operations to obtain the optimal path. The device that performs the path planning includes an access module for obtaining the regional environment information and a flight controller onboard the airplane. The flight controller includes a building module for setting up the trajectory prediction model including uncertainties; a determining module to determine the trajectories which need optimization; an optimization module, which uses the PIO algorithm to optimize the flight path; and a computer memory module.

Airplane flight path planning method and device based on the pigeon-inspired optimization

A sector situation (SS) evaluation framework is based on knowledge transfer and is specifically applicable for small-training-sample environment. The SS evaluation framework is able to effectively mine knowledge hidden within the samples of both target and non-target sectors, and properly handle the integration between the knowledge derived from different sectors. This framework includes three main steps: (1) sufficiently mine the knowledge within the samples of the target sector using the strategies of multi-factor subset generation and multi-base evaluator construction, and build target base evaluators; (2) precisely learn the knowledge in the samples of the non-target sectors using similar strategies for the target sector, together with a sample transformation, and build non-target base evaluators; and (3) efficiently integrate the target and non-target base evaluators based on evaluation confidence analysis of those base evaluators.

Knowledge-transfer-based learning framework for airspace situation evaluation

Systems and methods are provided for generating task reminders. The method includes identifying, using a processor, a task description by parsing digital text from a message in an application. The method further includes obtaining context information from the parsed digital text indicating an association between the task description and the application. The method additionally includes generating, using the processor, a task reminder based on the obtained context information, the task reminder including digital text indicating the association between the task description and the application.

Task reminder generator

A method and associated computer system. A first machine executes machine code in a debugging session on the first machine. The machine code had been previously received by the first machine from a second machine. The machine code includes machine executable instructions. The machine code was generated from compilation of source code developed and compiled on the second machine. In response to a change in the machine code having detected by the first machine in the debugging session on the first machine, the first machine determines a portion of the source code associated with the change in the machine code based on a profile. The profile indicates a mapping between the source code and the machine code. The first machine, while communicating with the second machine, causes the portion of the source code to be updated on the second machine based on the change in the machine code.

Code update based on detection of change in runtime code during debugging

Embodiments of the present disclosure relate to methods, systems, and computer program products for processing a message including a content and operations performed on the content. According to the method, in response to a message including both a content and a description of operations performed on the content being requested to access, an application may be made to access the content; and the application may be made to execute the operations performed on the content.

Message processing

A computer-implemented method, a computer program product, and a computer system for parallel task management. A computer system receives a new task that requests to access a resource may be received. In response to an access workload being above a first threshold, the computer system dispatches the new task to at least one predefined processing unit, wherein the access workload may be associated with the resource that is in parallel accessed by a plurality of existing tasks.

Task management based on an access workload

According to an embodiment of the present disclosure, there is provided a method for a distributed transaction processing environment. The method includes in response to determining that a state of a first node acting as a first coordinating node is not performing properly, selecting a second node from a first plurality of participating nodes communicatively coupled to the first node. The method further includes activating the selected second node to be a second coordinating node while deactivating the first node to be a participating node. In addition, the method includes performing a transaction based on a cooperation between the first and second nodes.

Transaction processing

The present invention discloses a method and apparatus for automatic cross-system program debugging. One embodiment of the present invention provides a method for cross-system program debugging. The method comprises: determining a first breakpoint in a first debugging session of a first system; determining a second breakpoint in a second debugging session of a second system, the second system being different from the first system; and responsive to a user performing a debugging action of associating the first breakpoint with the second breakpoint in the first debugging session and the second debugging session, recording an association between the first breakpoint and the second breakpoint for automating the program debugging across the first system and the second system. There is further described a corresponding apparatus.

Method and apparatus for automatic cross-system program debugging

A method, and associated computer system and computer program product. A change of runtime code is detected by one or more processors of the computer system. The change is detected in a debugging session on a first machine. The runtime code is obtained from source code that is developed on a second machine that is different from the first machine. In response to the change being detected, a portion of the source code associated with the detected change is determined, by the one or more processors, based on a profile. The profile indicates a mapping between the source code and the runtime code. The portion of the source code is caused, by the one or more processors, to be updated based on the detected change in the runtime code.

Growing community of inventors

Beijing, China

Xi Bo Zhu