umu.sePublications
Change search
Refine search result
2345678 201 - 250 of 1839
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Rows per page
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sort
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
Select
The maximal number of hits you can export is 250. When you want to export more records please use the Create feeds function.
  • 201.
    Björklund, Henrik
    et al.
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Drewes, Frank
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Ericson, Petter
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Parsing Weighted Order-Preserving Hyperedge Replacement Grammars2018Report (Other academic)
    Abstract [en]

    We introduce a weighted extension of the recently proposed notion of order-preserving hyperedge-replacement grammars and prove that the weight of a graph according to such a weighted graph grammar can be computed uniformly in quadratic time (under assumptions made precise in the paper).

  • 202.
    Björklund, Henrik
    et al.
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Drewes, Frank
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Ericson, Petter
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Starke, Florian
    Faculty of Computer Science, TU Dresden.
    Uniform Parsing for Hyperedge Replacement Grammars2018Report (Other academic)
    Abstract [en]

    It is well known that hyperedge-replacement grammars can generate NP-complete graph languages even under seemingly harsh restrictions. This means that the parsing problem is difficult even in the non-uniform setting, in which the grammar is considered to be fixed rather than being part of the input. Little is known about restrictions under which truly uniform polynomial parsing is possible. In this paper we propose a low-degree polynomial-time algorithm that solves the uniform parsing problem for a restricted type of hyperedge-replacement grammars which we expect to be of interest for practical applications.

  • 203.
    Björklund, Henrik
    et al.
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Ericson, Petter
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    A note on the complexity of deterministic tree-walking transducers2013In: Non-Classical Models of Automata and Applications (NCMA 2013), Österreichische Computer Gesellschaft , 2013Conference paper (Refereed)
  • 204.
    Björklund, Henrik
    et al.
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Gelade, Wouter
    Marquardt, Marcel
    Martens, Wim
    Incremental XPath Evaluation2009In: Proceedings of the 12th international conference on database theory: March 23-25, 2009, Saint Petersbourgh, Russia / [ed] Ronald Fagin, 2009, p. 162-173Conference paper (Refereed)
    Abstract [en]

    We study the problem of incrementally maintaining an XPath query on an XML database under updates. The updates we consider are node insertion, node deletion, and node relabeling. Our main results are that downward XPath queries can be incrementally maintained in time O(depth(D) · poly(Q)) and conjunctive forward XPath queries in time O(depth(D)· log(width(D))·poly(Q)), where D is the size of the database, Q the size of the query, and depth(D) and width(D) are the nesting depth and maximum number of siblings in the database, respectively. The auxiliary data structures for maintenance are linear in D and polynomial in Q in all these cases.

  • 205.
    Björklund, Henrik
    et al.
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Gelade, Wouter
    Martens, Wim
    Incremental XPath evaluation2010In: ACM Transactions on Database Systems, ISSN 0362-5915, E-ISSN 1557-4644, Vol. 35, no 4:29, p. 42-Article in journal (Refereed)
    Abstract [en]

    Incremental view maintenance for XPath queries asks to maintain a materialized XPath view over an XML database. It assumes an underlying XML database D and a query Q. One is given a sequence of updates U to D, and the problem is to compute the result of Q(U(D)): the result of evaluating query Q on database D after having applied updates U. This article initiates a systematic study of the Boolean version of this problem. In the Boolean version, one only wants to know whether Q(U(D)) is empty or not.

    In order to quickly answer this question, we are allowed to maintain an auxiliary data structure. The complexity of the maintenance algorithms is measured in, (1) the size of the auxiliary data structure, (2) the worst-case time per update needed to compute Q(U(D)), and (3) the worst-case time per update needed to bring the auxiliary data structure up to date. We allow three kinds of updates: node insertion, node deletion, and node relabeling. Our main results are that downward XPath queries can be incrementally maintained in time O(depth(D)·poly(|Q|)) per update and conjunctive forward XPath queries in time O(depth(D) · log(width(D))·poly(|Q|)) per update, where |Q| is the size of the query, and depth(D) and width(D) are the nesting depth and maximum number of siblings in database D, respectively. The auxiliary data structures for maintenance are linear in |D| and polynomial in |Q| in all these cases.

  • 206.
    Björklund, Henrik
    et al.
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Martens, Wim
    The tractability frontier for NFA minimization2012In: Journal of computer and system sciences (Print), ISSN 0022-0000, E-ISSN 1090-2724, Vol. 78, no 1, p. 198-210Article in journal (Refereed)
    Abstract [en]

    We prove that minimizing finite automata is NP-hard for almost all classes of automata that extend the class of deterministic finite automata. More specifically, we show that minimization is NP-hard for all finite automata classes that subsume the class of δNFAs which accept strings of length at most three. Here, δNFAs are the finite automata that are unambiguous, allow at most one state q with a non-deterministic transition for at most one alphabet symbol a, and are allowed to visit state q at most once in a run. As a corollary, we also obtain that the same result holds for all finite automata classes that subsume that class of finite automata that are unambiguous, have at most two initial states, and accept strings of length at most two.

  • 207.
    Björklund, Henrik
    et al.
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Martens, Wim
    Schweikardt, Nicole
    Schwentick, Thomas
    Logik und Automaten: Ein echtes Dreamteam2010In: Informatik-Spektrum, ISSN 0170-6012, E-ISSN 1432-122X, Vol. 33, no 5, p. 452-461Article, review/survey (Other (popular science, discussion, etc.))
  • 208.
    Björklund, Henrik
    et al.
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Martens, Wim
    Schwentick, Thomas
    Conjunctive query containment over trees using schema information2018In: Acta Informatica, ISSN 0001-5903, E-ISSN 1432-0525, Vol. 55, no 1, p. 17-56Article in journal (Refereed)
    Abstract [en]

    We study the containment, satisfiability, and validity problems for conjunctive queries over trees with respect to a schema. We show that conjunctive query containment and validity are 2EXPTIME -complete with respect to a schema, in both cases where the schema is given as a DTD or as a tree automaton. Furthermore, we show that satisfiability for conjunctive queries with respect to a schema can be decided in NP . The problem is NP -hard already for queries using only one kind of axis. Finally, we consider conjunctive queries that can test for equalities and inequalities of data values. Here, satisfiability and validity are decidable, but containment is undecidable, even without schema information. On the other hand, containment with respect to a schema becomes decidable again if the "larger" query is not allowed to use both equalities and inequalities.

  • 209.
    Björklund, Henrik
    et al.
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Martens, Wim
    University of Bayreuth.
    Schwentick, Thomas
    Technical University of Dortmund.
    Validity of Tree Pattern Queries with Respect to Schema Information2013In: Mathematical Foundations of Computer Science 2013: 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013. Proceedings / [ed] Krishnendu Chatterjee, Jiri Sgall, Springer: Springer Berlin/Heidelberg, 2013, p. 171-182Conference paper (Refereed)
    Abstract [en]

    We prove that various containment and validity problems for tree pattern queries with respect to a schema are EXPTIME-complete. When one does not require the root of a tree pattern query to match the root of atree, validity of a non-branching tree pattern query with respect to a Relax NG schema or W3C XML Schema is already EXPTIME-hard when the query does not branch and uses only child axes. These hardness results already hold when the alphabet size is fixed. Validity with respect to a DTD is proved to be EXPTIME-hard already when the query only uses child axes and is allowed to branch only once.

  • 210.
    Björklund, Henrik
    et al.
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Martens, Wim
    Universität Bayreuth.
    Timm, Thomas
    Universität Bayreuth.
    Efficient incremental evaluation of succinct regular expressions2015In: Proceedings of the 24th ACM International on Conference on Information and Knowledge Management, Association for Computing Machinery (ACM), 2015, p. 1541-1550Conference paper (Refereed)
    Abstract [en]

    Regular expressions are omnipresent in database applications. They form the structural core of schema languages for XML, they are a fundamental ingredient for navigational queries in graph databases, and are being considered in languages for upcoming technologies such as schema- and transformation languages for tabular data on the Web. In this paper we study the usage and effectiveness of the counting operator (or: limited repetition) in regular expressions. The counting operator is a popular extension which is part of the POSIX standard and therefore also present in regular expressions in grep, Java, Python, Perl, and Ruby. In a database context, expressions with counting appear in XML Schema and languages for querying graphs such as SPARQL 1.1 and Cypher.

    We first present a practical study that suggests that counters are extensively used in practice. We then investigate evaluation methods for such expressions and develop a new algorithm for efficient incremental evaluation. Finally, we conduct an extensive benchmark study that shows that exploiting counting operators can lead to speed-ups of several orders of magnitude in a wide range of settings: normal and incremental evaluation on synthetic and real expressions.

  • 211.
    Björklund, Henrik
    et al.
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Schuster, Martin
    Technische Universität Dortmund.
    Schwentick, Thomas
    Technische Universität Dortmund.
    Kulbatzki, Joscha
    SCISYS Deutschland GmbH.
    On optimum left-to-right strategies for active context-free games2013In: ICDT '13 Proceedings of the 16th International Conference on Database Theory, ACM Press, 2013, p. 105-116Conference paper (Refereed)
    Abstract [en]

    Active context-free games are two-player games on strings over finite alphabets with one player trying to rewrite the input string to match a target specification. These games have been investigated in the context of exchanging Active XML (AXML) data. While it was known that the rewriting problem is undecidable in general, it is shown here that it is EXPSPACE-complete to decide for a given contextfree game, whether all safely rewritable strings can be safely rewritten in a left-to-right manner, a problem that was previously considered by Abiteboul et al. Furthermore, it is shown that the corresponding problem for games with finite replacement languages is EXPTIME-complete.

  • 212.
    Björklund, Henrik
    et al.
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Schwentick, Thomas
    On notions of regularity for data languages2010In: Theoretical Computer Science, ISSN 0304-3975, E-ISSN 1879-2294, Vol. 411, no 4-5, p. 702-715Article in journal (Refereed)
    Abstract [en]

    With motivation from considerations in XML database theory and model checking, data strings have been introduced as an extension of finite alphabet strings which carry, at each position, a symbol and a data value from an infinite domain. Previous work has shown that it is difficult to come up with an expressive yet decidable automaton model for data languages. Recently, such a model, data automata, was introduced. This paper introduces a simpler but equivalent model and investigates its expressive power, algorithmic and closure properties, and some extensions.

  • 213.
    Björklund, Johanna
    et al.
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Cleophas, Loek
    Umeå University, Faculty of Science and Technology, Department of Computing Science. Stellenbosch University, ZA-7602 Matieland, South Africa.
    A Taxonomy of Minimisation Algorithms for Deterministic Tree Automata2016In: Journal of universal computer science (Online), ISSN 0948-695X, E-ISSN 0948-6968, Vol. 22, no 2, p. 180-196Article in journal (Refereed)
    Abstract [en]

    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.

  • 214.
    Björklund, Johanna
    et al.
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Cleophas, Loek
    Umeå University, Faculty of Science and Technology, Department of Computing Science. Department of Information Science, Stellenbosch University, Stellenbosch, South Africa.
    Minimization of Finite State Automata Through Partition Aggregation2017In: Language and Automata Theory and Applications: 11th International Conference, LATA 2017, Umeå, Sweden, March 6-9, 2017, Proceedings / [ed] Drewes, F Martin-Vide, C Truthe, B, Springer International Publishing AG , 2017, p. 223-235Conference paper (Refereed)
    Abstract [en]

    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.

  • 215.
    Björklund, Johanna
    et al.
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Cleophas, Loek
    Umeå University, Faculty of Science and Technology, Department of Computing Science. Department of Information Science, Stellenbosch University, Stellenbosch, South Africa.
    Minimization of Finite State Automata Through Partition Aggregation2016In: Logical Aspects of Computational Linguistics: Celebrating 20 Years of LACL (1996–2016) / [ed] Amblard, M DeGroote, P Pogodalla, S Retore, C, SPRINGER-VERLAG BERLIN , 2016, p. 328-328Conference paper (Refereed)
  • 216.
    Björklund, Johanna
    et al.
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Cleophas, Loek
    Stellenbosch University, Republic of South Africa.
    Karlsson, My
    Umeå University, Faculty of Science and Technology, High Performance Computing Center North (HPC2N). Codemill.
    An evaluation of structured language modeling for automatic speech recognition2017In: Journal of universal computer science (Online), ISSN 0948-695X, E-ISSN 0948-6968, Vol. 23, no 11, p. 1019-1034Article in journal (Refereed)
    Abstract [en]

    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.

  • 217.
    Björklund, Johanna
    et al.
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Drewes, Frank
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Jonsson, Anna
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    A Comparison of Two N-Best Extraction Methods for Weighted Tree Automata2018In: Implementation and Application of Automata: 23rd International Conference, CIAA 2018, Charlottetown, PE, Canada, July 30 – August 2, 2018, Proceedings, Springer, 2018, p. 197-108Conference paper (Refereed)
    Abstract [en]

    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.

  • 218.
    Björklund, Johanna
    et al.
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Drewes, Frank
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Jonsson, Anna
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Finding the N Best Vertices in an Infinite Weighted Hypergraph2017In: Theoretical Computer Science, ISSN 0304-3975, E-ISSN 1879-2294, Vol. 682, p. 78p. 30-41Article in journal (Refereed)
    Abstract [en]

    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. 

  • 219.
    Björklund, Johanna
    et al.
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Drewes, Frank
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Jonsson, Anna
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    On the N best problem for hypergraphs2016In: / [ed] A. Maletti, 2016Conference paper (Other academic)
    Abstract [en]

    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.

  • 220.
    Björklund, Johanna
    et al.
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Drewes, Frank
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Satta, Giorgio
    University of Padova, Italy.
    Z-Automata for Compact and Direct Representation of Unranked Tree Languages2019In: Implementation and Application of Automata: 24th International Conference, CIAA 2019 Košice, Slovakia, July 22–25, 2019, Proceedings / [ed] Michal Hospodár, Galina Jirásková, Springer, 2019, p. 83-94Conference paper (Refereed)
    Abstract [en]

    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.

  • 221.
    Björklund, Johanna
    et al.
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Drewes, Frank
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Zechner, Niklas
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    An efficient best-trees algorithm for weighted tree automata over the tropical semiring2015In: Proc. 9th International Conference on Language and Automata Theory and Applications / [ed] Adrian-Horia Dediu, Enrico Formenti, Carlos Martín-Vide, and Bianca Truthe, Springer, 2015, p. 97-108Conference paper (Refereed)
    Abstract [en]

    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.

  • 222.
    Björklund, Johanna
    et al.
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Drewes, Frank
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Zechner, Niklas
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Efficient enumeration of weighted tree languages over the tropical semiring2019In: Journal of computer and system sciences (Print), ISSN 0022-0000, E-ISSN 1090-2724, Vol. 104, p. 78p. 119-130Article in journal (Refereed)
    Abstract [en]

    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. 

  • 223.
    Björklund, Johanna
    et al.
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Fernau, Henning
    Trier University.
    Kasprzik, Anna
    Trier University.
    MAT Learning of Universal Automata2013In: Language and Automata Theory and Applications: 7th International Conference, LATA 2013, Bilbao, Spain, April 2-5, 2013. Proceedings / [ed] Adrian-Horia Dediu, Carlos Martín-Vide, Bianca Truthe, Springer Berlin/Heidelberg, 2013, p. 141-152Conference paper (Refereed)
    Abstract [en]

    A MAT learning algorithm is presented that infers the universal automaton (UA) for a regular target language, using a polynomial number of queries with respect to that automaton. The UA is one of several canonical characterizations for regular languages. Our learner is based on the concept of an observation table, which seems to be particularly fitting for this computational model, and the necessary notions and definitions are adapted from the literature to the case of UA.

  • 224.
    Björklund, Johanna
    et al.
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Johansson Falck, Marlene
    Umeå University, Faculty of Arts, Department of language studies.
    How Spatial Relations Structure Linguistic Meaning2019In: Proceedings of the 15th SweCog Conference / [ed] Holm, Linus & Erik Billing, Skövde: University of Skövde , 2019, p. 29-31Conference paper (Refereed)
  • 225.
    Björklund, Johanna
    et al.
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Jönsson, Eric
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Kaati, Lisa
    Swedish Defence Research Institute.
    Aspects of plan operators in a tree automata framework2012In: 2012 15th International Conference on Information Fusion (FUSION), IEEE , 2012, p. 1462-1467Conference paper (Refereed)
    Abstract [en]

    Plan recognition addresses the problem of inferring an agents goals from its action. Applications range from anticipating care-takers’ needs to predicting volatile situations. In this contribution, we describe a prototype plan recognition system that is based on the well-researched theory of (weighted) finite tree automata. To illustrate the system’s capabilities, we use data gathered from matches in the real-time strategy game StarCraft II. Finally, we discuss how more advanced plan operators can be accommodated for in this framework while retaining computational efficiency by taking after the field of formal model checking and over-approximating the target language.

  • 226.
    Björklund, Johanna
    et al.
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Zechner, Niklas
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Syntactic methods for topic-independent authorship attribution2017In: Natural Language Engineering, ISSN 1351-3249, E-ISSN 1469-8110, Vol. 23, no 5, p. 789-806Article in journal (Refereed)
    Abstract [en]

    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.

  • 227.
    Björklund, Johanna
    et al.
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Öhman, Lars-Daniel
    Umeå University, Faculty of Science and Technology, Department of Mathematics and Mathematical Statistics.
    Simulation relations for pattern matching in directed graphs2013In: Theoretical Computer Science, ISSN 0304-3975, E-ISSN 1879-2294, Vol. 485, p. 1-15Article in journal (Refereed)
    Abstract [en]

    We consider the problem of finding the occurrences of a pattern tree t in a directed graph g, and propose two algorithms, one for preprocessing and one for searching for t in g. It is assumed that the object graph itself is large and static, and that the pattern tree is small and frequently updated. To model varying abstraction levels in the data, we work with partially ordered alphabets and compute simulation relations rather than equivalence relations. In particular, vertices and edges are labelled with elements from a pair of preorders instead of unstructured alphabets. Under the above assumptions, we obtain a search algorithm that runs in time O(height (t) . vertical bar t vertical bar . vertical bar(V-g(+/-)t/R-g(+/-)t vertical bar(2)) where vertical bar (V-g(+/-)t/R-g(+/-)t)vertical bar is the number of equivalence classes in the coarsest simulation relation R-g(+/-)t on the graph g((+/-))t, the disjoint union of g and t. This means that the size of the object graph only affects the running time of the search algorithm indirectly, because of the groundwork done by the preprocessing routine in time O(k . vertical bar g vertical bar . vertical bar(V-g/R-g)vertical bar(2)), where vertical bar(V-g/R-g) is the number of equivalence classes in the coarsest simulation relation R-g on g, taking k = vertical bar V-g vertical bar(2) in the general case and k = height (g) if g is acyclic.

  • 228.
    Björklund, Per
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Visualisation of a simulated dispersion cloud based on a stochastic particle modelling and Volume Rendering in OpenGL2012Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
    Abstract [en]

    When visualising a natural phenomena, such as a gas cloud, the constant movement and turbulens can pose a complex problem. With the use of a stochastic particle dispersion model a gas cloud is simulated and stored in a datafile. This thesis report describes some possible methods on how to structure and render such a datafile in an effective and realistic manner. This is achieved by using interpolation, the octree data structure and volume rendering.

    The end product will be used in a larger project at FOI, with the goal to facilitate the training of personal. Three different rendering methods are implemented and compared against each other. The best one will build the foundation for the FOI project. The end result of this report shows that the methods could be used with satisfying results but more development is needed.

  • 229.
    Björkstrand, David
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    LEARNING SCENE SPECIFIC RECONSTRUCTION OF MONTE CARLO PATH TRACED IMAGE SEQUENCES WITHOUT ADDITIONAL CLEAN DATA2019Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
    Abstract [en]

    When using deep learning models for reconstruction of one path per pixel Monte Carlo path traced image sequences, reconstruction of unseen features can be a concern. Th‘is can be solved by training the model on the same scene it is supposed to reconstruct images from. Learning to specialize with additional clean targets would be extremely time consuming, instead training with additional noisy targets saves time as additional noisy images is tremendously faster to render. ‘This thesis shows that a model trained without clean targets on the same scene it is reconstructing images from can under certain conditions out performa model trained on clean targets from diff‚erent scenes. It also shows that €first training a model on clean targets followed by noisy targets can help with instability issues one can encounter when only training with noisy targets. Lastly, the thesis shows how there is not much of an improvement going from 400 to 1000 training examples or going from noisy targets rendered with one path per pixel to targets rendered with eight paths per pixel.

  • 230. Blain, H.
    et al.
    Masud, T.
    Dargent-Molina, P.
    Martin, F. C.
    Rosendahl, Erik
    Umeå University, Faculty of Medicine, Department of Community Medicine and Rehabilitation, Physiotherapy.
    van der Velde, N.
    Bousquet, J.
    Benetos, A.
    Cooper, C.
    Kanis, J. A.
    Reginster, J. Y.
    Rizzoli, R.
    Cortet, B.
    Barbagallo, M.
    Dreinhöfer, K.
    Vellas, B.
    Maggi, S.
    Strandberg, T.
    Alvarez, M. N.
    Annweiler, C.
    Bernard, P. -L
    Beswetherick, N.
    Bischoff-Ferrari, H. A.
    Bloch, F.
    Boddaert, J.
    Bonnefoy, M.
    Bousson, V.
    Bourdel-Marchasson, I.
    Capisizu, A.
    Che, H.
    Clara, J. G.
    Combe, B.
    Delignieres, D.
    Eklund, Patrik
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Emmelot-Vonk, M.
    Freiberger, E.
    Gauvain, J. -B
    Goswami, N.
    Guldemond, N.
    Herrero, A. C.
    Joel, M. -E
    Jonsdottir, A. B.
    Kemoun, G.
    Kiss, I.
    Kolk, H.
    Kowalski, M. L.
    Krajcik, S.
    Kutsal, Y. G.
    Lauretani, F.
    Macijauskiene, J.
    Mellingsaeter, M.
    Morel, J.
    Mourey, F.
    Nourashemi, F.
    Nyakas, C.
    Puisieux, F.
    Rambourg, P.
    Ramirez, A. G.
    Rapp, K.
    Rolland, Y.
    Ryg, J.
    Sahota, O.
    Snoeijs, S.
    Stephan, Y.
    Thomas, E.
    Todd, C.
    Treml, J.
    Adachi, R.
    Agnusdei, D.
    Body, J. -J
    Breuil, V.
    Bruyere, O.
    Burckardt, P.
    Cannata-Andia, J. B.
    Carey, J.
    Chan, D. -C
    Chapuis, L.
    Chevalley, T.
    Cohen-Solal, M.
    Dawson-Hughes, B.
    Dennison, E. M.
    Devogelaer, J. -P
    Fardellone, P.
    Feron, J. -M
    Perez, A. D.
    Felsenberg, D.
    Glueer, C.
    Harvey, N.
    Hiligsman, M.
    Javaid, M. K.
    Jorgensen, N. R.
    Kendler, D.
    Kraenzlin, M.
    Laroche, M.
    Legrand, E.
    Leslie, W. D.
    Lespessailles, E.
    Lewiecki, E. M.
    Nakamura, T.
    Papaioannou, A.
    Roux, C.
    Silverman, S.
    Henriquez, M. S.
    Thomas, T.
    Vasikaran, S.
    Watts, N. B.
    Weryha, G.
    A comprehensive fracture prevention strategy in older adults: the European union geriatric medicine society (EUGMS) statement2016In: European Geriatric Medicine, ISSN 1878-7649, E-ISSN 1878-7657, Vol. 7, no 6, p. 519-525Article in journal (Refereed)
    Abstract [en]

    Prevention of fragility fractures in older people has become a public health priority, although the most appropriate and cost-effective strategy remains unclear. In the present statement, the Interest group on falls and fracture prevention of the European union geriatric medicine society (EUGMS), in collaboration with the International association of gerontology and geriatrics for the European region (IAGG-ER), the European union of medical specialists (EUMS), the Fragility fracture network (FFN), the International osteoporosis foundation (IOF) - European society for clinical and economic aspects of osteoporosis and osteoarthritis (ECCEO), outlines its views on the main points in the current debate in relation to the primary and secondary prevention of falls, the diagnosis and treatment of bone fragility, and the place of combined falls and fracture liaison services for fracture prevention in older people.

  • 231.
    Blomström, Karl
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Benchmarking an artificial neural network tuned by a genetic algorithm2012Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
    Abstract [en]

    This thesis starts with a brief introduction to neural networks and the tuning of neural networks using genetic algorithms. An improved genetic algorithm is benchmarked using the technical paper Proben1 as a starting point. The benefits of using a genetic algorithm as well as results of the benchmark tests in comparison to a resilient backpropagation algorithm are discussed. The improved genetic algorithm is not a universal solution to all classification problems. Even though it outperforms  the resilient backpropagation algorithm slightly in these benchmark tests more benchmarking on more vast solution domains must be performed.

  • 232.
    Blum, Johannes
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    DAG Automata - Variants, Languages and Properties2015Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
    Abstract [en]

    We study final-state automata that work on directed acyclic graphs (DAGs). We consider ordered and unordered DAGs and show that they can be simulated by each other. Then we show that deterministic DAG automata are weaker then nondeterministic automata. Some properties of recognizable DAG languages are presented and the decidability of the finiteness problem is shown. Finally we compare tree and DAG automata and show that the path language of a DAG language is regular by proving that the tree unfolding of a DAG language preserves recognizability.

  • 233.
    Blum, Johannes
    et al.
    University of Würzburg.
    Drewes, Frank
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Language Theoretic Properties of Regular DAG Languages2019In: Information and Computation, ISSN 0890-5401, E-ISSN 1090-2651, Vol. 265, p. 78p. 57-76Article in journal (Refereed)
    Abstract [en]

    We study sets of directed acyclic graphs, called regular DAG languages, which are accepted by a recently introduced type of DAG automata motivated by current developments in natural language processing. We prove (or disprove) closure properties, establish pumping lemmata, characterize finite regular DAG languages, and show that "unfolding" turns regular DAG languages into regular tree languages, which implies a linear growth property and the regularity of the path languages of regular DAG languages. Further, we give polynomial decision algorithms for the emptiness and finiteness problems, and show that deterministic DAG automata can be minimized and tested for equivalence in polynomial time.

  • 234.
    Blum, Johannes
    et al.
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Drewes, Frank
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Properties of Regular DAG Languages2016In: Proc. 10th International Conference on Language and Automata Theory and Applications (LATA 2016) / [ed] A.H. Dediu, J. Janoušek, C. Martín-Vide, and B. Truthe, Springer Publishing Company, 2016, p. 427-438Conference paper (Refereed)
    Abstract [en]

    A DAG is a directed acyclic graph. We study the properties of DAG automata and their languages, called regular DAG languages. In particular, we prove results resembling pumping lemmas and show that the finiteness problem for regular DAG languages is in P.

  • 235.
    Blusi, Madeleine
    et al.
    Umeå University, Faculty of Medicine, Department of Community Medicine and Rehabilitation. Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Nieves, Juan Carlos
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Feasibility and Acceptability of Smart Augmented Reality Assisting Patients with Medication Pillbox Self-Management2019In: Studies in Health Technology and Informatics, ISSN 0926-9630, E-ISSN 1879-8365, p. 521-525Article in journal (Refereed)
    Abstract [en]

    Complex prescribed medicine regimens require extensive self-management. Handling multiple pills can be confusing; using a pillbox organiser is a common strategy. A smart Medication Coach Intelligent Agent (MCIA) can support patients in handling medicine. The aim of this research was to evaluate the feasibility and acceptability of the MCIA. A prototype was tested with 15 participants, age 17-76, filled a pillbox according to prescription assisted by the MCIA implemented in a Microsoft HoloLens. A quantitative method using questionnaires was applied. Results showed that using the MCIA implemented in an AR-headset, to assist people with prescribed polypharmacy regimen in filling a pillbox, was feasible and acceptable. There was a difference related to age regarding people's willingness to use an AR-headset for medication self-management. People older than 65 felt less comfortable using the technology and were also more hesitant to use the technology than those under 65.

  • 236.
    Blusi, Madeleine
    et al.
    Umeå University, Faculty of Science and Technology, Department of Computing Science. Umeå University, Faculty of Medicine, Department of Community Medicine and Rehabilitation, Occupational Therapy.
    Nilsson, Ingeborg
    Umeå University, Faculty of Medicine, Department of Community Medicine and Rehabilitation, Occupational Therapy.
    Lindgren, Helena
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Older adults co-creating meaningful individualized social activities online for healthy ageing2018In: Building continents of knowledge in oceans of data: The future of co-created eHealth / [ed] Adrien Ugon, Daniel Karlsson, Gunnar O. Klein, Anne Moen, IOS Press, 2018, Vol. 247, p. 775-779Chapter in book (Refereed)
    Abstract [en]

    Social isolation and loneliness among older people is a growing problem with negative effects on physical and mental health. In co-creation with older adults individualized social activities were designed where older adults through computer mediated communication were able to participate in social activities without leaving their homes. Four types of activities were designed; outdoor activity, music event, visiting a friend and leisure activity. A participatory action research design was applied, where end users together with scientists from two research fields developed, tested and evaluated online participation in the activities. Usability and safety of the systems were major concerns among older adults. The evaluation pointed out that level of simplicity, usability and audio-video quality determined the level of satisfaction with the human interaction during the activity, thereby affecting the meaningfulness of the activity. The research presented in this paper constitutes the first step in a long-term research process aiming at developing a digital coaching system that gives older adults personalized support for increasing participation in meaningful social activities.

  • 237.
    Bohlin, Victor
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Visual Special Relativity2010Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
    Abstract [en]

    Albert Einstein predicted in 1905 with his paper on special relativity the signi cantvisual eects of objects moving close to the speed of light. Einstein could not see them then but with todays graphical hardware it is possible to produce these eects in real time in a computer simulation. In this thesis the implementation, results and comparison of two techniques for doing this are presented. The two techniques dier substantially in how they execute the task. One alters the vertex positions of the objects and the other performs the eects as a post process step using a cube map. The results of the two techniques are generally the same,both having dierent advantages and disadvantages.

  • 238.
    Boketoft, Carl-Ola
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Web Content ManagementSystem Powered by Ajax2010Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
    Abstract [en]

    This master thesis is about the development of a web site for three restaurants in South Korea. For the maintenance and updating of the contents of the web site a CMS (Content Management System) was developed. The major part of the work was conducted in South Korea and in close collaboration with the owners of the restaurants in order to improve communication possibilities and to be able to gather materials for the project.A theoretical study was conducted to acquire knowledge about the web development technique Ajax, both from a programming view and how to use it for improving usability of the web site functions.From the results of the theoretical study, methods were chosen and applied into a detailed conceptual model of the web site. This model was used as a base for the implementation of the web site pages and content management functions.The resulting implementation of the web site is based on a common structure for the dierent pages, with contents available in both English and Korean. The updating of the contents is done by Ajax enhanced functions in the CMS, which also contains functions for image uploading, text editing, and layout management.

  • 239.
    Boman, Jakob
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Tree Species ClassicationUsing Terrestrial Photogrammetry2013Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
    Abstract [en]

    This thesis investigates how texture classification can be used to automatically classify tree species from image of bark texture. The texture analysis methods evaluated in the thesis are, grey level co-occurrence matrix (GLCM), two different wavelet texture analysis methods and finally the scale-invariant feature transform. To evaluate the methods two classifiers, a linear support vector machine (SVM) and a kernel based import vector machine (IVM) was used. The tree species that were classified were Scotch Pine and Norwegian Spruce and the auxiliary class ground. Three experiments were conducted to test the methods. The experiments used subimages of bark extracted from terrestrial photogrammetry images. For each sub-image, the X ,Y and Z coordinates were available. Thefirst experiment compared the methods by classifying each sub-image individually based on image data alone. In the second experiment the spatial data was added. Additionally feature selection was performed in both experiments to determine the most discriminating features. In the final experiment individual trees were classified by clustering all data from each tree.For sub-image classification, the addition of spatial data increased the overall accuracy for the best method from 75.7% to 94.9% The best method was IVM on GLCM textural features. The most discriminating textural feature was homogeneity in the horizontal direction. The best methods to classify individual trees were SVM with GLCM with an overall accuracy of 88%.In summary, the methods was found to be promising for tree bark classification. However, the individual tree results were based on a low number of trees. To establish the methods' true usefulness, testing on a larger number of trees is necessary.

  • 240.
    Bonemark, Oscar
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Success factors for e-sport games2013In: Proceedings of Umeå's 16th student conference in computing science: USCCS 2013 / [ed] Suna Bensch & Frank Drewes, Umeå: Umeå universitet , 2013, p. 1-12Conference paper (Other academic)
    Abstract [en]

    Some multiplayer video games rise to become successful inthe field of e-sports. This paper tries to find out why this is the case.We compare a set of seven video game properties with six establishede-sport games in an attempt to find out whether there are propertiesof multiplayer video games that all established e-sport games have incommon.

  • 241. Bontsema, J.
    et al.
    Hemming, J.
    Pekkeriet, E.
    Saeys, W.
    Edan, Y.
    Shapiro, A.
    Hočevar, M.
    Hellström, Thomas
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Oberti, R.
    Armada, M.
    Ulbrich, H.
    Baur, J.
    Debilde, B.
    Best, S.
    Evain, S.
    Gauchel, W.
    Ringdahl, Ola
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    CROPS: high tech agricultural robots2014Conference paper (Other academic)
  • 242. Bontsema, Jan
    et al.
    Hemming, Jochen
    Pekkeriet, Erik
    Saeys, Wouter
    Edan, Yael
    Shapiro, Amir
    Hočevar, Marko
    Oberti, Roberto
    Armada, Manuel
    Ulbrich, Heinz
    Baur, Jörg
    Debilde, Benoit
    Best, Stanley
    Evain, Sébastien
    Gauchel, Wolfgang
    Hellström, Thomas
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Ringdahl, Ola
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    CROPS: Clever Robots for Crops2015In: Engineering & Technology Reference, ISSN 2056-4007, Vol. 1, no 1Article in journal (Refereed)
    Abstract [en]

    In the EU-funded CROPS project robots are developed for site-specific spraying and selective harvesting of fruit and fruit vegetables. The robots are being designed to harvest crops, such as greenhouse vegetables, apples, grapes and for canopy spraying in orchards and for precision target spraying in grape vines. Attention is paid to the detection of obstacles for autonomous navigation in a safe way in plantations and forests. For the different applications, platforms were built. Sensing systems and vision algorithms have been developed. For software the Robot Operating System is used. A 9 degrees of freedom manipulator was designed and tested for sweet-pepper harvesting, apple harvesting and in close range spraying. For the applications different end-effectors were designed and tested. For sweet pepper a platform that can move in between the crop rows on the common greenhouse rail system which also serves as heating pipes was built. The apple harvesting platform is based on a current mechanical grape harvester. In discussion with growers so-called ‘walls of fruit trees’ have been designed which bring robots closer to the practice. A canopy-optimised sprayer has been designed as a trailed sprayer with a centrifugal blower. All the applications have been tested under practical conditions.

  • 243.
    Borlin, Niclas
    et al.
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Rohrl, S. M.
    Bragdon, C. R.
    RSA wear measurements with or without markers in total hip arthroplasty2006In: Journal of Biomechanics, Vol. 39, no 9, p. 1641-1650Article in journal (Refereed)
    Abstract [en]

    Novel algorithms for radiostereometric (RSA) measurements of the femoral head and metal-backed, hemi-spherical cups of a total hip replacement are presented and evaluated on phantom images and clinical double examinations of 20 patients. The materials were analysed with classical RSA and three novel algorithms: (1) a dual-projection head algorithm using the outline of the femoral head together with markers in the cup; (2) a marker-less algorithm based on measurements of the outline of the femoral head, the cup shell and opening circle of the cup; and (3) a combination of both methods. The novel algorithms improve current, marker-based, RSA measurements, as well as allows studies without marked cups. This opens the possibility of performing wear measurements on larger group of patients, in clinical follow-ups, even retrospective studies. The novel algorithms may help to save patient data in current RSA studies lost due to insufficiently marked cups. Finally, the novel algorithms simplify the RSA procedure and allow new studies without markers, saving time, money, and reducing safety concerns. Other potential uses include migration measurements of re-surfacing heads and measuring spherical sections as implant landmarks instead of markers. (c) 2005 Elsevier Ltd. All rights reserved.

  • 244. Bosner, Nela
    et al.
    Karlsson, Lars
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Parallel and Heterogeneous $m$-Hessenberg-Triangular-Triangular Reduction2017In: SIAM Journal on Scientific Computing, ISSN 1064-8275, E-ISSN 1095-7197, Vol. 39, no 1, p. C29-C47Article in journal (Refereed)
    Abstract [en]

    The m-Hessenberg-triangular-triangular (mHTT) reduction is a simultaneous orthogonal reduction of three matrices to condensed form. It has applications, for example, in solving shifted linear systems arising in various control theory problems. A new heterogeneous CPU/GPU implementation of the mHTT reduction is presented and evaluated against an existing CPU implementation. The algorithm offloads the compute-intensive matrix-matrix multiplications to the GPU and keeps the inner loop, which is memory intensive and has a complicated control flow, on the CPU. Experiments demonstrate that the heterogeneous implementation can be superior to the existing CPU implementation on a system with 2 x 8 CPU cores and one GPU. Future development should focus on improving the scalability of the CPU computations.

  • 245.
    Boström, Ludvig
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Reducing cost of volatile risk estimates on financial instruments in a cloud environment2018Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
    Abstract [en]

    Performing high accuracy risk calculations on financial instruments is a computationally heavy task. Since a day can contain a lot of different events that change the stock prices, it is important that these risk calculations are done in real time. Deploying a system to calculate real time risk in a cloud environment would result in high costs because of the heavy calculations that needs to be performed. This thesis is a practical continuation of a previous master thesis written by Sara Ekman [1]. Ekman proposed different strategies to reduce the amount of recalculations while still having real time precision on the risk values. In this thesis the strategies covering European options and Futures are implemented and tested over several days, with a goal of reducing the cost of a daily run by 5%, compared to using constant intervals. Some strategies upheld the goal in simulations but did however loose accuracy. The strategies that performed the best, under tested conditions, was the strategies that did not consider any scenarios when evaluating if recalculations had to be made.

  • 246. Bousquet, J
    et al.
    Bewick, M
    Cano, A
    Eklund, Patrik
    Umeå University, Faculty of Science and Technology, Department of Computing Science. Four Computing Oy, Helsinki, Finland.
    Fico, G
    Goswami, N
    Guldemond, N A
    Henderson, D
    Hinkema, M J
    Liotta, G
    Mair, A
    Molloy, W
    Monaco, A
    Monsonis-Paya, I
    Nizinska, A
    Papadopoulos, H
    Pavlickova, A
    Pecorelli, S
    Prados-Torres, A
    Roller-Wirnsberger, R E
    Somekh, D
    Vera-Muñoz, C
    Visser, F
    Farrell, J
    Malva, J
    Andersen Ranberg, K
    Camuzat, T
    Carriazo, A M
    Crooks, G
    Gutter, Z
    Iaccarino, G
    Manuel de Keenoy, E
    Moda, G
    Rodriguez-Mañas, L
    Vontetsianos, T
    Abreu, C
    Alonso, J
    Alonso-Bouzon, C
    Ankri, J
    Arredondo, M T
    Avolio, F
    Bedbrook, A
    Białoszewski, A Z
    Blain, H
    Bourret, R
    Cabrera-Umpierrez, M F
    Catala, A
    O'Caoimh, R
    Cesari, M
    Chavannes, N H
    Correia-da-Sousa, J
    Dedeu, T
    Ferrando, M
    Ferri, M
    Fokkens, W J
    Garcia-Lizana, F
    Guérin, O
    Hellings, P W
    Haahtela, T
    Illario, M
    Inzerilli, M C
    Lodrup Carlsen, K C
    Kardas, P
    Keil, T
    Maggio, M
    Mendez-Zorrilla, A
    Menditto, E
    Mercier, J
    Michel, J P
    Murray, R
    Nogues, M
    O'Byrne-Maguire, I
    Pappa, D
    Parent, A S
    Pastorino, M
    Robalo-Cordeiro, C
    Samolinski, B
    Siciliano, P
    Teixeira, A M
    Tsartara, S I
    Valiulis, A
    Vandenplas, O
    Vasankari, T
    Vellas, B
    Vollenbroek-Hutten, M
    Wickman, M
    Yorgancioglu, A
    Zuberbier, T
    Barbagallo, M
    Canonica, G W
    Klimek, L
    Maggi, S
    Aberer, W
    Akdis, C
    Adcock, I M
    Agache, I
    Albera, C
    Alonso-Trujillo, F
    Angel Guarcia, M
    Annesi-Maesano, I
    Apostolo, J
    Arshad, S H
    Attalin, V
    Avignon, A
    Bachert, C
    Baroni, I
    Bel, E
    Benson, M
    Bescos, C
    Blasi, F
    Barbara, C
    Bergmann, K C
    Bernard, P L
    Bonini, S
    Bousquet, P J
    Branchini, B
    Brightling, C E
    Bruguière, V
    Bunu, C
    Bush, A
    Caimmi, D P
    Calderon, M A
    Canovas, G
    Cardona, V
    Carlsen, K H
    Cesario, A
    Chkhartishvili, E
    Chiron, R
    Chivato, T
    Chung, K F
    d'Angelantonio, M
    De Carlo, G
    Cholley, D
    Chorin, F
    Combe, B
    Compas, B
    Costa, D J
    Costa, E
    Coste, O
    Coupet, A-L
    Crepaldi, G
    Custovic, A
    Dahl, R
    Dahlen, S E
    Demoly, P
    Devillier, P
    Didier, A
    Dinh-Xuan, A T
    Djukanovic, R
    Dokic, D
    Du Toit, G
    Dubakiene, R
    Dupeyron, A
    Emuzyte, R
    Fiocchi, A
    Wagner, A
    Fletcher, M
    Fonseca, J
    Fougère, B
    Gamkrelidze, A
    Garces, G
    Garcia-Aymeric, J
    Garcia-Zapirain, B
    Gemicioğlu, B
    Gouder, C
    Hellquist-Dahl, B
    Hermosilla-Gimeno, I
    Héve, D
    Holland, C
    Humbert, M
    Hyland, M
    Johnston, S L
    Just, J
    Jutel, M
    Kaidashev, I P
    Khaitov, M
    Kalayci, O
    Kalyoncu, A F
    Keijser, W
    Kerstjens, H
    Knezović, J
    Kowalski, M
    Koppelman, G H
    Kotska, T
    Kovac, M
    Kull, I
    Kuna, P
    Kvedariene, V
    Lepore, V
    MacNee, W
    Maggio, M
    Magnan, A
    Majer, I
    Manning, P
    Marcucci, M
    Marti, T
    Masoli, M
    Melen, E
    Miculinic, N
    Mihaltan, F
    Milenkovic, B
    Millot-Keurinck, J
    Mlinarić, H
    Momas, I
    Montefort, S
    Morais-Almeida, M
    Moreno-Casbas, T
    Mösges, R
    Mullol, J
    Nadif, R
    Nalin, M
    Navarro-Pardo, E
    Nekam, K
    Ninot, G
    Paccard, D
    Pais, S
    Palummeri, E
    Panzner, P
    Papadopoulos, N K
    Papanikolaou, C
    Passalacqua, G
    Pastor, E
    Perrot, M
    Plavec, D
    Popov, T A
    Postma, D S
    Price, D
    Raffort, N
    Reuzeau, J C
    Robine, J M
    Rodenas, F
    Robusto, F
    Roche, N
    Romano, A
    Romano, V
    Rosado-Pinto, J
    Roubille, F
    Ruiz, F
    Ryan, D
    Salcedo, T
    Schmid-Grendelmeier, P
    Schulz, H
    Schunemann, H J
    Serrano, E
    Sheikh, A
    Shields, M
    Siafakas, N
    Scichilone, N
    Siciliano, P
    Skrindo, I
    Smit, H A
    Sourdet, S
    Sousa-Costa, E
    Spranger, O
    Sooronbaev, T
    Sruk, V
    Sterk, P J
    Todo-Bom, A
    Touchon, J
    Tramontano, D
    Triggiani, M
    Tsartara, S I
    Valero, A L
    Valovirta, E
    van Ganse, E
    van Hage, M
    van den Berge, M
    Vandenplas, O
    Ventura, M T
    Vergara, I
    Vezzani, G
    Vidal, D
    Viegi, G
    Wagemann, M
    Whalley, B
    Wickman, M
    Wilson, N
    Yiallouros, P K
    Žagar, M
    Zaidi, A
    Zidarn, M
    Hoogerwerf, E J
    Usero, J
    Zuffada, R
    Senn, A
    de Oliveira-Alves, B
    Building Bridges for Innovation in Ageing: Synergies between Action Groups of the EIP on AHA2017In: The Journal of Nutrition, Health & Aging, ISSN 1279-7707, E-ISSN 1760-4788, Vol. 21, no 1, p. 92-104Article in journal (Refereed)
    Abstract [en]

    The Strategic Implementation Plan of the European Innovation Partnership on Active and Healthy Ageing (EIP on AHA) proposed six Action Groups. After almost three years of activity, many achievements have been obtained through commitments or collaborative work of the Action Groups. However, they have often worked in silos and, consequently, synergies between Action Groups have been proposed to strengthen the triple win of the EIP on AHA. The paper presents the methodology and current status of the Task Force on EIP on AHA synergies. Synergies are in line with the Action Groups' new Renovated Action Plan (2016-2018) to ensure that their future objectives are coherent and fully connected. The outcomes and impact of synergies are using the Monitoring and Assessment Framework for the EIP on AHA (MAFEIP). Eight proposals for synergies have been approved by the Task Force: Five cross-cutting synergies which can be used for all current and future synergies as they consider overarching domains (appropriate polypharmacy, citizen empowerment, teaching and coaching on AHA, deployment of synergies to EU regions, Responsible Research and Innovation), and three cross-cutting synergies focussing on current Action Group activities (falls, frailty, integrated care and chronic respiratory diseases).

  • 247. Bousquet, J
    et al.
    Hellings, P W
    Agache, I
    Bedbrook, A
    Bachert, C
    Bergmann, K C
    Bewick, M
    Bindslev-Jensen, C
    Bosnic-Anticevitch, S
    Bucca, C
    Caimmi, D P
    Camargos, P A M
    Canonica, G W
    Casale, T
    Chavannes, N H
    Cruz, A A
    De Carlo, G
    Dahl, R
    Demoly, P
    Devillier, P
    Fonseca, J
    Fokkens, W J
    Guldemond, N A
    Haahtela, T
    Illario, M
    Just, J
    Keil, T
    Klimek, L
    Kuna, P
    Larenas-Linnemann, D
    Morais-Almeida, M
    Mullol, J
    Murray, R
    Naclerio, R
    O'Hehir, R E
    Papadopoulos, N G
    Pawankar, R
    Potter, P
    Ryan, D
    Samolinski, B
    Schunemann, H J
    Sheikh, A
    Simons, F E R
    Stellato, C
    Todo-Bom, A
    Tomazic, P V
    Valiulis, A
    Valovirta, E
    Ventura, M T
    Wickman, M
    Young, I
    Yorgancioglu, A
    Zuberbier, T
    Aberer, W
    Akdis, C A
    Akdis, M
    Annesi-Maesano, I
    Ankri, J
    Ansotegui, I J
    Anto, J M
    Arnavielhe, S
    Asarnoj, A
    Arshad, H
    Avolio, F
    Baiardini, I
    Barbara, C
    Barbagallo, M
    Bateman, E D
    Beghé, B
    Bel, E H
    Bennoor, K S
    Benson, M
    Białoszewski, A Z
    Bieber, T
    Bjermer, L
    Blain, H
    Blasi, F
    Boner, A L
    Bonini, M
    Bonini, S
    Bosse, I
    Bouchard, J
    Boulet, L P
    Bourret, R
    Bousquet, P J
    Braido, F
    Briggs, A H
    Brightling, C E
    Brozek, J
    Buhl, R
    Bunu, C
    Burte, E
    Bush, A
    Caballero-Fonseca, F
    Calderon, M A
    Camuzat, T
    Cardona, V
    Carreiro-Martins, P
    Carriazo, A M
    Carlsen, K H
    Carr, W
    Cepeda Sarabia, A M
    Cesari, M
    Chatzi, L
    Chiron, R
    Chivato, T
    Chkhartishvili, E
    Chuchalin, A G
    Chung, K F
    Ciprandi, G
    de Sousa, J Correia
    Cox, L
    Crooks, G
    Custovic, A
    Dahlen, S E
    Darsow, U
    Dedeu, T
    Deleanu, D
    Denburg, J A
    De Vries, G
    Didier, A
    Dinh-Xuan, A T
    Dokic, D
    Douagui, H
    Dray, G
    Dubakiene, R
    Durham, S R
    Du Toit, G
    Dykewicz, M S
    Eklund, Patrik
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    El-Gamal, Y
    Ellers, E
    Emuzyte, R
    Farrell, J
    Fink Wagner, A
    Fiocchi, A
    Fletcher, M
    Forastiere, F
    Gaga, M
    Gamkrelidze, A
    Gemicioğlu, B
    Gereda, J E
    van Wick, R Gerth
    González Diaz, S
    Grisle, I
    Grouse, L
    Gutter, Z
    Guzmán, M A
    Hellquist-Dahl, B
    Heinrich, J
    Horak, F
    Hourihane, J O' B
    Humbert, M
    Hyland, M
    Iaccarino, G
    Jares, E J
    Jeandel, C
    Johnston, S L
    Joos, G
    Jonquet, O
    Jung, K S
    Jutel, M
    Kaidashev, I
    Khaitov, M
    Kalayci, O
    Kalyoncu, A F
    Kardas, P
    Keith, P K
    Kerkhof, M
    Kerstjens, H A M
    Khaltaev, N
    Kogevinas, M
    Kolek, V
    Koppelman, G H
    Kowalski, M L
    Kuitunen, M
    Kull, I
    Kvedariene, V
    Lambrecht, B
    Lau, S
    Laune, D
    Le, L T T
    Lieberman, P
    Lipworth, B
    Li, J
    Lodrup Carlsen, K C
    Louis, R
    Lupinek, C
    MacNee, W
    Magar, Y
    Magnan, A
    Mahboub, B
    Maier, D
    Majer, I
    Malva, J
    Manning, P
    De Manuel Keenoy, E
    Marshall, G D
    Masjedi, M R
    Mathieu-Dupas, E
    Maurer, M
    Mavale-Manuel, S
    Melén, E
    Melo-Gomes, E
    Meltzer, E O
    Mercier, J
    Merk, H
    Miculinic, N
    Mihaltan, F
    Milenkovic, B
    Millot-Keurinck, J
    Mohammad, Y
    Momas, I
    Mösges, R
    Muraro, A
    Namazova-Baranova, L
    Nadif, R
    Neffen, H
    Nekam, K
    Nieto, A
    Niggemann, B
    Nogueira-Silva, L
    Nogues, M
    Nyembue, T D
    Ohta, K
    Okamoto, Y
    Okubo, K
    Olive-Elias, M
    Ouedraogo, S
    Paggiaro, P
    Pali-Schöll, I
    Palkonen, S
    Panzner, P
    Papi, A
    Park, H S
    Passalacqua, G
    Pedersen, S
    Pereira, A M
    Pfaar, O
    Picard, R
    Pigearias, B
    Pin, I
    Plavec, D
    Pohl, W
    Popov, T A
    Portejoie, F
    Postma, D
    Poulsen, L K
    Price, D
    Rabe, K F
    Raciborski, F
    Roberts, G
    Robalo-Cordeiro, C
    Rodenas, F
    Rodriguez-Mañas, L
    Rolland, C
    Roman Rodriguez, M
    Romano, A
    Rosado-Pinto, J
    Rosario, N
    Rottem, M
    Sanchez-Borges, M
    Sastre-Dominguez, J
    Scadding, G K
    Scichilone, N
    Schmid-Grendelmeier, P
    Serrano, E
    Shields, M
    Siroux, V
    Sisul, J C
    Skrindo, I
    Smit, H A
    Solé, D
    Sooronbaev, T
    Spranger, O
    Stelmach, R
    Sterk, P J
    Strandberg, T
    Sunyer, J
    Thijs, C
    Triggiani, M
    Valenta, R
    Valero, A
    van Eerd, M
    van Ganse, E
    van Hague, M
    Vandenplas, O
    Varona, L L
    Vellas, B
    Vezzani, G
    Vazankari, T
    Viegi, G
    Vontetsianos, T
    Wagenmann, M
    Walker, S
    Wang, D Y
    Wahn, U
    Werfel, T
    Whalley, B
    Williams, D M
    Williams, S
    Wilson, N
    Wright, J
    Yawn, B P
    Yiallouros, P K
    Yusuf, O M
    Zaidi, A
    Zar, H J
    Zernotti, M E
    Zhang, L
    Zhong, N
    Zidarn, M
    ARIA 2016: Care pathways implementing emerging technologies for predictive medicine in rhinitis and asthma across the life cycle2016In: Clinical and Translational Allergy, ISSN 2045-7022, E-ISSN 2045-7022, Vol. 6, no 47Article in journal (Refereed)
    Abstract [en]

    The Allergic Rhinitis and its Impact on Asthma (ARIA) initiative commenced during a World Health Organization workshop in 1999. The initial goals were (1) to propose a new allergic rhinitis classification, (2) to promote the concept of multi-morbidity in asthma and rhinitis and (3) to develop guidelines with all stakeholders that could be used globally for all countries and populations. ARIA-disseminated and implemented in over 70 countries globally-is now focusing on the implementation of emerging technologies for individualized and predictive medicine. MASK [MACVIA (Contre les Maladies Chroniques pour un Vieillissement Actif)-ARIA Sentinel NetworK] uses mobile technology to develop care pathways for the management of rhinitis and asthma by a multi-disciplinary group and by patients themselves. An app (Android and iOS) is available in 20 countries and 15 languages. It uses a visual analogue scale to assess symptom control and work productivity as well as a clinical decision support system. It is associated with an inter-operable tablet for physicians and other health care professionals. The scaling up strategy uses the recommendations of the European Innovation Partnership on Active and Healthy Ageing. The aim of the novel ARIA approach is to provide an active and healthy life to rhinitis sufferers, whatever their age, sex or socio-economic status, in order to reduce health and social inequalities incurred by the disease.

  • 248. Bousquet, Jean
    et al.
    Hellings, Peter W.
    Agache, Ioana
    Amat, Flore
    Annesi-Maesano, Isabella
    Ansotegui, Ignacio J.
    Anto, Josep M.
    Bachert, Claus
    Bateman, Eric D.
    Bedbrook, Anna
    Bennoor, Kazi
    Bewick, Mickael
    Bindslev-Jensen, Carsten
    Bosnic-Anticevich, Sinthia
    Bosse, Isabelle
    Brozek, Jan
    Brussino, Luisa
    Canonica, Giorgio W.
    Cardona, Victoria
    Casale, Thomas
    Sarabia, Alfonso M. Cepeda
    Chavannes, Niels H.
    Cecchi, Lorenzo
    de Sousa, Jaime Correia
    Costa, Elisio
    Cruz, Alvaro A.
    Czarlewski, Wienczyslawa
    De Carlo, Giuseppe
    De Feo, Giulia
    Demoly, Pascal
    Devillier, Philippe
    Dykewicz, Mark S.
    El-Gamal, Yehia
    Eller, Esben E.
    Fonseca, Joao A.
    Fontaine, Jean-Francois
    Fokkens, Wytske J.
    Guzman, Maria-Antonieta
    Haahtela, Tari
    Illario, Maddalena
    Ivancevich, Juan-Carlos
    Just, Jocelyne
    Kaidashev, Igor
    Khaitov, Musa
    Kalayci, Omer
    Keil, Thomas
    Klimek, Ludger
    Kowalski, Marek L.
    Kuna, Piotr
    Kvedariene, Violeta
    Larenas-Linnemann, Desiree
    Laune, Daniel
    Le, Lan T. T.
    Carlsen, Karin Lodrup
    Lourenco, Olga
    Mahboub, Bassam
    Mair, Alpana
    Menditto, Enrica
    Milenkovic, Branislava
    Morais-Almeida, Mario
    Mosges, Ralph
    Mullol, Joaquim
    Murray, Ruth
    Naclerio, Robert
    Namazova-Baranova, Leyla
    Novellino, Ettore
    O'Hehir, Robyn E.
    Ohta, Ken
    Okamoto, Yoshitaka
    Okubo, Kimi
    Onorato, Gabrielle L.
    Palkonen, Susanna
    Panzner, Petr
    Papadopoulos, Nikos G.
    Park, Hae-Sim
    Paulino, Ema
    Pawankar, Ruby
    Pfaar, Oliver
    Plavec, Davor
    Popov, Ted A.
    Potter, Paul
    Prokopakis, Emmanuel P.
    Rottem, Menachem
    Ryan, Dermot
    Salimaki, Johanna
    Samolinski, Boleslaw
    Sanchez-Borges, Mario
    Schunemann, Holger J.
    Sheikh, Aziz
    Sisul, Juan-Carlos
    Rajabian-Soderlund, Rojin
    Sooronbaev, Talant
    Stellato, Cristiana
    To, Teresa
    Todo-Bom, Ana-Maria
    Tomazic, Peter-Valentin
    Toppila-Salmi, Sanna
    Valero, Antonio
    Valiulis, Arunas
    Valovirta, Erkka
    Ventura, Maria-Teresa
    Wagenmann, Martin
    Wang, De Yun
    Wallace, Dana
    Waserman, Susan
    Wickman, Magnus
    Yorgancioglu, Arzu
    Zhang, Luo
    Zhong, Nanshan
    Zidarn, Mihaela
    Zuberbier, Torsten
    Bousquet, J.
    Hellings, P. W.
    Aberer, W.
    Agache, I.
    Akdis, C. A.
    Akdis, M.
    Alberti, M. R.
    Almeida, R.
    Amat, F.
    Angles, R.
    Annesi-Maesano, I.
    Ansotegui, I. J.
    Anto, J. M.
    Arnavielle, S.
    Asayag, E.
    Asarnoj, A.
    Arshad, H.
    Avolio, F.
    Bacci, E.
    Bachert, C.
    Baiardini, I.
    Barbara, C.
    Barbagallo, M.
    Baroni, I.
    Barreto, B. A.
    Basagana, X.
    Bateman, E. D.
    Bedolla-Barajas, M.
    Bedbrook, A.
    Bewick, M.
    Beghe, B.
    Bel, E. H.
    Bergmann, K. C.
    Bennoor, K. S.
    Benson, M.
    Bertorello, L.
    Biaoszewski, A. Z.
    Bieber, T.
    Bialek, S.
    Bindslev-Jensen, C.
    Bjermer, L.
    Blain, H.
    Blasi, F.
    Blua, A.
    Marciniak, M. Bochenska
    Bogus-Buczynska, I.
    Boner, A. L.
    Bonini, M.
    Bonini, S.
    Bosnic-Anticevich, C. S.
    Bosse, I.
    Bouchard, J.
    Boulet, L. P.
    Bourret, R.
    Bousquet, P. J.
    Braido, F.
    Briedis, V.
    Brightling, C. E.
    Brozek, J.
    Bucca, C.
    Buhl, R.
    Buonaiuto, R.
    Panaitescu, C.
    Cabanas, M. T. Burguete
    Burte, E.
    Bush, A.
    Caballero-Fonseca, F.
    Caillot, D.
    Caimmi, D.
    Calderon, M. A.
    Camargos, P. A. M.
    Camuzat, T.
    Canfora, G.
    Canonica, G. W.
    Cardona, V.
    Carlsen, K. H.
    Carreiro-Martins, P.
    Carriazo, A. M.
    Carr, W.
    Cartier, C.
    Casale, T.
    Castellano, G.
    Cecchi, L.
    Sarabia, A. M. Cepeda
    Chavannes, N. H.
    Chen, Y.
    Chiron, R.
    Chivato, T.
    Chkhartishvili, E.
    Chuchalin, A. G.
    Chung, K. F.
    Ciaravolo, M. M.
    Ciceran, A.
    Cingi, C.
    Ciprandi, G.
    Coehlo, A. C. Carvalho
    Colas, L.
    Colgan, E.
    Coll, J.
    Conforti, D.
    de Sousa, J. Correia
    Cortes-Grimaldo, R. M.
    Corti, F.
    Costa, E.
    Costa-Dominguez, C.
    Courbis, A. L.
    Cox, L.
    Crescenzo, M.
    Cruz, A. A.
    Custovic, A.
    Czarlewski, W.
    Dahlen, S. E.
    Dario, C.
    da Silva, J.
    Dauvilliers, Y.
    Darsow, U.
    De Blay, F.
    De Carlo, G.
    Dedeu, T.
    Emerson, M. de Fatima
    De Feo, G.
    De Vries, G.
    De Martino, B.
    Rubini, N. de Paula Motta
    Deleanu, D.
    Demoly, P.
    Denburg, J. A.
    Devillier, P.
    Ercolano, S. Di Capua
    Di Carluccio, N.
    Didier, A.
    Dokic, D.
    Dominguez-Silva, M. G.
    Douagui, H.
    Dray, G.
    Dubakiene, R.
    Durham, S. R.
    Du Toit, G.
    Dykewicz, M. S.
    El-Gamal, Y.
    Eklund, Patrik
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Eller, E.
    Emuzyte, R.
    Farrell, J.
    Farsi, A.
    de Mello, J. Ferreira, Jr.
    Ferrero, J.
    Fink-Wagner, A.
    Fiocchi, A.
    Fokkens, W. J.
    Fonseca, J. A.
    Fontaine, J. F.
    Forti, S.
    Fuentes-Perez, J. M.
    Galvez-Romero, J. L.
    Gamkrelidze, A.
    Garcia-Aymerich, J.
    Garcia-Cobas, C. Y.
    Garcia-Cruz, M. H.
    Gemicioglu, B.
    Genova, S.
    Christoff, G.
    Gereda, J. E.
    van Wijk, R. Gerth
    Gomez, R. M.
    Gomez-Vera, J.
    Diaz, S. Gonzalez
    Gotua, M.
    Grisle, I.
    Guidacci, M.
    Guldemond, N. A.
    Gutter, Z.
    Guzman, M. A.
    Haahtela, T.
    Hajjam, J.
    Hernandez, L.
    Hourihane, J. O 'B.
    Huerta-Villalobos, Y. R.
    Humbert, M.
    Iaccarino, G.
    Illario, M.
    Ivancevich, J. C.
    Jares, E. J.
    Jassem, E.
    Johnston, S. L.
    Joos, G.
    Jung, K. S.
    Jutel, M.
    Kaidashev, I.
    Kalayci, O.
    Kalyoncu, A. F.
    Karjalainen, J.
    Kardas, P.
    Keil, T.
    Keith, P. K.
    Khaitov, M.
    Khaltaev, N.
    Kleine-Tebbe, J.
    Klimek, L.
    Kowalski, M. L.
    Kuitunen, M.
    Kull, I.
    Kuna, P.
    Kupczyk, M.
    Kvedariene, V.
    Krzych-Fata, E.
    Lacwik, P.
    Larenas-Linnemann, D.
    Laune, D.
    Lauri, D.
    Lavrut, J.
    Le, L. T. T.
    Lessa, M.
    Levato, G.
    Li, J.
    Lieberman, P.
    Lipiec, A.
    Lipworth, B.
    Carlsen, K. C. Lodrup
    Louis, R.
    Lourenco, O.
    Luna-Pech, J. A.
    Maciej, K.
    Magnan, A.
    Mahboub, B.
    Maier, D.
    Mair, A.
    Majer, I.
    Malva, J.
    Mandajieva, E.
    Manning, P.
    Keenoy, E. De Manuel
    Marshall, G. D.
    Masjedi, M. R.
    Maspero, J. F.
    Mathieu-Dupas, E.
    Campos, J. J. Matta
    Matos, A. L.
    Maurer, M.
    Mavale-Manuel, S.
    Mayora, O.
    Medina-Avalos, M. A.
    Melen, E.
    Melo-Gomes, E.
    Meltzer, E. O.
    Menditto, E.
    Mercier, J.
    Miculinic, N.
    Mihaltan, F.
    Milenkovic, B.
    Moda, G.
    Mogica-Martinez, M. D.
    Mohammad, Y.
    Momas, I.
    Montefort, S.
    Monti, R.
    Bogado, D. Mora
    Morais-Almeida, M.
    Morato-Castro, F. F.
    Mosges, R.
    Mota-Pinto, A.
    Santo, P. Moura
    Mullol, J.
    Munter, L.
    Muraro, A.
    Murray, R.
    Naclerio, R.
    Nadif, R.
    Nalin, M.
    Napoli, L.
    Namazova-Baranova, L.
    Neffen, H.
    Niedeberger, V.
    Nekam, K.
    Neou, A.
    Nieto, A.
    Nogueira-Silva, L.
    Nogues, M.
    Novellino, E.
    Nyembue, T. D.
    O'Hehir, R. E.
    Odzhakova, C.
    Ohta, K.
    Okamoto, Y.
    Okubo, K.
    Onorato, G. L.
    Cisneros, M. Ortega
    Ouedraogo, S.
    Pali-Scholl, I.
    Palkonen, S.
    Panzner, P.
    Papadopoulos, N. G.
    Park, H. S.
    Papi, A.
    Passalacqua, G.
    Paulino, E.
    Pawankar, R.
    Pedersen, S.
    Pepin, J. L.
    Pereira, A. M.
    Persico, M.
    Pfaar, O.
    Phillips, J.
    Picard, R.
    Pigearias, B.
    Pin, I.
    Pitsios, C.
    Plavec, D.
    Pohl, W.
    Popov, T. A.
    Portejoie, F.
    Potter, P.
    Pozzi, A. C.
    Price, D.
    Prokopakis, E. P.
    Puy, R.
    Pugin, B.
    Ross, R. E. Pulido
    Przemecka, M.
    Rabe, K. F.
    Raciborski, F.
    Rajabian-Soderlund, R.
    Reitsma, S.
    Ribeirinho, I.
    Rimmer, J.
    Rivero-Yeverino, D.
    Rizzo, J. A.
    Rizzo, M. C.
    Robalo-Cordeiro, C.
    Rodenas, F.
    Rodo, X.
    Gonzalez, M. Rodriguez
    Rodriguez-Manas, L.
    Rolland, C.
    Valle, S. Rodrigues
    Rodriguez, M. Roman
    Romano, A.
    Rodriguez-Zagal, E.
    Rolla, G.
    Roller-Wirnsberger, R. E.
    Romano, M.
    Rosado-Pinto, J.
    Rosario, N.
    Rottem, M.
    Ryan, D.
    Sagara, H.
    Salimaki, J.
    Samolinski, B.
    Sanchez-Borges, M.
    Sastre-Dominguez, J.
    Scadding, G. K.
    Schunemann, H. J.
    Scichilone, N.
    Schmid-Grendelmeier, P.
    Serpa, F. S.
    Shamai, S.
    Sheikh, A.
    Sierra, M.
    Simons, F. E. R.
    Siroux, V.
    Sisul, J. C.
    Skrindo, I.
    Sole, D.
    Somekh, D.
    Sondermann, M.
    Sooronbaev, T.
    Sova, M.
    Sorensen, M.
    Sorlini, M.
    Spranger, O.
    Stellato, C.
    Stelmach, R.
    Stukas, R.
    Sunyer, J.
    Strozek, J.
    Szylling, A.
    Tebyrica, J. N.
    Thibaudon, M.
    To, T.
    Todo-Bom, A.
    Tomazic, P. V.
    Toppila-Salmi, S.
    Trama, U.
    Triggiani, M.
    Ulrik, C. Suppli
    Urrutia-Pereira, M.
    Valenta, R.
    Valero, A.
    Valiulis, A.
    Valovirta, E.
    van Eerd, M.
    van Ganse, E.
    van Hague, M.
    Vandenplas, O.
    Ventura, M. T.
    Vezzani, G.
    Vasankari, T.
    Vatrella, A.
    Verissimo, M. T.
    Viart, F.
    Viegi, M.
    Vicheva, D.
    Vontetsianos, T.
    Wagenmann, M.
    Walker, S.
    Wallace, D.
    Wang, D. Y.
    Waserman, S.
    Werfel, T.
    Westman, M.
    Wickman, M.
    Williams, D. M.
    Williams, S.
    Wilson, N.
    Wright, J.
    Wroczynski, P.
    Yakovliev, P.
    Yawn, B. P.
    Yiallouros, P. K.
    Yorgancioglu, A.
    Yusuf, O. M.
    Zar, H. J.
    Zhang, L.
    Zhong, N.
    Zernotti, M. E.
    Zidarn, M.
    Zuberbier, T.
    Zubrinich, C.
    Zurkuhlen, A.
    Allergic Rhinitis and its Impact on Asthma (ARIA) Phase 4 (2018): Change management in allergic rhinitis and asthma multimorbidity using mobile technology2019In: Journal of Allergy and Clinical Immunology, ISSN 0091-6749, E-ISSN 1097-6825, Vol. 143, no 3, p. 864-879Article in journal (Refereed)
    Abstract [en]

    Allergic Rhinitis and its Impact on Asthma (ARIA) has evolved from a guideline by using the best approach to integrated care pathways using mobile technology in patients with allergic rhinitis (AR) and asthma multimorbidity. The proposed next phase of ARIA is change management, with the aim of providing an active and healthy life to patients with rhinitis and to those with asthma multimorbidity across the lifecycle irrespective of their sex or socioeconomic status to reduce health and social inequities incurred by the disease. ARIA has followed the 8-step model of Kotter to assess and implement the effect of rhinitis on asthma multimorbidity and to propose multimorbid guidelines. A second change management strategy is proposed by ARIA Phase 4 to increase self-medication and shared decision making in rhinitis and asthma multimorbidity. An innovation of ARIA has been the development and validation of information technology evidence-based tools (Mobile Airways Sentinel Network [MASK]) that can inform patient decisions on the basis of a self-care plan proposed by the health care professional.

  • 249. Boustedt, Jonas
    et al.
    Eckerdal, Anna
    McCartney, Robert
    Moström, Jan Erik
    Umeå University, Faculty of Science and Technology, Computing Science.
    Ratcliffe, Mark
    Sanders, Kate
    Zander, Carol
    Threshold Concepts in Computer Science: Do they exist and are they useful2007In: SIGCSE '07: Proceedings of the 38th SIGCSE technical symposium on Computer science education, 2007, p. 504-508Conference paper (Refereed)
  • 250.
    Bragdon, C. R.
    et al.
    Massachusetts General Hospital, Boston, MA.
    Malchau, H.
    Massachusetts General Hospital, Boston, MA.
    Larson, S. L.
    Massachusetts General Hospital, Boston, MA.
    Börlin, Niclas
    Umeå University, Faculty of Science and Technology, Department of Computing Science.
    Kärrholm, J.
    Sahlgrenska University Hospital.
    Harris, W. H.
    Massachusetts General Hospital, Boston, MA.
    Validation of Digital Radiography, for use with Radiostereometric Analysis (RSA) using a Dynamic Phantom Wear Model2002In: Transactions of the Orthopaedics Research Society, ORS , 2002, Vol. 27, p. 1020-1020Conference paper (Other academic)
2345678 201 - 250 of 1839
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf