International Business Machines Corporation

Li Jun Xia

Thomas Abel Beavin

Li Long Chen

Wen Jun Yin

Terence Patrick Purcell

Jin Dong

You-Chin Gene Fuh

Fen-Ling Lin

Ming Xie

Yoichi Tsuji

Jian Zhang

Bin Zhang

Ping Wang

Yao-Ching Stephen Chen

Mengchu Cai

Ta-Hsin Li

Lan Luo

Jian Dong Yin

Jerry Mukai

Jin Yan Shao

Paramesh Sampatrai Desai

Michael R Shadduck

Irene Ching-Hua Liu

Ying Zeng

Hsiuying Yen Cheng

Binghua Zhen

Demai Ni

Qianyang Yu

Li Ni Zhang

Zhong Su

Bo Yang

Ying Li

Shuo Zhang

Jin Zhang

Yang Wang

Sai Zeng

Li Li Zhao

Pei Jian Liu

Keke Cai

Naga A Ayachitula

Andrei Fedorovich Lurie

Xian Wu

Wen Rui Zhao

Rajeev Puri

Jian Yao

David D Weck

Mei Rui Su

Mirza S Baig

Cashchakanithara Venugopal

Ye Yu

Xu Teddy

Ariel Jirau

A method for data configuration is provided. The method comprises parsing a first cascading configuration associated with a data source and selecting content of the first cascading configuration to migrate to a data target. The selected content of the first cascading configuration is then migrated to a second cascading configuration, and the second cascading configuration is applied to the data target.

Cascading data configuration and data migration

Resource sharing is provided. Cryptographic key, resource, and payment information is exchanged between a respective other resource provider having a best matching smart contract response and a particular resource provider selling unused resources. The exchanged cryptographic key, resource, and payment information is verified. The unused resources of the particular resource provider are isolated for dedicated use by the respective other resource provider having the best matching smart contract response. A transaction is performed by sharing the unused resources of the particular resource provider with the respective other resource provider having the best matching smart contract response according to smart contract terms.

Decentralized smart resource sharing between different resource providers

A processor may identify that an application is being downloaded to a computing device. The processor may generate an authorization that regulates data that can be used by the application. The processor may prompt a user to select a first set of addendums for the authorization. The first set of addendums indicate specific data that can be used by the application. The processor may receive a request from the application to access a first specific datum. The processor may determine whether the application is authorized to access the first specific datum.

Intelligent authorization and protection of user data

Embodiments presented herein provide techniques for setting different methods of skipping duplicate values when executing a query statement in a relational database. A distance between a two distinct keys in an index, a current index key and a next distinct index key, are estimated. Based on the estimated distance, an appropriate duplicate-skipping method is determined. If the proximity between the distinct keys is relatively far apart (e.g., the keys reside in index pages that are at least an index page apart), then a 'big skip' method is performed. Otherwise, if the proximity between the distinct keys is relatively near (e.g., the keys reside in the same index page), then a 'little skip' method is performed.

Dynamically adjust duplicate skipping method for increased performance

A method and system for tagging original data generated by things in the Internet of Things (IoT). The method includes: performing relativity detection on acquired Web messages to obtain Web messages related to various events; acquiring address information contained in the related Web messages; determining adjacent things for various events based on the acquired address information; and tagging original data generated by the adjacent things determined using at least partial content of the related Web messages as metadata. The system includes modules for carrying out the above method.

Method and system for tagging original data generated by things in the internet of things

In a method for making a recommendation for installing a software patch on a target computer, a computer identifies a first and a second set of computers from a group of computers. Each computer in the first set has hardware and software components, which are identical to each other or differ from each other by less than a predetermined measure. Each computer in the second set has hardware and software components, which are identical to each other or differ from each other by less than a predetermined measure. The computer selects one of the first and the second sets of computers such that the selected set of computers includes a higher number of computers with the software patch already installed.

Determining best practices for applying computer software patches

A method, and system employing the method, for service channel reconfiguration at a service outlet includes generating service transaction data of a service outlet, generating queue management system (QMS) data of the service outlet, and generating cost and profit data for the service outlet. Data is extracted from the service transaction data and the QMS data relating to specified parameters including customer experience data, and customer demand data. The service transaction data and the QMS data is integrated with the cost and profit data providing a unified objective function. Stochastic service processes and customer behavior data are modeled. The unified objective function is evaluated using the stochastic service processes and customer behavior data model, and the service channel function of the service outlet is reconfigured using the unified objective function.

Method and apparatus for optimal service channel reconfiguration based on multi-agent simulation

A method and system for determining highlighting colors for topic elements in a chart. The method includes acquiring contrast elements and topic elements which need to be highlighted, acquiring colors of the contrast elements and layout information of the topic elements and the contrast elements in the chart, determining a plurality of combinatorial contrast policies for the colors of the contrast elements according to a color contrast standard, calculating weights of the combinatorial contrast policies using the layout information, and determining highlighting colors of the topic elements according to the combinatorial contrast policies and their weights. A highlighting color can be selected automatically for the information that needs attention, so that the user can determine information that should be specially noted without having professional knowledge about color, saving time and energy.

Method for highlighting topic element and system thereof

A system and method of determining at least one location for a retail outlet in a region are described. The system and method use clustering technology for partitioning the region into a fixed number of sub-regions. Then, the system and method compute marginal increments from input data for each sub-region. The system and method choose a sub-region having a maximal marginal increment for a location of a first retail outlet.

Method and apparatus for outlet location selection using the market region partition and marginal increment assignment algorithm

Techniques are provided for processing a query using an index. It is determined whether a number of consecutive keys that evaluate to a false-positive when applying a screening predicate in the query exceeds a false-positive predefined value. One or more keys in the index are skipped in response to determining that the number of consecutive keys exceeds the false-positive predefined value.

System and article of manufacture for efficient evaluation of index screening predicates

Techniques are provided that determine that a query includes at least one subquery that may be correlated or decorrelated. An internal representation of the query that represents the subquery in both correlated and decorrelated form is generated, wherein the internal representation includes at least one virtual table.

Cost-based subquery correlation and decorrelation

Provided are a techniques for processing a query including semi-joins. At execution time, a next semi-join is selected from the semi-joins for execution in a current round of semi-join executions. A reporting threshold is determined that indicates a number of record-identifiers to be retrieved for the determined semi-join. The selected semi-join is executed until the determined number of record identifiers are retrieved.

Dynamic semi-join processing with runtime optimization

Method for efficient evaluation of index screening predicates

Growing community of inventors

Tangshan, China

Li Jun Xia