scholarly journals Combinatorial Algorithms for Data Migration to Minimize Average Completion Time

2006 ◽  
pp. 128-139 ◽  
Author(s):  
Rajiv Gandhi ◽  
Julián Mestre
Keyword(s):  
Completion Time ◽  
Data Migration ◽  
Combinatorial Algorithms ◽  
Average Completion Time

A German version of the Intermittent Claudication Questionnaire (ICQ): cultural adaptation and validation

VASA ◽  
2012 ◽  
Vol 41 (5) ◽  
pp. 333-342 ◽  
Author(s):  
Kirchberger ◽  
Finger ◽  
Müller-Bühl
Keyword(s):  
Principal Component Analysis ◽  
Intermittent Claudication ◽  
Completion Time ◽  
Short Form ◽  
Principal Component ◽  
Component Analysis ◽  
German Version ◽  
Average Completion Time ◽  
Sf 36 ◽  
Related Quality

Background: The Intermittent Claudication Questionnaire (ICQ) is a short questionnaire for the assessment of health-related quality of life (HRQOL) in patients with intermittent claudication (IC). The objective of this study was to translate the ICQ into German and to investigate the psychometric properties of the German ICQ version in patients with IC. Patients and methods: The original English version was translated using a forward-backward method. The resulting German version was reviewed by the author of the original version and an experienced clinician. Finally, it was tested for clarity with 5 German patients with IC. A sample of 81 patients were administered the German ICQ. The sample consisted of 58.0 % male patients with a median age of 71 years and a median IC duration of 36 months. Test of feasibility included completeness of questionnaires, completion time, and ratings of clarity, length and relevance. Reliability was assessed through a retest in 13 patients at 14 days, and analysis of Cronbach’s alpha for internal consistency. Construct validity was investigated using principal component analysis. Concurrent validity was assessed by correlating the ICQ scores with the Short Form 36 Health Survey (SF-36) as well as clinical measures. Results: The ICQ was completely filled in by 73 subjects (90.1 %) with an average completion time of 6.3 minutes. Cronbach’s alpha coefficient reached 0.75. Intra-class correlation for test-retest reliability was r = 0.88. Principal component analysis resulted in a 3 factor solution. The first factor explained 51.5 of the total variation and all items had loadings of at least 0.65 on it. The ICQ was significantly associated with the SF-36 and treadmill-walking distances whereas no association was found for resting ABPI. Conclusions: The German version of the ICQ demonstrated good feasibility, satisfactory reliability and good validity. Responsiveness should be investigated in further validation studies.

scholarly journals A Batching Machine Model for Lot Scheduling on a Single Machine

2018 ◽  
Vol 43 (1) ◽  
pp. 37-40
Author(s):  
Mikhail Y. Kovalyov
Keyword(s):  
Single Machine ◽  
Completion Time ◽  
Optimal Solution ◽  
Time Algorithm ◽  
Machine Model ◽  
Average Completion Time ◽  
Lot Scheduling ◽  
Batching Machine ◽  
Machine Problem ◽  
Total Average

Abstract A recently introduced lot scheduling problem is considered. It is to find a partition of jobs of n orders into lots and to sequence these lots on a single machine so that the total average completion time of the orders is minimized. A simple O(n log n) time algorithm is presented for this problem in the literature, with a relatively sophisticated proof of its optimality. We show that modeling this problem as a classic batching machine problem makes its optimal solution obvious.

Achieving completion time guarantees in an opportunistic data migration scheme

2006 ◽  
Vol 33 (4) ◽  
pp. 11-16 ◽  
Author(s):  
Jianyong Zhang ◽  
Prasenjit Sarkar ◽  
Anand Sivasubramaniam
Keyword(s):  
Completion Time ◽  
Data Migration

scholarly journals Assessment of outcomes associated with a Moodle-based lesson design for a research course in pharmacy education: An experimental pilot process validation study

