lnu.sePublications
Change search
Refine search result
45678910 301 - 350 of 1204
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Rows per page
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sort
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
Select
The maximal number of hits you can export is 250. When you want to export more records please use the Create feeds function.
  • 301.
    Gutzmann, Tobias
    Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering.
    Comparison of Points-to Analyses2008Independent thesis Advanced level (degree of Master (One Year)), 20 credits / 30 HE creditsStudent thesis
    Abstract [en]

    Points-to analysis is a static program analysis which computes possible reference relations between different parts of a program. It serves as input to many high-level analyses. Points-to analyses differ, among others, in flow- and context-sensitivity, program representation, and object abstraction. Most program representations used for points-to analysis are sparse representations which abstract from, e.g., primitive data types and intra-procedural control-flow. Thus, a certain degree of information is sacrificed for compact program representation, which results in scalable performance. In this thesis, we present a framework which allows building different versions of Points-to SSA (P2SSA), a sparse, Memory SSA based program representation. Distinct instantiations of P2SSA contain different levels of abstraction from a program's full representation. We present another framework which allows running Points-to analyses on these program representations. We use these two frameworks to instantiate different versions of P2SSA and compare them in terms of analysis precision and execution time.

    Download full text (pdf)
    FULLTEXT01
  • 302.
    Gutzmann, Tobias
    et al.
    Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering.
    Khairova, Antonina
    Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering.
    Lundberg, Jonas
    Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering.
    Löwe, Welf
    Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering.
    Towards Comparing and Combining Points-to Analyses2009In: Ninth IEEE International Working Conference on Source Code Analysis and Manipulation (SCAM 2009), IEEE, 2009, p. 45-54Conference paper (Refereed)
    Abstract [en]

    Points-to information is the basis for many analyses and transformations, e.g., for program understanding and optimization. To justify new analysis techniques, they need to be compared to the state of the art regarding their accuracy and efficiency. Usually, benchmark suites are used to experimentally compare the different techniques. In this paper, we show that the accuracy of two analyses can only be compared in restricted cases, as there is no benchmark suite with exact Points-to information, no Gold Standard, and it is hard to construct one for realistic programs. We discuss the challenges and possible traps that may arise when comparing different Points-to analyses directly with each other, and with over- and under-approximations of a Gold Standard. Moreover, we discuss how different Points-to analyses can be combined to a more precise one. We complement the paper with experiments comparing and combining different static and dynamic Points-to analyses.

  • 303.
    Gutzmann, Tobias
    et al.
    Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering. Datalogi.
    Lundberg, Jonas
    Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering. Datalogi.
    Löwe, Welf
    Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering. Datalogi.
    Towards Path-Sensitive Points-to Analysis2007In: Seventh IEEE International Working Conference on Source Code Analysis and Manipulation (SCAM), IEEE Computer Society, Loas Alamitos, CA, USA , 2007, p. 59-68Conference paper (Refereed)
    Abstract [en]

    Points-to analysis is a static program analysis aiming at analyzing the reference structure of dynamically allocated objects at compile-time. It constitutes the basis for many analyses and optimizations in software engineering and compiler construction. Sparse program representations, such as Whole Program Points-to Graph (WPP2G) and Points-to SSA (P2SSA), represent only dataflow that is directly relevant for points-to analysis. They have proved to be practical in terms of analysis precision and efficiency. However, intra-procedural control flow information is removed from these representations, which sacrifices analysis precision to improve analysis performance.

    We show an approach for keeping control flow related information even in sparse program representations by representing control flow effects as operations on the data transferred, i.e., as dataflow information. These operations affect distinct paths of the program differently, thus yielding a certain degree of pathsensitivity. Our approach works with both WPP2G and P2SSA representations.

    We apply the approach to P2SSA-based and flow-sensitive points-to analysis and evaluate a context-insensitive and a context-sensitive variant. We assess our approach using abstract precision metrics. Moreover, we investigate the precision improvements and performance penalties when used as an input to three source-code-level analyses: dead code, cast safety, and null pointer analysis.

  • 304.
    Gutzmann, Tobias
    et al.
    Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering.
    Steijger, Tamara
    Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering.
    Backporting Java 5 Code2009In: Ninth IEEE International Working Conference on Source Code Analysis and Manipulation (SCAM 2009), 2009, p. 121-122Conference paper (Refereed)
    Abstract [en]

    Java 5 has introduced a number of new syntactical language features that make development faster, easier, and safer. However, at the same time, it has also introduced downward incompatibilities: code written for Java 5 cannot be used on pre-Java 5 platforms. This tool demonstration presents a number of source-to-source transformations that backport source code written for the Java 5 platform to legacy platforms. Developers who are, for different reasons, still bound to legacy platforms can benefit with help of this tool from the new language features, and they can use thirdparty components written for more recent platforms. Compared to existing tools, ours is the first that can backport all new syntactical Java 5 language features while the user maintains full control of the source code.

  • 305. Gäre, Klas
    et al.
    Moberg, Anna
    Vimmarlund, Vivian
    Andersson-Gäre, Boel
    Askenäs, Linda
    Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering. Informatik.
    Dynamisk utvärdering för effektiv användning av ICT-baserade sjukvårdssystem2007In: Skandinaviska hälsoinformatik- och termkonferensen 2007, 2007Conference paper (Other (popular science, discussion, etc.))
  • 306.
    Haftor, Darek
    Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering.
    A Framework for the Modelling of Tempo-Spatial Enterprise Operations2007In: International Journal of Applied Systemic Studies, ISSN 1751-0589, Vol. 1, no 3, p. 231-247Article in journal (Refereed)
  • 307.
    Haftor, Darek
    Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering.
    An evaluation of R.L.Ackoff's interactive planning: a case of systemic development of an organizational unit2007In: Systemic development: local solutions in a global Environment., 2007Conference paper (Refereed)
  • 308.
    Haftor, Darek
    Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering.
    An outline of a descriptive theory of the enterprise. In: Wisdom, Knowledge and Management. A Critique and Analysis of Churchman’s Systems Approach2006In: Series: C. West Churchman’s Legacy and Related Works / [ed] J.P. van Gigch, Boston, MA: Springer , 2006, p. 183-203Chapter in book (Other academic)
  • 309.
    Haftor, Darek
    Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering.
    Ethical Reflections for the IT-Professional2009In: 15th Annual Working Conference of the Centre for Philosophy, technology and Social Systems, 21th – 24th April, 2009, Maarssen, The Netherlands, Maarssen, The Netherlands, 2009, p. 133-150Conference paper (Refereed)
  • 310.
    Haftor, Darek
    Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering.
    Exploring Opportunities of the Information Society: Information Logistics Research Program - executive edition2009Report (Other academic)
    Download full text (pdf)
    FULLTEXT01
  • 311.
    Haftor, Darek
    Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering.
    Exploring Opportunities of the Information Society: Information Logistics Research Program - full edition2009Report (Other academic)
    Download full text (pdf)
    FULLTEXT01
  • 312.
    Haftor, Darek
    Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering.
    Normative Sources of Systems Thinking: An Inquiry into religious Ground-Motives of Systems Thinking Paradigms2006In: In Search of an Integrative Vision for Technology. Interdisciplinary Stidues in Information Systems / [ed] Strijbos, S. Basden, A, Springer , 2006, p. 217-234Chapter in book (Other academic)
  • 313.
    Haftor, Darek
    Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering.
    Phenomeno-Semantic Complexity: A proposal for an alternative notion of complexity as a foundation for the management of complexity in human affairs2007In: Emergence, ISSN 1521-3250, E-ISSN 1532-7000, Vol. 9, p. 1-2Article in journal (Refereed)
  • 314.
    Haftor, Darek
    Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering.
    Response to Swanson’s Proposal to Enhance the Phenomeno-Semantic Model of Complexity with Miller’s Living Systems Theory2008Conference paper (Refereed)
  • 315.
    Haftor, Darek
    Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering.
    Semantic-pragmatic driven complexification: proposal for an extension of the phenomeno-semantic model complexity2007In: Systemic development: local solutions in a global Environment, New Zealand, 2007Conference paper (Refereed)
  • 316.
    Haftor, Darek
    Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering.
    This is Information Logistics!: A proposal for the definition of Information Logistics to be adopted by the Centre for Information Logistics Ljungby, Sweden2009Report (Other academic)
  • 317.
    Haftor, Darek
    Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering.
    Toward Cosmonomic Conception of Social Order: Some Critical Remarks upon Critical Theory and their Implications for a Cosmonomic Conception2008Conference paper (Refereed)
  • 318.
    Haftor, Darek
    et al.
    Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering.
    Basden, A
    Strijbos, S
    The Problem of System Improvement2008Conference paper (Refereed)
  • 319.
    Haftor, Darek
    et al.
    Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering.
    Holmberg, S.C.
    STEM: a Language for Modelling of Tempo-Spatial Entreprise Operations2006In: EURO XXI 2006. 21st European Conference on Operational Research. July 2-5, Reykjavik, Iceland, 2006Conference paper (Refereed)
  • 320.
    Haftor, Darek
    et al.
    Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering.
    Jemtbring, P
    Proposal for an Operational Model to Guide Implementations of Enterprise Information Systems2006In: Information Systems and People: Implementing Information Technology in the Workplace. ItAIS 2006: III Conference of the Italian Chapter of AIS., Milan, Italy, 2006Conference paper (Refereed)
  • 321.
    Haftor, Darek
    et al.
    Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering.
    Lacroux, F
    Vidal, P
    Some Guidelines for the Design of Information Systems for Complex Decision Making: Preliminary Results2009In: Proceedings of the IADIS Multi Conference on Computer Science and Information Systems / [ed] Bradley, G., Kommers, P, Algarve, Portugal, 2009, p. 203-208Conference paper (Refereed)
  • 322.
    Haftor, Darek
    et al.
    Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering.
    Mirijamdotter, Anita
    Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering.
    Ten Guidelines for the Implementation of Information Systems: Research in Progress2008In: Proceedings of the 31th Information Systems Research Seminar in Scandinavia, IRIS 31:: Public systems in the future – possibilities, challenges and pitfalls / [ed] Asproth, V., Axelsson, K., Holmberg, S.C., Ihlström, C., Lindblad-Gidlund, K., and Sundgren, B, Åre, Sweden, 2008Conference paper (Refereed)
    Abstract [en]

    This paper presents a Model for Implementation of Information Systems (IS). Its focusis on the organizational aspects of an IS implementation, where the objective is tosecure that the to-be IS users will use the to-be IS; hence hardware, software, andother aspects of the information technology itself are not accounted by this model.The key challenge addressed here is the many reported failures of IS implementationas derived from the organizational challenges rather than purely informationtechnology. The proposed model is built on the so-called Organization InformationSystem paradigm that regards an organization and its IS as one conceptual unitrather than considering the IS as an adjunct to the organization – the latter typical forthe conventional Management Information System paradigm. Therefore, the ISimplementation is contextualised within a process for the development oforganizations, and proposes the “Effect-Behaviour-Resource-Influence Loop” as amechanism of change, of the changed organization. In this, it is the influence of theresources – human and machines – that changes the behaviour that in turn leads tothe change of effects, toward the desired state. Further, the proposed Model forInformation System Implementation provides also three needs of an organization tobe subjected of an IS intervention; these are the “change Motivation”, the “changeCapability”, and the “change Ability”. The proposed model is an outcome of a set ofcase studies of IS implementation, conducted in an Action Research mode, andinformed by selected theoretical bodies as well as the empirical challenge tosuccessfully implement an IS. The key contribution of this model is its empiricalexperience and its comprehensive approach to an IS implementation, rather than ananalytical focusing on a few variables only. However, the proposed model is still in itshypothetical phase of theory development, and is in a need of both further crossfertilisationwith various theoretical bodies as well as further empirical experience,where validations and modifications are made.

    Download full text (pdf)
    fulltext
  • 323.
    Haftor, Darek
    et al.
    Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering.
    Ståhl, P
    Proposal for a Systemic Enterprise Modeling Language2005In: Proceedings of the 38th Hawaii Inteernational Conference on Systems Sceinces, 2005Conference paper (Refereed)
  • 324. Hagen, Hans
    et al.
    Kerren, Andreas
    Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering. Computer Science.
    Dannenmann, Peter
    Visualization of Large and Unstructured Data Sets2006Book (Other (popular science, discussion, etc.))
  • 325.
    Hahne, Fredrik
    et al.
    Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering.
    Lindgren, Åsa
    Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering.
    Från luddig verklighet till strikt formalism: Utveckling av en metod för den semantiska webben2005Independent thesis Advanced level (degree of Master (One Year)), 10 credits / 15 HE creditsStudent thesis
    Abstract [en]

    Internet is the world’s largest source of information, and it is expanding every day. It is possible to find all kind of information as long as you know how and where to look for it, but still it is only the words itself that are searched for. We have with this essay tried to find an approach that makes it possible to give the word a meaning or a context.

    We have, as a starting point used the Socrates method, which is a method that breaks down texts into its smallest elements and forms activities. We have redone these activities to ontologies by forming general and specific descriptions of the activities. The ontologies are meant to create a common language for as well humans as computers, where meaning and context are built in.

    After we have created our ontologies we used Web Ontology Language, OWL, which is the ontology language that is considered being closest to a standard. It has been developed for the semantic web, and that is the ultimate objective of our essay. The semantic web is meant to be an extension of the existing web, and it will include comprehension for computers.

    We have become conscious that the semantic web would be a great improvement for both humans and computers, since it will be a lot easier to find the information you are looking for.

    Download full text (pdf)
    FULLTEXT01
  • 326.
    Hajderovic, Ajna
    Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering.
    Ett säljsamtal via webbutik: Visma SPCS2007Independent thesis Advanced level (degree of Master (One Year)), 20 credits / 30 HE creditsStudent thesis
    Abstract [en]

    The main objective of this thesis is to study how the structures of a sell dialog, via a web shop, should be designed in order to support and inspire the customer. To get the answer to this question I use a qualitative and quantitative method. The qualitative method is applied in connection with different interviews. The quantitative method is used to analyze different answers given from those who are interviewed. I also use the deductive method due to my interest of studying how reality can relate to the theories with the choice of the subject.

    Moreover, this thesis is structured by three main perspectives; company, customers and techniques. The theoretical part of the thesis includes definitions and theories about electronic business, customers’ behaviour and technique, UML (Unified Modelling Language), which is a visual syntax for visualising, specifying, constructing and documenting system engineering, and UP (Unified Process), which is a method that complements UML. Furthermore, the empirical part of the thesis includes interviews with Chris Jangelöv and Patrik Cardell (Visma Spcs), who are representing the companys’ perspective on a sell dialog via a web shop. For the customers’ perspective on the subject, I collect and outline the interviews from Visma Spcs customers. Moreover, I review the interview with David Nadel, where he discusses the UML and UP techniques and also electronic business in general.

    As for the results, I come to the conclusion that a web shop should be structured from a customer´s perspective and his/her inquiries concerning the products and services. UML and UP, however, are techniques that focus on the structuring of data and processes without taking the developing dialogue with the customer into serious account. These techniques do not address issues of why a web shop is used as it is, UML and UP only apply what a web shop can look like and how it could be used. Therefore, I argue that there is a lack of connection between the UML and UP techniques and the real live user and actual use. I also reached the conclusion that there should be three main building blocks when structuring a sell dialog via a web shop. These are; structure, information and navigation.

    Download full text (pdf)
    FULLTEXT01
  • 327.
    Hajderovic, Ajna
    Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering.
    IT-baserat DNA-register: Hur skulle ett heltäckande IT-baserat DNA-register kunna införas i Sverige för att acceptans av folket?2006Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
    Abstract [sv]

    Syftet med denna uppsats är att undersöka hur ett heltäckande IT-baserat DNA-register skulle kunna införas i Sverige för att få acceptans av folket. För att få svar på min problemfråga använder jag mig av kvalitativ forskningsmetod. Metoden tillämpas i samband med olika intervjuer. Jag väljer också att arbeta efter deduktiv metod eftersom jag ville studera hur verkligheten kan relateras till teorierna inom det valda ämnet.

    Vidare presenteras den befintliga teorin som finns om ett DNA-register. DNA står för deoxyribonucleic acid och är uppbyggd av celler och innehåller information om vår arvsmassa. I brottsutredningar används dock s.k. skräp eller nonsens DNA, där ingen genetisk information kan utläsas förutom könet. DNA-register är ett register som består av DNA-profiler från grova brottslingar. En DNA-profil presenteras i form av en sifferremsa. Med hjälp av det kan polisen binda ett spår till en person.

    DNA-register består av två delar, misstankeregister och brottsregister. I misstankeregister registreras personer som är skäligen misstänkta för något allvarlig brott och i brottsregistret registreras brottslingar som döms till något allvarligt brott så som mord eller dråp.

    Säkerheten kring ett datorsystem är väldigt viktigt att beakta, speciellt när det handlar om ett datorsystem så som DNA-register. Det som kan utgöra hot för att införa ett heltäckande IT-baserat DNA-register handlar om själva användarna dvs. vem som får använda detta system. De som skulle få använda ett heltäckande IT-baserat DNA-register är Statens Kriminaltekniska Laboratorium (SKL) och Rikspolisstyrelsen (RPS). Vidare handlar det om personlig integritet, men ett DNA-register innehåller inga känsliga personuppgifter. Dessutom får inte uppgifterna om den registrerades personliga egenskaper registreras. Att DNA-register inte utgör hot för den personliga integriteten har också bekräftats från några av de intervjuade personerna. Detta leder mig till följande slutsats.

    Om ett heltäckande IT-baserat DNA-register skulle få acceptans av folket måste man ge rätt information angående DNA och det faktum att den personliga integriteten inte skulle kränkas i samband med införelsen.

    Download full text (pdf)
    FULLTEXT01
  • 328.
    Hall, Johan
    Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering.
    MaltParser -- An Architecture for Inductive Labeled Dependency Parsing2006Licentiate thesis, monograph (Other academic)
    Abstract [en]

    This licentiate thesis presents a software architecture for inductive labeled dependency parsing of unrestricted natural language text, which achieves a strict modularization of parsing algorithm, feature model and learning method such that these parameters can be varied independently. The architecture is based on the theoretical framework of inductive dependency parsing by Nivre \citeyear{nivre06c} and has been realized in MaltParser, a system that supports several parsing algorithms and learning methods, for which complex feature models can be defined in a special description language. Special attention is given in this thesis to learning methods based on support vector machines (SVM).

    The implementation is validated in three sets of experiments using data from three languages (Chinese, English and Swedish). First, we check if the implementation realizes the underlying architecture. The experiments show that the MaltParser system outperforms the baseline and satisfies the basic constraints of well-formedness. Furthermore, the experiments show that it is possible to vary parsing algorithm, feature model and learning method independently. Secondly, we focus on the special properties of the SVM interface. It is possible to reduce the learning and parsing time without sacrificing accuracy by dividing the training data into smaller sets, according to the part-of-speech of the next token in the current parser configuration. Thirdly, the last set of experiments present a broad empirical study that compares SVM to memory-based learning (MBL) with five different feature models, where all combinations have gone through parameter optimization for both learning methods. The study shows that SVM outperforms MBL for more complex and lexicalized feature models with respect to parsing accuracy. There are also indications that SVM, with a splitting strategy, can achieve faster parsing than MBL. The parsing accuracy achieved is the highest reported for the Swedish data set and very close to the state of the art for Chinese and English.

    Download full text (pdf)
    FULLTEXT01
  • 329.
    Hall, Johan
    Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering.
    Transition-Based Natural Language Parsing with Dependency and Constituency Representations2008Doctoral thesis, comprehensive summary (Other academic)
    Abstract [en]

    Hall, Johan, 2008. Transition-Based Natural Language Parsing with Dependency and Constituency Representations, Acta Wexionensia No 152/2008. ISSN: 1404-4307, ISBN: 978-91-7636-625-7. Written in English.

    This thesis investigates different aspects of transition-based syntactic parsing of natural language text, where we view syntactic parsing as the process of mapping sentences in unrestricted text to their syntactic representations. Our parsing approach is data-driven, which means that it relies on machine learning from annotated linguistic corpora. Our parsing approach is also dependency-based, which means that the parsing process builds a dependency graph for each sentence consisting of lexical nodes linked by binary relations called dependencies. However, the output of the parsing process is not restricted to dependency-based representations, and the thesis presents a new method for encoding phrase structure representations as dependency representations that enable an inverse transformation without loss of information. The thesis is based on five papers, where three papers explore different ways of using machine learning to guide a transition-based dependency parser and two papers investigate the method for dependency-based phrase structure parsing.

    The first paper presents our first large-scale empirical study of parsing a natural language (in this case Swedish) with labeled dependency representations using a transition-based deterministic parsing algorithm, where the dependency graph for each sentence is constructed by a sequence of transitions and memory-based learning (MBL) is used to predict the transition sequence. The second paper further investigates how machine learning can be used for guiding a transition-based dependency parser. The empirical study compares two machine learning methods with five feature models for three languages (Chinese, English and Swedish), and the study shows that support vector machines (SVM) with lexicalized feature models are better suited than MBL for guiding a transition-based dependency parser. The third paper summarizes our experience of optimizing and tuning MaltParser, our implementation of transition-based parsing, for a wide range of languages. MaltParser has been applied to over twenty languages and was one of the top-performing systems in the CoNLL shared tasks of 2006 and 2007.

    The fourth paper is our first investigation of dependency-based phrase structure parsing with competitive results for parsing German. The fifth paper presents an improved encoding method for transforming phrase structure representations into dependency graphs and back. With this method it is possible to parse continuous and discontinuous phrase structure extended with grammatical functions.

    Download full text (pdf)
    FULLTEXT01
  • 330.
    Hall, Johan
    et al.
    Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering.
    Nilsson, Jens
    Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering.
    CoNLL-X SharedTask: Multi-lingual Dependency Parsing2006Report (Other academic)
    Abstract [en]

    The goal of this report is to summarize our experiments and present the final result of our participation in the CoNLL-X Shared Task 2006. The topic of this year's shared task was multi-lingual dependency parsing.

    The organizers have prepared 13 existing dependency treebanks so that they all comply to the same markup format. The training and test data for the languages differ in size, granularity and quality, but they have tried to even out differences in the markup format. No additional information is allowed to be used besides the provided training data, forcing the parser to be fully automatic and data-driven. Ideally, the same parser should be trainable for all languages, possibly by adjusting parameters.

    The main goal is to assign labeled dependency structure for all languages on held out test data, approximately 5 000 tokens for each language. The main metric for comparison of the different parsers of the participants is therefore labeled attachment score.

    Download full text (pdf)
    FULLTEXT01
  • 331.
    Hall, Johan
    et al.
    Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering.
    Nilsson, Jens
    Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering.
    Converting Dependency Treebanks to MALT-XML2005Report (Other academic)
    Abstract [en]

    In data-driven approaches to natural language processing, a common problem is the lack of data for many languages. Within the project Stochastic Dependency Grammars for Natural Language Parsing at Växjö University, we (Joakim Nivre, Johan Hall and Jens Nilsson) are developing a deterministic data-driven dependency parser, which is language independent. In this project we intend to enlarge the data resources for our parser. For the moment, we have only tested our parser on small Swedish treebank converted to dependency structure, and on English using Penn Treebank converted to dependency trees. Since we do not have more Swedish dependency treebanks at hand, we want to broaden our view towards treebanks for other languages, especially the bigger ones, to investigate the influence of data size. Primarily, we are focusing on the Danish Dependency Treebank (DDT) and the Prague Dependency Treebank (PDT). These treebanks are not in a format that we can use for our parser and therefore we have to convert them to MALT-XML, a format which our parser can handle.

    Download full text (pdf)
    FULLTEXT01
  • 332.
    Hall, Johan
    et al.
    Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering.
    Nilsson, Jens
    Nivre, Joakim
    Single Malt or Blended? A Study in Multilingual Parser OptimizationManuscript (preprint) (Other (popular science, discussion, etc.))
  • 333.
    Hall, Johan
    et al.
    Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering. Datavetenskap.
    Nilsson, Jens
    Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering. Datavetenskap.
    Nivre, Joakim
    Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering. Datavetenskap.
    Eryigit, Gülsen
    Megyesi, Béata
    Nilsson, Mattias
    Saers, Markus
    Single Malt or Blended? A Study in Multilingual Parser Optimization2007In: Proceedings of the CoNLL Shared Task Session of EMNLP-CoNLL 2007, Association for Computational Linguistics , 2007, p. 933–939-Conference paper (Refereed)
    Abstract [en]

    We describe a two-stage optimization of the MaltParser system for the ten languages in the multilingual track of the CoNLL 2007 shared task on dependency parsing. The first stage consists in tuning a single-parser system for each language by optimizing parameters of the parsing algorithm, the feature model, and the learning algorithm. The second stage consists in building an ensemble system that combines six different parsing strategies, extrapolating from the optimal parameters settings for each language. When evaluated on the official test sets, the ensemble system significantly outperforms the single-parser system and achieves the highest average labeled attachment score.

  • 334.
    Hall, Johan
    et al.
    Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering.
    Nivre, Joakim
    A Dependency-Driven Parser for German Dependency and Constituency RepresentationsManuscript (preprint) (Other (popular science, discussion, etc.))
  • 335.
    Hall, Johan
    et al.
    Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering. Datalogi.
    Nivre, Joakim
    Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering. Datalogi.
    A Dependency-Driven Parser for German Dependency and Constituency Representations2008In: Proceedings of the ACL-08: HLT Workshop on Parsing German (PaGe-08), Association for Computational Linguistics (ACL),Stroudsburg , 2008, p. 47-54Conference paper (Refereed)
    Abstract [en]

    We present a dependency-driven parser that parses both dependency structures and constituent structures. Constituency representations are automatically transformed into dependency representations with complex arc labels, which makes it possible to recover the constituent structure with both constituent labels and grammatical functions. We report a labeled attachment score close to 90% for dependency versions of the TIGER and TüBa-D/Z treebanks. Moreover, the parser is able to recover both constituent labels and grammatical functions with an F-Score over 75% for TüBa-D/Z and over 65% for TIGER.

  • 336.
    Hall, Johan
    et al.
    Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering.
    Nivre, Joakim
    Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering.
    A generic architecture for data-driven dependency parsing2005In: Proceedings of the 15th Nordic Conference of Computational Linguistics (NODALIDA), University of Joensuu electronic publications in linguistics and language technology, Joensuu , 2005, p. 47-56Conference paper (Refereed)
    Abstract [en]

    We present a software architecture for data-driven dependency parsing of unrestricted natural language text, which achieves a strict modularization of parsing algorithm, feature model and learning method such that these parameters can be varied independently. The design has been realized in MaltParser, which supports several parsing algorithms and learning methods, for which complex feature models can be defined in a special description language.

  • 337.
    Hall, Johan
    et al.
    Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering.
    Nivre, Joakim
    Parsing Discontinuous Phrase Structure with Grammatical FunctionsManuscript (preprint) (Other (popular science, discussion, etc.))
  • 338.
    Hall, Johan
    et al.
    Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering.
    Nivre, Joakim
    Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering.
    Parsing Discontinuous Phrase Structure with Grammatical Functions2008In: Advances in Natural Language Processing, Springer Berlin / Heidelberg , 2008, p. 169-180Conference paper (Refereed)
    Abstract [en]

    This paper presents a novel technique for parsing discontinuous phrase structure representations, labeled with both phrase labels and grammatical functions. Phrase structure representations are transformed into dependency representations with complex edge labels, which makes it possible to induce a dependency parser model that recovers the phrase structure with both phrase labels and grammatical functions. We perform an evaluation on the German TIGER treebank and the Swedish Talbanken05 treebank and report competitive results for both data sets.

  • 339.
    Hall, Johan
    et al.
    Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering. Datavetenskap.
    Nivre, Joakim
    Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering. Datavetenskap.
    Nilsson, Jens
    Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering. Datavetenskap.
    A Hybrid Constituency-Dependency Parser for Swedish2007In: Proceedings of the 16th Nordic Conference of Computational Linguistics (NODALIDA), 2007, p. 284–287-Conference paper (Refereed)
    Abstract [en]

    We present a data-driven parser that derives both constituent structures and dependency structures, alone or in combination, in one

    and the same process. When trained and tested on data from the Swedish treebank Talbanken05, the parser achieves a labeled dependency accuracy of 82% and a labeled bracketing F-score of 75%.

  • 340.
    Hall, Johan
    et al.
    Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering.
    Nivre, Joakim
    Nilsson, Jens
    Discriminative Classifiers for Deterministic Dependency ParsingManuscript (preprint) (Other (popular science, discussion, etc.))
  • 341.
    Hall, Johan
    et al.
    Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering. Datalogi.
    Nivre, Joakim
    Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering. Datalogi.
    Nilsson, Jens
    Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering. Datalogi.
    Discriminative Classifiers for Deterministic Dependency Parsing2006In: Proceedings of the 44rd Annual Meeting of the Association for Computational Linguistics and 21th International Conference on Computational Linguistics (COLING-ACL 2006), July 17-21, 2006, Sydney, Australia, Association for Computational Linguistics, Stroudsburg , 2006, p. 316-323Conference paper (Refereed)
    Abstract [en]

    Deterministic parsing guided by treebankinduced classifiers has emerged as a simple and efficient alternative to more complex models for data-driven parsing. We present a systematic comparison of memory-based learning (MBL) and support vector machines (SVM) for inducing classifiers for deterministic dependency parsing, using data from Chinese, English and Swedish, together with a variety of different feature models. The comparison shows that SVM gives higher accuracy for richly articulated feature models across all languages, albeit with considerably longer training times. The results also confirm that classifier-based deterministic parsing can achieve parsing accuracy very close to the best results reported for more complex parsing models.

  • 342.
    Hallqvist, Carina
    Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering. Informatik.
    Designing Democracy: Mobilen i demokratins tjänst – ur ett designperspektiv2006Licentiate thesis, monograph (Other academic)
    Abstract [sv]

    Avhandlingen tar sin utgångspunkt i det av Vinnova finansierade projektet »Mobilen i demokratins tjänst» även kallat [demos], vilket drevs av Interactive Institutes Studio[12-21] under perioden 2002 – 2004. De nya mediernas växande betydelse för ungdomars vardagsliv var en viktig faktor bakom [demos]-projektet. Persondatorer, mobiltelefoner, digitala kameror, MP3-spelare och andra digitala verktyg är idag självklara för de flesta ungdomar i västvärlden. Dessa verktyg, liksom Internets mångfald, har snabbt blivit en given del av såväl deras skolarbete som deras fritid. Detta har fått effekt på ungdomars sätt att leka, kommunicera, arbeta och skapa sociala gemenskaper. Ungdomars självklara förhållningssätt till digitala media gör att de ofta utvecklar oväntade och innovativa användningsområden för tjänster och verktyg, genom vad som skulle kunna kallas ett kreativt »missbruk».

    I [demos]-projektet var ambitionen att i arbetet med morgondagens vuxna relatera frågor kring teknik- och konceptutveckling till frågor som har med vårt samhälle och nya former för demokrati att göra. Den övergripande målsättningen i projektet var att undersöka vad som händer om man använder mobila tjänster som ett hjälpmedel och en utmaning i skoldemokratin.

    En prototyp baserad på sms-tekniken utvecklades och testades inom projektets ram. Prototypen utvecklades utifrån två huvudspår, dels representantens behov att undersöka mandat i medlemsgruppen och dels de enskilda medlemmarnas behov att påkalla ledarna och övriga medlemmars uppmärksamhet och skapa opinion kring en viss fråga.

    I avhandlingen presenteras en fallstudiebeskrivning av [demos]-projektet. Avsikten med denna är att tillföra området en beskrivning av och reflektioner kring ett praktiskt exempel på en implementation där man haft avsikten att använda sig av vardagsteknik i form av sms för att stödja demokratiska processer. Avhandlingen belyser och diskuterar former för användarmedverkan i spontan design. I fokus är området digitala media och viljan till medskapande som understöds av den interaktiva potentialen i digitala verktyg och medier. Dessa ger möjligheter att själv eller tillsammans med andra skapa nya sociala sammanhang, filmer, bilder, musik.

    Ytterligare ett viktigt led i beskrivningen och analysen av projektet har varit att undersöka de tekniska och organisatoriska dimensioner vilka ligger till grund för projektets resultat. Särskilt studerades hur man genom att utgå från nyttjandet av sms som en »vardaglig teknik» kan utforma ett system som ett stöd för demokratiska processer. Den fråga som behandlas här är vad som händer då vi tillför de efterfrågade tekniska möjligheterna. Ökar engagemanget att delta i demokratiska processer då deltagarna själva fått välja redskap/teknik? Blir designprocessen mera demokratisk?

    Slutligen diskuteras den övergripande problematik som ligger i att bedriva forskning och praktik parallellt.

  • 343.
    Hallstadius, Ulrika
    Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering.
    Skolgården som möjlighet till lärande i matematik2008Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
    Abstract [sv]

    Syftet med arbetet har varit att undersöka hur några lärare uppfattar skolgårdens möjligheter för lärande i matematik. Arbetet syftar också till att undersöka hur det går att använda elevers naturliga lek på skolgården för lärande i matematik. Fyra lärare har intervjuats om skolgårdens möjligheter för lärande i matematik. Elevers naturliga lekar på skolgården har observerats, och studerats utifrån lekarnas

    matematiska innehåll inom området geometri. På basis av de fyra lärarintervjuerna, och skolgårdsobservationerna, planerades och genomfördes en utomhuslektion i matematik. Resultaten visar att lärare i liten utsträckning använder sig av skolgården då de

    undervisar i matematik. De ser inte heller någon större skillnad i planering när de planerar för uteaktiviteter i matematik i jämförelse med klassrumsundervisningen. Resultaten visar dock att det finns goda möjligheter att använda sig av och utgå ifrån elevers naturliga lekar på skolgården för lärande i matematik.

    Download full text (pdf)
    FULLTEXT01
  • 344.
    Hallström, Per
    et al.
    Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering.
    Dellrup, Per
    Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering.
    Improving WiFi positioning through the use of successive in-sequence signal strength samples2006Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
    Abstract [en]

    As portable computers and wireless networks are becoming ubiquitous, it is natural to consider the user’s position as yet another aspect to take into account when providing services that are tailored to meet the needs of the consumers. Location aware systems could guide persons through buildings, to a particular bookshelf in a library or assist in a vast variety of other applications that can benefit from knowing the user’s position.

    In indoor positioning systems, the most commonly used method for determining the location is to collect samples of the strength of the received signal from each base station that is audible at the client’s position and then pass the signal strength data on to a positioning server that has been previously fed with example signal strength data from a set of reference points where the position is known. From this set of reference points, the positioning server can interpolate the client’s current location by comparing the signal strength data it has collected with the signal strength data associated with every reference point.

    Our work proposes the use of multiple successive received signal strength samples in order to capture periodic signal strength variations that are the result of effects such as multi-path propagation, reflections and other types of radio interference. We believe that, by capturing these variations, it is possible to more easily identify a particular point; this is due to the fact that the signal strength fluctuations should be rather constant at every position, since they are the result of for example reflections on the fixed surfaces of the building’s interior.

    For the purpose of investigating our assumptions, we conducted measurements at a site at Växjö university, where we collected signal strength samples at known points. With the data collected, we performed two different experiments: one with a neural network and one where the k-nearest-neighbor method was used for position approximation. For each of the methods, we performed the same set of tests with single signal strength samples and with multiple successive signal strength samples, to evaluate their respective performances.

    We concluded that the k-nearest-neighbor method does not seem to benefit from multiple successive signal strength samples, at least not in our setup, compared to when using single signal strength samples. However, the neural network performed about 17% better when multiple successive signal strength samples were used.

    Download full text (pdf)
    FULLTEXT01
  • 345.
    Hanner, Martin
    et al.
    Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering.
    Björk, Tobias
    Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering.
    Biometri vid fysisk access: En jämförande studie mellan ansiktsigenkänning och fingeravtrycksavläsning2006Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
    Abstract [en]

    In today’s society, people often find themselves in situations where they need to be identified;for example when we buy alcohol, need to use an ATM or log on to our e-mail account. The most common methods today that are used for these kinds of matters are antiquated, and in

    the meantime, criminals all over the world get more sophisticated. Companies invest billions every day in order to protect their interests. Maybe it’s time that we finally give biometrics the

    attention that it deserves.

    This essay aims to describe the biometric methods that are available today, find some of the most effective when it comes to physical access and make a comparison. Face recognition and fingerprint scanning will be described more thoroughly. Pros and cons will be analyzed and the theory will be linked to interviews with three Swedish organisations.

    Download full text (pdf)
    FULLTEXT01
  • 346.
    Hansen, Annika
    et al.
    Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering.
    Lindqvist, Mona
    Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering.
    Patientsäker läkemedelshantering: Användning av informationssystemet Cosmic vid delning av läkemedel2008Independent thesis Advanced level (degree of Master (One Year)), 10 credits / 15 HE creditsStudent thesis
    Abstract [sv]

    Ett identifierat riskområde inom hälso- och sjukvården är hantering av läkemedel och för att höja patientensäkerheten bör läkemedelshanteringen säkerställas. Vi har i en kvalitativ studie genom att använda flera olika metoder, så kallad triangulering, undersökt och beskrivit processen delning av läkemedel inom slutenvården. Vårt syfte var att identifiera risker och förbättringsmöjligheter och genom en fallstudie på två vårdavdelningar har vi kunnat identifiera skillnader i arbetssätt mellan vårdavdelningarna men också mellan sjuksköterskorna. För informationshantering i processen använder sig båda vårdavdelningarna av läkemedelsmodulen i vårdinformationssystemet Cosmic. Delningsprocessen på de studerade vårdavdelningarna fungerar bra men vi har kunnat identifiera förbättringsmöjligheter i den tekniska utrustningen, det vårdadministrativa systemet samt i organisationen och dess kvalitetsarbete. För att uppnå en hög patientsäkerhet är det av stor vikt att informationsflödet fungerar optimalt i delsystemen och i relationen mellan dem vilket kan uppnås genom en övergripande kvalitetssäkring där ett systemsynsätt appliceras. Med ett effektivt ledningssystem kan organisationer arbeta med ständiga förbättringar och prioritera de ur patientsäkerhetssynpunkt viktigaste åtgärderna.

    Download full text (pdf)
    FULLTEXT01
  • 347.
    Harnell, Jonas
    et al.
    Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering.
    Alemayehn, Yonatan
    Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering.
    En jämförande studie av IPv4 och IPv62005Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
    Abstract [en]

    The Internet protocol of today has been used for over 20 years. A new version of the protocol has been developed to replace the old one. This is a direct result due to the explosive growth of the usage of the Internet. This follows by new demands which needs new solutions. This report brings up the old protocol IPv4, the new protocol IPv6 and shows what kind of changes that has been developed to meet the users demand.

    The report brings up two important aspects; internet security and mobility. To show the important changes within these areas, the report compares the old protocol with the new one. Furthermore, the report also studies the world’s greatest test environment to this date. The aim of this is to show how the protocol behaves in reality and thereby get an insight to the specific areas that needs to be illustrated. To conclude the report, there is a broad discussion regarding the future of the two protocols and how this may effect the Internet in a future perspective.

    Download full text (pdf)
    FULLTEXT01
  • 348.
    Hatami, Reza
    Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering.
    Reguladetri - En retorisk räknemetod speglad i svenska läromedel från 1600-talet till början av 1900-talet2007Licentiate thesis, monograph (Other academic)
    Abstract [sv]

    Abstract

    In this dissertation the most common methods of solution, in which

    The Rule of Three is included, are presented. The Rule of Three tasks

    have been considered in various manners during the centuries. This

    dissertation examines how The Rule of Three, as a rhetorical method

    of calculus, is presented in Swedish textbooks from the 17th century

    till the beginning of the 20th century. Moreover, a comparative

    analysis, of The Rule of Three tasks and their solutions, is presented.

    In addition, a variety of other rules are presented and treated as

    examples of rhetorical mathematics. Similar to The Rule of Three,

    these rules are built on proportionality.

    The tradition that Björk started in using proportionality was continued

    by Celsius, Beckmarck and Forsell and later by Björling and

    Zweigbergk. Zweigbergk’s textbook is excellent from a mathematical

    as well as from a pedagogical point-of-view. In Zweigbergks’s

    account of Regula de Tri the emphasis is on comprehension and

    mechanical skills.

    The results of this thesis show that the textbooks can be divided into

    three groups, based on their description of The Rule of Three. Group:

    1. Include the (textbook) authors who strongly emphasize

    algorithms and mechanical arithmetics.

    2. Include the (textbook) authors who build their descriptions of

    The Rule of Three on the theory of proportion.

    3. Include the (textbook) authors who solve The Rule of Three

    problems through going back to the unit.

    Download full text (pdf)
    FULLTEXT01
  • 349.
    Hedblom, Christina
    et al.
    Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering.
    Ring, Lena
    Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering.
    Rumsuppfattning: Möjligheter och hinder2008Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
    Abstract [sv]

    Syftet med vårt examensarbete är att ta reda på vilka möjligheter barn i förskolan har att utveckla sin rumsuppfattning i inomhusmiljön, utifrån det matematiska lärandet. Vi vill även ta reda på om det kan finnas hinder för barnens utveckling av rumsuppfattning i form av säkerhetsföreskrifter eller andra hinder.

    Som metod valde vi att göra observationer och intervjuer på fyra förskoleavdelningar, fördelat på två småbarnsavdelningar, ett till tre år och två äldrebarnsavdelningar, tre till sex år. Vi använde oss av öppna intervjuer med pedagogerna och utifrån ett speciellt observationsschema gjorde vi observationer av barn, pedagoger och inomhusmiljön.

    Resultatet visar att det från pedagogernas sida inte arbetas medvetet med barns rumsuppfattning ur en matematisk synvinkel. Däremot tar pedagogerna tillvara på de vardagliga situationerna som samling, dukning med mera för att träna taluppfattning och problemlösning. Som en del av resultatet av vår studie kan vi känna att det behövs mycket mer kunskaper, både teoretiskt och praktiskt, kring barns utveckling av rumsuppfattning ute på förskolorna, då vi hade svårt att hitta något om rumsuppfattning med koppling till matematiken.

    Download full text (pdf)
    FULLTEXT01
  • 350.
    Hedenström, Kerstin
    Växjö University, Faculty of Mathematics/Science/Technology, School of Mathematics and Systems Engineering.
    Programmering på gymnasiet: En studie av viktiga faktorer i programmeringsundervisningen på gymnasiet2008Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
    Abstract [sv]

    Denna rapport har sammanställts i syfte att beskriva vilka faktorer i undervisningen som kan vara viktiga när det gäller elevers måluppfyllelse på gymnasiets programmeringskurser. Med utgångspunkt från gjord textanalys har frågeställningar om vad programmering innebär, elevers syn och förväntningar på en programmeringskurs, hur kursen kan utformas för att bättre möta elevernas individuella sätt att lära sig samt hur elevers kunskapsutveckling kan påverkas på ovannämnda kurs behandlats. En enkätstudie bland gymnasielärare i programmering gjordes även för att få deras syn på frågeställningar kring val av programmeringsspråk och dess eventuella påverkan. Studien visar att en framgångsfaktor är motiverade elever. Motivationen kan ibland påverkas av vilket programmeringsspråk som används i undervisningen. Då det ofta finns stor spridning bland eleverna när det gäller deras tidigare kunskaper och inställning till programmering samt deras varierande förväntningar på kursen är även lärarens förmåga att anpassa undervisningen efter olika omständigheter en viktig framgångsfaktor i undervisningen.

    Download full text (pdf)
    FULLTEXT01
45678910 301 - 350 of 1204
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf