Construct and content validity of the Greek version of the birth satisfaction scale (G-BSS).

Background: ‘Birth Satisfaction’ is a term that encompasses a woman’s evaluation of her birth experience. The term includes factors such as her appraisal of the quality of care she received, a personal assessment of how she coped, and her reconstructions of what happened on that particular day. Her accounts may be accurate or skewed, yet correspond with her reality of how events unfolded. Objective: To evaluate properties of an instrument designed to measure birth satisfaction in a Greek population of postnatal women. Study design: We assessed factor structure, internal consistency, divergent validity and known-groups discriminant validity of the 30-item Greek Birth Satisfaction Scale – Long Form (30-item G-BSS-LF) and its revised version the 10-item Greek-BSS-Revised (10-item-G-BSS-R), using survey data collected in Athens. Participants: A convenience sample of healthy Greek postnatal women (n = 162) aged 22–46 years who had delivered between 34 and 42 weeks’ gestation. Results: The 30-item-G-BSS-LF performed poorly in terms of factor structure. The short-form 10-item-G-BSS-R performed well in terms of measurement replication of the English equivalent version as a multidimensional instrument. The short-form 10-item-G-BSS-R comprises three subscales which measure distinct but correlated domains of: (1) quality of care provision (4 items), (2) women’s personal attributes (2 items), and (3) stress experienced during labour (4 items). Key conclusions: The 10-item-G-BSS-R is a valid and reliable multidimensional psychometric instrument for measuring birth satisfaction in Greek postnatal women.

A hybrid ASM approach for sparse volumetric data segmentation

Y. Zhu, S. Williams and R. Zwiggelaar, 'A hybrid ASM approach for sparse volumetric data segmentation', Pattern Recognition and Image Analysis 17 (2), 252-258 (2007)

Intention and Causation in Medical Non-Killing: The impact of criminal law concepts on euthanasia and assisted suicide

null RAE2008

Handedness and social anxiety: using Bryden's research as a catalyst to explore the influence of familial sinistrality and degree of handedness

Phil Bryden's work has impacted on many areas of laterality, including degree and measurement of hand preference, as well as influences of familial sinistrality (FS). For example, Bryden[(1977). Measuring handedness with questionnaires. Neuropsychologia, 15, 617–624] is a well-cited and influential paper that remains relevant to this day. Inspired by this we extended our analysis of the relationship between handedness and anxiety in a number of ways. We used familial handedness and strength of handedness to examine their potential influences on anxiety, and extended our research by exploring their relationship to social anxiety, using the Social Phobia Inventory (SPIN). Inconsistent left-handers (ILH) were found to be more socially anxious. In all categories of SPIN except avoidance, ILH were significantly more anxious than consistent right- and left-handers. There were FS differences between ILH with a first degree left-handed relative (FS+) compared to ILH with no first degree left-handed relative (FS−) on all categories of anxiety scores. Within FS+ participants, ILH had significantly higher anxiety scores, compared with consistent handers across all categories. This suggests that ILH's social anxiety may be influenced by a close left-handed relative. Inspired by examining Bryden's work for this special issue, we will continue to add both strength of preference and familial handedness to our work.

Integrative motivation and global language (English) acquisition in Poland

This study investigated the consistency of a measure of integrative motivation in the prediction of achievement in English as a foreign language in 18 samples of Polish school students. The results are shown to have implications for concerns expressed that integrative motivation might not be appropriate to the acquisition of English because it is a global language and moreover that other factors such as the gender of the student or the environment of the class might also influence its predictability. Results of a hierarchical linear modeling analysis indicated that for the older samples, integrative motivation was a consistent predictor of grades in English, unaffected by either the gender of the student or class environment acting as covariates. Comparable results were obtained for the younger samples except that student gender also contributed to the prediction of grades in English. Examination of the correlations of the elements of the integrative motivation score with English grades demonstrated that the aggregate score is the more consistent correlate from sample to sample than the elements themselves. Such results lead to the hypothesis that integrative motivation is a multi-dimensional construct and different aspects of the motivational complex come into play for each individual. That is, two individuals can hold the same level of integrative motivation and thus attain the same level of achievement but one might be higher in some elements and lower in others than another individual, resulting in consistent correlations of the aggregate but less so for the elements.

Egzystencjalna teoria umysłu. Konstrukcja narzędzia pomiarowego

Wydział Nauk Społecznych: Instytut Psychologii

Representações sociais dos estudantes universitários face a uma relação sexual ocasional

Dissertação apresentada à Universidade Fernando Pessoa como parte dos requisitos para obtenção do grau de Mestre em Mestre em Psicologia especialização em Psicologia da Saúde e Intervenção Comunitária.

