Minority Student Perceptions of Professional Pscyhology Application Packets: A Qualitative Study

This article reports the results of a qualitative study designed to determine issues salient in Black and Hispanic American students\u27 review and evaluation of program-application packets in professional psychology. The study served as an extension to the Yoshida et al. (1989) quantitative investigation. Students interested in pursuing doctoral studies in counseling or school psychology (N = 22) served as the sample. The qualitative methodology incorporated a think-aloud procedure and semistructured interviews. A theme analysis of transcribed interviews identified both major and minor themes central to participants\u27 evaluation of the packets. Major themes included financial aid, program requirements and course descriptions, demography of the student body, and the quality and clarity of application material. Specific suggestions on developing an application packet to send to inquiring prospective students are put forth. It is recommended that such a packet could serve as a costeffective minority-recruitment strategy

Constraints for Semistructured Data and XML

Integrity constraints play a fundamental role in database design. We review initial work on the expression of integrity constraints for semistructured data and XML

Prospective Minority Students\u27 Perceptions of Application Packets for Professional Psychology Programs: A Qualitative Study

This article reports the results of a qualitative study designed to determine issues salient in Black and Hispanic American students\u27 review and evaluation of program-application packets in professional psychology. The study served as an extension to the Yoshida et al. (1989) quantitative investigation. Students interested in pursuing doctoral studies in counseling or school psychology (N = 22) served as the sample. The qualitative methodology incorporated a think-aloud procedure and semistructured interviews. A theme analysis of transcribed interviews identified both major and minor themes central to participants\u27 evaluation of the packets. Major themes included financial aid, program requirements and course descriptions, demography of the student body, and the quality and clarity of application material. Specific suggestions on developing an application packet to send to inquiring prospective students are put forth. It is recommended that such a packet could serve as a cost-effective minority-recruitment strategy

An Entailment Relation for Reasoning on the Web

Reasoning on the Web is receiving an increasing attention because of emerging fields such as Web adaption and Semantic Web. Indeed, the advanced functionalities striven for in these fields call for reasoning capabilities. Reasoning on the Web, however, is usually done using existing techniques rarely fitting the Web. As a consequence, additional data processing like data conversion from Web formats (e.g. XML or HTML) into some other formats (e.g. classical logic terms and formulas) is often needed and aspects of the Web (e.g. its inherent inconsistency) are neglected. This article first gives requirements for an entailment tuned to reasoning on the Web. Then, it describes how classical logic’s entailment can be modified so as to enforce these requirements. Finally, it discusses how the proposed entailment can be used in applying logic programming to reasoning on the Web

Towards a query language for annotation graphs

The multidimensional, heterogeneous, and temporal nature of speech databases raises interesting challenges for representation and query. Recently, annotation graphs have been proposed as a general-purpose representational framework for speech databases. Typical queries on annotation graphs require path expressions similar to those used in semistructured query languages. However, the underlying model is rather different from the customary graph models for semistructured data: the graph is acyclic and unrooted, and both temporal and inclusion relationships are important. We develop a query language and describe optimization techniques for an underlying relational representation.Comment: 8 pages, 10 figure

Personalization by Partial Evaluation.

The central contribution of this paper is to model personalization by the programmatic notion of partial evaluation.Partial evaluation is a technique used to automatically specialize programs, given incomplete information about their input.The methodology presented here models a collection of information resources as a program (which abstracts the underlying schema of organization and flow of information),partially evaluates the program with respect to user input,and recreates a personalized site from the specialized program.This enables a customizable methodology called PIPE that supports the automatic specialization of resources,without enumerating the interaction sequences beforehand .Issues relating to the scalability of PIPE,information integration,sessioniz-ling scenarios,and case studies are presented

Path constraints in semistructured databases

AbstractWe investigate a class of path constraints that is of interest in connection with both semistructured and structured data. In standard database systems, constraints are typically expressed as part of the schema, but in semistructured data there is no explicit schema and path constraints provide a natural alternative. As with structured data, path constraints on semistructured data express integrity constraints associated with the semantics of data and are important in query optimization. We show that in semistructured databases, despite the simple syntax of the constraints, their associated implication problem is r.e. complete and finite implication problem is co-r.e. complete. However, we establish the decidability of the implication and finite implication problems for several fragments of the path constraint language and demonstrate that these fragments suffice to express important semantic information such as extent constraints, inverse relationships, and local database constraints commonly found in object-oriented databases