Two times three little pigs: Dysfluency, cognitive complexity and autism

This paper presents an analysis of dysfluencies in two oral tellings of a familiar children's story by a young boy with autism. Thurber & Tager-Flusberg (1993) postulate a lower degree of cognitive and communicative investment to explain a lower frequency of non-grammatical pauses observed in elicited narratives of children with autism in comparison to typically developing and intellectually disabled controls. we also found a very low frequency of non-grammatical pauses in our data, but indications of high engagement and cognitive and communicative investment. We point to a wider range of disfluencies as indicators of cognitive load, and show that the kind and location of dysfluencies produced may reveal which aspects of the narrative task are creating the greatest cognitive demand: here, mental state ascription, perspectivization, and adherence to story schema. This paper thus generates analytical options and hypotheses that can be explored further in a larger population of children with autism and typically developing controls.

An overview of the MPEG-7 description definition language (DDL)

This paper presents an overview of the MPEG-7 Description Definition Language (DDL). The DDL provides the syntactic rules for creating, combining, extending and refining MPEG-7 Descriptors (Ds) and Description Schemes (DSs), In the interests of interoperability, the W3C's XML Schema language, with the addition of certain MPEG-7-specific extensions, has been chosen as the DDL. This paper describes the background to this decision and using examples, provides an overview of the core XML, schema features used within MPEG-7 and the extensions made in order to satisfy the MPEG-7 DDL requirements.

Should optional properties be used in conceptual modelling? A theory and three empirical tests

An important feature of some conceptual modelling grammars is the features they provide to allow database designers to show real-world things may or may not possess a particular attribute or relationship. In the entity-relationship model, for example, the fact that a thing may not possess an attribute can be represented by using a special symbol to indicate that the attribute is optional. Similarly, the fact that a thing may or may not be involved in a relationship can be represented by showing the minimum cardinality of the relationship as zero. Whether these practices should be followed, however, is a contentious issue. An alternative approach is to eliminate optional attributes and relationships from conceptual schema diagrams by using subtypes that have only mandatory attributes and relationships. In this paper, we first present a theory that led us to predict that optional attributes and relationships should be used in conceptual schema diagrams only when users of the diagrams require a surface-level understanding of the domain being represented by the diagrams. When users require a deep-level understanding, however, optional attributes and relationships should not be used because they undermine users' abilities to grasp important domain semantics. We describe three experiments which we then undertook to test our predictions. The results of the experiments support our predictions.

Development of preferences for the human body shape in infancy

Two studies investigated the development of infants' visual preferences for the human body shape. In Study 1, infants of 12,15 and 18 months were tested in a standard preferential looking experiment, in which they were shown paired line drawings of typical and scrambled bodies. Results indicated that the 18-month-olds had a reliable preference for the scrambled body shapes over typical body shapes, while the younger infants did not show differential responding. In Study 2, 12- and 18-month-olds were tested with the same procedure, except that the typical and scrambled body stimuli were photographic images. The results of Study 2 again indicated that only the 18-month-olds had a reliable preference for the scrambled body shapes. This finding contrasts sharply with infants' precocious preferences for human faces, suggesting that infants' learning about human faces and human bodies follow different developmental trajectories. (C) 2002 Elsevier Science B.V. All rights reserved.

Communities of the postindustrial city

The authors discern the community structure of the postindustrial city, with reference to Australia. They focus empirically on three major types of Australian urban center: urban regions. metropolitan areas that are not part of urban regions, and other major cities. These three account for almost three-quarters of the Australian population. The authors draw on a conceptualization formulated by Marcuse and van Kempen to guide the analysis, with a combination of cluster analysis and discriminant analysis being applied to aggregate (essentially census) data to identify the communities. Nine major Australian urban communities are identified-four are affluent. four are disadvantaged. and one is a working-class community. The communities found, however, differed greatly from those cited in the Marcuse and van Kempen schema.

Database technologies for l-system simulations in virtual plant applications on bioinformatics

One of the most important advantages of database systems is that the underlying mathematics is rich enough to specify very complex operations with a small number of statements in the database language. This research covers an aspect of biological informatics that is the marriage of information technology and biology, involving the study of real-world phenomena using virtual plants derived from L-systems simulation. L-systems were introduced by Aristid Lindenmayer as a mathematical model of multicellular organisms. Not much consideration has been given to the problem of persistent storage for these simulations. Current procedures for querying data generated by L-systems for scientific experiments, simulations and measurements are also inadequate. To address these problems the research in this paper presents a generic process for data-modeling tools (L-DBM) between L-systems and database systems. This paper shows how L-system productions can be generically and automatically represented in database schemas and how a database can be populated from the L-system strings. This paper further describes the idea of pre-computing recursive structures in the data into derived attributes using compiler generation. A method to allow a correspondence between biologists' terms and compiler-generated terms in a biologist computing environment is supplied. Once the L-DBM gets any specific L-systems productions and its declarations, it can generate the specific schema for both simple correspondence terminology and also complex recursive structure data attributes and relationships.