A avaliação da qualidade dos serviços em organizadores de feiras

Dissertação de Mestrado apresentada à Universidade Fernando Pessoa como parte dos requisitos para obtenção do grau de Mestre em Ciências da Comunicação, especialização em Marketing e Publicidade.

O Estágio como cenário de prospecção, desenvolvimento e concepção de um Manual de Procedimentos da Rede Concelhia de Bibliotecas Escolares

Dissertação de Mestrado apresentada à Universidade Fernando Pessoa como parte dos requisitos para obtenção do grau de Mestre em Ciências da Informação e da Documentação.

Contributo para o desenvolvimento de um Instrumento de Investigação Neuropsicológica

Tese apresentada à Universidade Fernando Pessoa como parte dos requisitos para obtenção do grau de Doutor em Ciências Sociais, especialidade em Psicologia

Integration of relational and hierarchical network information for protein function prediction

BACKGROUND:In the current climate of high-throughput computational biology, the inference of a protein's function from related measurements, such as protein-protein interaction relations, has become a canonical task. Most existing technologies pursue this task as a classification problem, on a term-by-term basis, for each term in a database, such as the Gene Ontology (GO) database, a popular rigorous vocabulary for biological functions. However, ontology structures are essentially hierarchies, with certain top to bottom annotation rules which protein function predictions should in principle follow. Currently, the most common approach to imposing these hierarchical constraints on network-based classifiers is through the use of transitive closure to predictions.RESULTS:We propose a probabilistic framework to integrate information in relational data, in the form of a protein-protein interaction network, and a hierarchically structured database of terms, in the form of the GO database, for the purpose of protein function prediction. At the heart of our framework is a factorization of local neighborhood information in the protein-protein interaction network across successive ancestral terms in the GO hierarchy. We introduce a classifier within this framework, with computationally efficient implementation, that produces GO-term predictions that naturally obey a hierarchical 'true-path' consistency from root to leaves, without the need for further post-processing.CONCLUSION:A cross-validation study, using data from the yeast Saccharomyces cerevisiae, shows our method offers substantial improvements over both standard 'guilt-by-association' (i.e., Nearest-Neighbor) and more refined Markov random field methods, whether in their original form or when post-processed to artificially impose 'true-path' consistency. Further analysis of the results indicates that these improvements are associated with increased predictive capabilities (i.e., increased positive predictive value), and that this increase is consistent uniformly with GO-term depth. Additional in silico validation on a collection of new annotations recently added to GO confirms the advantages suggested by the cross-validation study. Taken as a whole, our results show that a hierarchical approach to network-based protein function prediction, that exploits the ontological structure of protein annotation databases in a principled manner, can offer substantial advantages over the successive application of 'flat' network-based methods.

The Framingham Heart Study 100K SNP genome-wide association study resource: overview of 17 phenotype working group reports

BACKGROUND:The Framingham Heart Study (FHS), founded in 1948 to examine the epidemiology of cardiovascular disease, is among the most comprehensively characterized multi-generational studies in the world. Many collected phenotypes have substantial genetic contributors; yet most genetic determinants remain to be identified. Using single nucleotide polymorphisms (SNPs) from a 100K genome-wide scan, we examine the associations of common polymorphisms with phenotypic variation in this community-based cohort and provide a full-disclosure, web-based resource of results for future replication studies.METHODS:Adult participants (n = 1345) of the largest 310 pedigrees in the FHS, many biologically related, were genotyped with the 100K Affymetrix GeneChip. These genotypes were used to assess their contribution to 987 phenotypes collected in FHS over 56 years of follow up, including: cardiovascular risk factors and biomarkers; subclinical and clinical cardiovascular disease; cancer and longevity traits; and traits in pulmonary, sleep, neurology, renal, and bone domains. We conducted genome-wide variance components linkage and population-based and family-based association tests.RESULTS:The participants were white of European descent and from the FHS Original and Offspring Cohorts (examination 1 Offspring mean age 32 +/- 9 years, 54% women). This overview summarizes the methods, selected findings and limitations of the results presented in the accompanying series of 17 manuscripts. The presented association results are based on 70,897 autosomal SNPs meeting the following criteria: minor allele frequency [greater than or equal to] 10%, genotype call rate [greater than or equal to] 80%, Hardy-Weinberg equilibrium p-value [greater than or equal to] 0.001, and satisfying Mendelian consistency. Linkage analyses are based on 11,200 SNPs and short-tandem repeats. Results of phenotype-genotype linkages and associations for all autosomal SNPs are posted on the NCBI dbGaP website at http://www.ncbi.nlm.nih.gov/projects/gap/cgi-bin/study.cgi?id=phs000007.CONCLUSION:We have created a full-disclosure resource of results, posted on the dbGaP website, from a genome-wide association study in the FHS. Because we used three analytical approaches to examine the association and linkage of 987 phenotypes with thousands of SNPs, our results must be considered hypothesis-generating and need to be replicated. Results from the FHS 100K project with NCBI web posting provides a resource for investigators to identify high priority findings for replication.

