International Business Machines Corporation

Kumiko Maeda

Yutaka Oishi

Munetaka Ohtani

Jiayun Zhu

Chikafumi Yasumoto

Yoshinori Tahara

Takeo Yoshizawa

Hideaki Komatsu

Masana Murase

Junichi Kato

Yuriko Nishikawa

Munehiro Doi

Chiaki Oishi

Katsuhiko Hagiwara

Shuichi Shimizu

Ryo Imai

Yannan Chang

Hiroya Matsubara

Takaaki Fukai

Creation of a new block for a blockchain can be initiated. The new block can include a plurality of transactions. The blockchain can include a plurality of existing blocks. Transaction storage data can be generated for the new block. The transaction storage data can indicate the plurality of transactions and specify, for each of the plurality of transactions, which of a plurality of computing nodes are to keep the transaction in the new block. The generated transaction storage data can be added to the new block. The new block can be communicated to the plurality of computing nodes.

Redundancy reduction in blockchains

Test data may be generated by classifying a plurality of medical records of patients into a plurality of groups, based on at least an execution characteristic of a processing program that processes the medical records, and generating test data including at least a part of the plurality of medical records based on proportions of the number of the medical records classified into the plurality of groups.

Generation of test data for a data platform

Provided is a method for storing at least a portion of data registered in a blockchain in each of a plurality of node apparatuses, including selection of selecting whether to store data included in a block in one node apparatus among the plurality of node apparatuses, according to a characteristic of the one node apparatus; and data storage of storing at least a portion of the data included in the block in the one node apparatus, according to a result of the selection.

Blockchain technology

A system configured to rank and display candidate documents for human annotation task. The system executes instructions to receive a human annotation of a first unannotated document in a list of documents from a document set; update an annotated entities and corresponding entity types set based on the human annotation of the document from the document set; perform auto-mapping of annotated entities to corresponding entity types on a remaining set of documents in the document set based on the updated annotated entities and corresponding entity types set; calculate a score for each document in the remaining set of documents based on the auto-mapping of annotated entities; and update an order of the remaining set of documents being displayed for human annotation based on the calculated score for each document in the remaining set of documents in the document set.

Ranking candidate documents for human annotation task in real-time

An event transition model for producing test data may be generated from a plurality of event records, each event record including an event time of an instance, wherein the event transition model includes a plurality of states, each state corresponding to one or more instances of the plurality of event records, event transition probabilities between states, and event transition interval times between states.

Generation of event transition model from event records

In a mechanism for deleting blocks from a blockchain, a retention period (T), a minimum number of blocks (L), and a hash of the oldest block are defined. A participant node creates the new block including a block header. The participant node determines whether a timestamp in an oldest block in the blockchain is older than a current time plus T, and whether a current number of blocks in the blockchain is greater than or equal to L. When both are true, the participant node deletes an oldest block in the blockchain. The participant node adds a hash of an oldest remaining block and an original number of blocks of the blockchain to the block header of the new block. The participant node broadcasts a message announcing the new block to remaining participant nodes of the plurality of participant nodes.

Deletion of blocks in a blockchain

A technique of operating a system is provided that processes data with one or more data processing modules provided in parallel. A synchronization token is input into at least one data processing module that is in an operational state from the one or more data processing modules provided in parallel, in response to a request to change allocation of the data. The allocation of the data is changed to the one or more data processing modules provided in parallel, after the synchronization token is input. In response to the synchronization token having arrived at a data processing module at a later stage, the at least one data processing module, that stopped the processing, starts processing data after the synchronization token is input to the at least one data processing module.

Method for changing allocation of data using synchronization token

Traffic data while the system is in operation is collected for a certain time as a preprocess. Typical patterns are extracted from the collected traffic data. Next, stream programs are created for the individual typical patterns and stored for the future reference. Next, the IDs of alternative tasks for transition among different stream programs are stored. In actual system operation, the system measures traffic data regularly or at any time, compares the resultant patterns with the typical patterns, and selects a stream program corresponding to the closest typical pattern as the next phase. Program shutdown time when shifting from the stream program in the present phase to the next phase can be reduced by gradually shifting empty tasks in the present phase to the next stream program as alternative tasks in consideration of the cost of switching between tasks, the cost of transferring data among resources, and so on.

Computer system, method, and program

A method, system, and article of manufacture for solving ordinary differential equations described in a graphical model with nodes as blocks and dependencies as links using the processing of a computer with a plurality of processors. The method includes: generating segments of block with or without duplication for each block with an internal state and for each block without any output by traversing the graphical model from each block with an internal state to each block without any output; merging the segment to reduce duplication; compiling and converting each segment from the merged results in an executable code; and individually allocating the executable code for each segment to a plurality of processors for parallel execution.

Growing community of inventors

Tokyo, Japan

Kumiko Maeda