International Business Machines Corporation

Chun Lei Xu

Xiao Ming Ma

Si Er Han

Zhen Duo Liu

Geng Wu Yang

Liang He

Feng Zheng

Lei Nie

Jing James Xu

Lei Tian

Lei Gao

Yi Shao

Xiao Bin Sun

Shuo Li

Xiaobo Wang

Sheng Yan Sun

Liang Wang

Dong Hai Yu

Yi Shan Jiang

Jun Song Wang

Jia Wang

Xing Wei

A Peng Zhang

Chong Liu

Rui Wang

Yang Y Yang

Zhe Zl Liu

Hao Zheng

Jia Fei Yang

Xiao Yan Xx Liu

Heng Tang

Fan Bai

Liu Zhen Duo

Zhe Shao

Shi Bin Liu

A computer implemented method for managing datasets for a histogram. The method uses a number of processor units to determine a first span for first bins containing first datapoints in a first dataset in the datasets. The first span is determined based a distribution of the first datapoints in the first dataset and a desired number of bins. The number of processor units adjusts a second span for second bins containing second datapoints in a second dataset in the datasets to form an adjusted span that matches the first span for the first bins. The number of processor units merges the first datapoints in the first bins having the first span with the second datapoints in the second bins having the adjusted span to form a merged dataset for the histogram.

Data merging in distributed computing system

A method, computer program product and computer system to track and test custom webpage components is provided. A processor retrieves a production webpage. A processor determines a custom component of the production webpage. A processor retrieves component metadata associated with the custom component. A processor generates a hidden element in the production webpage including the component metadata, wherein the production webpage is configured to make the hidden element visible in response to an event.

Webpage component tracker

A method for adding dimensions to a visual representation is disclosed. In one embodiment, such a method obtains a data set containing data in a plurality of rows and columns (i.e., dimensions). The method divides the dimensions into a plurality of groups and determines a coordinate system for each group. For each row in the data set, the method determines data points for each group in the corresponding coordinate system. The method then connects the data points for each row with lines to create a visual representation for the data set. In certain embodiments, each group in the data set utilizes a two-dimensional coordinate system. In other embodiments, each group in the data set utilizes a three-dimensional coordinate system. In yet other embodiments, a mix of two-dimensional coordinate systems and three-dimensional coordinate systems are used. A corresponding system and computer program product are also disclosed.

Visual representation for higher dimension data sets

An approach is provided in which the approach builds a combination model that includes a normal status model and an abnormal status model. The normal status model is built from a set of time-sequenced normal status records and the abnormal status model is built from a set of time-sequenced abnormal status records. The approach computes a set of time-sequenced coefficient combination values of the normal status model and the abnormal status model based on applying a set of fitting coefficient characteristics to the normal status model and the abnormal status model. The approach performs goal seek analysis on a system using the combination model and the set of time-sequenced coefficient combination values.

Goal seek analysis based on status models

Disclosed are a computer-implemented method, a system and a computer program product for feature processing. In the computer-implemented method for feature processing, two input features selected from multiple features of each sample in a sample set are projected to one resulting feature by one or more processing units based on a specified curve. The sample set is updated by replacing the two input features with the one resulting feature for each sample in the sample set by one or more processing units. The projecting and the updating for the sample set are repeated by one or more processing units until the number of features of each sample in the sample set reaches a predetermined criterion.

Feature processing for machine learning

This disclosure provides a method, a computing system, and a computer program product for managing prefetching of pages in a database system. The method comprises obtaining shared information associated with page access, wherein the shared information associated with the page access includes information associated with the page access from a plurality of computing nodes. The method further comprises determining whether to prefetch a number of pages into a global buffer pool based at least on the shared information associated with the page access using a sequential prefetching method.

Prefetching management in database system based on number of pages being prefetched

Provides a method for hashing structural data. According to this method, structural data that includes a plurality of keys and a plurality of values corresponding to respective keys is received. A plurality of key-value pairs can be parsed from the structural data, with each of the plurality of key-value pairs including a key and a value respectively corresponding to the key. A hash value of the plurality of key-value pairs is computed according to a predefined policy as a hash value of the structural data, wherein the predefined policy includes sorting the plurality of key-value pairs or processed key-value pairs.

Hash for structural data with same data meaning

Methods, computer program products, and/or systems are provided that perform the following operations: obtaining a series of indicator diagrams corresponding to strokes of a pumpjack over a specific time duration, dividing each indicator diagram into a plurality of location segments in a direction of location of the rod; obtaining load difference features between upstroke loads and corresponding downstroke loads in the plurality of location segments; identifying a location segment with an abnormal load difference feature based on a time series data of load difference feature corresponding to one of the plurality of location segments, the time series data of load difference feature including a series of data points of load difference feature of the one of the plurality of location segments in time order; and providing an indication of a potential problem based, at least in part, on the identification of the location segment with an abnormal load difference feature.

Identifying potential problems in a pumpjack

An approach is provided in which the approach constructs a 3-dimensional (3D) matrix based on a plurality of historical transactions performed by a user. The 3D matrix includes a set of features, a set of rows, and a set of channels. The approach trains a convolutional neural network using the 3D matrix, and then uses the trained convolutional neural network to predict a risk level of a new transaction initiated by the user. The approach transmits an alert message based on the predicted risk level.

Financial risk management based on transactions portrait

According to embodiments of the present disclosure, a method, a device and a computer program product for code deployment are proposed. In the method, a deployment strategy for deploying code into a plurality of computing environments and respective amounts of resources provided by the plurality of computing environments are obtained. At least one code segment of the code to be deployed in a corresponding computing environment comprised in the plurality of computing environments is determined based on the deployment strategy and the respective amounts of resources. An amount of resources provided by the corresponding computing environment is sufficient to run the at least one code segment. The at least one code segment is deployed into the corresponding computing environment.

Code deployment

Implementations of the present disclosure relate to methods, systems, and computer program products for permission management. In one implementation, a computer-implemented method is disclosed. In the method, a permission score may be determined for a user in response to an operation requested to a target system by the user. Whether to permit the operation may be determined based on the permission score. Here, the permission score may be determined based on an identity component of the user and at least one of following components of the user: a state component, and an environment component. In other implementations, a computer-implemented system and a computer program product for permission management are disclosed.

Permission management

Enabling access to encrypted information by providing a master key and a public key to a partial content owner, generating a ciphertext of content according to a complete content data, at least one content data partition and the public key, wherein the content data partition comprises a portion of the complete content data, providing the ciphertext of the content data and the public key to a validator, receiving a validation result from the validator, and acting upon the validation result.

Controlling access to encrypted data

According to an embodiment of the present disclosure, a non-directional task comprising a user's requirement is generated. The non-directional task is sent to a first resource node in a task network. The task network comprises a plurality of resource nodes that provide services accessible to the user. The non-directional task does not specify which resource node to perform the non-directional task. It is determined whether the first resource node can perform at least part of the non-directional task. The non-directional task is forwarded from the first resource node to a second resource node of the task network.

Growing community of inventors

Xi'an, China

Chun Lei Xu