Multiview gait biometrics for human identity recognition

We propose a novel multiview fusion scheme for recognizing human identity based on gait biometric data. The gait biometric data is acquired from video surveillance datasets from multiple cameras. Experiments on publicly available CASIA dataset show the potential of proposed scheme based on fusion towards development and implementation of automatic identity recognition systems.

Public disclosure of biological sequences in global patent practice

Biological sequences are an important part of global patenting, with unique challenges for their effective and equitable use in practice and in policy. Because their function can only be determined with computer-aided technology, the form in which sequences are disclosed matters greatly. Similarly, the scope of patent rights sought and granted requires computer readable data and tools for comparison. Critically, the primary data provided to the national patent offices and thence to the public, must be comprehensive, standardized, timely and meaningful. It is not yet. The proposed global Patent Sequence (PatSeq) Data platform can enable national and regional jurisdictions meet the desired standards.

Data definition and manipulation languages for a CAD database

In this paper the main features of ARDBID (A Relational Database for Interactive Design) have been described. An overview of the organization of the database has been presented and a detailed description of the data definition and manipulation languages has been given. These have been implemented on a DEC 1090 system.

Linear time geometrical design rule checker based on quadtree representation of VLSI mask layouts

An efficient geometrical design rule checker is proposed, based on operations on quadtrees, which represent VLSI mask layouts. The time complexity of the design rule checker is O(N), where N is the number of polygons in the mask. A pseudoPascal description is provided of all the important algorithms for geometrical design rule verification.

Implementation of an interactive relational graphics database

The benefits that accrue from the use of design database include (i) reduced costs of preparing data for application programs and of producing the final specification, and (ii) possibility of later usage of data stored in the database for other applications related to Computer Aided Engineering (CAE). An INTEractive Relational GRAphics Database (INTERGRAD) based on relational models has been developed to create, store, retrieve and update the data related to two dimensional drawings. INTERGRAD provides two languages, Picture Definition Language (PDL) and Picture Manipulation Language (PML). The software package has been implemented on a PDP 11/35 system under the RSX-11M version 3.1 operating system and uses the graphics facility consisting of a VT-11 graphics terminal, the DECgraphic 11 software and an input device, a lightpen.

Algorithm for incremental compaction of geometrical layouts

In this paper, a new incremental algorithm for layout compaction is proposed. In addition to its linear time performance in terms of the number of rectangles in the layout, we also describe how incremental compaction can form a good feature in the design of a layout editor. The design of such an editor is also described. In the design of the editor, we describe how arrays can be used to implement quadtrees that represent VLSI layouts. Such a representation provides speed of data access and low storage requirements.

Set theoretic operations on polygons using the scan-grid approach

This paper describes an algorithm to compute the union, intersection and difference of two polygons using a scan-grid approach. Basically, in this method, the screen is divided into cells and the algorithm is applied to each cell in turn. The output from all the cells is integrated to yield a representation of the output polygon. In most cells, no computation is required and thus the algorithm is a fast one. The algorithm has been implemented for polygons but can be extended to polyhedra as well. The algorithm is shown to take O(N) time in the average case where N is the total number of edges of the two input polygons.

Koulutuksellisen syrjäytymisriskin ennustettavuus yhteishakuvalintojen kautta tarkasteltuna : koulupudokkuusriskin yhteys oppilaan kognitiiviseen kompetenssiin, koulumenestykseen sekä itseä ja vanhempia koskeviin uskomuksiin

