Patents by Inventor Noriko Satoh

Noriko Satoh 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: 6906644
    Abstract: A symbol string detection unit detects the second symbol string matching the first symbol string having a predetermined length n from input character strings. A matching length detection unit detects a matching length k between the third symbol string following the first symbol string and the fourth symbol string following the second symbol string. A coding unit codes an input symbol string based on the symbol string detected by the symbol string detection unit and the matching length k detected by the matching length detection unit.
    Type: Grant
    Filed: August 23, 2002
    Date of Patent: June 14, 2005
    Assignee: Fujitsu Limited
    Inventor: Noriko Satoh
  • Patent number: 6876774
    Abstract: The present invention provides a data compression method in which a plurality of consecutive characters of a data string to be compressed are set as a character string to be searched for. Bits of a bit string representing the set character string are allocated to at least two codewords. Thus, first and second searching codewords are generated. These first and second codewords are used as array addresses. First and second array tables are prepared, in which information on the past occurrence positions of the set character string is previously entered as the contents thereof. When the first and second codewords are generated from the character string to be compressed, the first and second array tables are looked up by using these codewords as the addresses of the arrays. When results of looking up these tables match with each other, it is found that the set character string occurred in the past.
    Type: Grant
    Filed: August 29, 2002
    Date of Patent: April 5, 2005
    Assignee: Fujitsu Limited
    Inventors: Noriko Satoh, Shigeru Yoshida
  • Patent number: 6871320
    Abstract: A tag information separating unit separates a tag identified from a character train stream and outputs as tag information. A tag code replacing unit arranges a tag code for identification to a position of the character train stream in which the tag was separated. A character train coding unit compression encodes the character train stream including a tag code which is outputted from the tag code replacing unit. A data reconstructing apparatus reconstructs the character train stream by the operation opposite to the compression.
    Type: Grant
    Filed: July 13, 1999
    Date of Patent: March 22, 2005
    Assignee: Fujitsu Limited
    Inventors: Takashi Morihara, Hironori Yahagi, Noriko Satoh
  • Patent number: 6834283
    Abstract: Words and word codes corresponding to the words are registered in advance. If an unregistered word appears when data are compressed, the code of the leading character of the word is divided into a plurality of parts in a specific size, a predetermined additional code is added to generate a code of the same length as the word code. Thus, the compressed data can be treated as fixed length codes. When the compressed data are decompressed, the code of an unregistered character is identified using this additional code.
    Type: Grant
    Filed: December 9, 1999
    Date of Patent: December 21, 2004
    Assignee: Fujitsu Limited
    Inventor: Noriko Satoh
  • Patent number: 6778103
    Abstract: A symbol string detection unit detects the second symbol string matching the first symbol string having a predetermined length n from input character strings. A matching length detection unit detects a matching length k between the third symbol string following the first symbol string and the fourth symbol string following the second symbol string. A coding unit codes an input symbol string based on the symbol string detected by the symbol string detection unit and the matching length k detected by the matching length detection unit.
    Type: Grant
    Filed: August 23, 2002
    Date of Patent: August 17, 2004
    Assignee: Fujitsu Limited
    Inventor: Noriko Satoh
  • Publication number: 20030102989
    Abstract: A symbol string detection unit detects the second symbol string matching the first symbol string having a predetermined length n from input character strings. A matching length detection unit detects a matching length k between the third symbol string following the first symbol string and the fourth symbol string following the second symbol string. A coding unit codes an input symbol string based on the symbol string detected by the symbol string detection unit and the matching length k detected by the matching length detection unit.
    Type: Application
    Filed: January 15, 2003
    Publication date: June 5, 2003
    Applicant: Fujitsu Limited
    Inventor: Noriko Satoh
  • Patent number: 6563956
    Abstract: The present invention provides a data compression method in which a plurality of consecutive characters of a data string to be compressed are set as a character string to be searched for. Bits of a bit string representing the set character string are allocated to at least two codewords. Thus, first and second searching codewords are generated. These first and second codewords are used as array addresses. Fist and second array tables are prepared, in which information on the past occurrence positions of the set character string is previously entered as the contents thereof. When the first and second codewords are generated from the character string to be compressed, the first and second array tables are looked up by using these codewords as the addresses of the arrays. When results of looking up these tables match with each other, it is found that the set character string occurred in the past.
    Type: Grant
    Filed: July 7, 1999
    Date of Patent: May 13, 2003
    Assignee: Fujitsu Limited
    Inventors: Noriko Satoh, Shigeru Yoshida
  • Patent number: 6563438
    Abstract: A symbol string detection unit detects the second symbol string matching the first symbol string having a predetermined length n from input character strings. A matching length detection unit detects a matching length k between the third symbol string following the first symbol string and the fourth symbol string following the second symbol string. A coding unit codes an input symbol string based on the symbol string detected by the symbol string detection unit and the matching length k detected by the matching length detection unit.
    Type: Grant
    Filed: August 23, 2002
    Date of Patent: May 13, 2003
    Assignee: Fujitsu Limited
    Inventor: Noriko Satoh
  • Patent number: 6549148
    Abstract: A symbol string detection unit detects the second symbol string matching the first symbol string having a predetermined length n from input character strings. A matching length detection unit detects a matching length k between the third symbol string following the first symbol string and the fourth symbol string following the second symbol string. A coding unit codes an input symbol string based on the symbol string detected by the symbol string detection unit and the matching length k detected by the matching length detection unit.
    Type: Grant
    Filed: September 13, 2001
    Date of Patent: April 15, 2003
    Assignee: Fujitsu Limited
    Inventor: Noriko Satoh
  • Patent number: 6542644
    Abstract: Provided is a probabilistic statistical data compression/restoration method for variable-length encoding a source character and restoring a variable-length code to a character using the probability of occurrence of the source character which appears following a character string (context) of n characters which immediately precede the source character. When variable-length encoding is performed, a context registration unit successively registers context based upon an entered character without fixing the length (degree) of context, and a compressing encoder selects registered context satisfying a predetermined condition, e.g., registered context for which the frequency of occurrence is greater than a fixed value, as context (encoding context) used in encoding, and variable-length encodes a source character by using this encoding context. A restoration unit restores a code to a character by executing processing which is the reverse of the processing executed by the compressing encoder.
    Type: Grant
    Filed: September 28, 1999
    Date of Patent: April 1, 2003
    Assignee: Fujitsu Limited
    Inventor: Noriko Satoh
  • Publication number: 20030049668
    Abstract: A novel mutation in the gyrase A gene involved in quinolon resistance phenotype acquisition of tubercle bacillus is identified and utilized to provide a method and kit for determining quinolon resistance of tubercle bacillus.
    Type: Application
    Filed: August 15, 2002
    Publication date: March 13, 2003
    Inventors: Yasuhiko Suzuki, Tatsuo Ichihara, Noriko Satoh
  • Patent number: 6529912
    Abstract: A data compressing technique and a data decompressing technique provide a compressing dictionary storing unit for storing a compressing dictionary usable when data to be compressed is compressed, a compressing dictionary use or non-use deciding unit for deciding whether the compressing dictionary is to be used or not when the data to be compressed is compressed, and a coding unit for coding the data to be compressed on the basis of the compressing dictionary when the compressing dictionary use or non-use deciding unit decides the compressing dictionary is to be used, whereas not coding but outputting the data to be compressed when the compressing dictionary use or non-use deciding unit decides the compressing dictionary is not to be used, thereby stably achieving a preferable compression ratio for a small quantity of data such as text data in a text file.
    Type: Grant
    Filed: June 12, 1998
    Date of Patent: March 4, 2003
    Assignee: Fujitsu Limited
    Inventors: Noriko Satoh, Takashi Morihara
  • Publication number: 20030020639
    Abstract: A symbol string detection unit detects the second symbol string matching the first symbol string having a predetermined length n from input character strings. A matching length detection unit detects a matching length k between the third symbol string following the first symbol string and the fourth symbol string following the second symbol string. A coding unit codes an input symbol string based on the symbol string detected by the symbol string detection unit and the matching length k detected by the matching length detection unit.
    Type: Application
    Filed: August 23, 2002
    Publication date: January 30, 2003
    Applicant: Fujitsu Limited
    Inventor: Noriko Satoh
  • Publication number: 20030001759
    Abstract: A symbol string detection unit detects the second symbol string matching the first symbol string having a predetermined length n from input character strings. A matching length detection unit detects a matching length k between the third symbol string following the first symbol string and the fourth symbol string following the second symbol string. A coding unit codes an input symbol string based on the symbol string detected by the symbol string detection unit and the matching length k detected by the matching length detection unit.
    Type: Application
    Filed: August 23, 2002
    Publication date: January 2, 2003
    Applicant: Fujitsu Limited
    Inventor: Noriko Satoh
  • Publication number: 20020196166
    Abstract: The present invention provides a data compression method in which a plurality of consecutive characters of a data string to be compressed are set as a character string to be searched for. Bits of a bit string representing the set character string are allocated to at least two codewords. Thus, first and second searching codewords are generated. These first and second codewords are used as array addresses. Fist and second array tables are prepared, in which information on the past occurrence positions of the set character string is previously entered as the contents thereof. When the first and second codewords are generated from the character string to be compressed, the first and second array tables are looked up by using these codewords as the addresses of the arrays. When results of looking up these tables match with each other, it is found that the set character string occurred in the past.
    Type: Application
    Filed: August 29, 2002
    Publication date: December 26, 2002
    Applicant: FUJITSU LIMITED
    Inventors: Noriko Satoh, Shigeru Yoshida
  • Publication number: 20020190877
    Abstract: A symbol string detection unit detects the second symbol string matching the first symbol string having a predetermined length n from input character strings. A matching length detection unit detects a matching length k between the third symbol string following the first symbol string and the fourth symbol string following the second symbol string. A coding unit codes an input symbol string based on the symbol string detected by the symbol string detection unit and the matching length k detected by the matching length detection unit.
    Type: Application
    Filed: August 23, 2002
    Publication date: December 19, 2002
    Applicant: Fujitsu Limited
    Inventor: Noriko Satoh
  • Patent number: 6392567
    Abstract: A character string of which a start point is each address of character string data in an input buffer is rearranged in the predetermined order, so that a rank list is generated. Next, the location of the matching candidate of a character string to be encoded is obtained on the basis of the rank list. Then, the character string to be encoded is compared with a matching candidate, thereby obtaining a matching length. Further, a code is generated using the location of the matching candidate and the matching length, and the code is output as compression data.
    Type: Grant
    Filed: January 22, 2001
    Date of Patent: May 21, 2002
    Assignee: Fijitsu Limited
    Inventor: Noriko Satoh
  • Publication number: 20020029206
    Abstract: A data compressing technique and a data decompressing technique provide a compressing dictionary storing unit for storing a compressing dictionary usable when data to be compressed is compressed, a compressing dictionary use or non-use deciding unit for deciding whether the compressing dictionary is to be used or not when the data to be compressed is compressed, and a coding unit for coding the data to be compressed on the basis of the compressing dictionary when the compressing dictionary use or non-use deciding unit decides the compressing dictionary is to be used, whereas not coding but outputting the data to be compressed when the compressing dictionary use or non-use deciding unit decides the compressing dictionary is not to be used, thereby stably achieving a preferable compression ratio for a small quantity of data such as text data in a text file or the like, besides achieving a high compression ratio for a data having different statistics.
    Type: Application
    Filed: June 12, 1998
    Publication date: March 7, 2002
    Inventors: NORIKO SATOH, TAKASHI MORIHARA
  • Publication number: 20020005792
    Abstract: A symbol string detection unit detects the second symbol string matching the first symbol string having a predetermined length n from input character strings. A matching length detection unit detects a matching length k between the third symbol string following the first symbol string and the fourth symbol string following the second symbol string. A coding unit codes an input symbol string based on the symbol string detected by the symbol string detection unit and the matching length k detected by the matching length detection unit.
    Type: Application
    Filed: September 13, 2001
    Publication date: January 17, 2002
    Applicant: FUJITSU LIMITED
    Inventor: Noriko Satoh
  • Patent number: 6320522
    Abstract: A symbol string detection unit detects the second symbol string matching the first symbol string having a predetermined length n from input character strings. A matching length detection unit detects a matching length k between the third symbol string following the first symbol string and the fourth symbol string following the second symbol string. A coding unit codes an input symbol string based on the symbol string detected by the symbol string detection unit and the matching length k detected by the matching length detection unit.
    Type: Grant
    Filed: August 11, 1999
    Date of Patent: November 20, 2001
    Assignee: Fujitsu Limited
    Inventor: Noriko Satoh