公开(公告)号：EP1895464A4

公开(公告)日：2011-03-02

申请号：EP06757180

申请日：2006-06-08

Applicant: IBM

Inventor： INOKUCHI AKIHIRO ,  URAMOTO NAOHIKO

IPC: G06F17/30 ,  G06F19/00 ,  G06Q50/22

CPC classification number: G06F19/325 ,  G06F19/3481 ,  G06Q50/22 ,  G06Q50/24 ,  G16H10/60 ,  G16H10/65 ,  G16H50/20 ,  G16H50/70

Abstract: The invention provides a medical guide service to a doctor, a patient, a general user, and a medical institution. A medical guide system includes: a unit that creates medical record data including examination data that includes examination items, the date and time of an examination, and examination results, and treatment data that includes treatment behaviors, the date and time of a medical treatment, and treatment results, the examination data and the treatment data being electronically recorded for every patient; a unit that extracts the medical record data for each patient, using the examination data before a predetermined dividing point in a chronological order as data before dividing point and the treatment data after the predetermined dividing point in the chronological order as data after dividing point; a unit that extracts a treatment pattern from a plurality of data after dividing point, the number of frequencies that the treatment patter occurs is equal to or larger than a predetermined number of frequencies; and a unit that derives a rule that associates the examination result with the treatment pattern from the treatment pattern and the data before dividing point.

公开(公告)号：JP2011096115A

公开(公告)日：2011-05-12

申请号：JP2009251080

申请日：2009-10-30

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

Inventor： AKIYAMA KAZUTO ,  IWANO KAZUO ,  DAIMON AKIRA ,  TSUMURA TADASHI ,  URAMOTO NAOHIKO

IPC: G06F9/50

CPC classification number: G06F9/5055

Abstract: PROBLEM TO BE SOLVED: To know an execution subject of the divided jobs of a service in advance in cloud computing.
SOLUTION: A second computer 700: (i) divides the service executable by the other plurality of computers 1500; (ii) associates a category to each divided job; (iii) receives a region code and an execution command of the service from a first computer 200; and (iv) for each of the plurality of jobs, (iv-1) retrieves a job category database using the region code and the category as keys and obtains an identifier list of the operations corresponding to the jobs, (iv-2) transmits the identifier list to the other plurality of computers, and (iv-3) transmits a set of the job, the identifiers of the other computers and the identifier list to the first computer when receiving a response that the operations corresponding to the identifier list can be executed from the other computers.
COPYRIGHT: (C)2011,JPO&INPIT

Abstract translation: 要解决的问题：在云计算中事先知道服务的划分作业的执行主题。 解决方案：第二计算机700：（i）划分由其他多个计算机1500可执行的服务; （ii）将类别分配给每个划分的作业; （iii）从第一计算机200接收服务的区域代码和执行命令; （iv）对于多个作业中的每一个，（iv-1）使用区域代码和类别作为关键字检索作业类别数据库，并且获得与作业相对应的操作的标识符列表，（iv-2）发送 向其他多个计算机的标识符列表，以及（iv-3）当接收到与标识符列表相对应的操作的响应可以将一组作业，其他计算机的标识符和标识符列表发送到第一计算机时 从其他电脑执行。 版权所有（C）2011，JPO＆INPIT

公开(公告)号：JPH11187013A

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

申请号：JP35440197

申请日：1997-12-24

Applicant: IBM JAPAN

Inventor： MARUYAMA HIROSHI ,  TOKUYAMA TAKESHI ,  URAMOTO NAOHIKO

IPC: H04L9/08 ,  G09C1/00 ,  H04L9/20

Abstract: PROBLEM TO BE SOLVED: To provide a method and a system for minimizing procedures required for updating a cryptographic key by structuring the cryptographic key into tree structure. SOLUTION: First of all, plural keys more than the number of recipients are generated 710, and the plural keys are hierarchically arranged 720 in the form of tree structure. Next, the plural recipients are made correspondent to the keys hierarchically arranged in the form of tree structure, and the cryptographic keys of the respective recipients are generated as a key stream having keys from the root of tree structure to positions corresponding to the said recipients in the tree structure. Thus, after the cryptographic key is generated 730, the generated cryptographic key is distributed 740 to the correspondent recipient.

公开(公告)号：JP2007179170A

公开(公告)日：2007-07-12

申请号：JP2005374990

申请日：2005-12-27

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

Inventor： SUZUMURA TOYOTARO ,  TACHIBORI MICHIAKI ,  URAMOTO NAOHIKO

IPC: G06F17/21

CPC classification number: G06F17/2247 ,  G06F17/272

Abstract: PROBLEM TO BE SOLVED: To provide a parsing device and method, such as an XML parser, that quickly parse computerized structured documents. SOLUTION: State transitions of a plurality of states into which structured documents can be divided are integrated to generate optimum automatons according to statistical information and schema information about instance documents. In the state transition integration, continuously matching state transitions are held in ID lists, and the continuous state transitions are counted with the ID lists. For repetitive elements including nests, patterns of appearance frequency are statistically identified. XML blank variations are also statistically accommodated. The advance automaton construction further using the schema information reduces initialization overheads of the parsing device. COPYRIGHT: (C)2007,JPO&INPIT

Abstract translation: 要解决的问题：提供快速解析计算机化结构化文档的解析设备和方法，如XML解析器。 解决方案：结构化文档可以分割成多个状态的状态转换被整合，以根据关于实例文档的统计信息和模式信息来生成最佳自动机。 在状态转换集成中，连续匹配状态转换保持在ID列表中，连续状态转换用ID列表计数。 对于包括巢穴在内的重复元素，统计识别出现频率的模式。 XML空白变体也是统计学的。 进一步使用模式信息的先进自动机构造减少了解析装置的初始化开销。 版权所有（C）2007，JPO＆INPIT

