公开(公告)号：JP2009205552A

公开(公告)日：2009-09-10

申请号：JP2008048749

申请日：2008-02-28

Applicant: Internatl Business Mach Corp ,  インターナショナル・ビジネス・マシーンズ・コーポレーションInternational Business Maschines Corporation

Inventor： TAKEDA KOICHI ,  KOSEKI SATOSHI

IPC: G06F3/048 ,  G06F17/30

CPC classification number: G06Q10/00

Abstract: PROBLEM TO BE SOLVED: To provide a personal service support method, system, apparatus and computer program for assisting inquiries about user operations by use of dialog records of users' inquiries and agents' answers to the inquiries, the dialog records being obtained in a virtual world and edited in a reusable form. SOLUTION: The personal service support method comprises: a step that a dialog session management unit 111 connects list structured dialogs to create and record a dialog in a branch tree structure, based on the dialog having a list structure in which dialog units of the user and the agent are set as nodes with respect to a help request from a user in a virtual world stored in a dialog log DB 120 or a dialog log DB 220, and based on information on the nodes; and a step that a dialog session analysis unit 112 retrieves the dialog in the branch tree structure stored in the dialog log DB 120 or the dialog log DB 220 according to a predetermined condition requested by the user or the agent. COPYRIGHT: (C)2009,JPO&INPIT

Abstract translation: 要解决的问题：提供一种个人服务支持方法，系统，装置和计算机程序，用于通过使用用户查询的对话记录和代理人对查询的回答来辅助用户操作的查询，获得对话记录 在虚拟世界中，并以可重复使用的形式进行编辑。 个人服务支持方法包括：对话会话管理单元111连接列表结构对话以在分支树结构中创建和记录对话的步骤，基于具有列表结构的对话，其中对话单元 用户和代理相对于存储在对话记录DB 120或对话日志DB 220中的虚拟世界中的用户的帮助请求，并且基于关于节点的信息被设置为节点; 以及对话会话分析单元112根据用户或代理所请求的预定条件在存储在对话日志DB 120或对话日志DB 220中的分支树结构中检索对话的步骤。 版权所有（C）2009，JPO＆INPIT

公开(公告)号：JP2000048087A

公开(公告)日：2000-02-18

申请号：JP20011898

申请日：1998-07-15

Applicant: IBM

Inventor： TAKEDA KOICHI

IPC: G06F17/30 ,  G06F19/00 ,  G06Q10/10 ,  G06T11/60

Abstract: PROBLEM TO BE SOLVED: To provide a flexible and high-grade visualizing technique by retrieving the enabled combination of views from plural views and synthesizing the retrieved views. SOLUTION: A view managing part manages each visualizing expression together with various attributes such as a calculation procedure (such as totalization, keyword retrieval and display) capable of selecting that visualization, the name of that visualizing expression, the number of dimensions and the definition areas of respective dimensions. When a user defines a certain data set by inputting a table or retrieving a database, a view retrieving part determines the set of calculation procedures appliable to that definition of the data set from the definition and further determines the candidates of the view to visualize that calculation procedure. Besides, the view synthesizing part allocates views on the screen of a two-dimensional plane just as arranging tiles concerning the solution of view synthesization corresponding to the arrangement of data sets. Thus, the retrieved views are synthesized and the synthesized view is displayed.

公开(公告)号：JPH11184855A

公开(公告)日：1999-07-09

申请号：JP35438697

申请日：1997-12-24

Applicant: IBM JAPAN

Inventor： NASUKAWA TETSUYA ,  TAKEDA KOICHI ,  WATANABE HIDEO

IPC: G06F17/27 ,  G06F17/28

Abstract: PROBLEM TO BE SOLVED: To improve the selection accuracy of translated words in a machine translation mode without lowering the processing efficiency by using plural types of dictionaries including a context dictionary when a word that is not defined in a compound word dictionary is translated in a sentence. SOLUTION: Every input sentence is taken out at its head (110), and the compound words corresponding to a word string composing a single input sentence are retrieved from a compound word dictionary. When each of wards which are not corresponding to the compound words is translated (120), its translation is decided by a context dictionary and the translated word is obtained based on the translation (130). The translated word undergoes the translation result registering processing. Then it's checked whether an object word is stored in a translation result recording buffer as a header. If the object word is stored in the buffer, it's checked whether or not its translated word is stored in the buffer and all words which are not corresponding to the compound words are processed (140, 160). Then all words are translated (170). When it's decided that a full sentence is translated, the sentence is registered (180 to 195) after undergoing the retranslation effect evaluation processing.

公开(公告)号：JPH05290082A

公开(公告)日：1993-11-05

申请号：JP6455292

申请日：1992-03-23

Applicant: IBM

Inventor： MARUYAMA HIROSHI ,  TAKEDA KOICHI

IPC: G06F17/27 ,  G06F17/28 ,  G06F15/38

Abstract: PURPOSE: To provide translation patterns for machine translation which a user can easily generate and efficiently retrieve. CONSTITUTION: A translation pattern 18 consists of an original language pattern 18A, a variable 18B obtained by substituting this original language pattern with one character, and an objective language pattern 18C as a translation corresponding to the original language pattern. The original language pattern includes a nest 19 where another original language pattern can be incorporated as a variable. A translation is generated based on the collation result between an input text and translation patterns. If there is no coincident translation patterns, the input text is translated by a general machine translation device based on grammar. Since the nest structure 19 is adopted, the user can easily generate many translation patterns based on a peculiar expression method, and customization is simplified. Further, indexes of a tree structure is generated to quickly perform the pattern collation.

公开(公告)号：JPH0546590A

公开(公告)日：1993-02-26

申请号：JP21129391

申请日：1991-07-30

Applicant: IBM

Inventor： MARUYAMA HIROSHI ,  TAKEDA KOICHI

IPC: G06F17/10 ,  G06F17/18 ,  G06F17/21 ,  G06F17/30 ,  G06F19/00

Abstract: PURPOSE: To provide a graph search method for discovering plural pieces of solutions of which the optimum characteristic is warranted, at a high speed. CONSTITUTION: The shortest cost between the arbitrary vertexs of a directed graph attached with the costs of the real values on the side between the vertexes and an end point t is calculated. Route development is executed sequentially toward the end point t the like a, a+1, while the low order is pruned according to set analysis conditions in accordance with the sum f(Xi) of the cumulation g(Xi) of the costs from the beginning point s and the shortest cost h(Xi) of the remaining routes with the partial routes from the beginning point s of the directed graph G. The high-order N-pieces of the optimum routes held at the point of the time when the search ends, are outputted. The shortest cost of the remaining routes is previously calculated and the development is performed for the plural routes in accordance with the analysis conditions while the cumulation of the cost from the beginning point is added thereto and, therefore, the plural characteristic and optimum characteristic of the solution are assured. In addition, the development is sequentially executed while the routes of the low-order cost values are pruned and, therefore, the high-speed characteristic of the processing is assured as well.

公开(公告)号：JP2001325276A

公开(公告)日：2001-11-22

申请号：JP2000140438

申请日：2000-05-12

Applicant: IBM

Inventor： TAKEDA KOICHI ,  NOMIYAMA HIROSHI

IPC: G06F17/30 ,  G06T11/20

Abstract: PROBLEM TO BE SOLVED: To provide a new means for information gathering and analysis in knowledge management for describing information defined by a retrieval formula and the action of gathering and analyzing the information for a specified purpose. SOLUTION: This system is provided with a data knowledge request processing part 130 and a data knowledge request log 131 for acquiring the log of a work in an information processing, a knowledge retrieval processing part 221 for setting the respective works in the log acquired in the data knowledge request processing part 130 and the data knowledge request log 131 as nodes on a graph and preparing the graph for indicating the transition condition of the work by connecting the nodes by branches in the order of executing the work and a knowledge composition/display processing part 222 for visually presenting the graph prepared by the knowledge retrieval processing part 221.

公开(公告)号：JPH1153387A

公开(公告)日：1999-02-26

申请号：JP21163797

申请日：1997-08-06

Applicant: IBM JAPAN

Inventor： URAMOTO NAOHIKO ,  TAKEDA KOICHI

IPC: G06F17/30 ,  G06F15/00

Abstract: PROBLEM TO BE SOLVED: To relate a large quantity of article data to each other with high efficiency and at a high speed by producing a similarity matrix from the similarity set among plural documents via the time restriction and transforming the similarity matrix into an adjacency matrix that shows the correlated between the documents. SOLUTION: A set of articles is shown in the sets that are ordered in a time sequence. A set of articles correlated to each other is defined by a directed graph (V, A), where V means a set of articles (nodes) with A meaning a set consisting of two pairs (i, j) of nodes (i, j: elements of V). As a set of nodes is ordered in time, the limit conditions that: For (di , dj ) EA and i

