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 -