Patents by Inventor Masao Nagasaki

Masao Nagasaki has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Patent number: 11544350
    Abstract: A Fisher's exact test calculation apparatus includes: a condition storage 1 that has stored therein a condition for determining whether a result of Fisher's exact test corresponding to input is significant or not, the input being frequencies in a summary table; and a calculation unit 2 that obtains the result of Fisher's exact test corresponding to the frequencies in the summary table by inputting the frequencies in the summary table to the condition read from the condition storage 1.
    Type: Grant
    Filed: June 30, 2017
    Date of Patent: January 3, 2023
    Assignees: NIPPON TELEGRAPH AND TELEPHONE CORPORATION, TOHOKU UNIVERSITY
    Inventors: Koji Chida, Satoshi Hasegawa, Koki Hamada, Masao Nagasaki, Kazuharu Misawa
  • Patent number: 11081024
    Abstract: Fisher's exact test is efficiently computed through secure computation. It is assumed that a, b, c and d are frequencies of a 2×2 contingency table, [a], [b], [c] and [d] are secure texts of the respective frequencies a, b, c and d, and N is an upper bound satisfying a+b+c+dN. A reference frequency computation part computes a secure text ([a0], [b0], [c0], [d0]) of a combination of reference frequencies (a0, b0, c0, d0) which are integers satisfying a0+b0=a+b, c0+d0=c+d, a0+c0=a+c, and b0+d0=b+d. A number-of-patterns determination part determines integers h0 and h1 satisfying h0?h1. A pattern computation part computes [ai]=[a0]+i, [bi]=[b0]?i, [ci]=[c0]?i and [di]=[d0]+i for i=h0, . . . , h1, and obtains a set S={([ai], [bi], [ci], [di])}i of secure texts of combinations of frequencies (ai, bi, ci, di).
    Type: Grant
    Filed: June 30, 2017
    Date of Patent: August 3, 2021
    Assignees: NIPPON TELEGRAPH AND TELEPHONE CORPORATION, TOHOKU UNIVERSITY
    Inventors: Koki Hamada, Koji Chida, Satoshi Hasegawa, Masao Nagasaki, Kazuharu Misawa
  • Publication number: 20190340215
    Abstract: A Fisher's exact test calculation apparatus includes: a condition storage 1 that has stored therein a condition for determining whether a result of Fisher's exact test corresponding to input is significant or not, the input being frequencies in a summary table; and a calculation unit 2 that obtains the result of Fisher's exact test corresponding to the frequencies in the summary table by inputting the frequencies in the summary table to the condition read from the condition storage 1.
    Type: Application
    Filed: June 30, 2017
    Publication date: November 7, 2019
    Applicants: NIPPON TELEGRAPH AND TELEPHONE CORPORATION, TOHOKU UNIVERSITY
    Inventors: Koji CHIDA, Satoshi HASEGAWA, Koki HAMADA, Masao NAGASAKI, Kazuharu MISAWA
  • Publication number: 20190163722
    Abstract: A Fisher's exact test calculation apparatus includes a selection unit that selects summary tables for which a result of Fisher's exact test indicative of being significant will be possibly obtained from among a plurality of summary tables based on a parameter obtained in calculation in course of determining the result of Fisher's exact test, and a calculation unit that performs calculations for Fisher's exact test for each of the selected summary tables.
    Type: Application
    Filed: June 30, 2017
    Publication date: May 30, 2019
    Applicants: NIPPON TELEGRAPH AND TELEPHONE CORPORATION, TOHOKU UNIVERSITY
    Inventors: Satoshi HASEGAWA, Koki HAMADA, Koji CHIDA, Masao NAGASAKI, Kazuharu MISAWA
  • Publication number: 20190156705
    Abstract: Fisher's exact test is efficiently computed through secure computation. It is assumed that a, b, c and d are frequencies of a 2×2 contingency table, [a], [b], [c] and [d] are secure texts of the respective frequencies a, b, c and d, and N is an upper bound satisfying a+b+c+d?N. A reference frequency computation part 12 computes a secure text ([a0], [b0], [c0], [d0]) of a combination of reference frequencies (a0, b0, c0, d0) which are integers satisfying a0+b0=a+b, c0+d0=c+d, a0+c0=a+c, and b0+d0=b+d. A number-of-patterns determination part 13 determines integers h0 and h1 satisfying h0?h1. A pattern computation part 14 computes [ai]=[a0]+i, [bi]=[b0]?i, [ci]=[c0]?i and [di]=[d0]+i for i=h0, . . . , h1, and obtains a set S={([ai], [bi], [ci], [di])}i of secure texts of combinations of frequencies (ai, bi, ci, di).
    Type: Application
    Filed: June 30, 2017
    Publication date: May 23, 2019
    Applicants: NIPPON TELEGRAPH AND TELEPHONE CORPORATION, TOHOKU UNIVERSITY
    Inventors: Koki HAMADA, Koji CHIDA, Satoshi HASEGAWA, Masao NAGASAKI, Kazuharu MISAWA
  • Publication number: 20170351805
    Abstract: It is an invention aimed at providing methods for optimizing read information mapped to the particular gene loci such as MHC loci under a framework of probabilistic statistical processing. In the present invention, a step in which for all reads, calculation of the expected number of mappings to alleles of the particular gene loci is performed for read information in which mapping of reads to alleles of the particular gene loci is identified, a step in which the total number of expected mappings for each allele is calculated, and a step in which the fraction of reads allocated to each allele is calculated, are repeatedly executed, in which the optimization of read information is performed in a computer, and based on the optimized information, a method of easily and accurately estimating the genotypes of the particular gene loci, a computer system, and a computer program capable of easily and accurately estimating the genotype of the particular gene loci, are provided.
    Type: Application
    Filed: December 25, 2015
    Publication date: December 7, 2017
    Applicant: NATIONAL UNIVERSITY CORPORATION TOHOKU UNIVERSITY
    Inventors: Masao NAGASAKI, Naoki NARIAI, Kaname KOJIMA
  • Publication number: 20170147745
    Abstract: The present invention provides a selection method of tag SNPs, for constituting a group of nucleic acid probes corresponding to the tag SNPs, the tag SNPs being used for performing imputation of information on SNPs of human genome by using human genome information, the human genome information including information on a group of SNPs, the genotypes of the SNPs being identified in multiple individuals, in which method a sum of mutual informations between tag SNP candidates and target SNPs is used as an index for selecting the tag SNPs, and a computer system based on the principle, a computer program, and a DNA microarray on which nucleic probes corresponding to the tag SNPs selected by the means, and a production method thereof.
    Type: Application
    Filed: June 19, 2015
    Publication date: May 25, 2017
    Applicant: National University Corporation Tohoku University
    Inventors: Masao NAGASAKI, Kaname KOJIMA, Naoki NARIAI, Takahiro MIMORI, Yosuke KAWAI
  • Patent number: 3943578
    Abstract: The apparatus comprises a throttle valve comprising an upper cylindrical resilient deformable membrane having an upper flange at the upper end thereof and a lower cylindrical resilient deformable membrane having a lower flange at the lower end thereof and connected at its upper end to the lower end of the upper cylindrical membrane by a central flange. The upper flange is secured to the upper wall portion of the outer wall of the apparatus and the lower flange is secured to the lower wall portion of the outer wall with either one of the upper and lower cylindrical membranes being twisted by 180.degree. about its longitudinal axis so that the twisted membrane is closed. The upper end of the throttle valve is attached to the hole discharge of the lavatory bowl while the lower end is located above the excrement reservoir.
    Type: Grant
    Filed: August 14, 1974
    Date of Patent: March 16, 1976
    Assignee: Nepon Kabushiki Kaisha (Nepon Inc.)
    Inventors: Masami Miya, Masao Nagasaki, Shuichi Harada