@article{ZienRaetschMikaetal.2000,
  author    = {Zien, Alexander and R{\"a}tsch, Gunnar and Mika, Sebastian and Sch{\"o}lkopf, Bernhard and Lengauer, Thomas and M{\"u}ller, Klaus-Robert},
  title     = {Engineering support vector machine kernels that recognize translation initiation sites},
  issn      = {1367-4803},
  year      = {2000},
  language  = {en}
}
@article{ZieheMuellerNolteetal.2000,
  author    = {Ziehe, Andreas and M{\"u}ller, Klaus-Robert and Nolte, G. and Mackert, B.-M. and Curio, Gabriel},
  title     = {Artifact reduction in magnetoneurography based on time-delayed second-order correlations},
  year      = {2000},
  language  = {en}
}
@article{ZieheKawanabeHarmeling2004,
  author    = {Ziehe, Andreas and Kawanabe, Motoaki and Harmeling, Stefan},
  title     = {Blind separation of post-nonlinear mixtures using linearizing transformations and temporal decorrelation},
  issn      = {1532-4435},
  year      = {2004},
  abstract  = {We propose two methods that reduce the post-nonlinear blind source separation problem (PNL-BSS) to a linear BSS problem. The first method is based on the concept of maximal correlation: we apply the alternating conditional expectation (ACE) algorithm-a powerful technique from nonparametric statistics-to approximately invert the componentwise nonlinear functions. The second method is a Gaussianizing transformation, which is motivated by the fact that linearly mixed signals before nonlinear transformation are approximately Gaussian distributed. This heuristic, but simple and efficient procedure works as good as the ACE method. Using the framework provided by ACE, convergence can be proven. The optimal transformations obtained by ACE coincide with the sought-after inverse functions of the nonlinearitics. After equalizing the nonlinearities, temporal decorrelation separation (TDSEP) allows us to recover the source signals. Numerical simulations testing "ACE-TD" and "Gauss-TD" on realistic examples are performed with excellent results},
  language  = {en}
}
@article{ZenderMetzlerLucke2014,
  author    = {Zender, Raphael and Metzler, Richard and Lucke, Ulrike},
  title     = {FreshUP-A pervasive educational game for freshmen},
  series = {Pervasive and mobile computing},
  volume    = {14},
  journal   = {Pervasive and mobile computing},
  publisher = {Elsevier},
  address   = {Amsterdam},
  issn      = {1574-1192},
  doi       = {10.1016/j.pmcj.2013.09.003},
  pages     = {47 -- 56},
  year      = {2014},
  abstract  = {Students beginning their studies at university face manifold problems such as orientation in a new environment and organizing their courses. This article presents the implementation and successful empirical evaluation of the pervasive browser-based educational game "FreshUP", which aims at helping to overcome the initial difficulties of freshmen. In contrast to a conventional scavenger hunt, mobile pervasive games like FreshUP, bridging in-game and real world activities, have the potential to provide help in a motivating manner using new technology which is currently becoming more and more common. (C) 2013 Elsevier B.V. All rights reserved.},
  language  = {en}
}
@article{WuebbelerZieheMackertetal.2000,
  author    = {W{\"u}bbeler, G. and Ziehe, Andreas and Mackert, B.-M. and M{\"u}ller, Klaus-Robert and Trahms, L. and Curio, Gabriel},
  title     = {Independent component analysis of noninvasively recorded cortical magnetic DC-fields in humans},
  year      = {2000},
  language  = {en}
}
@article{WongBesnard2000,
  author    = {Wong, P. and Besnard, Philippe},
  title     = {Paraconsistent reasoning as an analytical tool},
  issn      = {1367-0751},
  year      = {2000},
  language  = {en}
}
@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{WilligMatheusWolisz2005,
  author    = {Willig, Andreas and Matheus, K. and Wolisz, A.},
  title     = {Wireless technology in industrial networks},
  issn      = {0018-9219},
  year      = {2005},
  abstract  = {With the success of wireless technologies in consumer electronics, standard wireless technologies are envisioned for the deployment in industrial environments as well. Industrial applications involving mobile subsystems or just the desire to save cabling make wireless technologies attractive. Nevertheless, these applications often have stringent requirements on reliability and timing. In wired environments, timing and reliability are well catered for by fieldbus systems (which are a mature technology designed to enable communication between digital controllers and the sensors and actuators interfacing to a physical process). When wireless links are included, reliability and timing requirements are significantly more difficult to meet, due to the adverse properties of the radio channels. In this paper we thus discuss some key issues coming up in wireless fieldbus and wireless industrial communication systems:1)fundamental problems like achieving timely and reliable transmission despite channel errors; 2) the usage of existing wireless technologies for this specific field of applications; and 3) the creation of hybrid systems in which wireless stations are included into existing wired systems},
  language  = {en}
}
@article{Wildner1997,
  author    = {Wildner, Uwe},
  title     = {Experimental evaluation of assigned signature checking with return address hashing on different platforms},
  year      = {1997},
  language  = {en}
}
@article{Wildner1996,
  author    = {Wildner, Uwe},
  title     = {Compiler assisted self-checking of structural integrity using return adress hashing},
  year      = {1996},
  language  = {en}
}
@article{WeskevanderAalstVerbeek2004,
  author    = {Weske, Mathias and van der Aalst, Wil M. P. and Verbeek, H. M. W.},
  title     = {Advances in business process management},
  issn      = {0169-023X},
  year      = {2004},
  language  = {en}
}
@article{WeiherHirschfeld2014,
  author    = {Weiher, Marcel and Hirschfeld, Robert},
  title     = {Polymorphic identifiers: uniform resource access in objective-smalltalk},
  series = {ACM SIGPLAN notices},
  volume    = {49},
  journal   = {ACM SIGPLAN notices},
  number    = {2},
  publisher = {Association for Computing Machinery},
  address   = {New York},
  issn      = {0362-1340},
  doi       = {10.1145/2508168.2508169},
  pages     = {61 -- 71},
  year      = {2014},
  abstract  = {In object-oriented programming, polymorphic dispatch of operations decouples clients from specific providers of services and allows implementations to be modified or substituted without affecting clients. The Uniform Access Principle (UAP) tries to extend these qualities to resource access by demanding that access to state be indistinguishable from access to operations. Despite language features supporting the UAP, the overall goal of substitutability has not been achieved for either alternative resources such as keyed storage, files or web pages, or for alternate access mechanisms: specific kinds of resources are bound to specific access mechanisms and vice versa. Changing storage or access patterns either requires changes to both clients and service providers and trying to maintain the UAP imposes significant penalties in terms of code-duplication and/or performance overhead. We propose introducing first class identifiers as polymorphic names for storage locations to solve these problems. With these Polymorphic Identifiers, we show that we can provide uniform access to a wide variety of resource types as well as storage and access mechanisms, whether parametrized or direct, without affecting client code, without causing code duplication or significant performance penalties.},
  language  = {en}
}
@article{WeidlichMendlingWeske2011,
  author    = {Weidlich, Matthias and Mendling, Jan and Weske, Mathias},
  title     = {Efficient consistency measurement based on behavioral profiles of process models},
  series = {IEEE transactions on software engineering},
  volume    = {37},
  journal   = {IEEE transactions on software engineering},
  number    = {3},
  publisher = {Inst. of Electr. and Electronics Engineers},
  address   = {Los Alamitos},
  issn      = {0098-5589},
  doi       = {10.1109/TSE.2010.96},
  pages     = {410 -- 429},
  year      = {2011},
  abstract  = {Engineering of process-driven business applications can be supported by process modeling efforts in order to bridge the gap between business requirements and system specifications. However, diverging purposes of business process modeling initiatives have led to significant problems in aligning related models at different abstract levels and different perspectives. Checking the consistency of such corresponding models is a major challenge for process modeling theory and practice. In this paper, we take the inappropriateness of existing strict notions of behavioral equivalence as a starting point. Our contribution is a concept called behavioral profile that captures the essential behavioral constraints of a process model. We show that these profiles can be computed efficiently, i.e., in cubic time for sound free-choice Petri nets w.r.t. their number of places and transitions. We use behavioral profiles for the definition of a formal notion of consistency which is less sensitive to model projections than common criteria of behavioral equivalence and allows for quantifying deviation in a metric way. The derivation of behavioral profiles and the calculation of a degree of consistency have been implemented to demonstrate the applicability of our approach. We also report the findings from checking consistency between partially overlapping models of the SAP reference model.},
  language  = {en}
}
@article{WangZhouLin2000,
  author    = {Wang, Kewen and Zhou, Lizhu and Lin, Fangzhen},
  title     = {Alternating fixpoint theory for logic programs with priority},
  isbn      = {3-540-67797-6},
  year      = {2000},
  language  = {en}
}
@article{WangZhou2001,
  author    = {Wang, Kewen and Zhou, Lizhu},
  title     = {An extension to GCWA and query evaluation for disjunctive deductive databases},
  year      = {2001},
  language  = {en}
}
@article{Wang2001,
  author    = {Wang, Kewen},
  title     = {A comparative study of disjunctive well-founded semantics},
  isbn      = {3-540-42593-4},
  year      = {2001},
  language  = {en}
}
@article{Wang2001,
  author    = {Wang, Kewen},
  title     = {Disjunctive well-founded semantics revisited},
  year      = {2001},
  language  = {en}
}
@article{Wang2001,
  author    = {Wang, Kewen},
  title     = {A top-down procedure for disjucntive well-founded semantics},
  year      = {2001},
  language  = {en}
}
@article{Wang2001,
  author    = {Wang, Kewen},
  title     = {A top-down procedure for disjucntive well-founded semantics},
  isbn      = {3-540-42254-4},
  year      = {2001},
  language  = {en}
}
@article{Wang2000,
  author    = {Wang, Kewen},
  title     = {Argumentation-based abduction in disjunctive logic programming},
  year      = {2000},
  language  = {en}
}
@article{WaltonGordon2015,
  author    = {Walton, Douglas and Gordon, Thomas F.},
  title     = {Formalizing informal logic},
  series = {Informal logic : reasoning and argumentation in theory and practics},
  volume    = {35},
  journal   = {Informal logic : reasoning and argumentation in theory and practics},
  number    = {4},
  publisher = {Centre for Research in Reasoning, Argumentation and Rhetoric, University of Windsor},
  address   = {Windsor},
  issn      = {0824-2577},
  pages     = {508 -- 538},
  year      = {2015},
  abstract  = {In this paper we investigate the extent to which formal argumentation models can handle ten basic characteristics of informal logic identified in the informal logic literature. By showing how almost all of these characteristics can be successfully modelled formally, we claim that good progress can be made toward the project of formalizing informal logic. Of the formal argumentation models available, we chose the Carneades Argumentation System (CAS), a formal, computational model of argument that uses argument graphs as its basis, structures of a kind very familiar to practitioners of informal logic through their use of argument diagrams.},
  language  = {en}
}
@article{WaitelonisJuergesSack2019,
  author    = {Waitelonis, J{\"o}rg and J{\"u}rges, Henrik and Sack, Harald},
  title     = {Remixing entity linking evaluation datasets for focused benchmarking},
  series = {Semantic Web},
  volume    = {10},
  journal   = {Semantic Web},
  number    = {2},
  publisher = {IOS Press},
  address   = {Amsterdam},
  issn      = {1570-0844},
  doi       = {10.3233/SW-180334},
  pages     = {385 -- 412},
  year      = {2019},
  abstract  = {In recent years, named entity linking (NEL) tools were primarily developed in terms of a general approach, whereas today numerous tools are focusing on specific domains such as e.g. the mapping of persons and organizations only, or the annotation of locations or events in microposts. However, the available benchmark datasets necessary for the evaluation of NEL tools do not reflect this focalizing trend. We have analyzed the evaluation process applied in the NEL benchmarking framework GERBIL [in: Proceedings of the 24th International Conference on World Wide Web (WWW'15), International World Wide Web Conferences Steering Committee, Republic and Canton of Geneva, Switzerland, 2015, pp. 1133-1143, Semantic Web 9(5) (2018), 605-625] and all its benchmark datasets. Based on these insights we have extended the GERBIL framework to enable a more fine grained evaluation and in depth analysis of the available benchmark datasets with respect to different emphases. This paper presents the implementation of an adaptive filter for arbitrary entities and customized benchmark creation as well as the automated determination of typical NEL benchmark dataset properties, such as the extent of content-related ambiguity and diversity. These properties are integrated on different levels, which also enables to tailor customized new datasets out of the existing ones by remixing documents based on desired emphases. Besides a new system library to enrich provided NIF [in: International Semantic Web Conference (ISWC'13), Lecture Notes in Computer Science, Vol. 8219, Springer, Berlin, Heidelberg, 2013, pp. 98-113] datasets with statistical information, best practices for dataset remixing are presented, and an in depth analysis of the performance of entity linking systems on special focus datasets is presented.},
  language  = {en}
}
@article{VolkmannLinkeWaschulziketal.1998,
  author    = {Volkmann, Gerald and Linke, Thomas and Waschulzik, Thomas and Ohmes, Rick and Schaub, Torsten H. and Wischnewsky, M.},
  title     = {HExProSA - ein hybrides Expertensystem zur Prozeßkontrolle und St{\"o}rfallanalyse von Abwasserbehandlungsanlagen : Erfahrungen bei der Evaluierung eines Prototypen},
  year      = {1998},
  language  = {de}
}
@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{VidelaGuziolowskiEduatietal.2015,
  author    = {Videla, Santiago and Guziolowski, Carito and Eduati, Federica and Thiele, Sven and Gebser, Martin and Nicolas, Jacques and Saez-Rodriguez, Julio and Schaub, Torsten H. and Siegel, Anne},
  title     = {Learning Boolean logic models of signaling networks with ASP},
  series = {Theoretical computer science},
  volume    = {599},
  journal   = {Theoretical computer science},
  publisher = {Elsevier},
  address   = {Amsterdam},
  issn      = {0304-3975},
  doi       = {10.1016/j.tcs.2014.06.022},
  pages     = {79 -- 101},
  year      = {2015},
  abstract  = {Boolean networks provide a simple yet powerful qualitative modeling approach in systems biology. However, manual identification of logic rules underlying the system being studied is in most cases out of reach. Therefore, automated inference of Boolean logical networks from experimental data is a fundamental question in this field. This paper addresses the problem consisting of learning from a prior knowledge network describing causal interactions and phosphorylation activities at a pseudo-steady state, Boolean logic models of immediate-early response in signaling transduction networks. The underlying optimization problem has been so far addressed through mathematical programming approaches and the use of dedicated genetic algorithms. In a recent work we have shown severe limitations of stochastic approaches in this domain and proposed to use Answer Set Programming (ASP), considering a simpler problem setting. Herein, we extend our previous work in order to consider more realistic biological conditions including numerical datasets, the presence of feedback-loops in the prior knowledge network and the necessity of multi-objective optimization. In order to cope with such extensions, we propose several discretization schemes and elaborate upon our previous ASP encoding. Towards real-world biological data, we evaluate the performance of our approach over in silico numerical datasets based on a real and large-scale prior knowledge network. The correctness of our encoding and discretization schemes are dealt with in Appendices A-B. (C) 2014 Elsevier B.V. All rights reserved.},
  language  = {en}
}
@article{VandenhoutenBehrensSchnor2004,
  author    = {Vandenhouten, Ralf and Behrens, Thomas and Schnor, Bettina},
  title     = {Entwicklung eines Gatewaysystems f{\"u}r telematikbasiertes Ger{\"a}temonitoring},
  issn      = {0949-8214},
  year      = {2004},
  language  = {de}
}
@article{vanHoolandVerborghDeWildeetal.2013,
  author    = {van Hooland, Seth and Verborgh, Ruben and De Wilde, Max and Hercher, Johannes and Mannens, Erik and Van de Walle, Rik},
  title     = {Evaluating the success of vocabulary reconciliation for cultural heritage collections},
  series = {Journal of the American Society for Information Science and Technology},
  volume    = {64},
  journal   = {Journal of the American Society for Information Science and Technology},
  number    = {3},
  publisher = {Wiley-Blackwell},
  address   = {Hoboken},
  issn      = {1532-2882},
  doi       = {10.1002/asi.22763},
  pages     = {464 -- 479},
  year      = {2013},
  abstract  = {The concept of Linked Data has made its entrance in the cultural heritage sector due to its potential use for the integration of heterogeneous collections and deriving additional value out of existing metadata. However, practitioners and researchers alike need a better understanding of what outcome they can reasonably expect of the reconciliation process between their local metadata and established controlled vocabularies which are already a part of the Linked Data cloud. This paper offers an in-depth analysis of how a locally developed vocabulary can be successfully reconciled with the Library of Congress Subject Headings (LCSH) and the Arts and Architecture Thesaurus (AAT) through the help of a general-purpose tool for interactive data transformation (OpenRefine). Issues negatively affecting the reconciliation process are identified and solutions are proposed in order to derive maximum value from existing metadata and controlled vocabularies in an automated manner.},
  language  = {en}
}
@article{UflackerKowarkZeier2011,
  author    = {Uflacker, Matthias and Kowark, Thomas and Zeier, Alexander},
  title     = {An instrument for real-time design interaction capture},
  isbn      = {978-3-642-13756-3},
  year      = {2011},
  language  = {en}
}
@article{Uflacker2010,
  author    = {Uflacker, Matthias},
  title     = {Computational analysis of virtual team collaboration in teh early stages of engineering design},
  isbn      = {978-3-86956-036-6},
  year      = {2010},
  language  = {en}
}
@article{TroegerMerzky2014,
  author    = {Troeger, Peter and Merzky, Andre},
  title     = {Towards standardized job submission and control in infrastructure clouds},
  series = {Journal of grid computing},
  volume    = {12},
  journal   = {Journal of grid computing},
  number    = {1},
  publisher = {Springer},
  address   = {Dordrecht},
  issn      = {1570-7873},
  doi       = {10.1007/s10723-013-9275-2},
  pages     = {111 -- 125},
  year      = {2014},
  abstract  = {The submission and management of computational jobs is a traditional part of utility computing environments. End users and developers of domain-specific software abstractions often have to deal with the heterogeneity of such batch processing systems. This lead to a number of application programming interface and job description standards in the past, which are implemented and established for cluster and Grid systems. With the recent rise of cloud computing as new utility computing paradigm, the standardized access to batch processing facilities operated on cloud resources becomes an important issue. Furthermore, the design of such a standard has to consider a tradeoff between feature completeness and the achievable level of interoperability. The article discusses this general challenge, and presents some existing standards with traditional cluster and Grid computing background that may be applicable to cloud environments. We present OCCI-DRMAA as one approach for standardized access to batch processing facilities hosted in a cloud.},
  language  = {en}
}
@article{TranPontelliBalduccinietal.2022,
  author    = {Tran, Son Cao and Pontelli, Enrico and Balduccini, Marcello and Schaub, Torsten},
  title     = {Answer set planning},
  series = {Theory and practice of logic programming},
  journal   = {Theory and practice of logic programming},
  publisher = {Cambridge University Press},
  address   = {New York},
  issn      = {1471-0684},
  doi       = {10.1017/S1471068422000072},
  pages     = {73},
  year      = {2022},
  abstract  = {Answer Set Planning refers to the use of Answer Set Programming (ASP) to compute plans, that is, solutions to planning problems, that transform a given state of the world to another state. The development of efficient and scalable answer set solvers has provided a significant boost to the development of ASP-based planning systems. This paper surveys the progress made during the last two and a half decades in the area of answer set planning, from its foundations to its use in challenging planning domains. The survey explores the advantages and disadvantages of answer set planning. It also discusses typical applications of answer set planning and presents a set of challenges for future research.},
  language  = {en}
}
@article{TiwariPrakashGrossetal.2020,
  author    = {Tiwari, Abhishek and Prakash, Jyoti and Groß, Sascha and Hammer, Christian},
  title     = {A large scale analysis of Android},
  series = {The journal of systems and software},
  volume    = {170},
  journal   = {The journal of systems and software},
  publisher = {Elsevier},
  address   = {New York},
  issn      = {0164-1212},
  doi       = {10.1016/j.jss.2020.110775},
  pages     = {17},
  year      = {2020},
  abstract  = {Many Android applications embed webpages via WebView components and execute JavaScript code within Android. Hybrid applications leverage dedicated APIs to load a resource and render it in a WebView. Furthermore, Android objects can be shared with the JavaScript world. However, bridging the interfaces of the Android and JavaScript world might also incur severe security threats: Potentially untrusted webpages and their JavaScript might interfere with the Android environment and its access to native features. No general analysis is currently available to assess the implications of such hybrid apps bridging the two worlds. To understand the semantics and effects of hybrid apps, we perform a large-scale study on the usage of the hybridization APIs in the wild. We analyze and categorize the parameters to hybridization APIs for 7,500 randomly selected and the 196 most popular applications from the Google Playstore as well as 1000 malware samples. Our results advance the general understanding of hybrid applications, as well as implications for potential program analyses, and the current security situation: We discovered thousands of flows of sensitive data from Android to JavaScript, the vast majority of which could flow to potentially untrustworthy code. Our analysis identified numerous web pages embedding vulnerabilities, which we exemplarily exploited. Additionally, we discovered a multitude of applications in which potentially untrusted JavaScript code may interfere with (trusted) Android objects, both in benign and malign applications.},
  language  = {en}
}
@article{ThonLandwehrDeRaedt2011,
  author    = {Thon, Ingo and Landwehr, Niels and De Raedt, Luc},
  title     = {Stochastic relational processes efficient inference and applications},
  series = {Machine learning},
  volume    = {82},
  journal   = {Machine learning},
  number    = {2},
  publisher = {Springer},
  address   = {Dordrecht},
  issn      = {0885-6125},
  doi       = {10.1007/s10994-010-5213-8},
  pages     = {239 -- 272},
  year      = {2011},
  abstract  = {One of the goals of artificial intelligence is to develop agents that learn and act in complex environments. Realistic environments typically feature a variable number of objects, relations amongst them, and non-deterministic transition behavior. While standard probabilistic sequence models provide efficient inference and learning techniques for sequential data, they typically cannot fully capture the relational complexity. On the other hand, statistical relational learning techniques are often too inefficient to cope with complex sequential data. In this paper, we introduce a simple model that occupies an intermediate position in this expressiveness/efficiency trade-off. It is based on CP-logic (Causal Probabilistic Logic), an expressive probabilistic logic for modeling causality. However, by specializing CP-logic to represent a probability distribution over sequences of relational state descriptions and employing a Markov assumption, inference and learning become more tractable and effective. Specifically, we show how to solve part of the inference and learning problems directly at the first-order level, while transforming the remaining part into the problem of computing all satisfying assignments for a Boolean formula in a binary decision diagram. We experimentally validate that the resulting technique is able to handle probabilistic relational domains with a substantial number of objects and relations.},
  language  = {en}
}
@article{Thomas2010,
  author    = {Thomas, Ivonne},
  title     = {Reliable digital identities for SOA and the Web},
  isbn      = {978-3-86956-036-6},
  year      = {2010},
  language  = {en}
}
@article{ThienenNoweskiRauthetal.2012,
  author    = {Thienen, Julia von and Noweski, Christine and Rauth, Ingo and Meinel, Christoph and Lange, Sabine},
  title     = {If you want to know who are, tell me where you are : the importance of places},
  year      = {2012},
  language  = {en}
}
@article{ThienenNoweskiMeineletal.2011,
  author    = {Thienen, Julia von and Noweski, Christine and Meinel, Christoph and Rauth, Ingo},
  title     = {The co-evolution of theory and practice in design thinking - or - "Mind the oddness trap!"},
  isbn      = {978-3-642-13756-3},
  year      = {2011},
  language  = {en}
}
@article{ThienenNoweskiMeineletal.2012,
  author    = {Thienen, Julia von and Noweski, Christine and Meinel, Christoph and Lang, Sabine and Nicolai, Claudia and Bartz, Andreas},
  title     = {What can design thinking learn from behavior group theraphy?},
  isbn      = {978-3-642-31990-7},
  year      = {2012},
  language  = {en}
}
@article{ThielscherSchaub1995,
  author    = {Thielscher, Michael and Schaub, Torsten H.},
  title     = {Default reasoning by deductive planning},
  year      = {1995},
  language  = {en}
}
@article{Teske2014,
  author    = {Teske, Daniel},
  title     = {Geocoder accuracy ranking},
  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     = {161 -- 174},
  year      = {2014},
  abstract  = {Finding an address on a map is sometimes tricky: the chosen map application may be unfamiliar with the enclosed region. There are several geocoders on the market, they have different databases and algorithms to compute the query. Consequently, the geocoding results differ in their quality. Fortunately the geocoders provide a rich set of metadata. The workflow described in this paper compares this metadata with the aim to find out which geocoder is offering the best-fitting coordinate for a given address.},
  language  = {en}
}
@article{TavakoliAlirezazadehHedayatipouretal.2021,
  author    = {Tavakoli, Hamad and Alirezazadeh, Pendar and Hedayatipour, Ava and Nasib, A. H. Banijamali and Landwehr, Niels},
  title     = {Leaf image-based classification of some common bean cultivars using discriminative convolutional neural networks},
  series = {Computers and electronics in agriculture : COMPAG online ; an international journal},
  volume    = {181},
  journal   = {Computers and electronics in agriculture : COMPAG online ; an international journal},
  publisher = {Elsevier},
  address   = {Amsterdam [u.a.]},
  issn      = {0168-1699},
  doi       = {10.1016/j.compag.2020.105935},
  pages     = {11},
  year      = {2021},
  abstract  = {In recent years, many efforts have been made to apply image processing techniques for plant leaf identification. However, categorizing leaf images at the cultivar/variety level, because of the very low inter-class variability, is still a challenging task. In this research, we propose an automatic discriminative method based on convolutional neural networks (CNNs) for classifying 12 different cultivars of common beans that belong to three various species. We show that employing advanced loss functions, such as Additive Angular Margin Loss and Large Margin Cosine Loss, instead of the standard softmax loss function for the classification can yield better discrimination between classes and thereby mitigate the problem of low inter-class variability. The method was evaluated by classifying species (level I), cultivars from the same species (level II), and cultivars from different species (level III), based on images from the leaf foreside and backside. The results indicate that the performance of the classification algorithm on the leaf backside image dataset is superior. The maximum mean classification accuracies of 95.86, 91.37 and 86.87\% were obtained at the levels I, II and III, respectively. The proposed method outperforms the previous relevant works and provides a reliable approach for plant cultivars identification.},
  language  = {en}
}
@article{Tarnick1995,
  author    = {Tarnick, Steffen},
  title     = {Controllable self-checking checkers for conditional concurrent checking},
  year      = {1995},
  language  = {en}
}
@article{Tarnick1994,
  author    = {Tarnick, Steffen},
  title     = {Bounding error masking in linear output space compression schemes},
  year      = {1994},
  language  = {en}
}
@article{Tarnick1994,
  author    = {Tarnick, Steffen},
  title     = {Controllable self-checking checkers for conditional concurrent checking},
  year      = {1994},
  language  = {en}
}
@article{SugiyamaKawanabeMueller2004,
  author    = {Sugiyama, Masashi and Kawanabe, Motoaki and M{\"u}ller, Klaus-Robert},
  title     = {Trading variance reduction with unbiasedness : the regularized subspace information criterion for robust model selection in kernel regression},
  issn      = {0899-7667},
  year      = {2004},
  abstract  = {A well-known result by Stein (1956) shows that in particular situations, biased estimators can yield better parameter estimates than their generally preferred unbiased counterparts. This letter follows the same spirit, as we will stabilize the unbiased generalization error estimates by regularization and finally obtain more robust model selection criteria for learning. We trade a small bias against a larger variance reduction, which has the beneficial effect of being more precise on a single training set. We focus on the subspace information criterion (SIC), which is an unbiased estimator of the expected generalization error measured by the reproducing kernel Hilbert space norm. SIC can be applied to the kernel regression, and it was shown in earlier experiments that a small regularization of SIC has a stabilization effect. However, it remained open how to appropriately determine the degree of regularization in SIC. In this article, we derive an unbiased estimator of the expected squared error, between SIC and the expected generalization error and propose determining the degree of regularization of SIC such that the estimator of the expected squared error is minimized. Computer simulations with artificial and real data sets illustrate that the proposed method works effectively for improving the precision of SIC, especially in the high-noise-level cases. We furthermore compare the proposed method to the original SIC, the cross-validation, and an empirical Bayesian method in ridge parameter selection, with good results},
  language  = {en}
}
@article{Strickroth2019,
  author    = {Strickroth, Sven},
  title     = {PLATON},
  series = {Education Sciences},
  volume    = {9},
  journal   = {Education Sciences},
  number    = {4},
  publisher = {MDPI},
  address   = {Basel},
  issn      = {2227-7102},
  doi       = {10.3390/educsci9040254},
  pages     = {26},
  year      = {2019},
  abstract  = {Lesson planning is both an important and demanding task—especially as part of teacher training. This paper presents the requirements for a lesson planning system and evaluates existing systems regarding these requirements. One major drawback of existing software tools is that most are limited to a text- or form-based representation of the lesson designs. In this article, a new approach with a graphical, time-based representation with (automatic) analyses methods is proposed and the system architecture and domain model are described in detail. The approach is implemented in an interactive, web-based prototype called PLATON, which additionally supports the management of lessons in units as well as the modelling of teacher and student-generated resources. The prototype was evaluated in a study with 61 prospective teachers (bachelor's and master's preservice teachers as well as teacher trainees in post-university teacher training) in Berlin, Germany, with a focus on usability. The results show that this approach proofed usable for lesson planning and offers positive effects for the perception of time and self-reflection.},
  language  = {en}
}
@article{StoffelKunzGerber1997,
  author    = {Stoffel, Dominik and Kunz, Wolfgang and Gerber, Stefan},
  title     = {And/Or reasoning graphs for determining prime implicants in multi-level combinational networks},
  year      = {1997},
  language  = {en}
}
@article{StoffelKunz1997,
  author    = {Stoffel, Dominik and Kunz, Wolfgang},
  title     = {Record \& play : a structural fixed point iteration for sequential circuit verification},
  isbn      = {0-8186-8200-0},
  year      = {1997},
  language  = {en}
}
@article{StoffelKunz1996,
  author    = {Stoffel, Dominik and Kunz, Wolfgang},
  title     = {Logic equivalence checking by optimization techniues},
  year      = {1996},
  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{SteinertStabernack2022,
  author    = {Steinert, Fritjof and Stabernack, Benno},
  title     = {Architecture of a low latency H.264/AVC video codec for robust ML based image classification how region of interests can minimize the impact of coding artifacts},
  series = {Journal of Signal Processing Systems for Signal, Image, and Video Technology},
  volume    = {94},
  journal   = {Journal of Signal Processing Systems for Signal, Image, and Video Technology},
  number    = {7},
  publisher = {Springer},
  address   = {New York},
  issn      = {1939-8018},
  doi       = {10.1007/s11265-021-01727-2},
  pages     = {693 -- 708},
  year      = {2022},
  abstract  = {The use of neural networks is considered as the state of the art in the field of image classification. A large number of different networks are available for this purpose, which, appropriately trained, permit a high level of classification accuracy. Typically, these networks are applied to uncompressed image data, since a corresponding training was also carried out using image data of similar high quality. However, if image data contains image errors, the classification accuracy deteriorates drastically. This applies in particular to coding artifacts which occur due to image and video compression. Typical application scenarios for video compression are narrowband transmission channels for which video coding is required but a subsequent classification is to be carried out on the receiver side. In this paper we present a special H.264/Advanced Video Codec (AVC) based video codec that allows certain regions of a picture to be coded with near constant picture quality in order to allow a reliable classification using neural networks, whereas the remaining image will be coded using constant bit rate. We have combined this feature with the ability to run with lowest latency properties, which is usually also required in remote control applications scenarios. The codec has been implemented as a fully hardwired High Definition video capable hardware architecture which is suitable for Field Programmable Gate Arrays.},
  language  = {en}
}