公开(公告)号：JP2013222337A

公开(公告)日：2013-10-28

申请号：JP2012094026

申请日：2012-04-17

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

Inventor： RUDY RAYMOND HARRY PUTRA ,  KOYANAGI MITSUO ,  OSOGAMI TAKAYUKI

IPC: G06F17/30 ,  G06F12/00

CPC classification number: G06F12/08 ,  G06F17/18 ,  G06F17/30619 ,  H04L43/022 ,  H04L43/16

Abstract: PROBLEM TO BE SOLVED: To provide a method, device and computer program for efficiently identifying items having a high frequency of occurrence among items included in a large-volume text data stream.SOLUTION: Identification information for identifying an item and a count for the item are stored in a memory of a higher level, and only identification information is stored in a memory of a level lower than said higher level. When text data stream input is received: if identification information for an item included in a bucket resulted from division of the received text data stream input is stored in the higher-level memory, the count for the item is incremented; when stored in the lower-level memory, the identification information for the item is transferred with an initial count to the higher-level memory; and, when not stored in any level, the identification information for the item is newly stored with the initial count in the higher-level memory.

Abstract translation: 要解决的问题：提供一种方法，装置和计算机程序，用于有效地识别包含在大容量文本数据流中的项目之间具有高频率发生的项目。解决方案：用于识别项目的识别信息和项目的计数 被存储在更高级别的存储器中，并且只有识别信息被存储在低于所述较高级别的级别的存储器中。 当接收到文本数据流输入时：如果由接收到的文本数据流输入的分割而产生的包含在桶中的项目的识别信息被存储在上级存储器中，则该项目的计数被递增; 当存储在下级存储器中时，用于初始计数的项目的识别信息被传送到较高级别的存储器; 并且当不存储在任何级别时，在上层存储器中以初始计数新存储该项目的识别信息。

公开(公告)号：JP2010026689A

公开(公告)日：2010-02-04

申请号：JP2008185780

申请日：2008-07-17

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

Inventor： KOYANAGI MITSUO ,  TSUBOI YUTA

IPC: G06F17/30 ,  G06F17/21

CPC classification number: G06F17/30

Abstract: PROBLEM TO BE SOLVED: To provide an information processing apparatus, an information processing method and a program for achieving the pattern matching of text information by saving a memory with high computational efficiency. SOLUTION: The information processing apparatus 10 includes: a generation section 60 configured to generate an ordered tree structure by defining transition edges between nodes using, as transition conditions, respective constraints from one or more constraint patterns 150 each including a plurality of constraints; a search section 72 configured to search for a second substructure K similar to a first substructure P from a root node by determining a set relation between the transition conditions of respective transition edges; and a transition defining section 74 configured to define an additional transition link from a tail node sK n of the second substructure K to a slave node sP n+1 of the first substructure P, the additional transition link adding a constraint to be met by an indeterminant identified from the set relation, wherein a data structure 100 for pattern matching is defined. COPYRIGHT: (C)2010,JPO&INPIT

Abstract translation: 要解决的问题：提供一种信息处理装置，信息处理方法和程序，用于通过节省具有高计算效率的存储器来实现文本信息的模式匹配。 解决方案：信息处理装置10包括：生成部分60，其被配置为通过使用来自一个或多个约束模式150的各自的约束作为过渡条件来定义节点之间的过渡边缘来生成有序树结构，每个约束模式包括多个约束 ; 搜索部分72，被配置为通过确定各个过渡边缘的转换条件之间的集合关系，从根节点搜索类似于第一子结构P的第二子结构K; 以及转换定义部分74，其被配置为将第二子结构K的尾节点sK n 的附加转变链路定义到第一子结构的从节点sP n + 1 P，附加转移链路添加由从集合关系识别的不确定性要满足的约束，其中定义用于模式匹配的数据结构100。 版权所有（C）2010，JPO＆INPIT

公开(公告)号：JP2006185363A

公开(公告)日：2006-07-13

申请号：JP2004380864

申请日：2004-12-28

Applicant: IBM

Inventor： YAMAMOTO MANABU ,  KOYANAGI MITSUO ,  KOBAYASHI TAKAAKI

IPC: G06F9/48 ,  G06F13/00 ,  G06F17/30

Abstract: PROBLEM TO BE SOLVED: To promote message processing of the highest priority of a large amount of agents while suppressing access to a disk. SOLUTION: This device is provided with a memory, a means for determining the priority of an agent by a message inserted into the agent and managing the state of the agent according to whether the agent exists on the memory and the existence/absence of the message, a means for allocating a thread if the agent exists on the memory and accessing the agent onto the memory unless the agent exists on the memory on the condition of detecting an agent, whose priority is the highest, and a message processing means for repeating message processing up to prescribed reference about the agent to which the thread is allocated. COPYRIGHT: (C)2006,JPO&NCIPI

公开(公告)号：JP2010128752A

公开(公告)日：2010-06-10

申请号：JP2008302250