Mermera: Non-Coherent Distributed Shared Memory for Parallel Computing

The proliferation of inexpensive workstations and networks has prompted several researchers to use such distributed systems for parallel computing. Attempts have been made to offer a shared-memory programming model on such distributed memory computers. Most systems provide a shared-memory that is coherent in that all processes that use it agree on the order of all memory events. This dissertation explores the possibility of a significant improvement in the performance of some applications when they use non-coherent memory. First, a new formal model to describe existing non-coherent memories is developed. I use this model to prove that certain problems can be solved using asynchronous iterative algorithms on shared-memory in which the coherence constraints are substantially relaxed. In the course of the development of the model I discovered a new type of non-coherent behavior called Local Consistency. Second, a programming model, Mermera, is proposed. It provides programmers with a choice of hierarchically related non-coherent behaviors along with one coherent behavior. Thus, one can trade-off the ease of programming with coherent memory for improved performance with non-coherent memory. As an example, I present a program to solve a linear system of equations using an asynchronous iterative algorithm. This program uses all the behaviors offered by Mermera. Third, I describe the implementation of Mermera on a BBN Butterfly TC2000 and on a network of workstations. The performance of a version of the equation solving program that uses all the behaviors of Mermera is compared with that of a version that uses coherent behavior only. For a system of 1000 equations the former exhibits at least a 5-fold improvement in convergence time over the latter. The version using coherent behavior only does not benefit from employing more than one workstation to solve the problem while the program using non-coherent behavior continues to achieve improved performance as the number of workstations is increased from 1 to 6. This measurement corroborates our belief that non-coherent shared memory can be a performance boon for some applications.

An Implementation of Mermera: A Shared Memory System that Mixes Coherence with Non-coherence

Coherent shared memory is a convenient, but inefficient, method of inter-process communication for parallel programs. By contrast, message passing can be less convenient, but more efficient. To get the benefits of both models, several non-coherent memory behaviors have recently been proposed in the literature. We present an implementation of Mermera, a shared memory system that supports both coherent and non-coherent behaviors in a manner that enables programmers to mix multiple behaviors in the same program[HS93]. A programmer can debug a Mermera program using coherent memory, and then improve its performance by selectively reducing the level of coherence in the parts that are critical to performance. Mermera permits a trade-off of coherence for performance. We analyze this trade-off through measurements of our implementation, and by an example that illustrates the style of programming needed to exploit non-coherence. We find that, even on a small network of workstations, the performance advantage of non-coherence is compelling. Raw non-coherent memory operations perform 20-40~times better than non-coherent memory operations. An example application program is shown to run 5-11~times faster when permitted to exploit non-coherence. We conclude by commenting on our use of the Isis Toolkit of multicast protocols in implementing Mermera.

Systematic Verification of Safety Properties of Arbitrary Network Protocol Compositions Using CHAIN

Formal correctness of complex multi-party network protocols can be difficult to verify. While models of specific fixed compositions of agents can be checked against design constraints, protocols which lend themselves to arbitrarily many compositions of agents-such as the chaining of proxies or the peering of routers-are more difficult to verify because they represent potentially infinite state spaces and may exhibit emergent behaviors which may not materialize under particular fixed compositions. We address this challenge by developing an algebraic approach that enables us to reduce arbitrary compositions of network agents into a behaviorally-equivalent (with respect to some correctness property) compact, canonical representation, which is amenable to mechanical verification. Our approach consists of an algebra and a set of property-preserving rewrite rules for the Canonical Homomorphic Abstraction of Infinite Network protocol compositions (CHAIN). Using CHAIN, an expression over our algebra (i.e., a set of configurations of network protocol agents) can be reduced to another behaviorally-equivalent expression (i.e., a smaller set of configurations). Repeated applications of such rewrite rules produces a canonical expression which can be checked mechanically. We demonstrate our approach by characterizing deadlock-prone configurations of HTTP agents, as well as establishing useful properties of an overlay protocol for scheduling MPEG frames, and of a protocol for Web intra-cache consistency.