Search results for "description"
showing 10 items of 250 documents
Testing Measurement Invariance Across Spanish and English Versions of the Physical Self-Description Questionnaire : An Application of Exploratory Str…
2014
Test of measurement invariance across translated versions of questionnaires is a critical prerequisite to comparing scores on the different versions. In this study, we used exploratory structural equation modeling (ESEM) as an alternative approach to evaluate the measurement invariance of the Spanish version of the Physical Self-Description Questionnaire (PSDQ). The two versions were administered to large samples of Australian and Spanish adolescents. First, we compared the CFA and ESEM approaches and showed that ESEM fitted the data much better and resulted in substantially more differentiated factors. We then tested measurement invariance with a 13-model ESEM taxonomy. Results justified u…
The interaction of language and thought in children's language acquisition: a crosslinguistic study
1997
The purpose of this research was to investigate the potential interaction of conceptual representations and linguistic systems in the process of language acquisition. Language–thought interactions were studied in 80 American, 48 Finnish and 48 Polish preschool children. The research focused on the conceptual and linguistic development of space and time. The spatial and temporal conceptual tasks were designed to measure the transition from experiential to inferential knowledge of space/time representations. In the linguistic domain, comprehension and production tests were used to evaluate the children's capacity to understand mono- and bi-referential location in space and time, where mono-re…
Producción de personas, reproducción de representaciones. Reflexiones sobre dos programas de capacitación en liderazgo
2020
The present paper addresses the question of the role Executive Education performs in the strengthening and reproduction of neoliberal ideology. It aims to critically reflect on the way selected contents and teaching activities operate jointly enabling or inhibiting certain perspectives regarding work in organizations. Two Leadership training programs are analyzed in this article, currently delivered by the two most prestigious business schools in Argentina: IAE Business School, and Torcuato Di Tella Business School. I begin with a general description of each one and proceed analyzing their educational proposals. Finally, the critical review reveals their consistency with a set of social rep…
Euzebyella saccharophila gen. nov., sp. nov., a marine bacterium of the family Flavobacteriaceae.
2010
Strain 7SM30T , an aerobic marine, Gram-negative, heterotrophic and yellow- to orange-pigmented bacterium isolated from seawater from Castellón, Spain, was characterized using a polyphasic approach. Analysis of the 16S rRNA gene sequence showed that the isolate represented a novel lineage within the family Flavobacteriaceae. The most closely related genera were Pseudozobellia, Zobellia and Kriegella. Cells of strain 7SM30T were non-motile rods that required sea salts for growth, used a wide variety of carbohydrates as sole carbon and energy sources and, unlike species of the genera Pseudozobellia and Zobellia, did not possess flexirubin-type pigment or hydrolyse agar. Strain 7SM30T containe…
Spatio-temporal Schema Integration with Validation: A Practical Approach
2005
We propose to enhance a schema integration process with a validation phase employing logic-based data models. In our methodology, we validate the source schemas against the data model; the inter-schema mappings are validated against the semantics of the data model and the syntax of the correspondence language. In this paper, we focus on how to employ a reasoning engine to validate spatio-temporal schemas and describe where the reasoning engine is plugged into our integration methodology. The validation phase distinguishes our integration methodology from other approaches. We shift the emphasis on automation from the a priori discovery to the a posteriori checking of the inter-schema mapping…
The complexity of finite model reasoning in description logics
2005
AbstractWe analyse the complexity of finite model reasoning in the description logic ALCQI, i.e., ALC augmented with qualifying number restrictions, inverse roles, and general TBoxes. It turns out that all relevant reasoning tasks such as concept satisfiability and ABox consistency are ExpTime-complete, regardless of whether the numbers in number restrictions are coded unarily or binarily. Thus, finite model reasoning with ALCQI is not harder than standard reasoning with ALCQI.
Description of action + Lecturers Biographies + International Juries + Roma MAXXI
2018
SOME NUMBERS AND DATA FROM OC2017 101 students 19 different nationalities Azerbaijan, China, Egypt, El Salvador, Ghana, Greece, India, Indonesia, Iran, Israel, Italy, Kenya, Mexico, Russia, Spain, Taiwan, Thailand, Turkey, Ukraine 4 directors 3 coordinators 5 organizators 28 workshop supervisors and tutors 9 architecture lectures 2 round tables 1 special event Architecture/Cinema 23 lecturers 35 jury members in the 3 critic panels 5 exhibitions
Phases of the project
2011
g
Querying the Guarded Fragment with Transitivity
2016
We study the problem of answering a union of Boolean conjunctive queries q against a database Δ, and a logical theory φ which falls in the guarded fragment with transitive guards (GF + TG). We trace the frontier between decidability and undecidability of the problem under consideration. Surprisingly, we show that query answering under GF2 + TG, i.e., the two-variable fragment of GF + TG, is already undecidable (even without equality), whereas its monadic fragment is decidable; in fact, it is 2exptime-complete in combined complexity and coNP-complete in data complexity. We also show that for a restricted class of queries, query answering under GF+TG is decidable. © 2013 Springer-Verlag.
Minimal nontrivial space complexity of probabilistic one- way turing machines
2005
Languages recognizable in o(log log n) space by probabilistic one — way Turing machines are proved to be regular. This solves an open problem in [4].