公开(公告)号：JP2007102289A

公开(公告)日：2007-04-19

申请号：JP2005287701

申请日：2005-09-30

Applicant: Ibm Japan Ltd ,  日本アイ・ビー・エム株式会社

Inventor： TSUTSUMI TAIJIRO ,  TAKEDA KOICHI ,  NOMIYAMA HIROSHI

IPC: G06F17/30

CPC classification number: G06Q40/06

Abstract: PROBLEM TO BE SOLVED: To precisely retrieve text information which has strong association with numerical information such as time series data, and to display the text information by associating it with the numerical information. SOLUTION: This information processor for associating text information with the numerical information of time series is provided with a generation part for generating first words and phrases showing the change of a first numerical information in a certain period; a first retrieval part for retrieving text information matched with a retrieval key including the first words and phrases from among a plurality of pieces of text information as the object of retrieval; and an output part for outputting the retrieved text information by associating it with the first numerical information in the period. In this information processor, the first retrieval part may retrieve text information describing the fact that the first numerical information has been changed as shown by the first words and phrases from among a plurality of pieces of text information prepared or announced in the period. COPYRIGHT: (C)2007,JPO&INPIT

Abstract translation: 要解决的问题：精确检索与诸如时间序列数据的数字信息强关联的文本信息，并通过将文本信息与数字信息相关联来显示文本信息。 解决方案：用于将文本信息与时间序列的数字信息相关联的信息处理器具有生成部件，用于生成在一定时间段内显示第一数字信息的改变的第一单词和短语; 第一检索部分，用于检索与包括作为检索对象的多条文本信息之中的第一单词和短语的检索关键字匹配的文本信息; 以及输出部，其通过将检索到的文本信息与该期间中的第一数值信息相关联来输出。 在该信息处理器中，第一检索部分可以检索描述第一数字信息已被改变的文本信息，如在该期间准备或宣布的多条文本信息中的第一个单词和短语所示。 版权所有（C）2007，JPO＆INPIT

公开(公告)号：JP2002230035A

公开(公告)日：2002-08-16

申请号：JP2001000815

申请日：2001-01-05

Applicant: IBM

Inventor： NOMIYAMA HIROSHI ,  TAKEDA KOICHI ,  SAKAIRI TAKASHI

IPC: G06F17/30 ,  G06F7/00

Abstract: PROBLEM TO BE SOLVED: To present valuable information to a user at the time of periodically observing a plurality of dynamically changing information sources. SOLUTION: This information processing system for processing information to be acquired from a plurality of sites connected through the Internet 10 is provided with a crawler 13 patrolling in the sites on the Internet 10 registered in a registered site DB11, a meta data DB12 for storing meta data to be acquired according to the patrol by extracting elements carrying information from contents to be referred to by a URL, a significant information element extracting mechanism 30 for reading the information stored in the meta data DB12, and for extracting significant information elements based on the level of coincidence of the information elements, a significant information element DB40 for storing the extracted significant information, and a result display mechanism 41 for operating visualization processing to the stored significant information elements.

公开(公告)号：JP2000242647A

公开(公告)日：2000-09-08

申请号：JP3416699

申请日：1999-02-12

Applicant: IBM

Inventor： TAKEDA KOICHI ,  KOBAYASHI MEI

IPC: G06F17/30

Abstract: PROBLEM TO BE SOLVED: To rearrange a set of specific documents in various orders by performing operation between document sets of high order as sorting results and regarding as a retrieval result a document placed in high order through the operation. SOLUTION: A retrieval request input means 309 receives the instruction of an object to be retrieved from a user and finds a set of data and documents complying with a retrieval request for the object to be retrieved by a retrieval request processing means 310 by using indexes 306. The found retrieval result 314 is accepted as to the order of rearrangement of respective elements by an order selection part 311, and an element selection part 312 finds such different sequencing that a specific element is in the highest order from the retrieval result rearranged in the order. From sequences specified by a sequence composition part 313, a new sequence is composed by their sum and product, and a retrieval result display means 316 sequentially displays the elements of the documents sequenced to the highest order of the retrieval result in the composite order.