公开(公告)号：JP2007164789A

公开(公告)日：2007-06-28

申请号：JP2006332338

申请日：2006-12-08

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

Inventor： KUSSMAUL TIMO ,  ARNING ANDREAS

IPC: G06F17/30 ,  G06F3/048 ,  G06F19/00 ,  G06Q10/00

CPC classification number: G06F17/3089 ,  G06F17/30873 ,  Y10S707/99948

Abstract: PROBLEM TO BE SOLVED: To provide an improved method and system for designing a Web portal including a hierarchical structure of portal pages and portlets for accessing Web contents accessible via the portal. SOLUTION: Due to the complexity of an enterprise portal, manual administration is inefficient as it is time-consuming, error-prone and thus expensive. In order to overcome these disadvantages, it is proposed that a portal according to this invention performs some mining (420) to the portlet markup and/or that of the portlet description in order to autonomously compute (430) and propose an enhanced portal content structure (440). This helps to provide a user-friendly content structure that reflects well the relationships between portlets. COPYRIGHT: (C)2007,JPO&INPIT

Abstract translation: 要解决的问题：提供一种用于设计门户网站的改进方法和系统，包括门户页面和门户网站的分层结构，用于访问可通过门户访问的Web内容。 解决方案：由于企业门户的复杂性，手工管理效率低下，因为耗时，容易出错，因而成本高昂。 为了克服这些缺点，提出根据本发明的门户对portlet标记执行一些挖掘（420）和/或Portlet描述，以便自主计算（430）并提出增强的门户内容结构 （440）。 这有助于提供一个良好反映portlet之间关系的用户友好的内容结构。 版权所有（C）2007，JPO＆INPIT

公开(公告)号：GB2458201A

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

申请号：GB0902360

申请日：2009-02-13

Applicant: IBM

Inventor： ARNING ANDREAS

IPC: G06F11/36

Abstract: When test cases cause a computer program to fail, system information, such as a stack trace, is collected. The information is stored in a problem signature database along with a description of the test case that caused the failure. If the program fails when being used normally, the equivalent system information is collected and compared with the system information in the database. The entries in the database are ranked depending on how similar they are to the collected data and the test case descriptions are presented to the user.

公开(公告)号：GB2526274A

公开(公告)日：2015-11-25

申请号：GB201408804

申请日：2014-05-19

Applicant: IBM

Inventor： STOBER THOMAS ,  PROKOPH ANDREAS ,  NAUERZ ANDREAS ,  LIESCHE STEFAN ,  ARNING ANDREAS

IPC: G06F17/30

Abstract: An improved search infrastructure 1 for performing web search by a user client system 10 comprises at least one independent search service provider 200, at least one independent analyt­ics service provider 100, and means 300 for mapping user identity data and user profile information between the at least one search service provider 200, the at least one ana­lytics service provider 100, and at least one independent website provider providing at least one website. The search service provider 200 comprises at least: means for re­ceiving search queries; and means for optimizing search results by consuming analytics data provided by the at least one analyt­ics service provider 200. The at least one analytics service provider 200 comprises at least: means for tracking user activities on the at least one website; and means for generating a user profile based on analyzing user activities on the at least one website. The mapping means 300 provide authorized access to the user profile information to the at least one search service provider 200 or the at least one analytics service provider 100 for optimizing said web search for the associated user. User identity data is based on a cookie or an openID account.

公开(公告)号：DE10134229A1

公开(公告)日：2002-02-28

申请号：DE10134229

申请日：2001-07-13

Applicant: IBM

Inventor： ARNING ANDREAS ,  BOLLINGER TONI ,  KEULER REINHOLD ,  SCHWENKREIS FRIEDEMANN

IPC: G06F17/30

Abstract: Determination of differences in a database table using a method based on use of a classification tree after selection of a column as a classification column. The invention also relates to a data processing program and a computer program product for use in finding differing data in a database table. Method has the following steps: selection of a column as a classification column, execution of a classification method by calculation of a classification tree with reference to the reference column. Each edge of the classification tree is assigned a grade and the leaf nodes are assigned a leaf data set that includes a part of the data records for which an evaluation of the class value equal to TRUE is determined along the whole path from the root node of the classification tree to the leaf node in question. The leaf nodes are assigned a leaf characteristic that represents the expected value in the classification column. In a final step data records differing from the leaf characteristic are classed as a difference data set.

公开(公告)号：DE4323241A1

公开(公告)日：1995-02-02

申请号：DE4323241

申请日：1993-07-12

Applicant: IBM

Inventor： ARNING ANDREAS

IPC: G10L15/22 ,  G06F17/21 ,  G06F17/27

Abstract: The invention relates to a method and a computer system for detecting and/or correcting an error string Fi in a text stored in the computer system. Hereby, in step 10 an error-free string Si is first selected. In step 11, the error-free string Si is modified such that a possible error string is produced, which serves to calculate a value alpha ij in step 12, whereby the value alpha ij represents an indication of the probability that the possible error string fij is an actual error string Fi. If, accordingly, the value alpha ij exceeds a threshold value beta , the result is output in step 14. Otherwise, step 15 is executed to produce another possible error string fij in step 11.

公开(公告)号：GB2456369A

公开(公告)日：2009-07-15

申请号：GB0821860

申请日：2008-12-01

Applicant: IBM

Inventor： ARNING ANDREAS ,  SEIFFERT ROLAND

IPC: G06F17/27

Abstract: The invention relates to a string-pattern analysis method, particularly for a pattern of words or a genome pattern, comprising the steps of iteratively for one or more iterations (A) defining a subset (SET_A) of substrings (STR_A_B) in said pattern, keeping track of all said substrings (STR_A_B) and their occurrence counts (Occ_A_B) in said subset (SET_A) of substrings (STR_A_B) and pruning away each substring (STR_A_B) if said substring (STR_A_B) is subsumed by a longer substring (STR_A_C) in said subset (SET_A) of substrings (STR_A_B) with same occurrence count (Occ_A_C).

公开(公告)号：AU2003274075A1

公开(公告)日：2004-06-30

申请号：AU2003274075

申请日：2003-10-24

Applicant: IBM

Inventor： MAIER ANDREAS ,  ROLLER DIETER ,  ARNING ANDREAS

IPC: G06Q10/00 ,  G06F17/60

Abstract: The present invention proposes a computerized method and means for providing an improved handling of messages directed to an user of an electronic messaging system. The suggested method comprises a first step of determining user characteristics capable of identifying the user as an addressee of a message. The method further comprises a second step of analyzing a certain message and determining its message characteristics exploiting the information contained in one or a multitude of message fields. The method finally comprises a third step of applying at least one deduction rule of a potential set of deduction rules to said certain message. The deduction rule assigns based on the user characteristics and the message characteristics a role of said user to said certain message. The role is capable of revealing said user's relationship to said certain message.