申请日：2008-11-27

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

Inventor： KOYANAGI MITSUO ,  OZAWA YOSUKE ,  ENOKI MIKI

IPC: G06F12/00

Abstract: PROBLEM TO BE SOLVED: To provide a database system, a server, an update method, and a program for efficiently executing a plurality of update requests to a database. SOLUTION: The server is connected to a database 90 and one or more other servers and includes a data storage part 50 for storing at least part of data obtained by dividing the database 90, a log storage part 62 for storing an update log by an update request concerning the data received from an application 30, a transmission part 88 for copying the update log and transmitting it to the other servers in response to the update request, a replica storage part 82 for storing a replica 110 of the update log by copying received from the other servers, and an execution part 64 for executing a batch update for the database 90 according to the sum of the update log 100 and the replica 110 stored in the log storage part 62 and the replica storage part 82 respectively. COPYRIGHT: (C)2010,JPO&INPIT

Abstract translation: 要解决的问题：提供一种数据库系统，服务器，更新方法和用于向数据库有效执行多个更新请求的程序。 解决方案：服务器连接到数据库90和一个或多个其他服务器，并且包括用于存储通过划分数据库90获得的数据的至少一部分的数据存储部分50，用于存储更新日志的日志存储部分62 通过关于从应用程序30接收到的数据的更新请求，用于复制更新日志并且响应于更新请求将其发送到其他服务器的发送部分88，用于存储更新日志的副本110的副本存储部分82 通过从其他服务器接收到的复制，以及执行部分64，用于分别根据存储在日志存储部分62和副本存储部分82中的更新日志100和副本110的和来执行数据库90的批量更新。 版权所有（C）2010，JPO＆INPIT

公开(公告)号：JP2004234354A

公开(公告)日：2004-08-19

申请号：JP2003022380

申请日：2003-01-30

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

Inventor： ABE MARI ,  HORI MASAHIRO ,  ONO KOICHI ,  KOYANAGI MITSUO

IPC: G06F17/21 ,  G06F17/30

CPC classification number: G06F17/30958 ,  Y10S707/99936 ,  Y10S707/99942 ,  Y10S707/99943 ,  Y10S707/99944 ,  Y10S707/99945

Abstract: PROBLEM TO BE SOLVED: To provide a structural pattern candidate creating system which automatically creates candidates for several complicated structural patterns and facilitates the selection of a purposive structural pattern.
SOLUTION: When the system receives a structural pattern which indicates an element or an element group in a document logical structure of a structuralized document and is designated by a user, an edit object item determining means determines edit object items to be edited among items constituting the structural pattern. A structural pattern candidate creating means edits the edit object items into differently-expressed items based on document logical structure information of the structuralized document, and creates structural patter candidates. A structural pattern candidate list creating means sorts the created structural pattern candidates in accordance with a display index for providing the user with a selection standard, and creates a list of the structural pattern candidates. When the system receives desired edit items designated for the structural pattern by the user, the edit object item determining means determines the desired edit items as the edit object items.
COPYRIGHT: (C)2004,JPO&NCIPI

公开(公告)号：JP2001282105A

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

申请号：JP2000087634

申请日：2000-03-27

Applicant: IBM

Inventor： NOGUCHI TETSUYA ,  KOYANAGI MITSUO ,  KAJIMA HISATSUGU

IPC: G06F21/00 ,  G06F21/33 ,  G06F21/60 ,  G09C1/00 ,  H04L9/32 ,  G06F15/00

Abstract: PROBLEM TO BE SOLVED: To enhance ability of the publicity and the non-alterability property of electronic contents by giving evidence to the publicity of the electronic contents existing on a network. SOLUTION: A service machine 10 chooses preferably plural witnesses from among register group 12 or a certificate generator 12a with respect to the service request of a user 11 wanting to have the testimony of the publicity of electronic contents and asks the witnesses or the certificate generator 12a to prepare the acquisition certificate of the electronic contents 14. Electronic signatures of the witnesses or the certificate generator 12a are attached to a certificate and the service machine 10 transmits this certificate to a user 11 after attaching, in addition, an electronic signature of his own.

公开(公告)号：JP2010009489A

公开(公告)日：2010-01-14

申请号：JP2008170857

申请日：2008-06-30

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

Inventor： KOYANAGI MITSUO ,  OZAWA YOSUKE ,  TAKEUCHI MIKIO ,  ABE MARI

IPC: G06F17/30 ,  G06Q10/00 ,  G06Q10/06 ,  G06Q50/00

Abstract: PROBLEM TO BE SOLVED: To provide a data processor, a workflow system, a data processing method, and a computer program, can function a materialized view as a self-maintainable view, without increasing a storage capacity, when retrieving or updating information as to a progress situation of process instance in a prescribed condition, using the materialized view including information as to an inquiry result to a database defined in advance. SOLUTION: A flow description code for constructing a workflow is obtained to be analyzed statically. Selection condition information as to an attribute of a selection condition for the process instance in each node is generated and stored in response to a static analytical result. The node not having the possibility of providing the selection condition is extracted based on the stored selection condition information, to delete information as to the inquiry result corresponding to the extracted node and a node transited after the node, from the materialized view. COPYRIGHT: (C)2010,JPO&INPIT

