Logo: to the web site of Uppsala University

uu.sePublications from Uppsala University
Change search
Refine search result
12131415161718 701 - 750 of 997
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • 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.
  • 701.
    Pears, Arnold
    et al.
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems.
    Nylén, Aletta
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
    Implications of anonymous assessment2015In: Proc. 45th ASEE/IEEE Frontiers in Education Conference, Piscataway, NJ: IEEE Press, 2015, p. 1404-1408Conference paper (Refereed)
    Abstract [en]

    The role of anonymous assessment in ensuring fair and equitable outcomes for students has been one of the major tenets of educational reform over the last few decades [1]. One of the major goals of these efforts is to reduce the impact of subconscious discriminatory behaviour in assigning grades based on perceptions of ability of gender or minority groups by the examiner. Recently however research has been emerging which challenges the widespread assumptions about the benefits of anonymity drawn from Newstead's work. Contrary results include the work of Dorsey and Colliver, 1995, in medical education, and Batten et al. 2013, who explore the impact of student reputation on assessment. These and many other studies conclude that anonymous assessment resulted in no apparent changes in assessment outcomes. In this paper we explore the implications of anonymity taking examples from educational settings where student anonymity is already an adopted practice. We discuss the positive and negative implications of student anonymity, and identify areas for future research.

  • 702.
    Pears, Arnold
    et al.
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems. Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Education Research.
    Nylén, Aletta
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science. Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Education Research.
    Daniels, Mats
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computer Systems. Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Education Research.
    A critical analysis of trends in student-centric engineering education and their implications for learning2016In: Proc. 46th ASEE/IEEE Frontiers in Education Conference, Piscataway, NJ: IEEE Press, 2016Conference paper (Refereed)
    Abstract [en]

    Student-centric education has emerged as a dominant aspect of Higher Education policy over the last two decades. Much has been written about the benefits of student active educational approaches, and applied educational research, for instance the meta-study of Hattie, places emphasis on student-centric learning practices that enhance achieved learning outcomes.

    Most existing studies have been evaluations of single courses. In contrast this study focusses on the complete study context of the learner, who typically is in the situation of reading two or three courses simultaneously.

    Our primary goal in this paper is to explore potential challenges as we attempt to scale up active learning to encompass the full curricula. We use a mixture of interview and survey data collected from staff, combined with course schedules and student input to explore some of the potential implications of mandating a student-centric approach over an entire curriculum.

  • 703.
    Pearson, Justin
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Faculty of Science and Technology, Biology, Department of Ecology and Evolution, Computing Science. COMPUTER SYSTEMS.
    Clifford Networks2003In: Complex-Valued Neural Networks Theories and Applications, 2003Chapter in book (Refereed)
  • 704.
    Pearson, Justin
    et al.
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Faculty of Science and Technology, Biology, Department of Ecology and Evolution, Computing Science. Datorteknik.
    Ågren, MagnusUppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Faculty of Science and Technology, Biology, Department of Ecology and Evolution, Computing Science. Datalogi.Bohlin, Markus
    Proceedings of the 1st International Workshop on Local Search Techniques in Constraint Satisfaction: LSCS 20042004Conference proceedings (editor) (Refereed)
  • 705.
    Persson, Siri
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science. Uppsala University, Disciplinary Domain of Science and Technology, Technology, Department of Engineering Sciences.
    Application of the German Traffic Sign Recognition Benchmark on the VGG16 network using transfer learning and bottleneck features in Keras2018Independent thesis Advanced level (professional degree), 20 credits / 30 HE creditsStudent thesis
    Abstract [en]

    Convolutional Neural Networks (CNNs) are successful tools in image classification. CNNs are inspired by the animal visual cortex using a similar connectivity pattern as between neurons. The purpose of this thesis is to create a classifier, using transfer learning, that manages to classify images of traffic signs from the German Traffic Sign Recognition Benchmark (GTSRB) with good accuracy and to improve the performance further by tuning the hyperparameters. The pre-trained CNN used is the VGG16 network from the paper "Very deep convolutional networks for large-scale image recognition". The result showed that the VGG16 network got an accuracy of 74.5\% for the hyperparameter set where the learning rate was 1e-6, the batch size was 15 and the dropout rate 0.3. The conclusion was that transfer learning using the bottleneck features is a good tool for building a classifier with only a small amount of training data available and that the results probably could be further improved using more real data or data augmentation both for training and testing and by tuning more of the hyperparameters in the network.

    Download full text (pdf)
    fulltext
  • 706.
    Petrini, Johan
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Division of Computing Science. Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
    Querying RDF Schema Views of Relational Databases2008Doctoral thesis, monograph (Other academic)
    Abstract [en]

    The amount of data found on the web today and its lack of semantics makes it increasingly harder to retrieve a particular piece of information. With the Resource Description Framework (RDF) every piece of information can be annotated with properties describing its semantics. The higher level language RDF Schema (RDFS) is defined in terms of RDF and provides means to describe classes of RDF resources and properties defined over these classes. Queries over RDFS data can be specified using the standard query language SPARQL. Since the majority of information in the world still resides in relational databases it should be investigated how to view and query their contents as views defined in terms of RDFS meta-data descriptions. However, processing of queries to general RDFS views over relational databases is challenging since the queries and view definitions are complex and the amount of data often is huge. A system, Semantic Web Abridged Relational Databases (SWARD), is developed to enable efficient processing of SPARQL queries to RDFS views of data in existing relational databases. The RDFS views, called universal property views (UPVs), are automatically generated provided a minimum of user input. A UPV is a general RDFS view of a relational database representing both its schema and data. Special attention is devoted to making the UPV represent as much of the relational database semantics as possible, including foreign and composite keys. A general query reduction algorithm, called PARtial evaluation of Queries (PARQ), for queries over complex views, such as UPVs, has been developed. The reduction algorithm is based on the program transformation technique partial evaluation. For UPVs, the PARQ algorithm is shown to elegantly reduce queries dramatically before regular cost-based optimization by a back-end relational DBMS. The results are verified by performance measurements of SPARQL queries to a commercial relational database.

  • 707.
    Petrini, Johan
    et al.
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Faculty of Science and Technology, Biology, Department of Ecology and Evolution, Computing Science. Datalogi.
    Risch, Tore
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Faculty of Science and Technology, Biology, Department of Ecology and Evolution, Computing Science. Datalogi.
    Processing queries over RDF views of wrapped relational databases2004In: 1st International Workshop on Wrapper Techniques for Legacy Systems, WRAP 2004,, 2004Conference paper (Refereed)
  • 708.
    Petrini, Johan
    et al.
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Faculty of Science and Technology, Biology, Department of Ecology and Evolution, Computing Science. Datalogi.
    Risch, Tore
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Faculty of Science and Technology, Biology, Department of Ecology and Evolution, Computing Science. Datalogi.
    Scalable RDF Views of Relational Databases through Partial Evaluation2006Report (Other scientific)
  • 709.
    Petrini, Johan
    et al.
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Faculty of Science and Technology, Biology, Department of Ecology and Evolution, Computing Science. Datalogi.
    Risch, Tore
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Faculty of Science and Technology, Biology, Department of Ecology and Evolution, Computing Science. Datalogi.
    SWARD: Semantic Web Abridged Relational Databases2007Conference paper (Other (popular scientific, debate etc.))
  • 710. Pichardie, David
    et al.
    Weber, TjarkUppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
    Proof Exchange for Theorem Proving: PxTP 20122012Conference proceedings (editor) (Refereed)
  • 711.
    Poncelet, Clément
    et al.
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology.
    Sagonas, Konstantinos
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science. Natl Tech Univ Athens, Athens, Greece.
    Tsiftes, Nicolas
    RISE Res Inst Sweden, Stockholm, Sweden.;KTH Digital Futures, Stockholm, Sweden..
    So Many Fuzzers, So Little Time: Experience from Evaluating Fuzzers on the Contiki-NG Network (Hay)Stack2022In: ASE '22: Proceedings of the 37th IEEE/ACM International Conference on Automated Software Engineering, Association for Computing Machinery (ACM), 2022, article id 95Conference paper (Refereed)
    Abstract [en]

    Fuzz testing ("fuzzing") is a widely-used and effective dynamic technique to discover crashes and security vulnerabilities in software, supported by numerous tools, which keep improving in terms of their detection capabilities and speed of execution. In this paper, we report our findings from using state-of-the-art mutation-based and hybrid fuzzers (AFL, Angora, Honggfuzz, Intriguer, MOPT-AFL, QSYM, and SYMCC) on a non-trivial code base, that of Contiki-NG, to expose and fix serious vulnerabilities in various layers of its network stack, during a period of more than three years. As a by-product, we provide a Git-based platform which allowed us to create and apply a new, quite challenging, open-source bug suite for evaluating fuzzers on real-world software vulnerabilities. Using this bug suite, we present an impartial and extensive evaluation of the effectiveness of these fuzzers, and measure the impact that sanitizers have on it. Finally, we offer our experiences and opinions on how fuzzing tools should be used and evaluated in the future.

    Download full text (pdf)
    fulltext
  • 712.
    Proenca, Jose
    et al.
    INESC TEC, HASLab, Braga, Portugal.;Univ Minho, Braga, Portugal.;Katholieke Univ Leuven, Dept Comp Sci, IMinds DistriNet, Louvain, Belgium..
    Clarke, Dave
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
    Typed Connector Families2016In: Formal Aspects Of Component Software, Springer, 2016, p. 294-311Conference paper (Refereed)
    Abstract [en]

    Typed models of connector/component composition specify interfaces describing ports of components and connectors. Typing ensures that these ports are plugged together appropriately, so that data can flow out of each output port and into an input port. These interfaces typically consider the direction of data flow and the type of values flowing. Components, connectors, and systems are often parameterised in such a way that the parameters affect the interfaces. Typing such connector families is challenging. This paper takes a first step towards addressing this problem by presenting a calculus of connector families with integer and boolean parameters. The calculus is based on monoidal categories, with a dependent type system that describes the parameterised interfaces of these connectors. As an example, we demonstrate how to define n-ary Reo connectors in the calculus. The paper focusses on the structure of connectors-well-connectedness-and less on their behaviour, making it easily applicable to a wide range of coordination and component-based models. A type-checking algorithm based on constraints is used to analyse connector families, supported by a proof-of-concept implementation.

  • 713.
    Proenca, Jose
    et al.
    Univ Minho, Dept Informat, P-4710057 Braga, Portugal;INESC TEC, P-4710057 Braga, Portugal.
    Clarke, Dave
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
    Typed connector families and their semantics2017In: Science of Computer Programming, ISSN 0167-6423, E-ISSN 1872-7964, Vol. 146, p. 28-49Article in journal (Refereed)
    Abstract [en]

    Typed models of connector/component composition specify interfaces describing ports of components and connectors. Typing ensures that these ports are plugged together appropriately, so that data can flow out of each output port and into an input port. These interfaces typically consider the direction of data flow and the type of values flowing. Components, connectors, and systems are often parameterised in such a way that the parameters affect the interfaces. Typing such connector families is challenging. This paper takes a first step towards addressing this problem by presenting a calculus of connector families with integer and boolean parameters. The calculus is based on monoidal categories, with a dependent type system that describes the parameterised interfaces of these connectors. We use families of Reo connectors as running examples, and show how this calculus can be applied to Petri Nets and to BIP systems. The paper focuses on the structure of connectors-well-connectedness-and less on their behaviour, making it easily applicable to a wide range of coordination and component-based models. A type-checking algorithm based on constraints is used to analyse connector families, supported by a proof of-concept implementation.

  • 714.
    Pålsson, Stefan
    et al.
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computational Science.
    Victor, BjörnUppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
    Proceedings från 5:e utvecklingskonferensen för Sveriges ingenjörsutbildningar2016Conference proceedings (editor) (Other academic)
  • 715.
    Raabjerg, Palle
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Division of Computing Science. Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
    Extending psi-calculi and their formal proofs2012Licentiate thesis, comprehensive summary (Other academic)
    Abstract [en]

    Psi-calculi is a parametric framework for extensions of the pi-calculus, with arbitrary data structures and logical assertions for facts about data. This thesis presents broadcast psi-calculi and higher-order psi-calculi, two extensions of the psi-calculi framework, allowing respectively one-to-many communications and the use of higher-order process descriptions through conditions in the parameterised logic. Both extensions preserve the purity of the psi-calculi semantics; the standard congruence and structural properties of bisimilarity are proved formally in Isabelle. The work going into the extensions show that depending on the specific extension, working out the formal proofs can be a work-intensive process. We find that some of this work could be automated, and implementing such automation may facilitate the development of future extensions to the psi-calculi framework.

    List of papers
    1. Broadcast Psi-calculi with an Application to Wireless Protocols
    Open this publication in new window or tab >>Broadcast Psi-calculi with an Application to Wireless Protocols
    Show others...
    2011 (English)In: Software Engineering and Formal Methods: SEFM 2011, Springer Berlin/Heidelberg, 2011, p. 74-89Conference paper, Published paper (Refereed)
    Abstract [en]

    Psi-calculi is a parametric framework for extensions of the pi-calculus, with arbitrary data structures and logical assertions for facts about data. In this paper we add primitives for broadcast communication % to the psi-calculi framework. in order to model wireless protocols. The additions preserve the purity of the psi-calculi semantics, and we formally prove the standard congruence and structural properties of bisimilarity. We demonstrate the expressive power of broadcast psi-calculi by modelling the wireless ad-hoc routing protocol LUNAR and verifying a basic reachability property.

    Place, publisher, year, edition, pages
    Springer Berlin/Heidelberg, 2011
    Series
    Lecture Notes in Computer Science, ISSN 0302-9743 ; 7041
    National Category
    Computer Sciences
    Identifiers
    urn:nbn:se:uu:diva-156736 (URN)10.1007/978-3-642-24690-6_7 (DOI)978-3-642-24689-0 (ISBN)
    Conference
    9th International Conference on Software Engineering and Formal Methods, November 14-18, 2011, Montevideo, Uruguay
    Projects
    ProFuNUPMARC
    Available from: 2011-12-06 Created: 2011-08-08 Last updated: 2018-01-12Bibliographically approved
    2. Higher-order psi-calculi
    Open this publication in new window or tab >>Higher-order psi-calculi
    2014 (English)In: Mathematical Structures in Computer Science, ISSN 0960-1295, E-ISSN 1469-8072, Vol. 24, no 2, article id e240203Article in journal (Refereed) Published
    Abstract [en]

    Psi-calculi is a parametric framework for extensions of the pi-calculus; in earlier work we have explored their expressiveness and algebraic theory. In this paper we consider higher-order psi-calculi through a technically surprisingly simple extension of the framework, and show how an arbitrary psi-calculus can be lifted to its higher-order counterpart in a canonical way. We illustrate this with examples and establish an algebraic theory of higher-order psi-calculi. The formal results are obtained by extending our proof repositories in Isabelle/Nominal.

    Place, publisher, year, edition, pages
    Cambridge University Press, 2014
    Keywords
    process calculi, psi calculi, isabelle, theorem proving, nominal, higher-order
    National Category
    Computer Sciences
    Identifiers
    urn:nbn:se:uu:diva-183610 (URN)10.1017/S0960129513000170 (DOI)000343643500003 ()
    Projects
    UPMARCProFuN
    Funder
    Swedish Foundation for Strategic Research
    Available from: 2013-06-24 Created: 2012-10-30 Last updated: 2018-01-12Bibliographically approved
    Download full text (pdf)
    fulltext
  • 716.
    Ramezanian, Rasoul
    et al.
    Sharif Univ Technol, Tehran, Iran.
    Salehi, Mostafa
    Univ Tehran, Tehran 14174, Iran; Univ Bologna, I-40126 Bologna, Italy.
    Magnani, Matteo
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
    Montesi, Danilo
    Univ Bologna, I-40126 Bologna, Italy.
    Diffusion of Innovations over Multiplex Social Networks2015In: International Symposium on Artificial Intelligence and Signal Processing (AISP), 2015, p. 1-5Conference paper (Refereed)
    Abstract [en]

    The ways in which an innovation (e.g., new behaviour, idea, technology, product) diffuses among people can determine its success or failure. In this paper, we address the problem of diffusion of innovations over multiplex social networks where the neighbours of a person belong to one or multiple networks (or layers) such as friends, families, or colleagues. To this end, we generalise one of the basic game-theoretic diffusion models, called networked coordination game, for multiplex networks. We present analytical results for this extended model and validate them through a simulation study, finding among other properties a lower bound for the success of an innovation.While simple and leading to intuitively understandable results, to the best of our knowledge this is the first extension of a game-theoretic innovation diffusion model for multiplex networks and as such it provides a basic framework to study more sophisticated innovation dynamics.

  • 717.
    Rantzer, Måns
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
    Predictive analysis at Krononfogden: Classifying first-time debtors with an uplift model2016Independent thesis Advanced level (professional degree), 20 credits / 30 HE creditsStudent thesis
    Abstract [en]

    The use of predictive analysis is becoming more commonplace with each passing day,

    which lends increased credence to the fact that even governmental institutions should

    adopt it. Kronofogden is in the middle of a digitization process and is therefore in a

    unique position to implement predictive analysis into the core of their operations.

    This project aims to study if methods from predictive analysis can predict how many

    debts will be received for a first-time debtor, through the use of uplift modeling. The

    difference between uplift modeling and conventional modeling is that it aims to

    measure the difference in behavior after a treatment, in this case guidance from

    Kronofogden. Another aim of the project is to examine whether the scarce literature

    about uplift modeling have it right about how the conventional two-model approach

    fails to perform well in practical situations.

    The project shows similar results as Kronofogden’s internal evaluations. Three

    models were compared: random forests, gradient-boosted models and neural

    networks, the last performing the best. Positive uplift could be found for 1-5% of the

    debtors, meaning the current cutoff level of 15% is too high. The models have several

    potential sources of error, however: modeling choices, that the data might not be

    informative enough or that the actual expected uplift for new data is equal to zero.

    Download full text (pdf)
    Predictive analysis at Kronofogden: Classifying first-time debtors with an uplift model
  • 718. Reboh, Rene
    et al.
    Risch, Tore
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Faculty of Science and Technology, Biology, Department of Ecology and Evolution, Computing Science. Datalogi.
    A Data-Driven, Functional Expert System Shell1989Patent (Other (popular scientific, debate etc.))
  • 719. Reboh, Rene
    et al.
    Risch, Tore
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Faculty of Science and Technology, Biology, Department of Ecology and Evolution, Computing Science. Datalogi.
    Syntel: Knowledge programming using functional representations1986In: AAAI Conference, 1986Conference paper (Refereed)
    Abstract [en]

    SYNTELTM is a novel knowledge representation language that provides traditional features of expert system shells within a pure functional programming paradigm. However, it differs sharply from existing functional languages in many ways, ranging from its ability to deal with uncertainty to its evaluation procedures. A very flexible user-interface definition facility is tightly integrated with the SYNTEL interpreter, giving the knowledge engineer full control over both form and content of the end-user system. SYNTEL is fully implemented and has been successfully used to develop large knowledge bases dealing with problems of risk assessment.

  • 720. Reed, Sean
    et al.
    Löfstrand, Magnus
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science. Luleå University of Technology.
    Karlsson, Lennart
    Andrews, John
    Service support system modelling language for simulation-driven development of functional products2013In: Procedia CIRP, ISSN 2212-8271, E-ISSN 2212-8271, Vol. 11, p. 420-424Article in journal (Refereed)
  • 721. Richardson, Ita
    et al.
    Ahmad, BilalPremanandan, ShwetaUppsala University, Disciplinary Domain of Humanities and Social Sciences, Faculty of Social Sciences, Department of Informatics and Media. Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Division Vi3.Doody, OwenBeecham, SarahOuhbi, SofiaUppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.Alshammari, MuneefCajander, ÅsaUppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computerized Image Analysis and Human-Computer Interaction. Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Division Vi3. Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Education Research. Uppsala University, Disciplinary Domain of Humanities and Social Sciences, Faculty of Social Sciences, Department of Informatics and Media.
    Generic Requirements for Inclusive Healthcare Software: Supporting Older Adults and People with Intellectual and Developmental Disability2023Conference proceedings (editor) (Refereed)
    Abstract [en]

    As healthcare technology advances, it is important to ensure that everyone benefits from healthcare software, regardless of age or ability. That is why our research team has been working to identify and encapsulate the unique needs of two groups when developing software systems: older adults and people with mild intellectual and developmental disabilities. Through our research, we have developed design patterns that software engineers can use to create more usable healthcare software to support these groups. These patterns identify the generic requirements for usability including accessibility, crucial for creating software that meets the needs of marginalised populations. In this paper, we describe the steps we undertook to identify and develop these requirements. We discover many overlapping needs of these two cohorts. Our research aims to benefit older adults and people with mild intellectual and developmental disabilities and improve the lives of many others facing similar challenges. As we expand our research to other cohorts, we will be able to identify additional generic requirements that make healthcare software development more inclusive and effective.

  • 722. Richardson, Julian
    et al.
    Flener, Pierre
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Faculty of Science and Technology, Biology, Department of Ecology and Evolution, Computing Science. CSD.
    Program schemas as proof methods.2003Report (Other scientific)
  • 723.
    Risch, Tore
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Faculty of Science and Technology, Biology, Department of Ecology and Evolution, Computing Science. Datalogi.
    A Data Base Extension of Prolog and its Implementation1982Report (Other scientific)
  • 724.
    Risch, Tore
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Faculty of Science and Technology, Biology, Department of Ecology and Evolution, Computing Science. Datalogi.
    A flexible and external data dictionary system for program generation1980In: International Conference on Data Bases, 1980Conference paper (Refereed)
  • 725.
    Risch, Tore
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Faculty of Science and Technology, Biology, Department of Ecology and Evolution, Computing Science. Datalogi.
    ALisp User's Guide2000Report (Other scientific)
  • 726.
    Risch, Tore
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Faculty of Science and Technology, Biology, Department of Ecology and Evolution, Computing Science. Datalogi.
    Amos II External Interfaces2000Report (Other scientific)
  • 727.
    Risch, Tore
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Faculty of Science and Technology, Biology, Department of Ecology and Evolution, Computing Science.
    An interactive report generator language for a relational database system allowing user defined aggregation operators1982Report (Other scientific)
  • 728.
    Risch, Tore
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Faculty of Science and Technology, Biology, Department of Ecology and Evolution, Computing Science. Datalogi.
    An Interpreter for Functional Rules1982Report (Other scientific)
  • 729.
    Risch, Tore
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
    Distributed Architecture, et cetera2009In: Encyclopedia of Database Systems / [ed] Liu, Ling; Özsu, M. Tamer, Springer , 2009Chapter in book (Other academic)
  • 730.
    Risch, Tore
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Faculty of Science and Technology, Biology, Department of Ecology and Evolution, Computing Science. COMPUTING SCIENCE.
    Functional Queries to Wrapped Educational Semantic Web Meta-data2003In: Functional Queries to Wrapped Educational Semantic Web Meta-data, 2003Chapter in book (Refereed)
  • 731.
    Risch, Tore
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Faculty of Science and Technology, Biology, Department of Ecology and Evolution, Computing Science. Datalogi.
    IEIS - Integrated Engineering Information Systems1998Report (Other scientific)
  • 732.
    Risch, Tore
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Faculty of Science and Technology, Biology, Department of Ecology and Evolution, Computing Science. Datalogi.
    Intensionally Integrating Database and Expert Systems1988In: 1988 Intl. Symposium on Lucid and Intensional Programming, 1988Conference paper (Refereed)
  • 733.
    Risch, Tore
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Faculty of Science and Technology, Biology, Department of Ecology and Evolution, Computing Science. Datalogi.
    LIDAM - Lisp Data Manager1977Report (Other scientific)
  • 734.
    Risch, Tore
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Faculty of Science and Technology, Biology, Department of Ecology and Evolution, Computing Science. Datalogi.
    Mediators for Querying Heterogeneous Data2004In: The Practical Handbook of Internet Computing, Chapman & Hall/CRC, USA , 2004Chapter in book (Refereed)
  • 735.
    Risch, Tore
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Faculty of Science and Technology, Biology, Department of Ecology and Evolution, Computing Science. Datalogi.
    Method of Monitoring Changes in an Object-Oriented Database With Tuned Monitors1995Patent (Other (popular scientific, debate etc.))
  • 736.
    Risch, Tore
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Faculty of Science and Technology, Biology, Department of Ecology and Evolution, Computing Science. Datalogi.
    Method of Monitoring Changes in Attribute Values of Objects in an Object Oriented Database1992Patent (Other (popular scientific, debate etc.))
  • 737.
    Risch, Tore
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Faculty of Science and Technology, Biology, Department of Ecology and Evolution, Computing Science. Datalogi.
    Monitoring Database Objects1989In: The 15th International Conference on Very Large Databases, 1989Conference paper (Refereed)
  • 738.
    Risch, Tore
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Faculty of Science and Technology, Biology, Department of Ecology and Evolution, Computing Science. Datalogi.
    Monitoring Database Objects1988Report (Other scientific)
  • 739.
    Risch, Tore
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Faculty of Science and Technology, Biology, Department of Ecology and Evolution, Computing Science. Datalogi.
    PMG - Program Manipulator Generator1975Report (Other scientific)
  • 740.
    Risch, Tore
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Faculty of Science and Technology, Biology, Department of Ecology and Evolution, Computing Science. Datalogi.
    Production program generation in a flexible data dictionary system1980In: The 6th International Conference on Very Large Databases, 1980Conference paper (Refereed)
  • 741.
    Risch, Tore
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science. Datalogi.
    REMREC - A program for Automatic Recursion Removal1973Report (Other academic)
    Abstract [en]

    It is well known that recursive functions are very common in LISP. Recursive code is mostly the easiest to write and to analyse. However, situations often arise when it is preferable to let the computer work with non recursive functions. Examples of this are in compiled code and on stack overflow. It is then very often possible to remove recursion (at least partly) in the functions, without therefore introducing stacks in the new code.

    Remrec is a program, which automatically transfers some classes of recursive LISP functions into equivalent non recursive ones, without introducing stacks.

    Download full text (pdf)
    fulltext
  • 742.
    Risch, Tore
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Faculty of Science and Technology, Biology, Department of Ecology and Evolution, Computing Science.
    The Translation of Object-Oriented Queries to Optimized Datalog Programs1991Report (Other scientific)
  • 743.
    Risch, Tore
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Faculty of Science and Technology, Biology, Department of Ecology and Evolution, Computing Science. Datalogi.
    Tuning the Reactivity of Database Monitors1990Report (Other scientific)
  • 744.
    Risch, Tore
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Faculty of Science and Technology, Biology, Department of Ecology and Evolution, Computing Science. Datalogi.
    Using Dynamic Generic Functions in Lisp like Lanuages1981Report (Other scientific)
  • 745.
    Risch, Tore
    et al.
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Faculty of Science and Technology, Biology, Department of Ecology and Evolution, Computing Science. Datalogi.
    Hägglund, Sture
    Keyes, David
    Lyytinen, Kalle
    Rolland, Colette
    Salomaa, Arto
    Shaufelberger, Walter
    Solgaard, Olav
    Svensson, Arne
    Research in Information and Communication Technology in Norwegian Universities and Colleges - A review2002Report (Other scientific)
  • 746.
    Risch, Tore
    et al.
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Faculty of Science and Technology, Biology, Department of Ecology and Evolution, Computing Science. Datalogi.
    Ivanova, Milena
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Faculty of Science and Technology, Biology, Department of Ecology and Evolution, Computing Science. Datalogi.
    High-performance Stream-oriented GRID Database Manager for Scientific Data,2003In: Proc. 1st European Across Grids Conference, 2003Conference paper (Refereed)
  • 747.
    Risch, Tore
    et al.
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Faculty of Science and Technology, Biology, Department of Ecology and Evolution, Computing Science. Datalogi.
    Ivanova, Milena
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Faculty of Science and Technology, Biology, Department of Ecology and Evolution, Computing Science. Datalogi.
    Thide, Bo
    Department of Medical Pharmacology. Faculty of Science and Technology, Biology, Department of Ecology and Evolution, Computing Science.
    High-performance GRID Database Manager for Scientific Data2002In: Workshop on Distributed Data & Structures - WDAS-2002, Paris, France, 2002Conference paper (Refereed)
  • 748.
    Risch, Tore
    et al.
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Faculty of Science and Technology, Biology, Department of Ecology and Evolution, Computing Science. COMPUTING SCIENCE DEPARTMENT.
    Josifovski, Vanja
    Distributed Data Integration by Object-Oriented Mediator Servers2001In: Concurrency and Computation: Practice and Experience, Vol. 13, no 11Article in journal (Refereed)
  • 749.
    Risch, Tore
    et al.
    Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Faculty of Science and Technology, Biology, Department of Ecology and Evolution, Computing Science. COMPUTING SCIENCE.
    Josifovski, Vanja
    Katchaounov, Timour
    Functional Data Integration in a Distributed Mediator System2003Chapter in book (Refereed)
  • 750.
    Risch, Tore
    et al.
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
    Madden, Samuel
    MIT.
    Balakrishan, Hari
    MIT.
    Girod, Lewis
    MIT.
    Newton, Ryan
    MIT.
    Ivanova, Milena
    CWI, The Netherlands.
    Zeitler, Erik
    Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology, Computing Science.
    Gehrke, Johannes
    Cornell University.
    Panda, Biswanath
    Cornell University.
    Riedewald, Mirek
    Cornell University.
    Analyzing data streams in scientific applications2009In: Scientific Data Management: Challenges, Technology, and Deployment / [ed] Shoshani, Arie; Rotem, Doron, London: Chapman & Hall/CRC , 2009, 1, p. 399-432Chapter in book (Other academic)
12131415161718 701 - 750 of 997
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • 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