Einrichtungen
language version: Deutsch
University from A-Z
Bielefeld University > Faculty of Technology > Research > Technical Reports

Technical Reports of the Faculty of Technology

2008 2007 2006 2005 2004 2003 2002 2001 2000 1999 1998 1997 1996 1995 1994 before 1994 MOSYS

Guide how to create a Technical Report.





2008      
On Parsimony Haplotyping Ferdinando Cicalese, Martin Milanic 2008-04 PDF
Computing with Priced Information: game trees and the value dependent cost model. Ferdinando Cicalese, Martin Milanic 2008-03 PDF
A Space Efficient Representation for Sparse de Bruijn Subgraphs José Augusto Amgarten Quitzau, Jens Stoye 2008-02 PDF
Online Abelian Pattern Matching Tahir Ejaz, Sven Rahmann, Jens Stoye 2008-01 PDF




2007      
2-Stage Fault Tolerant Interval Group Testing Ferdinando Cicalese, José Augusto Amgarten Quitzau 2007-02 PDF
Identifying metabolites with integer decomposition techniques, using only their mass spectrometric isotope patterns Sebastian Böcker, Matthias C. Letzel, Zsuzsanna Lipták, Anton Pervukhin 2007-01 PDF




2006      
On Common Intervals with Errors Cedric Chauve, Yoan Diekmann, Steffen Heber, Julia Mixtacki, Sven Rahmann, Jens Stoye 2006-02 PDF
Decomposing metabolomic isotope patterns Sebastian Böcker, Zsuzsanna Lipták, Anton Pervukhin 2006-01  




2005  
 
Statistics of Cleavage Fragments in Random Weighted Strings Hans-Michael Kaltenbach, Henner Sudek, Sebastian Böcker, Sven Rahmann 2005-06 PDF
Alignment of Tandem Repeats with Excision, Duplication, Substitution and Indels (EDSI) Michael Sammeth, Jens Stoye 2005-05 PDF
Counting Suffix Arrays and Strings Klaus-Bernd Schürmann, Jens Stoye 2005-04 PDF
Searching for the Shortest Common Supersequence Sergio A. de Carvalho Jr., Sven Rahmann 2005-03  
Two batch Fault-tolerant search with error cost constraints: An application to learning Ferdinando Cicalese 2005-02  
Overlaps Help: Improved Bounds for Group Testing with Interval Queries Ferdinando Cicalese, Peter Damaschke, Libertad Tansini, Sören Werth 2005-01  




2004      
Compressed Representation of Sequences and Full-Text Indexes Paolo Ferragina, Giovanni Manzini, Veli Mäkinen, Gonzalo Navarro 2004-05  
Optimal Group Testing Strategies with Interval Queries and Their Application to Splice Site Detection Ferdinando Cicalese, Peter Damaschke, Ugo Vaccaro 2004-04  
Accelerating the Evaluation of Profile HMMs by Pruning Techniques Thomas Plötz, Gernot A. Fink 2004-03  
The Money Changing Problem revisited: Computing the Frobenius number in time O(k a1) Sebastian Böcker, Zsuzsanna Lipták 2004-02 PDF
Sequencing From Compomers is NP-hard Sebastian Böcker 2004-01  




2003      
Genalyzer: An Interactive Visualisation Tool for Large-Scale Sequence Matching -- Biological Applications and User Manual Jomuna V. Choudhuri, Chris Schleiermacher 2003-08  
Sequencing from compomers in the presence of false negative peaks Sebastian Böcker 2003-07  
Suffix Tree Construction and Storage with Limited Main Memory Klaus-Bernd Schürmann, Jens Stoye 2003-06 PDF
Systematic Investigation of Jumping Alignments Constantin Bannert 2003-05  
Sequencing from compomers: Using mass spectrometry for DNA de-novo sequencing of 200+ nt Sebastian Böcker 2003-04  
From RNA Folding to Thermodynamic Matching, including Pseudoknots Robert Giegerich, Jens Reeder 2003-03  
SNP and mutation discovery using base-specific cleavage and MALDI-TOF mass spectrometry Sebastian Böcker 2003-02  
On the Similarity of Sets of Permutations and its Applications to Genome Comparison Anne Bergeron, Jens Stoye 2003-01  




