uu.seUppsala universitets publikasjoner
Endre søk
Begrens søket
3456789 251 - 300 of 2077
RefereraExporteraLink til resultatlisten
Permanent link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association
  • 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.
  • 251. Beldiceanu, Nicolas
    et al.
    Flener, Pierre
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi. Teknisk-naturvetenskapliga fakulteten, Biologiska sektionen, Institutionen för ekologi och evolution, Datalogi. CSD.
    Lorca, Xavier
    Partitionnement de graphes par des arbres sous contraintes de degré2006Inngår i: Deuxièmes Journées Francophones de Programmation par Contraintes (JFPC'06), 2006Konferansepaper (Fagfellevurdert)
  • 252. Beldiceanu, Nicolas
    et al.
    Flener, Pierre
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi. Teknisk-naturvetenskapliga fakulteten, Biologiska sektionen, Centrum för bioinformatik. Institutionen för ekologi och evolution, Datalogi. Datalogi.
    Lorca, Xavier
    The tree constraint2005Inngår i: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems: Second International Conference, CPAIOR 2005, Proceedings, 2005, s. 64-78Konferansepaper (Fagfellevurdert)
  • 253. Beldiceanu, Nicolas
    et al.
    Flener, Pierre
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
    Monette, Jean-Noël
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
    Pearson, Justin
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
    Simonis, Helmut
    Toward sustainable development in constraint programming2014Inngår i: Constraints, ISSN 1383-7133, E-ISSN 1572-9354, Vol. 19, nr 2, s. 139-149Artikkel i tidsskrift (Fagfellevurdert)
  • 254. Beldiceanu, Nicolas
    et al.
    Flener, Pierre
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
    Pearson, Justin
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
    Van Hentenryck, Pascal
    Propagating regular counting constraints2014Inngår i: Proc. 28th AAAI Conference on Artificial Intelligence: Volume 4, Palo Alto, CA: AAAI Press, 2014, s. 2616-2622Konferansepaper (Fagfellevurdert)
  • 255.
    Bengtson, Jesper
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Avdelningen för datorteknik. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Formalising process calculi2010Doktoravhandling, monografi (Annet vitenskapelig)
    Abstract [en]

    As the complexity of programs increase, so does the complexity of the models required to reason about them. Process calculi were introduced in the early 1980s and have since then been used to model communication protocols of varying size and scope. Whereas modeling sophisticated  protocols in simple process algebras like CCS or the pi-calculus is doable, expressing the models required is often gruesome and error prone. To combat this, more advanced process calculi were introduced, which significantly reduce the complexity of the models. However, this simplicity comes at a price -- the theories of the calculi themselves instead become gruesome and error prone, establishing their mathematical and logical properties has turned out to be difficult. Many of the proposed calculi have later turned out to be inconsistent.

    The contribution of this thesis is twofold. First we provide methodologies to formalise the meta-theory of process calculi in an interactive theorem prover. These are used to formalise significant parts of the meta-theory of CCS and the pi-calculus in the theorem prover Isabelle, using Nominal Logic to allow for a smooth treatment of the binders. Second we introduce and formalise psi-calculi, a framework for process calculi incorporating several existing ones, including those we already formalised, and which is significantly simpler and substantially more expressive. Our methods scale well as complexity of the calculi increases.

    The formalised results for all calculi include congruence results for both strong and weak bisimilarities, in the case of the pi-calculus for both the early and the late operational semantics. For the finite pi-calculus, we also formalise the proof that the axiomatisation of strong late bisimilarity is sound and complete. We believe psi-calculi to be the state of the art of process calculi, and our formalisation to be the most extensive formalisation of process calculi ever done inside a theorem prover.

  • 256.
    Bengtson, Jesper
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
    Bhargavan, Karthikeyan
    Fournet, Cédric
    Gordon, Andrew D.
    Maffeis, Sergio
    Refinement types for secure implementations2011Inngår i: ACM Transactions on Programming Languages and Systems, ISSN 0164-0925, E-ISSN 1558-4593, Vol. 33, nr 2, s. 8:1-45Artikkel i tidsskrift (Fagfellevurdert)
  • 257.
    Bengtson, Jesper
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Bhargavan, Karthikeyan
    Fournet, Cédric
    Gordon, Andrew D.
    Maffeis, Sergio
    Refinement Types for Secure Implementations2008Inngår i: Proc. 21st IEEE Computer Security Foundations Symposium, Piscataway, NJ: IEEE , 2008, s. 17-32Konferansepaper (Fagfellevurdert)
  • 258.
    Bengtson, Jesper
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
    Johansson, Magnus
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
    Parrow, Joachim
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
    Victor, Björn
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
    Psi-calculi: a framework for mobile processes with nominal data and logic2011Inngår i: Logical Methods in Computer Science, ISSN 1860-5974, E-ISSN 1860-5974, Vol. 7, nr 1, s. 11-Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    The framework of psi-calculi extends the pi-calculus with nominal datatypes for data structures and for logical assertions and conditions. These can be transmitted between processes and their names can be statically scoped as in the standard pi-calculus. Psi-calculi can capture the same phenomena as other proposed extensions of the pi-calculus such as the applied pi-calculus, the spi-calculus, the fusion calculus, the concurrent constraint pi-calculus, and calculi with polyadic communication channels or pattern matching. Psi-calculi can be even more general, for example by allowing structured channels, higher-order formalisms such as the lambda calculus for data structures, and predicate logic for assertions.

    We provide ample comparisons to related calculi and discuss a few significant applications. Our labelled operational semantics and definition of bisimulation is straightforward, without a  structural congruence. We establish minimal requirements on the nominal data and logic in order to prove general algebraic properties of psi-calculi, all of which have been checked in the interactive theorem prover Isabelle. Expressiveness of psi-calculi significantly exceeds that of other formalisms, while the purity of the semantics is on par with the original pi-calculus.

  • 259.
    Bengtson, Jesper
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
    Johansson, Magnus
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
    Parrow, Joachim
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
    Victor, Björn
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
    Psi-calculi: Mobile processes, nominal data, and logic2009Inngår i: Proc. 24th Annual IEEE Symposium on Logic in Computer Science, Piscataway, NJ: IEEE , 2009, s. 39-48Konferansepaper (Fagfellevurdert)
    Abstract [en]

    A psi-calculus is an extension of the pi-calculus with nominal data types for data structures and for logical assertions representing facts about data. These can be transmitted between processes and their names can be statically scoped using the standard pi-calculus mechanism to allow for scope migrations.

    Other proposed extensions of pi can be formulated as psi-calculi; examples include the applied pi-calculus, the spi-calculus, the fusion calculus, the concurrent constraint pi-calculus, and calculi with polyadic communication channels or pattern matching. Psi-calculi can be even more general, for example by allowing structured channels, higher-order formalisms such as the lambda calculus for data structures, and a predicate logic for assertions.

    Our labelled operational semantics and definition of bisimulation is straightforward, without a  structural congruence. We establish minimal requirements on the nominal data and logic in order to prove general algebraic properties of psi-calculi. The proofs are transparent enough to be checked in the interactive proof checker Isabelle.

    We are the first to formulate a truly compositional labelled operational semantics for calculi of this caliber. Expressiveness and therefore modelling convenience significantly exceeds that of other formalisms, while the purity of the semantics is on par with the original pi-calculus.

  • 260.
    Bengtson, Jesper
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
    Parrow, Joachim
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
    A completeness proof for bisimulation in the pi-calculus using Isabelle2007Inngår i: Electronical Notes in Theoretical Computer Science, ISSN 1571-0661, E-ISSN 1571-0661, Vol. 192, nr 1, s. 61-75Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    We use the interactive theorem prover Isabelle to prove that the algebraic axiomatization of bisimulation equivalence in the pi-calculus is sound and complete. This is the first proof of its kind to be wholly machine checked. Although the result has been known for some time the proof had parts which needed careful attention to detail to become completely formal. It is not that the result was ever in doubt;rather, our contribution lies in the methodology to prove completeness and get absolute certainty that the proof is correct, while at the same time following the intuitive lines of reasoning of the original proof. Completeness of axiomatizations is relevant for many variants of the calculus, so our method has applications beyond this single result. We build on our previous effort of implementing a framework for the pi-calculus in Isabelle using the nominal data type package, and strengthen our claim that this framework is well suited to represent the theory of the pi-calculus, especially in the smooth treatment of bound names.

  • 261.
    Bengtson, Jesper
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
    Parrow, Joachim
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
    Formalising the π-calculus using nominal logic2009Inngår i: Logical Methods in Computer Science, ISSN 1860-5974, E-ISSN 1860-5974, Vol. 5, nr 2, s. 16:1-36Artikkel i tidsskrift (Fagfellevurdert)
  • 262.
    Bengtson, Jesper
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
    Parrow, Joachim
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
    Psi-calculi in Isabelle2009Inngår i: Theorem Proving in Higher Order Logics, Berlin: Springer-Verlag , 2009, s. 99-114Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Psi-calculi are extensions of the pi-calculus, accommodating arbitrary nominal datatypes to represent not only data but also communication channels, assertions and conditions, giving it an expressive power beyond the applied pi-calculus and the concurrent constraint pi-calculus.

    We have formalised psi-calculi in the interactive theorem prover Isabelle using its nominal datatype package. One distinctive feature is that the framework needs to treat binding sequences, as opposed to single binders, in an efficient way. While different methods for formalising single binder calculi have been proposed over the last decades, representations for such binding sequences are not very well explored.

    The main effort in the formalisation is to keep the machine checked proofs as close to their pen-and-paper counterparts as possible. We discuss two approaches to reasoning about binding sequences along with their strengths and weaknesses. We also cover custom induction rules to remove the bulk of manual alpha-conversions.

  • 263.
    Bengtson, Jesper
    et al.
    IT Univ Copenhagen, Copenhagen, Denmark..
    Parrow, Joachim
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
    Weber, Tjark
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
    Psi-Calculi in Isabelle2016Inngår i: Journal of automated reasoning, ISSN 0168-7433, E-ISSN 1573-0670, Vol. 56, nr 1, s. 1-47Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    This paper presents a mechanisation of psi-calculi, a parametric framework for modelling various dialects of process calculi including (but not limited to) the pi-calculus, the applied pi-calculus, and the spi calculus. psi-calculi are significantly more expressive, yet their semantics is as simple in structure as the semantics of the original pi-calculus. Proofs of meta-theoretic properties for psi-calculi are more involved, however, not least because psi-calculi (unlike simpler calculi) utilise binders that bind multiple names at once. The mechanisation is carried out in the Nominal Isabelle framework, an interactive proof assistant designed to facilitate formal reasoning about calculi with binders. Our main contributions are twofold. First, we have developed techniques that allow efficient reasoning about calculi that bind multiple names in Nominal Isabelle. Second, we have adopted these techniques to mechanise substantial results from the meta-theory of psi-calculi, including congruence properties of bisimilarity and the laws of structural congruence. To our knowledge, this is the most extensive formalisation of process calculi mechanised in a proof assistant to date.

  • 264.
    Bengtsson, Johan
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Yi, Wang
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    On Clock Difference Constraints and Termination in Reachability Analysis of Timed Automata2003Inngår i: Formal Methods and Software Engineering, 5th International Conference on Formal Engineering Methods, ICFEM 2003, Singapore, November 5-7, 2003, 2003Konferansepaper (Fagfellevurdert)
  • 265.
    Bennich-Björkman, Li
    Uppsala universitet, Humanistisk-samhällsvetenskapliga vetenskapsområdet, Samhällsvetenskapliga fakulteten, Statsvetenskapliga institutionen. Uppsala universitet, Humanistisk-samhällsvetenskapliga vetenskapsområdet, Samhällsvetenskapliga fakulteten, Institutet för Rysslands- och Eurasienstudier.
    Around the corner?: Female empowerment, security, and elite mind-sets in Georgia2018Inngår i: Gendering Postsocialism: Old Legacies and New Hierarchies / [ed] Gradskova, Y Morell, IA, Routledge, 2018, s. 54-70Konferansepaper (Fagfellevurdert)
  • 266.
    Berg, Erik
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Avdelningen för datorteknik. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Efficient and Flexible Characterization of Data Locality through Native Execution Sampling2005Doktoravhandling, med artikler (Annet vitenskapelig)
    Abstract [en]

    Data locality is central to modern computer designs. The widening gap between processor speed and memory latency has introduced the need for a deep hierarchy of caches. Thus, the performance of an application is to a large extent dependent on the amount of data locality the caches can exploit. Some data locality comes naturally from the way most programs are written and the way their data is allocated in the memory. Compilers further try to create data locality by loop transformations and optimized data layout. Different ways of writing a program and/or laying out its data may improve an application’s locality even more. However, it is far from obvious how such a locality optimization can be achieved, especially since the optimizing compiler may have left the optimization job half done. Thus, efficient tools are needed to guide the software developers on their quest for data locality.

    The main contribution of this dissertation is a sample-based novel method for analyzing the data locality of an application. Very sparse data is collected during a single execution of the studied application. The sparse sampling adds a minimum overhead to the execution time, which enables complex applications running realistic data sets to be studied. The architecturalindependent information collected during the execution is fed to a mathematical cache model for predicting the cache miss ratio. The sparsely-collected data can be used to characterize the application’s data locality in respect to almost any possible cache hierarchy, such as complicated multiprocessor memory systems with multilevel cache hierarchies. Any combination of cache size, cache line size and degree of sharing can be modeled. Each new modeled design point takes only a fraction of a second to evaluate, even though the application from which the sampled data was collected may have executed for hours. This makes the tool not just usable for software developers, but also for hardware developers who need to evaluate a huge memory-system design space.

    We also discuss different ways of presenting data-locality information to a programmer in an intuitive and easily interpreted way. Some of the locality metrics we introduce utilize the flexibility of our algorithm and its ability to vary different cache parameters for one run. The dissertation also presents several prototype implementations of tools for profiling the memory system.

    Delarbeid
    1. SIP: Performance Tuning through Source Code Interdependence
    Åpne denne publikasjonen i ny fane eller vindu >>SIP: Performance Tuning through Source Code Interdependence
    2002 Inngår i: Proceedings of the 8th International Euro-Par ConferenceArtikkel i tidsskrift (Fagfellevurdert) Published
    Identifikatorer
    urn:nbn:se:uu:diva-93582 (URN)
    Tilgjengelig fra: 2005-10-19 Laget: 2005-10-19bibliografisk kontrollert
    2. StatCache: A Probabilistic Approach to Efficient and Accurate Data Locality Analysis
    Åpne denne publikasjonen i ny fane eller vindu >>StatCache: A Probabilistic Approach to Efficient and Accurate Data Locality Analysis
    2004 Inngår i: Proceedings of the 2004 IEEE International Symposium on Performance Analysis of Systems and SoftwareArtikkel i tidsskrift (Fagfellevurdert) Published
    Identifikatorer
    urn:nbn:se:uu:diva-93583 (URN)
    Tilgjengelig fra: 2005-10-19 Laget: 2005-10-19bibliografisk kontrollert
    3. Fast Data-Locality Profiling of Native Execution
    Åpne denne publikasjonen i ny fane eller vindu >>Fast Data-Locality Profiling of Native Execution
    2005 (engelsk)Inngår i: ACM SIGMETRICS Performance Evaluation Review, ISSN 0163-5999, Vol. 33, nr 1, s. 169-180Artikkel i tidsskrift (Fagfellevurdert) Published
    HSV kategori
    Identifikatorer
    urn:nbn:se:uu:diva-93584 (URN)10.1145/1071690.1064232 (DOI)
    Tilgjengelig fra: 2005-10-19 Laget: 2005-10-19 Sist oppdatert: 2018-01-13bibliografisk kontrollert
    4. A Statistical Multiprocessor Cache Model
    Åpne denne publikasjonen i ny fane eller vindu >>A Statistical Multiprocessor Cache Model
    2006 (engelsk)Inngår i: Proc. International Symposium on Performance Analysis of Systems and Software: ISPASS 2006, Piscataway, NJ: IEEE , 2006, s. 89-99Konferansepaper, Publicerat paper (Fagfellevurdert)
    sted, utgiver, år, opplag, sider
    Piscataway, NJ: IEEE, 2006
    HSV kategori
    Identifikatorer
    urn:nbn:se:uu:diva-93585 (URN)10.1109/ISPASS.2006.1620793 (DOI)1-4244-0186-0 (ISBN)
    Tilgjengelig fra: 2005-10-19 Laget: 2005-10-19 Sist oppdatert: 2018-01-13bibliografisk kontrollert
  • 267.
    Berg, Erik
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Hagersten, Erik
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Fast Data-Locality Profiling of Native Execution2005Inngår i: ACM SIGMETRICS Performance Evaluation Review, ISSN 0163-5999, Vol. 33, nr 1, s. 169-180Artikkel i tidsskrift (Fagfellevurdert)
  • 268.
    Berg, Erik
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Zeffer, Håkan
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Hagersten, Erik
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    A Statistical Multiprocessor Cache Model2006Inngår i: Proc. International Symposium on Performance Analysis of Systems and Software: ISPASS 2006, Piscataway, NJ: IEEE , 2006, s. 89-99Konferansepaper (Fagfellevurdert)
  • 269.
    Berg, Therese
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Avdelningen för datorteknik. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Regular inference for reactive systems2006Licentiatavhandling, med artikler (Annet vitenskapelig)
    Abstract [en]

    Models of reactive systems play a central role in many techniques for verification and analysis of reactive systems. Both a specification of the system and the abstract behavior of the system can be expressed in a formal model. Compliance with the functional parts in the specification can be controlled in different ways. Model checking techniques can be applied to a model of the system or directly to source code. In testing, model-based techniques can generate test suites from specification. A bottleneck in model-based techniques is however to construct a model of the system. This work concerns a technique that automatically constructs a model of a system without access to specification, code or internal structure. We assume that responses of the system to sequences of input can be observed. In this setting, so called regular inference techniques build a model of the system based on system responses to selected input sequences.

    There are three main contributions in this thesis. The first is a survey on the most well-known techniques for regular inference. The second is an analysis of Angluin's algorithm for regular inference on synthesized examples. On a particular type of examples, with prefix-closed languages, typically used to model reactive systems, the required number of input sequences grow approximately quadratically in the number of transitions of the system. However, using an optimization for systems with prefix-closed languages we were able to reduce the number of required input sequences with about 20%. The third contribution is a developed regular inference technique for systems with parameters. This technique aims to better handle entities of communications protocols where messages normally have many parameters of which few determine the subsequent behavior of the system. Experiments with our implementation of the technique confirm a reduction of the required number of input sequences, in comparison with Angluin's algorithm.

  • 270.
    Berg, Therese
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Jonsson, Bengt
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Raffelt, Harald
    Regular Inference for State Machines Using Domains with Equality Tests2008Inngår i: Fundamental Approaches to Software Engineering / [ed] Fiadeiro JL; Inverardi P, Berlin: Springer-Verlag , 2008, s. 317-331Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Existing algorithms for regular inference (aka automata learning) allows to infer a finite state machine by observing the output that the machine produces in response to a selected sequence of input strings. We generalize regular inference techniques to infer a class of state machines with an infinite state space. We consider Mealy machines extended with state variables that can assume values from a potentially unbounded domain. These values can be passed as parameters in input and output symbols, and can be used in tests for equality between state variables and/or message parameters. This is to our knowledge the first extension of regular inference to infinite-state systems. We intend to use these techniques to generate models of communication protocols from observations of their input-output behavior. Such protocols often have parameters that represent node adresses, connection identifiers, etc. that have a large domain, and on which test for equality is the only meaningful operation. Our extension consists of two phases. In the first phase we apply an existing inference technique for finite-state Mealy machines to generate a model for the case that the values are taken from a small data domain. In the second phase we transform this finite-state Mealy machine into an infinite-state Mealy machine by folding it into a compact symbolic form.

  • 271. Bergami, Giacomo
    et al.
    Magnani, Matteo
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datalogi.
    Montesi, Danilo
    University of Bologna.
    A Join Operator for Property Graphs2017Inngår i: EDBT/ICDT Workshops, 2017Konferansepaper (Fagfellevurdert)
    Abstract [en]

    In the graph database literature the term “join” does not refer to an operator combining two graphs, but involves path traversal queries over a single graph. Current languages express binary joins through the combination of path traversal queries with graph creation operations. Such solution proves to be not efficient.

    In this paper we introduce a binary graph join opera- tor and a corresponding algorithm outperforming the solution proposed by query languages for either graphs (Cypher, SPARQL) and relational databases (SQL). This is achieved by using a specific graph data structure in secondary memory showing better performance than state of the art graph libraries (Boost Graph Library, SNAP) and database systems (Sparksee). 

  • 272.
    Berggren, Martin
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Avdelningen för teknisk databehandling. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Numerisk analys.
    A vertex-centered, dual discontinuous Galerkin method2006Inngår i: Journal of Computational and Applied Mathematics, ISSN 0377-0427, E-ISSN 1879-1778, Vol. 192, s. 175-181Artikkel i tidsskrift (Fagfellevurdert)
  • 273.
    Berggren, Martin
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Avdelningen för teknisk databehandling. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Numerisk analys.
    Bängtsson, Erik
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Avdelningen för teknisk databehandling. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Numerisk analys.
    Noreland, Daniel
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Avdelningen för teknisk databehandling. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Numerisk analys.
    Multifrequency shape optimization of an acoustic horn2003Inngår i: Computational Fluid and Solid Mechanics: 2003, Elsevier Science , 2003, s. 2204-2207Konferansepaper (Fagfellevurdert)
  • 274. Berggren, Martin
    et al.
    Ekström, Sven-Erik
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Avdelningen för teknisk databehandling. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Numerisk analys.
    Nordström, Jan
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Avdelningen för teknisk databehandling. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Numerisk analys.
    A discontinuous Galerkin extension of the vertex-centered edge-based finite volume method2009Inngår i: Communications in Computational Physics, ISSN 1815-2406, E-ISSN 1991-7120, Vol. 5, s. 456-468Artikkel i tidsskrift (Fagfellevurdert)
  • 275.
    Berglund, Anders
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    How do students understand network protocols?: A phenomenographic study2002Rapport (Annet vitenskapelig)
  • 276.
    Berglund, Anders
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Avdelningen för datorteknik. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Learning computer systems in a distributed project course: The what, why, how and where2005Doktoravhandling, monografi (Annet vitenskapelig)
    Abstract [en]

    Senior university students taking an internationally distributed project course in computer systems find themselves in a complex learning situation. To understand how they experience computer systems and act in their learning situation, the what, the why, the how and the where of their learning have been studied from the students’ perspective. The what aspect concerns the students’ understanding of concepts within computer systems: network protocols. The why aspect concerns the students’ objectives to learn computer systems. The how aspect concerns how the students go about learning. The where aspect concerns the students’ experience of their learning environment. These metaphorical entities are then synthesised to form a whole.

    The emphasis on the students’ experience of their learning motivates a phenomenographic research approach as the core of a study that is extended with elements of activity theory. The methodological framework that is developed from these research approaches enables the researcher to retain focus on learning, and specifically the learning of computer systems, throughout.

    By applying the framework, the complexity in the learning is unpacked and conclusions are drawn on the students’ learning of computer systems. The results are structural, qualitative, and empirically derived from interview data. They depict the students’ experience of their learning of computer systems in their experienced learning situation and highlight factors that facilitate learning.

    The results comprise sets of qualitatively different categories that describe how the students relate to their learning in their experienced learning environment. The sets of categories, grouped after the four components (what, why, how and where), are synthesised to describe the whole of the students’ experience of learning computer systems.

    This study advances the discussion about learning computer systems and demonstrates how theoretically anchored research contributes to teaching and learning in the field. Its multi-faceted, multi-disciplinary character invites further debate, and thus, advances the field.

  • 277.
    Berglund, Anders
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Avdelningen för datorteknik. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    On the understanding of computer network protocols2002Licentiatavhandling, med artikler (Annet vitenskapelig)
    Abstract [en]

    How students learn about network protocols is studied in a project-centred, internationally distributed, university course in computer systems taught jointly by two universities. Insights into students' understanding of basic concepts within computer networks are gained through an empirical phenomenographic research approach.

    The use of phenomenography as a research approach makes it possible to learn about computer science, as it is experienced by the students. The context in which the research is carried out and issues concerning by whom the context is experienced, are investigated and form a part of the methodological basis.

    Students' understanding of some protocols that are used within the project, as well as their experience of the general concept of network protocols are investigated, and different ways of experiencing the protocols are discerned. Some aspects that indicate good learning outcomes are identified, such as being capable of understanding a protocol in different ways and of making relevant choices between the ways it could be experienced according to the context in which it appears.

    Based on these results a discussion on learning and teaching is developed. It is argued that a variation in the context in which the protocol is experienced promotes good learning, since different ways of experiencing a protocol are useful with different tasks to hand. A student with a good understanding of network protocols can choose in a situationally relevant way between different ways of experiencing a protocol.

    Delarbeid
    1. How do students understand network protocols?: A phenomenographic study
    Åpne denne publikasjonen i ny fane eller vindu >>How do students understand network protocols?: A phenomenographic study
    2002 (engelsk)Rapport (Annet vitenskapelig)
    Serie
    Technical report / Department of Information Technology, Uppsala University, ISSN 1404-3203 ; 2002-006
    HSV kategori
    Identifikatorer
    urn:nbn:se:uu:diva-44859 (URN)
    Tilgjengelig fra: 2008-11-26 Laget: 2008-11-26 Sist oppdatert: 2018-01-11
    2. On context in phenomenographic research on understanding heat and temperate
    Åpne denne publikasjonen i ny fane eller vindu >>On context in phenomenographic research on understanding heat and temperate
    2002 (engelsk)Inngår i: EARLI, Bi-annual Symposium, Fribourg, Switzerland, 2002Konferansepaper, Publicerat paper (Fagfellevurdert)
    Abstract [en]

    Starting from an empirical study of lay adults' understanding of heatand temperature, we distinguish between different meanings of "context" inphenomenographic research. To confuse the variation in ways of experiencingthe context(s) of the study with the variation in ways of experiencing thephenomenon of study is to risk losing fundamental insights. We discuss contextas experienced and as interwoven with the experience of the phenomenon, andanalyse its significance in two dimensions: (1) the stage of the research project:formulating the question, collecting data, analysing data and deploying results;and (2) "who is experiencing" the context: the individual, the collective, or theresearcher. The arguments are illustrated from the empirical study.

    HSV kategori
    Identifikatorer
    urn:nbn:se:uu:diva-18488 (URN)
    Konferanse
    EARLI, Bi-annual Symposium, Fribourg, Switzerland
    Tilgjengelig fra: 2008-11-26 Laget: 2008-11-26 Sist oppdatert: 2018-01-12
  • 278.
    Berglund, Anders
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Teaching and learning CS: An overview of research approaches: Keynote speech at the 4th Annual Finnish/Baltic Sea Conference on Computer Science Education2004Annet (Annet vitenskapelig)
    Abstract [en]

    What kind of results that can be obtained from a research project into students' learning of computer science is closely related to how the research is performed. The relation is complex: Similar results, or, at least, results illuminating the same research question, can be obtained in different ways. Neither does the selection of a particular way of performing the result necessarily lead to a certain type of the result. The researcher himself - his beliefs, interests, previous experience, network of discussants, even his personality - is essential for the outcome of a project and becomes, to a certain degree, a part of the results. Other factors that influences the outcome are the setting in which the study is performed, previous work within the domain, previous work performed in a similar way, just to mention a few.

    A research approach is essential to guide the researcher as he studies students’ learning of computer science. It serves as a “tool box”, and offers established guidelines for conducting empirical work, as well as a theoretically sound perspective on learning. An approach can be compared to a lens in that some aspects are in focus, while others become unclear or “blurred”. The selection of a research approach is crucial, since a particular approach offers certain perspectives on the research question, and enables in this way the researcher to study certain aspects of learning.

    With a conscious selection of a reserach approach, communication with other researchers becomes possible as a shared terminology is available. In this way, the researcher gets the instruments to judge the relevance of his work in the light of that which are performed by others, and, of course, to judge the findings of others in relation to his own results. Furthermore the approach helps in understanding to what extent the results can be trusted and generalized to other groups of students and to other situations.

    The deployment of an approach in a particular project, that is, a selection of which methods that are used (for example, to collect data) are not defined by an approach, but are instead methodological decisions that has to be taken by the researcher based on the current situation, of which the approach and the research questions are key elements. Of course, since a research approach has a history, including other projects - more or less successful - performed within that approach, there is a tradition, or a network of competence, that the researcher partly can lean on in his selection to use one method (for example interviews for data collection) over another (for example observation).

    In this talk, I will discuss some research approach that are relevant for research into students' learning of computer science. Examples of results that can be obtained from the different approaches will be given.

  • 279.
    Berglund, Anders
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Box, Ilona
    Eckerdal, Anna
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Avdelningen för teknisk databehandling.
    Lister, Raymond
    Pears, Arnold
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Disseminating phenomenography: Workshops for the computing education research community2008Inngår i: Proc. EARLI SIG 9 Workshop on Phenomenography and Variation Theory: Implications of Phenomenography and Variation Theory in Practice, Sweden: Kristianstad Academic Press , 2008, s. 17-18Konferansepaper (Annet vitenskapelig)
  • 280.
    Berglund, Anders
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Box, Ilona
    Eckerdal, Anna
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Avdelningen för teknisk databehandling.
    Lister, Raymond
    Pears, Arnold
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Learning educational research methods through collaborative research: the PhICER initiative2008Inngår i: Australian Computer Science Communications, ISSN 0157-3055, Vol. 30, nr 5, s. 35-42Artikkel i tidsskrift (Fagfellevurdert)
  • 281.
    Berglund, Anders
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Daniels, Mats
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    How do individual portable computers effect students learning?2000Inngår i: IEEE Frontiers in education conference, Kansas City, 2000, s. S3D7-S3D10Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Investing in portable computers for students is a controversial issue. This paper focuses on pedagogical aspects of such an endeavour. It reports on a case study of portable computer use by students in the Master's degree program in Information Technology at Uppsala University, Uppsala, Sweden. The results are promising, indicating that in general students learn more and that they use the computers for colaboration.

  • 282.
    Berglund, Anders
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för datorteknik. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Daniels, Mats
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för datorteknik. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Improving education quality: a full scale study1997Inngår i: ACM SIGCSE Bulletin, ISSN 0097-8418, Vol. 29, nr 1, s. 330-334Artikkel i tidsskrift (Fagfellevurdert)
  • 283.
    Berglund, Anders
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Daniels, Mats
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Almstrum, Vicki
    A smorgasbord of pedagogical dishes1997Inngår i: ACM Australasian computing education conference, Melbourne, 1997Konferansepaper (Fagfellevurdert)
    Abstract [en]

    A smorgasbord is a style of food presentation that offers a wide variety of dishes from which the dinner guest can select according to personal preference. In this paper, we use the analogy of the smorgasbord to present a variety of pedagogical dishes that have been used for courses given by one department. In the same way the dishes on the smorgasbord can be grouped into various categories, our pedagogical dishes have been grouped into categories: Active learning, Projects, Form of examination, and Forging connections. For each dish, we discuss how it has been used, the participants, and the goals, as well as our assessment of the outcome. We hope that the reader will be inspired by the description of our pedagogical smorgasbord to extend and refine their local offerings.

  • 284.
    Berglund, Anders
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Daniels, Mats
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Hedenborg, Mattias
    Tengstrand, Anders
    Assessment to increase students' creativity: Two case studies1998Inngår i: European Journal of Engineering Education, Vol. 23, nr 1Artikkel i tidsskrift (Fagfellevurdert)
  • 285.
    Berglund, Anders
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi. Datorteknik. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Daniels, Mats
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Lundqvist, Kristina
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Westlund, Elvy
    Encouraging active participation in programming classes1996Inngår i: 7th National conference on college teaching and learning, Jacksonville, 1996Konferansepaper (Fagfellevurdert)
  • 286.
    Berglund, Anders
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik. Datorteknik.
    Daniels, Mats
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik. Datorteknik.
    Pears, Arnold
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik. Datorteknik.
    Qualitative Research Projects in Computing Education Research: An Overview.2006Inngår i: Australian Computer Science Communications, Vol. 28, nr 5, s. 25-34Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    Qualitative research approaches have much to offer computing education research (CER). Conducting studies which are theoretically anchored in pedagogy, as well as in computing, can help us to draw more solid and significant conclusions about how students learn computing. When studying teaching and learning situations it is important to take into explicit account what is meant by learning. We claim that this implies that research into student learning is strengthened by increased awareness of the role and relevance of qualitative research approaches in CER.

    With this aim in mind we identify the area of “pedagogically anchored qualitative research” and place it within the broader CER landscape. We also provide an overview of research methods and resulting studies, which we feel exemplify the value this type of study has for the CER community.

  • 287.
    Berglund, Anders
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Eckerdal, Anna
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Avdelningen för beräkningsvetenskap. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Tillämpad beräkningsvetenskap.
    Learning practice and theory in programming education: Students’ lived experience2015Inngår i: Proc. 3rd International Conference on Learning and Teaching in Computing and Engineering, Los Alamitos, CA: IEEE Computer Society, 2015, s. 180-186Konferansepaper (Fagfellevurdert)
  • 288.
    Berglund, Anders
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Eckerdal, Anna
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Avdelningen för beräkningsvetenskap. Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Tillämpad beräkningsvetenskap.
    Learning to program: A discussion on the interplay of theory and practice2015Inngår i: Proc. 1st Al Baha University and Uppsala University Symposium on Quality in Computing Education, 2015, s. 16-18Konferansepaper (Fagfellevurdert)
  • 289.
    Berglund, Anders
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Eckerdal, Anna
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Avdelningen för teknisk databehandling.
    What do CS students try to learn?: Insights from a distributed, project-based course in computer systems2006Inngår i: Computer Science Education, ISSN 0899-3408, E-ISSN 1744-5175, Vol. 16, s. 185-195Artikkel i tidsskrift (Fagfellevurdert)
  • 290.
    Berglund, Anders
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Eckerdal, Anna
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Avdelningen för teknisk databehandling.
    What do our students strive for?: Insights from a distributed, project-based course in computer systems2005Inngår i: Proc. 5th Finnish/Baltic Sea Conference on Computer Science Education: Koli Calling, Finland: Turku Centre for Computer Science , 2005, s. 65-72Konferansepaper (Annet vitenskapelig)
  • 291.
    Berglund, Anders
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Eckerdal, Anna
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Avdelningen för teknisk databehandling.
    Pears, Arnold
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    East, Philip
    Kinnunen, Päivi
    Malmi, Lauri
    McCartney, Robert
    Moström, Jan Erik
    Murphy, Laurie
    Ratcliffe, Mark
    Schulte, Carsten
    Simon, Beth
    Stamouli, Ioanna
    Thomas, Lynda
    Learning computer science: Perceptions, actions and roles2009Inngår i: European Journal of Engineering Education, ISSN 0304-3797, E-ISSN 1469-5898, Vol. 34, s. 327-338Artikkel i tidsskrift (Fagfellevurdert)
  • 292.
    Berglund, Anders
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Lister, Raymond
    Introductory programming and the didactic triangle2010Inngår i: Australian Computer Science Communications, ISSN 0157-3055, Vol. 32, nr 2, s. 35-44Artikkel i tidsskrift (Fagfellevurdert)
  • 293.
    Berglund, Anders
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Pears, Arnold
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Alagla, Ali
    Al Baha University, Saudi Arabia.
    Salih, Nimir
    Al Baha University, Saudi Arabia.
    Shenify, Mohamed
    Al Baha University, Saudi Arabia.
    Learning to develop learning and teaching of CS: a collaborative example2014Inngår i: Proc. 2nd International Conference on Learning and Teaching in Computing and Engineering, Los Alamitos, CA: IEEE Computer Society, 2014, s. 147-148Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Developing and improving teaching and learning in computer science is a complex task. One of the most significant challenges involves encouraging students, teachers and the formal university structures to all move in the same direction, for example to embrace the ideas of Scholarship of Teaching and Learning (SoTL). Much of the difficulty can be found in the fact that the intrinsic nature of SoTL implies that teaching and learning should be researched and critically examined. This in turn demands a development of underlying staff and organisational attitudes. As a consequence, the ways to relate to the students, the subject area, the teaching and our colleagues must scrutinised, with the intent of finding new teaching and learning forms. This contribution discusses an on-going four year project, ABoLT (Al Baha optimising Teaching and Learning), in which Uppsala University (UU) in Sweden and Al Baha University (ABU) in Saudi Arabia collaborate on developing computer science (CS) education at ABU, based in the ideas of SoTL to the benefit of both partners. In the project, ABU will renew its teaching in CS and, at the same time, initialise, formulate and conduct research in computing education, as a means to understand and improve its own teaching and the learning of its students.

  • 294.
    Berglund, Anders
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Thota, Neena
    A glimpse into the cultural situatedness of computer science: Some insights from a pilot study2014Inngår i: Proc. 2nd International Conference on Learning and Teaching in Computing and Engineering, Los Alamitos, CA: IEEE Computer Society, 2014, s. 92-99Konferansepaper (Fagfellevurdert)
    Abstract [en]

    To what extent is students' understanding of computer science culturally situated? This, possibly philosophical question, has come to the surface at Uppsala University, Uppsala, Sweden, where many Chinese students study computer science together with the local students. We did an exploratory study using email interviews to see if our intuitions could be relied on. We collected data from Chinese students studying in master programs and analysed the data using a phenomenographic perspective. A complex intertwined relationship between the content of their learning (the WHAT) the ways in which they went about studying (the HOW), the aims of their studies (the WHY), and the competencies developed from the intercultural context they studied in (the WHERE) was observed. In this paper we offer some insights from the results of the pilot study and discuss how they have shaped our on-going study in the field.

  • 295.
    Berglund, Anders
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Thota, Neena
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    How do master level students in Computer Science perceive plagiarism?2011Inngår i: Proc. 2nd International Conference on Computer Science Education: Innovation and Technology, Singapore: Global Science and Technology Forum , 2011, s. 90-95Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Plagiarism is a serious problem in computer science.This paper reports the analyses of data about plagiarism that wasgathered from master level students in computing. We haveidentified how students perceive plagiarism, how they choose torespond when faced by a scenario involving plagiarism, and whatdrives them to take a particular stance or adopt an action. Thedata-driven analyses show complex understanding of plagiarismand a range of motives that could lead students to plagiarize. Wehave found discrepancies between how students understandplagiarism and how they argue they would act when facing adilemma involving plagiarism. The implications of theseperceptions and motives for computer science educators arediscussed. A number of questions for discussion and furtherinvestigation are raised.

  • 296.
    Berglund, Anders
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Thota, Neena
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Man, Yemao
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi.
    The Sino–Swedish Master Programme in Computer Science and Software Engineering: Chinese students' experiences2013Inngår i: Collaborative Academic Programs as a Contribution to Developing Nations: FICAP-1 Proceedings / [ed] Justine Hitchcock, Leo Hitchcock, Petteri Kaskenpalo, Boca Raton, Fl, USA: BrownWalker Press, 2013, s. 37-45Kapittel i bok, del av antologi (Fagfellevurdert)
    Abstract [en]

    Internationalisation in higher education has led to the emergence of joint educational programmes between universities. In this paper, we document the Sino-Swedish master programme in computer science and software engineering, taught jointly by a Swedish and a Chinese university, from the perspective of the Swedish partner, Uppsala University. We also describe what the programme means to the Chinese students studying in Sweden. For this purpose, we interviewed the Chinese students and asked questions about their experiences of learning and living in Sweden. The students identified the differences in the experiences in Sweden from that of learning and living in China and the challenges that they faced in Sweden. The students also offered recommendations for improving their learning experiences. We discuss the benefits and challenges of joint education programs.

  • 297.
    Berglund, Anders
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Wiggberg, MattiasUppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Proc. 6th Baltic Sea Conference on Computing Education Research: Koli Calling2007Konferanseproceedings (Annet vitenskapelig)
  • 298. Bernáld, Helena
    et al.
    Cajander, Åsa
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Bildanalys och människa-datorinteraktion.
    Daniels, Mats
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi, Datorteknik.
    Laxer, Cary
    Reasoning about the value of cultural awareness in international collaboration2011Inngår i: Journal of Applied Computing and Information Technology, ISSN 2230-4398, Vol. 15, nr 1:I2Artikkel i tidsskrift (Fagfellevurdert)
  • 299.
    Bertholds, Alexander
    et al.
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi.
    Larsson, Emil
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för informationsteknologi.
    An intelligent search for feature interactions using Restricted Boltzmann Machines2013Independent thesis Advanced level (professional degree), 20 poäng / 30 hpOppgave
    Abstract [en]

    Klarna uses a logistic regression to estimate the probability that an e-store customer will default on its given credit. The logistic regression is a linear statistical model which cannot detect non-linearities in the data. The aim of this project has been to develop a program which can be used to find suitable non-linear interaction-variables. This can be achieved using a Restricted Boltzmann Machine, an unsupervised neural network, whose hidden nodes can be used to model the distribution of the data. By using the hidden nodes as new variables in the logistic regression it is possible to see which nodes that have the greatest impact on the probability of default estimates. The contents of the hidden nodes, corresponding to different parts of the data distribution, can be used to find suitable interaction-variables which will allow the modelling of non-linearities.

    It was possible to find the data distribution using the Restricted Boltzmann Machine and adding its hidden nodes to the logistic regression improved the model's ability to predict the probability of default. The hidden nodes could be used to create interaction-variables which improve Klarna's internal models used for credit risk estimates.

  • 300.
    Bevemyr, Johan
    Uppsala universitet, Teknisk-naturvetenskapliga vetenskapsområdet, Matematisk-datavetenskapliga sektionen, Institutionen för ADB och datalogi.
    Data-parallel Implementation of Prolog1996Doktoravhandling, med artikler (Annet vitenskapelig)
3456789 251 - 300 of 2077
RefereraExporteraLink til resultatlisten
Permanent link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association
  • 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