Abstract translation: 要解决的问题：为了提供数据处理器，工作流系统，数据处理方法和计算机程序，在检索或更新时可以将实体化视图作为自维护视图而不增加存储容量 关于在规定条件下的流程实例的进度情况的信息，使用包括关于预先定义的数据库的查询结果的信息的物化视图。

解决方案：获得用于构建工作流的流程描述代码进行静态分析。 根据静态分析结果生成并存储关于每个节点中的处理实例的选择条件的属性的选择条件信息。 基于存储的选择条件信息提取不具有提供选择条件的可能性的节点，从物化视图删除与提取的节点相对应的查询结果和节点之后转移的节点的信息。 版权所有（C）2010，JPO＆INPIT

公开(公告)号：JP2009266147A

公开(公告)日：2009-11-12

申请号：JP2008118099

申请日：2008-04-30

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

Inventor： OZAWA YOSUKE ,  KOYANAGI MITSUO ,  FUKUDA MARI ,  OSAKI HIROYASU

IPC: G06F12/00

CPC classification number: G06F17/30383

Abstract: PROBLEM TO BE SOLVED: To provide a method for managing views having virtual tables of databases. SOLUTION: The method includes steps of: selecting a discard candidate instance from a discard candidate list table in accordance with an LRU algorithm if it is determined that there is less free space for adding an instance; determining whether a revision wait flag is on for the discard candidate instance; if it is determined that the revision wait flag is on, deleting the discard candidate instance from the discard candidate list table; if it is determined that the revision wait flag is not on, deleting the discard candidate instance from the instance pool and adding the instance to the instance pool; and adding the requested instance to the instance pool if it is determined that there is enough storage area. COPYRIGHT: (C)2010,JPO&INPIT

Abstract translation: 要解决的问题：提供一种用于管理具有数据库虚拟表的视图的方法。 解决方案：所述方法包括以下步骤：如果确定存在用于添加实例的可用空间较小，则根据LRU算法从丢弃候选列表表中选择丢弃候选实例; 确定丢弃候选实例的修订等待标志是否打开; 如果确定修订等待标志已经打开，则从丢弃候选列表表中删除丢弃候选实例; 如果确定修订等待标志不在，则从实例池中删除丢弃的候选实例，并将实例添加到实例池; 并且如果确定存在足够的存储区域，则将所请求的实例添加到实例池。 版权所有（C）2010，JPO＆INPIT

公开(公告)号：JP2003271599A

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

申请号：JP2002064452

申请日：2002-03-08

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

Inventor： KAJIMA HISATSUGU ,  KOYANAGI MITSUO

IPC: G06F17/10 ,  G06F15/00 ,  G06F17/30

CPC classification number: G06K9/6282

Abstract: PROBLEM TO BE SOLVED: To realize the classification of semi-structured data by kernel method to a labelled order tree.
SOLUTION: A plurality of instances having a labelled order tree structure is inputted, an inner product is calculated on the basis of the structure, and the classification learning of the instances is performed by use of the calculation result of the inner product. A dynamic planning method is applied to a node that is not the terminal end of the labelled order tree on the basis of the corresponding relation in which the order of each node is stored, and the sum of matching related to offspring nodes is calculated.
COPYRIGHT: (C)2003,JPO

Abstract translation: 要解决的问题：通过核心方法实现对半结构化数据的分类到标记的顺序树。 输入具有标号的订单树结构的多个实例，根据该结构计算内积，并且通过使用内积的计算结果来执行实例的分类学习。 基于存储每个节点的顺序的对应关系，并且计算与后代节点相关的匹配之和，将动态规划方法应用于不是标记订单树的终端的节点。 版权所有（C）2003，JPO

公开(公告)号：JP2002032677A

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

申请号：JP2000197368

申请日：2000-06-29

Applicant: IBM

Inventor： KODA TAKENORI ,  KOYANAGI MITSUO ,  MASUMITSU TAKESHI

IPC: G06F17/00 ,  G06F12/00 ,  G06F17/30 ,  G06Q10/00 ,  G06Q30/02 ,  G06Q30/06 ,  G06Q50/00 ,  G06F17/60

Abstract: PROBLEM TO BE SOLVED: To provide a means for guiding a user to a specific group of sites without regard to the presence/absence of the interest of the user. SOLUTION: The means is provided with a moving object managing part 10 for managing the position of a moving object on a network, a radar information generation part 20 for generating information on the position of this moving object and providing it to a user accessing to this network, and a zero distance processing part 30 for carrying out processing accompanying finding out of a previously set moving object when a prescribed user finds out this moving object. By arranging the moving object at a desired position by the part 10, the user is guided to desired contents on the network.