2002      
Branching of Fuzzy Quantifiers and Multiple Variable Binding: An Extension of DFS Theory Ingo Glöckner 2002-08  
Fundamentals of Fuzzy Quantification: Plausible Models, Constructive Principles, and Efficient Implementation Ingo Glöckner 2002-07  
Calculating Residue Flexibility Information from Statistics and Energy based Prediction Frank Zöllner, Steffen Neumann, Kerstin Koch, Franz Kummert, Gerhard Sagerer 2002-06  
ElMaR: A Protein Docking System using Flexibility Information Frank Zöllner, Steffen Neumann, Kerstin Koch, Franz Kummert, Gerhard Sagerer 2002-05  
Side chain flexibility for 1:n protein-protein docking Kerstin Koch, Steffen Neumann, Frank Zöllner, Gerhard Sagerer 2002-04  
Lecture Notes on Algebraic Dynamic Programming 2002 Robert Giegerich 2002-03  
Simulation von Phasen hasenübergängen in Proteinmonoschichten Johanna Alichniewicz, Gabriele Holzschneider, Morris Michael, Ulf Schiller, Jan Stallkamp 2002-02  
Persistent Objects with O2DBI Jörn Clausen 2002-01  




2001      
Hierarchical Termination Revisited Enno Ohlebusch 2001-05  
Eine asynchrone Implementierung eines Microprozessors auf einem FPGA Marco Balke, Thomas Dettbarn, Robert Homann, Sebastian Jaenicke, Tim Köhler, Henning Mersch, Holger Weiss 2001-04  
A Rotamer Library for Protein-Protein Docking Using Energy Calculations and Statistics Kerstin Koch, Frank Zöllner, Gerhard Sagerer 2001-03  
Causal System Analysis Peter B. Ladkin 2001-02  
Standard Models of Fuzzy Quantification Ingo Glöckner 2001-01  




2000      
Difficulties when Aligning Structure Based RNAs with the Standard Edit Distance Method Christian Büschking 2000-08  
Systematic Dynamic Programming in Bioinformatics (ISMB 2000 Tutorial Notes) Dirk J. Evers, Robert Giegerich 2000-07 PDF
The Syntax and Semantics of a Language for Describing Complex Patterns in Biological Sequences Dirk Strothmann, Stefan Kurtz, Stefan Gräf, Gerhard Steger 2000-06  
Computergestützte Auswertung von Spektren organischer Verbindungen Annika Büscher, Michaela Hohenner, Sascha Wendt, Markus Wiesecke, Frank Zöllner, Arne Wegener, Frank Bettenworth, Thorsten Twellmann, Jan Kleinlützum, Mathias Katzer, Sven Wachsmuth, Gerhard Sagerer 2000-05  
Affix Trees Jens Stoye 2000-04 PDF
An Axiomatic Theory of Fuzzy Quantifiers in Natural Languages Ingo Glöckner 2000-03  
A Broad Class of DFS Models Ingo Glöckner 2000-02  
Advances in DFS Theory Ingo Glöckner 2000-01  




1999      
Autonomie für situierte Robotersysteme -- Stand und Entwicklungslinien Alois Knoll 99-06  
A Systematic Approach to Dynamic Programming in Bioinformatics. Part 1 and 2: Sequence Comparison and RNA Folding Robert Giegerich 99-05 PDF
Towards Evaluation of Docking Hypotheses using elastic Matching Steffen Neumann, Stefan Posch, Gerhard Sagerer 99-04  
A Framework for Evaluating Approaches to Fuzzy Quantification Ingo Glöckner 99-03  
Transforming Conditional Rewrite Systems with Extra Variables into Unconditional Systems Enno Ohlebusch 99-02  
Entscheidungskalküle Axel Saalbach, Christian Lange, Sascha Wendt, Mathias Katzer, Guillaume Dubois, Michael Höhl, Oliver Kuhn, Sven Wachsmuth, Gerhard Sagerer 99-01  




1998      
Reducing the Space Requirement of Suffix Trees Stefan Kurtz 98-03  
A Declarative Approach to the Development of Dynamic Programming Algorithms, Applied to RNA Folding Robert Giegerich 98-02 PDF
Kognitive Aspekte bei der Realisierung eines robusten Robotersystems für Konstruktionsaufgaben Alois Knoll, Bernd Hildebrandt 98-01  




