mdh.sePublications
Change search
Refine search result
1 - 7 of 7
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.
  • 1.
    Ambainis, A.
    et al.
    University of California, Berkeley, USA.
    Bonner, Richard
    Mälardalen University, Department of Mathematics and Physics.
    Freivalds, R.
    University of Latvia, Latvia.
    Kikuts, A.
    University of Latvia, Latvia.
    Probabilities to Accept Languages by Quantum Finite Automata1999In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): 5th Annual International Conference on Computing and Combinatorics, COCOON 1999; Tokyo; Japan; 26 July 1999 through 28 July 1999; Code 151649, 1999, Vol. 1627, p. 174-183Conference paper (Refereed)
    Abstract [en]

    We construct a hierarchy of regular languages such that the current language in the hierarchy can be accepted by 1-way quantum finite automata with a probability smaller than the corresponding probability for the preceding language in the hierarchy. These probabilities converge to 1/2.

  • 2.
    Bihi, Ahmed
    Mälardalen University, School of Innovation, Design and Engineering.
    Analysis of similarity and differences between articles using semantics2017Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
    Abstract [en]

    Adding semantic analysis in the process of comparing news articles enables a deeper level of analysis than traditional keyword matching. In this bachelor’s thesis, we have compared, implemented, and evaluated three commonly used approaches for document-level similarity. The three similarity measurement selected were, keyword matching, TF-IDF vector distance, and Latent Semantic Indexing. Each method was evaluated on a coherent set of news articles where the majority of the articles were written about Donald Trump and the American election the 9th of November 2016, there were several control articles, about random topics, in the set of articles. TF-IDF vector distance combined with Cosine similarity and Latent Semantic Indexing gave the best results on the set of articles by separating the control articles from the Trump articles. Keyword matching and TF-IDF distance using Euclidean distance did not separate the Trump articles from the control articles. We implemented and performed sentiment analysis on the set of news articles in the classes positive, negative and neutral and then validated them against human readers classifying the articles. With the sentiment analysis (positive, negative, and neutral) implementation, we got a high correlation with human readers (100%).

  • 3.
    Bonner, Richard
    et al.
    Mälardalen University, Department of Mathematics and Physics.
    Freivalds, R.
    University of Latvia, Riga, Latvia.
    Lapins, J.
    University of Latvia, Riga, Latvia.
    Lukjanska, A.
    University of Latvia, Riga, Latvia.
    Nonstochastic languages as projections of 2-tape quasideterministic languages1998In: Mathematical Foundations of Computer Science 1998: 23rd International Symposium, MFCS'98 Brno, Czech Republic, August 24–28, 1998 Proceedings, 1998, Vol. 1450, p. 213-219Conference paper (Refereed)
    Abstract [en]

    A language L(n) of n-tuples of words which is recognized by a n-tape rational finite-probabilistic automaton with probability 1-ε, for arbitrary ε > 0, is called quasideterministic. It is proved in [Fr 81], that each rational stochastic language is a projection of a quasideterministic language L(n) of n-tuples of words. Had projections of quasideterministic languages on one tape always been rational stochastic languages, we would have a good characterization of the class of the rational stochastic languages. However we prove the opposite in this paper. A two-tapequasideterministic language exists, the projection of which on the first tape is a nonstochastic language.

  • 4.
    Dupuch, Marie
    et al.
    CNRS UMR 8163 STL, Universit´e Lille 3, 59653 Villeneuve d’Ascq, France.
    Engström, Christopher
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Silvestrov, Sergei
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Hamon, Thierry
    LIM&BIO UFR SMBH Universit´e Paris 13, France.
    Grabar, Natalia
    CNRS UMR 8163 STL, Universit´e Lille 3, 59653 Villeneuve d’Ascq, France.
    Comparison of Clustering Approaches through Their Application to Pharmacovigilance Terms2013In: Artificial Intelligence in Medicine. Lecture Notes in Computer Science, vol. 7885 / [ed] Niels Peek, Roque Marín Morales, Mor Peleg, Berlin Heidelberg: Springer, 2013, p. 58-67Chapter in book (Refereed)
    Abstract [en]

    In different applications (i.e., information retrieval, filteringor analysis), it is useful to detect similar terms and to provide the possibilityto use them jointly. Clustering of terms is one of the methods whichcan be exploited for this. In our study, we propose to test three methodsdedicated to the clustering of terms (hierarchical ascendant classification,Radius and maximum), to combine them with the semantic distance algorithmsand to compare them through the results they provide whenapplied to terms from the pharmacovigilance area. The comparison indicatesthat the non disjoint clustering (Radius and maximum) outperformthe disjoint clusters by 10 to up to 20 points in all the experiments.

  • 5.
    Hamon, Thierry
    et al.
    LIM&BIO (EA3969), Université Paris 13, France.
    Engström, Christopher
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Manser, Mounira
    Université Paris 13, France.
    Badji, Zina
    Universiteá Lille, Villeneuve d'Ascq, France.
    Grabar, Natalia
    Universiteá Lille, Villeneuve d'Ascq, France.
    Silvestrov, Sergei
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Combining Compositionality and Pagerank for the Identification of Semantic Relations between Biomedical Words2012In: BioNLP: Proceedings of the 2012 Workshop on Biomedical Natural Language Processing, 2012, p. 109-117Conference paper (Refereed)
    Abstract [en]

    The acquisition of semantic resources and relations is an important task for several applications, such as query expansion, information retrieval and extraction, machine translation. However, their validity should also be computed and indicated, especially for automatic systems and applications. We exploit the compositionality based methods for the acquisition of synonymy relations and of indicators of these synonyms. We then apply pagerank-derived algorithm to the obtained semantic graph in order to filter out the acquired synonyms. Evaluation performed with two independent experts indicates that the quality of synonyms is systematically improved by 10 to 15% after their filtering.

  • 6.
    Santini, Marina
    et al.
    RISE Research Institutes of Sweden, Sweden.
    Jönsson, Arne
    RISE Research Institutes of Sweden, Sweden; Linköping University, Sweden.
    Strandqvist, Wiktor
    RISE Research Institutes of Sweden, Sweden; Linköping University, Sweden.
    Cederblad, Gustav
    Linköping University, Sweden.
    Nyström, Mikael
    RISE Research Institutes of Sweden, Sweden; Linköping University, Sweden.
    Alirezaie, Marjan
    Örebro universitet, Institutionen för naturvetenskap och teknik.
    Lind, Leili
    RISE Research Institutes of Sweden, Sweden; Linköping University, Sweden.
    Blomqvist, Eva
    RISE Research Institutes of Sweden, Sweden; Linköping University, Sweden.
    Lindén, Maria
    Mälardalen University, Sweden.
    Kristoffersson, Annica
    Örebro universitet, Institutionen för naturvetenskap och teknik.
    Designing an Extensible Domain-Specific Web Corpus for “Layfication”: A Case Study in eCare at Home2019In: Cyber-Physical Systems for Social Applications / [ed] Maya Dimitrova (Bulgarian Academy of Sciences, Bulgaria) and Hiroaki Wagatsuma (Kyushu Institute of Technology, Japan), Hershey, PA, USA: IGI Global , 2019, p. 98-155Chapter in book (Refereed)
    Abstract [en]

    In the era of data-driven science, corpus-based language technology is an essential part of cyber physical systems. In this chapter, the authors describe the design and the development of an extensible domain-specific web corpus to be used in a distributed social application for the care of the elderly at home. The domain of interest is the medical field of chronic diseases. The corpus is conceived as a flexible and extensible textual resource, where additional documents and additional languages will be appended over time. The main purpose of the corpus is to be used for building and training language technology applications for the “layfication” of the specialized medical jargon. “Layfication” refers to the automatic identification of more intuitive linguistic expressions that can help laypeople (e.g., patients, family caregivers, and home care aides) understand medical terms, which often appear opaque. Exploratory experiments are presented and discussed.

  • 7.
    Tiwari, Saurabh
    et al.
    Mälardalen University, School of Innovation, Design and Engineering, Embedded Systems. DA-IICT, Gandhinagar, India.
    Ameta, D.
    DA-IICT, Gandhinagar, India.
    Banerjee, A.
    DA-IICT, Gandhinagar, India.
    An approach to identify use case scenarios from textual requirements specification2019In: ACM International Conference Proceeding Series, Association for Computing Machinery , 2019Conference paper (Refereed)
    Abstract [en]

    Use case modeling refers to the process of identifying scenarios written in some natural language text, particularly to capture interactions between the system and associated actors. Several approaches have been proposed to maintain the synergy of use cases with other software models, but no systematic transformation approach is available to extract use case scenarios from the textual requirements specification. In this paper, we propose a systematic transformation approach that automatically extracts various use case elements from textual problem specifications. The approach uses Natural Language (NL) parser to identify Parts-Of-Speech (POS) tags, Type Dependencies (TDs) and semantic roles from the input text specification to populate use case elements. It further makes use of the questionnaire-based approach to develop the remaining unpopulated parts of the use case template. The paper demonstrates the applicability of the proposed approach by applying both industry and research-level case studies. The results highlight that the generated output is correct, consistent, non-redundant and complete, and helpful to use case developers in further analysis and documentation. 

1 - 7 of 7
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