@article{Schulze2014, author = {Schulze, Gunnar}, title = {Workflow for rapid metagenome analysis}, series = {Process design for natural scientists: an agile model-driven approach}, journal = {Process design for natural scientists: an agile model-driven approach}, number = {500}, publisher = {Springer}, address = {Berlin}, isbn = {978-3-662-45005-5}, issn = {1865-0929}, pages = {88 -- 100}, year = {2014}, abstract = {Analyses of metagenomes in life sciences present new opportunities as well as challenges to the scientific community and call for advanced computational methods and workflows. The large amount of data collected from samples via next-generation sequencing (NGS) technologies render manual approaches to sequence comparison and annotation unsuitable. Rather, fast and efficient computational pipelines are needed to provide comprehensive statistics and summaries and enable the researcher to choose appropriate tools for more specific analyses. The workflow presented here builds upon previous pipelines designed for automated clustering and annotation of raw sequence reads obtained from next-generation sequencing technologies such as 454 and Illumina. Employing specialized algorithms, the sequence reads are processed at three different levels. First, raw reads are clustered at high similarity cutoff to yield clusters which can be exported as multifasta files for further analyses. Independently, open reading frames (ORFs) are predicted from raw reads and clustered at two strictness levels to yield sets of non-redundant sequences and ORF families. Furthermore, single ORFs are annotated by performing searches against the Pfam database}, language = {en} } @article{Vierheller2014, author = {Vierheller, Janine}, title = {Exploratory Data Analysis}, series = {Process Design for Natural Scientists: an agile model-driven approach}, journal = {Process Design for Natural Scientists: an agile model-driven approach}, number = {500}, editor = {Lambrecht, Anna-Lena and Margaria, Tiziana}, publisher = {Axel Springer Verlag}, address = {Berlin}, isbn = {978-3-662-45005-5}, issn = {1865-0929}, pages = {110 -- 126}, year = {2014}, abstract = {In bioinformatics the term exploratory data analysis refers to different methods to get an overview of large biological data sets. Hence, it helps to create a framework for further analysis and hypothesis testing. The workflow facilitates this first important step of the data analysis created by high-throughput technologies. The results are different plots showing the structure of the measurements. The goal of the workflow is the automatization of the exploratory data analysis, but also the flexibility should be guaranteed. The basic tool is the free software R.}, language = {en} } @article{Schuett2014, author = {Sch{\"u}tt, Christine}, title = {Identification of differentially expressed genes}, series = {Process design for natural scientists: an agile model-driven approach}, journal = {Process design for natural scientists: an agile model-driven approach}, number = {500}, publisher = {Springer}, address = {Berlin}, isbn = {978-3-662-45005-5}, issn = {1865-0929}, pages = {127 -- 139}, year = {2014}, abstract = {With the jABC it is possible to realize workflows for numerous questions in different fields. The goal of this project was to create a workflow for the identification of differentially expressed genes. This is of special interest in biology, for it gives the opportunity to get a better insight in cellular changes due to exogenous stress, diseases and so on. With the knowledge that can be derived from the differentially expressed genes in diseased tissues, it becomes possible to find new targets for treatment.}, language = {en} } @article{Kuntzsch2014, author = {Kuntzsch, Christian}, title = {Visualization of data transfer paths}, series = {Process design for natural scientists: an agile model-driven approach}, journal = {Process design for natural scientists: an agile model-driven approach}, number = {500}, publisher = {Springer}, address = {Berlin}, isbn = {978-3-662-45005-5}, issn = {1865-0929}, pages = {140 -- 148}, year = {2014}, abstract = {A workflow for visualizing server connections using the Google Maps API was built in the jABC. It makes use of three basic services: An XML-based IP address geolocation web service, a command line tool and the Static Maps API. The result of the workflow is an URL leading to an image file of a map, showing server connections between a client and a target host.}, language = {en} } @article{Hibbe2014, author = {Hibbe, Marcel}, title = {Spotlocator - Guess Where the Photo Was Taken!}, series = {Process Design for Natural Scientists: an agile model-driven approach}, journal = {Process Design for Natural Scientists: an agile model-driven approach}, number = {500}, editor = {Lambrecht, Anna-Lena and Margaria, Tiziana}, publisher = {Springer Verlag}, address = {Berlin}, isbn = {978-3-662-45005-5}, issn = {1865-0929}, pages = {149 -- 160}, year = {2014}, abstract = {Spotlocator is a game wherein people have to guess the spots of where photos were taken. The photos of a defined area for each game are from panoramio.com. They are published at http://spotlocator. drupalgardens.com with an ID. Everyone can guess the photo spots by sending a special tweet via Twitter that contains the hashtag \#spotlocator, the guessed coordinates and the ID of the photo. An evaluation is published for all tweets. The players are informed about the distance to the real photo spots and the positions are shown on a map.}, language = {en} } @article{Blaese2014, author = {Blaese, Leif}, title = {Data mining for unidentified protein squences}, series = {Process design for natural scientists: an agile model-driven approach}, journal = {Process design for natural scientists: an agile model-driven approach}, number = {500}, publisher = {Springer}, address = {Berlin}, isbn = {978-3-662-45005-5}, issn = {1865-0929}, pages = {73 -- 87}, year = {2014}, abstract = {Through the use of next generation sequencing (NGS) technology, a lot of newly sequenced organisms are now available. Annotating those genes is one of the most challenging tasks in sequence biology. Here, we present an automated workflow to find homologue proteins, annotate sequences according to function and create a three-dimensional model.}, language = {en} } @article{Lis2014, author = {Lis, Monika}, title = {Constructing a Phylogenetic Tree}, series = {Process Design for Natural Scientists: an agile model-driven approach}, journal = {Process Design for Natural Scientists: an agile model-driven approach}, number = {500}, editor = {Lambrecht, Anna-Lena and Margaria, Tiziana}, publisher = {Springer Verlag}, address = {Berlin}, isbn = {978-3-662-45005-5}, issn = {1865-0929}, pages = {101 -- 109}, year = {2014}, abstract = {In this project I constructed a workflow that takes a DNA sequence as input and provides a phylogenetic tree, consisting of the input sequence and other sequences which were found during a database search. In this phylogenetic tree the sequences are arranged depending on similarities. In bioinformatics, constructing phylogenetic trees is often used to explore the evolutionary relationships of genes or organisms and to understand the mechanisms of evolution itself.}, language = {en} } @phdthesis{Lincke2014, author = {Lincke, Jens}, title = {Evolving Tools in a Collaborative Self-supporting Development Environment}, school = {Universit{\"a}t Potsdam}, pages = {164}, year = {2014}, language = {en} } @phdthesis{Mueller2008, author = {M{\"u}ller, Claudia}, title = {Graphentheoretische Analyse der Evolution von Wiki-basierten Netzwerken f{\"u}r selbstorganisiertes Wissensmanagement}, address = {Potsdam}, pages = {x, 287 S. : graph. Darst.}, year = {2008}, language = {de} } @phdthesis{Gharib2008, author = {Gharib, Mona}, title = {Incremental answer set programming}, address = {Potsdam}, pages = {184 S. : graph. Darst.}, year = {2008}, language = {en} } @book{OPUS4-10652, title = {Proceedings of the 2nd International Workshop on e-learning and Virtual and Remote Laboratories}, series = {Technische Berichte des Hasso-Plattner-Instituts f{\"u}r Softwaresystemtechnik an der Universit{\"a}t Potsda}, volume = {21}, journal = {Technische Berichte des Hasso-Plattner-Instituts f{\"u}r Softwaresystemtechnik an der Universit{\"a}t Potsda}, editor = {Rabe, Bernhard and Rasche, Andreas}, publisher = {Universit{\"a}tsverlag Potsdam}, address = {Potsdam}, isbn = {978-3-940793-17-1}, issn = {1613-5652}, pages = {98 S.}, year = {2008}, language = {en} } @book{deCarvalhoJuergensen2008, author = {de Carvalho, Jackson Marques and J{\"u}rgensen, Helmut}, title = {Document authoring environments and authoring mathematics}, series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik}, volume = {2008, 1}, journal = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik}, publisher = {Univ.}, address = {Potsdam}, issn = {0946-7580}, pages = {8 S.}, year = {2008}, language = {en} } @book{GoesselOcheretnySogomonyanetal.2008, author = {Goessel, Michael and Ocheretny, Vitaly and Sogomonyan, Egor S. and Marienfeld, Daniel}, title = {New methods of concurrent checking}, series = {Frontiers in electronic testing}, volume = {42}, journal = {Frontiers in electronic testing}, publisher = {Springer}, address = {Dordrecht; Heidelberg}, isbn = {978-1-402-08419-5}, doi = {10.1007/978-1-4020-8420-1}, pages = {250 S.}, year = {2008}, language = {en} } @book{Tepoyan2008, author = {Tepoyan, Liparit}, title = {The Mixed problem for a degenerate operator equation}, series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Mathematik, Arbeitsgruppe Partiell}, journal = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Mathematik, Arbeitsgruppe Partiell}, publisher = {Univ.}, address = {Potsdam}, issn = {1437-739X}, pages = {13 S.}, year = {2008}, language = {en} } @book{KnobelsdorfKreitz2013, author = {Knobelsdorf, Maria and Kreitz, Christoph}, title = {Ein konstruktivistischer Lehransatz f{\"u}r die Einf{\"u}hrungsveranstaltung der Theoretische Informatik}, isbn = {978-3-86956-220-9}, year = {2013}, language = {de} } @phdthesis{Rasche2008, author = {Rasche, Andreas}, title = {Ausf{\"u}hrung und Entwicklung Adaptiver Komponentenbasierter Anwendungen}, address = {Potsdam}, isbn = {978-3-86727-698-6}, pages = {195 S., graph. Darst.}, year = {2008}, language = {de} } @phdthesis{Li2008, author = {Li, Nanjun}, title = {Modeling, Simulation and Evaluation of TCP/IP Networks}, address = {Potsdam}, pages = {124 S., ii-xi, : graph. Darst.}, year = {2008}, language = {en} } @phdthesis{Rasche2008, author = {Rasche, Andreas}, title = {Ausf{\"u}hrung und Entwicklung adaptiver komponentenbasierter Anwendungen}, publisher = {Cuvillier}, address = {G{\"o}ttingen}, isbn = {978-3-86727-698-6}, pages = {195 S.: graph. Darst.}, year = {2008}, language = {de} } @phdthesis{Troeger2008, author = {Tr{\"o}ger, Peter}, title = {Dynamische Ressourcenverwaltung f{\"u}r dienstbasierte Software-Systeme}, publisher = {Cuvillier}, address = {G{\"o}ttingen}, isbn = {978-3-86727-622-1}, pages = {v, 174 S.: Ill., garph. Darst.}, year = {2008}, language = {de} } @phdthesis{Li2008, author = {Li, Nanjun}, title = {Modeling, simulation and evaluation of TCP/IP Networks}, pages = {xi, 124 S.: graph. Drst.}, year = {2008}, language = {en} } @phdthesis{Troeger2008, author = {Tr{\"o}ger, Peter}, title = {Dynamische Ressourcenverwaltung f{\"u}r dienstbasierte Software-Systeme}, address = {Potsdam}, pages = {174 S., graph. Darst.}, year = {2008}, language = {de} } @book{BrauerKarp2008, author = {Brauer, Uwe and Karp, Lavi}, title = {Well-posedness of Einstein-Euler Systems in asymptotically flat spacetimes}, series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Mathematik, Arbeitsgruppe Partiell}, journal = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Mathematik, Arbeitsgruppe Partiell}, publisher = {Univ.}, address = {Potsdam}, issn = {1437-739X}, pages = {83 S.}, year = {2008}, language = {en} } @phdthesis{Kratzke2007, author = {Kratzke, Nane}, title = {Modellbasierte Analyse interorganisationaler Wissensfl{\"u}sse}, publisher = {Gito-Verl.}, address = {Berlin}, isbn = {978-3-936771-92-3}, pages = {223 S. : graph. Darst.}, year = {2007}, language = {de} } @misc{MarquesdeCarvalhoJuergensen2007, author = {Marques de Carvalho, Jackson W. and J{\"u}rgensen, Helmut}, title = {Flexible Structured Mathematics Notation : IADIS, International Conference Interfaces and Human Computer Interaction, Lisabon, 2007}, series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik}, volume = {2007, 1}, journal = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik}, publisher = {Univ.}, address = {Potsdam}, issn = {0946-7580}, pages = {5 S.}, year = {2007}, language = {en} } @misc{StoepelSchubertMargariaSteffen2007, author = {St{\"o}pel, Christoph and Schubert, Wolfgang and Margaria-Steffen, Tiziana}, title = {Plug-ins und Dienste : Ans{\"a}tze zu Bew{\"a}ltigung zeitvarianter Gesch{\"a}ftsprozesse}, series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik}, volume = {2007, 2}, journal = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik}, publisher = {Univ.}, address = {Potsdam}, issn = {0946-7580}, pages = {14 S.}, year = {2007}, language = {de} } @book{MargariaKubczakSteffen2007, author = {Margaria, Tiziana and Kubczak, Christian and Steffen, Bernhard}, title = {Bio-jETI: a Service Integration, Design, and Provisioning Platform for Orchestrated Bioinformatics Processes - ("part of From Components to Processes")}, series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik}, volume = {2007, 4}, journal = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik}, publisher = {Univ.}, address = {Potsdam}, issn = {0946-7580}, pages = {16 S.}, year = {2007}, language = {en} } @book{Weske2007, author = {Weske, Mathias}, title = {Business Process Management : Concepts, Languages, Architectures}, publisher = {Springer-Verlag Berlin Heidelberg}, address = {Berlin, Heidelberg}, isbn = {978-3-540-73521-2}, doi = {10.1007/978-3-540-73522-9}, pages = {368 S.}, year = {2007}, language = {en} } @book{Margaria2007, author = {Margaria, Tiziana}, title = {Proceedings / EuroSPI 2007, European Software Process Improvement, 26.-28.09.2007, University of Potsdam, Germany}, editor = {Messnarz, Richard}, publisher = {ASQF}, address = {Erlangen}, isbn = {978-3-9809145-6-7}, pages = {Getr. Z{\"a}hl.}, year = {2007}, language = {en} } @phdthesis{Puhlmann2007, author = {Puhlmann, Frank}, title = {On the application of a theory for mobile systems to business process management}, address = {Potsdam}, pages = {xiv, 219 S. : graph. Darst.}, year = {2007}, language = {en} } @book{AbrahamssonBaddooMargariaetal.2007, author = {Abrahamsson, Pekka and Baddoo, Nathan and Margaria, Tiziana and Messnarz, Richard}, title = {Software Process Improvement : 14th europea conference, EuroSpi 2007, Potsdam, Germany, September 26-28, 2007 ; Proceedings}, series = {Lecture Notes in Computer Science}, volume = {4764}, journal = {Lecture Notes in Computer Science}, publisher = {Springer}, address = {Berlin}, pages = {223 S.}, year = {2007}, language = {en} } @book{PolyvyanyyKuropka2007, author = {Polyvyanyy, Artem and Kuropka, Dominik}, title = {A Quantitative Evalution of the Enhanced Topic-based Vector Space Model}, series = {Technische Berichte des Hasso-Plattner-Instituts f{\"u}r Softwaresystemtechnik an der Universit{\"a}t Potsda}, volume = {19}, journal = {Technische Berichte des Hasso-Plattner-Instituts f{\"u}r Softwaresystemtechnik an der Universit{\"a}t Potsda}, publisher = {Universit{\"a}tsverlag Potsdam}, address = {Potsdam}, isbn = {978-3-939469-95-7}, issn = {1613-5652}, pages = {88 S.}, year = {2007}, language = {en} } @phdthesis{Kuznetsov2007, author = {Kuznetsov, Grigory}, title = {Fehlererkennung in systemmetrischen Block-Chiffren}, address = {Potsdam}, pages = {118 S. : graph. Darst.}, year = {2007}, language = {de} } @phdthesis{Rzeha2007, author = {Rzeha, Jan}, title = {Generation and Storage of Diagnosis Data On-Chip}, address = {Potsdam}, pages = {VII, 94 S. : graph. Darst.}, year = {2007}, language = {en} } @phdthesis{Marienfeld2007, author = {Marienfeld, Daniel}, title = {Effiziente Fehlerkennung f{\"u}r arithmetische Einheiten}, address = {Potsdam}, pages = {VIII, 122 S. : graph. Darst.}, year = {2007}, language = {de} } @article{GrellSchaubSelbig2006, author = {Grell, Susanne and Schaub, Torsten H. and Selbig, Joachim}, title = {Modelling biological networks by action languages via set programming}, issn = {0302-9743}, doi = {10.1007/11799573}, year = {2006}, language = {en} } @article{DelgrandeSchaubTompits2006, author = {Delgrande, James Patrick and Schaub, Torsten H. and Tompits, Hans}, title = {A Preference-Based Framework for Updating logic Programs : preliminary reports}, year = {2006}, language = {en} } @article{GressmannJanhunenMerceretal.2006, author = {Gressmann, Jean and Janhunen, Tomi and Mercer, Robert E. and Schaub, Torsten H. and Thiele, Sven and Tichy, Richard}, title = {On probing and multi-threading in platypus}, year = {2006}, language = {en} } @book{OPUS4-11818, title = {Accessible Media : Pre-Proceedings of a Workshop Potsdam 8-9 May, 2006}, series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik}, volume = {2006, 7}, journal = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik}, editor = {J{\"u}rgensen, Helmut}, publisher = {Univ.}, address = {Potsdam}, issn = {0946-7580}, year = {2006}, language = {en} } @book{Krahmer2006, author = {Krahmer, Sebastian}, title = {Generating runtime call graphs}, series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik}, volume = {2006, 8}, journal = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik}, publisher = {Univ.}, address = {Potsdam}, issn = {0946-7580}, pages = {16 S.}, year = {2006}, language = {en} } @book{JeskeBrehmerMengeetal.2006, author = {Jeske, Janin and Brehmer, Bastian and Menge, Falko and H{\"u}ttenrauch, Stefan and Adam, Christian and Sch{\"u}ler, Benjamin and Schult, Wolfgang and Rasche, Andreas and Polze, Andreas}, title = {Aspektorientierte Programmierung : {\"U}berblick {\"u}ber Techniken und Werkzeuge}, series = {Technische Berichte des Hasso-Plattner-Instituts f{\"u}r Softwaresystemtechnik an der Universit{\"a}t Potsda}, volume = {14}, journal = {Technische Berichte des Hasso-Plattner-Instituts f{\"u}r Softwaresystemtechnik an der Universit{\"a}t Potsda}, publisher = {Universit{\"a}tsverlag Potsdam}, address = {Potsdam}, isbn = {3-939469-23-8}, issn = {1613-5652}, pages = {88 S.}, year = {2006}, language = {de} } @phdthesis{Leininger2006, author = {Leininger, Andreas}, title = {New diagnosis and test methods with high compaction rates}, publisher = {Mensch \& Buch Verl.}, address = {Berlin}, isbn = {3-86664-066-8}, pages = {IX, 98 S. : Ill., graph. Darst.}, year = {2006}, language = {en} } @article{AngerGebserSchaub2006, author = {Anger, Christian and Gebser, Martin and Schaub, Torsten H.}, title = {Approaching the core of unfounded sets}, year = {2006}, language = {en} } @article{ShenoyKrauledatBlankertzetal.2006, author = {Shenoy, Pradeep and Krauledat, Matthias and Blankertz, Benjamin and Rao, Rajesh P. N. and M{\"u}ller, Klaus-Robert}, title = {Towards adaptive classification for BCI}, doi = {10.1088/1741-2560/3/1/R02}, year = {2006}, abstract = {Non-stationarities are ubiquitous in EEG signals. They are especially apparent in the use of EEG-based brain- computer interfaces (BCIs): (a) in the differences between the initial calibration measurement and the online operation of a BCI, or (b) caused by changes in the subject's brain processes during an experiment (e.g. due to fatigue, change of task involvement, etc). In this paper, we quantify for the first time such systematic evidence of statistical differences in data recorded during offline and online sessions. Furthermore, we propose novel techniques of investigating and visualizing data distributions, which are particularly useful for the analysis of (non-) stationarities. Our study shows that the brain signals used for control can change substantially from the offline calibration sessions to online control, and also within a single session. In addition to this general characterization of the signals, we propose several adaptive classification schemes and study their performance on data recorded during online experiments. An encouraging result of our study is that surprisingly simple adaptive methods in combination with an offline feature selection scheme can significantly increase BCI performance}, language = {en} } @article{Bobda2009, author = {Bobda, Christophe}, title = {Special issue on ReCoSoC 2007 : editorial}, issn = {0141-9331}, doi = {10.1016/j.micpro.2009.01.001}, year = {2009}, language = {en} } @article{BlankertzDornhegeKrauledatetal.2006, author = {Blankertz, Benjamin and Dornhege, Guido and Krauledat, Matthias and M{\"u}ller, Klaus-Robert and Kunzmann, Volker and Losch, Florian and Curio, Gabriel}, title = {The Berlin brain-computer interface : EEG-based communication without subject training}, issn = {1534-4320}, doi = {10.1109/Tnsre.2006.875557}, year = {2006}, abstract = {The Berlin Brain-Computer Interface (BBCI) project develops a noninvasive BCI system whose key features are 1) the use of well-established motor competences as control paradigms, 2) high-dimensional features from 128-channel electroencephalogram (EEG), and 3) advanced machine learning techniques. As reported earlier, our experiments demonstrate that very high information transfer rates can be achieved using the readiness potential (RP) when predicting the laterality of upcoming left-versus right-hand movements in healthy subjects. A more recent study showed that the RP similarily accompanies phantom movements in arm amputees, but the signal strength decreases with longer loss of the limb. In a complementary approach, oscillatory features are used to discriminate imagined movements (left hand versus right hand versus foot). In a recent feedback study with six healthy subjects with no or very little experience with BCI control, three subjects achieved an information transfer rate above 35 bits per minute (bpm), and further two subjects above 24 and 15 bpm, while one subject could not achieve any BCI control. These results are encouraging for an EEG-based BCI system in untrained subjects that is independent of peripheral nervous system activity and does not rely on evoked potentials even when compared to results with very well-trained subjects operating other BCI systems}, language = {en} } @phdthesis{Mueller2016, author = {M{\"u}ller, Stephan Heinz}, title = {Aggregates Caching for Enterprise Applications}, school = {Universit{\"a}t Potsdam}, pages = {167}, year = {2016}, abstract = {The introduction of columnar in-memory databases, along with hardware evolution, has made the execution of transactional and analytical enterprise application workloads on a single system both feasible and viable. Yet, we argue that executing analytical aggregate queries directly on the transactional data can decrease the overall system performance. Despite the aggregation capabilities of columnar in-memory databases, the direct access to records of a materialized aggregate is always more efficient than aggregating on the fly. The traditional approach to materialized aggregates, however, introduces significant overhead in terms of materialized view selection, maintenance, and exploitation. When this overhead is handled by the application, it increases the application complexity, and can slow down the transactional throughput of inserts, updates, and deletes. In this thesis, we motivate, propose, and evaluate the aggregate cache, a materialized aggregate engine in the main-delta architecture of a columnar in-memory database that provides efficient means to handle costly aggregate queries of enterprise applications. For our design, we leverage the specifics of the main-delta architecture that separates a table into a main and delta partition. The central concept is to only cache the partial aggregate query result as defined on the main partition of a table, because the main partition is relatively stable as records are only inserted into the delta partition. We contribute by proposing incremental aggregate maintenance and query compensation techniques for mixed workloads of enterprise applications. In addition, we introduce aggregate profit metrics that increase the likelihood of persisting the most profitable aggregates in the aggregate cache. Query compensation and maintenance of materialized aggregates based on joins of multiple tables is expensive due to the partitioned tables in the main-delta architecture. Our analysis of enterprise applications has revealed several data schema and workload patterns. This includes the observation that transactional data is persisted in header and item tables, whereas in many cases, the insertion of related header and item records is executed in a single database transaction. We contribute by proposing an approach to transport these application object semantics to the database system and optimize the query processing using the aggregate cache by applying partition pruning and predicate pushdown techniques. For the experimental evaluation, we propose the FICO benchmark that is based on data from a productive ERP system with extracted mixed workloads. Our evaluation reveals that the aggregate cache can accelerate the execution of aggregate queries up to a factor of 60 whereas the speedup highly depends on the number of aggregated records in the main and delta partitions. In mixed workloads, the proposed aggregate maintenance and query compensation techniques perform up to an order of magnitude better than traditional materialized aggregate maintenance approaches. The introduced aggregate profit metrics outperform existing costbased metrics by up to 20\%. Lastly, the join pruning and predicate pushdown techniques can accelerate query execution in the aggregate cache in the presence of multiple partitioned tables by up to an order of magnitude.}, language = {en} } @phdthesis{Kilic2016, author = {Kilic, Mukayil}, title = {Vernetztes Pr{\"u}fen von elektronischen Komponenten {\"u}ber das Internet}, school = {Universit{\"a}t Potsdam}, pages = {104, XVI}, year = {2016}, language = {de} } @article{WilligMitschke2006, author = {Willig, Andreas and Mitschke, Robert}, title = {Results of bit error measurements with sensor nodes and casuistic consequences for design of energy-efficient error control schemes}, isbn = {978-3-540-32158-3}, year = {2006}, abstract = {For the proper design of energy-efficient error control schemes some insight into channel error patterns is needed. This paper presents bit error and packet loss measurements taken with sensor nodes running the popular RFM}, language = {en} } @article{RozinatVanderAalst2006, author = {Rozinat, A and Van der Aalst, Wil M. P.}, title = {Conformance testing: Measuring the fit and appropriateness of event logs and process models}, year = {2006}, abstract = {Most information systems log events (e.g., transaction logs, audit traits) to audit and monitor the processes they support. At the same time, many of these processes have been explicitly modeled. For example, SAP R/3 logs events in transaction logs and there are EPCs (Event-driven Process Chains) describing the so-called reference models. These reference models describe how the system should be used. The coexistence of event logs and process models raises an interesting question: "Does the event log conform to the process model and vice versa?". This paper demonstrates that there is not a simple answer to this question. To tackle the problem, we distinguish two dimensions of conformance: fitness (the event log may be the result of the process modeled) and appropriateness (the model is a likely candidate from a structural and behavioral point of view). Different metrics have been defined and a Conformance Checker has been implemented within the ProM Framework}, language = {en} } @article{GerbserSchaub2006, author = {Gerbser, Martin and Schaub, Torsten H.}, title = {Tableau calculi for answer set programming}, issn = {0302-9743}, doi = {10.1007/11799573}, year = {2006}, language = {en} } @article{Konczak2006, author = {Konczak, Kathrin}, title = {Voting Theory in Answer Set Programming}, year = {2006}, language = {en} } @article{AngerGebserJanhunenetal.2006, author = {Anger, Christian and Gebser, Martin and Janhunen, Tomi and Schaub, Torsten H.}, title = {What's a head without a body?}, year = {2006}, language = {en} } @article{GerbserLeeLierler2006, author = {Gerbser, Martin and Lee, Joohyung and Lierler, Yuliya}, title = {Elementary sets for logic programs}, isbn = {978-1-57735-281-5}, year = {2006}, language = {en} } @article{GerbserSchaub2006, author = {Gerbser, Martin and Schaub, Torsten H.}, title = {Characterizing (ASP) inferences by unit propagation}, year = {2006}, language = {en} } @article{Konczak2006, author = {Konczak, Kathrin}, title = {Weak order equivalence for Logic Programs with Prefernces}, year = {2006}, language = {en} } @article{DelgrandeSchaubTompits2007, author = {Delgrande, James Patrick and Schaub, Torsten H. and Tompits, Hans}, title = {A preference-based framework for updating logic programs}, isbn = {978-3-540- 72199-4}, year = {2007}, language = {en} } @article{MileoSchaub2007, author = {Mileo, Alessandra and Schaub, Torsten H.}, title = {Qualitative constraint enforcement in advanced policy specification}, year = {2007}, language = {en} } @article{DelgrandeLangSchaub2007, author = {Delgrande, James Patrick and Lang, J{\´e}r{\^o}me and Schaub, Torsten H.}, title = {Belief change based on global minimisation}, year = {2007}, language = {en} } @article{KonczakLinkeSchaub2006, author = {Konczak, Kathrin and Linke, Thomas and Schaub, Torsten H.}, title = {Graphs and colorings for answer set programming}, issn = {1471-0684}, doi = {10.1017/S1471068405002528}, year = {2006}, abstract = {We investigate the usage of rule dependency graphs and their colorings for characterizing and computing answer sets of logic programs. This approach provides us with insights into the interplay between rules when inducing answer sets. We start with different characterizations of answer sets in terms of totally colored dependency graphs that differ ill graph-theoretical aspects. We then develop a series of operational characterizations of answer sets in terms of operators on partial colorings. In analogy to the notion of a derivation in proof theory, our operational characterizations are expressed as (non-deterministically formed) sequences of colorings, turning an uncolored graph into a totally colored one. In this way, we obtain an operational framework in which different combinations of operators result in different formal properties. Among others, we identify the basic strategy employed by the noMoRe system and justify its algorithmic approach. Furthermore, we distinguish operations corresponding to Fitting's operator as well as to well-founded semantics}, language = {en} } @book{HuettenrauchKylauGrundetal.2006, author = {H{\"u}ttenrauch, Stefan and Kylau, Uwe and Grund, Martin and Queck, Tobias and Ploskonos, Anna and Schreiter, Torben and Breest, Martin and Haubrock, S{\"o}ren and Bouche, Paul}, title = {Fundamentals of Service-Oriented Engineering}, series = {Technische Berichte des Hasso-Plattner-Instituts f{\"u}r Softwaresystemtechnik an der Universit{\"a}t Potsdam}, volume = {18}, journal = {Technische Berichte des Hasso-Plattner-Instituts f{\"u}r Softwaresystemtechnik an der Universit{\"a}t Potsdam}, publisher = {Universit{\"a}tsverlag Potsdam}, address = {Potsdam}, isbn = {3-939469-35-1}, issn = {1613-5652}, year = {2006}, language = {en} } @article{GebserSchaubThiele2007, author = {Gebser, Martin and Schaub, Torsten H. and Thiele, Sven}, title = {GrinGo : a new grounder for answer set programming}, isbn = {978-3-540- 72199-4}, year = {2007}, language = {en} } @book{KuropkaMeyer2005, author = {Kuropka, Dominik and Meyer, Harald}, title = {Survey on service composition}, series = {Technische Berichte des Hasso-Plattner-Instituts f{\"u}r Softwaresystemtechnik an der Universit{\"a}t Potsda}, volume = {10}, journal = {Technische Berichte des Hasso-Plattner-Instituts f{\"u}r Softwaresystemtechnik an der Universit{\"a}t Potsda}, publisher = {Universit{\"a}tsverlag Potsdam}, address = {Potsdam}, isbn = {3-937786-78-3}, issn = {1613-5652}, pages = {35 S.}, year = {2005}, language = {en} } @article{KonczakVogel2005, author = {Konczak, Kathrin and Vogel, Ralf}, title = {Abduction and Preferences in Linguistics}, year = {2005}, language = {en} } @article{CaludeJurgensen2005, author = {Calude, C. S. and Jurgensen, Helmut}, title = {Is complexity a source of incompleteness?}, issn = {0196-8858}, year = {2005}, abstract = {In this paper we prove Chaitin's "heuristic principle," the theorems of a finitely-specified theory cannot be significantly more complex than the theory itself, for an appropriate measure of complexity. We show that the measure is invariant under the change of the Godel numbering. For this measure, the theorems of a finitely-specified, sound, consistent theory strong enough to formalize arithmetic which is arithmetically sound (like Zermelo-Fraenkel set theory with choice or Peano Arithmetic) have bounded complexity, hence every sentence of the theory which is significantly more complex than the theory is unprovable. Previous results showing that incompleteness is not accidental, but ubiquitous are here reinforced in probabilistic terms: the probability that a true sentence of length n is provable in the theory tends to zero when n tends to infinity, while the probability that a sentence of length n is true is strictly positive. (c) 2004 Elsevier Inc. All rights reserved}, language = {en} } @article{Bordihn2005, author = {Bordihn, Henning}, title = {On the number of components in cooperating distributed grammar systems}, issn = {0304-3975}, year = {2005}, abstract = {It is proved that the number of components in context-free cooperating distributed (CD) grammar systems can be reduced to 3 when they are working in the so-called sf-mode of derivation, which is the cooperation protocol which has been considered first for CD grammar systems. In this derivation mode, a component continues the derivation until and unless there is a nonterminal in the sentential form which cannot be rewritten according to that component. Moreover, it is shown that CD grammar systems in sf-mode with only one component can generate only the context-free languages but they can generate non-context-free languages if two components are used. The sf-mode of derivation is compared with other well-known cooperation protocols with respect to the hierarchies induced by the number of components. (C) 2004 Elsevier B.V. All rights reserved}, language = {en} } @article{BeerenwinkelSingLengaueretal.2005, author = {Beerenwinkel, Niko and Sing, Tobias and Lengauer, Thomas and Rahnenfuhrer, Joerg and Roomp, Kirsten and Savenkov, Igor and Fischer, Roman and Hoffmann, Daniel and Selbig, Joachim and Korn, Klaus and Walter, Hauke and Berg, Thomas and Braun, Patrick and Faetkenheuer, Gerd and Oette, Mark and Rockstroh, Juergen and Kupfer, Bernd and Kaiser, Rolf and Daeumer, Martin}, title = {Computational methods for the design of effective therapies against drug resistant HIV strains}, year = {2005}, abstract = {The development of drug resistance is a major obstacle to successful treatment of HIV infection. The extraordinary replication dynamics of HIV facilitates its escape from selective pressure exerted by the human immune system and by combination drug therapy. We have developed several computational methods whose combined use can support the design of optimal antiretroviral therapies based on viral genomic data}, language = {en} } @article{BrzozowskiJuergensen2005, author = {Brzozowski, J. A. and J{\"u}rgensen, Helmut}, title = {Representation of semiautomata by canonical words and equivalences}, issn = {0129-0541}, year = {2005}, abstract = {We study a novel representation of semiautomata, which is motivated by the method of trace-assertion specifications of software modules. Each state of the semiautomaton is represented by an arbitrary word leading to that state, the canonical word. The transitions of the semiautomaton give rise to a right congruence, the state-equivalence, on the set of input words of the semiautomaton: two words are state-equivalent if and only if they lead to the same state. We present a simple algorithm for finding a set of generators for state-equivalence. Directly from this set of generators, we construct a confluent prefix-rewriting system which permits us to transform any word to its canonical representative. In general, the rewriting system may allow infinite derivations. To address this issue, we impose the condition of prefix-continuity on the set of canonical words. A set is prefix-continuous if, whenever a word w and a prefix u of w axe in the set, then all the prefixes of w longer than u are also in the set. Prefix-continuous sets include prefix-free and prefix-closed sets as special cases. We prove that the rewriting system is Noetherian if and only if the set of canonical words is prefix-continuous. Furthermore, if the set of canonical words is prefix- continuous, then the set of rewriting rules is irredundant. We show that each prefix-continuous canonical set corresponds to a spanning forest of the semiautomaton}, language = {en} } @article{BordihnHolzerKutrib2005, author = {Bordihn, Henning and Holzer, Markus and Kutrib, Martin}, title = {Unsolvability levels of operation problems for subclasses of context-free languages}, issn = {0129-0541}, year = {2005}, abstract = {We investigate the operation problem for linear and deterministic context-free languages: Fix an operation on formal languages. Given linear (deterministic, respectively) context-free languages, is the application of this operation to the given languages still a linear (deterministic, respectively) context-free language? Besides the classical operations, for which the linear and deterministic context-free languages are not closed, we also consider the recently introduced root and power operation. We show non-semidecidability, to be more precise, we show completeness for the second level of the arithmetic hierarchy for all of the aforementioned operations, except for the power operation, if the underlying alphabet contains at least two letters. The result for the power opera, tion solves an open problem stated in Theoret. Comput. Sci. 314 (2004) 445-449}, language = {en} } @article{BruggemeierDovifatKubisch2005, author = {Bruggemeier, M. and Dovifat, A. and Kubisch, D.}, title = {Micropolitical innovation arenas as a tool for analyzing innovation processes in the context of electronic government}, issn = {0937-6429}, year = {2005}, abstract = {E-Government requires technical and organizational innovation. Research has already shown that the respective innovation process is complex and contingent upon specific organizational structures. Managing such innovation processes successfully is difficult. Drawing on assumptions of micropolitical behavior, a framework of innovation arenas is proposed. It supports the analysis of ongoing E-Government projects as well as the ex post investigation of successful or failed projects. Testing this framework in case studies already demonstrates its usefulness for individual actors making strategic choices about change management. Furthermore, the results indicate that many commonly held assumptions about successful change management have to be reconsidered}, language = {en} } @article{MeineckeZieheKurthsetal.2005, author = {Meinecke, Frank C. and Ziehe, Andreas and Kurths, J{\"u}rgen and M{\"u}ller, Klaus-Robert}, title = {Measuring phase synchronization of superimposed signals}, issn = {0031-9007}, year = {2005}, abstract = {Phase synchronization is an important phenomenon that occurs in a wide variety of complex oscillatory processes. Measuring phase synchronization can therefore help to gain fundamental insight into nature. In this Letter we point out that synchronization analysis techniques can detect spurious synchronization, if they are fed with a superposition of signals such as in electroencephalography or magnetoencephalography data. We show how techniques from blind source separation can help to nevertheless measure the true synchronization and avoid such pitfalls}, language = {en} } @article{ScholzKaplanGuyetal.2005, author = {Scholz, Matthias and Kaplan, F. and Guy, C. L. and Kopka, Joachim and Selbig, Joachim}, title = {Non-linear PCA : a missing data approach}, issn = {1367-4803}, year = {2005}, abstract = {Motivation: Visualizing and analysing the potential non-linear structure of a dataset is becoming an important task in molecular biology. This is even more challenging when the data have missing values. Results: Here, we propose an inverse model that performs non-linear principal component analysis (NLPCA) from incomplete datasets. Missing values are ignored while optimizing the model, but can be estimated afterwards. Results are shown for both artificial and experimental datasets. In contrast to linear methods, non-linear methods were able to give better missing value estimations for non-linear structured data. Application: We applied this technique to a time course of metabolite data from a cold stress experiment on the model plant Arabidopsis thaliana, and could approximate the mapping function from any time point to the metabolite responses. Thus, the inverse NLPCA provides greatly improved information for better understanding the complex response to cold stress}, language = {en} } @article{KonczakLinkeSchaub2004, author = {Konczak, Kathrin and Linke, Thomas and Schaub, Torsten H.}, title = {Graphs and cologings for answer set programming : adridged report}, isbn = {3-540- 20721-x}, year = {2004}, language = {en} } @article{BoeselLinkeSchaub2004, author = {Boesel, Andreas and Linke, Thomas and Schaub, Torsten H.}, title = {Profiling answer set programming : the visualization component of the noMoRe System}, isbn = {3-540-23242-7}, year = {2004}, language = {en} } @book{BenschBoldtBordihnetal.2004, author = {Bensch, Suna and Boldt, Oliver and Bordihn, Henning and J{\"u}rgensen, Helmut}, title = {Workshop "Formale Methoden der Linguistik" und "14. Theorietag Automaten und Formale Sprachen"}, series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik}, volume = {2004, 2}, journal = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik}, publisher = {Univ.}, address = {Potsdam}, issn = {0946-7580}, pages = {144 S.}, year = {2004}, language = {de} } @book{KytmanovMyslivetsTarkhanov2004, author = {Kytmanov, Alexander M. and Myslivets, Simona and Tarkhanov, Nikolai Nikolaevich}, title = {Zeta-function of a nonlinear system}, series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Mathematik, Arbeitsgruppe Partiell}, journal = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Mathematik, Arbeitsgruppe Partiell}, publisher = {Univ.}, address = {Potsdam}, issn = {1437-739X}, pages = {11 S.}, year = {2004}, language = {en} } @book{Tarkhanov2004, author = {Tarkhanov, Nikolai Nikolaevich}, title = {Harmonic integrals on domains with edges}, series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Mathematik, Arbeitsgruppe Partiell}, journal = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Mathematik, Arbeitsgruppe Partiell}, publisher = {Univ.}, address = {Potsdam}, issn = {1437-739X}, pages = {41 S.}, year = {2004}, language = {en} } @book{KytmanovMyslivetsTarkhanov2004, author = {Kytmanov, Alexander M. and Myslivets, Simona and Tarkhanov, Nikolai Nikolaevich}, title = {Power sums of roots of a nonlinear system}, series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Mathematik, Arbeitsgruppe Partiell}, journal = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Mathematik, Arbeitsgruppe Partiell}, publisher = {Univ.}, address = {Potsdam}, issn = {1437-739X}, pages = {12 S.}, year = {2004}, language = {en} } @book{OPUS4-14421, title = {Grundfragen Multimedialen Lehrens und Lernens : 2. Workshop GML2 2004}, editor = {Rebensburg, Klaus}, publisher = {Books on Demand}, address = {Norderstedt}, isbn = {3-8334-1573-8}, pages = {293 S. : Ill., graph. Darst.}, year = {2004}, abstract = {Tagungsband vom 2. Workshop GML² 2005 Dem Lernen und Lehren mit Neuen Medien werden in Zeiten der Informationsgesellschaft oft sagenhafte Eigenschaften zugeschrieben: es sei anschaulicher, attraktiver, motivierender, effizienter, kosteng{\"u}nstiger, gehe besser auf den Lernenden ein, steigere den Lernerfolg, orientiere sich mehr an den kognitiven Strukturen von Lernenden etc.. Damit wenigstens einige der genannten Vorteile wirksam werden, sind geeignete didaktische und methodische Modelle und Konzepte unverzichtbar. Hinzu kommen detaillierte Kenntnisse in der Gestaltung von Lernoberfl{\"a}chen, der technischen Realisierung von Lerninhalten, dem Aufbau lernf{\"o}rderlicher Strukturen und Betreuungskonzepte und dem Betrieb von teilweise virtuellen Universit{\"a}ten. Inwieweit gesteckte Ziele erreicht wurden, ist anhand von Evaluationsmaßnahmen zu ermitteln. S{\"a}mtliche Aspekte m{\"u}ssen bereits in die Planung entsprechender Angebote einbezogen werden.}, language = {de} } @article{CordesKaiserSelbig2006, author = {Cordes, Frank and Kaiser, Rolf and Selbig, Joachim}, title = {Bioinformatics approach to predicting HIV drug resistance}, issn = {1473-7159}, doi = {10.1586/14737159.6.2.207}, year = {2006}, abstract = {The emergence of drug resistance remains one of the most challenging issues in the treatment of HIV-1 infection. The extreme replication dynamics of HIV facilitates its escape from the selective pressure exerted by the human immune system and by the applied combination drug therapy. This article reviews computational methods whose combined use can support the design of optimal antiretroviral therapies based on viral genotypic and phenotypic data. Genotypic assays are based on the analysis of mutations associated with reduced drug susceptibility, but are difficult to interpret due to the numerous mutations and mutational patterns that confer drug resistance. Phenotypic resistance or susceptibility can be experimentally evaluated by measuring the inhibition of the viral replication in cell culture assays. However, this procedure is expensive and time consuming}, language = {en} } @article{LemmCurioHlushchuketal.2006, author = {Lemm, Steven and Curio, Gabriel and Hlushchuk, Yevhen and M{\"u}ller, Klaus-Robert}, title = {Enhancing the signal-to-noise ratio of ICA-based extracted ERPs}, issn = {0018-9294}, doi = {10.1109/Tbme.2006.870258}, year = {2006}, abstract = {When decomposing single trial electroencephalography it is a challenge to incorporate prior physiological knowledge. Here, we develop a method that uses prior information about the phase-locking property of event-related potentials in a regularization framework to bias a blind source separation algorithm toward an improved separation of single-trial phase-locked responses in terms of an increased signal-to-noise ratio. In particular, we suggest a transformation of the data, using weighted average of the single trial and trial-averaged response, that redirects the focus of source separation methods onto the subspace of event-related potentials. The practical benefit with respect to an improved separation of such components from ongoing background activity and extraneous noise is first illustrated on artificial data and finally verified in a real-world application of extracting single-trial somatosensory evoked potentials from multichannel EEG-recordings}, language = {en} } @phdthesis{Schuschel2006, author = {Schuschel, Hilmar}, title = {Integrierte Prozessplanung und -ausf{\"u}hrung}, address = {Potsdam}, pages = {135 S.}, year = {2006}, language = {de} } @article{GressmannJanhunenMerceretal.2006, author = {Gressmann, Jean and Janhunen, Tomi and Mercer, Robert E. and Schaub, Torsten H. and Thiele, Sven and Tichy, Richard}, title = {On probing and multi-threading in platypus}, year = {2006}, language = {en} } @phdthesis{Hetzer2006, author = {Hetzer, Dirk}, title = {Adaptive Quality of Service based Bandwidth Planning in Internet}, address = {Potsdam}, pages = {190 S. : graph. Darst.}, year = {2006}, language = {en} } @article{LaubRothBuhmannetal.2006, author = {Laub, Julian and Roth, Volker and Buhmann, Joachim and M{\"u}ller, Klaus-Robert}, title = {On the information and representation of non-Euclidean pairwise data}, issn = {0031-3203}, doi = {10.1016/j.patcog.2006.04.016}, year = {2006}, abstract = {Two common data representations are mostly used in intelligent data analysis, namely the vectorial and the pairwise representation. Pairwise data which satisfy the restrictive conditions of Euclidean spaces can be faithfully translated into a Euclidean vectorial representation by embedding. Non-metric pairwise data with violations of symmetry, reflexivity or triangle inequality pose a substantial conceptual problem for pattern recognition since the amount of predictive structural information beyond what can be measured by embeddings is unclear. We show by systematic modeling of non-Euclidean pairwise data that there exists metric violations which can carry valuable problem specific information. Furthermore, Euclidean and non-metric data can be unified on the level of structural information contained in the data. Stable component analysis selects linear subspaces which are particularly insensitive to data fluctuations. Experimental results from different domains support our pattern recognition strategy.}, language = {en} } @article{MileoSchaub2006, author = {Mileo, Alessandra and Schaub, Torsten H.}, title = {Extending ordered disjunctions for policy enforcement : preliminary report}, year = {2006}, language = {en} } @article{KawanabeBlanchardSugiyamaetal.2006, author = {Kawanabe, Motoaki and Blanchard, Gilles and Sugiyama, Masashi and Spokoiny, Vladimir G. and M{\"u}ller, Klaus-Robert}, title = {A novel dimension reduction procedure for searching non-Gaussian subspaces}, issn = {0302-9743}, doi = {10.1007/11679363_19}, year = {2006}, abstract = {In this article, we consider high-dimensional data which contains a low-dimensional non-Gaussian structure contaminated with Gaussian noise and propose a new linear method to identify the non-Gaussian subspace. Our method NGCA (Non-Gaussian Component Analysis) is based on a very general semi-parametric framework and has a theoretical guarantee that the estimation error of finding the non-Gaussian components tends to zero at a parametric rate. NGCA can be used not only as preprocessing for ICA, but also for extracting and visualizing more general structures like clusters. A numerical study demonstrates the usefulness of our method}, language = {en} } @article{DelgrandeLiuSchaubetal.2006, author = {Delgrande, James Patrick and Liu, Daphne H. and Schaub, Torsten H. and Thiele, Sven}, title = {COBA 2.0 : a consistency-based belief change system}, year = {2006}, language = {en} } @article{DelgrandeSchaubTompits2006, author = {Delgrande, James Patrick and Schaub, Torsten H. and Tompits, Hans}, title = {An Extended Query language for action languages (and its application to aggregates and preferences)}, year = {2006}, language = {en} } @book{Juergensen2006, author = {J{\"u}rgensen, Helmut}, title = {Complexity, information, energy}, series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik}, volume = {2006, 6}, journal = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik}, publisher = {Univ.}, address = {Potsdam}, issn = {0946-7580}, pages = {5 S.}, year = {2006}, language = {en} } @article{PerniciWeske2006, author = {Pernici, Barbara and Weske, Mathias}, title = {Business process management}, issn = {0169-023X}, year = {2006}, language = {en} } @phdthesis{Freund2006, author = {Freund, Tessen}, title = {Experimentelles Software Engineering durch Modellierung wissensintensiver Entwicklungsprozesse}, address = {Potsdam}, pages = {XII, 316 S. : graph. Darst.}, year = {2006}, language = {de} } @book{BalanJuergensen2006, author = {Balan, Sakthin M. and J{\"u}rgensen, Helmut}, title = {Peptide computing : universality and theoretical model}, series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik}, volume = {2006, 1}, journal = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik}, publisher = {Univ.}, address = {Potsdam}, issn = {0946-7580}, pages = {15 S.}, year = {2006}, language = {en} } @book{Krahmer2006, author = {Krahmer, Sebastian}, title = {Control flow integrity with ptrace()}, series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik}, volume = {2006, 2}, journal = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik}, publisher = {Univ.}, address = {Potsdam}, issn = {0946-7580}, pages = {16 S.}, year = {2006}, language = {en} } @book{BalanJuergensen2006, author = {Balan, Sakthin M. and J{\"u}rgensen, Helmut}, title = {On the universality of peptide computing}, series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik}, volume = {2006, 9}, journal = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik}, publisher = {Univ.}, address = {Potsdam}, issn = {0946-7580}, pages = {ca. 23 S.}, year = {2006}, language = {en} } @book{Krahmer2006, author = {Krahmer, Sebastian}, title = {Hardend *OS exploitation techniques}, series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik}, volume = {2006, 4}, journal = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik}, publisher = {Univ.}, address = {Potsdam}, issn = {0946-7580}, pages = {8 S.}, year = {2006}, language = {en} } @book{Juergensen2006, author = {J{\"u}rgensen, Helmut}, title = {Synchronization}, series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik}, volume = {2006, 5}, journal = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik}, publisher = {Univ.}, address = {Potsdam}, issn = {0946-7580}, pages = {21 S.}, year = {2006}, language = {en} } @phdthesis{Nienhaus2005, author = {Nienhaus, Marc}, title = {Real-Time-Non-Photorealistic rendering techniques for illustrating 3D scenes and their dynamics}, address = {Potsdam}, pages = {x, 102 S. : graph. Darst.}, year = {2005}, language = {en} } @article{Camales2005, author = {Camales, Renaud}, title = {Explicit formulation of the solution of Hamada-Leray-Wagschal's theorem}, issn = {0034-5318}, year = {2005}, abstract = {In this paper, an explicit formula of the solution of Hainada-Leray-Wagschal's theorem is given. For this, only structure's theorem of finite dimensional determination's function and linear algebra technics developped in [1] are used}, language = {en} } @article{HaegerSchubert2005, author = {H{\"a}ger, Sebastian and Schubert, Wolfgang}, title = {Assoziationen in Softwarearchitekturen}, series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik}, volume = {2005, 2}, journal = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik}, publisher = {Univ.}, address = {Potsdam}, issn = {0946-7580}, pages = {33 S.}, year = {2005}, language = {de} } @article{AngerGebserLinkeetal.2005, author = {Anger, Christian and Gebser, Martin and Linke, Thomas and Neumann, Andre and Schaub, Torsten H.}, title = {The nomore++ approach to answer set solving}, year = {2005}, language = {en} }