Patents by Inventor Peter Gerstl
Peter Gerstl 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: 9367582Abstract: A method includes receiving a request from a source service, determining whether the target service associated with the request supports a by-reference evaluation strategy, determining whether an information object associated with the request is a data reference, retrieving data associated with the reference from a database, adding the data to the information object, and invoking the target service and passing the information object to the target service responsive to determining that the target service does not support the by-reference strategy and the information object is a data reference.Type: GrantFiled: August 7, 2009Date of Patent: June 14, 2016Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Andreas Arning, Peter Gerstl, Mike Grasselt, Albert Maier, Frank Neumann, Daniel Wolfson
-
Publication number: 20160092290Abstract: Processing data errors in a data processing system, includes a computer receiving one or more patterns and a data set. The one or more patterns describe characteristics of an erroneous data record and are associated with a root cause. The root cause includes a description of a technical deficiency causing the data error in the erroneous data record. Responsive to the computer determining that a first set of data records in the received data set have characteristics that match a first pattern of the one or more patterns, the computer assigns the first set of data records of the received data set having characteristics that match the first pattern to a first error group.Type: ApplicationFiled: September 2, 2015Publication date: March 31, 2016Inventors: Peter Gerstl, Mike Grasselt, Albert Maier, Thomas Schwarz, Oliver Suhre
-
Patent number: 9135584Abstract: A method to model and change the state of associated content objects from one or more workflow and task management systems is provided. The method includes overlaying a business process model associated with a graphical content state overlay. A state of the content objects changes accordingly when the business process instance proceeds. Access rights are forwarded from human tasks in a business process to an associated content object. Concurrent access rights that are forwarded from multiple systems are handled. The graphical content state overlay areas include an active state overlay to graphically indicate a business process instance is active, an assessed overlay to graphically indicate a business process instance is assessed, an approval/rejected overlay to graphically indicate a business process instance has received one of an approval decision and a rejection decision, and a state archived overlay to graphically indicate a business process instance has been archived.Type: GrantFiled: February 28, 2009Date of Patent: September 15, 2015Assignee: International Business Machines CorporationInventors: Peter Gerstl, Frank Neumann
-
Patent number: 9098630Abstract: In an exemplary embodiment of this disclosure, a data selection method may include receiving first data representative of program code having a plurality of database operations. Second data is generated and is representative of a sequence of operations encounterable in an execution of the program code, where the sequence of operations includes at least one of the database operations. A third data is selected from a database, by using the second data.Type: GrantFiled: March 11, 2013Date of Patent: August 4, 2015Assignee: International Business Machines CorporationInventors: Florian Funke, Peter Gerstl, Daniel S. Haischt
-
Publication number: 20150106381Abstract: Data to be loaded into a target system includes entities having corresponding unique primary data value and secondary data values. The secondary data values have associated foreign key relationships, which links the secondary data value to the primary data value of another entity. In loading the data, the entities are split into insertion leaf groups by execution of an iteration process, each iteration involving generation of a respective set of insertion leaf groups containing entities whose secondary data values have no foreign key relationships or only foreign key relationships with the primary data values of entities of the insertion leaf groups generated during any prior iteration. The iteration process is executed until there are no such entities are left. A sequence of generation of the sets of insertion leaf groups is recorded, and the sets of insertion leaf groups are consecutively loaded into the target system according to the sequence.Type: ApplicationFiled: October 9, 2014Publication date: April 16, 2015Inventors: Peter GERSTL, Mike GRASSELT, Albert MAIER, Thomas SCHWARZ, Oliver SUHRE
-
Publication number: 20140379831Abstract: The present invention relates to electronic mail. In particular, it relates to a method and system for processing electronic mail, wherein mails are stored in a space efficient way by removing redundancy from the content. Prior art is known for doing a limited version of this on a mail client.Type: ApplicationFiled: September 12, 2014Publication date: December 25, 2014Inventors: Peter Gerstl, Magnus Karlsson, Dirk Seider, Oliver Suhre
-
Patent number: 8849919Abstract: The present invention relates to electronic mail. In particular, it relates to a method and system for processing electronic mail, wherein mails are stored in a space efficient way by removing redundancy from the content. Prior art is known for doing a limited version of this on a mail client.Type: GrantFiled: January 3, 2006Date of Patent: September 30, 2014Assignee: International Business Machines CorporationInventors: Peter Gerstl, Magnus Karlsson, Dirk Seider, Oliver Suhre
-
Publication number: 20140019941Abstract: In an exemplary embodiment of this disclosure, a data selection method may include receiving first data representative of program code having a plurality of database operations. Second data is generated and is representative of a sequence of operations encounterable in an execution of the program code, where the sequence of operations includes at least one of the database operations. A third data is selected from a database, by using the second data.Type: ApplicationFiled: March 11, 2013Publication date: January 16, 2014Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Florian Funke, Peter Gerstl, Daniel S. Haischt
-
Publication number: 20110035411Abstract: A method comprises receiving a request from a source service, determining whether the target service associated with the request supports a by-reference evaluation strategy, determining whether an information object associated with the request is a data reference, retrieving data associated with the reference from a database, adding the data to the information object, and invoking the target service and passing the information object to the target service responsive to determining that the target service does not support the by-reference strategy and the information object is a data reference.Type: ApplicationFiled: August 7, 2009Publication date: February 10, 2011Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Andreas Arning, Peter Gerstl, Mike Grasselt, Albert Maier, Frank Neumann, Daniel Wolfson
-
Publication number: 20100223570Abstract: A method to model and change the state of associated content objects from one or more workflow and task management systems is provided. The method includes overlaying a business process model associated with a graphical content state overlay. A state of the content objects changes accordingly when the business process instance proceeds. Access rights are forwarded from human tasks in a business process to an associated content object. Concurrent access rights that are forwarded from multiple systems are handled. The graphical content state overlay areas include an active state overlay to graphically indicate a business process instance is active, an assessed overlay to graphically indicate a business process instance is assessed, an approval/rejected overlay to graphically indicate a business process instance has received one of an approval decision and a rejection decision, and a state archived overlay to graphically indicate a business process instance has been archived.Type: ApplicationFiled: February 28, 2009Publication date: September 2, 2010Inventors: Peter Gerstl, Frank Neumann
-
Patent number: 7296020Abstract: A computerized method and system of document analysis. The method and system categorise documents according to a taxonomy. This is accomplished by rating training documents on a lower level by associating either of the following predicates to a training document: either correct, inbound, outbound, or unassigned, Rating categories are established on a lower level by determining precision/recall values for each category, and generating higher level category rating attributes from the lower-level rating steps. This is done by associating one or more of: aa) weak category, bb) existing source/sink relationship between categories, cc) close categories to the categories, and deriving an overall quality measure for the training base from the lower-level and higher-level rating step. The lower-level and higher-level evaluation results are stored.Type: GrantFiled: June 5, 2003Date of Patent: November 13, 2007Assignee: International Business Machines CorpInventors: Peter Gerstl, Ulrich Hofmann, Alexander Lang
-
Patent number: 7107528Abstract: The present invention relates to electronic information processing. In particular, it relates to a method and system for processing a document, which comprises text information, comprising monitoring the occurrence of incomplete time-related citations, in particular the citation of a date, within the text information, and completing said incomplete citation. In order to improve methods of automatic completion of time-related citations in documents, the inventional method completes incomplete citations of a date, within a text of a document by applying (160) a set of predetermined completing rules by using all time information relating to the document. The sources of time information are the text itself, the document “container” and the enclosing applications e.g. a word processor. Thus, e.g. search engines can find such documents in the Internet by entering any complete or incomplete dates. Using an index can optimize and speed up the search for relevant documents.Type: GrantFiled: October 9, 2003Date of Patent: September 12, 2006Assignee: International Business Machines CorporationInventors: Peter Gerstl, Brian Heumann
-
Publication number: 20060190830Abstract: The present invention relates to electronic mail. In particular, it relates to a method and system for processing electronic mail, wherein mails are stored in a space efficient way by removing redundancy from the content. Prior art is known for doing a limited version of this on a mail client.Type: ApplicationFiled: January 3, 2006Publication date: August 24, 2006Inventors: Peter Gerstl, Magnus Karlsson, Dirk Seider, Oliver Suhre
-
Publication number: 20040123240Abstract: The present invention relates to electronic information processing. In particular, it relates to a method and system for processing a document, which comprises text information, comprising monitoring the occurrence of incomplete time-related citations, in particular the citation of a date, within the text information, and completing said incomplete citation. In order to improve methods of automatic completion of time-related citations in documents, the inventional method completes incomplete citations of a date, within a text of a document by applying (160) a set of predetermined completing rules by using all time information relating to the document. The sources of time information are the text itself, the document “container” and the enclosing applications e.g. a word processor. Thus, e.g. search engines can find such documents in the Internet by entering any complete or incomplete dates. Using an index can optimize and speed up the search for relevant documents.Type: ApplicationFiled: October 9, 2003Publication date: June 24, 2004Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Peter Gerstl, Brian Heumann
-
Publication number: 20040030723Abstract: A computerized method and system of document analysis. The method and system categorise documents according to a taxonomy. This is accomplished by rating training documents on a lower level by associating either of the following predicates to a training document: either correct, inbound, outbound, or unassigned, Rating categories are established on a lower level by determining precision/recall values for each category, and generating higher level category rating attributes from the lower-level rating steps. This is done by associating one or more of: aa) weak category, bb) existing source/sink relationship between categories, cc) close categories to the categories, and deriving an overall quality measure for the training base from the lower-level and higher-level rating step. The lower-level and higher-level evaluation results are stored.Type: ApplicationFiled: June 5, 2003Publication date: February 12, 2004Applicant: International Business Machines CorporationInventors: Peter Gerstl, Ulrich Hofmann, Alexander Lang
-
Patent number: 6446061Abstract: This mechanism relates to a method within the area of information mining within a multitude of documents stored on computer systems. More particularly, this mechanism relates to a computerized method of generating a content taxonomy of a multitude of electronic documents. The technique proposed by the current invention is able to improve at the same time the scalability and the coherence and selectivity of taxonomy generation. The fundamental approach of the current invention comprises a subset selection step, wherein a subset of a multitude of documents is being selected. In a taxonomy generation step a taxonomy is generated for that selected subset of documents, the taxonomy being a tree structured taxonomy hierarchy. Moreover this method comprises a routing selection step assigning each unprocessed document to the taxonomy hierarchy based on largest similarity.Type: GrantFiled: June 30, 1999Date of Patent: September 3, 2002Assignee: International Business Machines CorporationInventors: Jochen Doerre, Peter Gerstl, Sebastian Goeser, Adrian Mueller, Roland Seiffert