International Business Machines Corporation

Si Bin Fan

Su Liu

Cheng Xu

Yu Gu

Ping Xiao

Jia Zou

Peng Hui Jiang

Jun Zhang

Xiao Li

Juan Zhang

Serge Bourbonnais

Yan Wang

Li Li

Cheng Fang Wang

Xiao Lin Zhang

Wen Jun Yin

Yan Sun

Yan Xu

Xue Yong Zhang

Wei Liu

Jonathan D Dunne

Hui Li

Lin Sun

David Louis Kaminsky

Fang Wang

Yuan Wang

Hong Li

Wen Liu

Zhao Li

Jian Min Jiang

Jing Lu

Jiang Wu

Wei Li

Jun Zhou

Jing Cheng

Bo Li

Ting Chen

Tao Liu

Mai Zeng

Xiaolin Zhang

Li Xiang

Jonathan W Wierenga

Xiao Feng Guan

Hao Sheng

Xin Zheng

Jun Gao

Jinfan Zhu

Ting Xie

Wen Bing Li

Zhi Lin Hu

Hai He

Ge Liang

Hai Dong Zhang

Shi Wen Li

Zheng He Yang

Guo Qiang Li

Xiao Yan Tang

Rong Zhao

Jie Mao

Marlin R Deckert

Shan Yu

Chen Jiang

Jing Quan

Rong Xiang

Wei H Liu

Andrew Anthony Emmett

You Peng Huang

Tao G Liu

Jiong Fan

Hao Lian

Chang Zhi Gz Zhang

Jun Su

Miao Liu

Chih-Wen Su

Michael Baessler

Meng Wan

Li-Ju Chen

Yue Ma

Ling L Zhang

Qin Li

Jeffrey Alan Calcaterra

Ying Shen

Nan Chen

De Shuo Kong

Wu Song Fang

Dan Dan Zheng

Ju Ling Liu

Yan Rong Shen

Xiao Zhen Zhu

Li Na Wang

Ming Chi

Xing Jun Zhou

Shu Xia Cao

Yun Xiang

Bin Xiong

Xing Xing Jing

Qiang Song

Chang Ning Song

Zhi Dan Hao

Chang Zhi G Z Zhang

A first content and a second content of a first user are obtained. The second content is configured by the first user to be displayed to a second user instead of the first content. A familiarity degree between the first user and the second user are determined. A third content is generated based on the first content, the second content, and the familiarity degree. The third content is displayed to the second user.

Content display based on user relationship

An example operation may include one or more of generating an initial seed and allocating one or more authorized bits of the initial seed to a plurality of blocks in a distributed ledger, storing the initial seed and an identification of which authorized bits of the initial seed are allocated to each block of the distributed ledger, receiving a final seed value that is partially generated by each of a plurality of nodes configured to access the distributed ledger based on authorized bits of respective blocks updated by each respective node, and generating a random sequence value based on the final seed value and storing the random sequence value in a block of the distributed ledger.

Distributed ledger for generating and verifying random sequence

Systems and methods of the present disclosure provide techniques to locate target devices. An electronic message is sent to a set of landmark devices, signaling each landmark device to transmit echo-request packets to a target device and to other landmark devices and measure network-communication delays. Indications of the network-communication delays are received from the set landmark devices. A first sequence is formed by sorting the set of landmark devices relative to the network-communication delays between the target device and each landmark device. For each respective landmark device, an additional sequence is formed by sorting other landmark devices relative to the network-communication delays between the respective landmark device and the other landmark devices. A sequence-matching operation is applied to the first sequence and the additional sequences to form a ranking of the set of landmark devices relative to the target device.

IP address geo-position detection based on landmark sequencing

Automated personalized identifier switching is provided for switching personalized identifiers for individuals and groups. For this purpose, a system includes: a computer readable memory, and a computer readable storage medium located in a computer; program instructions to store a plurality of identifiers of a user in a database, wherein each of the identifiers has a different closeness factor of the user than other identifiers of a same type stored in the database; program instructions to determine a closeness factor of a contact to a user; program instructions to match the determined closeness factor of the contact with an identifier having the same closeness factor stored in an database; and program instructions to transmit the matched identifier from the database to the contact for display as an identifier of the user.

Automated personalized identifier switching in view of closeness

Automated personalized identifier switching is provided for switching personalized identifiers for individuals and groups. For this purpose, a method includes determining, by a computer device, a closeness factor of a contact to a user, matching, by the computer, the determined closeness factor of the contact with an identifier having the same closeness factor stored in a database comprised of a plurality of different types of identifiers of the user, and transmitting the matched identifier from the database to the contact to display as an identifier of the user, wherein at least two of the plurality of identifiers in the database have different closeness factors from one another.

Data collection is provided, in which one or more affected transactions related to one or more transaction exceptions are determined. Based on one or more features of the one or more affected transactions, one or more trace features are determined. Based on the one or more trace features, a data collection rule is generated. Data of a subsequent transaction complying with the data collection rule is collected.

