@article{KrasnovaVeltriSpengleretal.2013,
  author    = {Krasnova, Hanna and Veltri, Natasha F. and Spengler, Klaus and G{\"u}nther, Oliver},
  title     = {"Deal of the Day" Platforms what drives Consumer loyalty?},
  series = {Business \& information systems engineering : the international journal of Wirtschaftsinformatik},
  volume    = {5},
  journal   = {Business \& information systems engineering : the international journal of Wirtschaftsinformatik},
  number    = {3},
  publisher = {Springer},
  address   = {Heidelberg},
  issn      = {1867-0202},
  doi       = {10.1007/s12599-013-0268-2},
  pages     = {165 -- 177},
  year      = {2013},
  abstract  = {"Deal of the Day" (DoD) platforms have quickly become popular by offering savings on local services, products and vacations. For merchants, these platforms represent a new marketing channel to advertise their products and services and attract new customers. DoD platform providers, however, struggle to maintaining a stable market share and profitability, because entry and switching costs are low. To sustain a competitive market position, DoD providers are looking for ways to build a loyal customer base. However, research examining the determinants of user loyalty in this novel context is scarce. To fill this gap, this study employs Grounded Theory methodology to develop a conceptual model of customer loyalty to a DoD provider. In the next step, qualitative insights are enriched and validated using quantitative data from a survey of 202 DoD users. The authors find that customer loyalty is in large part driven by monetary incentives, but can be eroded if impressions from merchant encounters are below expectations. In addition, enhancing the share of deals relevant for consumers, i.e. signal-to-noise ratio, and mitigating perceived risks of a transaction emerge as challenges. Beyond theoretical value, the results offer practical insights into how customer loyalty to a DoD provider can be promoted.},
  language  = {en}
}
@article{BrainGebserPuehreretal.2007,
  author    = {Brain, Martin and Gebser, Martin and P{\"u}hrer, J{\"o}rg and Schaub, Torsten H. and Tompits, Hans and Woltran, Stefan},
  title     = {"That is illogical, Captain!" : the debugging support tool spock for answer-set programs ; system description},
  year      = {2007},
  language  = {en}
}
@article{JuergensenKonstantinidis2006,
  author    = {J{\"u}rgensen, Helmut and Konstantinidis, Stavros},
  title     = {(Near-)inverses of sequences},
  issn      = {0020-7160},
  doi       = {10.1080/00207160500537801},
  year      = {2006},
  abstract  = {We introduce the notion of a near-inverse of a non-decreasing sequence of positive integers; near-inverses are intended to assume the role of inverses in cases when the latter cannot exist. We prove that the near-inverse of such a sequence is unique; moreover, the relation of being near-inverses of each other is symmetric, i.e. if sequence g is the near-inverse of sequence f, then f is the near-inverse of g. There is a connection, by approximations, between near- inverses of sequences and inverses of continuous strictly increasing real-valued functions which can be exploited to derive simple expressions for near-inverses},
  language  = {en}
}
@article{DelgrandeSchaubTompitsetal.2004,
  author    = {Delgrande, James Patrick and Schaub, Torsten H. and Tompits, Hans and Wang, Kewen},
  title     = {A classification and survey of preference handling approchaches in nonmonotonic reasoning},
  issn      = {0824-7935},
  year      = {2004},
  abstract  = {In recent years, there has been a large amount of disparate work concerning the representation and reasoning with qualitative preferential information by means of approaches to nonmonotonic reasoning. Given the variety of underlying systems, assumptions, motivations, and intuitions, it is difficult to compare or relate one approach with another. Here, we present an overview and classification for approaches to dealing with preference. A set of criteria for classifying approaches is given, followed by a set of desiderata that an approach might be expected to satisfy. A comprehensive set of approaches is subsequently given and classified with respect to these sets of underlying principles},
  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{SchaubWang2001,
  author    = {Schaub, Torsten H. and Wang, Kewen},
  title     = {A comparative study of logic programs with preference},
  year      = {2001},
  language  = {en}
}
@article{SchaubWang2001,
  author    = {Schaub, Torsten H. and Wang, Kewen},
  title     = {A comparative study of logic programs with preference},
  isbn      = {1-558-60777-3},
  issn      = {1045-0823},
  year      = {2001},
  language  = {en}
}
@article{DelgrandeSchaubTompits2000,
  author    = {Delgrande, James Patrick and Schaub, Torsten H. and Tompits, Hans},
  title     = {A compilation of Brewka and Eiter's approach to prioritizationtion},
  isbn      = {3-540-41131-3},
  year      = {2000},
  language  = {en}
}
@article{SarsakovSchaubTompitsetal.2004,
  author    = {Sarsakov, Vladimir and Schaub, Torsten H. and Tompits, Hans and Woltran, Stefan},
  title     = {A compiler for nested logic programming},
  isbn      = {3-540- 20721-x},
  year      = {2004},
  language  = {en}
}
@article{DelgrandeSchaubTompits2000,
  author    = {Delgrande, James Patrick and Schaub, Torsten H. and Tompits, Hans},
  title     = {A compiler for ordered logic programs},
  year      = {2000},
  language  = {en}
}
@article{DelgrandeSchaub2003,
  author    = {Delgrande, James Patrick and Schaub, Torsten H.},
  title     = {A concictency-based paradigm for belief change},
  issn      = {0004-3702},
  year      = {2003},
  language  = {en}
}
@article{BrueningSchaub2000,
  author    = {Br{\"u}ning, Stefan and Schaub, Torsten H.},
  title     = {A connection calculus for handling incomplete information},
  year      = {2000},
  language  = {en}
}
@article{DelgrandeSchaub2007,
  author    = {Delgrande, James Patrick and Schaub, Torsten H.},
  title     = {A consistency-based framework for merging knowledge bases},
  issn      = {1570-8683},
  year      = {2007},
  language  = {en}
}
@article{DelgrandeSchaub2000,
  author    = {Delgrande, James Patrick and Schaub, Torsten H.},
  title     = {A consistency-based model for belief change: preliminary report},
  isbn      = {0-262-51112-6},
  year      = {2000},
  language  = {en}
}
@article{DelgrandeSchaub2000,
  author    = {Delgrande, James Patrick and Schaub, Torsten H.},
  title     = {A consistency-based model for belief change: preliminary report},
  year      = {2000},
  language  = {en}
}
@article{BesnardSchaub1993,
  author    = {Besnard, Philippe and Schaub, Torsten H.},
  title     = {A context-based framework for default logics},
  isbn      = {0-262-51071-5},
  year      = {1993},
  language  = {en}
}
@article{DelgrandeSchaubTompits2003,
  author    = {Delgrande, James Patrick and Schaub, Torsten H. and Tompits, Hans},
  title     = {A framework for compiling preferences in logic programs},
  year      = {2003},
  language  = {en}
}
@article{KreowskyStabernack2021,
  author    = {Kreowsky, Philipp and Stabernack, Christian Benno},
  title     = {A full-featured FPGA-based pipelined architecture for SIFT extraction},
  series = {IEEE access : practical research, open solutions / Institute of Electrical and Electronics Engineers},
  volume    = {9},
  journal   = {IEEE access : practical research, open solutions / Institute of Electrical and Electronics Engineers},
  publisher = {Inst. of Electr. and Electronics Engineers},
  address   = {New York, NY},
  issn      = {2169-3536},
  doi       = {10.1109/ACCESS.2021.3104387},
  pages     = {128564 -- 128573},
  year      = {2021},
  abstract  = {Image feature detection is a key task in computer vision. Scale Invariant Feature Transform (SIFT) is a prevalent and well known algorithm for robust feature detection. However, it is computationally demanding and software implementations are not applicable for real-time performance. In this paper, a versatile and pipelined hardware implementation is proposed, that is capable of computing keypoints and rotation invariant descriptors on-chip. All computations are performed in single precision floating-point format which makes it possible to implement the original algorithm with little alteration. Various rotation resolutions and filter kernel sizes are supported for images of any resolution up to ultra-high definition. For full high definition images, 84 fps can be processed. Ultra high definition images can be processed at 21 fps.},
  language  = {en}
}
@article{DelgrandeSchaubTompits2007,
  author    = {Delgrande, James Patrick and Schaub, Torsten H. and Tompits, Hans},
  title     = {A general framework for expressing preferences in causal reasoning and planning},
  issn      = {0955-792X},
  doi       = {10.1093/logcom/exm046},
  year      = {2007},
  abstract  = {We consider the problem of representing arbitrary preferences in causal reasoning and planning systems. In planning, a preference may be seen as a goal or constraint that is desirable, but not necessary, to satisfy. To begin, we define a very general query language for histories, or interleaved sequences of world states and actions. Based on this, we specify a second language in which preferences are defined. A single preference defines a binary relation on histories, indicating that one history is preferred to the other. From this, one can define global preference orderings on the set of histories, the maximal elements of which are the preferred histories. The approach is very general and flexible; thus it constitutes a base language in terms of which higher-level preferences may be defined. To this end, we investigate two fundamental types of preferences that we call choice and temporal preferences. We consider concrete strategies for these types of preferences and encode them in terms of our framework. We suggest how to express aggregates in the approach, allowing, e.g. the expression of a preference for histories with lowest total action costs. Last, our approach can be used to express other approaches and so serves as a common framework in which such approaches can be expressed and compared. We illustrate this by indicating how an approach due to Son and Pontelli can be encoded in our approach, as well as the language PDDL3.},
  language  = {en}
}
@article{DelgrandeSchaubTompits2001,
  author    = {Delgrande, James Patrick and Schaub, Torsten H. and Tompits, Hans},
  title     = {A generic compiler for ordered logic programs},
  isbn      = {3-540-42593-4},
  year      = {2001},
  language  = {en}
}
@article{AngerKonczakLinkeetal.2005,
  author    = {Anger, Christian and Konczak, Kathrin and Linke, Thomas and Schaub, Torsten H.},
  title     = {A Glimpse of Answer Set Programming},
  issn      = {0170-4516},
  year      = {2005},
  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{HlawiczkaGoesselSogomonyan1997,
  author    = {Hlawiczka, A. and G{\"o}ssel, Michael and Sogomonyan, Egor S.},
  title     = {A linear code-preserving signature analyzer COPMISR},
  isbn      = {0-8186-7810-0},
  year      = {1997},
  language  = {en}
}
@article{BesnardHunter2001,
  author    = {Besnard, Philippe and Hunter, Anthony},
  title     = {A logic-based theory of deductive arguments},
  issn      = {0004-3702},
  year      = {2001},
  language  = {en}
}
@article{SaposhnikovSaposhnikovGoesseletal.1999,
  author    = {Saposhnikov, V. V. and Saposhnikov, Vl. V. and G{\"o}ssel, Michael and Morosov, Andrej},
  title     = {A method of construction of combinational self-checking units with detection of all single faults},
  year      = {1999},
  language  = {en}
}
@article{BrueningSchaub1996,
  author    = {Br{\"u}ning, Stefan and Schaub, Torsten H.},
  title     = {A model-based approach to consistency-checking},
  isbn      = {3-540-61286-6},
  year      = {1996},
  language  = {en}
}
@article{DelgrandeSchaubTompitsetal.2013,
  author    = {Delgrande, James and Schaub, Torsten H. and Tompits, Hans and Woltran, Stefan},
  title     = {A model-theoretic approach to belief change in answer set programming},
  series = {ACM transactions on computational logic},
  volume    = {14},
  journal   = {ACM transactions on computational logic},
  number    = {2},
  publisher = {Association for Computing Machinery},
  address   = {New York},
  issn      = {1529-3785},
  doi       = {10.1145/2480759.2480766},
  pages     = {46},
  year      = {2013},
  abstract  = {We address the problem of belief change in (nonmonotonic) logic programming under answer set semantics. Our formal techniques are analogous to those of distance-based belief revision in propositional logic. In particular, we build upon the model theory of logic programs furnished by SE interpretations, where an SE interpretation is a model of a logic program in the same way that a classical interpretation is a model of a propositional formula. Hence we extend techniques from the area of belief revision based on distance between models to belief change in logic programs. We first consider belief revision: for logic programs P and Q, the goal is to determine a program R that corresponds to the revision of P by Q, denoted P * Q. We investigate several operators, including (logic program) expansion and two revision operators based on the distance between the SE models of logic programs. It proves to be the case that expansion is an interesting operator in its own right, unlike in classical belief revision where it is relatively uninteresting. Expansion and revision are shown to satisfy a suite of interesting properties; in particular, our revision operators satisfy all or nearly all of the AGM postulates for revision. We next consider approaches for merging a set of logic programs, P-1,...,P-n. Again, our formal techniques are based on notions of relative distance between the SE models of the logic programs. Two approaches are examined. The first informally selects for each program P-i those models of P-i that vary the least from models of the other programs. The second approach informally selects those models of a program P-0 that are closest to the models of programs P-1,...,P-n. In this case, P-0 can be thought of as a set of database integrity constraints. We examine these operators with regards to how they satisfy relevant postulate sets. Last, we present encodings for computing the revision as well as the merging of logic programs within the same logic programming framework. This gives rise to a direct implementation of our approach in terms of off-the-shelf answer set solvers. These encodings also reflect the fact that our change operators do not increase the complexity of the base formalism.},
  language  = {en}
}
@article{SogomonyanSinghGoessel1998,
  author    = {Sogomonyan, Egor S. and Singh, Adit D. and G{\"o}ssel, Michael},
  title     = {A multi-mode scannable memory element for high test application efficiency and delay testing},
  year      = {1998},
  language  = {en}
}
@article{SogomonyanSinghGoessel1999,
  author    = {Sogomonyan, Egor S. and Singh, Adit D. and G{\"o}ssel, Michael},
  title     = {A multi-mode scannable memory element for high test application efficiency and delay testing},
  year      = {1999},
  language  = {en}
}
@article{Gohlke1995,
  author    = {Gohlke, Mario},
  title     = {A new approach for model-based recognition using colour regions},
  year      = {1995},
  language  = {en}
}
@article{SaposhnikovMorosovSaposhnikovetal.1998,
  author    = {Saposhnikov, V. V. and Morosov, Andrej and Saposhnikov, Vl. V. and G{\"o}ssel, Michael},
  title     = {A new design method for self-checking unidirectional combinational circuits},
  year      = {1998},
  language  = {en}
}
@article{Richter1995,
  author    = {Richter, Peter},
  title     = {A new deterministic approach for the optimization of cable layouts for power supply systems},
  year      = {1995},
  language  = {en}
}
@article{Goessel1999,
  author    = {G{\"o}ssel, Michael},
  title     = {A new method of redundancy addition for circuit optimization},
  series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  volume    = {1999, 08},
  journal   = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  publisher = {Univ.},
  address   = {Potsdam},
  issn      = {0946-7580},
  pages     = {9 Bl.},
  year      = {1999},
  language  = {en}
}
@article{SogomonyanGoessel1995,
  author    = {Sogomonyan, Egor S. and G{\"o}ssel, Michael},
  title     = {A new parity preserving multi-input signature analyser},
  year      = {1995},
  language  = {en}
}
@article{GoesselSogomonyan1996,
  author    = {G{\"o}ssel, Michael and Sogomonyan, Egor S.},
  title     = {A new self-testing parity checker for ultra-reliable applications},
  year      = {1996},
  language  = {en}
}
@article{GoesselSogomonyanMorosov1999,
  author    = {G{\"o}ssel, Michael and Sogomonyan, Egor S. and Morosov, Andrej},
  title     = {A new totally error propagating compactor for arbitrary cores with digital interfaces},
  year      = {1999},
  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{LiangLiuLiuetal.2015,
  author    = {Liang, Feng and Liu, Yunzhen and Liu, Hai and Ma, Shilong and Schnor, Bettina},
  title     = {A Parallel Job Execution Time Estimation Approach Based on User Submission Patterns within Computational Grids},
  series = {International journal of parallel programming},
  volume    = {43},
  journal   = {International journal of parallel programming},
  number    = {3},
  publisher = {Springer},
  address   = {New York},
  issn      = {0885-7458},
  doi       = {10.1007/s10766-013-0294-1},
  pages     = {440 -- 454},
  year      = {2015},
  abstract  = {Scheduling performance in computational grid can potentially benefit a lot from accurate execution time estimation for parallel jobs. Most existing approaches for the parallel job execution time estimation, however, require ample past job traces and the explicit correlations between the job execution time and the outer layout parameters such as the consumed processor numbers, the user-estimated execution time and the job ID, which are hard to obtain or reveal. This paper presents and evaluates a novel execution time estimation approach for parallel jobs, the user-behavior clustering for execution time estimation, which can give more accurate execution time estimation for parallel jobs through exploring the job similarity and revealing the user submission patterns. Experiment results show that compared to the state-of-art algorithms, our approach can improve the accuracy of the job execution time estimation up to 5.6 \%, meanwhile the time that our approach spends on calculation can be reduced up to 3.8 \%.},
  language  = {en}
}
@article{GoesselSogomonyan1996,
  author    = {G{\"o}ssel, Michael and Sogomonyan, Egor S.},
  title     = {A parity-preserving multi-input signature analyzer and it application for concurrent checking and BIST},
  year      = {1996},
  language  = {en}
}
@article{PearceSarsakovSchaubetal.2002,
  author    = {Pearce, David and Sarsakov, Vladimir and Schaub, Torsten H. and Tompits, Hans and Woltran, Stefan},
  title     = {A polynomial translation of logic programs with nested expressions into disjunctive logic programs},
  isbn      = {3-540-43930-7},
  year      = {2002},
  language  = {en}
}
@article{PearceSarsakovSchaubetal.2002,
  author    = {Pearce, David and Sarsakov, Vladimir and Schaub, Torsten H. and Tompits, Hans and Woltran, Stefan},
  title     = {A polynomial translation of logic programs with nested expressions into disjunctive logic programs : preliminary report},
  year      = {2002},
  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{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{Boerner1998,
  author    = {B{\"o}rner, Ferdinand},
  title     = {A remark on the finite lattice representation problem},
  year      = {1998},
  language  = {en}
}
@article{Schoebel2010,
  author    = {Sch{\"o}bel, Michael},
  title     = {A runtime environment for online processing of operating system kernel events},
  isbn      = {978-3-86956-036-6},
  year      = {2010},
  language  = {en}
}
@article{SogomonyanSinghGoessel1998,
  author    = {Sogomonyan, Egor S. and Singh, Adit D. and G{\"o}ssel, Michael},
  title     = {A scan based concrrent BIST approach for low cost on-line testing},
  year      = {1998},
  language  = {en}
}
@article{SchaubWang2003,
  author    = {Schaub, Torsten H. and Wang, Kewen},
  title     = {A semantic framework for prefernce handling in answer set programming},
  year      = {2003},
  language  = {en}
}
@article{GoesselChakrabartyOcheretnijetal.2004,
  author    = {Goessel, Michael and Chakrabarty, Krishnendu and Ocheretnij, V. and Leininger, Andreas},
  title     = {A signature analysis technique for the identification of failing vectors with application to Scan-BIST},
  issn      = {0923-8174},
  year      = {2004},
  abstract  = {We present a new technique for uniquely identifying a single failing vector in an interval of test vectors. This technique is applicable to combinational circuits and for scan-BIST in sequential circuits with multiple scan chains. The proposed method relies on the linearity properties of the MISR and on the use of two test sequences, which are both applied to the circuit under test. The second test sequence is derived from the first in a straightforward manner and the same test pattern source is used for both test sequences. If an interval contains only a single failing vector, the algebraic analysis is guaranteed to identify it. We also show analytically that if an interval contains two failing vectors, the probability that this case is interpreted as one failing vector is very low. We present experimental results for the ISCAS benchmark circuits to demonstrate the use of the proposed method for identifying failing test vectors},
  language  = {en}
}
@article{BesnardSchaub1996,
  author    = {Besnard, Philippe and Schaub, Torsten H.},
  title     = {A simple signed system for paraconsistent reasoning},
  isbn      = {3-540-61630-6},
  year      = {1996},
  language  = {en}
}
@article{SeuringGoesselSogomonyan1998,
  author    = {Seuring, Markus and G{\"o}ssel, Michael and Sogomonyan, Egor S.},
  title     = {A structural approach for space compaction for concurrent checking and BIST},
  year      = {1998},
  language  = {en}
}
@article{SeuringGoessel1999,
  author    = {Seuring, Markus and G{\"o}ssel, Michael},
  title     = {A structural approach for space compaction for sequential circuits},
  year      = {1999},
  language  = {en}
}
@article{SeuringGoessel1999,
  author    = {Seuring, Markus and G{\"o}ssel, Michael},
  title     = {A structural method for output compaction of sequential automata implemented as circuits},
  year      = {1999},
  language  = {en}
}
@article{LuckeRensing2014,
  author    = {Lucke, Ulrike and Rensing, Christoph},
  title     = {A survey on pervasive education},
  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.12.001},
  pages     = {3 -- 16},
  year      = {2014},
  abstract  = {Researchers and developers worldwide have put their efforts into the design, development and use of information and communication technology to support teaching and learning. This research is driven by pedagogical as well as technological disciplines. The most challenging ideas are currently found in the application of mobile, ubiquitous, pervasive, contextualized and seamless technologies for education, which we shall refer to as pervasive education. This article provides a comprehensive overview of the existing work in this field and categorizes it with respect to educational settings. Using this approach, best practice solutions for certain educational settings and open questions for pervasive education are highlighted in order to inspire interested developers and educators. The work is assigned to different fields, identified by the main pervasive technologies used and the educational settings. Based on these assignments we identify areas within pervasive education that are currently disregarded or deemed challenging so that further research and development in these fields are stimulated in a trans-disciplinary approach. (C) 2013 Elsevier B.V. All rights reserved.},
  language  = {en}
}
@article{AngerKonczakLinke2001,
  author    = {Anger, Christian and Konczak, Kathrin and Linke, Thomas},
  title     = {A system for non-monotonic reasoning under answer set semantics},
  isbn      = {3-540-42593-4},
  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{LyTarkhanov2009,
  author    = {Ly, Ibrahim and Tarkhanov, Nikolai Nikolaevich},
  title     = {A variational approach to the Cauchy problem for nonlinear elliptic differential equations},
  issn      = {0928-0219},
  doi       = {10.1515/Jiip.2009.037},
  year      = {2009},
  abstract  = {We discuss the relaxation of a class of nonlinear elliptic Cauchy problems with data on a piece S of the boundary surface by means of a variational approach known in the optimal control literature as "equation error method". By the Cauchy problem is meant any boundary value problem for an unknown function y in a domain X with the property that the data on S, if combined with the differential equations in X, allow one to determine all derivatives of y on S by means of functional equations. In the case of real analytic data of the Cauchy problem, the existence of a local solution near S is guaranteed by the Cauchy-Kovalevskaya theorem. We also admit overdetermined elliptic systems, in which case the set of those Cauchy data on S for which the Cauchy problem is solvable is very "thin". For this reason we discuss a variational setting of the Cauchy problem which always possesses a generalised solution.},
  language  = {en}
}
@article{BrueningSchaub1999,
  author    = {Br{\"u}ning, Stefan and Schaub, Torsten H.},
  title     = {A voiding non-ground variables},
  year      = {1999},
  language  = {en}
}
@article{Respondek2014,
  author    = {Respondek, Tobias},
  title     = {A workflow for computing potential areas for wind turbines},
  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},
  pages     = {200 -- 215},
  year      = {2014},
  abstract  = {This paper describes the implementation of a workflow model for service-oriented computing of potential areas for wind turbines in jABC. By implementing a re-executable model the manual effort of a multi-criteria site analysis can be reduced. The aim is to determine the shift of typical geoprocessing tools of geographic information systems (GIS) from the desktop to the web. The analysis is based on a vector data set and mainly uses web services of the "Center for Spatial Information Science and Systems" (CSISS). This paper discusses effort, benefits and problems associated with the use of the web services.},
  language  = {en}
}
@article{Schwill2001,
  author    = {Schwill, Andreas},
  title     = {Ab wann kann man mit Indern Informatik machen? : eine Studie {\"u}ber informatische F{\"a}higkeiten von Kindern},
  year      = {2001},
  language  = {de}
}
@article{KonczakVogel2005,
  author    = {Konczak, Kathrin and Vogel, Ralf},
  title     = {Abduction and Preferences in Linguistics},
  year      = {2005},
  language  = {en}
}
@article{KonczakVogel2005,
  author    = {Konczak, Kathrin and Vogel, Ralf},
  title     = {Abduction and preferences in linguistics : Extended abstract},
  issn      = {0302-9743},
  year      = {2005},
  language  = {en}
}
@article{Polyvyanyy2010,
  author    = {Polyvyanyy, Artem},
  title     = {Abstraction of process specifications},
  isbn      = {978-3-86956-036-6},
  year      = {2010},
  language  = {en}
}
@article{FabianKunzKonnegenetal.2012,
  author    = {Fabian, Benjamin and Kunz, Steffen and Konnegen, Marcel and M{\"u}ller, Sebastian and G{\"u}nther, Oliver},
  title     = {Access control for semantic data federations in industrial product-lifecycle management},
  series = {Computers in industry : an international, application oriented research journal},
  volume    = {63},
  journal   = {Computers in industry : an international, application oriented research journal},
  number    = {9},
  publisher = {Elsevier},
  address   = {Amsterdam},
  issn      = {0166-3615},
  doi       = {10.1016/j.compind.2012.08.015},
  pages     = {930 -- 940},
  year      = {2012},
  abstract  = {Information integration across company borders becomes increasingly important for the success of product lifecycle management in industry and complex supply chains. Semantic technologies are about to play a crucial role in this integrative process. However, cross-company data exchange requires mechanisms to enable fine-grained access control definition and enforcement, preventing unauthorized leakage of confidential data across company borders. Currently available semantic repositories are not sufficiently equipped to satisfy this important requirement. This paper presents an infrastructure for controlled sharing of semantic data between cooperating business partners. First, we motivate the need for access control in semantic data federations by a case study in the industrial service sector. Furthermore, we present an architecture for controlling access to semantic repositories that is based on our newly developed SemForce security service. Finally, we show the practical feasibility of this architecture by an implementation and several performance experiments.},
  language  = {en}
}
@article{SawadeBickelvonOertzenetal.2013,
  author    = {Sawade, Christoph and Bickel, Steffen and von Oertzen, Timo and Scheffer, Tobias and Landwehr, Niels},
  title     = {Active evaluation of ranking functions based on graded relevance},
  series = {Machine learning},
  volume    = {92},
  journal   = {Machine learning},
  number    = {1},
  publisher = {Springer},
  address   = {Dordrecht},
  issn      = {0885-6125},
  doi       = {10.1007/s10994-013-5372-5},
  pages     = {41 -- 64},
  year      = {2013},
  abstract  = {Evaluating the quality of ranking functions is a core task in web search and other information retrieval domains. Because query distributions and item relevance change over time, ranking models often cannot be evaluated accurately on held-out training data. Instead, considerable effort is spent on manually labeling the relevance of query results for test queries in order to track ranking performance. We address the problem of estimating ranking performance as accurately as possible on a fixed labeling budget. Estimates are based on a set of most informative test queries selected by an active sampling distribution. Query labeling costs depend on the number of result items as well as item-specific attributes such as document length. We derive cost-optimal sampling distributions for the commonly used performance measures Discounted Cumulative Gain and Expected Reciprocal Rank. Experiments on web search engine data illustrate significant reductions in labeling costs.},
  language  = {en}
}
@article{LuckowJhaKimetal.2009,
  author    = {Luckow, Andre and Jha, Shantenu and Kim, Joohyun and Merzky, Andre and Schnor, Bettina},
  title     = {Adaptive distributed replica-exchange simulations},
  issn      = {1364-503X},
  doi       = {10.1098/rsta.2009.0051},
  year      = {2009},
  abstract  = {Owing to the loose coupling between replicas, the replica-exchange (RE) class of algorithms should be able to benefit greatly from using as many resources as available. However, the ability to effectively use multiple distributed resources to reduce the time to completion remains a challenge at many levels. Additionally, an implementation of a pleasingly distributed algorithm such as replica-exchange, which is independent of infrastructural details, does not exist. This paper proposes an extensible and scalable framework based on Simple API for Grid Applications that provides a general-purpose, opportunistic mechanism to effectively use multiple resources in an infrastructure-independent way. By analysing the requirements of the RE algorithm and the challenges of implementing it on real production systems, we propose a new abstraction (BIGJOB), which forms the basis of the adaptive redistribution and effective scheduling of replicas.},
  language  = {en}
}
@article{Kupries1999,
  author    = {Kupries, Mario},
  title     = {ADE : An architecture type-based development environment for agent application systems},
  year      = {1999},
  language  = {en}
}
@article{BrewkaEllmauthalerKernIsberneretal.2018,
  author    = {Brewka, Gerhard and Ellmauthaler, Stefan and Kern-Isberner, Gabriele and Obermeier, Philipp and Ostrowski, Max and Romero, Javier and Schaub, Torsten H. and Schieweck, Steffen},
  title     = {Advanced solving technology for dynamic and reactive applications},
  series = {K{\"u}nstliche Intelligenz},
  volume    = {32},
  journal   = {K{\"u}nstliche Intelligenz},
  number    = {2-3},
  publisher = {Springer},
  address   = {Heidelberg},
  issn      = {0933-1875},
  doi       = {10.1007/s13218-018-0538-8},
  pages     = {199 -- 200},
  year      = {2018},
  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{HirschfeldSteinertLincke2011,
  author    = {Hirschfeld, Robert and Steinert, Bastian and Lincke, Jens},
  title     = {Agile software development in virtual collaboration environments},
  isbn      = {978-3-642-13756-3},
  year      = {2011},
  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{GebserSchaubTompitsetal.2007,
  author    = {Gebser, Martin and Schaub, Torsten H. and Tompits, Hans and Woltran, Stefan},
  title     = {Alternative characterizations for program equivalence under aswer-set semantics : a preliminary report},
  year      = {2007},
  language  = {en}
}
@article{LinkeSchaub2000,
  author    = {Linke, Thomas and Schaub, Torsten H.},
  title     = {Alternative foundations for Reiter's default logic.},
  issn      = {0004-3702},
  year      = {2000},
  language  = {en}
}
@article{PabloAlarconArroyoBordihnetal.2015,
  author    = {Pablo Alarcon, Pedro and Arroyo, Fernando and Bordihn, Henning and Mitrana, Victor and Mueller, Mike},
  title     = {Ambiguity of the multiple interpretations on regular languages},
  series = {Fundamenta informaticae},
  volume    = {138},
  journal   = {Fundamenta informaticae},
  number    = {1-2},
  publisher = {IOS Press},
  address   = {Amsterdam},
  issn      = {0169-2968},
  doi       = {10.3233/FI-2015-1200},
  pages     = {85 -- 95},
  year      = {2015},
  abstract  = {A multiple interpretation scheme is an ordered sequence of morphisms. The ordered multiple interpretation of a word is obtained by concatenating the images of that word in the given order of morphisms. The arbitrary multiple interpretation of a word is the semigroup generated by the images of that word. These interpretations are naturally extended to languages. Four types of ambiguity of multiple interpretation schemata on a language are defined: o-ambiguity, internal ambiguity, weakly external ambiguity and strongly external ambiguity. We investigate the problem of deciding whether a multiple interpretation scheme is ambiguous on regular languages.},
  language  = {en}
}
@article{BesnardSchaub1995,
  author    = {Besnard, Philippe and Schaub, Torsten H.},
  title     = {An approach to context-based default reasoning},
  issn      = {0169-2968},
  year      = {1995},
  language  = {en}
}
@article{LinkeSchaub1998,
  author    = {Linke, Thomas and Schaub, Torsten H.},
  title     = {An approach to query-answering in Reiter's default logic and the underlying existence of extensions problem.},
  isbn      = {3-540-65141-1},
  year      = {1998},
  language  = {en}
}
@article{ReinkeGloedeLauertetal.1999,
  author    = {Reinke, Thomas and Gl{\"o}de, Dirk and Lauert, Alexander and Kupries, Mario and Horn, Erika},
  title     = {An architecture type-based development environment for agent application systems},
  isbn      = {3-9501023-0-2},
  year      = {1999},
  language  = {en}
}
@article{OnodaRaetschMueller2000,
  author    = {Onoda, T. and R{\"a}tsch, Gunnar and M{\"u}ller, Klaus-Robert},
  title     = {An asymptotic analysis and improvement of AdaBoost in the binary classification case (in Japanese)},
  year      = {2000},
  language  = {en}
}
@article{LindauerHoosHutteretal.2015,
  author    = {Lindauer, Marius and Hoos, Holger H. and Hutter, Frank and Schaub, Torsten H.},
  title     = {An automatically configured algorithm selector},
  series = {The journal of artificial intelligence research},
  volume    = {53},
  journal   = {The journal of artificial intelligence research},
  publisher = {AI Access Foundation},
  address   = {Marina del Rey},
  issn      = {1076-9757},
  pages     = {745 -- 778},
  year      = {2015},
  abstract  = {Algorithm selection (AS) techniques - which involve choosing from a set of algorithms the one expected to solve a given problem instance most efficiently - have substantially improved the state of the art in solving many prominent AI problems, such as SAT, CSP, ASP, MAXSAT and QBF. Although several AS procedures have been introduced, not too surprisingly, none of them dominates all others across all AS scenarios. Furthermore, these procedures have parameters whose optimal values vary across AS scenarios. This holds specifically for the machine learning techniques that form the core of current AS procedures, and for their hyperparameters. Therefore, to successfully apply AS to new problems, algorithms and benchmark sets, two questions need to be answered: (i) how to select an AS approach and (ii) how to set its parameters effectively. We address both of these problems simultaneously by using automated algorithm configuration. Specifically, we demonstrate that we can automatically configure claspfolio 2, which implements a large variety of different AS approaches and their respective parameters in a single, highly-parameterized algorithm framework. Our approach, dubbed AutoFolio, allows researchers and practitioners across a broad range of applications to exploit the combined power of many different AS methods. We demonstrate AutoFolio can significantly improve the performance of claspfolio 2 on 8 out of the 13 scenarios from the Algorithm Selection Library, leads to new state-of-the-art algorithm selectors for 7 of these scenarios, and matches state-of-the-art performance (statistically) on all other scenarios. Compared to the best single algorithm for each AS scenario, AutoFolio achieves average speedup factors between 1.3 and 15.4.},
  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}
}
@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{SchaubNicolas1997,
  author    = {Schaub, Torsten H. and Nicolas, Pascal},
  title     = {An implementation platform for query-answering in default logics : the XRay system, its implementation and evaluation},
  isbn      = {3-540-63255-7},
  year      = {1997},
  language  = {en}
}
@article{SchaubNicolas1997,
  author    = {Schaub, Torsten H. and Nicolas, Pascal},
  title     = {An implementation platform for query-answering in default logics : theoretical underpinnings},
  isbn      = {3-540-63614-5},
  year      = {1997},
  language  = {en}
}
@article{GebserSabuncuSchaub2011,
  author    = {Gebser, Martin and Sabuncu, Orkunt and Schaub, Torsten H.},
  title     = {An incremental answer set programming based system for finite model computation},
  series = {AI communications : AICOM ; the European journal on artificial intelligence},
  volume    = {24},
  journal   = {AI communications : AICOM ; the European journal on artificial intelligence},
  number    = {2},
  publisher = {IOS Press},
  address   = {Amsterdam},
  issn      = {0921-7126},
  doi       = {10.3233/AIC-2011-0496},
  pages     = {195 -- 212},
  year      = {2011},
  abstract  = {We address the problem of Finite Model Computation (FMC) of first-order theories and show that FMC can efficiently and transparently be solved by taking advantage of a recent extension of Answer Set Programming (ASP), called incremental Answer Set Programming (iASP). The idea is to use the incremental parameter in iASP programs to account for the domain size of a model. The FMC problem is then successively addressed for increasing domain sizes until an answer set, representing a finite model of the original first-order theory, is found. We implemented a system based on the iASP solver iClingo and demonstrate its competitiveness by showing that it slightly outperforms the winner of the FNT division of CADE's 2009 Automated Theorem Proving (ATP) competition on the respective benchmark collection.},
  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{Pascalau2010,
  author    = {Pascalau, Emilian},
  title     = {An overview on teh current approaches for building and executing mashups},
  isbn      = {978-3-86956-036-6},
  year      = {2010},
  language  = {en}
}
@article{MontavonBraunKruegeretal.2013,
  author    = {Montavon, Gregoire and Braun, Mikio L. and Kr{\"u}ger, Tammo and M{\"u}ller, Klaus-Robert},
  title     = {Analyzing local structure in Kernel-Based learning},
  series = {IEEE signal processing magazine},
  volume    = {30},
  journal   = {IEEE signal processing magazine},
  number    = {4},
  publisher = {Inst. of Electr. and Electronics Engineers},
  address   = {Piscataway},
  issn      = {1053-5888},
  doi       = {10.1109/MSP.2013.2249294},
  pages     = {62 -- 74},
  year      = {2013},
  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{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{BanbaraSohTamuraetal.2013,
  author    = {Banbara, Mutsunori and Soh, Takehide and Tamura, Naoyuki and Inoue, Katsumi and Schaub, Torsten H.},
  title     = {Answer set programming as a modeling language for course timetabling},
  series = {Theory and practice of logic programming},
  volume    = {13},
  journal   = {Theory and practice of logic programming},
  number    = {2},
  publisher = {Cambridge Univ. Press},
  address   = {New York},
  issn      = {1471-0684},
  doi       = {10.1017/S1471068413000495},
  pages     = {783 -- 798},
  year      = {2013},
  abstract  = {The course timetabling problem can be generally defined as the task of assigning a number of lectures to a limited set of timeslots and rooms, subject to a given set of hard and soft constraints. The modeling language for course timetabling is required to be expressive enough to specify a wide variety of soft constraints and objective functions. Furthermore, the resulting encoding is required to be extensible for capturing new constraints and for switching them between hard and soft, and to be flexible enough to deal with different formulations. In this paper, we propose to make effective use of ASP as a modeling language for course timetabling. We show that our ASP-based approach can naturally satisfy the above requirements, through an ASP encoding of the curriculum-based course timetabling problem proposed in the third track of the second international timetabling competition (ITC-2007). Our encoding is compact and human-readable, since each constraint is individually expressed by either one or two rules. Each hard constraint is expressed by using integrity constraints and aggregates of ASP. Each soft constraint S is expressed by rules in which the head is the form of penalty (S, V, C), and a violation V and its penalty cost C are detected and calculated respectively in the body. We carried out experiments on four different benchmark sets with five different formulations. We succeeded either in improving the bounds or producing the same bounds for many combinations of problem instances and formulations, compared with the previous best known bounds.},
  language  = {en}
}
@article{SchaubWoltran2018,
  author    = {Schaub, Torsten H. and Woltran, Stefan},
  title     = {Answer set programming unleashed!},
  series = {K{\"u}nstliche Intelligenz},
  volume    = {32},
  journal   = {K{\"u}nstliche Intelligenz},
  number    = {2-3},
  publisher = {Springer},
  address   = {Heidelberg},
  issn      = {0933-1875},
  doi       = {10.1007/s13218-018-0550-z},
  pages     = {105 -- 108},
  year      = {2018},
  abstract  = {Answer Set Programming faces an increasing popularity for problem solving in various domains. While its modeling language allows us to express many complex problems in an easy way, its solving technology enables their effective resolution. In what follows, we detail some of the key factors of its success. Answer Set Programming [ASP; Brewka et al. Commun ACM 54(12):92-103, (2011)] is seeing a rapid proliferation in academia and industry due to its easy and flexible way to model and solve knowledge-intense combinatorial (optimization) problems. To this end, ASP offers a high-level modeling language paired with high-performance solving technology. As a result, ASP systems provide out-off-the-box, general-purpose search engines that allow for enumerating (optimal) solutions. They are represented as answer sets, each being a set of atoms representing a solution. The declarative approach of ASP allows a user to concentrate on a problem's specification rather than the computational means to solve it. This makes ASP a prime candidate for rapid prototyping and an attractive tool for teaching key AI techniques since complex problems can be expressed in a succinct and elaboration tolerant way. This is eased by the tuning of ASP's modeling language to knowledge representation and reasoning (KRR). The resulting impact is nicely reflected by a growing range of successful applications of ASP [Erdem et al. AI Mag 37(3):53-68, 2016; Falkner et al. Industrial applications of answer set programming. K++nstliche Intelligenz (2018)]},
  language  = {en}
}
@article{SrinivasanSenthilkumarMohamedetal.2012,
  author    = {Srinivasan, K. and Senthilkumar, D. V. and Mohamed, I. Raja and Murali, K. and Lakshmanan, M. and Kurths, J{\"u}rgen},
  title     = {Anticipating, complete and lag synchronizations in RC phase-shift network based coupled Chua's circuits without delay},
  series = {Chaos : an interdisciplinary journal of nonlinear science},
  volume    = {22},
  journal   = {Chaos : an interdisciplinary journal of nonlinear science},
  number    = {2},
  publisher = {American Institute of Physics},
  address   = {Melville},
  issn      = {1054-1500},
  doi       = {10.1063/1.4711375},
  pages     = {8},
  year      = {2012},
  abstract  = {We construct a new RC phase shift network based Chua's circuit, which exhibits a period-doubling bifurcation route to chaos. Using coupled versions of such a phase-shift network based Chua's oscillators, we describe a new method for achieving complete synchronization (CS), approximate lag synchronization (LS), and approximate anticipating synchronization (AS) without delay or parameter mismatch. Employing the Pecora and Carroll approach, chaos synchronization is achieved in coupled chaotic oscillators, where the drive system variables control the response system. As a result, AS or LS or CS is demonstrated without using a variable delay line both experimentally and numerically.},
  language  = {en}
}
@article{Schaub2003,
  author    = {Schaub, Torsten H.},
  title     = {Antwortmengenprogrammierung},
  year      = {2003},
  language  = {de}
}
@article{SteinertHirschfeld2012,
  author    = {Steinert, Bastian and Hirschfeld, Robert},
  title     = {Applying design knowledge to programming},
  year      = {2012},
  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{SchneidenbachSchnorPetri2003,
  author    = {Schneidenbach, Lars and Schnor, Bettina and Petri, Stefan},
  title     = {Architecture and Implementation of the Socket Interface on Top of GAMMA},
  isbn      = {0-7695-2037-5},
  year      = {2003},
  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}
}
@article{Reinke2000,
  author    = {Reinke, Thomas},
  title     = {Architecture-based construction of multiagent systems},
  isbn      = {1-58603-013-2},
  year      = {2000},
  language  = {en}
}
@article{Wang2000,
  author    = {Wang, Kewen},
  title     = {Argumentation-based abduction in disjunctive logic programming},
  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}
}