| 1. |
- André, Karin, et al.
(författare)
-
Assessing the Quality of Knowledge for Adaptation : Experiences From Co-designing Climate Services in Sweden
- 2021
-
Ingår i: Frontiers in Climate. - Lausanne, Switzerland : Frontiers Research Foundation. - 2624-9553. ; 3
-
Tidskriftsartikel (refereegranskat)abstract
- Adaptation to climate change is becoming more urgent, but the wealth of knowledge that informs adaptation planning and decision-making is not used to its full potential. Top-down approaches to knowledge production are identified as one important reason for the gap between science and practice and are criticized for not meeting the needs of intended users. In response to this challenge, there is a growing interest in the creation of user-oriented and actionable climate services to support adaptation. At the same time, recent research suggests that greater efforts are needed to evaluate the effectiveness of knowledge co-production processes and the best criteria by which to gauge the quality of knowledge outcomes, while also considering different stakeholder perspectives. This paper explores these issues through a critical assessment of the quality of knowledge for adaptation generated from a climate services co-design process in two case studies in Sweden. The study draws on experiences from a 5-year research collaboration in which natural and social science researchers, together with local stakeholders, co-designed climate services to support climate adaptation planning and decision-making. The well-established knowledge quality criteria of credibility, legitimacy, saliency, usability, and usefulness remain relevant, but are not sufficient to capture factors relating to whether and how the knowledge actually is applied by climate change adaptation planners and decision-makers. We observe that case-specific circumstances beyond the scope of the co-design process, including the decision-making context as well as non-tangible outcomes, also play crucial roles that should be accounted for in the knowledge assessment processes.
|
|
| 2. |
- Hall, David, et al.
(författare)
-
Generation of Synthetic XML for Evaluation of Hybrid XML Systems
- 2010
-
Ingår i: Database Systems for Advanced Applications. - Heidelberg : Springer. - 9783642042041 ; , s. 191-202
-
Bokkapitel (övrigt vetenskapligt/konstnärligt)abstract
- This book constitutes the workshop proceedings of the 14th International Conference on Database Systems for Advanced Applications, DASFAA 2009, held in Brisbane, Australia, in April 2009. The volume contains six workshops, each focusing on specific research issues that contribute to the main themes of the DASFAA conference: The First International Workshop on Benchmarking of XML and Semantic Web Applications (BenchmarkX'09); The Second International Workshop on Managing Data Quality in Collaborative Information Systems (MCIS'09); The 1st International Workshop on Data and Process Provenance (WDPP'09); The First International Workshop on Privacy-Preserving Data Analysis (PPDA'09); The First International Workshop on Mobile Business Collaboration (MBC'09); and the First Ph.D. Workshop.
|
|
| 3. |
- Köhn, Dagmar, et al.
(författare)
-
A method for Semi-automatic Standard Integration in Systems Biology
- 2008
-
Ingår i: Database and Expert Systems Applications,2008. - Heidelberg, Germany : Springer. - 9783540856535 - 9783540856542 ; , s. 745-752
-
Konferensbidrag (refereegranskat)abstract
- The development of standards for biological pathways has led to a huge amount of model data stored in a variety of different formats represented in XML (e. g. SBML) or OWL (e. g. BioPAX). As a result, there is an urgent need for the conversion of data between different formats, especially between XML and OWL data. The fact that that transformation is hard to realize hampers the integration of data in the area. Addressing this problem, the following article proposes a general, semi-automatic solution by suggesting the transformation of XML Schema based data into an OWL format. The general solution presented here will support biologists by offering them a way to query data of any format and as well compare different data files or schemas to each other using OWL as a common format for matching and providing a backwards transformation to XML Schema. The paper presents a first architectural approach and its prototype implementation. The evaluation showed that the approach is promising.
|
|
| 4. |
|
|
| 5. |
|
|
| 6. |
- Strömbäck, Lena, 1966-
(författare)
-
A classification for comparing standardized XML data
- 2006
-
Ingår i: Database and Expert Systems Applications, 2006. DEXA '06. - Los Alamitos, CA, USA : IEEE Computer Society. - 0769526411 ; , s. 517-524
-
Konferensbidrag (refereegranskat)abstract
- The increasing amount of XML data provided via the Web imposes a large need for efficient data exchange and import. This has led to an increasing interest in XML standards within a large number of areas. However, in most application domains there are several competing standards capturing the same kind of information. This work presents a method for classification and comparison of standards within an area. The method can be applied to XML-standards in any domain. We report on the situation for two different areas, molecular interactions and digital television and use our method to compare the standards within the two domains. The classification gives information on how similar the standards are, in terms of information content and structure. This information is useful for deciding which kind of methods are interesting for providing automatic matching and efficient development of tools for import of standardised data
|
|
| 7. |
|
|
| 8. |
- Strömbäck, Lena, 1966-, et al.
(författare)
-
An Extension of XQuery for Graph Analysis of Biological Pathways
- 2009
-
Ingår i: Proc. The First International Conference on Advances in Databases, Knowledge, and Data Applications, DBKDA 2009. - 9780769535500 ; , s. 22-27
-
Konferensbidrag (refereegranskat)abstract
- The vast quantity of scientific data produced in life sciences demands the use of sophisticated storage and analysis techniques. In particular, for biological pathways graph analysis plays an important role and data is commonly available in XML-based formats. Thus, there is a growing need to make analysis capabilities available through query languages for XML. This paper presents an approach to extend XQuery for graph analysis with focus on data for biological pathways. A graph model is introduced within the XQuery environment. New built-in functions define the available operations on the graph model. XQuery expressions can be utilized to populate graphs with data and execute graph algorithms. Graph data and results of algorithms can be accessed in an XML representation for further processing. In addition, a reference mechanism can be used to preserve associations from graph data to the original XML data. The approach has been implemented as an extension to exist. First evaluations of the implementation show that the introduced approach is practical and efficient for reaction networks with several thousand vertices and edges.
|
|
| 9. |
- Strömbäck, Lena, 1966-
(författare)
-
Possibilities and Challenges Using XML Technology for Storage and Integration of Molecular Interactions
- 2005
-
Ingår i: International Workshop on Database and Expert Systems Applications DEXA05,2005. - Los Alamitos, CA, USA : IEEE Computer Society. ; , s. 575-
-
Konferensbidrag (refereegranskat)abstract
- The amount of data emerging from experiments on molecular and protein interactions is rapidly growing. It is of high importance to understand these datasets, putting them together to meaningful pathways describing some aspects of the cell physiology. Currently, there is a big interest in XML representations of protein interaction and molecular pathways. New standards, SBML, PSI MI and BioPAX are under development and it is of high importance to build tools for easy integration and analysis of data represented in these standards. There are currently two main approaches for storage of data represented within XML, one is to base the tools directly on XML while the other is to translate the information into a relational database. In this paper we report on experiments with these approaches for storage and analysis of molecular interaction data represented in the standards. The results give important pointers to the possibility of building easy to use tools.
|
|
| 10. |
- Strömbäck, Lena, 1966-
(författare)
-
Studies in extended unification-based formalism for linguistic description : an algorithm for feature structures with disjunction and a proposal for flexible systems
- 1992
-
Licentiatavhandling (övrigt vetenskapligt/konstnärligt)abstract
- Unification-based formalisms have been used in computational and traditional linguistics for quite some while. In these formalisms the feature structure is the basic structure for representing linguistic information. However, these structures often do not suffice for describing linguistic phenomena and various extensions to the basic structures have been proposed. These extensions constitute the subject of this thesis.The thesis contains a survey of the extensions proposed in the literature. The survey is concluded by stating the properties that are most important if we want to build a system that can handle as many of the extensions as possible. These properties are expressiveness, flexibility, efficiency and predictability. The thesis also evaluates four existing formalisms with respect to these properties. On the basis of the evaluation we also suggest how to design a system handling multiple extensions where the main emphasis have been laid on getting a flexible system.As the main result the thesis specifies an algorithm for unifying disjunctive feature structures. Unlike previous algorithms, except Eisele & Dörre (1990), this algorithm is as fast as an algorithm without disjunction when disjunctions do not participate in the unification, it is also as fast as an algorithm handling only local disjunctions when there are only local disjunctions, and expensive only in the case of unifying full disjunction. By this behaviour the algorithm shows one way to avoid the problem that high expressiveness also gives low efficiency. The description is given in the framework of graph unification algorithms which makes it easy to implement as an extension of such an algorithm
|
|
