BibSonomyburst/user/ludaeschBibSonomy RSS feed for /user/ludaesch2012-02-15T19:47:18+01:00http://www.bibsonomy.org/bibtex/24ca1fb35d00f2795239c6acf5e30742c/ludaeschludaesch2009-08-03T03:16:49+02:00comad dakspub keplerworkflow workflow <span class="authorEditorList"><a href="/author/McPhillips">Timothy McPhillips</a>, <a href="/author/Bowers">Shawn Bowers</a>, <a href="/author/Zinn">Daniel Zinn</a>, and <a href="/author/Ludäscher">Bertram Ludäscher</a> </span><em>Future Gener. Comput. Syst.</em> <em>25(5):541--551</em> (<em>2009</em>)Mon Aug 03 03:16:49 CEST 2009Amsterdam, The Netherlands, The NetherlandsFuture Gener. Comput. Syst.5541--551Scientific workflow design for mere mortals252009comad dakspub keplerworkflow workflow Recent years have seen a dramatic increase in research and development of scientific workflow systems. These systems promise to make scientists more productive by automating data-driven and compute-intensive analyses. Despite many early achievements, the long-term success of scientific workflow technology critically depends on making these systems useable by ''mere mortals'', i.e., scientists who have a very good idea of the analysis methods they wish to assemble, but who are neither software developers nor scripting-language experts. With these users in mind, we identify a set of desiderata for scientific workflow systems crucial for enabling scientists to model and design the workflows they wish to automate themselves. As a first step towards meeting these requirements, we also show how the collection-oriented modeling and design (comad) approach for scientific workflows, implemented within the Kepler system, can help provide these critical, design-oriented capabilities to scientists.Scientific workflow design for mere mortalshttp://www.bibsonomy.org/bibtex/2764c2f395494f81ff2d6dd772840aea9/ludaeschludaesch2009-07-24T19:56:37+02:00dakspub kepler keplerworkflow workflow <span class="authorEditorList"><a href="/author/Ludäscher">Bertram Ludäscher</a>, <a href="/author/Altintas">Ilkay Altintas</a>, <a href="/author/Bowers">Shawn Bowers</a>, <a href="/author/Cummings">Julian Cummings</a>, <a href="/author/Critchlow">Terence Critchlow</a>, <a href="/author/Deelman">Ewa Deelman</a>, <a href="/author/Roure">David De Roure</a>, <a href="/author/Freire">Juliana Freire</a>, <a href="/author/Goble">Carole Goble</a>, <a href="/author/Jones">Matthew Jones</a>, <a href="/author/Klasky">Scott Klasky</a>, <a href="/author/McPhillips">Timothy McPhillips</a>, <a href="/author/Podhorszki">Norbert Podhorszki</a>, <a href="/author/Silva">Claudio Silva</a>, <a href="/author/Taylor">Ian Taylor</a>, and <a href="/author/Vouk">Mladen Vouk</a> </span><em>Scientific Data Management, </em><em>chapter 13, </em><em>Chapman \&amp; Hall, </em>(<em>2009</em>)Fri Jul 24 19:56:37 CEST 2009Scientific Data Management13Computational Science SeriesScientific Process Automation and Workflow Management2009dakspub kepler keplerworkflow workflow http://www.bibsonomy.org/bibtex/245b71bc3ac38e1f2e4a477b009bd4baa/ludaeschludaesch2009-07-10T10:43:10+02:00kepler keplerworkflow workflow <span class="authorEditorList"><a href="/author/Ludäscher">Bertram Ludäscher</a>, <a href="/author/Weske">Mathias Weske</a>, <a href="/author/McPhillips">Timothy McPhillips</a>, and <a href="/author/Bowers">Shawn Bowers</a> </span><em>7th Intl. Conf. on Business Process Management BPM, </em><em>Ulm, Germany, </em>(<em>2009</em>)Fri Jul 10 10:43:10 CEST 2009Ulm, Germany7th Intl. Conf. on Business Process Management (BPM)LNCS 5701Scientific Workflows: Business as Usual?2009kepler keplerworkflow workflow http://www.bibsonomy.org/bibtex/207c8dba7e31fcaa31262554a2014385f/ludaeschludaesch2009-06-17T09:08:24+02:00kepler keplerworkflow provenance workflow <span class="authorEditorList"><a href="/author/Anand">Manish Anand</a>, <a href="/author/Bowers">Shawn Bowers</a>, <a href="/author/McPhillips">Timothy McPhillips</a>, and <a href="/author/Ludäscher">Bertram Ludäscher</a> </span><em>Scientific and Statistical Database Management</em> (<em>2009</em>)Wed Jun 17 09:08:24 CEST 2009Scientific and Statistical Database Management237--254Exploring Scientific Workflow Provenance Using Hybrid Queries over Nested Data and Lineage Graphs2009kepler keplerworkflow provenance workflow Existing approaches for representing the provenance of scientific workflow runs largely ignore computation models that work over structured data, including XML. Unlike models based on transformation semantics, these computation models often employupdate semantics, in which only a portion of an incoming XML stream is modified by each workflow step. Applying conventionalprovenance approaches to such models results in provenance information that is either too coarse (e.g., stating that one versionof an XML document depends entirely on a prior version) or potentially incorrect (e.g., stating that each element of an XMLdocument depends on every element in a prior version). We describe a generic provenance model that naturally represents workflowruns involving processes that work over nested data collections and that employ update semantics. Moreover, we extend currentquery approaches to support our model, enabling queries to be posed not only over data lineage relationships, but also overversions of nested data structures produced during a workflow run. We show how hybrid queries can be expressed against ourmodel using high-level query constructs and implemented efficiently over relational provenance storage schemes.SpringerLink - Book Chapterhttp://www.bibsonomy.org/bibtex/2538bf4081cf1c6bf585fc27484a8cc14/ludaeschludaesch2009-06-17T09:05:40+02:00kepler keplerworkflow provenance workflow <span class="authorEditorList"><a href="/author/Anand">Manish Kumar Anand</a>, <a href="/author/Bowers">Shawn Bowers</a>, <a href="/author/McPhillips">Timothy McPhillips</a>, and <a href="/author/Ludäscher">Bertram Ludäscher</a> </span><em>EDBT &#039;09: Proceedings of the 12th International Conference on Extending Database Technology, </em><em>page 958--969. </em><em>New York, NY, USA, </em><em>ACM, </em>(<em>2009</em>)Wed Jun 17 09:05:40 CEST 2009New York, NY, USAEDBT '09: Proceedings of the 12th International Conference on Extending Database Technology958--969Efficient provenance storage over nested data collections2009kepler keplerworkflow provenance workflow Efficient provenance storage over nested data collectionshttp://www.bibsonomy.org/bibtex/243599ff26b9e55584914cd2e1db7abad/ludaeschludaesch2009-06-13T18:37:17+02:00kepler keplerworkflow workflow <span class="authorEditorList"><a href="/author/Podhorszki">Norbert Podhorszki</a>, <a href="/author/Ludaescher">Bertram Ludaescher</a>, and <a href="/author/Klasky">Scott A. Klasky</a> </span><em>WORKS &#039;07: Proceedings of the 2nd workshop on Workflows in support of large-scale science, </em><em>page 35--44. </em><em>New York, NY, USA, </em><em>ACM, </em>(<em>2007</em>)Sat Jun 13 18:37:17 CEST 2009New York, NY, USAWORKS '07: Proceedings of the 2nd workshop on Workflows in support of large-scale science35--44Workflow automation for processing plasma fusion simulation data2007kepler keplerworkflow workflow Workflow automation for processing plasma fusion simulation datahttp://www.bibsonomy.org/bibtex/26a3c5d4837f64be7221ef6d3044eb9c8/ludaeschludaesch2009-06-13T18:04:00+02:00grid kepler keplerworkflow nimrod parallelism workflow <span class="authorEditorList"><a href="/author/Abramson">David Abramson</a>, <a href="/author/Enticott">Colin Enticott</a>, and <a href="/author/Altinas">Ilkay Altinas</a> </span><em>SC &#039;08: Proceedings of the 2008 ACM/IEEE conference on Supercomputing, </em><em>page 1--11. </em><em>Piscataway, NJ, USA, </em><em>IEEE Press, </em>(<em>2008</em>)Sat Jun 13 18:04:00 CEST 2009Piscataway, NJ, USASC '08: Proceedings of the 2008 ACM/IEEE conference on Supercomputing1--11Nimrod/K: towards massively parallel dynamic grid workflows2008grid kepler keplerworkflow nimrod parallelism workflow Nimrod/Khttp://www.bibsonomy.org/bibtex/25d019a4c15bb0e9fcfbda9547bbdc075/ludaeschludaesch2009-06-13T18:01:37+02:00kepler keplerworkflow workflow <span class="authorEditorList"><a href="/author/Crawl">Daniel Crawl</a>, and <a href="/author/Altintas">Ilkay Altintas</a> </span><em>Provenance and Annotation of Data and Processes</em> (<em>2008</em>)Sat Jun 13 18:01:37 CEST 2009Provenance and Annotation of Data and Processes152--159A Provenance-Based Fault Tolerance Mechanism for Scientific Workflows2008kepler keplerworkflow workflow Capturing provenance information in scientific workflows is not only useful for determining data-dependencies, but also for a wide range of queries including fault tolerance and usage statistics. As collaborative scientific workflow environmentsprovide users with reusable shared workflows, collection and usage of provenance data in a generic way that could serve multipledata and computational models become vital. This paper presents a method for capturing data value- and control- dependenciesfor provenance information collection in the Kepler scientific workflow system. It also describes how the collected informationbased on these dependencies could be used for a fault tolerance framework in different models of computation.SpringerLink - Book Chapterhttp://www.bibsonomy.org/bibtex/25fa93e5077e161085645e14a97c2de2a/ludaeschludaesch2009-05-11T00:53:25+02:002read mocs theory workflow <span class="authorEditorList"><a href="/author/Börger">Egon Börger</a> </span><em>Annals of Pure and Applied Logic</em> <em>133(1-3):149 - 171</em> (<em>2005</em>)<em>Festschrift on the occasion of Helmut Schwichtenberg&#039;s 60th birthday . </em>Mon May 11 00:53:25 CEST 2009Annals of Pure and Applied LogicFestschrift on the occasion of Helmut Schwichtenberg's 60th birthday1-3149 - 171Abstract State Machines: a unifying view of models of computation and of system design frameworks13320052read mocs theory workflow We capture the principal models of computation and specification in the literature by a uniform set of transparent mathematical descriptions which--starting from scratch--provide the conceptual basis for a comparative study.1ScienceDirect - Annals of Pure and Applied Logic : Abstract State Machines: a unifying view of models of computation and of system design frameworkshttp://www.bibsonomy.org/bibtex/23bfcd512350acf095b90362ce6479e72/ludaeschludaesch2009-05-08T11:56:45+02:00education teaching <span class="authorEditorList"><a href="/author/McKinney">Dani McKinney</a>, <a href="/author/Dyck">Jennifer L. Dyck</a>, and <a href="/author/Luber">Elise S. Luber</a> </span><em>Computers &amp; Education</em> <em>52(3):617 - 623</em> (<em>2009</em>)Fri May 08 11:56:45 CEST 2009Computers & Education3617 - 623iTunes University and the classroom: Can podcasts replace Professors?522009education teaching iTunes University, a website with downloadable educational podcasts, can provide students the opportunity to obtain professors' lectures when students are unable to attend class. To determine the effectiveness of audio lectures in higher education, undergraduate general psychology students participated in one of two conditions. In the lecture condition, participants listened to a 25-min lecture given in person by a professor using PowerPoint slides. Copies of the slides were given to aid note-taking. In the podcast condition, participants received a podcast of the same lecture along with the PowerPoint handouts. Participants in both conditions were instructed to keep a running log of study time and activities used in preparing for an exam. One week from the initial session students returned to take an exam on lecture content. Results indicated that students in the podcast condition who took notes while listening to the podcast scored significantly higher than the lecture condition. The impact of mobile learning on classroom performance is discussed.ScienceDirect - Computers & Education : iTunes University and the classroom: Can podcasts replace Professors?http://www.bibsonomy.org/bibtex/217c8cce2e206bc8607f9255ef502640a/ludaeschludaesch2009-05-03T20:40:24+02:00workflow <span class="authorEditorList"><a href="/author/Puhlmann">Frank Puhlmann</a>, and <a href="/author/Weske">Mathias Weske</a> </span><em>Business Process Management</em> (<em>2005</em>)Sun May 03 20:40:24 CEST 2009Business Process Management153--168Using the π-Calculus for Formalizing Workflow Patterns2005workflow This paper discusses the application of a general process theory – the π-calculus – for describing the behavioral perspective of workflow. The π-calculus is a process algebra that describes mobile systems. Mobile systems are made up of components that communicate and change their structure as a result of communication. The ideas behind mobility, communication and change can also enrich the workflow domain, where flexibility and reaction to change are main drivers. However, it has not yet been evaluated whether the π-calculus is actually appropriate to represent the behavioral patterns of workflow. This paper investigates the issue and introduces a collection of workflow patterns formalizations, each with a sound formal definition and execution semantics. The formalizations can be used as a foundation for pattern-based workflow execution, reasoning, and simulation as well as a basis for future research on theoretical aspects of workflow. ER -SpringerLink - Book Chapterhttp://www.bibsonomy.org/bibtex/26f2b2b8e810baed8556f07f30ff6196f/ludaeschludaesch2008-11-13T10:48:49+01:00293 reading teaching <span class="authorEditorList"><a href="/author/Hanson">Michael J. Hanson</a>, and <a href="/author/McNamee">Dylan J. McNamee</a> </span>(<em>2000</em>)Thu Nov 13 10:48:49 CET 2008Efficient Reading of Papers in Science and Technology2000293 reading teaching http://www.bibsonomy.org/bibtex/22daf52c0d6657154e2f8d7dcdbcb5d5b/ludaeschludaesch2008-11-13T06:41:30+01:00293 teaching <span class="authorEditorList"><a href="/author/Keshav">S. Keshav</a> </span><em>SIGCOMM Comput. Commun. Rev.</em> <em>37(3):83--84</em> (<em>2007</em>)Thu Nov 13 06:41:30 CET 2008New York, NY, USASIGCOMM Comput. Commun. Rev.383--84How to read a paper372007293 teaching How to read a paper. Researchers spend a great deal of time reading research papers. However, this skill is rarely taught, leading to much wasted effort. This article outlines a practical and efficient three-pass method for reading research papers. I also describe how to use this method to do a literature survey.http://www.bibsonomy.org/bibtex/251d50d9e980cdec1a980c6a191cad9c8/ludaeschludaesch2008-11-04T20:43:08+01:00xpath <span class="authorEditorList"><a href="/author/ten Cate">Balder ten Cate</a>, and <a href="/author/Lutz">Carsten Lutz</a> </span><em>PODS &#039;07: Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, </em><em>page 73--82. </em><em>New York, NY, USA, </em><em>ACM, </em>(<em>2007</em>)Tue Nov 04 20:43:08 CET 2008New York, NY, USAPODS '07: Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems73--82The complexity of query containment in expressive fragments of XPath 2.02007xpath The complexity of query containment in expressive fragments of XPath 2.0http://www.bibsonomy.org/bibtex/225161f40c1d7b3cbe2c01f62acf62fe8/ludaeschludaesch2008-11-04T20:17:33+01:00xpath <span class="authorEditorList"><a href="/author/Gottlob">Georg Gottlob</a>, <a href="/author/Koch">Christoph Koch</a>, and <a href="/author/Pichler">Reinhard Pichler</a> </span><em>SIGMOD Rec.</em> <em>32(1):12--19</em> (<em>2003</em>)Tue Nov 04 20:17:33 CET 2008New York, NY, USASIGMOD Rec.112--19XPath processing in a nutshell322003xpath We provide a concise yet complete formal definition of the semantics of XPath 1 and summarize e cient algorithms for processing queries in this language. Our presentation is intended both for the reader who is looking for a short but comprehensive formal account of XPath as well as the software developer in need of material that facilitates the rapid implementation of XPath engines.XPath processing in a nutshellhttp://www.bibsonomy.org/bibtex/24f1163d7b22d2588082fecabdfb35cea/ludaeschludaesch2008-11-03T06:19:09+01:00haskell kepler workflow <span class="authorEditorList"><a href="/author/Ludäscher">Bertram Ludäscher</a>, and <a href="/author/Altintas">Ilkay Altintas</a> </span><em>San Diego Supercomputer Center, </em>(<em>2003</em>)Mon Nov 03 06:19:09 CET 2008On Providing Declarative Design and Programming Constructs for Scientific Workflows based on Process Networks2003haskell kepler workflow http://www.bibsonomy.org/bibtex/2ea5ce97bd0c9004027a7ca3d7255bddf/ludaeschludaesch2008-11-03T06:17:50+01:00e-science kepler workflow <span class="authorEditorList"><a href="/author/Ludäscher">Bertram Ludäscher</a>, <a href="/author/Bowers">Shawn Bowers</a>, <a href="/author/McPhillips">Timothy McPhillips</a>, and <a href="/author/Podhorszki">Norbert Podhorszki</a> </span><em>e-Science and Grid Computing, International Conference on</em> (<em>2006</em>)Mon Nov 03 06:17:50 CET 2008Los Alamitos, CA, USAe-Science and Grid Computing, International Conference on145Scientific Workflows: More e-Science Mileage from Cyberinfrastructure02006e-science kepler workflow http://www.bibsonomy.org/bibtex/239365c92f178737f3bbb0364396fd71b/ludaeschludaesch2008-11-01T03:52:43+01:00kr seek <span class="authorEditorList"><a href="/author/Villa">Ferdinando Villa</a> </span><em>Journal of Intelligent Information Systems</em> <em>29(1):79--96</em> (<em>August 2007</em>)Sat Nov 01 03:52:43 CET 2008Journal of Intelligent Information Systems#aug#179--96A semantic framework and software design to enable the transparent integration, reorganization and discovery of natural systems knowledge292007kr seek Abstract&nbsp;&nbsp;I present a conceptualization that attempts to unify diverse representations of natural knowledge while providing a workable computational framework, based on current semantic web theory, for developing, communicating, and running integrated simulationmodels. The approach is based on a long-standing principle of scientific investigation: the separation of the ontologicalcharacter of the object of study from the semantics of the observation context, the latter including location in space and time and other observation-related aspects. I will show how current KnowledgeRepresentation theories coupled with the object-oriented paradigm allow an efficient integration through the abstract modelof a domain, which relates to the idea of aspect in software engineering. This conceptualization allows us to factor out two fundamental causes of complexity and awkwardnessin the representation of knowledge about natural system: (a) the distinction between data and models, both seen here as genericknowledge sources; (b) the multiplicity of states in data sources, handled through the hierarchical composition of independentlydefined domain objects, each accounting for all states in one well-known observational dimension. This simplification leavesmodelers free to work with the bare conceptual bones of the problem, encapsulating complexities connected to data format,and scale. I will then describe the design of a software system that implements the approach, referring to explicit ontologiesto unambiguously characterize the semantics of the objects of study, and allowing the independent definition of a global observation context that can be redefined as required. I will briefly discuss applications to multi-scale, multi-paradigm modeling, intelligentdatabase design, and web-based collaboration.SpringerLink - Journal Articlehttp://www.bibsonomy.org/bibtex/2e7c90fdce9b659e5ce254e2360579df4/ludaeschludaesch2008-10-11T10:09:25+02:00atomicity citesdaks kepler provenance workflow <span class="authorEditorList"><a href="/author/Wang">Liqiang Wang</a>, <a href="/author/Lu">Shiyong Lu</a>, <a href="/author/Fei">Xubo Fei</a>, and <a href="/author/Ram">Jeffrey Ram</a> </span><em>Computational Science – ICCS 2007</em> (<em>2007</em>)Sat Oct 11 10:09:25 CEST 2008Computational Science – ICCS 2007244--252A Dataflow-Oriented Atomicity and Provenance System for Pipelined Scientific Workflows2007atomicity citesdaks kepler provenance workflow Scientific workflows have gained great momentum in recent years due to their critical roles in e-Science and cyberinfrastructure applications. However, some tasks of a scientific workflow might fail during execution. A domain scientist might require aregion of a scientific workflow to be “atomic”. Data provenance, which determines the source data that are used to producea data item, is also essential to scientific workflows. In this paper, we propose: (i) an architecture for scientific workflow management systems that supports both provenance and atomicity; (ii) a dataflow-oriented atomicity model that supports the notions of commit and abort; and (iii) a dataflow-oriented provenance model that, in addition to supporting existing provenance graphs and queries, also supportsqueries related to atomicity and failure.SpringerLink - Book Chapterhttp://www.bibsonomy.org/bibtex/2542c043db57c6fb810e9bb67b61117cd/ludaeschludaesch2008-10-01T08:52:29+02:00annotations semantics workflow <span class="authorEditorList"><a href="/author/Bowers">Shawn Bowers</a>, and <a href="/author/Ludäscher">Bertram Ludäscher</a> </span><em>Current Trends in Database Technology – EDBT 2006, </em><em>page 712--723. </em>(<em>2006</em>)Wed Oct 01 08:52:29 CEST 2008Current Trends in Database Technology – EDBT 2006712--723A Calculus for Propagating Semantic Annotations Through Scientific Workflow Queries2006annotations semantics workflow Scientific workflows facilitate automation, reuse, and reproducibility of scientific data management and analysis tasks. Scientific workflows are often modeled as dataflow networks, chaining together processing components (called actors) that query, transform, analyse, and visualize scientific datasets. Semantic annotations relate data and actor schemas withconceptual information from a shared ontology, to support scientific workflow design, discovery, reuse, and validation inthe presence of thousands of potentially useful actors and datasets. However, the creation of semantic annotations is complexand time-consuming. We present a calculus and two inference algorithms to automatically propagate semantic annotations through workflow actors described by relational queries. Given an input annotation α and a query q, forward propagation computes an output annotation α′; conversely, backward propagation infers α from q and α′.SpringerLink - Book Chapter