Data collection in transaction problem diagnostic

Systems and methods of the present disclosure provide a way to pinpoint where a target device associated with an IP address is physically located within a geographical region. Network-communication delays between landmark devices and the target device are determined and used to generate sequences capturing relative delay relationships between the landmark devices and the target device. The sequences are used to determine a ranking via a sequence-matching approach. For each pair of landmark devices, a geographical boundary that divides the geographical region into a target partition and a second partition is determined. The target partition includes a first landmark device of the pair and the second partition includes a second landmark device of the pair. The target device is located where the target partitions for the pairs overlap. Network tomography can be applied to increase accuracy.

Disclosed embodiments provide techniques for intelligent media sharing with visualized positioning layout in real time. A floor plan is retrieved corresponding to the physical location of a sender electronic device. A zone boundary corresponding to the physical location of the sender electronic device is determined. A list of potential recipient electronic devices within the zone boundary is generated. A floor plan view is rendered on the sender electronic device. A graphical representation of the potential recipient electronic devices on the floor plan view is rendered, overlaid in a semi-transparent manner with a media selection interface on the sender electronic device. A selection is received for one or more media items using the media selection interface. A send request is received for one or more potential recipients, resulting in sending the one or more media items to at least one potential recipient in response to receiving a user interface request action.

Media sharing with visualized positioning layout in real time

The disclosure involves wireless electric power sharing between vehicles. A first vehicle sends a charging request, wherein the first vehicle is at least partially powered by a first on-board rechargeable electricity storage. The first vehicle receives a response to the charging request from a second vehicle which is at least partially powered by a second on-board rechargeable electricity storage, and a communication channel is established between the first and second vehicles. The first on-board rechargeable electricity storage is charged using energy stored in the second on-board rechargeable electricity storage and wirelessly transferred from the second vehicle to the first vehicle. The charging is controlled with information exchanged between the first and second vehicles over the communication channel.

Wireless electric power sharing between vehicles

In embodiments, a method includes: defining a plurality of visual icons; receiving a voice message, metadata and voice tagging criteria from a first client device; converting the voice message to text; generating a summary of the converted text; generating keywords based on the summary; categorizing the voice message into categories based on the keywords and the metadata; selecting visual icons based on the categories and the tagging criteria; tagging the voice message with the selected visual icons; and sending the tagged voice message to a second client device.

Voice message categorization and tagging

A method for verifying data consistency between update-in-place data structures and append-only data structures containing change histories associated with the update-in-place data structures is provided. The method includes loading data from an update-in-place data structure to a first set of hash buckets in a processing platform, loading data from append-only data structures to a second set of hash buckets in the processing platform, performing a bucket-level comparison between the data in the first set of hash buckets and the data in the second set of has buckets, and generating a report based on the bucket-level comparison.

Verifying data consistency

Provided are systems, methods, and media for concurrency conflict testing for shared resources. An example method includes identifying shared resources that are to be accessed by an application. Generating a plurality of concurrency test scenarios based on the shared resources. Analyzing a plurality of concurrency test cases to detect which concurrency test cases include a reference to the shared resources. Executing a concurrency test scenario. Performing the following while or before the concurrency test scenario is executing, obtaining analyzed concurrency test cases associated with the concurrency test scenario which referenced the shared resources, obtaining application modules pertaining to the obtained concurrency test cases, generating concurrency application modules by adding breakpoints to the obtained application modules, executing the obtained concurrency test cases until all of the obtained concurrency test cases are latched at the breakpoints, and simultaneously resuming the execution of the obtained concurrency test cases.

White box code concurrency testing for transaction processing

Systems, methods, and computer-readable media are described for implementing an active-active transaction protocol according to which multiple sites can each provide active services such as executing update transactions that insert, modify, or delete data records. An active-active transaction protocol utilizes affinity records corresponding to both transactions that have been received as well as the data records those transactions are updating to determine which site should handle execution of an incoming update transaction. An affinity record defines a relationship between a data record and a site that determines whether and where a transaction seeking to update that data record will be routed for processing. Conflict handling mechanisms are also provided by the active-active transaction protocol to ensure data consistency between the multiple sites.

Workload management across multiple data sites capable of providing active services

Automated devices send messages of a first batch sequence individually to a target queue of a receiving node of a cluster of server nodes, the messages having a different sequence number indicative of their relative positions within the batch sequence, and each is associated with a first logic unit of work identifier. In response to determining that a message counter meets a threshold, a force commit packet is generated to include the sequence number of the last batch message sent to the target queue. If the force commit packet sequence number is not the last position number within the batch sequence, a second logic unit of work identifier is associated with a subset sequence of the batch of messages having sequence numbers spanning from the first number to the force commit packet sequence number, and the subset sequence messages are committed to the receiving node target queue.

Proactive channel agent

Growing community of inventors

Beijing, China

Si Bin Fan