The objective of this study was to find factors that could predict educational dropout. Dropout risk was assessed against pupil’s cognitive competence, success in school, and personal beliefs regarding self and parents, while taking into account the pupil’s background and gender. Based on earlier research, an assumption was made that a pupil’s gender, success in school, and parent’s education would be related with dropping out. This study is part of a project funded by the Academy of Finland and led by Professor Jarkko Hautamäki. The project aims to use longitudinal study to assess the development of pupils’ skills in learning to learn. The target group of this study consisted all Finnish speaking ninth graders of a municipality in Southern Finland. There were in total 1534 pupils, of which 809 were girls and 725 boys. The assessment of learning to learn skills was performed about ninth graders in spring 2004. “Opiopi” test material was used in the assessment, consisting of cognitive tests and questions measuring beliefs. At the same time, pupils’ background information was collected together with their self-reported average grade of all school subjects. During spring 2009, the pupils’ joint application data from years 2004 and 2005 was collected from the Finnish joint application registers. The data were analyzed using quantitative methods assisted by the SPSS for Windows computer software. Analysis was conducted through statistical indices, differences in grade averages, multilevel model, multivariate analysis of variance, and logistic regression analysis. Based on earlier research, dropouts were defined as pupils that had not been admitted to or had not applied to second degree education under the joint application system. Using this definition, 157 students in the target group were classified as dropouts (10 % of the target group): 88 girls and 69 boys. The study showed that the school does not affect the drop-out risk but the school class explains 7,5 % of variation in dropout risk. Among girls, dropping out is predicted by a poor average grade, a lack of beliefs supporting learning, and an unrealistic primary choice in joint application system compared to one’s success in school. Among boys, a poor average grade, unrealistic choices in joint application system, and the belief of parent’s low appreciation of education were related to dropout risk. Keywords educational exclusion, school dropout, success in school, comprehensive school, learning to learn

Automaatioteknologian opetus kuvakepohjaisella ohjelmointikielellä : Teknologiakasvatuksen opetuskokeilu kolmessa eri käyttöympäristössä

Tutkimus kuuluu Helsingin yliopiston opettajankoulutuslaitoksen luonnontieteen ja teknologian opetusta ja opetusvälineitä kehittävään LUONTI-projektiin. Tutkimuksen tarkoituksena on teknologiakasvatukseen liittyvän käsitteistön selkiyttäminen ja projektissa kehitetyn laitteiston, Empirica Controlin, käyttöönotto ja sen tutkiminen. Teoreettisessa taustassa tarkastellaan teknologiaa ja teknologiakasvatusta oppivelvollisuuskoulun näkökulmasta. Erilaisia teknologiamäärittelyjä ja ajatuksia teknologian olemuksesta verrataan tutkimuksessa kehitetyillä malleilla. Teknologia on luonteeltaan integroiva aihepiiri, jolle on ainakin tässä tutkimuksessa esitetyn teorian valossa vaikea määritellä omaa tiedonalaa ja siten luontevaa paikkaa omana oppiaineenaan. Avoimessa oppimisympäristössä tapahtuvaa kognitiivisen teorian mukaista oppimista on hahmoteltu muokkaamalla Lehtisen (1988) esittämää mallia. Aikaisempien tutkimus- ja kokeiluraporttien perusteella määritellään kolme luovaa ongelmanratkaisua ja avointa oppimisympäristöä hyödyntävää työtapaa: mallintava menetelmä, ongelmanratkaisu ja vapaa kokeilu. Empirica Controlia verrataan tekstipohjaiseen Logoon ja muihin markkinoilla oleviin laitteistoihin sekä tarkastellaan sen ominaisuuksia didaktiikan ja konstruktivistisen oppimisteorian näkökulmasta. Tutkimuksen empiirinen osuus koostuu kolmesta opetuskokeilusta. Laajin kokeilu järjestettiin kahdella helsinkiläisellä peruskoulun ala-asteen 2. luokalla. Menetelmällisenä viitekehyksenä oli neljä sykliä käsittävä opetus- ja arviointikäytäntöjen kehittämiseen pyrkivä toimintatutkimus, jossa jokainen sykli pitää sisällään kvantitatiivisesti suoritetun oppimisen tarkastelun. Tiedonhankintamenetelminä käytettiin oppilaiden itsearviointia, erilaisia haastatteluja ja ääninauhan tukemaan strukturoitua päiväkirjaa pyrkien menetelmälliseen triangulaatioon. Näitä tuloksia varmennettiin kahdella lyhyemmällä opetuskokeilulla, joista toisessa tutkittavat olivat viidesluokkalaisia ja toisessa luokan- ja lastentarhanopettajiksi opiskelevia. Tutkimus tuotti kokemuksia Empirica Controlin opetuskäytöstä sekä laitteiston kehittämisehdotuksia. Tulosten mukaan oppilailla oli työskentelyn vaatiman teknologiaan, tietotekniikkaan ja rakentamisee nliittyvät perusvalmiudet. He kokivat työskentelyn positiivisena ja oppivat käyttämään ohjelmointikielen yksinkertaisimpia käskyjä. Lyhyemmät opetuskokeilut antoivat samansuuntaisia tuloksia. Teknologian oppimista tutkittiin automaatioteknologisten laitteiden toiminnasta annettujen selitysten kautta. Selityksissä havaittiin vain hienoista paranemista. Avainsanat: teknologiakasvatus, konstruktivismi, avoin oppimisympäristö, ryhmätyö, tietokoneavusteinen opetus,triangulaatio Keywords: technology education, constructivism, open learning environment, groupwork, computer-aided instruction,triangulation

