umu.sePublikasjoner
Endre søk
Begrens søket
2345678 201 - 250 of 840
RefereraExporteraLink til resultatlisten
Permanent link
Referera
Referensformat
  • apa
  • 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.
  • 201.
    Drewes, Frank
    et al.
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Jonsson, Anna
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Contextual Hyperedge Replacement Grammars for Abstract Meaning Representations2017Inngår i: Proceedings of the 13th International Workshop on Tree Adjoining Grammars and Related Formalisms / [ed] M. Kuhlmann, T. Scheffler, Association for Computational Linguistics, 2017, s. 102-111Konferansepaper (Fagfellevurdert)
    Abstract [en]

    We show how contextual hyperedge replacement grammars can be used to generate abstract meaning representations (AMRs), and argue that they are more suitable for this purpose than hyperedge replacement grammars. Contextual hyperedge replacement turns out to have two advantages over plain hyperedge replacement: it can completely cover the language of all AMRs over a given domain of concepts, and at the same time its grammars become both smaller and simpler.

  • 202.
    Drewes, Frank
    et al.
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Knight, Kevin
    University of Southern California.
    Kuhlmann, Marco
    Linköpings universitet.
    Formal Models of Graph Transformation in Natural Language Processing2015Rapport (Annet vitenskapelig)
    Abstract [en]

    In natural language processing (NLP) there is an increasing interest in formal models for processing graphs rather than more restricted structures such as strings or trees. Such models of graph transformation have previously been studied and applied in various other areas of computer science, including formal language theory, term rewriting, theory and implementation of programming languages, concurrent processes, and software engineering. However, few researchers from NLP are familiar with this work, and at the same time, few researchers from the theory of graph transformation are aware of the specific desiderata, possibilities and challenges that one faces when applying the theory of graph transformation to NLP problems. The Dagstuhl Seminar 15122 “Formal Models of Graph Transformation in Natural Language Processing” brought researchers from the two areas together. It initiated an interdisciplinary exchange about existing work, open problems, and interesting applications.

  • 203.
    Drewes, Frank
    et al.
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Leroux, Jérôme
    LaBRI, CNRS, Université de Bordeaux.
    Structurally Cyclic Petri Nets2015Inngår i: Logical Methods in Computer Science, ISSN 1860-5974, E-ISSN 1860-5974, Vol. 11, nr 4, artikkel-id 15Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    A Petri net is structurally cyclic if every configuration is reachable from itself in one or more steps. We show that structural cyclicity is decidable in deterministic polynomial time. For this, we adapt the Kosaraju's approach for the general reachability problem for Petri nets.

  • 204.
    Drewes, Frank
    et al.
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Merwe, Brink van der
    University of Stellenbosch.
    Weideman, Nicolaas
    University of Stellenbosch.
    The Output Size Problem for String-to-Tree Transducers2016Inngår i: / [ed] A. Maletti, 2016Konferansepaper (Annet vitenskapelig)
    Abstract [en]

    The output size problem, for a string-to-tree transducer, is to determine the rate of growth of the function describing the maximum size of output trees, with respect to the length of the input strings. We study the complexity of this problem. Our motivation is that a solution to the output size problem can be used in order to determine the worst-case matching time (for a given regular expression) of a backtracking regular expression matcher, with respect to the length of the input strings.

  • 205.
    Drewes, Frank
    et al.
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    van der Merwe, Brink
    Path languages of random permitting context tree grammars are regular2008Inngår i: Fundamenta Informaticae, ISSN 0169-2968, E-ISSN 1875-8681, Vol. 82, nr 1-2, s. 47-60Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    The path languages of random permitting context tree languages are investigated. The main result is that these path languages are regular. This confirms a previous conjecture.

  • 206. Dürango, Jonas
    et al.
    Tärneberg, William
    Tomas, Luis
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Tordsson, Johan
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Kihl, Maria
    Maggio, Martina
    A control theoretical approach to non-intrusive geo-replication for cloud services2016Inngår i: 2016 IEEE 55TH CONFERENCE ON DECISION AND CONTROL (CDC), IEEE, 2016, s. 1649-1656Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Complete data center failures may occur due to disastrous events such as earthquakes or fires. To attain robustness against such failures and reduce the probability of data loss, data must be replicated in another data center sufficiently geographically separated from the original data center. Implementing geo-replication is expensive as every data update operation in the original data center must be replicated in the backup. Running the application and the replication service in parallel is cost effective but creates a trade-off between potential replication consistency and data loss and reduced application performance due to network resource contention. We model this trade-off and provide a control-theoretical solution based on Model Predictive Control to dynamically allocate network bandwidth to accommodate the objectives of both replication and application data streams. We evaluate our control solution through simulations emulating the individual services, their traffic flows, and the shared network resource. The MPC solution is able to maintain a consistent performance over periods of persistent overload, and is quickly able to indiscriminately recover once the system return to a stable state. Additionally, the MPC balances the two objectives of consistency and performance according to the proportions specified in the objective function.

  • 207.
    Eckerdal, Anna
    et al.
    Department of Information Technology Uppsala University, Uppsala, Sweden.
    McCartney, Robert
    Department of Computer Science and Engineering, University of Connecticut, Storrs, CT 06269 USA .
    Moström, Jan Erik
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Ratcliffe, Mark
    Department of Computer Science University of Wales, Aberystwyth, Wales .
    Zander, Carol
    Computing & Software Systems University of Washington, Bothell, Bothell, WA, USA.
    Can graduating students design software systems?2006Inngår i: SIGCSE ’06: Proceedings of the 37th SIGCSE technical symposium on Computer science education, New York NY, USA: ACM , 2006, s. 403-407Konferansepaper (Fagfellevurdert)
    Abstract [en]

    This paper examines software designs produced by students nearing completion of their Computer Science degrees. The results of this multi-national, multi-institutional experiment present some interesting implications for educators.

  • 208.
    Eckerdal, Anna
    et al.
    Uppsala University.
    McCartney, Robert
    University of Connecticut.
    Moström, Jan Erik
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Ratcliffe, Mark
    University of Wales, Aberystwyth.
    Zander, Carol
    University of Washington, Bothell.
    Categorizing student software designs: methods, results, and implications2006Inngår i: Computer Science Education, ISSN 0899-3408, E-ISSN 1744-5175, Vol. 16, nr 3, s. 197-209Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    This paper examines the problem of studying and comparing student software designs. We propose semantic categorization as a way to organize widely varying data items. We describe how this was used to organize a particular multi-national, multi-institutional dataset, and present the results of this analysis: most students are unable to effectively design software. We examine how these designs vary with different academic and demographic factors, and discuss the implications of this work on both education and education research.

  • 209.
    Edler, Daniel
    et al.
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för fysik.
    Bohlin, Ludvig
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för fysik.
    Rosvall, Martin
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för fysik.
    Mapping Higher-Order Network Flows in Memory and Multilayer Networks with Infomap2017Inngår i: Algorithms, ISSN 1999-4893, E-ISSN 1999-4893, Vol. 10, nr 4, artikkel-id 112Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    Comprehending complex systems by simplifying and highlighting important dynamical patterns requires modeling and mapping higher-order network flows. However, complex systems come in many forms and demand a range of representations, including memory and multilayer networks, which in turn call for versatile community-detection algorithms to reveal important modular regularities in the flows. Here we show that various forms of higher-order network flows can be represented in a unified way with networks that distinguish physical nodes for representing a complex system's objects from state nodes for describing flows between the objects. Moreover, these so-called sparse memory networks allow the information-theoretic community detection method known as the map equation to identify overlapping and nested flow modules in data from a range of different higher-order interactions such as multistep, multi-source, and temporal data. We derive the map equation applied to sparse memory networks and describe its search algorithm Infomap, which can exploit the flexibility of sparse memory networks. Together they provide a general solution to reveal overlapping modular patterns in higher-order flows through complex systems.

  • 210. Edmonds, Andy
    et al.
    Metsch, Thjis
    Elmroth, Erik
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Marshall, Jamie
    Ganschosov, Petov
    FluidCloud: An Open Framework for Relocation of Cloud Services2013Inngår i: The 5th USENIX Workshop on Hot Topics in Cloud Computing (HotCloud'13), 2013Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Cloud computing delivers new levels of being connected, instead of the once disconnected PC-type systems. The proposal in this paper extends that level of connectedness in the cloud such that cloud service instances, hosted by providers, can relocate between clouds. This is key in order to provide economical and regulatory benefits but more importantly liberation and positive market disruption.

    While service providers want to lock in their customer’s services, FluidCloud wants the liberation of those and thereby allow the service owner to freely choose the best matching provider at any time. In the cloud world of competing cloud standards and software solutions, each only partially complete, the central research question which this paper intends to answer: How to intrinsically enable and fully automate relocation of service instances between clouds?

  • 211.
    Edmundsson, Niklas
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Scaling a Content Delivery system for Open Source Software2015Independent thesis Advanced level (degree of Master (Two Years)), 20 poäng / 30 hpOppgave
    Abstract [en]

    This master’s thesis addresses scaling of content distribution sites. In a case study, the thesis investigates issues encountered on ftp.acc.umu.se, a content distribution site run by the Academic Computer Club (ACC) of Umeå University. This site is characterized by the unusual situation of the external network connectivity having higher bandwidth than the components of the system, which differs from the norm of the external connectivity being the limiting factor. To address this imbalance, a caching approach is proposed to architect a system that is able to fully utilize the available network capacity, while still providing a homogeneous resource to the end user. A set of modifications are made to standard open source solutions to make caching perform as required, and results from production deployment of the system are evaluated. In addition, time series analysis and forecasting techniques are introduced as tools to improve the system further, resulting in the implementation of a method to automatically detect bursts and handle load distribution of unusually popular files.

  • 212.
    Edmundsson, Niklas
    et al.
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Högpresterande beräkningscentrum norr (HPC2N).
    Elmroth, Erik
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap. Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Högpresterande beräkningscentrum norr (HPC2N).
    Kågström, Bo
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap. Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Högpresterande beräkningscentrum norr (HPC2N).
    Mårtensson, Markus
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Högpresterande beräkningscentrum norr (HPC2N).
    Nylén, Mats
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Högpresterande beräkningscentrum norr (HPC2N).
    Sandgren, Åke
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Högpresterande beräkningscentrum norr (HPC2N).
    Wadenstein, Mattias
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Högpresterande beräkningscentrum norr (HPC2N).
    Design and Evaluation of a TOP100 Linux Super Cluster System2004Inngår i: Concurrency and Computation: Practice & Experiences, ISSN 1532-0634, Vol. 16, nr 8, s. 735-750Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    The High Performance Computing Center North (HPC2N) Super Cluster is a truly self-made high-performance Linux cluster with 240 AMD processors in 120 dual nodes, interconnected with a high-bandwidth, low-latency SCI network. This contribution describes the hardware selected for the system, the work needed to build it, important software issues and an extensive performance analysis. The performance is evaluated using a number of state-of-the-art benchmarks and software, including STREAM, Pallas MPI, the Atlas DGEMM, High-Performance Linpack and NAS Parallel benchmarks. Using these benchmarks we first determine the raw memory bandwidth and network characteristics; the practical peak performance of a single CPU, a single dual-node and the complete 240-processor system; and investigate the parallel performance for non-optimized dusty-deck Fortran applications. In summary, this $500 000 system is extremely cost-effective and shows the performance one would expect of a large-scale supercomputing system with distributed memory architecture. According to the TOP500 list of June 2002, this cluster was the 94th fastest computer in the world. It is now fully operational and stable as the main computing facility at HPC2N. The system’s utilization figures exceed 90%, i.e. all 240 processors are on average utilized over 90% of the time, 24 hours a day, seven days a week.

  • 213.
    Ehrenberg, Dieter
    et al.
    Technical University of Leipzig, Leipzig, Germany.
    Eklund, Patrik
    Department of Computer Science, Åbo Akademi, Åbo, Finland.
    Fedrizzi, Mario
    University of Trento, Trento, Italy.
    Ventre, Aldo
    University of Naples, Naples, Italy.
    Enhancing consensus in distributed environments1990Inngår i: Parallel Architectures and Neural Networks: Third Italian Workshop : Vietri Sul Mare, Salerno, Italy, 15-18 May, 1990 / [ed] E. R. Caianiello, Singapore: World Scientific, 1990, s. 403-406Konferansepaper (Fagfellevurdert)
  • 214.
    Ekblom, Richard
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Applied Representational State Transfer2011Independent thesis Basic level (degree of Bachelor), 10 poäng / 15 hpOppgave
    Abstract [en]

    With an ever growing amount of information that most activities produce today the tradition has been to use different systems to store and manage the data. Depending on its type, the spreadsheets could be stored with FTP on some file server with an obscure directory structure, and every time that new meeting protocol must be added to the homepage it's added manually, the phone numbers of every employee is written on a long forgotten paper hanging in the corridor, and so forth. Could some sort of an information infrastructure consolidate all data to be easily found, accessed and updated? An infrastructure like that must be able to handle different types of data, it must be based on common technologies for untroubled management from different applications and it must scale well as the data continues to increase. REST or Representation State Transfer is an architecture style as a set of guidelines of how HTTP was originally intended to be used. REST advocates that information should be logically divided into linked resources where each resource is identified by an URI, and where operations on the resources is performed by the methods of HTTP: GET, PUT, POST and DELETE. Content-negotiation is used to deliver different types of representations of the resources to the clients. This makes a system based on REST loosely coupled and interoperable. This thesis aims to get a deeper knowledge of REST and how it can be used in distributed systems.

  • 215. Eklund, Heidi-Tuulia
    et al.
    Eklund, Patrik
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Logic and process drama2013Inngår i: / [ed] R. B. Thorkelsdóttir, Á. H. Ragnardóttir, Háskólaprent , 2013, s. 103-115Konferansepaper (Fagfellevurdert)
  • 216.
    Eklund, Patrik
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Assessment scales and consensus guidelines encoded in formal logic2009Inngår i: The Journal of Nutrition, Health & Aging, ISSN 1279-7707, E-ISSN 1760-4788, Vol. 13, nr 1, s. 558-559Artikkel i tidsskrift (Fagfellevurdert)
  • 217.
    Eklund, Patrik
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Category theoretic ontology for representation of assessment scales and consensus guidelines in elderly care2013Inngår i: Fuzziness and Medicine: Philosophical Reflections and Application Systems in Health Care: A Companion Volume to Sadegh-Zadeh’s Handbook of Analytical Philosophy of Medicine / [ed] Rudolf Seising and Marco Elio Tabacchi, Springer Berlin/Heidelberg, 2013, s. 401-413Kapittel i bok, del av antologi (Fagfellevurdert)
    Abstract [en]

    In this paper we show how category theoretic ontology provided by generalized general logic can be used for decision-making with assessment scales and consensus guidelines in social and health care of older people. Computerized decision-making in social and health care is traditionally views ontologies not as part of underlying logics for decision-making, but rather as standards and terminologies including skeletons and frameworks of informal logic structures. Programming in logic is manipulation of terms, and substitution with terms. Classical terms won’t suffice. An ontology building upon classical terms, trying to enhance missing parts in the underlying structures by being clever about inference, becomes logically sterile and basically useless in formal frameworks. We also need to make a distinction between imprecise or vague information, and being formal and accurate in reasoning with vague values. Furthermore, a value may be vague as produced by a crisp operation, or a value is vague since the underlying operation is vague. From formal point of view this is all about underlying categories and monads, and in this paper we will continue investigations showing how the signatures reside in term monads over chosen categories. Our approach is thus monadic, and we consider monads over suitable categories.

  • 218.
    Eklund, Patrik
    Department of Computer Science, Åbo Akademi, Åbo, Finland.
    DiagaiD: A Neuro-Fuzzy System for Developing Medical Decision Support1994Inngår i: Scandinavian Journal of Clinical and Laboratory Investigation, ISSN 0036-5513, E-ISSN 1502-7686, Vol. 54, nr s218, s. 9-10Artikkel i tidsskrift (Fagfellevurdert)
  • 219.
    Eklund, Patrik
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Early diagnosis of cognitive disorder based on ground categories for decision support structures2009Inngår i: IEEE International Conference on Fuzzy Systems, 2009. FUZZ-IEEE 2009., 2009, s. 997-1002Konferansepaper (Fagfellevurdert)
    Abstract [en]

    In this paper we discuss computerized assessments and guidelines for decision making, with accuracy and formalism being required for avoiding ambiguities and imprecision. Note the difference between imprecise or vague information, and being formal and accurate in reasoning with vague values. We may even have a logic allowing for vague reasoning, where the underlying logic is formal and precise, i.e. must always have a clear syntax and semantics together with a accurately described inference mechanism revealing the strength and weakness, and indeed the nature and capacities of that particular underlying logic. Our examples will be drawn from elderly care, in particular from assessments in old age psychiatry and early diagnosis of cognitive disorder.

  • 220.
    Eklund, Patrik
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Elderly care cost control using observation, assessment anddecision-making2013Inngår i: Handbook of Research on ICTs for Human-Centered Healthcare and Social Care Services, Vol. I / [ed] M. M. Cruz-Cunha, I. M. Miranda, P. Goncalves, IGI Global, 2013, s. 320-329Kapittel i bok, del av antologi (Fagfellevurdert)
    Abstract [en]

    Municipal and regional best practices for strategic planning and management of ageing is achieved by developing accurate socio-economic modelling tools based on rigorous design of information and processes. Demographic models enable analysis and prediction of demographic change, and socio-economic modelling, based on ageing information and process design, is sensitive and specific in particular concerning variables related to demographic change. Service forms based on observation, assessment, and decision-making are typically used in home care, adult day care centres, residential care, nursing homes, and/or wards. The suggested approach to socio-economic modelling-based strategic planning is both customer-centric with respect to information and process design as well as care-centric with respect to care management.

  • 221.
    Eklund, Patrik
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    General logics and management of ageing2008Inngår i: Third 2008 International Conference on Convergence and Hybrid Information Technology (ICCIT 2008), Volume 1, 2008, s. 424-429Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Cognitive decline progresses from the mild cognitive impairment stage and proceeds into various dementia types and progresses through different severities. During the course of the cognitive decline the patient is subjected to actions and decision making as provided by respective professional groups. Coordination of various clinical and care giving skills and capacities involve information management and reasoning which require consideration of different logic platforms suited for the professional groups. Particularly at early detection it is important to adapt information and knowledge representation to situations where cognitive problems are encountered and by whom these observations are made. The very first observations of cognitive decline are usually made by thepatient's husband/wife and relatives Advice is then sought from social authorities, nurses and primary care doctors within their local health care centres. Professional representation in these groups will not perform final diagnosis but rather provide necessary background information for assessment and initialization of thediagnostic procedures. Moving between logic representations of guidelines requires formalism as provided by general logics.

  • 222.
    Eklund, Patrik
    Department of Computer Science, Åbo Akademi, Åbo, Finland.
    Network size versus preprocessing1994Inngår i: Fuzzy sets, neural networks, and soft computing / [ed] Ronald R. Yager, Lotfi Asker Zadeh, New York: Van Nostrand Reinhold , 1994, s. 250-264Kapittel i bok, del av antologi (Fagfellevurdert)
  • 223.
    Eklund, Patrik
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Non-classical logic for elderly care management2008Inngår i: / [ed] L. Magdalena, M. Ojeda-Aciego, J.L. Verdegay, 2008, s. 646-651Konferansepaper (Fagfellevurdert)
  • 224.
    Eklund, Patrik
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Signatures for assessment, diagnosis and decision-making in ageing2010Inngår i: Information processing and management of uncertainty in knowledge-based systems: applications, pt II / [ed] Hullermeier, E; Kruse, R; Hoffmann, F, Springer, 2010, s. 271-279Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Computerized decision-making in social and health care is traditionally focused on representation and implementation of know-how and guidelines. Less attention has been paid to underlying data structures and formalizations of ontologies. In this paper we show how underlying signatures of a logic can be based on monads over suitable categories. Furthermore, we argue in favour of using application domain specific logic, and even cross-functional logic as enabled by general logics. Our examples are drawn from decision-making with assessment scales and consensus guidelines in social and health care of older people.

  • 225.
    Eklund, Patrik
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Signatures for assessment, diagnosis and decision-making in ageing2010Inngår i: IPMU 2010 / [ed] E. Hüllermeier, R. Kruse, and F. Hoffmann, Springer-Verlag New York, 2010, s. 271-279Konferansepaper (Fagfellevurdert)
  • 226.
    Eklund, Patrik
    et al.
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Bohlin, J.
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Probabilistic networks in laboratory medicine1998Inngår i: Scandinavian Journal of Clinical and Laboratory Investigation, ISSN 0036-5513, E-ISSN 1502-7686, Vol. 58, nr s228, s. 32-32Artikkel i tidsskrift (Fagfellevurdert)
  • 227.
    Eklund, Patrik
    et al.
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Fedrizzi, Mario
    Nurmi, Hannu
    A categorical approach to the extension of social choice functions2010Inngår i: Information processing and management of uncertainty in knowledge-based systems: applications, pt II / [ed] Hüllermeier, Eyke, Kruse, Rudolf, Hoffmann, Frank, Springer, 2010, s. 261-270Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Are we interested in choice functions or function for choice? Was it my choice or did I choose? In the end it is all about sorts and operators, terms as given by the term monad over the appropriate category, and variable substitutions as morphisms in the Kleisli category of that particular term monad.

  • 228.
    Eklund, Patrik
    et al.
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Fedrizzi, Mario
    Nurmi, Hannu
    Categorical approach to the extension of social choice functions2010Inngår i: IPMU 2010 / [ed] E. Hüllermeier, R. Kruse, and F. Hoffmann, Springer-Verlag , 2010, s. 261-270Konferansepaper (Fagfellevurdert)
  • 229.
    Eklund, Patrik
    et al.
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Forsström, J. J.
    Department of Medicine, Turku University Central Hospital, Turku, Finland.
    Computational intelligence for laboratory information systems1995Inngår i: Scandinavian Journal of Clinical and Laboratory Investigation, ISSN 0036-5513, E-ISSN 1502-7686, Vol. 55, nr s222, s. 21-30Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    Non-linear models, such as given by neural networks and fuzzy logic, have established a good reputation for medical data analysis as computational and logical counterparts to statistical methods. Whereas multilayer perceptrons perform well with large data sets, a combination of neural learning together with fuzzy logical network interpretations provides a network reduction well suited for smaller data sets. The aim of this paper is to present an approach to neural fuzzy systems data analysis and knowledge acquisition in laboratory information systems. We also describe a software system, DiagaiD, which provides an analysis and development workbench involving laboratory data.

  • 230.
    Eklund, Patrik
    et al.
    Department of Computer Science, Åbo Akademi, Åbo, Finland.
    Forsström, Jari
    University of Turku, Department of Clinical Chemistry, Central Laboratory, Turku University Central Hospital, SF-20520 Turku, Finland.
    Diagnosis of nephropathia epidemica by adaptation through Lukasiewicz inference1990Inngår i: Computational Intelligence, III: Proceedings of the International Symposium "Computational Intelligence 90", Milan, Italy, 24-28 September, 1990. / [ed] Nick Cerone, Francesco Gardin, co-editor, George Valle, Amsterdam, The Netherlands: Elsevier, 1990, s. 237-246Kapittel i bok, del av antologi (Fagfellevurdert)
    Abstract [en]

    This paper describes a method how to arrive at a medical expert system (as a knowledge based system) to support physicians in classifying patients in diagnosis of Nephropathia epidemica (NE). We thereby present a link between Lukasiewicz inference and learning in neural nets, as a formal connection between uncertainty in logical implication and synaptic weights. The system presented uses clinical findings and laboratory investigations to arrive at predictions whether or not patients suffer from NE. Although we are willing to call our system a medical expert system, it could equally well be called a decision support system, this being more in spirit to what such a system really offers a physician.

  • 231.
    Eklund, Patrik
    et al.
    Åbo Akademi University, Department of Computer Science, Åbo, Finland.
    Forsström, Jari
    Turku University Central Hospital, Department of Medicine, Turku, Finland.
    Holm, Anders
    Åbo Akademi University, Department of Computer Science, Åbo, Finland.
    Nyström, Mats
    Åbo Akademi University, Department of Computer Science, Åbo, Finland.
    Selén, Gustaf
    Åbo Akademi University, Department of Computer Science, Åbo, Finland.
    Rule generation as an alternative to knowledge acquisition: a systems architecture for medical informatics1994Inngår i: Fuzzy sets and systems (Print), ISSN 0165-0114, E-ISSN 1872-6801, Vol. 66, nr 2, s. 195-205Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    This paper describes a clinical support systems workbench, DiagaiD, based on an efficient transfer of patient data between health care professionals and clinical subsystems. The DiagaiD workbench provides tools for decision support developments for open-loop systems.A leading ambition for our development work has been to establish a data analysis and knowledge elicitation workbench, in which medical professionals entirely by themselves can create stand-alone expert systems.

  • 232.
    Eklund, Patrik
    et al.
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Galan Garcia, Maria Angeles
    Kortelainen, Jari
    Ojeda-Aciego, Manuel
    Monadic Formal Concept Analysis2014Inngår i: ROUGH SETS AND CURRENT TRENDS IN SOFT COMPUTING, RSCTC 2014, 2014, s. 201-210Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Formal Concept Analysis (FCA) as inherently relational can be formalized and generalized by using categorical constructions. This provides a categorical view of the relation between "object" and "attributes", which can be further extended to a more generalized view on relations as morphisms in Kleisli categories of suitable monads. Structure of sets of "objects" and "attributes" can be provided e.g. by term monads over particular signatures, and specific signatures drawn from and developed within social and health care can be used to illuminate the use of the categorical approach.

  • 233.
    Eklund, Patrik
    et al.
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Galan, M.A.
    Medina, J.
    Ojeda-Aciego, M.
    Valverde, A.
    Composing submonads2001Inngår i: 31st IEEE International Symposium on Multiple-Valued Logic, 2001. Proceedings., Warsaw, Poland: IEEE Computer Society, 2001, s. 367-372Konferansepaper (Fagfellevurdert)
    Abstract [en]

    In this paper we use the concept of subfunctors and submonads in order to provide a technique for constructing new monads from given ones. We study some properties of these constructions and provide more examples on monad compositions

  • 234.
    Eklund, Patrik
    et al.
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Galán, M. A.
    Department of Applied Mathematics, Malaga University.
    Karlsson, Johan
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap. Department of Computer Architecture, University of Málaga, Spain.
    Categorical innovations for rough sets2009Inngår i: Rough set theory: a true landmark in data analysis / [ed] Ajith Abraham, Rafael Falcón, Rafael Bello, Berlin/Heidelberg: Springer Berlin/Heidelberg, 2009, s. 45-69Kapittel i bok, del av antologi (Annet vitenskapelig)
    Abstract [en]

    Categories arise in mathematics and appear frequently in computer science where algebraic and logical notions have powerful representations using categorical constructions. In this chapter we lean towards the functorial view involving natural transformations and monads. Functors extendable to monads, further incorporating order structure related to the underlying functor, turn out to be very useful when presenting rough sets beyond relational structures in the usual sense. Relations can be generalized with rough set operators largely maintaining power and properties. In this chapter we set forward our required categorical tools and we show how rough sets and indeed a theory of rough monads can be developed. These rough monads reveal some canonic structures, and are further shown to be useful in real applications as well. Information within pharmacological treatment can be structured by rough set approaches. In particular, situations involving management of drug interactions and medical diagnosis can be described and formalized using rough monads.

  • 235.
    Eklund, Patrik
    et al.
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Galán, M. Ángeles
    Helgesson, Robert
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Kortelainen, Jari
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    From Aristotle to Lotfi2013Inngår i: On Fuzziness: A Homage to Lotfi A. Zadeh – Volume 1 / [ed] Seising, Rudolf; Trillas, Enric; Moraga, Claudio; Termini, Settimo, Berlin Heidelberg: Springer Berlin/Heidelberg, 2013, Vol. 298, s. 147-152Kapittel i bok, del av antologi (Annet vitenskapelig)
  • 236.
    Eklund, Patrik
    et al.
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Galán, M.A.
    Department of Applied Mathematics, University of Málaga, Málaga, Spain.
    Gähler, Werner
    Scheibenbergstraße 37, D-12685 Berlin, Germany.
    Partially ordered monads for monadic topologies, Kleene algebras and rough sets2009Inngår i: Electronical Notes in Theoretical Computer Science, ISSN 1571-0661, E-ISSN 1571-0661, Vol. 225, s. 67-81Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    In this paper we will show that partially ordered monads contain sufficient structure for modelling monadic topologies, rough sets and Kleene algebras. Convergence represented by extension structures over partially ordered monads includes notions of regularity and compactness. A compactification theory can be developed. Rough sets [Z. Pawlak, Rough sets, Int. J. Computer and Information Sciences 5 (1982) 341356] are modelled in a generalized setting with set functors. Further, we show how partially ordered monads can be used in order to obtain monad based examples of Kleene algebras building upon a wide range of set functors far beyond just strings [S. C. Kleene, Representation of events in nerve nets and finite automata, In: Automata Studies (Eds. C. E. Shannon, J. McCarthy), Princeton University Press, 1956, 3-41] and relations [A. Tarski, On the calculus of relations, J. Symbolic Logic 6 (1941), 65-106].

  • 237.
    Eklund, Patrik
    et al.
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Galán, M.A.
    Gähler, Werner
    Partially ordered monads for monadic topologies, Kleene algebras and rough sets2006Konferansepaper (Fagfellevurdert)
  • 238.
    Eklund, Patrik
    et al.
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Galán, M.A.
    Department of Applied Mathematics, Malaga University.
    Karlsson, Johan
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Rough monadic interpretations of pharmacologic information2007Inngår i: ICCS 2007: proceedings of the 15th international workshops on conceptual structures, London: Springer , 2007, s. 108-113Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Public databases for pharmacological information provide rich and complete information for therapeutic requirements. In particular, the ATe code with its unique identification of drug compound is the basis e.g. of modelling of drug interactions. Therapeutic decisions are frequently faced with needs to consider not just drug-drug interactions but also drugs interacting with sets of drugs and even sets of medical conditions. The typing of interactions provides an additional complication as this is an entrance towards management of uncertainties concerning interactions. The hierarchical structure of pharmacological information and its intrinsic uncertainties are in this paper used as an information platformfor the demonstration of the power of rough set modelling. Rough sets in a more general functorial view involving partially ordered monads are able to capture interactionswith respect to different granularities in the information hierarchy.

  • 239.
    Eklund, Patrik
    et al.
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Galán, M.A.
    Kortelainen, J.
    On fuzzy successors2008Inngår i: / [ed] L. Magdalena, M. Ojeda-Aciego, J.L. Verdegay, 2008, s. 124-128Konferansepaper (Fagfellevurdert)
  • 240.
    Eklund, Patrik
    et al.
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Galán, M.A.
    Kortelainen, J.
    Stout, L. N.
    Paradigms for non-classical substitutions2009Inngår i: 39th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2009), 2009, s. 77-79Konferansepaper (Fagfellevurdert)
  • 241.
    Eklund, Patrik
    et al.
    Åbo Akademi University, Dept. Computer Science, Åbo, Finland.
    Galán, M.A.
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Medina, J.
    Ojeda Aciego, M.
    Valverde, A.
    A categorical approach to unication of generalised terms2002Inngår i: Electronical Notes in Theoretical Computer Science, ISSN 1571-0661, E-ISSN 1571-0661, Vol. 66, nr 5, s. 41-45Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    Unification of generalised terms in a many-valued setting involves considerations for equalities in the sense of similarity degrees between operators and thus similarities between terms. Further, allowing for substitutions of variables with powersets of terms requires ‘flattening’ operators for handling composition of variable substitutions. These techniques are available when using powerset functors composed with the term functor so that this composition of functors is extendable to a monad. In this paper we provide a framework for unification of such generalised terms.

  • 242.
    Eklund, Patrik
    et al.
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Galán, M.A.
    Medina, J.
    Ojeda Aciego, M.
    Valverde, A.
    A framework for unication using powersets of terms2002Inngår i: Proc. 9th Information Processing and Management of Uncertainty in Knowledge Based Systems Conference (IPMU 2002), 2002, s. 1095-1098Konferansepaper (Fagfellevurdert)
  • 243.
    Eklund, Patrik
    et al.
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Galán, M.A.
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Medina, J.
    Ojeda Aciego, M.
    Valverde, A.
    A graphical approach to monad composition2001Inngår i: Electronical Notes in Theoretical Computer Science, ISSN 1571-0661, E-ISSN 1571-0661, Vol. 40, s. 145-160Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    In this paper we show how composite expressions involving natural transformations can be pictorially represented in order to provide graphical proof support for providing monad compositions. Examples are drawn using powerset monads composed with the term monad.

  • 244.
    Eklund, Patrik
    et al.
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Galán, M.A.
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Medina, J.
    Ojeda Aciego, M.
    Valverde, A.
    Set functors and L-fuzzy set categories: towards a fuzzy programming paradigm2001Inngår i: Proc. International ICSC Symposium on Fuzzy Logic andApplications (FLA'2001), 2001, s. 658-664Konferansepaper (Fagfellevurdert)
  • 245.
    Eklund, Patrik
    et al.
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Galán, M.A.
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Medina, J.
    Ojeda-Aciego, M.
    Valverde, A.
    Setfunctors, L-fuzzysetcategories, and generalizedterms2002Inngår i: Computers and Mathematics with Applications, ISSN 0898-1221, E-ISSN 1873-7668, Vol. 43, nr 6-7, s. 693-705Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    In this work, we generalize previous constructions of fuzzysetcategories, introduced in [1], by consideringL-fuzzysets in which the values of the characteristic functions run on a completely distributive lattice, rather than in the unit real interval. Later, these L-fuzzysets are used to define the L-fuzzycategories, which are proven to be rational. In the final part of the paper, the L-fuzzyfunctors given by the extension principles are provided with a structure of monad which is used, together with the functorial definition of theterm monad, to provide monad compositions as a basis for a notion of generalisedterms.

  • 246.
    Eklund, Patrik
    et al.
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Galán, Maria Ángeles
    Ojeda-Aciego, Manuel
    Valverde, Agustin
    Set functors and generalised terms2000Inngår i: Information processing and management of uncertainty in knowledge-based systems: proceedings : eighth international conference, IPMU, Madrid, July 3-7, 2000. Vol. 3, Madrid: Consejo Superior de Investigaciones Científicas , 2000, Vol. III, s. 1595-1599Konferansepaper (Fagfellevurdert)
  • 247.
    Eklund, Patrik
    et al.
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Georgsson, Fredrik
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Unravelling the thrill of metric image spaces1999Inngår i: Lecture Notes in Computer Science, ISSN 0302-9743, E-ISSN 1611-3349, Vol. 1568, s. 275-285Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    In this paper we focus on distances between textures. and develop metrics on image spaces in contexts of image transformations. Given a metric on the range space, we can generate the initial topology for the domain space. For this topology we can obtain a corresponding metric using well-known metrization constructions, also providing granularity of the metrics. Examples are drawn front the Spatial Gray Level Dependency (SGLD) transformation and the application domain is texture recognition in medical imaging.

  • 248.
    Eklund, Patrik
    et al.
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Gutierrez Garcia, Javier
    Hoehle, Ulrich
    Kortelainen, Jari
    Complete Many-Valued Lattices2017Inngår i: 2017 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE), IEEE, 2017Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Let Sup be the category of complete lattices and join preserving maps. The aim of this paper is to show that the theory of complete many-valued lattices exists. For this purpose we recall the concept of many-valued preordered sets and show that the category of many-valued join-complete lattices is isomorphic to the category of right modules in Sup - a theorem which goes back to I. Stubbe in a more general context given by quantaloid enriched categories. Finally, we will explain the presented theory by some natural examples, and do not hesitate to apply the theory to a simple stochastic linear programming problem.

  • 249.
    Eklund, Patrik
    et al.
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Gutierrez Garcia, Javier
    Hoehle, Ulrich
    Kortelainen, Jari
    Non-Commutativity and Many-Valuedness: The Topological Representation of the Spectrum of C*-Algebras2017Inngår i: 2017 IEEE International Conference On Fuzzy Systems (FUZZ-IEEE), IEEE, 2017Konferansepaper (Fagfellevurdert)
    Abstract [en]

    In the past there have been made various attempts to define the spectrum of a non-commutative C*-algebra. But all these definitions have certain drawbacks - e.g. C.J. Mulvey's definition does not coincide with the standard definition of the spectrum in the commutative case. The aim of this paper is to give an alternative definition of the spectrum which does not suffer under this deficit - i.e. coincides with the standard situation in the commutative setting. For this purpose we recall some properties of balanced and bisymmetric quantales, introduce a definition of the spectrum of a C*-algebra working for the general case and develop subsequently its topological representation.

  • 250.
    Eklund, Patrik
    et al.
    Department of Computer Science, Åbo Akademi, Åbo, Finland.
    Gähler, Werner
    Completions and compactications by means of monads1993Inngår i: Fuzzy Logic: State of Art / [ed] Robert Lowen, Marc Roubens, Dordrecht: Kluwer Academic Publishers, 1993, s. 39-56Kapittel i bok, del av antologi (Fagfellevurdert)
2345678 201 - 250 of 840
RefereraExporteraLink til resultatlisten
Permanent link
Referera
Referensformat
  • apa
  • 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