eMelanoBase: An online locus-specific variant database for familial melanoma

A proportion of melanoma,prone individuals in both familial and non,familial contexts has been shown to carry inactivating mutations in either CDKN2A or, rarely, CDK4. CDKN2A is a complex locus that encodes two unrelated proteins from alternately spliced transcripts that are read in different frames. The alpha transcript (exons 1a, 2, and 3) produces the p16INK4A cyclin-dependent kinase inhibitor, while the beta transcript (exons 1beta and 2) is translated as p14ARF, a stabilizing factor of p53 levels through binding to MDM2. Mutations in exon 2 can impair both polypeptides and insertions and deletions in exons 1alpha, 1beta, and 2, which can theoretically generate p16INK4A,p14ARF fusion proteins. No online database currently takes into account all the consequences of these genotypes, a situation compounded by some problematic previous annotations of CDKN2A related sequences and descriptions of their mutations. As an initiative of the international Melanoma Genetics Consortium, we have therefore established a database of germline variants observed in all loci implicated in familial melanoma susceptibility. Such a comprehensive, publicly accessible database is an essential foundation for research on melanoma susceptibility and its clinical application. Our database serves two types of data as defined by HUGO. The core dataset includes the nucleotide variants on the genomic and transcript levels, amino acid variants, and citation. The ancillary dataset includes keyword description of events at the transcription and translation levels and epidemiological data. The application that handles users' queries was designed in the model,view. controller architecture and was implemented in Java. The object-relational database schema was deduced using functional dependency analysis. We hereby present our first functional prototype of eMelanoBase. The service is accessible via the URL www.wmi.usyd.e, du.au:8080/melanoma.html.

Foucault’s Perspective of Performance Appraisal in Public Administration

The main purpose of performance appraisal in organizations is, or should be, to improve the engagement, learning process and progress of the employees and to align individual with team and organizational performance. However, performance appraisal can also be interpreted as an instrument of normalization, discipline and surveillance. This study thus aims to explore and discuss the complex schema of intrinsic and extrinsic objectives of performance appraisal system of the Portuguese public organizations (SIADAP - Performance Evaluation Integrated System). We have developed an exploratory and qualitative case study to capture appraisers and appraises perceptions. The data were analyzed in light of foucauldian theories. According to the qualitative data, namely the discourses of the appraisers and their subordinates, the SIADAP is seen as an instrument of control and dominance that aims to introduce political rationalities, limiting the career progression of the employees. Though some key points of Foucault’s perspective were identified, foucauldian framework revealed some limitations to capture all the complexity inherent to performance appraisal. This study opens new perspectives about the SIADAP and can be of major importance as far as political reflection about performance appraisal in public organizations is concerned.

Intervenções em estruturas antigas

O presente relatório de estágio, definido como Trabalho Final de Mestrado, surge como resultado de um estágio profissional realizado no âmbito do Mestrado em Engenharia Civil do Instituto Superior de Engenharia de Lisboa, e tem como objectivos primordiais, expor as actividades realizadas e reflectir os conhecimentos adquiridos durante o período de estágio. Após uma formação académica maioritariamente vocacionada para os aspectos teóricos e de natureza científica, tornou-se fundamental ao estagiário garantir um contacto real com a profissão de Engenheiro Civil antes do ingresso no mercado de trabalho. Foi com base nesse pressuposto que a opção do Trabalho Final de Mestrado incidiu sobre a realização de um estágio curricular em detrimento das restantes possibilidades. O período de estágio iniciou-se a 14 de Março de 2011 e incidiu sobre a área de Conservação, Restauro e Reabilitação de edifícios com valor patrimonial, sendo feito referência no capítulo 2 aos princípios importantes da intervenção neste tipo de edifícios. O capítulo 3 faz uma abordagem geral do que são as coberturas servindo de complemento ao capítulo 4, onde são abordados e analisados os processos e métodos construtivos envolvidos, contemplando a evolução construtiva da cobertura do Cruzeiro, no Convento de Cristo em Tomar. Nos restantes capítulos, 5 e 6, é feita a caracterização e constituição da estrutura de um edifício da segunda metade do século XVIII, e a análise estrutural feita ao edifício no Antigo Convento do Santíssimo Sacramento, em Lisboa, respectivamente. O capítulo 4 é complementado pelo Anexo A, sendo utilizado como referência ao esquema da estrutura artesanal encontrada na cobertura do Cruzeiro.

PCMAT Metadata Authoring Tool

This paper introduces the PCMAT platform project and, in particular, one of its components, the PCMAT Metadata Authoring Tool. This is an educational web application that allows the project metadata creators to write the metadata associated to each learning object without any concern for the metadata schema semantics. Furthermore it permits the project managers to add or delete elements to the schema, without having to rewrite or compile any code.

Semantics of logic programs with explicit negation

