An Interoperable Grid Information System for Integrated Resource Monitoring Based on Virtual Organizations

In many Grid infrastructures different kinds of information services are in use, which utilize different incompatible data structures and interfaces to encode and provide their data. Homogeneous monitoring of these infrastructures with the monitoring data being accessible everywhere independently of the middleware which provided it, is the basis for a consistent status reporting on the Grids’ resources and services. Thus, interoperability or interoperation between the different information services in a heterogeneous Grid infrastructure is required. Monitoring data must contain the identity of the affected Virtual Organization (VO) so that it can be related to the resources and services the VO has allocated to enable VO-specific information provision. This paper describes a distributed architecture for an interoperable information service, which combines data unification and categorization with policies for VO membership, VO resource management and data transformations. This service builds the basis for an integrated and interoperating monitoring of Grids, which provide their data to more than one VO and utilize heterogeneous information services.     

The effect of time of day on injury patterns amongst adolescents in Australia

Labour force participation of adolescents in Australia is growing at an unprecedented rate. This increased participation is coupled with a growing realisation of the vulnerability of adolescents in the labour market in terms of occupational injury. Despite recent evidence that time of day may be an important determinant of adolescent injuries, the impact of non-standard and night work on adolescent injury rates has received scant attention to date. The current study addresses this shortcoming by examining injury patterns of 3201 working adolescents in Queensland. Results revealed that female adolescents are 2.5 times more likely to sustain an injury on day shift and 4.71 times more likely to sustain an injury on night shift than their adult counterparts when total work hours are taken into consideration. Similar results were found for male adolescents with an injury to work hours ratio of 2.19 on day shift and 3.05 on night shift. These findings point to the value of considering the temporal pattern of adolescent work in future research aimed at minimising injuries at work and improving the work experience of tomorrow's workforce.     

Prioritizing Information for the Discovery of Phenomena

We consider the problem of prioritizing a collection of discrete pieces of information, or transactions. The goal is to rank the transactions in such a way that the user can best pursue a subset of the transactions in hopes of discovering those which were generated by an interesting source. The problem is shown to differ from traditional classification in several fundamental ways. Ranking algorithms are divided into classes, depending on the amount of information they may utilize. We demonstrate that while ranking by the least constrained algorithm class is consistent with classification, such is not the case for a more constrained class of algorithms. We demonstrate also that while optimal ranking by the former class is easy, optimal ranking by the latter class is NP-hard. Finally, we present detectors which solve optimally restricted versions of the ranking problem, including symmetric anomaly detection.     

Computer-assisted techniques to enhance transformative learning in first-year literature courses

When students use computers as learning tools, the whole process of learning, and, indeed, the learners themselves, are transformed. This article illustrates some techniques that foster transformative learning in computer-assisted first-year literature classes: first, a lesson plan on A Valediction: Forbidding Mourning that uses Microsoft Word functions, including format painter, tables, and annotation to explore meaning in context; second, a plan for learners to use subconference options in the Daedalus Interactive Writing Environment to analyze Oedipus Rex; finally, a demonstration of how students engage in a meta-reflection process as they explore Barn Burning with Freelance Graphics.Marguerite Jamieson is an English instructor at Anne Arundel Community College in Arnold, Maryland, and a doctoral student at George Mason University. Her research interests include forming bridges between adult learning theory and contemporary literary theory — especially drawing on transformational learning theory and the work of Mikhail Bakhtin and Lev Vygotsky.Rebecca Kajs holds a doctorate in English from Texas Woman's University with a concentration in rhetoric. For ten years, she taught the use of heuristic tools for reading analysis at the University of Texas at Arlington. She is currently an associate professor of English and Philosophy at Anne Arundel Community College.Anne Agee holds a doctorate in rhetoric from The Catholic University of America. A professor of English and formerly director of the Humanities Computer Center at Anne Arundel Community College, she is currently the college's Coordinator of Instructional Technology. Dr. Agee and Professor Jamieson have collaborated in a study of the learning environment in a computer classroom, the results of which were published in the Fall 1995 issue of Teaching/Learning Conversations. Dr. Agee has also published Using [Daedalus] InterChange as a Teachers' Journal in the Fall 1995 issue of Wings.     

A rapid computational filter for predicting the rate of human renal clearance

In silico models that predict the rate of human renal clearance for a diverse set of drugs, that exhibit both active secretion and net re-absorption, have been produced using three statistical approaches. Partial Least Squares (PLS) and Random Forests (RF) have been used to produce continuous models whereas Classification And Regression Trees (CART) has only been used for a classification model. The best models generated from either PLS or RF produce significant models that can predict acids/zwitterions, bases and neutrals with approximate average fold errors of 3, 3 and 4, respectively, for an independent test set that covers oral drug-like property space. These models contain additional information on top of any influence arising from plasma protein binding on the rate of renal clearance. Classification And Regression Trees (CART) has been used to generate a classification tree leading to a simple set of Renal Clearance Rules (RCR) that can be applied to man. The rules are influenced by lipophilicity and ion class and can correctly predict 60% of an independent test set. These percentages increase to 71% and 79% for drugs with renal clearances of < 0.1 ml/min/kg and > 1 ml/min/kg, respectively. As far as the authors are aware these are the first set of models to appear in the literature that predict the rate of human renal clearance and can be used to manipulate molecular properties leading to new drugs that are less likely to fail due to renal clearance.     

Variations and Commonalities in Processes of Collaboration: The Need for Multi-Site Workplace Studies

Workplace studies have made a major contribution to the field of CSCW, drawing attention to subtle practices that enable effective collaboration. However, workplace studies typically focus on a single setting, making it difficult to assess the generalisability of the findings. Through a multi-site workplace study, we explore a specific collaborative process, that of the handover which occurs when a patient is transferred from one hospital or ward to another. The study demonstrates that the term ??handover?? captures a variety of collaborative practices that vary in both their form and content, reflecting aspects of the setting in which they occur. Multi-site workplace studies are shown to be essential for CSCW, not only generating findings that have relevance beyond a single setting but also focusing attention on aspects of work practice that may otherwise go unnoticed.     

Structure and Recognition of Graphs with No 6-wheel Subdivision

The subgraph homeomorphism problem has been shown by Robertson and Seymour to be polynomial-time solvable for any fixed pattern graph H. The result, however, is not practical, involving constants that are worse than exponential in |H|. Practical algorithms have only been developed for a few specific pattern graphs, the most recent of these being the wheels with four and five spokes. This paper looks at the subgraph homeomorphism problem where the pattern graph is a wheel with six spokes. The main result is a theorem characterizing graphs that do not contain subdivisions of W ₆. We give an efficient algorithm for solving the subgraph homeomorphism problem for W ₆. We also give a strengthening of the previous W ₅ result.