2021 ◽  
pp. 642-650
Author(s):  
Syed Wasif Gillani ◽  
Shabaz Mohiuddin Gulam ◽  
Jumana Al-Salloum ◽  
Rizah Anwar Assadi
Keyword(s):  
Completion Time ◽  
Pool Analysis ◽  
Research Process ◽  
Pharmacy Education ◽  
Pharmacy Students ◽  
Lesson Design ◽  
Mean Values ◽  
Self Reflection ◽  
Average Completion Time ◽  
And Performance

Background: This study aims to evaluate the effectiveness of an online Moodle-based lesson for pharmacy students developed and designed for a research course focused on different methodologies, study variables, and research process applications. Methods: An experimental research methodology was used to determine the effectiveness of the Moodle-based lesson. All fourth term Pharm.D. students were required to complete and provide self-reflection reports. The outcome variables were cluster-based completion time, earned score, subjective feedback on contents, gender differences, and performance. Mean values were used to conduct statistical analysis, and a logistic regression model was applied to identify the significance of independent variables. Results: A total of 35 students completed the Moodle-based lesson. The mean earned score for the module was 81.0%, with an average completion time of 28.5 (range 26.8-30.1) hours. Females showed completion in less time compared to males. The reported knowledge and understanding showed a significant (p<0.001) pre-post increase in mean percentages in all three clusters. The intragroup pool analysis also reported significant (p<0.001) differences among gender and performance. The general feedback was limited to technical difficulties and self-reflection questions. Conclusions: The findings of this study showed that the online Moodle-based lesson module for a research course is an effective and validated tool to improve the knowledge and understanding of pharmacy students.

Application and Storage-Aware Data Placement and Job Scheduling for Hadoop Clusters

2020 ◽  
Vol 29 (16) ◽  
pp. 2050254
Author(s):  
Tao Li ◽  
Shuibing He ◽  
Ping Chen ◽  
Siling Yang ◽  
Yanlong Yin ◽  
...  
Keyword(s):  
Completion Time ◽  
Large Scale ◽  
Job Scheduling ◽  
Data Placement ◽  
Storage Device ◽  
Storage Devices ◽  
Average Completion Time ◽  
Hadoop Clusters ◽  
And Storage ◽  
Existing Data

As one of the most popular frameworks for large-scale analytics processing, Hadoop is facing two challenges: both applications and storage devices become heterogeneous. However, existing data placement and job scheduling schemes pay little attention to such heterogeneity of either application I/O requirements or I/O device capability, thus can greatly degrade system efficiencies. In this paper, we propose ASPS, an Application and Storage-aware data Placement and job Scheduling approach for Hadoop clusters. The idea is to place application data and schedule application tasks considering both application I/O requirements and storage device characteristics. Specifically, ASPS first introduces novel metrics to quantify I/O requirements of applications. Then, based on the quantification, ASPS places data of different applications to the preferred storage devices. Finally, ASPS tries to launch jobs with high I/O requirements on the nodes with the same type of faster devices to improve system efficiency. We have implemented ASPS in Hadoop framework. Experimental results show that ASPS can reduce the completion time of a single application by up to 36% and the average completion time of six concurrent applications by 27%, compared to existing data placement policies and job scheduling approaches.

scholarly journals On-line scheduling to minimize average completion time revisited

2004 ◽  
Vol 32 (5) ◽  
pp. 485-490 ◽  
Author(s):  
Nicole Megow ◽  
Andreas S Schulz
Keyword(s):  
Completion Time ◽  
Average Completion Time ◽  
On Line

Approximation Techniques for Average Completion Time Scheduling

2001 ◽  
Vol 31 (1) ◽  
pp. 146-166 ◽  
Author(s):  
C. Chekuri ◽  
R. Motwani ◽  
B. Natarajan ◽  
C. Stein
Keyword(s):  
Completion Time ◽  
Approximation Techniques ◽  
Average Completion Time ◽  
Time Scheduling
Sign in / Sign up

Export Citation Format

Share Document