| 1. |
- Björklund, Henrik, et al.
(författare)
-
Implementing a speech-to-text pipeline on the MICO platform
- 2016
-
Rapport (övrigt vetenskapligt/konstnärligt)abstract
- MICO is an open-source platform for cross-media analysis, querying, and recommendation. It is the major outcome of the European research project Media in Context, and has been contributed to by academic and industrial partners from Germany, Austria, Sweden, Italy, and the UK. A central idea is to group sets of related media objects into multimodal content items, and to process and store these as logical units. The platform is designed to be easy to extend and adapt, and this makes it a useful building block for a diverse set of multimedia applications. To promote the platform and demonstrate its potential, we describe our work on a Kaldi-based speech-recognition pipeline.
|
|
| 2. |
- Björklund, Henrik, et al.
(författare)
-
Minimisation and Characterisation of Order-Preserving DAG Grammars
- 2018
-
Rapport (övrigt vetenskapligt/konstnärligt)abstract
- Order-preserving DAG grammars (OPDGs) is a formalism for processing semantic infor- mation in natural languages [5, 4]. OPDGs are sufficiently expressive to model abstract meaning representations, a graph-based form of semantic representation in which nodes en- code objects and edges relations. At the same time, they allow for efficient parsing in the uniform setting, where both the grammar and subject graph are taken as part of the input.In this article, we introduce an initial algebra semantic for OPDGs, which allows us to view them as regular tree grammars. This makes it possible to transfer a number of results from that domain to OPDGs, both in the unweighted and the weighted case. In particular, we show that deterministic OPDGs can be minimised efficiently, and that they are learnable in the so-called MAT setting. To conclude, we show that the languages generated by OPDGs are MSO-definable.
|
|
| 3. |
- Björklund, Henrik, et al.
(författare)
-
On the Regularity and Learnability of Ordered DAG Languages
- 2017
-
Ingår i: Implementation and Application of Automata. - Cham : Springer International Publishing. - 9783319601335 - 9783319601342 ; , s. 27-39
-
Konferensbidrag (refereegranskat)abstract
- Order-Preserving DAG Grammars (OPDGs) is a subclass of Hyper-Edge Replacement Grammars that can be parsed in polynomial time. Their associated class of languages is known as Ordered DAG Lan- guages, and the graphs they generate are characterised by being acyclic, rooted, and having a natural order on their nodes. OPDGs are useful in natural-language processing to model abstract meaning representa- tions. We state and prove a Myhill-Nerode theorem for ordered DAG languages, and translate it into a MAT-learning algorithm for the same class. The algorithm infers a minimal OPDG G for the target language in time polynomial in G and the samples provided by the MAT oracle.
|
|
| 4. |
- Ahlgren, Serina, et al.
(författare)
-
Review of methodological choices in LCA of biorefinery systems - key issues and recommendations
- 2015
-
Ingår i: Biofuels, Bioproducts and Biorefining. - : Wiley. - 1932-1031 .- 1932-104X. ; 9:5, s. 606-619
-
Forskningsöversikt (refereegranskat)abstract
- The current trend in biomass conversion technologies is toward more efficient utilization of biomass feedstock in multiproduct biorefineries. Many life-cycle assessment (LCA) studies of biorefinery systems have been performed but differ in how they use the LCA methodology. Based on a review of existing LCA standards and guidelines, this paper provides recommendations on how to handle key methodological issues when performing LCA studies of biorefinery systems. Six key issues were identified: (i) goal definition, (ii) functional unit, (iii) allocation of biorefinery outputs, (iv) allocation of biomass feedstock, (v) land use, and (vi) biogenic carbon and timing of emissions. Many of the standards and guidelines reviewed here provide only general methodological recommendations. Some make more specific methodological recommendations, but these often differ between standards. In this paper we present some clarifications (e.g. examples of research questions and suitable functional units) and methodological recommendations (e.g. on allocation).
|
|
| 5. |
- Aichroth, Patrick, et al.
(författare)
-
MICO - MEDIA IN CONTEXT
- 2015
-
Ingår i: 2015 IEEE International Conference on Multimedia & Expo Workshops (ICMEW). - 9781479970797
-
Konferensbidrag (refereegranskat)abstract
- The abundance of digital content requires cost-effective technologies to extract the hidden meaning from media objects. However, current approaches fail to deal with the challenges related to cross-media analysis, metadata publishing, querying and recommendation that are necessary to overcome this challenge. In this paper, we describe the EU project MICO (Media in Context) which aims to provide the necessary technologies based on open-source software (OSS) core components.
|
|
| 6. |
- Belfrage, Kristina, et al.
(författare)
-
Effects of farm size and on-farm landscape heterogeneity on biodiversity-case study of twelve farms in a swedish landscape
- 2015
-
Ingår i: Agroecology and Sustainable Food Systems. - : Informa UK Limited. - 2168-3565 .- 2168-3573. ; 39:2, s. 170-188
-
Tidskriftsartikel (refereegranskat)abstract
- In this study in Sweden, six small (<50 ha) and six large farms (>135 ha) participated. The aims of the study were to a) measure differences between small and large farms regarding on-farm landscape heterogeneity, and b) evaluate relations between on-farm landscape heterogeneity and biodiversity, measured as numbers of breeding bird species, bird territories, butterflies, bumblebees, and herbaceous plant species. Sample area of the same size, placed on each farm, was used for the biodiversity assessments and on-farm landscape heterogeneity studies. On-farm landscape heterogeneity was classified with the Shannon-Wiener diversity index. Linear regression was applied to analyze relationships between on-farm landscape heterogeneity and biodiversity indicators. Multivariate regression was used to analyze relations between single bird species and specific on-farm habitats. Small farms had significantly higher on-farm landscape heterogeneity than large farms. Strong positive relations between on-farm landscape heterogeneity and number of breeding birds, butterflies, and herbaceous plant species were found. Total on-farm landscape heterogeneity seems to be more important for bird diversity than do specific landscape elements. The study indicates that, to increase biodiversity, farm size should be taken into consideration.
|
|
| 7. |
- Bensch, Suna, et al.
(författare)
-
Deterministic Stack Transducers
- 2016
-
Ingår i: Implementation and Application of Automata. - Cham : Springer. - 9783319409450 - 9783319409467 ; , s. 27-38
-
Konferensbidrag (refereegranskat)abstract
- We introduce and investigate stack transducers, which are one-way stack automata with an output tape. A one-way stack automaton is a classical pushdown automaton with the additional ability to move the stack head inside the stack without altering the contents. For stack transducers, we distinguish between a digging and a non-digging mode. In digging mode, the stack transducer can write on the output tape when its stack head is inside the stack, whereas in non-digging mode, the stack transducer is only allowed to emit symbols when its stack head is at the top of the stack. These stack transducers have a motivation from natural language interface applications, as they capture long-distance dependencies in syntactic, semantic, and discourse structures.We study the computational capacity for deterministic digging and non-digging stack transducers, as well as for their non-erasing and checking versions. We finally show that even for the strongest variant of stack transducers the stack languages are regular.
|
|
| 8. |
- Bensch, Suna, et al.
(författare)
-
Deterministic Stack Transducers
- 2017
-
Ingår i: International Journal of Foundations of Computer Science. - : World Scientific Publishing Co. Pte. Ltd.. - 0129-0541. ; 28:5, s. 583-601
-
Tidskriftsartikel (refereegranskat)abstract
- We introduce and investigate stack transducers, which are one-way stack automata with an output tape. A one-way stack automaton is a classical pushdown automaton with the additional ability to move the stack head inside the stack without altering the contents. For stack transducers, we distinguish between a digging and a non-digging mode. In digging mode, the stack transducer can write on the output tape when its stack head is inside the stack, whereas in non-digging mode, the stack transducer is only allowed to emit symbols when its stack head is at the top of the stack. These stack transducers have a motivation from natural-language interface applications, as they capture long-distance dependencies in syntactic, semantic, and discourse structures. We study the computational capacity for deterministic digging and non-digging stack transducers, as well as for their non-erasing and checking versions. We finally show that even for the strongest variant of stack transducers the stack languages are regular.
|
|
| 9. |
- Björklund, Johanna, et al.
(författare)
-
A Comparison of Two N-Best Extraction Methods for Weighted Tree Automata
- 2018
-
Ingår i: Implementation and Application of Automata. - Cham : Springer. - 9783319948126 - 9783319948119 ; , s. 197-108
-
Konferensbidrag (refereegranskat)abstract
- We conduct a comparative study of two state-of-the-art al- gorithms for extracting the N best trees from a weighted tree automaton (wta). The algorithms are Best Trees, which uses a priority queue to structure the search space, and Filtered Runs, which is based on an algorithm by Huang and Chiang that extracts N best runs, implemented as part of the Tiburon wta toolkit. The experiments are run on four data sets, each consisting of a sequence of wtas of increasing sizes. Our conclusion is that Best Trees can be recommended when the input wtas exhibit a high or unpredictable degree of nondeterminism, whereas Filtered Runs is the better option when the input wtas are large but essentially deterministic.
|
|
| 10. |
- Björklund, Johanna, et al.
(författare)
-
A Taxonomy of Minimisation Algorithms for Deterministic Tree Automata
- 2016
-
Ingår i: Journal of universal computer science (Online). - 0948-695X .- 0948-6968. ; 22:2, s. 180-196
-
Tidskriftsartikel (refereegranskat)abstract
- We present a taxonomy of algorithms for minimising deterministic bottom-up tree automata (DTAs) over ranked and ordered trees. Automata of this type and its extensions are used in many application areas, including natural language processing (NLP) and code generation. In practice, DTAs can grow very large, but minimisation keeps things manageable. The proposed taxonomy serves as a unifying framework that makes algorithms accessible and comparable, and as a foundation for efficient implementation. Taxonomies of this type are also convenient for correctness and complexity analysis, as results can frequently be propagated through the hierarchy. The taxonomy described herein covers a broad spectrum of algorithms, ranging from novel to well-studied ones, with a focus on computational complexity.
|
|
| 11. |
- Björklund, Johanna, et al.
(författare)
-
An efficient best-trees algorithm for weighted tree automata over the tropical semiring
- 2015
-
Ingår i: Proc. 9th International Conference on Language and Automata Theory and Applications. - Cham : Springer. ; , s. 97-108
-
Konferensbidrag (refereegranskat)abstract
- We generalise a search algorithm by Mohri and Riley from strings to trees. The original algorithm takes as input a weighted automaton M over the tropical semiring, together with an integer N, and outputs N strings of minimal weight with respect to M. In our setting, M defines a weighted tree language, again over the tropical semiring, and the output is a set of N trees with minimal weight. We prove that the algorithm is correct, and that its time complexity is a low polynomial in N and the relevant size parameters of M.
|
|
| 12. |
- Björklund, Johanna, et al.
(författare)
-
An evaluation of structured language modeling for automatic speech recognition
- 2017
-
Ingår i: Journal of universal computer science (Online). - Graz : Graz university of technology, Institute for information systems computer media IICM. - 0948-695X .- 0948-6968. ; 23:11, s. 1019-1034
-
Tidskriftsartikel (refereegranskat)abstract
- We evaluated probabilistic lexicalized tree-insertion grammars (PLTIGs) on a classification task relevant for automatic speech recognition. The baseline is a family of n-gram models tuned with Witten-Bell smoothing. The language models are trained on unannotated corpora, consisting of 10,000 to 50,000 sentences collected from the English section of Wikipedia. For the evaluation, an additional 150 random sentences were selected from the same source, and for each of these, approximately 3,200 variations were generated. Each variant sentence was obtained by replacing an arbitrary word by a similar word, chosen to be at most 2 character edits from the original. The evaluation task consisted of identifying the original sentence among the automatically constructed (and typically inferior) alternatives. In the experiments, the n-gram models outperformed the PLTIG model on the smaller data set, but as the size of data grew, the PLTIG model gave comparable results. While PLTIGs are more demanding to train, they have the advantage that they assign a parse structure to their input sentences. This is valuable for continued algorithmic processing, for example, for summarization or sentiment analysis.
|
|
| 13. |
|
|
| 14. |
- Björklund, Johanna, 1961-, et al.
(författare)
-
Bottom-up unranked tree-to-graph transducers for translation into semantic graphs
- 2019
-
Ingår i: Proceedings of the 14th International Conference on Finite-State Methods and Natural Language Processing. - : Association for Computational Linguistics. ; , s. 7-17
-
Konferensbidrag (refereegranskat)abstract
- We propose a formal model for translating unranked syntactic trees, such as dependency trees, into semantic graphs. These tree-to-graph transducers can serve as a formal basis of transition systems for semantic parsing which recently have been shown to perform very well, yet hitherto lack formalization. Our model features "extended" rules and an arc-factored normal form, comes with an efficient translation algorithm, and can be equipped with weights in a straightforward manner.
|
|
| 15. |
- Björklund, Johanna, et al.
(författare)
-
Efficient enumeration of weighted tree languages over the tropical semiring
- 2019
-
Ingår i: Journal of computer and system sciences (Print). - : Elsevier BV. - 0022-0000 .- 1090-2724. ; 104, s. 119-130
-
Tidskriftsartikel (refereegranskat)abstract
- We generalise a search algorithm by Mohri and Riley from strings to trees. The original algorithm takes as input a nondeterministic weighted automaton M over the tropical semiring and an integer N, and outputs N strings of minimal weight with respect to M. In our setting, M is a weighted tree automaton, again over the tropical semiring, and the output is a set of N trees with minimal weight in this language. We prove that the algorithm is correct, and that its time complexity is a low polynomial in N and the relevant size parameters of M.
|
|
| 16. |
- Björklund, Johanna, 1961-, et al.
(författare)
-
Exploring the potential of edible forest gardens : experiences from a participatory action research project in Sweden
- 2019
-
Ingår i: Agroforestry Systems. - : Springer. - 0167-4366 .- 1572-9680. ; 93:3, s. 1107-1118
-
Tidskriftsartikel (refereegranskat)abstract
- To meet the environmental challenges that are presently confronting society, the narrow focus on agricultural production needs to be altered to one that places equal value on the generation of crucial ecosystem services. Current research shows that perennial intercropping systems such as agroforestry may be a feasible alternative. Based on studies during the establishment of edible forest gardens in 12 participating farms in Sweden, this paper explores the potential of utilizing multi-strata designs for food production in temperate, highincome countries. Design and species composition of such gardens, types of food they provide, and how they would best fit into the present landscape are discussed. Factors for success and major problems related to the establishment are shared. Potential benefits were found to be closely related to a thorough analysis of the social and ecological contexts before establishment. Characteristics of the site and goals of the garden need to guide species and design choices. If forest garden approaches to food production should contribute to more than local selfsufficiency, the gardens need to increase in scale. Marginal lands and transitions areas between different land uses may be appropriate. Large knowledge gaps concerning potential production, social and economic benefits, and agronomic issues were identified.
|
|
| 17. |
- Björklund, Johanna, et al.
(författare)
-
Finding the N Best Vertices in an Infinite Weighted Hypergraph
- 2017
-
Ingår i: Theoretical Computer Science. - : Elsevier. - 0304-3975 .- 1879-2294. ; 682, s. 30-41
-
Tidskriftsartikel (refereegranskat)abstract
- We propose an algorithm for computing the N best vertices in a weighted acyclic hypergraph over a nice semiring. A semiring is nice if it is finitely-generated, idempotent, and has 1 as its minimal element. We then apply the algorithm to the problem of computing the N best trees with respect to a weighted tree automaton, and complement theoretical correctness and complexity arguments with experimental data. The algorithm has several practical applications in natural language processing, for example, to derive the N most likely parse trees with respect to a probabilistic context-free grammar.
|
|
| 18. |
|
|
| 19. |
|
|
| 20. |
- Björklund, Johanna, 1961-, et al.
(författare)
-
Learning tree languages
- 2016
-
Ingår i: Topics in grammatical inference. - Berlin, Heidelberg : Springer Berlin/Heidelberg. - 9783662483954 - 9783662483930 - 9783662569207 ; , s. 173-214
-
Bokkapitel (refereegranskat)abstract
- Tree languages have proved to be a versatile and rewarding extension of the classical notion of string languages.Many nice applications have been established over the years, in areas such as Natural Language Processing, Information Extraction, and Computational Biology. Although some properties of string languages transfer easily to the tree case, in particular for regular languages, several computational aspects turn out to be harder. It is therefore both of theoretical and of practical interest to investigate howfar and in whatways Grammatical Inference algorithms developed for the string case are applicable to trees. This chapter surveys known results in this direction. We begin by recalling the basics of tree language theory. Then, the most popular learning scenarios and algorithms are presented. Several applications of Grammatical Inference of tree languages are reviewed in some detail. We conclude by suggesting a number of directions for future research.
|
|
| 21. |
- Björklund, Johanna, et al.
(författare)
-
Minimization of Finite State Automata Through Partition Aggregation
- 2017
-
Ingår i: Language and Automata Theory and Applications. - Cham : Springer International Publishing AG. - 9783319537320 - 9783319537337 ; , s. 223-235
-
Konferensbidrag (refereegranskat)abstract
- We present a minimization algorithm for finite state automata that finds and merges bisimulation-equivalent states, identified through partition aggregation. We show the algorithm to be correct and run in time O(n(2)d(2) vertical bar Sigma vertical bar), where n is the number of states of the input automaton M, d is the maximal outdegree in the transition graph for any combination of state and input symbol, and vertical bar Sigma vertical bar is the size of the input alphabet. The algorithm is slower than those based on partition refinement, but has the advantage that intermediate solutions are also language equivalent to M. As a result, the algorithm can be interrupted or put on hold as needed, and the derived automaton is still useful. Furthermore, the algorithm essentially searches for the maximal model of a characteristic formula for M, so many of the optimisation techniques used to gain efficiency in SAT solvers are likely to apply.
|
|
| 22. |
|
|
| 23. |
- Björklund, Johanna, et al.
(författare)
-
On the N best problem for hypergraphs
- 2016
-
Konferensbidrag (övrigt vetenskapligt/konstnärligt)abstract
- We propose an algorithm for computing the $N$ best roots of a weighted hypergraph, in which the weight function is given over an idempotent and multiplicatively monotone semiring. We give a set of conditions that ensures that the weight function is well-defined and that solutions exist. Under these conditions, we prove that the proposed algorithm is correct. This generalizes a previous result for weighted tree automata, and in doing so, broadens the practical applications.
|
|
| 24. |
- Björklund, Johanna, et al.
(författare)
-
Syntactic methods for topic-independent authorship attribution
- 2017
-
Ingår i: Natural Language Engineering. - : CAMBRIDGE UNIV PRESS. - 1351-3249 .- 1469-8110. ; 23:5, s. 789-806
-
Tidskriftsartikel (refereegranskat)abstract
- The efficacy of syntactic features for topic-independent authorship attribution is evaluated, taking a feature set of frequencies of words and punctuation marks as baseline. The features are 'deep' in the sense that they are derived by parsing the subject texts, in contrast to 'shallow' syntactic features for which a part-of-speech analysis is enough. The experiments are made on two corpora of online texts and one corpus of novels written around the year 1900. The classification tasks include classical closed-world authorship attribution, identification of separate texts among the works of one author, and cross-topic authorship attribution. In the first tasks, the feature sets were fairly evenly matched, but for the last task, the syntax-based feature set outperformed the baseline feature set. These results suggest that, compared to lexical features, syntactic features are more robust to changes in topic.
|
|
| 25. |
- Björklund, Johanna, 1961-
(författare)
-
Tree-to-Graph Transductions with Scope
- 2018
-
Ingår i: Developments in Language Theory. DLT 2018.. - Cham : Springer. - 9783319986531 - 9783319986548 ; , s. 133-144
-
Konferensbidrag (refereegranskat)abstract
- High-level natural language processing requires formal languages to represent semantic information. A recent addition of this kind is abstract meaning representations. These are graphs in which nodes encode concepts and edges relations. Node-sharing is common, and cycles occur. We show that the required structures can be generated through the combination of (i) a regular tree grammar, (ii) a sequence of linear top-down tree transducers, and (iii) a fold operator that merges selected nodes. Delimiting the application of the fold operator to connected subgraphs gains expressive power, while keeping the complexity of the associated membership problem in polynomial time.
|
|
| 26. |
- Björklund, Johanna, et al.
(författare)
-
Z-Automata for Compact and Direct Representation of Unranked Tree Languages
- 2019
-
Ingår i: Implementation and Application of Automata. - Cham : Springer. - 9783030236786 - 9783030236793 ; , s. 83-94
-
Konferensbidrag (refereegranskat)abstract
- Unranked tree languages are valuable in natural language processing for modelling dependency trees. We introduce a new type of automaton for unranked tree languages, called Z-automaton, that is tailored for this particular application. The Z-automaton offers a compact form of representation, and unlike the closely related notion of stepwise automata, does not require a binary encoding of its input. We establish an arc-factored normal form, and prove the membership problem of Z-automata in normal form to be in O(mn), where m is the size of the transition table of the Z-automaton and n is the size of the input tree.
|
|
| 27. |
|
|
| 28. |
|
|
| 29. |
|
|
| 30. |
|
|
| 31. |
- Björklund, Niklas, et al.
(författare)
-
Rapid Pest Risk Analysis Xyleborinus attenuatus
- 2017
-
Rapport (övrigt vetenskapligt/konstnärligt)abstract
- This rapid pest risk analysis (PRA) provides a quick assessment of the risks posed by the pest to Sweden, which is the PRA area being assessed. The format is an adapted version of the EPPO Express PRA scheme (EPPO 2012). Definition of terms used as well as the rating scheme and assessments are done in line with the guidance given in the EPPO CAPRA system (EPPO 2011). The likelihood of entry and establishment are assessed considering the current phytosanitary regulation in place with respect to the EU legislation (Council Directive 2000/29/EC). The definition of a quarantine pest follows the regulation (EU) 2016/2031.
|
|
| 32. |
|
|
| 33. |
|
|
| 34. |
|
|
| 35. |
|
|
| 36. |
|
|
| 37. |
|
|
| 38. |
|
|
| 39. |
- Ekberg, Johanna, 1987, et al.
(författare)
-
Analysis of single splats produced by axial suspension plasma spraying
- 2018
-
Ingår i: Surface Engineering. - : Informa UK Limited. - 1743-2944 .- 0267-0844. ; 34:5, s. 407-411
-
Tidskriftsartikel (refereegranskat)abstract
- Axial suspension plasma spraying (ASPS) is a relatively new, innovative technique with which microstructures have been produced that are similar to the ones produced by electron beam physical vapor deposition. They have a columnar structure and consist of nm- and µm-sized pores. However, so far the formation of the microstructure is not fully understood because fragmentation and vaporisation of the liquid significantly affects the deposition process. Analysis of single splats can provide important information on the phenomena controlling the coating formation process and the final coating properties. Therefore, the present study aims at providing first results of 8 wt-% yttria-stabilised zirconia single splats sprayed onto a steel substrate by use of ASPS. Scanning electron microscopy and atomic force microscopy have been used to characterise the splats with respect to appearance, shape, and size distribution.
|
|
| 40. |
|
|
| 41. |
- Jonsson, Anna, 1992-
(författare)
-
Towards semantic language processing
- 2018
-
Licentiatavhandling (övrigt vetenskapligt/konstnärligt)abstract
- The overall goal of the field of natural language processing is to facilitate the communication between humans and computers, and to help humans with natural language problems such as translation. In this thesis, we focus on semantic language processing. Modelling semantics – the meaning of natural language – requires both a structure to hold the semantic information and a device that can enforce rules on the structure to ensure well-formed semantics while not being too computationally heavy. The devices used in natural language processing are preferably weighted to allow for comparison of the alternative semantic interpretations outputted by a device.The structure employed here is the abstract meaning representation (AMR). We show that AMRs representing well-formed semantics can be generated while leaving out AMRs that are not semantically well-formed. For this purpose, we use a type of graph grammar called contextual hyperedge replacement grammar (CHRG). Moreover, we argue that a more well-known subclass of CHRG – the hyperedge replacement grammar (HRG) – is not powerful enough for AMR generation. This is due to the limitation of HRG when it comes to handling co-references, which in its turn depends on the fact that HRGs only generate graphs of bounded treewidth.Furthermore, we also address the N best problem, which is as follows: Given a weighted device, return the N best (here: smallest-weighted, or more intuitively, smallest-errored) structures. Our goal is to solve the N best problem for devices capable of expressing sophisticated forms of semantic representations such as CHRGs. Here, however, we merely take a first step consisting in developing methods for solving the N best problem for weighted tree automata and some types of weighted acyclic hypergraphs.
|
|
| 42. |
- Schaffer, Christina, et al.
(författare)
-
Can Agroforestry Grow beyond Its Niche and Contribute to a Transition towards Sustainable Agriculture in Sweden?
- 2019
-
Ingår i: Sustainability. - : MDPI. - 2071-1050. ; 11:13
-
Tidskriftsartikel (refereegranskat)abstract
- Agroforestry is thought to be an approach that could support agriculture in the transition from a system with sustainability problems to one containing regenerative activities contributing to viable ecosystems and, therefore, sustainability solutions. A transdisciplinary and participatory action research (PAR) group that included farmers approached the development of temperate agroforestry systems in the modern agricultural setting of Sweden through practical experience on 12 farms for collective analysis. The objective was to research potential systems such as edible forest gardens, silvopasture and silvoarable systems to discuss their use and effects as well as scaling possibilities. Knowledge and experiences of challenges and solutions related to the development of agroforestry were identified at both niche and regime levels.
|
|
| 43. |
- Wibault, Johanna, 1978-
(författare)
-
Neck disability in patients with cervical radiculopathy and evaluation of structured postoperative physiotherapy
- 2015
-
Doktorsavhandling (övrigt vetenskapligt/konstnärligt)abstract
- Non-surgical and surgical approaches to treatment are used in patients with cervical radiculopathy (CR) due to disc disease. Overall, good effects of surgery have been reported on arm pain and neurological symptoms. However, the effects on neck functioning are more uncertain. Studies have shown persistent activity limitations; participation restrictions; and impairments in neck-related body functions after surgery. Structured physiotherapy combining neck-specific exercises with a behavioural approach has been suggested as treatment before as well as after surgery to improve clinical outcomes in patients with CR. Randomized clinical trials of postoperative physiotherapy to inform evidence-based clinical guidelines for the treatment of patients with CR are lacking.The overall aim of the thesis was to investigate the additional benefit of structured postoperative physiotherapy combining neck-specific exercises with a behavioural approach compared to standard postoperative approach in patients with CR. A further aim was to evaluate the contribution of different aspects of neck-related body functions and mental functions on preoperative neck disability in these patients.A total of 202 patients with CR who were scheduled for surgery were recruited, and randomized preoperatively to either structured postoperative physiotherapy, or standard postoperative approach. Standard postoperative approach was in accordance with Swedish postoperative care, and may have included pragmatic physiotherapy after surgery when needed. Patients were evaluated with a set of questionnaires and clinical examinations before surgery and at 3 and 6 months after surgery. Outcomes included patient-reported measures of pain, neck functioning, global outcome, clinical evaluation of neckrelated body functions, self-efficacy and coping strategies, as well as expectation fulfilment and enablement. Differences between treatment groups were investigated in complete case and per-protocol approaches (Paper III & IV). A sub-sample of patients with CR who were scheduled for surgery were also compared with neck-healthy individuals for assessment of head repositioning accuracy with a cervical range of motion device (Paper I). In patients with CR who were scheduled for surgery, associations between preoperative measures of neck-related body functions, mental functions, and other contextual factors with patientreported neck disability were studied (Paper II).With the exception of greater expectation fulfilment in patients who received structured postoperative physiotherapy (p = 0.01), there were no differences between the treatment groups in outcomes at 6 months after surgery. There were no differences reported for changes in outcomes from before surgery to 6 months after surgery between the groups, but all outcomes significantly improved from baseline in both groups (p<0.001) (Paper III & IV). However, global outcome and frequency of neck pain improved during the postoperative period only in patients who received structured postoperative physiotherapy (p< 0.01) (Paper III). Six months after surgery, patients with at least 50% attendance to treatment sessions in the structured postoperative physiotherapy group reported less neck pain frequency (p = 0.05), and greater expectation fulfilment (p = 0.001), and enablement (p = 0.04) than those who received standard postoperative approach. These patients also had larger improvements in neck functioning, arm pain and catastrophizing during the rehabilitation period from 3 to 6 months after surgery (p< 0.03). Sixty-one percent of the patients who received standard postoperative approach reported additional use ofpostoperative physiotherapy. These patients had a worse surgical outcome compared with patients who reported no additional use of postoperative physiotherapy. In patients with CR who were scheduled for surgery, larger errors in head repositioning accuracy were found compared to neck-healthy individuals (Paper I). Preoperative measures of neck-related body functions, mental functions and other contextual factors explained 73% of the variance in Neck Disability Index scores in patients with CR who were scheduled for surgery (Paper II).The results may suggest a benefit from combining surgery with structured postoperative physiotherapy in patients with CR. Moreover, the results confirm that neck-specific exercises are tolerated by patients with CR after surgery. However, CR is a heterogeneous condition and specific subgroups of patients are likely to benefit from different interventions. More studies are needed to inform evidence-based clinical guidelines for the treatment of patients with CR. A broader preoperative assessment in patients with CR improved the description of patient-reported neck disability.
|
|
| 44. |
- Zechner, Niklas, 1984-
(författare)
-
A novel approach to text classification
- 2017
-
Doktorsavhandling (övrigt vetenskapligt/konstnärligt)abstract
- This thesis explores the foundations of text classification, using both empirical and deductive methods, with a focus on author identification and syntactic methods. We strive for a thorough theoretical understanding of what affects the effectiveness of classification in general. To begin with, we systematically investigate the effects of some parameters on the accuracy of author identification. How is the accuracy affected by the number of candidate authors, and the amount of data per candidate? Are there differences in how methods react to the changes in parameters? Using the same techniques, we see indications that methods previously thought to be topic-independent might not be so, but that syntactic methods may be the best option for avoiding topic dependence. This means that previous studies may have overestimated the power of lexical methods. We also briefly look for ways of spotting which particular features might be the most effective for classification. Apart from author identification, we apply similar methods to identifying properties of the author, including age and gender, and attempt to estimate the number of distinct authors in a text sample. In all cases, the techniques are proven viable if not overwhelmingly accurate, and we see that lexical and syntactic methods give very similar results. In the final parts, we see some results of automata theory that can be of use for syntactic analysis and classification. First, we generalise a known algorithm for finding a list of the best-ranked strings according to a weighted automaton, to doing the same with trees and a tree automaton. This result can be of use for speeding up parsing, which often runs in several steps, where each step needs several trees from the previous as input. Second, we use a compressed version of deterministic finite automata, known as failure automata, and prove that finding the optimal compression is NP-complete, but that there are efficient algorithms for finding good approximations. Third, we find and prove the derivatives of regular expressions with cuts. Derivatives are an operation on expressions to calculate the remaining expression after reading a given symbol, and cuts are an extension to regular expressions found in many programming languages. Together, these findings may be able to improve on the syntactic analysis which we have seen is a valuable tool for text classification.
|
|
| 45. |
- Öhlund, Erika, et al.
(författare)
-
Managing conflicting goals in pig farming : farmers’ strategies and perspectives on sustainable pig farming in Sweden
- 2017
-
Ingår i: International Journal of Agricultural Sustainability. - : Taylor & Francis. - 1473-5903 .- 1747-762X. ; 5:6, s. 693-707
-
Tidskriftsartikel (refereegranskat)abstract
- Industrial meat production has several negative environmental effects. Governments’ agricultural policies aim for cost efficiency combined with high environmental and animal welfare, which puts farmers in a difficult situation trying to navigate between sometimes contradictory requirements. This paper studies how Swedish pig farmers resolve or cope with conflicting goals in pig farming. We have analysed the regulations governing EU and Swedish pig farming. We have also interviewed five Swedish pig farmers about their views of the different goals of pig farming and strategies for resolving conflicts between the goals of low environmental impact, high animal welfare and enough profitability to continue farming. The greatest divide was between the conventional farmers, who emphasized natural resource efficiency, and the organic farmers who stressed animal welfare, multifunctionality and ecosystem service delivery. We suggest four strategies to contribute to resolving some of the conflicting goals: improve communication about different types of pig farming; use public procurement as a driver towards more sustainable pork production; work towards improving the Common Agricultural Policy, perhaps by implementing payments for ecosystem services or multifunctionality; and finally, decrease the total production of pork to lower the emissions per land unit.
|
|
