Patents by Inventor Kiyoshi Takemura
Kiyoshi Takemura 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: 9943926Abstract: The present invention provides a press-fit joining apparatus 100 where two collet-chuck-type electrodes (first collet-chuck-type electrode 160 and second collet-chuck-type electrode 170) are held using a die set structural body 130 and a sub platen structural body 140. According to the press-fit joining apparatus 100 of the present invention, it is possible to manufacture a product which is required to have higher coaxiality and higher joining strength than conventional products (for example, products such as a drive force transmitting part, the manufacture of which requires the supply of a large and uniform electric current to a joining portion).Type: GrantFiled: January 21, 2014Date of Patent: April 17, 2018Assignee: TK CO., LTD.Inventors: Kazuyoshi Harada, Koji Harada, Kiyoshi Takemura, Akira Nozue
-
Publication number: 20160271723Abstract: The present invention provides a press-fit joining apparatus 100 where two collet-chuck-type electrodes (first collet-chuck-type electrode 160 and second collet-chuck-type electrode 170) are held using a die set structural body 130 and a sub platen structural body 140. According to the press-fit joining apparatus 100 of the present invention, it is possible to manufacture a product which is required to have higher coaxiality and higher joining strength than conventional products (for example, products such as a drive force transmitting part, the manufacture of which requires the supply of a large and uniform electric current to a joining portion).Type: ApplicationFiled: January 21, 2014Publication date: September 22, 2016Inventors: Kazuyoshi HARADA, Koji HARADA, Kiyoshi TAKEMURA, Akira NOZUE
-
Patent number: 9043676Abstract: Data is compressed using content addressable memory without disruption despite error using a plurality of content addressable memories to detect sequentially repeating data elements of the data. Compression information is generated for each sequence of repeating data elements that repeat for at least a compression threshold without any one of the plurality of content addressable memories generating an indication of an error for a matching content addressable memory entry. Individual data elements are output for each of the data elements that do not repeat for the compression threshold. Compression information is generated for each sequence of repeating data elements that repeat for at least the compression threshold and then generating a currently searched data element that matches the repeating data elements when any one of the plurality of content addressable memories generates an indication of an error for a content addressable memory entry that matches the currently searched data element.Type: GrantFiled: October 4, 2011Date of Patent: May 26, 2015Assignee: International Business Machines CorporationInventors: Nishino Kiyoshi, Tadayuki Okada, Kiyoshi Takemura, Nobuyoshi Tanaka
-
Patent number: 8947272Abstract: A method for decoding encoded data includes receiving data encoded by replacing each of a plurality of characters with bit strings. The method also includes recording, on the basis of definition information, at least one of the characters as corresponding to each of the bit lengths, and generating decode information based on the number of characters, wherein the decode information includes bit string information for sorting the bit strings in a bit length order that is a predetermined order associated with bit lengths. The method also includes, in response to receiving a particular bit length, generating character information in which the characters are sorted in the bit length order by inserting a character corresponding to the particular bit length into a position corresponding to the particular bit length in an array in which at least one of the bit lengths.Type: GrantFiled: November 6, 2012Date of Patent: February 3, 2015Assignee: International Business Machines CorporationInventors: Kiyoshi Takemura, Nobuyoshi Tanaka, Makoto Ogawa, Tadayuki Okada
-
Patent number: 8677079Abstract: An apparatus and method are provided for selecting a specific position from a plurality of positions in a memory to which data elements are cyclically written. A specific data element is stored in the plurality of positions. The apparatus comprises a determination unit for determining whether the plurality of positions include any position in a specific area of the memory to which data elements are written in a current cycle. The apparatus further comprises a selection unit for selecting at least one position in the specific area out of the plurality of positions as the specific position if the determination unit determines that the plurality of positions include any position in the specific area, and for selecting at least one position out of the plurality of positions as the specific position if the determination unit determines that the plurality of positions do not include any position in the specific area.Type: GrantFiled: May 6, 2010Date of Patent: March 18, 2014Assignee: International Business Machines CorporationInventors: Kiyoshi Nishino, Kiyoshi Takemura, Nobuyoshi Tanaka
-
Publication number: 20130283135Abstract: Data is compressed using content addressable memory without disruption despite error using a plurality of content addressable memories to detect sequentially repeating data elements of the data. Compression information is generated for each sequence of repeating data elements that repeat for at least a compression threshold without any one of the plurality of content addressable memories generating an indication of an error for a matching content addressable memory entry. Individual data elements are output for each of the data elements that do not repeat for the compression threshold. Compression information is generated for each sequence of repeating data elements that repeat for at least the compression threshold and then generating a currently searched data element that matches the repeating data elements when any one of the plurality of content addressable memories generates an indication of an error for a content addressable memory entry that matches the currently searched data element.Type: ApplicationFiled: October 4, 2011Publication date: October 24, 2013Applicant: International Business Machines CorporationInventors: Nishino Kiyoshi, Tadayuki Okada, Kiyoshi Takemura, Nobuyoshi Tanaka
-
Patent number: 8542137Abstract: Data encoded by replacing each of a plurality of characters with bit strings is received. On the basis of definition information, at least one of the characters is recorded as corresponding to each of the bit lengths, and decode information is generated based on the number of characters, wherein the decode information includes bit string information for sorting the bit strings in a bit length order that is a predetermined order associated with bit lengths. In response to receiving a particular bit length, character information in which the characters are sorted in the bit length order is generated by inserting a character corresponding to the particular bit length into a position corresponding to the particular bit length in an array in which at least one of the bit lengths.Type: GrantFiled: December 7, 2011Date of Patent: September 24, 2013Assignee: International Business Machines CorporationInventors: Kiyoshi Takemura, Nobuyoshi Tanaka, Makoto Ogawa, Tadayuki Okada
-
Publication number: 20120139763Abstract: A method for decoding encoded data. The method includes receiving data encoded by replacing each of a plurality of characters with bit strings. The method also includes recording, on the basis of definition information, at least one of the characters as corresponding to each of the bit lengths, and generating decode information based on the number of characters, wherein the decode information includes bit string information for sorting the bit strings in a bit length order that is a predetermined order associated with bit lengths. The method also includes, in response to receiving a particular bit length, generating character information in which the characters are sorted in the bit length order by inserting a character corresponding to the particular bit length into a position corresponding to the particular bit length in an array in which at least one of the bit lengths.Type: ApplicationFiled: December 7, 2011Publication date: June 7, 2012Applicant: International Business Machines CorporationInventors: Kiyoshi Takemura, Nobuyoshi Tanaka, Makoto Ogawa, Tadayuki Okada
-
Patent number: 8018359Abstract: Various embodiments are provided to reduce a processing time taken when plural bit lengths each assigned to plural strings are converted into plural codes. In one exemplary embodiment, in response to input of the plurality of bit lengths, a number of strings assigned each of the bit lengths, a bit length assigned to each of the strings, and a sequence number of each string in a group of strings assigned each of the bit lengths are recorded. A plurality of base codes are generated on the basis of the numbers of the strings recorded by the recording unit, the base codes each being a code used as a base for codes having the same one of the bit lengths. A plurality of codes is generated by performing in parallel a plurality of processes respectively for the plurality of strings.Type: GrantFiled: April 2, 2010Date of Patent: September 13, 2011Assignee: International Business Machines CorporationInventors: Makoto Ogawa, Tadayuki Okada, Kiyoshi Takemura, Nobuyoshi Tanaka
-
Publication number: 20100293344Abstract: An apparatus and method are provided for selecting a specific position from a plurality of positions in a memory to which data elements are cyclically written. A specific data element is stored in the plurality of positions. The apparatus comprises a determination unit for determining whether the plurality of positions include any position in a specific area of the memory to which data elements are written in a current cycle. The apparatus further comprises a selection unit for selecting at least one position in the specific area out of the plurality of positions as the specific position if the determination unit determines that the plurality of positions include any position in the specific area, and for selecting at least one position out of the plurality of positions as the specific position if the determination unit determines that the plurality of positions do not include any position in the specific area.Type: ApplicationFiled: May 6, 2010Publication date: November 18, 2010Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Kiyoshi Nishino, Kiyoshi Takemura, Nobuyoshi Tanaka
-
Publication number: 20100265110Abstract: Various embodiments are provided to reduce a processing time taken when plural bit lengths each assigned to plural strings are converted into plural codes. In one exemplary embodiment, in response to input of the plurality of bit lengths, a number of strings assigned each of the bit lengths, a bit length assigned to each of the strings, and a sequence number of each string in a group of strings assigned each of the bit lengths are recorded. A plurality of base codes are generated on the basis of the numbers of the strings recorded by the recording unit, the base codes each being a code used as a base for codes having the same one of the bit lengths. A plurality of codes is generated by performing in parallel a plurality of processes respectively for the plurality of strings.Type: ApplicationFiled: April 2, 2010Publication date: October 21, 2010Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Makoto OGAWA, Tadayuki OKADA, Kiyoshi TAKEMURA, Nobuyoshi TANAKA
-
Patent number: 6850682Abstract: A resin composition for an optical fiber is provided which can be sufficiently cured even in high-speed processing (at a low light energy dose) to obtain a cured article having a Young's modulus suitable for use for an optical fiber, and also causes neither increase in viscosity nor deposition of solids in storage for a long period or in storage at a high temperature and can be easily coated even after such storage. A coated fiber and an optical fiber unit, which use the resin composition are also provided.Type: GrantFiled: December 23, 2002Date of Patent: February 1, 2005Assignee: Dainippon Ink and Chemicals, Inc.Inventors: Kiyoshi Takemura, Akihiro Iwamoto, Osamu Saitou
-
Publication number: 20030138231Abstract: A resin composition for an optical fiber is provided which can be sufficiently cured even in high-speed processing (at a low light energy dose) to obtain a cured article having a Young's modulus suitable for use for an optical fiber, and also causes neither increase in viscosity nor deposition of solids in storage for a long period or in storage at a high temperature and can be easily coated even after such storage. A coated fiber and an optical fiber unit, which use the resin composition are also provided.Type: ApplicationFiled: December 23, 2002Publication date: July 24, 2003Applicant: Dainippon Ink and Chemicals, Inc.Inventors: Kiyoshi Takemura, Akihiro Iwamoto, Osamu Saitou
-
Patent number: 5600347Abstract: A system for horizontal expansion of low resolution display modes onto high resolution displays including flat panels at a variable scaling factor is disclosed. The system may be combined with known methods for vertical expansion to allow low resolution display modes to be expanded onto any high resolution display. Two different methods are provided, one for graphics modes and one for text modes, to attain better screen image quality. In the first method, a first pixel data sequence to be expanded is first oversampled at a multiple of the frequency thereof to produce an intermediate oversampled data sequence. The oversampled data sequence is linearly decimated by a factor of less than unity to produce a replicated second data sequence longer than the first, which is then displayed.Type: GrantFiled: December 30, 1993Date of Patent: February 4, 1997Assignee: International Business Machines CorporationInventors: Stephen P. Thompson, Masaki Oie, Akihiro Ogura, Kiyoshi Takemura, Joseph D. Harwood