Search results for "Relational"
showing 10 items of 238 documents
Bayesian subset selection for additive and linear loss function
1979
Given k independent samples of common size n from k populations πj,…,πk with distribution the problem is to select a non-empty subset form {πj,…,πk}, which is associated with "good" (large) θ-values. We consider this problem from a Bayesian approach. By choosing additive and especially linear loss functions we try to fill a gap lying in between the results of Deely and Gupta (1968) and more recent papers due to Goel and Rubin (1977), Gupta and Hsu (1978) and other authors. It is shown that under acertain "normal model" Seal's procedure turns out to be Bayes w.r.t. an unrealistic loss function where as Gupta's maximunl means procedure turns out to be ( for large n) asymptotically Bayes w.r. …
Seksuaalisuus mielen rakentumisen ilmiönä : käsitteellinen tutkimus seksuaalisuutta koskevista psykoanalyyttisistä teorioista
2012
Pro graduni käsittelee kaikkiaan sitä, mitä seksuaalisuus on ja kuinka seksuaalisuudella on ratkaiseva merkitys mielen rakentumissa. Selvitän käsitteellisen tutkimuksen avulla kuinka seksuaalisuutta tulisi teoreettisesti ymmärtää ja jäsentää. Analysoin ja vertailen kolmen psykoanalyyttisen teoreetikon, Sigmund Freudin, Jean Laplanchen ja Ruth Steinin teorioita seksuaalisuudesta. Etsin heidän teorioistaan vastauksia keskeisiin kysymyksiin seksuaalisuuden olemuksesta, vauvan heräämisestä seksuaalisuuteen, seksuaalisuuden jäsentymisestä mieleen, kohteen valitsemisesta sekä seksuaalisuuden poikkeavuuksien syntymekanismeista. Selvitän miten teoreetikot kirjoituksissaan vastaavat kysymyksiin, mit…
A Case For a Study Quality Appraisal in Survey Studies in Psychology
2019
The lack of replication of key effects in psychology has highlighted some fundamental problems with reporting of research findings and methods used (Asendorpf et al., 2013; Open Science Collaboration, 2015). Problems with replication have been attributed to sources of bias such as questionable research practices like HARK-ing (Kerr, 1998) or p-hacking (Simmons et al., 2011). Another potential source of bias is lack of precision in the conduct and methods used in psychological research, which likely introduces systematic error into data collected with the potential to affect results. A related issue is lack of accuracy in reporting study methods and findings. There is, therefore, increased r…
Empirical Autotuning of Two-level Parallel Linear Algebra Routines on Large cc-NUMA Systems
2012
In large cc-NUMA systems the efficient use of the different levels of the memory hierarchy is not an easy task, and the performance of multithreading implementations of the libraries decreases when the number of cores used increases, so producing an important lost of efficiency. To alleviate this problem, routines with multilevel parallelism can be developed by combining OpenMP and BLAS parallelism. In that way, higher performance can be achieved, but it is necessary to develop some autotuning technique for the appropriate selection of the number of threads to use at each level. The selection can be made through theoretical models of the execution time or some installation methodology. This…
LAS COMPETENCIAS DEL PROFESORADO EN TIC: ESTRUCTURA BÁSICA (THE COMPETENCIES OF TEACHERS IN ICT: BASIC STRUCTURE)
2013
The ICT competences of teachers are a key variable for ICT integration in school. This paper presents a framework of indicators of competence in relation to two dimensions from a MIMIC model: the first one concerns technological competences and the second one has to do with pedagogical competences. The model includes the definition of a specific relationship between these dimensions and also the effects of a set of relevant factors: personal (gender, age and frequency of computer use) and contextual (type of educational institution, educational stage and access to computer classroom). The information was collected through a questionnaire answered by a sample of 868 teachers of elementary an…
Farsi comune. Topographien prekärer Theaterorte im Europa der Gegenwart
2021
Fragtique: Applying an OO Database Distribution Strategy to Data Warehouse
2001
We propose a strategy for distribution of a relational data warehouse organized according to a star schema. We adapt fragmentation and allocation strategies that were developed for OO databases. We split the most-often-accessed dimension table into fragments by using primary horizontal fragmentation. The derived fragmentation then divides the fact table into fragments. Other dimension tables are not fragmented since they are presumed to be sufficiently small. Allocation of fragments encompasses duplication of non-fragmented dimension tables that we call a closure.
A Representation of Relational Systems
2003
In this paper elements of a theory of multistructures are formulated. The theory of multistructures is used to define a binary representation of relational systems.
Indexing Method for Transitive Relationships of Product Information
2008
To successfully use a relational database management system (RDBMS) as a repository for product information, the RDBMS must efficiently process and properly answer ontological queries. The key to processing the ontological queries is whether the various semantic relationships among the concepts of the product ontology are likewise well-processed. In particular, the transitive relationships (e.g., is-a, component-of relationships) such as ancestors-descendents, parents-children, and taxonomy of products must be processed successfully. We propose an efficient index using a numbering scheme (labeling scheme) to process queries over transitive relationships. (This paper is an extended version o…
A generalized transitive closure for relational queries
1988
We augment relational algebra with a generalized transitive closure operator that allows for the efficient evaluation of a subclass of recursive queries. The operator is based on a composition operator which is as general as possible when the operator is required to be associative and when only relational algebra operators are used in its definition. The closure of such a composition can be computed using the well-known efficient algorithms designed for the computation of the usual transitive closure. Besides the case in which complete materialization of recursive relations are required, our strategy also yields an efficient solution in the case in which a selection is applied to the closur…