After a historical introduction, the bulk of the thesis concerns the study of a declarative semantics for logic programs. The main original contributions are: ² WFSX (Well–Founded Semantics with eXplicit negation), a new semantics for logic programs with explicit negation (i.e. extended logic programs), which compares favourably in its properties with other extant semantics. ² A generic characterization schema that facilitates comparisons among a diversity of semantics of extended logic programs, including WFSX. ² An autoepistemic and a default logic corresponding to WFSX, which solve existing problems of the classical approaches to autoepistemic and default logics, and clarify the meaning of explicit negation in logic programs. ² A framework for defining a spectrum of semantics of extended logic programs based on the abduction of negative hypotheses. This framework allows for the characterization of different levels of scepticism/credulity, consensuality, and argumentation. One of the semantics of abduction coincides with WFSX. ² O–semantics, a semantics that uniquely adds more CWA hypotheses to WFSX. The techniques used for doing so are applicable as well to the well–founded semantics of normal logic programs. ² By introducing explicit negation into logic programs contradiction may appear. I present two approaches for dealing with contradiction, and show their equivalence. One of the approaches consists in avoiding contradiction, and is based on restrictions in the adoption of abductive hypotheses. The other approach consists in removing contradiction, and is based in a transformation of contradictory programs into noncontradictory ones, guided by the reasons for contradiction.

Mining protein structure data

The principal topic of this work is the application of data mining techniques, in particular of machine learning, to the discovery of knowledge in a protein database. In the first chapter a general background is presented. Namely, in section 1.1 we overview the methodology of a Data Mining project and its main algorithms. In section 1.2 an introduction to the proteins and its supporting file formats is outlined. This chapter is concluded with section 1.3 which defines that main problem we pretend to address with this work: determine if an amino acid is exposed or buried in a protein, in a discrete way (i.e.: not continuous), for five exposition levels: 2%, 10%, 20%, 25% and 30%. In the second chapter, following closely the CRISP-DM methodology, whole the process of construction the database that supported this work is presented. Namely, it is described the process of loading data from the Protein Data Bank, DSSP and SCOP. Then an initial data exploration is performed and a simple prediction model (baseline) of the relative solvent accessibility of an amino acid is introduced. It is also introduced the Data Mining Table Creator, a program developed to produce the data mining tables required for this problem. In the third chapter the results obtained are analyzed with statistical significance tests. Initially the several used classifiers (Neural Networks, C5.0, CART and Chaid) are compared and it is concluded that C5.0 is the most suitable for the problem at stake. It is also compared the influence of parameters like the amino acid information level, the amino acid window size and the SCOP class type in the accuracy of the predictive models. The fourth chapter starts with a brief revision of the literature about amino acid relative solvent accessibility. Then, we overview the main results achieved and finally discuss about possible future work. The fifth and last chapter consists of appendices. Appendix A has the schema of the database that supported this thesis. Appendix B has a set of tables with additional information. Appendix C describes the software provided in the DVD accompanying this thesis that allows the reconstruction of the present work.

Development of an interface for ontology‐based transformation between features of different types

Dissertation submitted in partial fulfilment of the requirements for the Degree of Master of Science in Geospatial Technologies

Integration of e-learning systems with repositories of learning objects

This paper describes a communication model to integrate repositories of programming problems with other e-Learning software components. The motivation for this work comes from the EduJudge project that aims to connect an existing repository of programming problems to learning management systems. When trying to use the existing repositories of learning objects we realized that they are mainly specialized search engines and lack features for integration with other e-Learning systems. With this model we intend to clarify the main features of a programming problem repository, in order to enable the design and development of software components that use it. The two main points of this model are the definition of programming problems as learning objects and the definition of the core functions exposed by the repository. In both cases, this model follows the existing specifications of the IMS standard and proposes extensions to deal with the special requirements of automatic evaluation and grading of programming exercises. In the definition of programming problems as learning objects we introduced a new schema for meta-data. This schema is used to represent meta-data related to automatic evaluation that cannot be conveniently represented using the standard: the type of automatic evaluation; the requirements of the evaluation engine; or the roles of different assets - tests cases, program solutions, etc. In the definition of the core functions we used two different web services flavours - SOAP and REST - and described each function as an operation for each type of interface. We describe also the data types of the arguments of each operation. These data types consist mainly on learning objects and their identifications, but include also usage reports and queries using XQuery.

Extending the learning object definition to represent programming problems

The present generation of eLearning platforms values the interchange of learning objects standards. Nevertheless, for specialized domains these standards are insufficient to fully describe all the assets, especially when they are used as input for other eLearning services. To address this issue we extended an existing learning objects standard to the particular requirements of a specialized domain, namely the automatic evaluation of programming problems. The focus of this paper is the definition of programming problems as learning objects. We introduce a new schema to represent metadata related to automatic evaluation that cannot be conveniently represented using existing standards, such as: the type of automatic evaluation; the requirements of the evaluation engine; or the roles of different assets - tests cases, program solutions, etc. This new schema is being used in an interoperable repository of learning objects, called crimsonHex.