International Business Machines Corporation

Shu Tezuka

Syoiti Ninomiya

Norishige Morimoto

Kazuo Iwano

Hiroki Murata

Yasuhiko Morimoto

Kazuyoshi Hidaka

Shinji Misono

Protects a highly confidential parameter against leakage in a distributed computing system. An example distributed computing system causing a plurality of partial calculations to be performed includes parameter storage for storing a parameter set having a plurality of parameters, conversion means for converting a linear parameter, sending means for sending each of converted parameter sets in association with parameter identifying information for identifying the parameter set to cause each of a plurality of calculation processing devices to perform each of a plurality of partial calculations, conversion ratio storage means for storing a conversion ratio of a parameter, conversion ratio searching means for searching for a conversion ratio corresponding to a parameter identifying information, and inversion outputting means for generating a partial calculation result by multiplying a calculation result by an inverse number of the conversion ratio and for outputting a set of the partial calculation results.

Calculating financial risk of a portfolio using distributed computing

It is one object of the present invention to perform regional optimization while taking spatial continuity into account, and to provide higher-level spatial data mining. [Constitution] A region calculation method for introducing a two-dimensional association rule, extracted from a database, that includes spatial information, such as addresses, and for applying the two-dimensional association rule for a map, comprises the steps of: defining an objective function that is used to introduce the two-dimensional association rule and that does not include regional information for which an output request has been submitted; dividing a region on the map into pixel grids having a predetermined size to form buckets (S); aggregating data available in the database for each bucket (S); employing the objective function to calculate a region for the optimization of the objective function (S); extracting entities, appearing on the map, that correspond to the obtained region (S); and employing the extracted entities to output a region that is applied for the map.

Region calculation method, spatial data mining apparatus, geographical information display apparatus, spatial data mining system and storage medium

A method for hiding message information into media information in frequency space. The data hiding method has high resistance to removal or change of message information embedded into media information and effectively maintain hidden message information even when signal processing is performed by employing a frequency filter. More specifically, in order to hide message information (m) into media information (M), the frequency transform of the message information (m) and the media information (M) are performed, and frequency spectra f,and f,are obtained. Next, from the frequency spectrum f,of the message information (m), a region containing feature frequency components representative of the features of the message information (m) in real space is extracted as the base region B. Then, n copies of the base region B are generated, and in frequency space, the n copies are dispersedly arranged.

Method for hiding message data into media data and a method for extracting that hidden data

Quasi-random number generation apparatus and method, and multiple

A method and system are provided for generating a low-discrepancy sequence at high speed, comprising means for expanding an i-th coordinate value u.sub.n.sup.(i) (1.ltoreq.i.ltoreq.k) of an n-th element of the low-discrepancy sequence (u.sub.n.sup.i, . . . , u.sub.n.sup.(k)) in b scale, and storing m components created by the expansion of each value in sequence into a first storage means, wherein the above n is an integer equal to or more than 1 and the above b is a prime number equal to or more than k; means for expanding the number n in b scale, and storing the created expansion (n.sub.m, n.sub.m-1, . . . , n.sub.1) in sequence into a second storage means; means for scanning the second storage means in sequence, and detecting a minimum order j wherein nj is not equal to b-1; and means, respondent to the means for scanning, for reading out j-th row components of a low-discrepancy generator matrix T.sup.(i) stored in advance for an i-th coordinate value (1.ltoreq.i.ltoreq.k) of the element of the low-discrepancy sequence and the components created by the expansion of the i-th coordinate value of the element of the low-discrepancy sequence in sequence, and adding the j-th row components to the components created by said expansion read out in the same order in modulo b, and storing the result of the addition in sequence into a third storage means.

Method and apparatus for generating low-discrepancy sequence, as well as

To allow automatic determination of the order of drilling in slot drilling. The positions of holes located along a line are described via a binary vector. The order of drilling is also described via a binary vector. The former binary vector is made to correspond to the latter binary vector through a conversion matrix, where every corresponding partial matrix is regular. The positions of the holes are determined from the drilling order, or the drilling order is determined from the positions of the holes by their correspondence.

Apparatus and method of drilling

A pseudorandom number generator includes:

Growing community of inventors

Chigasaki, Japan

Shu Tezuka