GEODERM: geometric shape design system using an entity-relationship model

GEODERM, a microcomputer-based solid modeller, which incorporates the parametric object model, is discussed. The entity-relationship model, which is used to describe the conceptual schema of the geometric database, is also presented. Three of the four modules of GEODERM, which have been implemented are described in some detail. They are the Solid Definition Language (SDL), the Solid Manipulation Language (SML) and the User-System Interface.

2 Algorithms For 3-Layer Channel Routing

A channel router is an important design aid in the design automation of VLSI circuit layout. Many algorithms have been developed based on various wiring models with routing done on two layers. With the recent advances in VLSI process technology, it is possible to have three independent layers for interconnection. In this paper two algorithms are presented for three-layer channel routing. The first assumes a very simple wiring model. This enables the routing problem to be solved optimally in a time of O(n log n). The second algorithm is for a different wiring model and has an upper bound of O(n2) for its execution time. It uses fewer horizontal tracks than the first algorithm. For the second model the channel width is not bounded by the channel density.

DFL: A Data Flow Language

Many novel computer architectures like array and multiprocessors which achieve high performance through the use of concurrency exploit variations of the von Neumann model of computation. The effective utilization of the machines makes special demands on programmers and their programming languages, such as the structuring of data into vectors or the partitioning of programs into concurrent processes. In comparison, the data flow model of computation demands only that the principle of structured programming be followed. A data flow program, often represented as a data flow graph, is a program that expresses a computation by indicating the data dependencies among operators. A data flow computer is a machine designed to take advantage of concurrency in data flow graphs by executing data independent operations in parallel. In this paper, we discuss the design of a high level language (DFL: Data Flow Language) suitable for data flow computers. Some sample procedures in DFL are presented. The implementation aspects have not been discussed in detail since there are no new problems encountered. The language DFL embodies the concepts of functional programming, but in appearance closely resembles Pascal. The language is a better vehicle than the data flow graph for expressing a parallel algorithm. The compiler has been implemented on a DEC 1090 system in Pascal.

FSK bursts for efficient clutter rejection

The clutter-rejection properties of compact f.s.k. bursts with amplitude modulation are investigated. A procedure for computer-aided design of such signals is given. The loss of clutter performance on constraining the individual pulse amplitudes to be equal is evaluated.

Recapitulation in generating spatial layouts: Representations of embryogenesis in evolutionary design modelling

The noted 19th century biologist, Ernst Haeckel, put forward the idea that the growth (ontogenesis) of an organism recapitulated the history of its evolutionary development. While this idea is defunct within biology, the idea has been promoted in areas such as education (the idea of an education being the repetition of the civilizations before). In the research presented in this paper, recapitulation is used as a metaphor within computer-aided design as a way of grouping together different generations of spatial layouts. In most CAD programs, a spatial layout is represented as a series of objects (lines, or boundary representations) that stand in as walls. The relationships between spaces are not usually explicitly stated. A representation using Lindenmayer Systems (originally designed for the purpose of modelling plant morphology) is put forward as a way of representing the morphology of a spatial layout. The aim of this research is not just to describe an individual layout, but to find representations that link together lineages of development. This representation can be used in generative design as a way of creating more meaningful layouts which have particular characteristics. The use of genetic operators (mutation and crossover) is also considered, making this representation suitable for use with genetic algorithms.

Compact AM Signals for Maximum Clutter Rejection

The transmitted signal is assumed to consist of a close succession of rectangular pulses of equal width. A matched filter scheme is employed and a theory is developed for a computer-aided optimization of the envelope of monotone compact signals for maximum rejection of dense clutter of any given distribution in range. Specific results are presented and indeterminate cases are discussed.