@article{Linke2003, author = {Linke, Thomas}, title = {Using nested logic programs for answer set programming}, issn = {1613-0073}, year = {2003}, language = {en} } @phdthesis{Gerber1995, author = {Gerber, Stefan}, title = {Using software for fault detection in arithmetical circuits}, pages = {123 S.}, year = {1995}, language = {en} } @misc{NeubauerHaubeltWankoetal.2018, author = {Neubauer, Kai and Haubelt, Christian and Wanko, Philipp and Schaub, Torsten H.}, title = {Utilizing quad-trees for efficient design space exploration with partial assignment evaluation}, series = {2018 23rd Asia and South Pacific Design Automation Conference (ASP-DAC)}, journal = {2018 23rd Asia and South Pacific Design Automation Conference (ASP-DAC)}, publisher = {IEEE}, address = {New York}, isbn = {978-1-5090-0602-1}, issn = {2153-6961}, doi = {10.1109/ASPDAC.2018.8297362}, pages = {434 -- 439}, year = {2018}, abstract = {Recently, it has been shown that constraint-based symbolic solving techniques offer an efficient way for deciding binding and routing options in order to obtain a feasible system level implementation. In combination with various background theories, a feasibility analysis of the resulting system may already be performed on partial solutions. That is, infeasible subsets of mapping and routing options can be pruned early in the decision process, which fastens the solving accordingly. However, allowing a proper design space exploration including multi-objective optimization also requires an efficient structure for storing and managing non-dominated solutions. In this work, we propose and study the usage of the Quad-Tree data structure in the context of partial assignment evaluation during system synthesis. Out experiments show that unnecessary dominance checks can be avoided, which indicates a preference of Quad-Trees over a commonly used list-based implementation for large combinatorial optimization problems.}, language = {en} } @book{OPUS4-22102, title = {UTW-Workshop "Soziotechnischer Zugang bei der Konstruktion, Einf{\"u}hrung und Anwendung von Workflow- Management-Systemen"}, series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik}, volume = {1998, 02}, journal = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik}, editor = {Horn, Erika and Kupries, Mario and Bartl, Peter}, publisher = {Univ.}, address = {Potsdam}, issn = {0946-7580}, pages = {68 S.}, year = {1998}, language = {de} } @article{RaetschSchoelkopfSmolaetal.2000, author = {R{\"a}tsch, Gunnar and Sch{\"o}lkopf, B. and Smola, Alexander J. and M{\"u}ller, Klaus-Robert and Mika, Sebastian}, title = {V-Arc : ensemble learning in the preence of outliers}, year = {2000}, language = {en} } @article{SteuerHumburgSelbig2006, author = {Steuer, Ralf and Humburg, Peter and Selbig, Joachim}, title = {Validation and functional annotation of expression-based clusters based on gene ontology}, series = {BMC bioinformatics}, volume = {7}, journal = {BMC bioinformatics}, number = {380}, publisher = {BioMed Central}, address = {London}, issn = {1471-2105}, doi = {10.1186/1471-2105-7-380}, pages = {12}, year = {2006}, abstract = {Background: The biological interpretation of large-scale gene expression data is one of the paramount challenges in current bioinformatics. In particular, placing the results in the context of other available functional genomics data, such as existing bio-ontologies, has already provided substantial improvement for detecting and categorizing genes of interest. One common approach is to look for functional annotations that are significantly enriched within a group or cluster of genes, as compared to a reference group. Results: In this work, we suggest the information-theoretic concept of mutual information to investigate the relationship between groups of genes, as given by data-driven clustering, and their respective functional categories. Drawing upon related approaches (Gibbons and Roth, Genome Research 12: 1574-1581, 2002), we seek to quantify to what extent individual attributes are sufficient to characterize a given group or cluster of genes. Conclusion: We show that the mutual information provides a systematic framework to assess the relationship between groups or clusters of genes and their functional annotations in a quantitative way. Within this framework, the mutual information allows us to address and incorporate several important issues, such as the interdependence of functional annotations and combinatorial combinations of attributes. It thus supplements and extends the conventional search for overrepresented attributes within a group or cluster of genes. In particular taking combinations of attributes into account, the mutual information opens the way to uncover specific functional descriptions of a group of genes or clustering result. All datasets and functional annotations used in this study are publicly available. All scripts used in the analysis are provided as additional files.}, language = {en} } @article{CsuhajVarjuDassowVaszil2010, author = {Csuhaj-Varj{\´u}, Erzs{\´e}bet and Dassow, Juergen and Vaszil, Gy{\"o}rgy}, title = {Variants of competence-based derivations in CD grammar systems}, issn = {0129-0541}, doi = {10.1142/S0129054110007428}, year = {2010}, abstract = {In this paper we introduce and study some new cooperation protocols for cooperating distributed (CD) grammar systems. These derivation modes depend on the number of different nonterminals present in the sentential form obtained when a component finished a derivation phase. This measure describes the competence of the grammar on the string (the competence is high if the number of the different nonterminals is small). It is also a measure of the efficiency of the grammar on the given string (a component is more efficient than another one if it is able to decrease the number of nonterminals in the string to a greater extent). We prove that if the underlying derivation mode is the t-mode derivation, then some variants of these systems determine the class of random context ET0L languages. If these CD grammar systems use the k step limited derivations as underlying derivation mode, then they are able to generate any recursively enumerable language.}, language = {en} } @phdthesis{Schoebel2010, author = {Sch{\"o}bel, Michael}, title = {Verarbeitung von Ereignisstr{\"o}men im Betriebssystemkern}, publisher = {Cuvillier}, address = {G{\"o}ttingen}, isbn = {978-3-869555-601-7}, pages = {XII, 161 S. : graph. Darst.}, year = {2010}, language = {de} } @article{FandinoLifschitzLuehneetal.2020, author = {Fandi{\~n}o, Jorge and Lifschitz, Vladimir and L{\"u}hne, Patrick and Schaub, Torsten H.}, title = {Verifying tight logic programs with Anthem and Vampire}, series = {Theory and practice of logic programming}, volume = {20}, journal = {Theory and practice of logic programming}, number = {5}, publisher = {Cambridge Univ. Press}, address = {Cambridge [u.a.]}, issn = {1471-0684}, doi = {10.1017/S1471068420000344}, pages = {735 -- 750}, year = {2020}, abstract = {This paper continues the line of research aimed at investigating the relationship between logic programs and first-order theories. We extend the definition of program completion to programs with input and output in a subset of the input language of the ASP grounder gringo, study the relationship between stable models and completion in this context, and describe preliminary experiments with the use of two software tools, anthem and vampire, for verifying the correctness of programs with input and output. Proofs of theorems are based on a lemma that relates the semantics of programs studied in this paper to stable models of first-order formulas.}, 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} } @misc{Kirchner2007, type = {Master Thesis}, author = {Kirchner, Peter}, title = {Verteilte Autorisierung innerhalb von Single Sign-On-Umgebungen : Analyse, Architektur und Implementation eines Frameworks f{\"u}r verteilte Autorisierung in einer ADFS-Umgebung}, url = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-22289}, school = {Universit{\"a}t Potsdam}, year = {2007}, abstract = {Aktuelle Softwaresysteme erlauben die verteilte Authentifizierung von Benutzern {\"u}ber Ver-zeichnisdienste, die sowohl im Intranet als auch im Extranet liegen und die {\"u}ber Dom{\"a}nen-grenzen hinweg die Kooperation mit Partnern erm{\"o}glichen. Der n{\"a}chste Schritt ist es nun, die Autorisierung ebenfalls aus der lokalen Anwendung auszulagern und diese extern durchzu-f{\"u}hren - vorzugsweise unter dem Einfluss der Authentifizierungspartner. Basierend auf der Analyse des State-of-the-Art wird in dieser Arbeit ein Framework vorges-tellt, das die verteilte Autorisierung von ADFS (Active Directory Federation Services) authenti-fizierten Benutzern auf Basis ihrer Gruppen oder ihrer pers{\"o}nlichen Identit{\"a}t erm{\"o}glicht. Es wird eine prototypische Implementation mit Diensten entwickelt, die f{\"u}r authentifizierte Be-nutzer Autorisierungsanfragen extern delegieren, sowie ein Dienst, der diese Autorisierungs-anfragen verarbeitet. Zus{\"a}tzlich zeigt die Arbeit eine Integration dieses Autorisierungs-Frameworks in das .NET Framework, um die praxistaugliche Verwendbarkeit in einer aktuel-len Entwicklungsumgebung zu demonstrieren. Abschließend wird ein Ausblick auf weitere Fragestellungen und Folgearbeiten gegeben.}, language = {de} } @unpublished{RosamondBardohlDiehletal.2011, author = {Rosamond, Frances and Bardohl, Roswitha and Diehl, Stephan and Geisler, Uwe and Bolduan, Gordon and Lessmoellmann, Annette and Schwill, Andreas and Stege, Ulrike}, title = {Virtual extension reaching out to the media become a computer science ambassador}, series = {Communications of the ACM / Association for Computing Machinery}, volume = {54}, journal = {Communications of the ACM / Association for Computing Machinery}, number = {3}, publisher = {Association for Computing Machinery}, address = {New York}, issn = {0001-0782}, doi = {10.1145/1897852.1897880}, pages = {113 -- 116}, year = {2011}, language = {en} } @article{BaedkeSchoettler2017, author = {Baedke, Jan and Sch{\"o}ttler, Tobias}, title = {Visual Metaphors in the Sciences}, series = {Journal for General Philosophy of Science}, volume = {48}, journal = {Journal for General Philosophy of Science}, publisher = {Springer}, address = {Dordrecht}, issn = {0925-4560}, doi = {10.1007/s10838-016-9353-9}, pages = {173 -- 194}, year = {2017}, abstract = {Recent philosophical analyses of the epistemic dimension of images in the sciences show a certain trend in acknowledging potential roles of these images beyond their merely decorative or pedagogical functions. We argue, however, that this new debate has yet paid little attention to a special type of pictures, we call 'visual metaphor', and its versatile heuristic potential in organizing data, supporting communication, and guiding research, modeling, and theory formation. Based on a case study of Conrad Hal Waddington's epigenetic landscape images in biology, we develop a descriptive framework applicable to heuristic roles of various visual metaphors in the sciences.}, 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} } @phdthesis{Bohnet2010, author = {Bohnet, Johannes}, title = {Visualization of Execution Traces and its Application to Software Maintenance}, address = {Potsdam}, pages = {150 S.}, year = {2010}, language = {en} } @book{KirschNienhausDoellner2005, author = {Kirsch, Florian and Nienhaus, Marc and D{\"o}llner, J{\"u}rgen Roland Friedrich}, title = {Visualizing design and spatial assembly of interactive CSG}, series = {Technische Berichte des Hasso-Plattner-Instituts f{\"u}r Softwaresystemtechnik an der Universit{\"a}t Potsda}, volume = {7}, 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-56-2}, issn = {1613-5652}, pages = {8 S.}, year = {2005}, language = {en} } @article{KoseWeckwerthLinkeetal.2001, author = {Kose, F. and Weckwerth, Wolfram and Linke, Thomas and Fiehn, Oliver}, title = {Visualizing plant metabolomic correlation networks using clique-metabolite matrices}, year = {2001}, language = {en} } @article{KonczakLang2005, author = {Konczak, Kathrin and Lang, Jerome}, title = {Voting procedures with incomplete preferences}, year = {2005}, language = {en} } @article{Konczak2006, author = {Konczak, Kathrin}, title = {Voting Theory in Answer Set Programming}, year = {2006}, language = {en} } @article{MiddelanisWillnerOttoetal.2021, author = {Middelanis, Robin and Willner, Sven N. and Otto, Christian and Kuhla, Kilian and Quante, Lennart and Levermann, Anders}, title = {Wave-like global economic ripple response to Hurricane Sandy}, series = {Environmental research letters : ERL / Institute of Physics}, volume = {16}, journal = {Environmental research letters : ERL / Institute of Physics}, number = {12}, publisher = {IOP Publ. Ltd.}, address = {Bristol}, issn = {1748-9326}, doi = {10.1088/1748-9326/ac39c0}, pages = {11}, year = {2021}, abstract = {Tropical cyclones range among the costliest disasters on Earth. Their economic repercussions along the supply and trade network also affect remote economies that are not directly affected. We here simulate possible global repercussions on consumption for the example case of Hurricane Sandy in the US (2012) using the shock-propagation model Acclimate. The modeled shock yields a global three-phase ripple: an initial production demand reduction and associated consumption price decrease, followed by a supply shortage with increasing prices, and finally a recovery phase. Regions with strong trade relations to the US experience strong magnitudes of the ripple. A dominating demand reduction or supply shortage leads to overall consumption gains or losses of a region, respectively. While finding these repercussions in historic data is challenging due to strong volatility of economic interactions, numerical models like ours can help to identify them by approaching the problem from an exploratory angle, isolating the effect of interest. For this, our model simulates the economic interactions of over 7000 regional economic sectors, interlinked through about 1.8 million trade relations. Under global warming, the wave-like structures of the economic response to major hurricanes like the one simulated here are likely to intensify and potentially overlap with other weather extremes.}, language = {en} }