Endre søk
Begrens søket
1 - 4 of 4
RefereraExporteraLink til resultatlisten
Permanent link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Treff pr side
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sortering
  • Standard (Relevans)
  • Forfatter A-Ø
  • Forfatter Ø-A
  • Tittel A-Ø
  • Tittel Ø-A
  • Type publikasjon A-Ø
  • Type publikasjon Ø-A
  • Eldste først
  • Nyeste først
  • Skapad (Eldste først)
  • Skapad (Nyeste først)
  • Senast uppdaterad (Eldste først)
  • Senast uppdaterad (Nyeste først)
  • Disputationsdatum (tidligste først)
  • Disputationsdatum (siste først)
  • Standard (Relevans)
  • Forfatter A-Ø
  • Forfatter Ø-A
  • Tittel A-Ø
  • Tittel Ø-A
  • Type publikasjon A-Ø
  • Type publikasjon Ø-A
  • Eldste først
  • Nyeste først
  • Skapad (Eldste først)
  • Skapad (Nyeste først)
  • Senast uppdaterad (Eldste først)
  • Senast uppdaterad (Nyeste først)
  • Disputationsdatum (tidligste først)
  • Disputationsdatum (siste først)
Merk
Maxantalet träffar du kan exportera från sökgränssnittet är 250. Vid större uttag använd dig av utsökningar.
  • 1. Boeva, V
    et al.
    Ekenberg, Love
    KTH, Tidigare Institutioner, Data- och systemvetenskap, DSV.
    A transition logic for schemata conflicts2004Inngår i: Data & Knowledge Engineering, ISSN 0169-023X, E-ISSN 1872-6933, Vol. 51, nr 3, s. 277-294Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    Conflict detection and analysis are of high importance, e.g., when integrating conceptual schemata, such as UML-Specifications, or analysing goal-fulfilment of sets of autonomous agents. In general, models for this introduce unnecessarily complicated frameworks with several disadvantages regarding semantics as well as complexity. This paper demonstrates that an important set of static and dynamic conflicts between specifications can be diagnosed using ordinary first-order modal logic. Furthermore, we show how the framework can be extended for handling situations when there are convex sets of probability measures over a state-space. Thus, representing specifications as conceptual schemata and using standard Kripke models of modal logic, augmented with an interval-valued probability measure, we propose instrumental definitions and procedures for conflict detection.

  • 2. Lopez, Lidia
    et al.
    Costal, D.
    Ayala, Claudia
    Annosi, Maria Carmela
    Ericsson Telecomunicaz, I-84016 Salerno, Italy.
    Glott, Ruedigott
    Haaland, K.
    Adoption of OSS components: A goal-oriented approach2015Inngår i: Data & Knowledge Engineering, ISSN 0169-023X, E-ISSN 1872-6933, Vol. 99, s. 17-38Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    Open Source Software (OSS) has become a strategic asset for a number of reasons, such as short time-to-market software delivery, reduced development and maintenance costs, and its customization capabilities. Therefore, organizations are increasingly becoming OSS adopters, either as a result of a strategic decision or because it is almost unavoidable nowadays, given the fact that most commercial software also relies at some extent in OSS infrastructure. The way in which organizations adopt OSS affects and shapes their businesses. Therefore, knowing the impact of different OSS adoption strategies in the context of an organization may help improving the processes undertaken inside this organization and ultimately pave the road to strategic moves. In this paper, we propose to model OSS adoption strategies using a goal-oriented notation, in which different actors state their objectives and dependencies on each other. These models describe the consequences of adopting one such strategy or another: which are the strategic and operational goals that are supported, which are the resources that emerge, etc. The models rely on an OSS ontology, built upon a systematic literature review, which comprises the activities and resources that characterize these strategies. Different OSS adoption strategy models arrange these ontology elements in diverse ways. In order to assess which is the OSS adoption strategy that better fits the organization needs, the notion of model coverage is introduced, which allows to measure the degree of concordance among every strategy with the model of the organization by comparing the respective models. The approach is illustrated with an example of application in a big telecommunications company.

  • 3.
    Minock, Michael
    Umeå University, Sweden .
    C-Phrase: A System for Building Robust Natural Language Interfaces to Databases2010Inngår i: Data & Knowledge Engineering, ISSN 0169-023X, E-ISSN 1872-6933, Vol. 69, nr 3, s. 290-302Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    This article presents C-PHRASE, a natural language interface system that can be configured by normal, non-specialized, web-based technical teams. C-PHRASE models queries in an extended version of Codd's tuple calculus and uses synchronous context-free grammars with lambda-express ions to represent semantic grammars. Given an arbitrary relational database, authors rapidly build an NLI using what we term the narm-tailor-define protocol. We present a small study demonstrating the effectiveness of this approach for the CEO corpus and we introduce the evaluation metric of willingness that complements the standard metrics of precision and recall. However our true evaluation comes as we open-source C-PHRASE.

  • 4.
    Minock, Michael
    et al.
    KTH, Skolan för datavetenskap och kommunikation (CSC), Teoretisk datalogi, TCS. Department of Computing Science, Umeå University, Sweden .
    Mollevik, Johan
    Context-dependent "Near" and "Far" in Spatial Databases via Supervaluation2013Inngår i: Data & Knowledge Engineering, ISSN 0169-023X, E-ISSN 1872-6933, Vol. 86, s. 295-305Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    Often we are interested to know what is ‘near’ and what is ‘far’ in spatial databases. For instance we would like a hotel ‘near’ the beach, but ‘far’ from the highway. It is not always obvious how to answer such nearness questions by reducing them to their crisp counterparts ‘nearer’ or ‘nearest’. Thus we confront the vague and context-dependent relation of near (and far). Our approach follows a supervaluation tradition with a limited representation of context. The method is tractable, learnable and directly suitable for use in natural language interfaces to databases. The approach is based on logic programs supervaluated over a set of context-dependent threshold parameters. Given a set of rules with such unconstrained threshold parameters, a fixed parameter tractable algorithm finds a setting of parameters that are consistent with a training corpus of context-dependent descriptions of ‘near’ and ‘far’ in scenes. The results of this algorithm may then be compiled into view definitions which are accessed in real-time by natural language interfaces employing normal, non-exotic query answering mechanisms.

1 - 4 of 4
RefereraExporteraLink til resultatlisten
Permanent link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf