31 research outputs found

    Automation-Induced Complacency Potential: Development and Validation of a New Scale

    Get PDF
    Complacency, or sub-optimal monitoring of automation performance, has been cited as a contributing factor in numerous major transportation and medical incidents. Researchers are working to identify individual differences that correlate with complacency as one strategy for preventing complacency-related accidents. Automation-induced complacency potential is an individual difference reflecting a general tendency to be complacent across a wide variety of situations which is similar to, but distinct from trust. Accurately assessing complacency potential may improve our ability to predict and prevent complacency in safety-critical occupations. Much past research has employed an existing measure of complacency potential. However, in the 25 years since that scale was published, our conceptual understanding of complacency itself has evolved, and we propose that an updated scale of complacency potential is needed. The goal of the present study was to develop, and provide initial validation evidence for, a new measure of automation-induced complacency potential that parallels the current conceptualization of complacency. In a sample of 475 online respondents, we tested 10 new items and found that they clustered into two separate scales: Alleviating Workload (which focuses on attitudes about the use of automation to ease workloads) and Monitoring (which focuses on attitudes toward monitoring of automation). Alleviating workload correlated moderately with the existing complacency potential rating scale, while monitoring did not. Further, both the alleviating workload and monitoring scales showed discriminant validity from the previous complacency potential scale and from similar constructs, such as propensity to trust. In an initial examination of criterion-related validity, only the monitoring-focused scale had a significant relationship with hypothetical complacency (r = -0.42, p < 0.01), and it had significant incremental validity over and above all other individual difference measures in the study. These results suggest that our new monitoring-related items have potential for use as a measure of automation-induced complacency potential and, compared with similar scales, this new measure may have unique value

    Advanced papillary serous carcinoma of the uterine cervix: a case with a remarkable response to paclitaxel and carboplatin combination chemotherapy

    Get PDF
    Papillary serous carcinoma of the uterine cervix (PSCC) is a very rare, recently described variant of cervical adenocarcinoma. This review, describes a case of stage IV PSCC whose main tumor existed in the uterine cervix and invaded one third of the inferior part of the anterior and posterior vaginal walls. Furthermore, it had metastasized from the para-aortic lymph nodes to bilateral neck lymph nodes. Immnoreactivity for CA125 was positive, whereas the staining for p53 and WT-1 were negative in both the original tumor and the metastatic lymph nodes. Six cycles of paclitaxel and carboplatin combination chemotherapy were administered and the PSCC dramatically decreased in size. The main tumor of the uterine cervix showed a complete response by magnetic resonance imaging (MRI), and on rebiopsy, more than 95% of the tumor cells in the cervix had microscopically disapperared. This is the first report of PSCC in which combination chemotherapy was used and showed a remarkable response

    Extraction and Optimisation of Cutting Conditions for 21/2 -Axis Milling

    No full text

    Delaying mismatched field multiplications in pairing computations

    Get PDF
    Millerā€™s algorithm for computing pairings involves perform- ing multiplications between elements that belong to diļ¬€erent ļ¬nite ļ¬elds. Namely, elements in the full extension ļ¬eld Fpk are multiplied by elements contained in proper subļ¬elds F pk/d , and by elements in the base ļ¬eld Fp . We show that signiļ¬cant speedups in pairing computations can be achieved by delaying these ā€œmismatchedā€ multiplications for an optimal number of iterations. Importantly, we show that our technique can be easily integrated into traditional pairing algorithms; implementers can exploit the computational savings herein by applying only minor changes to existing pairing code
    corecore