7 research outputs found

    Evaluating the performance of university course units using data envelopment analysis

    Get PDF
    The technique of data envelopment analysis (DEA) for measuring the relative efficiency has been widely used in the higher education sector. However, measuring the performance of a set of course units or modules that are part of a university curriculum has received little attention. In this article, DEA was used in a visual way to measure the performance of 12 course units that are part of a Photogrammetry curriculum taught at Aalto University. The results pinpointed the weakest performing units, i.e. units where the provided teaching efforts might not be adequately reflected in the students’ marks in the unit. Based on the results, a single unit was considered to offer poor performance with respect to its teaching resources and was selected as a candidate for revision of its contents. Financial resources were not used as such; instead, the performance of students in previous pre-requisite units was used as the inputs. For clarity, a single output covering the overall student performance in the examined unit was used. The technique should be widely applicable assuming the grade point averages of the students who took the course unit are available along with the marks obtained in the evaluated units and their pre-requisites

    Data Envelopment Analysis

    No full text

    A Simple Semantic-Based Data Storage Layout for Querying Point Clouds

    No full text
    The importance of being able to separate the semantics from the actual (X,Y,Z) coordinates in a point cloud has been actively brought up in recent research. However, there is still no widely used or accepted data layout paradigm on how to efficiently store and manage such semantic point cloud data. In this paper, we present a simple data layout that makes use the semantics and that allows for quick queries. The underlying idea is especially suited for a programming approach (e.g., queries programmed via Python) but we also present an even simpler implementation of the underlying technique on a well known relational database management system (RDBMS), namely, PostgreSQL. The obtained query results suggest that the presented approach can be successfully used to handle point and range queries on large points clouds.Peer reviewe

    OVI-3 : A NoSQL visual query system supporting efficient anti-joins

    No full text
    Publisher Copyright: © 2022, The Author(s).The aim of this work was to develop a technique to speed up complex joins in an incremental visual query system. When designing a visual, highly interactive interface for ad-hoc (read-only) queries, fast response times are of paramount importance. While a column-oriented DBMS reduces the inherent latency found in relational DBMS, there is still the question of how to index the data, especially so as to support complex joins. Equi-joins that involve a many-to-many relationship are an example of complex joins that arise frequently and whose efficient processing is essential for fast query processing. We present OVI-3, a NoSQL visual query system based on incremental querying that uses a simple directory-based indexing scheme for faster processing of such complex joins. The system has been piloted using real data from a student database at Aalto University. The results demonstrated that for certain complex joins the presented indexing scheme outperforms SQL queries from a data server, especially for queries involving anti-joins (negation), where OVI-3 provided an orders of magnitude speed improvement.Peer reviewe
    corecore