TY  - JOUR
A1  - Konczak, Kathrin
A1  - Vogel, Ralf
T1  - Abduction and preferences in linguistics : Extended abstract
Y1  - 2005
UR  - http://www.cs.uni-potsdam.de/~konczak/Papers/konvog05b.pdf
SN  - 0302-9743
ER  - 
TY  - JOUR
A1  - Kose, F.
A1  - Weckwerth, Wolfram
A1  - Linke, Thomas
A1  - Fiehn, Oliver
T1  - Visualizing plant metabolomic correlation networks using clique-metabolite matrices
Y1  - 2001
ER  - 
TY  - JOUR
A1  - Kowark, Thomas
A1  - Uflacker, Matthias
A1  - Zeier, Alexander
T1  - Towards a shared platform for virtual collaboration monotoring in design research
Y1  - 2012
ER  - 
TY  - JOUR
A1  - Krasnova, Hanna
A1  - Veltri, Natasha F.
A1  - Spengler, Klaus
A1  - Günther, Oliver
T1  - "Deal of the Day" Platforms what drives Consumer loyalty?
JF  - Business & information systems engineering : the international journal of Wirtschaftsinformatik
N2  - "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.
KW  - Deal of the Day
KW  - Loyalty
KW  - Grounded theory
KW  - Structural equation modeling
Y1  - 2013
U6  - https://doi.org/10.1007/s12599-013-0268-2
SN  - 1867-0202
VL  - 5
IS  - 3
SP  - 165
EP  - 177
PB  - Springer
CY  - Heidelberg
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  - Krstić, Miloš
A1  - Weidling, Stefan
A1  - Petrovic, Vladimir
A1  - Sogomonyan, Egor S.
T1  - Enhanced architectures for soft error detection and correction in combinational and sequential circuits
JF  - Microelectronics Reliability
N2  - In this paper two new methods for the design of fault-tolerant pipelined sequential and combinational circuits, called Error Detection and Partial Error Correction (EDPEC) and Full Error Detection and Correction (FEDC), are described. The proposed methods are based on an Error Detection Logic (EDC) in the combinational circuit part combined with fault tolerant memory elements implemented using fault tolerant master–slave flip-flops. If a transient error, due to a transient fault in the combinational circuit part is detected by the EDC, the error signal controls the latching stage of the flip-flops such that the previous correct state of the register stage is retained until the transient error disappears. The system can continue to work in its previous correct state and no additional recovery procedure (with typically reduced clock frequency) is necessary. The target applications are dataflow processing blocks, for which software-based recovery methods cannot be easily applied. The presented architectures address both single events as well as timing faults of arbitrarily long duration. An example of this architecture is developed and described, based on the carry look-ahead adder. The timing conditions are carefully investigated and simulated up to the layout level. The enhancement of the baseline architecture is demonstrated with respect to the achieved fault tolerance for the single event and timing faults. It is observed that the number of uncorrected single events is reduced by the EDPEC architecture by 2.36 times compared with previous solution. The FEDC architecture further reduces the number of uncorrected events to zero and outperforms the Triple Modular Redundancy (TMR) with respect to correction of timing faults. The power overhead of both new architectures is about 26–28% lower than the TMR.
Y1  - 2016
SN  - 0026-2714
VL  - 56
SP  - 212
EP  - 220
ER  - 
TY  - JOUR
A1  - Kuentzer, Felipe A.
A1  - Krstić, Miloš
T1  - Soft error detection and correction architecture for asynchronous bundled data designs
JF  - IEEE transactions on circuits and systems
N2  - In this paper, an asynchronous design for soft error detection and correction in combinational and sequential circuits is presented. The proposed architecture is called Asynchronous Full Error Detection and Correction (AFEDC). A custom design flow with integrated commercial EDA tools generates the AFEDC using the asynchronous bundled-data design style. The AFEDC relies on an Error Detection Circuit (EDC) for protecting the combinational logic and fault-tolerant latches for protecting the sequential logic. The EDC can be implemented using different detection methods. For this work, two boundary variants are considered, the Full Duplication with Comparison (FDC) and the Partial Duplication with Parity Prediction (PDPP). The AFEDC architecture can handle single events and timing faults of arbitrarily long duration as well as the synchronous FEDC, but additionally can address known metastability issues of the FEDC and other similar synchronous architectures and provide a more practical solution for handling the error recovery process. Two case studies are developed, a carry look-ahead adder and a pipelined non-restoring array divider. Results show that the AFEDC provides equivalent fault coverage when compared to the FEDC while reducing area, ranging from 9.6% to 17.6%, and increasing energy efficiency, which can be up to 6.5%.
KW  - circuit Faults
KW  - latches
KW  - Fault tolerance
KW  - Fault tolerant systems
KW  - timing
KW  - clocks
KW  - transient analysis
KW  - asynchrounous design
KW  - soft errors
KW  - transient Faults
KW  - bundled data
KW  - click controller
KW  - self-checking
KW  - concurrent checking
KW  - DMR
KW  - TMR
Y1  - 2020
U6  - https://doi.org/10.1109/TCSI.2020.2998911
SN  - 1549-8328
SN  - 1558-0806
VL  - 67
IS  - 12
SP  - 4883
EP  - 4894
PB  - Institute of Electrical and Electronics Engineers
CY  - New York
ER  - 
TY  - JOUR
A1  - Kundu, S.
A1  - Sogomonyan, Egor S.
A1  - Gössel, Michael
A1  - Tarnick, Steffen
T1  - Self-checking comparator with one periodiv output
Y1  - 1996
ER  - 
TY  - JOUR
A1  - Kuntzsch, Christian
T1  - Visualization of data transfer paths
JF  - Process design for natural scientists: an agile model-driven approach
N2  - A workflow for visualizing server connections using the Google Maps API was built in the jABC. It makes use of three basic services: An XML-based IP address geolocation web service, a command line tool and the Static Maps API. The result of the workflow is an URL leading to an image file of a map, showing server connections between a client and a target host.
Y1  - 2014
SN  - 978-3-662-45005-5
SN  - 1865-0929
IS  - 500
SP  - 140
EP  - 148
PB  - Springer
CY  - Berlin
ER  - 
TY  - JOUR
A1  - Kunz, Wolfgang
A1  - Menon, P.
T1  - Multi-level logic optimization by implication analysis
Y1  - 1994
SN  - 0-89791-690-5
SN  - 0-8186-6416-9
SN  - 0-8186-6417-7
ER  - 
TY  - JOUR
A1  - Kunz, Wolfgang
A1  - Pradhan, D. K.
T1  - Recursive learning : a new implication technique for efficient solutions to CAD problems : test, verification and optimization
Y1  - 1994
ER  - 
TY  - JOUR
A1  - Kunz, Wolfgang
A1  - Reddy, S. M.
A1  - Subodh, M.
A1  - Pradhan, D. K.
T1  - Efficient logic verification in a synthesis environment
Y1  - 1996
ER  - 
TY  - JOUR
A1  - Kunz, Wolfgang
A1  - Stoffel, Dominik
A1  - Menon, P.
T1  - Logic optimization and equivalence checking by implication analysis
Y1  - 1997
ER  - 
TY  - JOUR
A1  - Kupries, Mario
T1  - ADE : An architecture type-based development environment for agent application systems
Y1  - 1999
UR  - http://www.agentlink.org/newsletter/
ER  - 
TY  - JOUR
A1  - Kupries, Mario
T1  - Connector-aided coordination in agent systems
Y1  - 1999
ER  - 
TY  - JOUR
A1  - Kupries, Mario
A1  - Noseleit, Christof
T1  - Software architecture type-based interagent connections
Y1  - 1999
SN  - 158113066X
ER  - 
TY  - JOUR
A1  - Kyprianidis, Jan Eric
A1  - Collomosse, John
A1  - Wang, Tinghuai
A1  - Isenberg, Tobias
T1  - State of the "Art" a taxonomy of artistic stylization techniques for images and video
JF  - IEEE transactions on visualization and computer graphics
N2  - This paper surveys the field of nonphotorealistic rendering (NPR), focusing on techniques for transforming 2D input (images and video) into artistically stylized renderings. We first present a taxonomy of the 2D NPR algorithms developed over the past two decades, structured according to the design characteristics and behavior of each technique. We then describe a chronology of development from the semiautomatic paint systems of the early nineties, through to the automated painterly rendering systems of the late nineties driven by image gradient analysis. Two complementary trends in the NPR literature are then addressed, with reference to our taxonomy. First, the fusion of higher level computer vision and NPR, illustrating the trends toward scene analysis to drive artistic abstraction and diversity of style. Second, the evolution of local processing approaches toward edge-aware filtering for real-time stylization of images and video. The survey then concludes with a discussion of open challenges for 2D NPR identified in recent NPR symposia, including topics such as user and aesthetic evaluation.
KW  - Image and video stylization
KW  - nonphotorealistic rendering (NPR)
KW  - artistic rendering
Y1  - 2013
U6  - https://doi.org/10.1109/TVCG.2012.160
SN  - 1077-2626
VL  - 19
IS  - 5
SP  - 866
EP  - 885
PB  - Inst. of Electr. and Electronics Engineers
CY  - Los Alamitos
ER  - 
TY  - JOUR
A1  - Lagriffoul, Fabien
A1  - Andres, Benjamin
T1  - Combining task and motion planning
BT  - A culprit detection problem
JF  - The international journal of robotics research
N2  - Solving problems combining task and motion planning requires searching across a symbolic search space and a geometric search space. Because of the semantic gap between symbolic and geometric representations, symbolic sequences of actions are not guaranteed to be geometrically feasible. This compels us to search in the combined search space, in which frequent backtracks between symbolic and geometric levels make the search inefficient.We address this problem by guiding symbolic search with rich information extracted from the geometric level through culprit detection mechanisms.
KW  - combined task and motion planning
KW  - manipulation planning
Y1  - 2016
U6  - https://doi.org/10.1177/0278364915619022
SN  - 1741-3176
SN  - 0278-3649
VL  - 35
IS  - 8
SP  - 890
EP  - 927
PB  - Sage Science Press
CY  - Thousand Oaks
ER  - 
TY  - JOUR
A1  - Lai, Kwok-Wing
A1  - Davis, Niki
A1  - Eickelmann, Birgit
A1  - Erstad, Ola
A1  - Fisser, Petra
A1  - Gibson, David
A1  - Khaddage, Ferial
A1  - Knezek, Gerald
A1  - Webb, Mary
T1  - Tackling Educational Challenges in a Digitally Networked World
BT  - Strategies developed from the EDUSummIT 2013
JF  - KEYCIT 2014 - Key Competencies in Informatics and ICT
KW  - Assessment
KW  - computational thinking
KW  - digitally-enabled pedagogies
KW  - educational systems
KW  - informal and formal learning
KW  - mobile learning
KW  - mobile technologies and apps
KW  - organisational evolution
Y1  - 2015
U6  - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:517-opus4-82997
SN  - 1868-0844
IS  - 7
SP  - 415
EP  - 423
PB  - Universitätsverlag Potsdam
CY  - Potsdam
ER  - 
TY  - JOUR
A1  - Lamprecht, Anna-Lena
A1  - Margaria, Tiziana
ED  - Lambrecht, Anna-Lena
ED  - Margaria, Tiziana
T1  - Scientific Workflows and XMDD
JF  - Process Design for Natural Scientists: an agile model-driven approach
N2  - A major part of the scientific experiments that are carried out today requires thorough computational support. While database and algorithm providers face the problem of bundling resources to create and sustain powerful computation nodes, the users have to deal with combining sets of (remote) services into specific data analysis and transformation processes. Today’s attention to “big data” amplifies the issues of size, heterogeneity, and process-level diversity/integration. In the last decade, especially workflow-based approaches to deal with these processes have enjoyed great popularity. This book concerns a particularly agile and model-driven approach to manage scientific workflows that is based on the XMDD paradigm. In this chapter we explain the scope and purpose of the book, briefly describe the concepts and technologies of the XMDD paradigm, explain the principal differences to related approaches, and outline the structure of the book.
Y1  - 2014
SN  - 978-3-662-45005-5
SN  - 1865-0929
IS  - 500
SP  - 1
EP  - 13
PB  - Springer Verlag
CY  - Berlin
ER  - 
TY  - JOUR
A1  - Lamprecht, Anna-Lena
A1  - Margaria, Tiziana
ED  - Lamprecht, Anna-Lena
ED  - Margaria, Tiziana
T1  - Scientific workflows and XMDD
JF  - Process design for natural scientists
Y1  - 2015
SN  - 978-3-662-45006-2
SP  - 1
EP  - 13
PB  - Springer
CY  - Berlin
ER  - 
TY  - JOUR
A1  - Lamprecht, Anna-Lena
A1  - Margaria, Tiziana
A1  - Steffen, Bernhard
ED  - Lambrecht, Anna-Lena
ED  - Margaria, Tiziana
T1  - Modeling and Execution of Scientific Workflows with the jABC Framework
JF  - Process Design for Natural Scientists: an agile model-driven approach
N2  - We summarize here the main characteristics and features of the jABC framework, used in the case studies as a graphical tool for modeling scientific processes and workflows. As a comprehensive environment for service-oriented modeling and design according to the XMDD (eXtreme Model-Driven Design) paradigm, the jABC offers much more than the pure modeling capability. Associated technologies and plugins provide in fact means for a rich variety of supporting functionality, such as remote service integration, taxonomical service classification, model execution, model verification, model synthesis, and model compilation. We describe here in short both the essential jABC features and the service integration philosophy followed in the environment. In our work over the last years we have seen that this kind of service definition and provisioning platform has the potential to become a core technology in interdisciplinary service orchestration and technology transfer: Domain experts, like scientists not specially trained in computer science, directly define complex service orchestrations as process models and use efficient and complex domain-specific tools in a simple and intuitive way.
Y1  - 2014
SN  - 978-3-662-45005-5
SN  - 1865-0929
IS  - 500
SP  - 14
EP  - 29
PB  - Springer Verlag
CY  - Berlin
ER  - 
TY  - JOUR
A1  - Lamprecht, Anna-Lena
A1  - Wickert, Alexander
ED  - Lambrecht, Anna-Lena
ED  - Margaria, Tiziana
T1  - The Course's SIB Libraries
JF  - Process Design for Natural Scientists: an agile model-driven approach
N2  - This chapter gives a detailed description of the service framework underlying all the example projects that form the foundation of this book. It describes the different SIB libraries that we made available for the course “Process modeling in the natural sciences” to provide the functionality that was required for the envisaged applications. The students used these SIB libraries to realize their projects.
Y1  - 2014
SN  - 978-3-662-45005-5
SN  - 1865-0929
IS  - 500
SP  - 30
EP  - 44
PB  - Springer Verlag
CY  - Berlin
ER  - 
TY  - JOUR
A1  - Lamprecht, Anna-Lena
A1  - Wickert, Alexander
A1  - Margaria, Tiziana
ED  - Lambrecht, Anna-Lena
ED  - Margaria, Tiziana
T1  - Lessons Learned
JF  - Process Design for Natural Scientists: an agile model-driven approach
N2  - This chapter summarizes the experience and the lessons we learned concerning the application of the jABC as a framework for design and execution of scientific workflows. It reports experiences from the domain modeling (especially service integration) and workflow design phases and evaluates the resulting models statistically with respect to the SIB library and hierarchy levels.
Y1  - 2014
SN  - 978-3-662-45005-5
SN  - 1865-0929
IS  - 500
SP  - 45
EP  - 64
PB  - Springer Verlag
CY  - Berlin
ER  - 
TY  - JOUR
A1  - Lanfermann, Gerd
A1  - Schnor, Bettina
A1  - Seidel, Edward
T1  - Characterizing Grids
N2  - We present a new data model approach to describe the various objects that either represent the Grid infrastructure or make use of it. The data model is based on the experiences and experiments conducted in heterogeneous Grid environments. While very sophisticated data models exist to describe and characterize e.g. compute capacities or web services, we will show that a general description, which combines {em all} of these aspects, is needed to give an adequate representation of objects on a Grid. The Grid Object Description Language (GODsL)} is a generic and extensible approach to unify the various aspects that an object on a Grid can have. GODsL provides the content for the XML based communication in Grid migration scenarios, carried out in the GridLab project. We describe the data model architecture on a general level and focus on the Grid application scenarios.
Y1  - 2003
SN  - 1-4020-7418-2
ER  - 
TY  - JOUR
A1  - Laskov, Pavel
A1  - Gehl, Christian
A1  - Krüger, Stefan
A1  - Müller, Klaus-Robert
T1  - Incremental support vector learning: analysis, implementation and applications
JF  - Journal of machine learning research
N2  - Incremental Support Vector Machines (SVM) are instrumental in practical applications of online learning. This work focuses on the design and analysis of efficient incremental SVM learning, with the aim of providing a fast, numerically stable and robust implementation. A detailed analysis of convergence and of algorithmic complexity of incremental SVM learning is carried out. Based on this analysis, a new design of storage and numerical operations is proposed, which speeds up the training of an incremental SVM by a factor of 5 to 20. The performance of the new algorithm is demonstrated in two scenarios: learning with limited resources and active learning. Various applications of the algorithm, such as in drug discovery, online monitoring of industrial devices and and surveillance of network traffic, can be foreseen.
KW  - incremental SVM
KW  - online learning
KW  - drug discovery
KW  - intrusion detection
Y1  - 2006
SN  - 1532-4435
VL  - 7
SP  - 1909
EP  - 1936
PB  - MIT Press
CY  - Cambridge, Mass.
ER  - 
TY  - JOUR
A1  - Laub, Julian
A1  - Roth, Volker
A1  - Buhmann, Joachim
A1  - Müller, Klaus-Robert
T1  - On the information and representation of non-Euclidean pairwise data
N2  - Two common data representations are mostly used in intelligent data analysis, namely the vectorial and the pairwise representation. Pairwise data which satisfy the restrictive conditions of Euclidean spaces can be faithfully translated into a Euclidean vectorial representation by embedding. Non-metric pairwise data with violations of symmetry, reflexivity or triangle inequality pose a substantial conceptual problem for pattern recognition since the amount of predictive structural information beyond what can be measured by embeddings is unclear. We show by systematic modeling of non-Euclidean pairwise data that there exists metric violations which can carry valuable problem specific information. Furthermore, Euclidean and non-metric data can be unified on the level of structural information contained in the data. Stable component analysis selects linear subspaces which are particularly insensitive to data fluctuations. Experimental results from different domains support our pattern recognition strategy.
Y1  - 2006
UR  - http://www.sciencedirect.com/science/journal/00313203
U6  - https://doi.org/10.1016/j.patcog.2006.04.016
SN  - 0031-3203
ER  - 
TY  - JOUR
A1  - Lemcke, Stefanie
A1  - Haedge, Kora
A1  - Zender, Raphael
A1  - Lucke, Ulrike
T1  - RouteMe: a multilevel pervasive game on mobile ad hoc routing
JF  - Personal and ubiquitous computing
N2  - Pervasive educational games have the potential to transfer learning content to real-life experiences beyond lecture rooms, through realizing field trips in an augmented or virtual manner. This article introduces the pervasive educational game "RouteMe" that brings the rather abstract topic of routing in ad hoc networks to real-world environments. The game is designed for university-level courses and supports these courses in a motivating manner to deepen the learning experience. Students slip into the role of either routing nodes or applications with routing demands. On three consecutive levels of difficulty, they get introduced with the game concept, learn the basic routing mechanisms and become aware of the general limitations and functionality of routing nodes. This paper presents the pedagogical and technical game concept as well as findings from an evaluation in a university setting.
KW  - E-learning
KW  - Educational game
KW  - Mobile application
KW  - Pervasive computing
KW  - Location awareness
KW  - Ad hoc routing
KW  - AODV
Y1  - 2015
U6  - https://doi.org/10.1007/s00779-015-0843-2
SN  - 1617-4909
SN  - 1617-4917
VL  - 19
IS  - 3-4
SP  - 537
EP  - 549
PB  - Springer
CY  - London
ER  - 
TY  - JOUR
A1  - Lemm, Steven
A1  - Blankertz, Benjamin
A1  - Curio, Gabriel
A1  - Müller, Klaus-Robert
T1  - Spatio-spectral filters for improving the classification of single trial EEG
N2  - Data recorded in electroencephalogram (EEG)-based brain-computer interface experiments is generally very noisy, non-stationary, and contaminated with artifacts that can deteriorate discrimination/classification methods. In this paper, we extend the common spatial pattern (CSP) algorithm with the aim to alleviate these adverse effects. In particular, we suggest an extension of CSP to the state space, which utilizes the method of time delay embedding. As we will show, this allows for individually tuned frequency filters at each electrode position and, thus, yields an improved and more robust machine learning procedure. The advantages of the proposed method over the original CSP method are verified in terms of an improved information transfer rate (bits per trial) on a set of EEG-recordings from experiments of imagined limb movements
Y1  - 2005
SN  - 0018-9294
ER  - 
TY  - JOUR
A1  - Lemm, Steven
A1  - Curio, Gabriel
A1  - Hlushchuk, Yevhen
A1  - Müller, Klaus-Robert
T1  - Enhancing the signal-to-noise ratio of ICA-based extracted ERPs
N2  - When decomposing single trial electroencephalography it is a challenge to incorporate prior physiological knowledge. Here, we develop a method that uses prior information about the phase-locking property of event-related potentials in a regularization framework to bias a blind source separation algorithm toward an improved separation of single-trial phase-locked responses in terms of an increased signal-to-noise ratio. In particular, we suggest a transformation of the data, using weighted average of the single trial and trial-averaged response, that redirects the focus of source separation methods onto the subspace of event-related potentials. The practical benefit with respect to an improved separation of such components from ongoing background activity and extraneous noise is first illustrated on artificial data and finally verified in a real-world application of extracting single-trial somatosensory evoked potentials from multichannel EEG-recordings
Y1  - 2006
UR  - http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=10
U6  - https://doi.org/10.1109/Tbme.2006.870258
SN  - 0018-9294
ER  - 
TY  - JOUR
A1  - Li, Yuanqing
A1  - Breitenreiter, Anselm
A1  - Andjelkovic, Marko
A1  - Chen, Junchao
A1  - Babic, Milan
A1  - Krstić, Miloš
T1  - Double cell upsets mitigation through triple modular redundancy
JF  - Microelectronics Journal
N2  - A triple modular redundancy (TMR) based design technique for double cell upsets (DCUs) mitigation is investigated in this paper. This technique adds three extra self-voter circuits into a traditional TMR structure to enable the enhanced error correction capability. Fault-injection simulations show that the soft error rate (SER) of the proposed technique is lower than 3% of that of TMR. The implementation of this proposed technique is compatible with the automatic digital design flow, and its applicability and performance are evaluated on an FIFO circuit.
KW  - Triple modular redundancy (TMR)
KW  - Double cell upsets (DCUs)
Y1  - 2019
U6  - https://doi.org/10.1016/j.mejo.2019.104683
SN  - 0026-2692
SN  - 1879-2391
VL  - 96
PB  - Elsevier
CY  - Oxford
ER  - 
TY  - JOUR
A1  - Li, Yuanqing
A1  - Chen, Li
A1  - Nofal, Issam
A1  - Chen, Mo
A1  - Wang, Haibin
A1  - Liu, Rui
A1  - Chen, Qingyu
A1  - Krstić, Miloš
A1  - Shi, Shuting
A1  - Guo, Gang
A1  - Baeg, Sang H.
A1  - Wen, Shi-Jie
A1  - Wong, Richard
T1  - Modeling and analysis of single-event transient sensitivity of a 65 nm clock tree
JF  - Microelectronics reliability
N2  - The soft error rate (SER) due to heavy-ion irradiation of a clock tree is investigated in this paper. A method for clock tree SER prediction is developed, which employs a dedicated soft error analysis tool to characterize the single-event transient (SET) sensitivities of clock inverters and other commercial tools to calculate the SER through fault-injection simulations. A test circuit including a flip-flop chain and clock tree in a 65 nm CMOS technology is developed through the automatic ASIC design flow. This circuit is analyzed with the developed method to calculate its clock tree SER. In addition, this circuit is implemented in a 65 nm test chip and irradiated by heavy ions to measure its SER resulting from the SETs in the clock tree. The experimental and calculation results of this case study present good correlation, which verifies the effectiveness of the developed method.
KW  - Clock tree
KW  - Modeling
KW  - Single-event transient (SET)
Y1  - 2018
U6  - https://doi.org/10.1016/j.microrel.2018.05.016
SN  - 0026-2714
VL  - 87
SP  - 24
EP  - 32
PB  - Elsevier
CY  - Oxford
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  - Lindauer, Marius
A1  - Hoos, Holger H.
A1  - Hutter, Frank
A1  - Schaub, Torsten
T1  - An automatically configured algorithm selector
JF  - The journal of artificial intelligence research
N2  - 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.
Y1  - 2015
SN  - 1076-9757
SN  - 1943-5037
VL  - 53
SP  - 745
EP  - 778
PB  - AI Access Foundation
CY  - Marina del Rey
ER  - 
TY  - JOUR
A1  - Lindauer, Marius
A1  - Hoos, Holger
A1  - Leyton-Brown, Kevin
A1  - Schaub, Torsten
T1  - Automatic construction of parallel portfolios via algorithm configuration
JF  - Artificial intelligence
N2  - Since 2004, increases in computational power described by Moore's law have substantially been realized in the form of additional cores rather than through faster clock speeds. To make effective use of modern hardware when solving hard computational problems, it is therefore necessary to employ parallel solution strategies. In this work, we demonstrate how effective parallel solvers for propositional satisfiability (SAT), one of the most widely studied NP-complete problems, can be produced automatically from any existing sequential, highly parametric SAT solver. Our Automatic Construction of Parallel Portfolios (ACPP) approach uses an automatic algorithm configuration procedure to identify a set of configurations that perform well when executed in parallel. Applied to two prominent SAT solvers, Lingeling and clasp, our ACPP procedure identified 8-core solvers that significantly outperformed their sequential counterparts on a diverse set of instances from the application and hard combinatorial category of the 2012 SAT Challenge. We further extended our ACPP approach to produce parallel portfolio solvers consisting of several different solvers by combining their configuration spaces. Applied to the component solvers of the 2012 SAT Challenge gold medal winning SAT Solver pfolioUZK, our ACPP procedures produced a significantly better-performing parallel SAT solver.
KW  - Algorithm configuration
KW  - Parallel SAT solving
KW  - Algorithm portfolios
KW  - Programming by optimization
KW  - Automated parallelization
Y1  - 2016
U6  - https://doi.org/10.1016/j.artint.2016.05.004
SN  - 0004-3702
SN  - 1872-7921
VL  - 244
SP  - 272
EP  - 290
PB  - Elsevier
CY  - Amsterdam
ER  - 
TY  - JOUR
A1  - Lindberg, Tilmann
A1  - Köppen, Eva
A1  - Rauth, Ingo
A1  - Meinel, Christoph
T1  - On the perection, adoption and Implementation of design thinking in the IT industry
Y1  - 2012
ER  - 
TY  - JOUR
A1  - Lindberg, Tilmann
A1  - Meinel, Christoph
A1  - Wagner, Ralf
T1  - Design thinking : a fruitful concept for IT development?
Y1  - 2011
SN  - 978-3-642-13756-3
ER  - 
TY  - JOUR
A1  - Linke, Thomas
T1  - Suitable graphs for answer set programming
Y1  - 2003
UR  - http://sunsite.informatik.rwth-aachen.de/Publications/CEUR-WS/Vol-78/
SN  - 1613-0073
ER  - 
TY  - JOUR
A1  - Linke, Thomas
T1  - Using nested logic programs for answer set programming
Y1  - 2003
UR  - http://sunsite.informatik.rwth-aachen.de/Publications/CEUR-WS/Vol-78/
SN  - 1613-0073
ER  - 
TY  - JOUR
A1  - Linke, Thomas
T1  - Graph theoretical characterization and computation of answer sets
Y1  - 2001
SN  - 1-558-60777-3
SN  - 1045-0823
ER  - 
TY  - JOUR
A1  - Linke, Thomas
T1  - Graph theoretical characterization and computation of answer sets
Y1  - 2001
ER  - 
TY  - JOUR
A1  - Linke, Thomas
A1  - Anger, Christian
A1  - Konczak, Kathrin
T1  - More on nomore
Y1  - 2002
SN  - 3-540-44190-5
ER  - 
TY  - JOUR
A1  - Linke, Thomas
A1  - Anger, Christian
A1  - Konczak, Kathrin
T1  - More on nomore
Y1  - 2002
ER  - 
TY  - JOUR
A1  - Linke, Thomas
A1  - Schaub, Torsten
T1  - Alternative foundations for Reiter's default logic.
Y1  - 2000
SN  - 0004-3702
ER  - 
TY  - JOUR
A1  - Linke, Thomas
A1  - Schaub, Torsten
T1  - On bottom-up pre-processing techniques for automated default reasoning
Y1  - 1999
SN  - 3-540-66131-x
ER  - 
TY  - JOUR
A1  - Linke, Thomas
A1  - Schaub, Torsten
T1  - Putting default logics in perspective
Y1  - 1996
SN  - 3-540-61708-6
ER  - 
TY  - JOUR
A1  - Linke, Thomas
A1  - Schaub, Torsten
T1  - Lemma handling in default logic theorem provers
Y1  - 1995
SN  - 3540601120
ER  - 
TY  - JOUR
A1  - Linke, Thomas
A1  - Schaub, Torsten
T1  - Towards a classification of default logic
Y1  - 1997
ER  - 
TY  - JOUR
A1  - Linke, Thomas
A1  - Schaub, Torsten
T1  - An approach to query-answering in Reiter's default logic and the underlying existence of extensions problem.
Y1  - 1998
SN  - 3-540-65141-1
ER  - 
TY  - JOUR
A1  - Linke, Thomas
A1  - Tompits, Hans
A1  - Woltran, Stefan
T1  - On Acyclic and head-cycle free nested logic programs
Y1  - 2004
SN  - 3-540-22671-01
ER  - 
TY  - JOUR
A1  - Linke, Thomas
A1  - Tompits, Hans
A1  - Woltran, Stefan
T1  - On acyclic and head-cycle free nested logic programs
Y1  - 2004
ER  - 
TY  - JOUR
A1  - Lis, Monika
ED  - Lambrecht, Anna-Lena
ED  - Margaria, Tiziana
T1  - Constructing a Phylogenetic Tree
JF  - Process Design for Natural Scientists: an agile model-driven approach
N2  - In this project I constructed a workflow that takes a DNA sequence as input and provides a phylogenetic tree, consisting of the input sequence and other sequences which were found during a database search. In this phylogenetic tree the sequences are arranged depending on similarities. In bioinformatics, constructing phylogenetic trees is often used to explore the evolutionary relationships of genes or organisms and to understand the mechanisms of evolution itself.
Y1  - 2014
SN  - 978-3-662-45005-5
SN  - 1865-0929
IS  - 500
SP  - 101
EP  - 109
PB  - Springer Verlag
CY  - Berlin
ER  - 
TY  - JOUR
A1  - Lisec, Jan
A1  - Steinfath, Matthias
A1  - Meyer, Rhonda C.
A1  - Selbig, Joachim
A1  - Melchinger, Albrecht E.
A1  - Willmitzer, Lothar
A1  - Altmann, Thomas
T1  - Identification of heterotic metabolite QTL in Arabidopsis thaliana RIL and IL populations
N2  - Two mapping populations of a cross between the Arabidopsis thaliana accessions Col-0 and C24 were cultivated and analyzed with respect to the levels of 181 metabolites to elucidate the biological phenomenon of heterosis at the metabolic level. The relative mid-parent heterosis in the F-1 hybrids was <20% for most metabolic traits. The first mapping population consisting of 369 recombinant inbred lines (RILs) and their test cross progeny with both parents allowed us to determine the position and effect of 147 quantitative trait loci (QTL) for metabolite absolute mid-parent heterosis (aMPH). Furthermore, we identified 153 and 83 QTL for augmented additive (Z(1)) and dominance effects (Z(2)), respectively. We identified putative candidate genes for these QTL using the ARACYC database (http://www.arabidopsis.org/ biocyc), and calculated the average degree of dominance, which was within the dominance and over-dominance range for most metabolites. Analyzing a second population of 41 introgression lines (ILs) and their test crosses with the recurrent parent, we identified 634 significant differences in metabolite levels. Nine per cent of these effects were classified as over-dominant, according to the mode of inheritance. A comparison of both approaches suggested epistasis as a major contributor to metabolite heterosis in Arabidopsis. A linear combination of metabolite levels was shown to significantly correlate with biomass heterosis (r = 0.62).
Y1  - 2009
UR  - http://www3.interscience.wiley.com/cgi-bin/issn?DESCRIPTOR=PRINTISSN&VALUE=0960-7412
U6  - https://doi.org/10.1111/j.1365-313X.2009.03910.x
SN  - 0960-7412
ER  - 
TY  - JOUR
A1  - Lorenz, Claas
A1  - Clemens, Vera Elisabeth
A1  - Schrötter, Max
A1  - Schnor, Bettina
T1  - Continuous verification of network security compliance
JF  - IEEE transactions on network and service management
N2  - Continuous verification of network security compliance is an accepted need. Especially, the analysis of stateful packet filters plays a central role for network security in practice. But the few existing tools which support the analysis of stateful packet filters are based on general applicable formal methods like Satifiability Modulo Theories (SMT) or theorem prover and show runtimes in the order of minutes to hours making them unsuitable for continuous compliance verification. In this work, we address these challenges and present the concept of state shell interweaving to transform a stateful firewall rule set into a stateless rule set. This allows us to reuse any fast domain specific engine from the field of data plane verification tools leveraging smart, very fast, and domain specialized data structures and algorithms including Header Space Analysis (HSA). First, we introduce the formal language FPL that enables a high-level human-understandable specification of the desired state of network security. Second, we demonstrate the instantiation of a compliance process using a verification framework that analyzes the configuration of complex networks and devices - including stateful firewalls - for compliance with FPL policies. Our evaluation results show the scalability of the presented approach for the well known Internet2 and Stanford benchmarks as well as for large firewall rule sets where it outscales state-of-the-art tools by a factor of over 41.
KW  - Security
KW  - Tools
KW  - Network security
KW  - Engines
KW  - Benchmark testing;
KW  - Analytical models
KW  - Scalability
KW  - Network
KW  - security
KW  - compliance
KW  - formal
KW  - verification
Y1  - 2021
U6  - https://doi.org/10.1109/TNSM.2021.3130290
SN  - 1932-4537
VL  - 19
IS  - 2
SP  - 1729
EP  - 1745
PB  - Institute of Electrical and Electronics Engineers
CY  - New York
ER  - 
TY  - JOUR
A1  - Lucke, Ulrike
A1  - Rensing, Christoph
T1  - A survey on pervasive education
JF  - Pervasive and mobile computing
N2  - 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.
KW  - Pervasive learning
KW  - Ubiquitous learning
KW  - Mobile learning
KW  - Contextualized learning
KW  - Seamless learning
KW  - E-learning
KW  - E-teaching
KW  - Context awareness
KW  - Adaptivity
KW  - Personalization
KW  - Augmentation
Y1  - 2014
U6  - https://doi.org/10.1016/j.pmcj.2013.12.001
SN  - 1574-1192
SN  - 1873-1589
VL  - 14
SP  - 3
EP  - 16
PB  - Elsevier
CY  - Amsterdam
ER  - 
TY  - JOUR
A1  - Luckow, Andre
A1  - Jha, Shantenu
A1  - Kim, Joohyun
A1  - Merzky, Andre
A1  - Schnor, Bettina
T1  - Adaptive distributed replica-exchange simulations
N2  - 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.
Y1  - 2009
UR  - http://rsta.royalsocietypublishing.org/
U6  - https://doi.org/10.1098/rsta.2009.0051
SN  - 1364-503X
ER  - 
TY  - JOUR
A1  - Luckow, André
A1  - Schnor, Bettina
T1  - Migol : a Fault Tolerant Service Framework for Grid Computing : Evolution to WSRF (2006)
Y1  - 2006
ER  - 
TY  - JOUR
A1  - Luckow, André
A1  - Schnor, Bettina
T1  - Migol : a fault-tolerant service framework for MPI applications in the grid
N2  - Especially for sciences the provision of massive parallel CPU capacity is one of the most attractive features of a grid. A major challenge in a distributed, inherently dynamic grid is fault tolerance. The more resources and components involved, the more complicated and error-prone becomes the system. In a grid with potentially thousands of machines connected to each other the reliability of individual resources cannot be guaranteed.The benefit of the grid is that in case of a failure ail application may be migrated and restarted from a checkpoint file on another site. This approach requires a service infrastructure which handles the necessary activities transparently. In this article, we present Migol, a fault-tolerant and self-healing grid middleware for MPI applications. Migol is based on open standards and extends the services of the Globus toolkit to support the fault tolerance of grid applications.Further, the Migol framework itself is designed with special focus on fault tolerance. For example, Migol eplicates ritical services and uses a ring-based replication protocol to achieve data consistency. (c) 2007 Elsevier B.V. All rights reserved.
Y1  - 2008
U6  - https://doi.org/10.1016/j.future.2007.03.007
ER  - 
TY  - JOUR
A1  - Luebbe, Alexander
A1  - Weske, Mathias
T1  - Determining the effect of tangible business process modeling
Y1  - 2012
ER  - 
TY  - JOUR
A1  - Luebbe, Alexander
A1  - Weske, Mathias
T1  - Bringing design thinking to business process modeling
Y1  - 2011
SN  - 978-3-642-13756-3
ER  - 
TY  - JOUR
A1  - Luther, Laura
A1  - Tiberius, Victor
A1  - Brem, Alexander
T1  - User experience (UX) in business, management, and psychology
BT  - a bibliometric mapping of the current state of research
JF  - Multimodal technologies and interaction : open access journal
N2  - User Experience (UX) describes the holistic experience of a user before, during, and after interaction with a platform, product, or service. UX adds value and attraction to their sole functionality and is therefore highly relevant for firms. The increased interest in UX has produced a vast amount of scholarly research since 1983. The research field is, therefore, complex and scattered. Conducting a bibliometric analysis, we aim at structuring the field quantitatively and rather abstractly. We employed citation analyses, co-citation analyses, and content analyses to evaluate productivity and impact of extant research. We suggest that future research should focus more on business and management related topics.
KW  - bibliometric analysis
KW  - co-citation analysis
KW  - co-occurrence analysis
KW  - citation analysis
KW  - user experience
KW  - UX
Y1  - 2020
U6  - https://doi.org/10.3390/mti4020018
SN  - 2414-4088
VL  - 4
IS  - 2
PB  - MDPI
CY  - Basel
ER  - 
TY  - JOUR
A1  - Ly, Ibrahim
A1  - Tarkhanov, Nikolai Nikolaevich
T1  - A variational approach to the Cauchy problem for nonlinear elliptic differential equations
N2  - 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.
Y1  - 2009
UR  - http://dx.doi.org/10.1515/jiip
U6  - https://doi.org/10.1515/Jiip.2009.037
SN  - 0928-0219
ER  - 
TY  - JOUR
A1  - Marco Figuera, Ramiro
A1  - Riedel, Christian
A1  - Rossi, Angelo Pio
A1  - Unnithan, Vikram
T1  - Depth to diameter analysis on small simple craters at the lunar south pole - possible implications for ice harboring
JF  - Remote sensing
N2  - In this paper, we present a study comparing the depth to diameter (d/D) ratio of small simple craters (200-1000 m) of an area between -88.5 degrees to -90 degrees latitude at the lunar south pole containing Permanent Shadowed Regions (PSRs) versus craters without PSRs. As PSRs can reach temperatures of 110 K and are capable of harboring volatiles, especially water ice, we analyzed the relationship of depth versus diameter ratios and its possible implications for harboring water ice. Variations in the d/D ratios can also be caused by other processes such as degradation, isostatic adjustment, or differences in surface properties. The conducted d/D ratio analysis suggests that a differentiation between craters containing PSRs versus craters without PSRs occurs. Thus, a possible direct relation between d/D ratio, PSRs, and water ice harboring might exist. Our results suggest that differences in the target's surface properties may explain the obtained results. The resulting d/D ratios of craters with PSRs can help to select target areas for future In-Situ Resource Utilization (ISRU) missions.
KW  - craters
KW  - lunar exploration
KW  - ice harboring
Y1  - 2022
U6  - https://doi.org/10.3390/rs14030450
SN  - 2072-4292
VL  - 14
IS  - 3
PB  - MDPI
CY  - Basel
ER  - 
TY  - JOUR
A1  - Margaria, Tiziana
A1  - Steffen, Bernhard
T1  - Continuous model-driven engineering
N2  - Agility at the customer, user, and application level will prove key to aligning and linking business and IT
Y1  - 2009
UR  - http://www.computer.org/computer/
SN  - 0018-9162
ER  - 
TY  - JOUR
A1  - Meinecke, Frank C.
A1  - Harmeling, Stefan
A1  - Müller, Klaus-Robert
T1  - Inlier-based ICA with an application to superimposed images
N2  - This paper proposes a new independent component analysis (ICA) method which is able to unmix overcomplete mixtures of sparce or structured signals like speech, music or images. Furthermore, the method is designed to be robust against outliers, which is a favorable feature for ICA algorithms since most of them are extremely sensitive to outliers. Our approach is based on a simple outlier index. However, instead of robustifying an existing algorithm by some outlier rejection technique we show how this index can be used directly to solve the ICA problem for super-Gaussian sources. The resulting inlier-based ICA (IBICA) is outlier-robust by construction and can be used for standard ICA as well as for overcomplete ICA (i.e. more source signals than observed signals). (c) 2005 Wiley Periodicals, Inc
Y1  - 2005
SN  - 0899-9457
ER  - 
TY  - JOUR
A1  - Meinecke, Frank C.
A1  - Ziehe, Andreas
A1  - Kurths, Jürgen
A1  - Müller, Klaus-Robert
T1  - Measuring phase synchronization of superimposed signals
N2  - Phase synchronization is an important phenomenon that occurs in a wide variety of complex oscillatory processes. Measuring phase synchronization can therefore help to gain fundamental insight into nature. In this Letter we point out that synchronization analysis techniques can detect spurious synchronization, if they are fed with a superposition of signals such as in electroencephalography or magnetoencephalography data. We show how techniques from blind source separation can help to nevertheless measure the true synchronization and avoid such pitfalls
Y1  - 2005
SN  - 0031-9007
ER  - 
TY  - JOUR
A1  - Meinel, Christoph
A1  - Klotz, Volker
T1  - The first 10 years of the ECCC digital library
Y1  - 2006
UR  - http://portal.acm.org/cacm
U6  - https://doi.org/10.1145/1107458.1107484
ER  - 
TY  - JOUR
A1  - Meinel, Christoph
A1  - Leifer, Larry
T1  - Design thinking research
Y1  - 2012
SN  - 978-3-642-31990-7
ER  - 
TY  - JOUR
A1  - Meinel, Christoph
A1  - Leifer, Larry
T1  - Design thinking research
Y1  - 2011
SN  - 978-3-642-13756-3
ER  - 
TY  - JOUR
A1  - Meinel, Christoph
A1  - Leifer, Larry
T1  - Design thinking research
Y1  - 2012
ER  - 
TY  - JOUR
A1  - Meinel, Christoph
A1  - Wang, Long
T1  - Building content clusters based on modelling page pairs
N2  - We give a new view on building content clusters from page pair models. We measure the heuristic importance within every two pages by computing the distance of their accessed positions in usage sessions. We also compare our page pair models with the classical pair models used in information theories and natural language processing, and give different evaluation methods to build the reasonable content communities. And we finally interpret the advantages and disadvantages of our models from detailed experiment results
Y1  - 2006
UR  - http://www.springerlink.com/content/105633/
U6  - https://doi.org/10.1007/11610113_85
ER  - 
TY  - JOUR
A1  - Menzel, Michael
T1  - Modelling security in service-oriented architectures
Y1  - 2010
SN  - 978-3-86956-036-6
ER  - 
TY  - JOUR
A1  - Metref, Sammy
A1  - Cosme, Emmanuel
A1  - Le Sommer, Julien
A1  - Poel, Nora
A1  - Brankart, Jean-Michel
A1  - Verron, Jacques
A1  - Gomez Navarro, Laura
T1  - Reduction of spatially structured errors in Wide-Swath altimetric satellite data using data assimilation
JF  - Remote sensing
N2  - The Surface Water and Ocean Topography (SWOT) mission is a next generation satellite mission expected to provide a 2 km-resolution observation of the sea surface height (SSH) on a two-dimensional swath. Processing SWOT data will be challenging because of the large amount of data, the mismatch between a high spatial resolution and a low temporal resolution, and the observation errors. The present paper focuses on the reduction of the spatially structured errors of SWOT SSH data. It investigates a new error reduction method and assesses its performance in an observing system simulation experiment. The proposed error-reduction method first projects the SWOT SSH onto a subspace spanned by the SWOT spatially structured errors. This projection is removed from the SWOT SSH to obtain a detrended SSH. The detrended SSH is then processed within an ensemble data assimilation analysis to retrieve a full SSH field. In the latter step, the detrending is applied to both the SWOT data and an ensemble of model-simulated SSH fields. Numerical experiments are performed with synthetic SWOT observations and an ensemble from a North Atlantic, 1/60 degrees simulation of the ocean circulation (NATL60). The data assimilation analysis is carried out with an ensemble Kalman filter. The results are assessed with root mean square errors, power spectrum density, and spatial coherence. They show that a significant part of the large scale SWOT errors is reduced. The filter analysis also reduces the small scale errors and allows for an accurate recovery of the energy of the signal down to 25 km scales. In addition, using the SWOT nadir data to adjust the SSH detrending further reduces the errors.
KW  - SWOT
KW  - correlated errors
KW  - OSSE
KW  - projection
KW  - detrending
KW  - ensemble kalman filter
Y1  - 2019
U6  - https://doi.org/10.3390/rs11111336
SN  - 2072-4292
VL  - 11
IS  - 11
PB  - MDPI
CY  - Basel
ER  - 
TY  - JOUR
A1  - Michallek, Florian
A1  - Genske, Ulrich
A1  - Niehues, Stefan Markus
A1  - Hamm, Bernd
A1  - Jahnke, Paul
T1  - Deep learning reconstruction improves radiomics feature stability and discriminative power in abdominal CT imaging
BT  - a phantom study
JF  - European Radiology
N2  - Objectives To compare image quality of deep learning reconstruction (AiCE) for radiomics feature extraction with filtered back projection (FBP), hybrid iterative reconstruction (AIDR 3D), and model-based iterative reconstruction (FIRST). Methods Effects of image reconstruction on radiomics features were investigated using a phantom that realistically mimicked a 65-year-old patient's abdomen with hepatic metastases. The phantom was scanned at 18 doses from 0.2 to 4 mGy, with 20 repeated scans per dose. Images were reconstructed with FBP, AIDR 3D, FIRST, and AiCE. Ninety-three radiomics features were extracted from 24 regions of interest, which were evenly distributed across three tissue classes: normal liver, metastatic core, and metastatic rim. Features were analyzed in terms of their consistent characterization of tissues within the same image (intraclass correlation coefficient >= 0.75), discriminative power (Kruskal-Wallis test p value < 0.05), and repeatability (overall concordance correlation coefficient >= 0.75). Results The median fraction of consistent features across all doses was 6%, 8%, 6%, and 22% with FBP, AIDR 3D, FIRST, and AiCE, respectively. Adequate discriminative power was achieved by 48%, 82%, 84%, and 92% of features, and 52%, 20%, 17%, and 39% of features were repeatable, respectively. Only 5% of features combined consistency, discriminative power, and repeatability with FBP, AIDR 3D, and FIRST versus 13% with AiCE at doses above 1 mGy and 17% at doses >= 3 mGy. AiCE was the only reconstruction technique that enabled extraction of higher-order features. Conclusions AiCE more than doubled the yield of radiomics features at doses typically used clinically. Inconsistent tissue characterization within CT images contributes significantly to the poor stability of radiomics features.
KW  - Tomography
KW  - X-ray computed
KW  - Phantoms
KW  - imaging
KW  - Liver neoplasms
KW  - Algorithms
KW  - Reproducibility of results
Y1  - 2022
U6  - https://doi.org/10.1007/s00330-022-08592-y
SN  - 1432-1084
VL  - 32
IS  - 7
SP  - 4587
EP  - 4595
PB  - Springer
CY  - New York
ER  - 
TY  - JOUR
A1  - Middelanis, Robin
A1  - Willner, Sven N.
A1  - Otto, Christian
A1  - Kuhla, Kilian
A1  - Quante, Lennart
A1  - Levermann, Anders
T1  - Wave-like global economic ripple response to Hurricane Sandy
JF  - Environmental research letters : ERL / Institute of Physics
N2  - Tropical cyclones range among the costliest disasters on Earth. Their economic repercussions along the supply and trade network also affect remote economies that are not directly affected. We here simulate possible global repercussions on consumption for the example case of Hurricane Sandy in the US (2012) using the shock-propagation model Acclimate. The modeled shock yields a global three-phase ripple: an initial production demand reduction and associated consumption price decrease, followed by a supply shortage with increasing prices, and finally a recovery phase. Regions with strong trade relations to the US experience strong magnitudes of the ripple. A dominating demand reduction or supply shortage leads to overall consumption gains or losses of a region, respectively. While finding these repercussions in historic data is challenging due to strong volatility of economic interactions, numerical models like ours can help to identify them by approaching the problem from an exploratory angle, isolating the effect of interest. For this, our model simulates the economic interactions of over 7000 regional economic sectors, interlinked through about 1.8 million trade relations. Under global warming, the wave-like structures of the economic response to major hurricanes like the one simulated here are likely to intensify and potentially overlap with other weather extremes.
KW  - supply chains
KW  - Hurricane Sandy
KW  - economic ripples
KW  - extreme weather
KW  - impacts
KW  - loss propagation
KW  - natural disasters
Y1  - 2021
U6  - https://doi.org/10.1088/1748-9326/ac39c0
SN  - 1748-9326
VL  - 16
IS  - 12
PB  - IOP Publ. Ltd.
CY  - Bristol
ER  - 
TY  - JOUR
A1  - Mika, Sebastian
A1  - Rätsch, Gunnar
A1  - Weston, J.
A1  - Schölkopf, B.
A1  - Smola, Alexander J.
A1  - Müller, Klaus-Robert
T1  - Invariant feature extraction and classification in kernel spaces
Y1  - 2000
ER  - 
TY  - JOUR
A1  - Mileo, Alessandra
A1  - Schaub, Torsten
T1  - Qualitative constraint enforcement in advanced policy specification
Y1  - 2007
ER  - 
TY  - JOUR
A1  - Mileo, Alessandra
A1  - Schaub, Torsten
T1  - Extending ordered disjunctions for policy enforcement : preliminary report
Y1  - 2006
UR  - http://www.easychair.org/FLoC-06/PREFS-preproceedings.pdf
ER  - 
TY  - JOUR
A1  - Mileo, Alessandra
A1  - Schaub, Torsten
A1  - Merico, Davide
A1  - Bisiani, Roberto
T1  - Knowledge-based multi-criteria optimization to support indoor positioning
JF  - Annals of mathematics and artificial intelligence
N2  - Indoor position estimation constitutes a central task in home-based assisted living environments. Such environments often rely on a heterogeneous collection of low-cost sensors whose diversity and lack of precision has to be compensated by advanced techniques for localization and tracking. Although there are well established quantitative methods in robotics and neighboring fields for addressing these problems, they lack advanced knowledge representation and reasoning capacities. Such capabilities are not only useful in dealing with heterogeneous and incomplete information but moreover they allow for a better inclusion of semantic information and more general homecare and patient-related knowledge. We address this problem and investigate how state-of-the-art localization and tracking methods can be combined with Answer Set Programming, as a popular knowledge representation and reasoning formalism. We report upon a case-study and provide a first experimental evaluation of knowledge-based position estimation both in a simulated as well as in a real setting.
KW  - Knowledge representation
KW  - Answer Set Programming
KW  - Wireless Sensor Networks
KW  - Localization
KW  - Tracking
Y1  - 2011
U6  - https://doi.org/10.1007/s10472-011-9241-2
SN  - 1012-2443
SN  - 1573-7470
VL  - 62
IS  - 3-4
SP  - 345
EP  - 370
PB  - Springer
CY  - Dordrecht
ER  - 
TY  - JOUR
A1  - Montavon, Gregoire
A1  - Braun, Mikio L.
A1  - Krüger, Tammo
A1  - Müller, Klaus-Robert
T1  - Analyzing local structure in Kernel-Based learning
JF  - IEEE signal processing magazine
Y1  - 2013
U6  - https://doi.org/10.1109/MSP.2013.2249294
SN  - 1053-5888
VL  - 30
IS  - 4
SP  - 62
EP  - 74
PB  - Inst. of Electr. and Electronics Engineers
CY  - Piscataway
ER  - 
TY  - JOUR
A1  - Morosov, Andrej
A1  - Gössel, Michael
A1  - Hartje, Hendrik
T1  - Reduced area overhead of the input party for code-disjoint circuits
Y1  - 1999
ER  - 
TY  - JOUR
A1  - Morosov, Andrej
A1  - Saposhnikov, V. V.
A1  - Gössel, Michael
T1  - Self-Checking circuits with unidiectionally independent outputs
Y1  - 1998
ER  - 
TY  - JOUR
A1  - Morosov, Andrej
A1  - Saposhnikov, Vl. V.
A1  - Saposhnikov, V. V.
A1  - Gössel, Michael
T1  - Design of self dual fault-secure combinational circuits
Y1  - 1997
ER  - 
TY  - JOUR
A1  - Moschanin, Wladimir
A1  - Saposhnikov, Vl. V.
A1  - Saposhnikov, Va. V.
A1  - Gössel, Michael
T1  - Synthesis of self-dual multi-output combinational circuits for on-line Teting
Y1  - 1996
ER  - 
TY  - JOUR
A1  - Moshanin, Vl.
A1  - Otscheretnij, Vitalij
A1  - Dimitriev, Alexej
T1  - The impact of logic optimization on concurrent error detection
Y1  - 1998
ER  - 
TY  - JOUR
A1  - Müller, Klaus-Robert
A1  - Vigario, R.
A1  - Meinecke, Frank C.
A1  - Ziehe, Andreas
T1  - Blind source separation techniques for decomposing event-related brain signals
N2  - Recently blind source separation (BSS) methods have been highly successful when applied to biomedical data. This paper reviews the concept of BSS and demonstrates its usefulness in the context of event-related MEG measurements. In a first experiment we apply BSS to artifact identification of raw MEG data and discuss how the quality of the resulting independent component projections can be evaluated. The second part of our study considers averaged data of event-related magnetic fields. Here, it is particularly important to monitor and thus avoid possible overfitting due to limited sample size. A stability assessment of the BSS decomposition allows to solve this task and an additional grouping of the BSS components reveals interesting structure, that could ultimately be used for gaining a better physiological modeling of the data
Y1  - 2004
SN  - 0218-1274
ER  - 
TY  - JOUR
A1  - Naujokat, Stefan
A1  - Neubauer, Johannes
A1  - Lamprecht, Anna-Lena
A1  - Steffen, Bernhard
A1  - Joerges, Sven
A1  - Margaria, Tiziana
T1  - Simplicity-first model-based plug-in development
JF  - Software : practice & experience
N2  - In this article, we present our experience with over a decade of strict simplicity orientation in the development and evolution of plug-ins. The point of our approach is to enable our graphical modeling framework jABC to capture plug-in development in a domain-specific setting. The typically quite tedious and technical plug-in development is shifted this way from a programming task to the modeling level, where it can be mastered also by application experts without programming expertise. We show how the classical plug-in development profits from a systematic domain-specific API design and how the level of abstraction achieved this way can be further enhanced by defining adequate building blocks for high-level plug-in modeling. As the resulting plug-in models can be compiled and deployed automatically, our approach decomposes plug-in development into three phases where only the realization phase requires plug-in-specific effort. By using our modeling framework jABC, this effort boils down to graphical, tool-supported process modeling. Furthermore, we support the automatic completion of process sketches for executability. All this will be illustrated along the most recent plug-in-based evolution of the jABC framework, which witnessed quite some bootstrapping effects.
KW  - plug-ins
KW  - simplicity
KW  - domain-specific APIs
KW  - process modeling
KW  - bootstrapping
KW  - evolution
KW  - code generation
KW  - loose programming
KW  - dynamic service binding
Y1  - 2014
U6  - https://doi.org/10.1002/spe.2243
SN  - 0038-0644
SN  - 1097-024X
VL  - 44
IS  - 3
SP  - 277
EP  - 297
PB  - Wiley-Blackwell
CY  - Hoboken
ER  - 
TY  - JOUR
A1  - Neumann, I.
A1  - Stoffel, Dominik
A1  - Hartje, Hendrik
A1  - Kunz, Wolfgang
T1  - Cell replication and redundancy elimination during placement for cycle time optimization
Y1  - 1999
ER  - 
TY  - JOUR
A1  - Nicolas, Pascal
A1  - Schaub, Torsten
T1  - The XRay system : an implementation platform for local query-answering in default logics
Y1  - 1998
SN  - 3-540-65312-0
ER  - 
TY  - JOUR
A1  - Nienhaus, Marc
A1  - Döllner, Jürgen Roland Friedrich
T1  - Depicting dynamics using principles of visual art and narration's
Y1  - 2005
SN  - 0272-1716
ER  - 
TY  - JOUR
A1  - Noack, Franziska
T1  - CREADED: Colored-Relief application for digital elevation data
JF  - Process design for natural scientists: an agile model-driven approach
N2  - In the geoinformatics field, remote sensing data is often used for analyzing the characteristics of the current investigation area. This includes DEMs, which are simple raster grids containing grey scales representing the respective elevation values. The project CREADED that is presented in this paper aims at making these monochrome raster images more significant and more intuitively interpretable. For this purpose, an executable interactive model for creating a colored and relief-shaded Digital Elevation Model (DEM) has been designed using the jABC framework. The process is based on standard jABC-SIBs and SIBs that provide specific GIS functions, which are available as Web services, command line tools and scripts.
Y1  - 2014
SN  - 978-3-662-45005-5
SN  - 1865-0929
IS  - 500
SP  - 186
EP  - 199
PB  - Springer
CY  - Berlin
ER  - 
TY  - JOUR
A1  - Noweski, Christine
A1  - Scheer, Andrea
A1  - Büttner, Nadja
A1  - Thienen, Julia von
A1  - Erdmann, Johannes
A1  - Meinel, Christoph
T1  - Towards a paradigm shift in education practice : developing twenty-first century skills with design thinking
Y1  - 2012
SN  - 978-3-642-31990-7
ER  - 
TY  - JOUR
A1  - Ocheretnij, Vitalij
A1  - Gössel, Michael
A1  - Sogomonyan, Egor S.
A1  - Marienfeld, Daniel
T1  - Modulo p=3 checking for a carry select adder
N2  - In this paper a self-checking carry select adder is proposed. The duplicated adder blocks which are inherent to a carry select adder without error detection are checked modulo 3. Compared to a carry select adder without error detection the delay of the MSB of the sum of the proposed adder does not increase. Compared to a self-checking duplicated carry select adder the area is reduced by 20%. No restrictions are imposed on the design of the adder blocks
Y1  - 2006
UR  - http://www.springerlink.com/content/100286
U6  - https://doi.org/10.1007/s10836-006-6260-8
ER  - 
TY  - JOUR
A1  - Omranian, Nooshin
A1  - Müller-Röber, Bernd
A1  - Nikoloski, Zoran
T1  - Segmentation of biological multivariate time-series data
JF  - Scientific reports
N2  - Time-series data from multicomponent systems capture the dynamics of the ongoing processes and reflect the interactions between the components. The progression of processes in such systems usually involves check-points and events at which the relationships between the components are altered in response to stimuli. Detecting these events together with the implicated components can help understand the temporal aspects of complex biological systems. Here we propose a regularized regression-based approach for identifying breakpoints and corresponding segments from multivariate time-series data. In combination with techniques from clustering, the approach also allows estimating the significance of the determined breakpoints as well as the key components implicated in the emergence of the breakpoints. Comparative analysis with the existing alternatives demonstrates the power of the approach to identify biologically meaningful breakpoints in diverse time-resolved transcriptomics data sets from the yeast Saccharomyces cerevisiae and the diatom Thalassiosira pseudonana.
Y1  - 2015
U6  - https://doi.org/10.1038/srep08937
SN  - 2045-2322
VL  - 5
PB  - Nature Publ. Group
CY  - London
ER  - 
TY  - JOUR
A1  - Onoda, T.
A1  - Rätsch, Gunnar
A1  - Müller, Klaus-Robert
T1  - An asymptotic analysis and improvement of AdaBoost in the binary classification case (in Japanese)
Y1  - 2000
ER  - 
TY  - JOUR
A1  - Ostrowski, Max
A1  - Schaub, Torsten
T1  - ASP modulo CSP The clingcon system
JF  - Theory and practice of logic programming
N2  - We present the hybrid ASP solver clingcon, combining the simple modeling language and the high performance Boolean solving capacities of Answer Set Programming (ASP) with techniques for using non-Boolean constraints from the area of Constraint Programming (CP). The new clingcon system features an extended syntax supporting global constraints and optimize statements for constraint variables. The major technical innovation improves the interaction between ASP and CP solver through elaborated learning techniques based on irreducible inconsistent sets. A broad empirical evaluation shows that these techniques yield a performance improvement of an order of magnitude.
Y1  - 2012
U6  - https://doi.org/10.1017/S1471068412000142
SN  - 1471-0684
VL  - 12
SP  - 485
EP  - 503
PB  - Cambridge Univ. Press
CY  - New York
ER  - 
TY  - JOUR
A1  - Otscheretnij, Vitalij
A1  - Gössel, Michael
A1  - Saposhnikov, Vl. V.
A1  - Saposhnikov, V. V.
T1  - Fault-tolerant self-dual circuits with error detection by parity- and group parity prediction
Y1  - 1998
ER  - 
TY  - JOUR
A1  - Otscheretnij, Vitalij
A1  - Saposhnikov, Vl. V.
A1  - Saposhnikov, V. V.
A1  - Gössel, Michael
T1  - Fault-tolerant self-dual circuits
Y1  - 1999
ER  - 
TY  - JOUR
A1  - Overdick, Hagen
T1  - Introducing the model mapper enactor pattern
Y1  - 2010
SN  - 978-3-86956-036-6
ER  - 
TY  - JOUR
A1  - Pablo Alarcon, Pedro
A1  - Arroyo, Fernando
A1  - Bordihn, Henning
A1  - Mitrana, Victor
A1  - Mueller, Mike
T1  - Ambiguity of the multiple interpretations on regular languages
JF  - Fundamenta informaticae
N2  - 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.
KW  - Multiple interpretation scheme
KW  - regular language
KW  - o-ambiguity
KW  - internal ambiguity
KW  - external ambiguity
Y1  - 2015
U6  - https://doi.org/10.3233/FI-2015-1200
SN  - 0169-2968
SN  - 1875-8681
VL  - 138
IS  - 1-2
SP  - 85
EP  - 95
PB  - IOS Press
CY  - Amsterdam
ER  -