TY - JOUR A1 - Delgrande, James Patrick A1 - Schaub, Torsten A1 - Tompits, Hans T1 - A compilation of Brewka and Eiter's approach to prioritizationtion Y1 - 2000 SN - 3-540-41131-3 ER - TY - JOUR A1 - Sarsakov, Vladimir A1 - Schaub, Torsten A1 - Tompits, Hans A1 - Woltran, Stefan T1 - A compiler for nested logic programming Y1 - 2004 SN - 3-540- 20721-x ER - TY - JOUR A1 - Delgrande, James Patrick A1 - Schaub, Torsten A1 - Tompits, Hans T1 - A compiler for ordered logic programs Y1 - 2000 UR - http://arxiv.org/abs/cs.AI/0003024 ER - TY - JOUR A1 - Delgrande, James Patrick A1 - Schaub, Torsten T1 - A concictency-based paradigm for belief change Y1 - 2003 SN - 0004-3702 ER - TY - JOUR A1 - Brüning, Stefan A1 - Schaub, Torsten T1 - A connection calculus for handling incomplete information Y1 - 2000 ER - TY - JOUR A1 - Delgrande, James Patrick A1 - Schaub, Torsten T1 - A consistency-based framework for merging knowledge bases Y1 - 2007 SN - 1570-8683 ER - TY - JOUR A1 - Delgrande, James Patrick A1 - Schaub, Torsten T1 - A consistency-based model for belief change: preliminary report Y1 - 2000 UR - http://xxx.lanl.gov/abs/cs.AI/0003052 ER - TY - JOUR A1 - Delgrande, James Patrick A1 - Schaub, Torsten T1 - A consistency-based model for belief change: preliminary report Y1 - 2000 SN - 0-262-51112-6 ER - TY - JOUR A1 - Besnard, Philippe A1 - Schaub, Torsten T1 - A context-based framework for default logics Y1 - 1993 SN - 0-262-51071-5 ER - TY - THES A1 - Luckow, André T1 - A dependable middleware for enhancing the fault tolerance of distributed computations in grid environments Y1 - 2009 CY - Potsdam ER - TY - JOUR A1 - Andjelkovic, Marko A1 - Simevski, Aleksandar A1 - Chen, Junchao A1 - Schrape, Oliver A1 - Stamenkovic, Zoran A1 - Krstić, Miloš A1 - Ilic, Stefan A1 - Ristic, Goran A1 - Jaksic, Aleksandar A1 - Vasovic, Nikola A1 - Duane, Russell A1 - Palma, Alberto J. A1 - Lallena, Antonio M. A1 - Carvajal, Miguel A. T1 - A design concept for radiation hardened RADFET readout system for space applications JF - Microprocessors and microsystems N2 - Instruments for measuring the absorbed dose and dose rate under radiation exposure, known as radiation dosimeters, are indispensable in space missions. They are composed of radiation sensors that generate current or voltage response when exposed to ionizing radiation, and processing electronics for computing the absorbed dose and dose rate. Among a wide range of existing radiation sensors, the Radiation Sensitive Field Effect Transistors (RADFETs) have unique advantages for absorbed dose measurement, and a proven record of successful exploitation in space missions. It has been shown that the RADFETs may be also used for the dose rate monitoring. In that regard, we propose a unique design concept that supports the simultaneous operation of a single RADFET as absorbed dose and dose rate monitor. This enables to reduce the cost of implementation, since the need for other types of radiation sensors can be minimized or eliminated. For processing the RADFET's response we propose a readout system composed of analog signal conditioner (ASC) and a self-adaptive multiprocessing system-on-chip (MPSoC). The soft error rate of MPSoC is monitored in real time with embedded sensors, allowing the autonomous switching between three operating modes (high-performance, de-stress and fault-tolerant), according to the application requirements and radiation conditions. KW - RADFET KW - Radiation hardness KW - Absorbed dose KW - Dose rate KW - Self-adaptive MPSoC Y1 - 2022 U6 - https://doi.org/10.1016/j.micpro.2022.104486 SN - 0141-9331 SN - 1872-9436 VL - 90 PB - Elsevier CY - Amsterdam ER - TY - JOUR A1 - Delgrande, James Patrick A1 - Schaub, Torsten A1 - Tompits, Hans T1 - A framework for compiling preferences in logic programs Y1 - 2003 ER - TY - JOUR A1 - Kreowsky, Philipp A1 - Stabernack, Christian Benno T1 - A full-featured FPGA-based pipelined architecture for SIFT extraction JF - IEEE access : practical research, open solutions / Institute of Electrical and Electronics Engineers N2 - 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. KW - Field programmable gate arrays KW - Convolution KW - Signal processing KW - algorithms KW - Kernel KW - Image resolution KW - Histograms KW - Feature extraction KW - Scale-invariant feature transform (SIFT) KW - field-programmable gate array KW - (FPGA) KW - image processing KW - computer vision KW - parallel processing KW - architecture KW - real-time KW - hardware architecture Y1 - 2021 U6 - https://doi.org/10.1109/ACCESS.2021.3104387 SN - 2169-3536 VL - 9 SP - 128564 EP - 128573 PB - Inst. of Electr. and Electronics Engineers CY - New York, NY ER - TY - JOUR A1 - Delgrande, James Patrick A1 - Schaub, Torsten A1 - Tompits, Hans T1 - A general framework for expressing preferences in causal reasoning and planning N2 - 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. Y1 - 2007 UR - http://logcom.oxfordjournals.org/ U6 - https://doi.org/10.1093/logcom/exm046 SN - 0955-792X ER - TY - JOUR A1 - Delgrande, James Patrick A1 - Schaub, Torsten A1 - Tompits, Hans T1 - A generic compiler for ordered logic programs Y1 - 2001 SN - 3-540-42593-4 ER - TY - JOUR A1 - Anger, Christian A1 - Konczak, Kathrin A1 - Linke, Thomas A1 - Schaub, Torsten T1 - A Glimpse of Answer Set Programming Y1 - 2005 UR - http://www.cs.uni-potsdam.de/~konczak/Papers/ankolisc05.pdf SN - 0170-4516 ER - TY - CHAP A1 - Kiy, Alexander A1 - Geßner, Hendrik A1 - Lucke, Ulrike A1 - Grünewald, Franka T1 - A Hybrid and Modular Framework for Mobile Campus Applications T2 - i-com N2 - Mobile devices and associated applications (apps) are an indispensable part of daily life and provide access to important information anytime and anywhere. However, the availability of university-wide services in the mobile sector is still poor. If they exist they usually result from individual activities of students and teachers. Mobile applications can have an essential impact on the improvement of students’ self-organization as well as on the design and enhancement of specific learning scenarios, though. This article introduces a mobile campus app framework, which integrates central campus services and decentralized learning applications. An analysis of strengths and weaknesses of different approaches is presented to summarize and evaluate them in terms of requirements, development, maintenance and operation. The article discusses the underlying service-oriented architecture that allows transferring the campus app to other universities or institutions at reasonable cost. It concludes with a presentation of the results as well as ongoing discussions and future work KW - Mobile Campus Application KW - Hybrid App KW - Framework KW - Service-oriented Architecture Y1 - 2015 UR - http://www.degruyter.com/view/j/icom.2015.14.issue-1/icom-2015-0016/icom-2015-0016.xml U6 - https://doi.org/10.1515/icom-2015-0016 SN - 2196-6826 VL - 2015 IS - 14 SP - 63 EP - 73 PB - de Gruyter CY - Berlin ER - TY - JOUR A1 - Tiwari, Abhishek A1 - Prakash, Jyoti A1 - Groß, Sascha A1 - Hammer, Christian T1 - A large scale analysis of Android BT - Web hybridization JF - The journal of systems and software N2 - 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. KW - Android hybrid apps KW - static analysis KW - information flow control Y1 - 2020 U6 - https://doi.org/10.1016/j.jss.2020.110775 SN - 0164-1212 SN - 1873-1228 VL - 170 PB - Elsevier CY - New York ER - TY - JOUR A1 - Hlawiczka, A. A1 - Gössel, Michael A1 - Sogomonyan, Egor S. T1 - A linear code-preserving signature analyzer COPMISR Y1 - 1997 SN - 0-8186-7810-0 ER - TY - THES A1 - Scherfenberg, Ivonne T1 - A logic-based Framwork to enable Attribute Assurance for Digital Identities in Service-oriented Architectures and the Web Y1 - 2012 CY - Potsdam ER - TY - JOUR A1 - Besnard, Philippe A1 - Hunter, Anthony T1 - A logic-based theory of deductive arguments Y1 - 2001 SN - 0004-3702 ER - TY - JOUR A1 - Saposhnikov, V. V. A1 - Saposhnikov, Vl. V. A1 - Gössel, Michael A1 - Morosov, Andrej T1 - A method of construction of combinational self-checking units with detection of all single faults Y1 - 1999 ER - TY - THES A1 - Wolter, Christian T1 - A methodology for model-driven process security Y1 - 2010 CY - Potsdam ER - TY - JOUR A1 - Brüning, Stefan A1 - Schaub, Torsten T1 - A model-based approach to consistency-checking Y1 - 1996 SN - 3-540-61286-6 ER - TY - JOUR A1 - Delgrande, James A1 - Schaub, Torsten A1 - Tompits, Hans A1 - Woltran, Stefan T1 - A model-theoretic approach to belief change in answer set programming JF - ACM transactions on computational logic N2 - 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. KW - Theory KW - Answer set programming KW - belief revision KW - belief merging KW - program encodings KW - strong equivalence Y1 - 2013 U6 - https://doi.org/10.1145/2480759.2480766 SN - 1529-3785 VL - 14 IS - 2 PB - Association for Computing Machinery CY - New York ER - TY - JOUR A1 - Sogomonyan, Egor S. A1 - Singh, Adit D. A1 - Gössel, Michael T1 - A multi-mode scannable memory element for high test application efficiency and delay testing Y1 - 1999 ER - TY - JOUR A1 - Sogomonyan, Egor S. A1 - Singh, Adit D. A1 - Gössel, Michael T1 - A multi-mode scannable memory element for high test application efficiency and delay testing Y1 - 1998 ER - TY - JOUR A1 - Gohlke, Mario T1 - A new approach for model-based recognition using colour regions Y1 - 1995 ER - TY - JOUR A1 - Saposhnikov, V. V. A1 - Morosov, Andrej A1 - Saposhnikov, Vl. V. A1 - Gössel, Michael T1 - A new design method for self-checking unidirectional combinational circuits Y1 - 1998 ER - TY - JOUR A1 - Richter, Peter T1 - A new deterministic approach for the optimization of cable layouts for power supply systems Y1 - 1995 ER - TY - JOUR A1 - Gössel, Michael T1 - A new method of redundancy addition for circuit optimization JF - Preprint / Universität Potsdam, Institut für Informatik Y1 - 1999 SN - 0946-7580 VL - 1999, 08 PB - Univ. CY - Potsdam ER - TY - JOUR A1 - Sogomonyan, Egor S. A1 - Gössel, Michael T1 - A new parity preserving multi-input signature analyser Y1 - 1995 ER - TY - BOOK A1 - Sogomonyan, Egor S. A1 - Marienfeld, Daniel A1 - Ocheretnij, V. A1 - Gössel, Michael T1 - A new self-checking sum-bit duplicated carry-select adder T3 - Preprint / Universität Potsdam, Institut für Informatik Y1 - 2003 SN - 0946-7580 VL - 2003, 5 PB - Univ. CY - Potsdam ER - TY - JOUR A1 - Gössel, Michael A1 - Sogomonyan, Egor S. T1 - A new self-testing parity checker for ultra-reliable applications Y1 - 1996 ER - TY - JOUR A1 - Gössel, Michael A1 - Sogomonyan, Egor S. A1 - Morosov, Andrej T1 - A new totally error propagating compactor for arbitrary cores with digital interfaces Y1 - 1999 ER - TY - JOUR A1 - Kawanabe, Motoaki A1 - Blanchard, Gilles A1 - Sugiyama, Masashi A1 - Spokoiny, Vladimir G. A1 - Müller, Klaus-Robert T1 - A novel dimension reduction procedure for searching non-Gaussian subspaces N2 - 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 Y1 - 2006 UR - http://www.springerlink.com/content/105633/ U6 - https://doi.org/10.1007/11679363_19 SN - 0302-9743 ER - TY - JOUR A1 - Liang, Feng A1 - Liu, Yunzhen A1 - Liu, Hai A1 - Ma, Shilong A1 - Schnor, Bettina T1 - A Parallel Job Execution Time Estimation Approach Based on User Submission Patterns within Computational Grids JF - International journal of parallel programming N2 - 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 %. KW - User submission pattern KW - Parallel job execution time estimation KW - Computational grid Y1 - 2015 U6 - https://doi.org/10.1007/s10766-013-0294-1 SN - 0885-7458 SN - 1573-7640 VL - 43 IS - 3 SP - 440 EP - 454 PB - Springer CY - New York ER - TY - JOUR A1 - Gössel, Michael A1 - Sogomonyan, Egor S. T1 - A parity-preserving multi-input signature analyzer and it application for concurrent checking and BIST Y1 - 1996 ER - TY - JOUR A1 - Pearce, David A1 - Sarsakov, Vladimir A1 - Schaub, Torsten A1 - Tompits, Hans A1 - Woltran, Stefan T1 - A polynomial translation of logic programs with nested expressions into disjunctive logic programs Y1 - 2002 SN - 3-540-43930-7 ER - TY - JOUR A1 - Pearce, David A1 - Sarsakov, Vladimir A1 - Schaub, Torsten A1 - Tompits, Hans A1 - Woltran, Stefan T1 - A polynomial translation of logic programs with nested expressions into disjunctive logic programs : preliminary report Y1 - 2002 ER - TY - JOUR A1 - Delgrande, James Patrick A1 - Schaub, Torsten A1 - Tompits, Hans T1 - A preference-based framework for updating logic programs Y1 - 2007 SN - 978-3-540- 72199-4 ER - TY - JOUR A1 - Delgrande, James Patrick A1 - Schaub, Torsten A1 - Tompits, Hans T1 - A Preference-Based Framework for Updating logic Programs : preliminary reports Y1 - 2006 UR - http://www.easychair.org/FLoC-06/PREFS-preproceedings.pdf ER - TY - BOOK A1 - Polyvyanyy, Artem A1 - Kuropka, Dominik T1 - A Quantitative Evalution of the Enhanced Topic-based Vector Space Model T3 - Technische Berichte des Hasso-Plattner-Instituts für Softwaresystemtechnik an der Universität Potsda Y1 - 2007 SN - 978-3-939469-95-7 SN - 1613-5652 VL - 19 PB - Universitätsverlag Potsdam CY - Potsdam ER - TY - THES A1 - Müller, Jürgen J. T1 - A real-time in-memory discovery service Y1 - 2012 CY - Potsdam ER - TY - JOUR A1 - Börner, Ferdinand T1 - A remark on the finite lattice representation problem Y1 - 1998 ER - TY - JOUR A1 - Schöbel, Michael T1 - A runtime environment for online processing of operating system kernel events Y1 - 2010 SN - 978-3-86956-036-6 ER - TY - JOUR A1 - Sogomonyan, Egor S. A1 - Singh, Adit D. A1 - Gössel, Michael T1 - A scan based concrrent BIST approach for low cost on-line testing Y1 - 1998 ER - TY - JOUR A1 - Schaub, Torsten A1 - Wang, Kewen T1 - A semantic framework for prefernce handling in answer set programming Y1 - 2003 ER - TY - JOUR A1 - Goessel, Michael A1 - Chakrabarty, Krishnendu A1 - Ocheretnij, V. A1 - Leininger, Andreas T1 - A signature analysis technique for the identification of failing vectors with application to Scan-BIST N2 - 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 Y1 - 2004 SN - 0923-8174 ER - TY - JOUR A1 - Besnard, Philippe A1 - Schaub, Torsten T1 - A simple signed system for paraconsistent reasoning Y1 - 1996 SN - 3-540-61630-6 ER -