1997      
DFS -- An Axiomatic Approach to Fuzzy Quantification Ingo Glöckner 97-06  
Fuzzy Quantifiers for Processing Natural Language Queries in Content-Based Multimedia Retrieval Systems Ingo Glöckner, Alois Knoll 97-05  
Rose: Generating Sequence Families Jens Stoye, Dirk Evers, Folker Meyer 97-04 PDF
A System for the Content-Based Retrieval of Textual and Non-Textual Documents Based on Natural Language Queries Alois Knoll, Ingo Glöckner, Hermann Helbig, Sven Hartrumpf 97-03  
Divide-and-Conquer Multiple Sequence Alignment Jens Stoye 97-02 PDF
Analysing the Cali Accident With a WB-Graph Peter Ladkin 97-01  




1996      
News and Comment on the AeroPeru B757 Accident Peter Ladkin 96-16  
A Note on a Note on a Lemma of Ladkin Peter Ladkin 96-15  
Some Dubious Theses in the Tense Logic of Accidents Peter Ladkin 96-14  
Explaining Failure with Tense Logic Peter Ladkin 96-13  
Formalism Helps in Describing Accidents Peter Ladkin 96-12  
On Needing Models Peter Ladkin 96-11  
Comments on Confusing Conversation at Cali Dafydd Gibbon, Peter Ladkin 96-10  
Reasons and Causes Peter Ladkin 96-09  
The X-31 and A320 Warsaw Crashes: Whodunnit? Peter Ladkin 96-08  
Formal but Lively Buffers in TLA+ Peter Ladkin 96-07  
Lazy Cache Implements Complete Cache Peter Ladkin 96-06  
Future University Computing Resources Peter Ladkin 96-05  
An Algebraic Approach to General Boolean Constraint Problems Hans-Werner Güsgen, Peter Ladkin 96-04  
Correctness in System Engineering Peter Ladkin 96-03  
Instructing Cooperating Assembly Robots through Situated Dialogues in Natural Language Alois Knoll, Bernd Hildebrand, Jianwei Zhang 96-02  
Static and Dynamic Filtering Methods for Approximate String Matching Robert Giegerich, Frank Hischke, Stefan Kurtz, Enno Ohlebusch 96-01 PDF




1995      
On the Equivalence Problem for E-Pattern Languages Enno Ohlebusch, Esko Ukkonen 95-04 PDF
Fundamental Algorithms for a Declarative Pattern Matching System Stefan Kurtz 95-03 PDF
Computer Based Training-Software: ein interaktiver Sequenzierkurs Frank Meier, Garrit Skrock, Robert Giegerich 95-02  
PaNaMa User Manual V1.3 Bernd Bütow, Stephan Thesing 95-01  




1994      
Reverse Restructuring: Another Method of Solving Algebraic Equations Bernd Bütow, Stephan Thesing 94-07 PDF
A Basic Semantics for Computer Arithmetic Markus Freericks, A. Fauth, Alois Knoll 94-06  
Searching Correspondences in Colour Stereo Images -- Recent Results Using the Fuzzy Integral André Wolfram, Alois Knoll 94-05  
Die Verwendung unscharfer Maße zur Korrespondenzanalyse in Stereo Farbbildern André Wolfram, Alois Knoll 94-04  
From Ukkonen to McCreight and Weiner: A Unifying View of Linear-Time Suffix Tree Construction Robert Giegerich, Stefan Kurtz 94-03 PDF
Analysis and Applications of the Direct Cascade Architecture Enno Littmann, Helge Ritter 94-02  
Modular Properties of Composable Term Rewriting Systems Enno Ohlebusch 94-01

PDF





before 1994      
A Comparison of IMperative and Purely Functional Suffix Tree Constructions Robert Giegerich, Stefan Kurtz 14

PDF

On the Modularity of Termination of Term Rewriting Systems Enno Ohlebusch 11

PDF

Embedding Sequence Analysis in the Functional Programming Paradigm - A Feasibility Study Robert Giegerich 8

PDF

A Note on Simple Termination of Infinite Term Rewriting Systems Enno Ohlebusch 7

PDF

Combinations of Simplifying Conditional Term Rewriting Systems Enno Ohlebusch 6 PDF
Narrowing and Basic Forward Closures Stefan Kurtz 5 PDF




