Patents by Inventor Shinichi Honiden
Shinichi Honiden 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: 11144565Abstract: An information extraction apparatus includes, a controller extracting, as variable elements, parts different between a plurality of structured documents and extract, as peripheral information pieces, elements within a predetermined range from the respective variable elements, and a storage unit storing the variable elements and the peripheral information pieces with respect to at least an extraction object which is at least one of the variable elements.Type: GrantFiled: December 14, 2015Date of Patent: October 12, 2021Assignee: INTER-UNIVERSITY RESEARCH INSTITUTE CORPORATION RESEARCH ORGANIZATION OF INFORMATION AND SYSTEMSInventors: Kazunori Sakamoto, Shinichi Honiden
-
Publication number: 20180018378Abstract: An information extraction apparatus includes, a controller extracting, as variable elements, parts different between a plurality of structured documents and extract, as peripheral information pieces, elements within a predetermined range from the respective variable elements, and a storage unit storing the variable elements and the peripheral information pieces with respect to at least an extraction object which is at least one of the variable elements.Type: ApplicationFiled: December 14, 2015Publication date: January 18, 2018Applicant: INTER-UNIVERSITY RESEARCH INSTITUTE CORPORATION ORGANIZATION OF INFORMATION AND SYSTEMSInventors: Kazunori SAKAMOTO, Shinichi HONIDEN
-
Patent number: 7248947Abstract: A technique to provide an information-sharing system and the like is disclosed. According to this technique, there are provided an on-board information terminal to transmit one or more types of information among a vehicle information relating to user's own vehicle and on-board program information to acquire shared information, an area information acquiring system for acquiring area information, and an information-sharing server for calculating time function existing quantity based on time function according to one or more types of information among vehicle information and area information, calculates time function transmission quantity based on time function including the calculated time function existing quantity, arranges the calculated time function existing quantity and the time function transmission quantity to a corresponding position on a map, attaches the map information to the on-board program information, and transmits it to the on-board information terminal.Type: GrantFiled: March 22, 2005Date of Patent: July 24, 2007Assignee: Denso IT Laboratory, Inc. and Research Organization of Information and Systems of C/O National Institute of InformaticsInventors: Hiroshi Sasaki, Hirotoshi Iwasaki, Osamu Masutani, Shinichi Honiden, Nobukazu Yoshioka, Yasushi Ando
-
Publication number: 20060178788Abstract: A technique to provide an information-sharing system and the like is disclosed. According to this technique, there are provided an on-board information terminal to transmit one or more types of information among a vehicle information relating to user's own vehicle and on-board program information to acquire shared information, an area information acquiring system for acquiring area information, and an information-sharing server for calculating time function existing quantity based on time function according to one or more types of information among vehicle information and area information, calculates time function transmission quantity based on time function including the calculated time function existing quantity, arranges the calculated time function existing quantity and the time function transmission quantity to a corresponding position on a map, attaches the map information to the on-board program information, and transmits it to the on-board information terminal.Type: ApplicationFiled: March 22, 2005Publication date: August 10, 2006Applicants: DENSO IT LABORATORY, INC, Research Organization of Information and Systems of C/O National Institute of InformaticsInventors: Hiroshi Sasaki, Hirotoshi Iwasaki, Osamu Masutani, Shinichi Honiden, Nobukazu Yoshioka, Yasushi Ando
-
Patent number: 6925486Abstract: A planning means generates a plan to be executed by agents on a node. In the case where the plan generated uses an uncertain knowledge required to be processed in other nodes, a judging means judges the communication line connecting the node and a network is low or high in reliability. In the case where the reliability of the communication line is low, an agent management unit moves the agent for executing the plan to another node for processing the uncertain knowledge. In the case where the reliability of the communication line is high, on the other hand, a cooperation protocol realization means requests an agent on another node to process the uncertain knowledge. An agent execution means executes the plan generated.Type: GrantFiled: March 21, 2003Date of Patent: August 2, 2005Assignee: Kabushiki Kaisha ToshibaInventors: Masanori Hattori, Yasuo Nagai, Yutaka Irie, Akihiko Ohsuga, Shinichi Honiden
-
Patent number: 6915326Abstract: A planning means generates a plan to be executed by agents on a node. In the case where the plan generated uses an uncertain knowledge required to be processed in other nodes, a judging means judges the communication line connecting the node and a network is low or high in reliability. In the case where the reliability of the communication line is low, an agent management unit moves the agent for executing the plan to another node for processing the uncertain knowledge. In the case where the reliability of the communication line is high, on the other hand, a cooperation protocol realization means requests an agent on another node to process the uncertain knowledge. An agent execution means executes the plan generated.Type: GrantFiled: March 21, 2003Date of Patent: July 5, 2005Assignee: Kabushiki Kaisha ToshibaInventors: Masanori Hattori, Yasuo Nagai, Yutaka Irie, Akihiko Ohsuga, Shinichi Honiden
-
Publication number: 20040044737Abstract: A planning means generates a plan to be executed by agents on a node. In the case where the plan generated uses an uncertain knowledge required to be processed in other nodes, a judging means judges the communication line connecting the node and a network is low or high in reliability. In the case where the reliability of the communication line is low, an agent management unit moves the agent for executing the plan to another node for processing the uncertain knowledge. In the case where the reliability of the communication line is high, on the other hand,. a cooperation protocol realization means requests an agent on another node to process the uncertain knowledge. An agent execution means executes the plan generated.Type: ApplicationFiled: March 21, 2003Publication date: March 4, 2004Applicant: KABUSHIKI KAISHI TOSHIBAInventors: Masanori Hattori, Yasuo Nagai, Yutaka Irie, Akihiko Ohsuga, Shinichi Honiden
-
Publication number: 20040019627Abstract: A planning means generates a plan to be executed by agents on a node. In the case where the plan generated uses an uncertain knowledge required to be processed in other nodes, a judging means judges the communication line connecting the node and a network is low or high in reliability. In the case where the reliability of the communication line is low, an agent management unit moves the agent for executing the plan to another node for processing the uncertain knowledge. In the case where the reliability of the communication line is high, on the other hand, a cooperation protocol realization means requests an agent on another node to process the uncertain knowledge. An agent execution means executes the plan generated.Type: ApplicationFiled: March 21, 2003Publication date: January 29, 2004Applicant: KABUSHIKI KAISHI TOSHIBAInventors: Masanori Hattori, Yasuo Nagai, Yutaka Irie, Akihiko Ohsuga, Shinichi Honiden
-
Publication number: 20040003047Abstract: A planning means generates a plan to be executed by agents on a node. In the case where the plan generated uses an uncertain knowledge required to be processed in other nodes, a judging means judges the communication line connecting the node and a network is low or high in reliability. In the case where the reliability of the communication line is low, an agent management unit moves the agent for executing the plan to another node for processing the uncertain knowledge. In the case where the reliability of the communication line is high, on the other hand, a cooperation protocol realization means requests an agent on another node to process the uncertain knowledge. An agent execution means executes the plan generated.Type: ApplicationFiled: March 21, 2003Publication date: January 1, 2004Applicant: KABUSHIKI KAISHI TOSHIBAInventors: Masanori Hattori, Yasuo Nagai, Yutaka Irie, Akihiko Ohsuga, Shinichi Honiden
-
Patent number: 6598222Abstract: An apparatus for supporting parallelization according to the invention is characterized by comprising a serialization unit for converting a first concurrent program having a concurrent structure into a sequential program capable of being sequentially executed, a debugging unit for debugging the sequential program and forming debugging information, and a concurrent program programming unit for performing parallelization of the debugged sequential program on the basis of the debugging information to convert the sequential program into a second concurrent program. With above configuration, the debugging unit includes a unit for introducing information associated with concurrency to the sequential program.Type: GrantFiled: April 27, 2001Date of Patent: July 22, 2003Assignee: Kabushiki Kaisha ToshibaInventors: Naoshi Uchihira, Shinichi Honiden, Akihiko Ohsuga, Toshibumi Seki, Yasuo Nagai, Keiichi Handa, Satoshi Ito, Nobuyuki Sawashima, Yasuyuki Tahara, Hideaki Shiotani
-
Patent number: 6557025Abstract: A planning section generates a plan to be executed by agents on a node. In the case where the plan generated uses an uncertain knowledge required to be processed in other nodes, a judging section judges the communication line connecting the node and a network is low or high in reliability. In the case where the reliability of the communication line is low, an agent management unit moves the agent for executing the plan to another node for processing the uncertain knowledge. In the case where the reliability of the communication line is high, on the other hand, a cooperation protocol realization section requests an agent on another node to process the uncertain knowledge. An agent execution means executes the plan generated.Type: GrantFiled: September 3, 1998Date of Patent: April 29, 2003Assignee: Kabushiki Kaisha ToshibaInventors: Masanori Hattori, Yasuo Nagai, Yutaka Irie, Akihiko Ohsuga, Shinichi Honiden
-
Publication number: 20010020293Abstract: An apparatus for supporting parallelization according to the invention is characterized by comprising serialization unit for converting a first concurrent program having a concurrent structure into a sequential program capable of being sequentially executed, debugging unit for debugging the sequential program and forming debugging information, and concurrent program programming unit for performing parallelization of the debugged sequential program on the basis of the debugging information to convert the sequential program into a second concurrent program. With above configuration, the debugging unit includes unit for introducing information associated with concurrency to the sequential program.Type: ApplicationFiled: April 27, 2001Publication date: September 6, 2001Inventors: Naoshi Uchihira, Shinichi Honiden, Akihiko Ohsuga, Toshibumi Seki, Yasuo Nagai, Keiichi Handa, Satoshi Ito, Nabuyuki Sawashima, Yasuyuki Tahara, Hideaki Shiotani
-
Patent number: 6275980Abstract: An apparatus for supporting parallelization according to the invention is characterized by comprising a serialization unit for converting a first concurrent program having a concurrent structure into a sequential program capable of being sequentially executed, a debugging unit for debugging the sequential program and forming debugging information, and a concurrent program programming unit for performing parallelization of the debugged sequential program on the basis of the debugging information to convert the sequential program into a second concurrent program. With above configuration, the debugging unit includes a unit for introducing information associated with concurrency to the sequential program.Type: GrantFiled: July 8, 1998Date of Patent: August 14, 2001Assignee: Kabushiki Kaisha ToshibaInventors: Naoshi Uchihira, Shinichi Honiden, Akihiko Ohsuga, Toshibumi Seki, Yasuo Nagai, Keiichi Handa, Satoshi Ito, Nobuyuki Sawashima, Yasuyuki Tahara, Hideaki Shiotani
-
Patent number: 6134580Abstract: In a data-processing apparatus, in local information storage L and R at each node, local information for the purpose of accessing a constituent element is stored, this information being updated. A plan is generated that represents the action that should be taken by an agent in order to satisfy request code that has been input, this being generated as a set of actions, based on agent information and local information. The operation of the agent is implemented at the nodes L and R, based on the various actions that make up the thus-generated plan, and an agent is migrated to another node, based on a go action within the plan. It is possible to perform replanning and generation of a child agent at a migration destination node, if necessary, because of the failure of plan execution, for example.Type: GrantFiled: September 16, 1997Date of Patent: October 17, 2000Assignee: Kabushiki Kaisha ToshibaInventors: Yasuyuki Tahara, Akihiko Ohsuga, Yasuo Nagai, Akira Kagaya, Masanori Hattori, Yutaka Irie, Shinichi Honiden
-
Patent number: 5860009Abstract: An apparatus for supporting parallelization according to the invention is characterized by comprising a serialization unit for converting a first concurrent program having a concurrent structure into a sequential program capable of being sequentially executed, a debugging unit for debugging the sequential program and forming debugging information, and a concurrent program programming unit for performing parallelization of the debugged sequential program on the basis of the debugging information to convert the sequential program into a second concurrent program. With above configuration, the debugging unit includes a unit for introducing information associated with concurrency to the sequential program.Type: GrantFiled: April 27, 1995Date of Patent: January 12, 1999Assignee: Kabushiki Kaisha ToshibaInventors: Naoshi Uchihira, Shinichi Honiden, Akihiko Ohsuga, Toshibumi Seki, Yasuo Nagai, Keiichi Handa, Satoshi Ito, Nobuyuki Sawashima, Yasuyuki Tahara, Hideaki Shiotani
-
Patent number: 5461714Abstract: A program synthesis system comprises a function decomposition unit for decomposing a function according to a predetermined specification so as to obtain detailed functions of the specification, a similarity decision unit for retrieving intermediates similar to the detailed specification detailed by the function decomposition unit, a design process fusion unit for fusing a plurality of design processes, the design process fusion unit including a matching decision unit for deciding matching between design processes having high similarities with respect to the intermediate decided by the similarity decision unit, an object synthesis unit for synthesizing an object on the basis of a new design process synthesized by the design process fusion unit, a design process intermediate knowledge base for storing intermediates from which intermediates similar to the specification detailed by the function decomposition unit are retrieved, and a design process conversion knowledge base for storing a conversion knowledge forType: GrantFiled: July 8, 1994Date of Patent: October 24, 1995Assignee: Kabushiki Kaisha ToshibaInventors: Shinichi Honiden, Takeshi Kohno
-
Patent number: 5353371Abstract: A program synthesis system comprises a function decomposition unit for decomposing a function according to a predetermined specification so as to obtain detailed functions of the specification, a similarity decision unit for retrieving intermediates similar to the detailed specification detailed by the function decomposition unit, a design process fusion unit for fusing a plurality of design processes, the design process fusion unit including a matching decision unit for deciding matching between design processes having high similarities with respect to the intermediate decided by the similarity decision unit, an object synthesis unit for synthesizing an object on the basis of a new design process synthesized by the design process fusion unit, a design process intermediate knowledge base for storing intermediates from which intermediates similar to the specification detailed by the function decomposition unit are retrieved, and a design process conversion on knowledge base for storing a conversion knowledge fType: GrantFiled: September 23, 1991Date of Patent: October 4, 1994Assignee: Kabushiki Kaisha ToshibaInventors: Shinichi Honiden, Takeshi Kohno