公开(公告)号：JPH11174956A

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

申请号：JP30826297

申请日：1997-11-11

Applicant: IBM

Inventor： MARUYAMA HIROSHI ,  URAMOTO NAOHIKO

IPC: H04L9/32 ,  G06F21/00 ,  G09C1/00

Abstract: PROBLEM TO BE SOLVED: To provide a mechanism which enables a digital ID to be used as a letter of attorney in a specific period for a specific purpose by using the temporary digital ID signed with an individual secret key. SOLUTION: A user (client 310) uses a temporary key generated temporarily by using his secret key for a signature requested by application on a server 320 instead of using his secret key (1). A temporary certificate of the temporary key is signed with the secret key of the user (2). Here, the temporary certificate contains information on a term of validity of use as the temporary certificate and information on the purpose of the use. When the application makes a request 330 to sign a document, the client 310 sends the document 340 signed with the temporary key, temporary certificate 40, and the certificate 360 of the user to the server 320. The server 320 confirms the signature first (3), confirm whether or not the temporary certificate is valid (whether the term of validity has expired and whether the certificate is for other applications) (4), and then confirms whether or not the temporary certificate has been signed by the correct user (5). Lastly, the validity of the certificate of the user is confirmed (6).

公开(公告)号：JPH06314294A

公开(公告)日：1994-11-08

申请号：JP10297393

申请日：1993-04-28

Applicant: IBM JAPAN

Inventor： URAMOTO NAOHIKO

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

Abstract: PURPOSE:To convert an original sentence into a translated sentence with high precision by permitting the first language original sentence to optimally correspond to the second language translated sentence and dissolving the ambiguity of the meaning of a word for the first language words and phrases having multiple meanings. CONSTITUTION:The first language original sentence to be translation object is inputted from an input device 12 and inputted to a multiple meaning word dissolving device 20 through an input sentence analyzer 14. A characteristic table generating part 30 stores a characteristic table where the meaning of the word is previously made to correspond to a characteristic at every multiple meaning word. A characteristic record is generated in a characteristic record generating part 22 concerning to the original sentence and compared with the character table so that the meaning of the multiple meaning word is selected and outputted based on the characteristic which the original sentence has. The respective words and phrases whose ambiguity of the word meaning is dissolved by the multiple meaning word dissolving device 20 are outputted to an output device 46 after translation by a bilingual translation processor 40.

公开(公告)号：JP2003256264A

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

申请号：JP2002045087

申请日：2002-02-21

Applicant: IBM

Inventor： URAMOTO NAOHIKO ,  MARUYAMA HIROSHI ,  TAMURA TAKETO

IPC: G06F17/21 ,  G06F12/00 ,  G06F17/22 ,  G06F17/27

Abstract: PROBLEM TO BE SOLVED: To perform processing for finding a structural definition to which a received XML document is suited at high speed on the assumption that a certain set of structural definitions is applied. SOLUTION: The document processing system is provided with a discrimination rule generating part 10 for generating discrimination rules for discriminating any one of a plurality of DTD to which the XML document is suited on the basis of the intrinsic elements of the respective DTD and a DTD discriminating part 50 for discriminating the DTD to which the XML document as a processing target is suited on the basis of the discrimination rules generated by the discrimination rule generating part 10. COPYRIGHT: (C)2003,JPO

公开(公告)号：JP2001217720A

公开(公告)日：2001-08-10

申请号：JP2000028359

申请日：2000-02-04

Applicant: IBM

Inventor： MARUYAMA HIROSHI ,  TAMURA TAKETO ,  URAMOTO NAOHIKO

IPC: G06F17/40 ,  G06F17/30 ,  H03M7/30

Abstract: PROBLEM TO BE SOLVED: To provide a data compression for encoding the structural part of a document in a tree local language such as XML or ASN.1. SOLUTION: In the data compressing apparatus for encoding and compressing data, there are provided a grammar rule 12 for the tree local language with which the data are expressed in a labeled tree structure, an encoder 11 for reading a document described in this tree local language, separating this document into a structure and contents and encoding this structure while using the grammar rule 12 and a compressor 13 for compression-encoding the contents of this document extracted by the encoder 11.

公开(公告)号：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

公开(公告)号：DE69429301D1

公开(公告)日：2002-01-17

申请号：DE69429301

申请日：1994-04-12

Applicant: IBM

Inventor： URAMOTO NAOHIKO

IPC: G06F17/27 ,  G06F17/28

Abstract: Source sentences in the first language to be translated are entered to an input unit 12. Through the input unit 12 source sentences are entered to a polysemous word settlement unit 20 via an entered sentences analyzing unit 14. A characteristics table generation part 30 stores a characteristics table in which each meaning is preliminarily associated with each characteristic with respect to polysemous words. A characteristics record generation part 22 generates a characteristics record to compare the characteristics table and the characteristics record, thereby selecting and outputting the meaning of the polysemous word based on the characteristics in the source sentences. Each word whose ambiguity has been settled at the polysemous word settlement unit 20 is translated at a correlative translation processing unit 40 to be output to an output unit 46. Thus ambiguity of the meaning of a polysemous word in a first language having a plurality of meanings is settled so as to make source sentences in the first language correspond in the most appropriate way to the translated sentences in the second language.