MOSYS Reports      
Knowledge-Level Modularization of a Complex Knowledge Base Josef Meyer-Fujara, Barbara Heller, Sonja Schlegelmilch, Ipke Wachsmuth 16 PDF
Structuring and Modules for Knowledge Bases: Motivation for a new model Grigoris Antoniou, Ipke Wachsmuth 14 PDF
Evaluation hybrider Expertensystemtools Sonja Schlegelmilch, Barbara Heller, Thomas Linke, Josef Meyer-Fujara 13 PDF
Modularization of Knowledge: A Competence-Oriented Approach Barbara Heller, Sonja Schlegelmilch 12 PDF
Assoziative Zuordnung und Suche von Wissen in einer thematisch strukturierten Wissensbasis Barbara Gängler, Marianne Greten, Thomas Linke, Ipke Wachsmuth 11 PDF
HYPERCON: Modulare Wissensbasen für Hypertonie-Konsultation Ipke Wachsmuth, Barbara Heller, Josef Meyer-Fujara 10 PDF
Wissensrepräsentation und kognitive Modelle Ipke Wachsmuth 8 PDF
Description of Obstacles in Planning Josef Meyer-Fujara 7 PDF
Knowledge Packets and Knowledge Packet Structures Ipke Wachsmuth, Barbara Gängler 6 PDF
An Introduction to Dynamic Concept Systems Herbert Jaeger 5 PDF
Addressing the Retrieval Problem in Large Knowledge Bases Ipke Wachsmuth, Josef Meyer-Fujara 3 PDF
Modellierung von Wissenspaketstrukturen mit Hilfe eines Reason-Maintenance-Systems Josef Meyer-Fujara 2 PDF
Modularisierung wissensbasierter Systeme Ipke Wachsmuth 1 PDF




 

Technical Reports of the Faculty of Technology - A User Guide

Currently the person in charge of the Technical Reports is Wolfgang Gerlach (wgerlach@cebitec.uni-bielefeld.de).

Technical Reports

The Technical Reports (Forschungsberichte) are a series of papers published by the Faculty of Technology, Department of Information Technology (Technische Fakultät, Abteilung Informationstechnik). They are not peer reviewed.

Each TR is identified by a unique ID (e.g. "2003-03"). In order to get an ID, a potential author has to contact the TR maintainer. He/She will assign a fresh ID and will give the author instructions on how to proceed with the report.

Each report has a title page conforming to the corporate identity of the university/department. Appended to each report is a list of all previous reports. This "envelope" is created by the TR maintainer and handed to the author for inclusion in his/her report.

Writing Technical Reports

There are only very few restrictions for creating a technical report. The author may use any text processing software he/she deems suitable. The only demands are the use of a paper size of DIN A4 (297mm height, 210mm width), and the possibility to export the report either as a PostScript or PDF file. Potential authors are advised to check exisiting reports as reference for style, size and length.

Although the report is headed by the title page supplied by the TR maintainer, the author is free to create an additional title section, e.g. by using LaTeX's maketitle command, so the paper is self-contained, even without the TR envelope.

When contacting the TR maintainer, please state the title and the complete list of authors of your report. Currently, it is not necessary to hand the report itself to the TR maintainer.

Creating a Printable Version of a Report

When the report is finished, and the TR maintainer is informed, he/she will issue the report ID and send the author two PostScript files. They contain the front and back cover for creating the final version of the report. The files are called ID.ps-front and ID.ps-back, where ID is the actual ID of the report.

When printing and binding the report, this envelope can simply be placed around the author's text to create the final paper. For creating an electronic version of the report, several techniques are possible:

  • In a Unix environment, when the raw report is available as a PostScript file (e.g. report.ps), the program ps2pdf13 (part of Ghostscript) can be used to create a PDF file containing the complete report:

    cat ID.ps-front report.ps ID.ps-back | ps2pdf13 - > report.pdf

  • If available, the Adobe Acrobat Distiller can be used in a similar fashion:

    cat ID.ps-front report.ps ID.ps-back | distill > report.pdf

  • Different products by Adobe or other companies, usually available for PCs running Windows or Apple Macintoshs, can probably be used for similar effects. A complete list and detailed explanations are beyond the scope of this document.

Publishing a Report

There is currently no complete on-line collection of all Technical Reports. Older Reports are available on the university's FTP server. Authors may use the BieSOn service (Bielefelder Server für Online-Publikationen) for publishing their report. Please follow the instructions (currently available only in german) for submitting a paper to this collection. As an alternative/addition, the author can simply link the report via his/her web home page and let Google (english or german version) do the rest. If an online version is available, please inform the TR maintainer, so he/she can add an appropriate link to the list of all Technical Reports.

Technical Reports Archive

The Dean's office requires a binded version for the Technical Reports archive. Currently Renate Schneider (renate@techfak.uni-bielefeld.de) is collecting them.