Patents by Inventor Takeo Yoshizawa

Takeo Yoshizawa 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: 8055589
    Abstract: A system for enabling verification in traceability of a supply chain while maintaining confidentiality of private suppliers. A group signature is applied to an undisclosed supplier. The undisclosed supplier previously receives registration to the certificate authority device, and performs a group signature based on the certificate issued by the certificate authority device. A disclosed supplier and the undisclosed supplier sign and generate a signature chain when they ship parts. A verifier device receives a signature chain with products shipped from the supplier manager device, divides a signature of the disclosed supplier from a signature chain, and verifies the undisclosed supplier from the group signature. Identification of the undisclosed supplier is performed by a third-party auditor system requested to do so by the verifier device by using a group private key.
    Type: Grant
    Filed: June 30, 2006
    Date of Patent: November 8, 2011
    Assignee: International Business Machines Corporation
    Inventors: Mika Saito, Yuji Watanabe, Madoka Yuriyama, Takeo Yoshizawa
  • Publication number: 20110225225
    Abstract: Each ordinary differential equation of simultaneous ordinary differential equations is solved with an embedded Runge-Kutta method. A difference ? between an N-th order approximation and an (N+1)th order approximation is computed, and it is determined whether the difference is smaller than a predetermined threshold ?0. If ???0, then a step size is determined using a predetermined computation formula containing ?0/?, and then the process proceeds to next computation. A strand having an error of ?>?0 is directed to execute recomputation using a step size calculated based on ?0/?. Then the strand having the error executes recomputation by using a computed interpolated value. When the strand's error becomes smaller than the threshold ?0 the strand reaches the same time step as the strands computing the other ordinary differential equations having no error. The process thereby proceeds to next computation of the whole simultaneous ordinary differential equations.
    Type: Application
    Filed: March 11, 2011
    Publication date: September 15, 2011
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Arquimedes Martinez Canedo, Hideaki Komatsu, Takeo Yoshizawa
  • Publication number: 20110209129
    Abstract: A parallelization method, system and program. A program expressed by a block diagram or the like is divided into strands and a balance in calculation time is made among the strands. The functional blocks are divided into strands and the strand involving the maximum calculation time from a strand set is found. One or more movable blocks in the strand involving the maximum calculation time is found. The next step is obtaining calculation time of each strand after the movable block is moved to the strand in the input or output direction according to its property, and moving the block to a strand most largely reducing the calculation time of the strand having the maximum calculation time before the movement. This process loops until calculation time is no longer reduced. Strands are then transformed into source codes. Source codes are compiled and assigned to separate cores or processors for execution.
    Type: Application
    Filed: February 22, 2011
    Publication date: August 25, 2011
    Applicant: International Business Machines Corporation
    Inventors: Hideaki Komatsu, Takeo Yoshizawa
  • Publication number: 20110131554
    Abstract: A method, system and computer program product for optimizing performance of an application running on a hybrid system. The method includes the steps of: selecting a first user defined operator from a library component within the application; determining at least one available hardware resource; generating at least one execution pattern for the first user defined operator based on the available hardware resource; compiling the execution pattern; measuring the execution speed of the execution pattern on the available hardware resource; and storing the execution speed and the execution pattern in an optimization table; where at least one of the steps is carried out using a computer device so that performance of said application is optimized on the hybrid system.
    Type: Application
    Filed: November 29, 2010
    Publication date: June 2, 2011
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Munehiro Doi, Hideaki Komatsu, Kumiko Maeda, Masana Murase, Takeo Yoshizawa
  • Publication number: 20110107162
    Abstract: A computer-implemented method, system, and article of manufacture for parallelizing a code configured by coupling a functional block having an internal state and a functional block without any internal state. The method includes: creating and storing a graphical representation where functional blocks are chosen as nodes and connections between functional blocks are chosen as links; visiting the nodes on the graphical representation sequentially, detecting inputs from functional blocks without any internal state to functional blocks having an internal state and storing these functional blocks as a set of use blocks, and detecting inputs from functional blocks having an internal state to functional blocks without any internal state and storing these functional blocks as a set of definition blocks; and forming strands of functional blocks based on information on the set of use blocks and information on the set of definition blocks stored in association with the functional blocks.
    Type: Application
    Filed: October 28, 2010
    Publication date: May 5, 2011
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Arquimedes Martinez Canedo, Hideaki Komatsu, Takeo Yoshizawa
  • Publication number: 20110083125
    Abstract: A unified parallelization table is formed by describing a process, to be executed, with a plurality of control blocks and edges connecting the control blocks; selecting highly predictable edges from the edges; identifying strongly-connected clusters; creating a parallelization table, having the entries of the number of processors, the costs thereof and corresponding clusters, for each node in the strongly-connected clusters and a non-strongly connected cluster between the strongly-connected clusters; creating a graph consisting of parallelization tables; converting the graph consisting of the parallelization tables into a series-parallel graph; and merging the parallelization tables for each serial path merging the parallelization tables for each parallel section. Then, based on the number of processors and the cost value in the unified parallelization table, a best entry is selected and an executable code to be allocated to each processor is generated.
    Type: Application
    Filed: October 6, 2010
    Publication date: April 7, 2011
    Applicant: International Business Machines Corporation
    Inventors: Hideaki Komatsu, Takeo Yoshizawa
  • Patent number: 7917513
    Abstract: The invention provides data processing, data control and information methods and systems for efficiently duplicating contents of a database in the data control system. An example of a data processing system includes: a cache unit acquiring, from a data control system which categorizes a plurality of data elements into a plurality of clusters and stores the plurality of clusters; a group-of-clusters update information acquisition unit for acquiring from the data control system group-of-clusters update information with respect to a group of clusters consisting of two or more clusters; a group-of-clusters update information computation unit for computing group-of-clusters update information with respect to the group of clusters based on two or more pieces of cluster update information; and an update judging unit for judging that a cached data element belonging to the group of clusters is the most updated one.
    Type: Grant
    Filed: August 7, 2008
    Date of Patent: March 29, 2011
    Assignee: International Business Machines Corporation
    Inventors: Yuji Watanabe, Takeo Yoshizawa, Masayuki Numao
  • Patent number: 7913093
    Abstract: A method and system for providing access to information on an article to which a tag is coupled. A local server reads the tag containing a virtual ID that includes an encryption of a bit string. The bit string includes an article ID containing a manufacturer ID. The local server is coupled to an ONS server, an ONS proxy server, and a PML server via a network. The local server sends to the ONS proxy server an ONS service request that includes the virtual ID and requests a network address of the PML server. The local server receives, from the ONS server, the network address of the PML server. The local server sends to the PML server, at the network address of the PML server, a PML information request that includes the virtual ID and requests article information. The local server receives, from the PML server, the article information.
    Type: Grant
    Filed: July 13, 2005
    Date of Patent: March 22, 2011
    Assignee: International Business Machines Corporation
    Inventors: Yoshinobu Ishigaki, Masayuki Numao, Yuji Watanabe, Madoka Yuriyama, Takeo Yoshizawa
  • Publication number: 20100299509
    Abstract: A computer-implemented pipeline execution system, method, and program product for executing loop processing in a multi-core or a multiprocessor computing environment, where the loop processing includes multiple function blocks in a multiple-stage pipeline manner. The system includes: a pipelining unit for pipelining the loop processing and assigning the loop processing to a computer processor or core; a calculating unit for calculating a first-order gradient term from a value calculated with the use of a predicted value of the input to a pipeline; and a correcting unit for correcting an output value of the pipeline with the value of the first-order gradient term.
    Type: Application
    Filed: May 18, 2010
    Publication date: November 25, 2010
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Jun Doi, Shuichi Shimizu, Takeo Yoshizawa
  • Publication number: 20100138810
    Abstract: Paralleling processing system and method. When clusters are formed based on strongly connected components, a single cluster (fat cluster) having at least a predetermined number of blocks, or an expected processing time exceeding a predetermined threshold, is formed. The fat cluster is subjected to an unrolling process to make multiple copies of the processing of the fat cluster and to assign the copies to individual processors. Processing of the fat cluster is executed by the multiple processor devices in a pipelined manner. If a fat cluster to be iteratively executed cannot be executed in the pipelined manner because a processing result of an nth iteration of the fat cluster depends on a processing result of a preceding iteration of the fat cluster an input value needed for execution of the fat cluster is generated based on a certain prediction, and the fat cluster is speculatively executed.
    Type: Application
    Filed: December 2, 2009
    Publication date: June 3, 2010
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Hideaki Komatsu, Arquimedes Martinez Canedo, Takeo Yoshizawa
  • Publication number: 20100106949
    Abstract: A method, system, and computer readable article of manufacture to enable parallel execution of a divided source code in a multiprocessor system. The method includes the steps of: inputting an original source code by an input device into the computing apparatus; finding a critical path in the original source code by a critical path cut module; cutting the critical path in the original source code into a plurality of process block groups by the critical path cut module; and dividing the plurality of process block groups among a plurality of processors in the multiprocessor system by a CPU assignment code generation module to produce the divided source code. The system includes an input device; a critical path cut module; and a CPU assignment code generation unit to produce the divided source code. The computer readable article of manufacture includes instructions to implement the method.
    Type: Application
    Filed: October 22, 2009
    Publication date: April 29, 2010
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Hideaki Komatsu, Takeo Yoshizawa
  • Publication number: 20100010933
    Abstract: A system for enabling verification in traceability of a supply chain while maintaining confidentiality of private suppliers. A group signature is applied to an undisclosed supplier. The undisclosed supplier previously receives registration to the certificate authority device, and performs a group signature based on the certificate issued by the certificate authority device. A disclosed supplier and the undisclosed supplier sign and generate a signature chain when they ship parts. A verifier device receives a signature chain with products shipped from the supplier manager device, divides a signature of the disclosed supplier from a signature chain, and verifies the undisclosed supplier from the group signature. Identification of the undisclosed supplier is performed by a third-party auditor system requested to do so by the verifier device by using a group private key.
    Type: Application
    Filed: August 5, 2009
    Publication date: January 14, 2010
    Applicant: International Business Machines Corporation
    Inventors: Mika Saito, Yuji Watanabe, Madoka Yuriyama, Takeo Yoshizawa
  • Publication number: 20090119632
    Abstract: A system and method which support determination of a design process order. The system includes: a storage device that stores constraint data indicating a strength of a constraint that is given to a respective design process from a respective of the other design processes; a detection unit that accesses the storage device to detect, from the constraint data, a loop of relationships concerning a design process receiving a constraint from another design process; a selection unit that accesses the storage device to select, from the detected loop, a pair capable of canceling the loop when the pair is deleted and having a minimum total constraint strength; and an output unit that deletes the selected constraint pair from the constraint data and outputs data indicating a constraint that is to be satisfied by each design process.
    Type: Application
    Filed: October 31, 2008
    Publication date: May 7, 2009
    Inventors: Makoto Kano, Akio Koide, Takayuki Osogami, Toshihiro Takahashi, Takeo Yoshizawa
  • Patent number: 7486289
    Abstract: A recognition model generation system of the invention includes means 18 for labeling edges and faces of an input three-dimensional shape, means 20 for generating shape restriction values, shape restriction means 22 for restricting shape recognition using generated shape restriction values, and means 24 for generating position coordinates of vertexes of a shape that can be derived by substituting the input three-dimensional shape with hexahedrons using output from the shape restriction means. The invention also provides a method for generating a recognition model a program for causing a computer to execute the method, a computer-readable medium storing the program thereon, and a structured mesh generation system.
    Type: Grant
    Filed: June 18, 2003
    Date of Patent: February 3, 2009
    Assignee: International Business Machines Corporation
    Inventors: Jun Doi, Keisuke Inoue, Atsushi Yamada, Takeo Yoshizawa
  • Publication number: 20080301198
    Abstract: The invention provides data processing, data control and information methods and systems for efficiently duplicating contents of a database in the data control system. An example of a data processing system includes: a cache unit acquiring, from a data control system which categorizes a plurality of data elements into a plurality of clusters and stores the plurality of clusters; a group-of-clusters update information acquisition unit for acquiring from the data control system group-of-clusters update information with respect to a group of clusters consisting of two or more clusters; a group-of-clusters update information computation unit for computing group-of-clusters update information with respect to the group of clusters based on two or more pieces of cluster update information; and an update judging unit for judging that a cached data element belonging to the group of clusters is the most updated one.
    Type: Application
    Filed: August 7, 2008
    Publication date: December 4, 2008
    Inventors: Yuji Watanabe, Takeo Yoshizawa, Masayuki Numao
  • Publication number: 20080201262
    Abstract: A system for enabling verification in traceability of a supply chain while maintaining confidentiality of private suppliers. A group signature is applied to an undisclosed supplier. The undisclosed supplier previously receives registration to the certificate authority device, and performs a group signature based on the certificate issued by the certificate authority device. A disclosed supplier and the undisclosed supplier sign and generate a signature chain when they ship parts. A verifier device receives a signature chain with products shipped from the supplier manager device, divides a signature of the disclosed supplier from a signature chain, and verifies the undisclosed supplier from the group signature. Identification of the undisclosed supplier is performed by a third-party auditor system requested to do so by the verifier device by using a group private key.
    Type: Application
    Filed: June 30, 2006
    Publication date: August 21, 2008
    Inventors: Mika Saito, Yuji Watanabe, Madoka Yuriyama, Takeo Yoshizawa
  • Patent number: 7331519
    Abstract: A signature device having an item selection input section which accepts a selection of a group of items formed by combining an item delivered from at least one supplier and an item generated by itself, a path verification information updating section which updates path verification information to verify a delivery route included in the signature information on the delivered item, a signature information preparation section which prepares new signature information from a signature prepared by itself and the updated path verification information with respect to the selected item group, and a signature information transmitting section which transmits the new signature information to the signature verification device. The signature verification device receives the new signature information and verifies the delivery routes for all the items included in the selected item group based on the new signature information.
    Type: Grant
    Filed: June 29, 2006
    Date of Patent: February 19, 2008
    Assignee: International Business Machines Corporation
    Inventors: Masayuki Numao, Yuji Watanabe, Takeo Yoshizawa, Madoka Yuriyama
  • Publication number: 20080033700
    Abstract: An impact of a change in design information is defined as a sum of an additional work amount that must be reworked in each design process referring to the design information. At a time of requesting an impact analysis of a design change, all processes referring to certain design information to be changed are extracted from a project monitoring unit. An impact of the change in the referred design information on each extracted process is calculated. With respect to design information created on the basis of the referred design information in each extracted process, the maturity levels at a time when the process makes a reference and at a time when the reference design information is changed are obtained. Then, the difference therebetween is determined as the work amount that may possibly become useless.
    Type: Application
    Filed: July 27, 2007
    Publication date: February 7, 2008
    Applicant: International Business Machines Corporation
    Inventors: Makoto Kano, Akio Koide, Mika Saito, Takeo Yoshizawa
  • Publication number: 20070226145
    Abstract: A method and system for providing access to information on an article to which a tag is coupled. A local server reads the tag containing a virtual ID that includes an encryption of a bit string. The bit string includes an article ID containing a manufacturer ID. The local server is coupled to an ONS server, an ONS proxy server, and a PML server via a network. The local server sends to the ONS proxy server an ONS service request that includes the virtual ID and requests a network address of the PML server. The local server receives, from the ONS server, the network address of the PML server. The local server sends to the PML server, at the network address of the PML server, a PML information request that includes the virtual ID and requests article information. The local server receives, from the PML server, the article information.
    Type: Application
    Filed: July 13, 2005
    Publication date: September 27, 2007
    Inventors: Yoshinobu Ishigaki, Masayuki Numao, Yuji Watanabe, Madoka Yuriyama, Takeo Yoshizawa
  • Publication number: 20070034687
    Abstract: A signature device having an item selection input section which accepts a selection of a group of items formed by combining an item delivered from at least one supplier and an item generated by itself, a path verification information updating section which updates path verification information to verify a delivery route included in the signature information on the delivered item, a signature information preparation section which prepares new signature information from a signature prepared by itself and the updated path verification information with respect to the selected item group, and a signature information transmitting section which transmits the new signature information to the signature verification device. The signature verification device receives the new signature information and verifies the delivery routes for all the items included in the selected item group based on the new signature information.
    Type: Application
    Filed: June 29, 2006
    Publication date: February 15, 2007
    Applicant: International Business Machines Corporation
    Inventors: Masayuki Numao, Yuji Watanabe, Takeo Yoshizawa, Madoka Yuriyama