A Review of the Ahmed Glaucoma Valve Implant and Comparison with Other Surgical Operations.

PubMed

Riva, Ivano; Roberti, Gloria; Katsanos, Andreas; Oddone, Francesco; Quaranta, Luciano

2017-04-01

The Ahmed glaucoma valve (AGV) is a popular glaucoma drainage implant used for the control of intraocular pressure in patients with glaucoma. While in the past AGV implantation was reserved for glaucoma patients poorly controlled after one or more filtration procedures, mounting evidence has recently encouraged its use as a primary surgery in selected cases. AGV has been demonstrated to be safe and effective in reducing intraocular pressure in patients with primary or secondary refractory glaucoma. Compared to other glaucoma surgeries, AGV implantation has shown favorable efficacy and safety. The aim of this article is to review the results of studies directly comparing AGV with other surgical procedures in patients with glaucoma.

Comparative Analysis of 2-D Versus 3-D Ultrasound Estimation of the Fetal Adrenal Gland Volume and Prediction of Preterm Birth

PubMed Central

Turan, Ozhan M.; Turan, Sifa; Buhimschi, Irina A.; Funai, Edmund F.; Campbell, Katherine H.; Bahtiyar, Ozan M.; Harman, Chris R.; Copel, Joshua A.; Baschat, Ahmet A; Buhimschi, Catalin S.

2013-01-01

Objective We aim to test the hypothesis that 2D fetal AGV measurements offer similar volume estimates as volume calculations based on 3D technique Methods Fetal AGV was estimated by 3D ultrasound (VOCAL) in 93 women with signs/symptoms of preterm labor and 73 controls. Fetal AGV was calculated using an ellipsoid formula derived from 2D measurements of the same blocks (0.523× length × width × depth). Comparisons were performed by intra-class correlation coefficient (ICC), coefficient of repeatability, and Bland-Altman method. The cAGV (AGV/fetal weight) was calculated for both methods and compared for prediction of PTB within 7 days. Results Among 168 volumes, there was a significant correlation between 3D and 2D methods (ICC=0.979[95%CI: 0.971-0.984]). The coefficient of repeatability for the 3D was superior to the 2D method (Intra-observer 3D: 30.8, 2D:57.6; inter-observer 3D: 12.2, 2D: 15.6). Based on 2D calculations, a cAGV≥433mm3/kg, was best for prediction of PTB (sensitivity: 75%(95%CI=59-87); specificity: 89%(95%CI=82-94). Sensitivity and specificity for the 3D cAGV (cut-off ≥420mm3/kg) was 85%(95%CI=70-94) and 95%(95%CI=90-98), respectively. In receiver-operating-curve curve analysis, 3D cAGV was superior to 2D cAGV for prediction of PTB (z=1.99, p=0.047). Conclusion 2D volume estimation of fetal adrenal gland using ellipsoid formula cannot replace 3D AGV calculations for prediction of PTB. PMID:22644825

Three-year Treatment Outcomes in the Ahmed Baerveldt Comparison Study

PubMed Central

Barton, Keith; Feuer, William J; Budenz, Donald L; Schiffman, Joyce; Costa, Vital P.; Godfrey, David G.; Buys, Yvonne M.

2014-01-01

Purpose To compare three year outcomes and complications of the Ahmed FP7 Glaucoma Valve (AGV) and Baerveldt 101–350 Glaucoma Implant (BGI) for the treatment of refractory glaucoma. Design Multicenter randomized controlled clinical trial. Participants 276 patients; 143 in the AGV group and 133 in the BGI group. Methods Patients aged 18–85 years with refractory glaucoma and intraocular pressures (IOPs) ≥18 mmHg in whom an aqueous shunt was planned were randomized to either an AGV or a BGI. Main Outcome Measures IOP, visual acuity, supplemental medical therapy, complications, and failure (IOP > 21 mmHg or not reduced by 20% from baseline, IOP ≤ 5 mmHg, reoperation for glaucoma or removal of implant, or loss of light perception vision). Results At 3 years, IOP (mean ± standard deviation) (SD) was 14.3 ± 4.7 mmHg (AGV group) and 13.1 ± 4.5 mmHg (BGI group) (p = 0.086) on 2.0 ± 1.4 and 1.5 ± 1.4 glaucoma medications respectively (p = 0.020). The cumulative probabilities of failure were 31.3% (standard error = 4.0%) (SE) (AGV) and 32.3% (4.2%) (BGI) (p = 0.99). Postoperative complications associated with reoperation or vision loss of ≥ 2 Snellen lines occurred in 24 patients (22%) (AGV) and 38 patients (36%) (BGI) (p = 0.035). The mean change in the Logarithm of the Minimum Angle of Resolution visual acuity (logMAR VA) at 3 years was similar (AGV: 0.21 ± 0.88, BGI: 0.26 ± 0.74) in the two treatment groups at 3 years (p=0.66). The cumulative proportion of patients (SE) undergoing reoperation for glaucoma prior to the three year postoperative time point was 14.5% (3.0%) in the AGV group compared to 7.6% (2.4%) in the BGI group (p=0.053, log-rank). The relative risk of reoperation for glaucoma in the AGV group was 2.1 times that of the BGI group (95% Confidence Interval:1.0–4.8, p=0.045; Cox proportional hazards regression). Conclusions AGV implantation was associated with the need for significantly greater adjunctive medication to achieve equal success relative to BGI implantation and resulted in a greater relative risk of reoperation for glaucoma. More subjects experienced serious postoperative complications in the BGI group than in the AGV group. PMID:24768240

Treatment Outcomes in the Ahmed Baerveldt Comparison Study after One Year of Follow-up

PubMed Central

Budenz, Donald L; Barton, Keith; Feuer, William J; Schiffman, Joyce; Costa, Vital P.; Godfrey, David G.; Buys, Yvonne

2010-01-01

Purpose To determine the relative efficacy and complications of the Ahmed FP7 Glaucoma Valve (AGV) and the Baerveldt 101–350 Glaucoma Implant (BGI) in refractory glaucoma. Design Multicenter randomized controlled clinical trial. Participants 276 patients, including 143 in the AGV group and 133 in the BGI group. Methods Patients aged 18–85 years with refractory glaucoma with intraocular pressure (IOP) greater than or equal to 18 mm Hg in whom an aqueous shunt was planned were randomized to undergo implantation of either an AGV or a BGI. Main Outcome Measures Primary outcome was failure, defined as IOP > 21 mm Hg or not reduced by 20%, IOP ≤ 5 mm Hg, reoperation for glaucoma or removal of implant, or loss of light perception vision. Secondary outcomes included mean IOP, visual acuity, use of supplemental medical therapy, and complications. Results Preoperative IOP (mean ± standard deviation, SD) was 31.2 ± 11.2 in the AGV group and 31.8 ± 12.5 in the BGI group (p = 0.71). At 1 year, IOP was 15.4 ± 5.5 mm Hg in the AGV group and 13.2 ± 6.8 mm Hg in the BGI group (p = 0.007). The number of glaucoma medications (mean ± SD) was 1.8 ± 1.3 in the AGV group and 1.5 ± 1.4 in the BGI group (p = 0.071). The cumulative probability of failure was 16.4% (standard error, SE = 3.1%) in the AGV group and 14.0% (SE = 3.1%) in the BGI group at 1 year (p = 0.52). More patients experienced early postoperative complications in the BGI group (n = 77, 58%) compared to the AGV group (n = 61, 43%, p = 0.016). Serious postoperative complications associated with reoperation and/or vision loss of ≥ 2 Snellen lines occurred in 29 patients (20%) in the AGV group and 45 patients (34%) in the BGI group (p = 0.014). Conclusions Although the average IOP after one year was slightly higher in patients who received an AGV, there were fewer early and serious postoperative complications associated with the use of the AGV than the BGI. PMID:20932583

Sutureless human sclera donor patch graft for Ahmed glaucoma valve.

PubMed

Zeppa, Lucio; Romano, Mario R; Capasso, Luigi; Tortori, Achille; Majorana, Mara A; Costagliola, Ciro

2010-01-01

To report the safety and effectiveness of a sutureless human sclera donor patch graft covering the subconjunctival portion of glaucoma drainage implant tube to prevent its erosion throughout the overlying conjunctiva. This was a prospective pilot study. Fifteen eyes of 15 consecutive patients not responsive to medical and to not-implant surgical glaucoma treatment underwent Ahmed glaucoma valve (AGV) implant surgery with sutureless human sclera donor patch graft. The surgical procedure included AVG implant placed 8 mm behind the corneal limbus and fixed to the sclera with two 9-0 black nylon sutures. The tube was passed through the scleral tunnel, parallel to the corneal limbus, and shortened at the desired length. The anterior part of the tube was covered with human donor scleral graft and kept in place with fibrin glue (Tissue Coll) under the conjunctiva. Examinations were scheduled at baseline and then at 1 week and 1, 3, 6, and 12 months after surgery. At 12-month follow-up, the best-corrected visual acuity did not significantly improve from baseline 0.78+/-1.2 logMAR, whereas mean intraocular pressure significantly decreased from preoperative values of 29.8 (SD 8.4) mmHg. In all cases, the scleral patch was found in place at each check during the follow-up period. No conjunctival erosion over the AGV tube nor sign of endophthalmitis was recorded at any time during the follow-up period. AVG implant surgery with sutureless human sclera donor patch graft represents an effective and relatively safe surgical procedure for complicated glaucomas, avoiding conjunctival erosions over the AGV tube.

Intelligence Level Performance Standards Research for Autonomous Vehicles.

PubMed

Bostelman, Roger B; Hong, Tsai H; Messina, Elena

2015-01-01

United States and European safety standards have evolved to protect workers near Automatic Guided Vehicles (AGV's). However, performance standards for AGV's and mobile robots have only recently begun development. Lessons can be learned from research and standards efforts for mobile robots applied to emergency response and military applications. Research challenges, tests and evaluations, and programs to develop higher intelligence levels for vehicles can also used to guide industrial AGV developments towards more adaptable and intelligent systems. These other efforts also provide useful standards development criteria for AGV performance test methods. Current standards areas being considered for AGVs are for docking, navigation, obstacle avoidance, and the ground truth systems that measure performance. This paper provides a look to the future with standards developments in both the performance of vehicles and the dynamic perception systems that measure intelligent vehicle performance.

Trabeculectomy with Ex-PRESS implant versus Ahmed glaucoma valve implantation-a comparative study

PubMed Central

Waisbourd, Michael; Fischer, Naomi; Shalev, Hadas; Spierer, Oriel; Ben Artsi, Elad; Rachmiel, Rony; Shemesh, Gabi; Kurtz, Shimon

2016-01-01

AIM To compare the surgical outcomes of trabeculectomy with Ex-PRESS implant and Ahmed glaucoma valve (AGV) implantation. METHODS Patients who underwent trabeculectomy with Ex-PRESS implants or AGV implantation separately were included in this retrospective chart review. Main outcome measures were surgical failure and complications. Failure was defined as intraocular pressure (IOP) >21 mm Hg or <5 mm Hg on two consecutive visits after 3mo, reoperation for glaucoma, or loss of light perception. Eyes that had not failed were considered as complete success if they did not required supplemental medical therapy. RESULTS A total of 64 eyes from 57 patients were included: 31 eyes in the Ex-PRESS group and 33 eyes in the AGV group. The mean follow-up time was 2.6±1.1y and 3.3±1.6y, respectively. Patients in the AGV group had significantly higher baseline mean IOP (P=0.005), lower baseline mean visual acuity (VA) (P=0.02), and higher proportion of patients with history of previous trabeculectomy (P<0.0001). Crude failure rates were 16.1%, n=5/31 in the Ex-PRESS group and 24.2%, n=8/33 in the AGV group. The cumulative proportion of failure was similar between the groups, P=0.696. The proportion of eyes that experienced postoperative complications was 32.3% in the Ex-PRESS group and 60.1% in the AGV group (P=0.0229). CONCLUSION Trabeculectomy with Ex-PRESS implant and AGV implantation had comparable failure rates. The AGV group had more post-operative complications, but also included more complex cases with higher baseline mean IOP, worse baseline mean VA, and more previous glaucoma surgeries. Therefore, the results are limited to the cohort included in this study. PMID:27803857

Ahmed glaucoma valve in uveitic patients with fluocinolone acetonide implant-induced glaucoma: 3-year follow-up.

PubMed

Kubaisi, Buraa; Maleki, Arash; Ahmed, Aseef; Lamba, Neel; Sahawneh, Haitham; Stephenson, Andrew; Montieth, Alyssa; Topgi, Shobha; Foster, C Stephen

2018-01-01

To evaluate the efficacy and safety of Ahmed glaucoma valve (AGV) in eyes with noninfectious uveitis that had fluocinolone acetonide intravitreal implant (Retisert™)-induced glaucoma. This retrospective study reviewed the safety and efficacy of AGV implantation in patients with persistently elevated intraocular pressure (IOP) after implantation of a fluocinolone acetonide intravitreal implant at the Massachusetts Eye Research and Surgery Institution between August 2006 and November 2015. Nine patients with 10 uveitic eyes were included in this study, none of which had preexisting glaucoma in the study eye. Mean patient age was 42 years; 6 patients were female and 3 were male. Baseline mean IOP was 30.6 mmHg prior to AGV placement while mean IOP-lowering medications were 2.9. In the treatment groups, there was a statistically significant reduction in post-AGV IOP. IOP was lowest at 1-week after AGV implantation (9.0 mmHg). Nine out of 10 eyes achieved an IOP below target value of 22 mmHg and/or a 20% reduction in IOP from baseline 1 month and 1 year following AGV placement. All other postoperative time points showed all 10 eyes reaching this goal. A statistically significant decrease in IOP-lowering medication was seen at the 1-week, 1-month, and 3-year time points compared to baseline, while a statistically significant increase was seen at the 3-month, 6-month, and 2-year post-AGV time points. No significant change in retinal nerve thickness or visual field analysis was found. AGV is an effective and safe method of treatment in fluocinolone acetonide intravitreal implant-induced glaucoma. High survival rate is expected for at least 3 years.

Flow Test to Predict Early Hypotony and Hypertensive Phase After Ahmed Glaucoma Valve (AGV) Surgical Implantation.

PubMed

Cheng, Jason; Beltran-Agullo, Laura; Buys, Yvonne M; Moss, Edward B; Gonzalez, Johanna; Trope, Graham E

2016-06-01

To assess the validity of a preimplantation flow test to predict early hypotony [intraocular pressure (IOP)≤5 mm Hg on 2 consecutive visits and hypertensive phase (HP) (IOP>21 mm Hg) after Ahmed Glaucoma Valve (AGV) implantation. Prospective interventional study on patients receiving an AGV. A preimplantation flow test using a gravity-driven reservoir and an open manometer was performed on all AGVs. Opening pressure (OP) and closing pressure (CP) were defined as the pressure at which fluid was seen to flow or stop flowing through the AGV, respectively. OP and CP were measured twice per AGV. Patients were followed for 12 weeks. In total, 20 eyes from 19 patients were enrolled. At 12 weeks the mean IOP decreased from 29.2±9.1 to 16.8±5.2 mm Hg (P<0.01). The mean AGV OP was 17.5±5.4 mm Hg and the mean CP was 6.7±2.3 mm Hg. Early (within 2 wk postoperative) HP occurred in 37% and hypotony in 16% of cases. An 18 mm Hg cutoff for the OP gave a sensitivity of 0.71, specificity of 0.83, positive predictive value of 0.71, and negative predictive value of 0.83 for predicting an early HP. A 7 mm Hg cutoff for the CP yielded a sensitivity of 1.0, specificity of 0.38, positive predictive value of 0.23, and negative predictive value of 1.0 for predicting hypotony. Preoperative OP and CP may predict early hypotony or HP and may be used as a guide as to which AGV valves to discard before implantation surgery.

Ahmed glaucoma valve in uveitic patients with fluocinolone acetonide implant-induced glaucoma: 3-year follow-up

PubMed Central

Kubaisi, Buraa; Maleki, Arash; Ahmed, Aseef; Lamba, Neel; Sahawneh, Haitham; Stephenson, Andrew; Montieth, Alyssa; Topgi, Shobha; Foster, C Stephen

2018-01-01

Purpose To evaluate the efficacy and safety of Ahmed glaucoma valve (AGV) in eyes with noninfectious uveitis that had fluocinolone acetonide intravitreal implant (Retisert™)-induced glaucoma. Methods This retrospective study reviewed the safety and efficacy of AGV implantation in patients with persistently elevated intraocular pressure (IOP) after implantation of a fluocinolone acetonide intravitreal implant at the Massachusetts Eye Research and Surgery Institution between August 2006 and November 2015. Results Nine patients with 10 uveitic eyes were included in this study, none of which had preexisting glaucoma in the study eye. Mean patient age was 42 years; 6 patients were female and 3 were male. Baseline mean IOP was 30.6 mmHg prior to AGV placement while mean IOP-lowering medications were 2.9. In the treatment groups, there was a statistically significant reduction in post-AGV IOP. IOP was lowest at 1-week after AGV implantation (9.0 mmHg). Nine out of 10 eyes achieved an IOP below target value of 22 mmHg and/or a 20% reduction in IOP from baseline 1 month and 1 year following AGV placement. All other postoperative time points showed all 10 eyes reaching this goal. A statistically significant decrease in IOP-lowering medication was seen at the 1-week, 1-month, and 3-year time points compared to baseline, while a statistically significant increase was seen at the 3-month, 6-month, and 2-year post-AGV time points. No significant change in retinal nerve thickness or visual field analysis was found. Conclusion AGV is an effective and safe method of treatment in fluocinolone acetonide intravitreal implant-induced glaucoma. High survival rate is expected for at least 3 years. PMID:29750012

Dynamic tube movement after reimplantation of Ahmed glaucoma valve in a child with glaucoma in aphakia

PubMed Central

Senthil, Sirisha; Badakare, Akshay

2014-01-01

A 10-year-old girl underwent an Ahmed glaucoma valve (AGV) implantation as a primary procedure for glaucoma in aphakia due to congenital cataract surgery. Following an unintended accidental excision of AGV tube during bleb revision for hypertensive phase, AGV was explanted and a second AGV was implanted in the same quadrant after 2 weeks. This resulted in a rare complication of dynamic tube movement in the anterior chamber with tube corneal touch and localised corneal oedema. Excision of the offending unstable tube and placement of a paediatric AGV in a different quadrant led to resolution of this complication, stable vision and well-controlled intraocular pressure. This case highlights the possible causes of dynamic tube, related complications and its management. This case also highlights the importance of understanding the various physiological phases after glaucoma drainage device implantation and their appropriate management. PMID:24695662

Accurate method for preoperative estimation of the right graft volume in adult-to-adult living donor liver transplantation.

PubMed

Khalaf, H; Shoukri, M; Al-Kadhi, Y; Neimatallah, M; Al-Sebayel, M

2007-06-01

Accurate estimation of graft volume is crucial to avoid small-for-size syndrome following adult-to-adult living donor liver transplantation AALDLT). Herein, we combined radiological and mathematical approaches for preoperative assessment of right graft volume. The right graft volume was preoperatively estimated in 31 live donors using two methods: first, the radiological graft volume (RGV) by computed tomography (CT) volumetry and second, a calculated graft volume (CGV) obtained by multiplying the standard liver volume by the percentage of the right graft volume (given by CT). Both methods were compared to the actual graft volume (AGV) measured during surgery. The graft recipient weight ratio (GRWR) was also calculated using all three volumes (RGV, CGV, and AGV). Lin's concordance correlation coefficient (CCC) was used to assess the agreement between AGV and both RGV and CGV. This was repeated using the GRWR measurements. The mean percentage of right graft volume was 62.4% (range, 55%-68%; SD +/- 3.27%). The CCC between AGV and RGV versus CGV was 0.38 and 0.66, respectively. The CCC between GRWR using AGV and RGV versus CGV was 0.63 and 0.88, respectively (P < .05). According to the Landis and Kock benchmark, the CGV correlated better with AGV when compared to RGV. The better correlation became even more apparent when applied to GRWR. In our experience, CGV showed a better correlation with AGV compared with the RGV. Using CGV in conjunction with RGV may be of value for a more accurate estimation of right graft volume for AALDLT.

Early Ahmed Glaucoma Valve Implantation after Penetrating Keratoplasty Leads to Better Outcomes in an Asian Population with Preexisting Glaucoma

PubMed Central

Tai, Ming-Cheng; Chen, Yi-Hao; Cheng, Jen-Hao; Liang, Chang-Min; Chen, Jiann-Torng; Chen, Ching-Long; Lu, Da-Wen

2012-01-01

Background To evaluate the efficacy of Ahmed Glaucoma Valve (AGV) surgery and the optimal interval between penetrating keratoplasty (PKP) and AGV implantation in a population of Asian patients with preexisting glaucoma who underwent PKP. Methodology/Principal Findings In total, 45 eyes of 45 patients were included in this retrospective chart review. The final intraocular pressures (IOPs), graft survival rate, and changes in visual acuity were assessed to evaluate the outcomes of AGV implantations in eyes in which AGV implantation occurred within 1 month of post-PKP IOP elevation (Group 1) and in eyes in which AGV implantation took place more than 1 month after the post-PKP IOP evaluation (Group 2). Factors that were associated with graft failure were analyzed, and the overall patterns of complications were reviewed. By their final follow-up visits, 58% of the patients had been successfully treated for glaucoma. After the operation, there were no statistically significant differences between the groups with respect to graft survival (p = 0.98), but significant differences for IOP control (p = 0.049) and the maintenance of visual acuity (VA) (p<0.05) were observed. One year after surgery, the success rates of IOP control in Group 1 and Group 2 were 80% and 46.7%, respectively, and these rates fell to 70% and 37.3%, respectively, by 2 years. Factors that were associated with a high risk of AGV failure were a diagnosis of preexisting angle-closure glaucoma, a history of previous PKP, and a preoperative IOP that was >21 mm Hg. The most common surgical complication, aside from graft failure, was hyphema. Conclusions/Significance Early AGV implantation results in a higher probability of AGV survival and a better VA outcome without increasing the risk of corneal graft failure as a result of post-PKP glaucoma drainage tube implantation. PMID:22629464

Changes in Corneal Endothelial Cell after Ahmed Glaucoma Valve Implantation and Trabeculectomy: 1-Year Follow-up.

PubMed

Kim, Min Su; Kim, Kyoung Nam; Kim, Chang-Sik

2016-12-01

To compare changes in corneal endothelial cell density (CECD) after Ahmed glaucoma valve (AGV) implantation and trabeculectomy. Changes in corneal endothelium in patients that underwent AGV implantation or trabeculectomy were prospectively evaluated. Corneal specular microscopy was performed at the central cornea using a non-contact specular microscope before surgery and 6 months and 12 months after surgery. The CECD, hexagonality of the endothelial cells, and the coefficient of variation of the cell areas were compared between the two groups. Forty eyes of 40 patients with AGV implantation and 28 eyes of 28 patients with trabeculectomy were studied. Intraocular pressure in the AGV implantation group was significantly higher than that in the trabeculectomy group ( p < 0.001), but there was no significant difference in other clinical variables between the two groups. In the AGV implantation group, the mean CECD significantly decreased by 9.4% at 6 months and 12.3% at 12 months compared with baseline values (both, p < 0.001), while it decreased by 1.9% at 6 months and 3.2% at 12 months in the trabeculectomy group ( p = 0.027 and p = 0.015, respectively). The changes at 6 months and 12 months in the AGV implantation group were significantly higher than those in the trabeculectomy group ( p = 0.030 and p = 0.027, respectively). In the AGV implantation group, there was a significant decrease in the CECD between baseline and 6 months and between 6 months and 12 months ( p < 0.001 and p = 0.005, respectively). However, in the trabeculectomy group, a significant decrease was observed only between baseline and 6 months ( p = 0.027). Both the AGV implantation group and the trabeculectomy group showed statistically significant decreases in the CECD 1 year after surgery. The decrease in CECD in the AVG implantation group was greater and persisted longer than that in the trabeculectomy group.

Comparison of Ahmed glaucoma valve implantation and trabeculectomy for glaucoma: a systematic review and meta-analysis.

PubMed

HaiBo, Tan; Xin, Kang; ShiHeng, Lu; Lin, Liu

2015-01-01

To compare the efficacy and safety of Ahmed glaucoma valve implantation (AGV) with trabeculectomy in the management of glaucoma patients. A comprehensive literature search (PubMed, Embase, Google, and the Cochrane library) was performed, including a systematic review with meta-analysis of controlled clinical trials comparing AGV versus trabeculectomy. Efficacy estimates were the weighted mean differences (WMDs) for the percentage intraocular pressure reduction (IOPR %) from baseline to end-point, the reduction in glaucoma medications, and the odds ratios (ORs) for complete and qualified success rates. Safety estimates were the relative risks (RRs) for adverse events. All outcomes were reported with a 95% confidence interval (CI). Statistical analysis was performed using the RevMan 5.0 software. Six controlled clinical trials were included in this meta-analysis. There was no significant difference between the AGV and trabeculectomy in the IOPR% (WMD = -3.04, 95% CI: -8.36- 2.26; P = 0.26). The pooled ORs comparing AGV with trabeculectomy were 0.46 (0.22, 0.99) for the complete success rate (P = 0.05) and 0.97 (0.78-1.20) for the quantified success rate (P = 0.76). No significant difference in the reduction in glaucoma medicines was observed (WMD = 0.24; 95% CI: -0.27-0.76; P = 0.35). AGV was found to be associated with a significantly lower frequency of all adverse events (RR = 0.71; 95%CI: 1.14-0.97; p = 0.001) than trabeculectomy, while the most common complications did not differ significantly (all p> 0.05). AGV was equivalent to trabeculectomy in reducing the IOP, the number of glaucoma medications, success rates, and rates of the most common complications. However, AGV was associated with a significantly lower frequency of overall adverse events.

Ahmed Versus Baerveldt Glaucoma Drainage Implantation in Patients With Markedly Elevated Intraocular Pressure (≥30 mm Hg).

PubMed

Resende, Arthur F; Moster, Marlene R; Patel, Neal S; Lee, Daniel; Dhami, Hermandeep; Pro, Michael J; Waisbourd, Michael

2016-09-01

Glaucoma patients with markedly elevated intraocular pressure (IOP) are at risk for developing severe hypotony-related complications. The goal of this study was to compare the surgical outcomes of the Ahmed Glaucoma Valve (AGV) and the Baerveldt Glaucoma Implant (BGI) in this patient population. Patients with preoperative IOP≥30 mm Hg were included. Outcome measures were: (1) surgical failure (IOP>21 mm Hg or <30% reduction from baseline or IOP≤5 mm Hg on 2 consecutive follow-up visits after 3 mo, or additional glaucoma surgery, or loss of light perception) and (2) surgical complications. A total of 75 patients were included: 37 in the AGV group and 38 in the BGI group. The mean±SD follow-up was 2.3±1.6 years for the AGV group and 2.4±1.7 years for the BGI group (P=0.643). Mean preoperative IOP was 38.7±6.5 mm Hg for the AGV group and 40.8±7.6 mm Hg for the BGI group. At the last follow-up, 10 (27.0%) patients failed in the AGV group compared with 6 (15.8%) patients in the BGI group (P=0.379). The BGI group had higher rate of flat or shallow anterior chamber (n=4, 10%) compared with the AGV group (n=0, 0%) (P=0.043). Failure rates of AGV and BGI in patients with IOP≥30 mm Hg were comparable. There were more early hypotony-related complications in the BGI group; however, none were vision threatening. Both glaucoma drainage implants were effective in treating patients with uncontrolled glaucoma in an emergency setting.

The vision guidance and image processing of AGV

NASA Astrophysics Data System (ADS)

Feng, Tongqing; Jiao, Bin

2017-08-01

Firstly, the principle of AGV vision guidance is introduced and the deviation and deflection angle are measured by image coordinate system. The visual guidance image processing platform is introduced. In view of the fact that the AGV guidance image contains more noise, the image has already been smoothed by a statistical sorting. By using AGV sampling way to obtain image guidance, because the image has the best and different threshold segmentation points. In view of this situation, the method of two-dimensional maximum entropy image segmentation is used to solve the problem. We extract the foreground image in the target band by calculating the contour area method and obtain the centre line with the least square fitting algorithm. With the help of image and physical coordinates, we can obtain the guidance information.

Wound Dehiscence and Device Migration after Subconjunctival Bevacizumab Injection with Ahmed Glaucoma Valve Implantation.

PubMed

Miraftabi, Arezoo; Nilforushan, Naveed

2016-01-01

To report a complication pertaining to subconjunctival bevacizumab injection as an adjunct to Ahmed Glaucoma Valve (AGV) implantation. A 54-year-old woman with history of complicated cataract surgery was referred for advanced intractable glaucoma. AGV implantation with adjunctive subconjunctival bevacizumab (1.25 mg) was performed with satisfactory results during the first postoperative week. However, 10 days after surgery, she developed wound dehiscence and tube exposure. The second case was a 33-year-old man with history of congenital glaucoma and uncontrolled IOP who developed AGV exposure and wound dehiscence after surgery. In both cases, for prevention of endophthalmitis and corneal damage by the unstable tube, the shunt was removed and the conjunctiva was re-sutured. The potential adverse effect of subconjunctival bevacizumab injection on wound healing should be considered in AGV surgery.

Wound Dehiscence and Device Migration after Subconjunctival Bevacizumab Injection with Ahmed Glaucoma Valve Implantation

PubMed Central

Miraftabi, Arezoo; Nilforushan, Naveed

2016-01-01

Purpose: To report a complication pertaining to subconjunctival bevacizumab injection as an adjunct to Ahmed Glaucoma Valve (AGV) implantation. Case Report: A 54-year-old woman with history of complicated cataract surgery was referred for advanced intractable glaucoma. AGV implantation with adjunctive subconjunctival bevacizumab (1.25 mg) was performed with satisfactory results during the first postoperative week. However, 10 days after surgery, she developed wound dehiscence and tube exposure. The second case was a 33-year-old man with history of congenital glaucoma and uncontrolled IOP who developed AGV exposure and wound dehiscence after surgery. In both cases, for prevention of endophthalmitis and corneal damage by the unstable tube, the shunt was removed and the conjunctiva was re-sutured. Conclusion: The potential adverse effect of subconjunctival bevacizumab injection on wound healing should be considered in AGV surgery. PMID:27195095

Comparison of the Ahmed glaucoma valve with the Baerveldt glaucoma implant: a meta-analysis.

PubMed

Wang, Yi-Wen; Wang, Ping-Bao; Zeng, Chao; Xia, Xiao-Bo

2015-10-13

This study aims to compare the efficacy and safety of the Ahmed glaucoma valve (AGV) with the Baerveldt glaucoma implant (BGI) in glaucoma patients. Databases were searched to identify studies that met pre-stated inclusion criteria, involving randomized controlled clinical trials (RCTs) and non-randomized controlled clinical trials. Treatment effect was analyzed using a random-effect model. Ten controlled clinical trials (1048 eyes) were analyzed, involving two RCTs and eight retrospective comparative studies. Short-term results (6-18 months) and long-term results (>18 months) were analyzed separately. There was no significant difference in the success rate for short-term follow-up between the AGV and BGI groups (5 studies, 714 eyes, odds ratio [OR]: 0.97; 95 % confidence interval [CI]: 0.56, 1.66; P = 0.90). For long-term pooled results (7 studies, 835 eyes), the success rate of AGVs was lower than that of BGIs (OR: 0.73; 95 % CI: 0.54, 0.99, P = 0.04), However, subgroup and sensitivity analyses did not show a significant difference in the success rate between the two groups (P ≥0.05). The AGV group had a higher mean intraocular pressure than the BGI group in short-term (6 studies, 685 eyes, weighted mean difference [WMD]: 2.12 mmHg; 95 % CI: 0.72-3.52; P <0.05) and long-term pooled results (7 studies, 659 eyes, WMD: 1.85 mmHg; 95 % CI: 0.43, 3.28; P = 0.01). The BGI group required fewer glaucoma medications after implantation than the AGV group in two follow-up periods (all P <0.05). The AGV was found to be associated with a significantly lower frequency of total complications (8 studies, 971 eyes, OR: 0.67; 95 % CI: 0.50-0.90; P = 0.007) and severe complications (8 studies, 971 eyes, OR: 0.57; 95 % CI: 0.36-0.91; P = 0.02) than the BGI. The study showed no significant difference in success rate between the two groups. The BGI was more effective for control of intraocular pressure and required fewer medications than the AGV, but the AGV had lower incidence of total and severe complications than the BGI.

Ahmed glaucoma valve in eyes with preexisting episcleral encircling element.

PubMed

Choudhari, Nikhil Shreeram; George, Ronnie; Shantha, Balekudaru; Neog, Aditya; Tripathi, Shweta; Srinivasan, Bhaskar; Vijaya, Lingam

2014-05-01

To describe the use of Ahmed glaucoma valve (AGV) in the management of intractable glaucoma in eyes with a preexisting episcleral encircling element. This is a retrospective, consecutive, noncomparative study. The study included 12 eyes of 12 patients with a preexisting episcleral encircling element that underwent implantation of silicone AGV to treat intractable glaucoma during January 2009 to September 2010. The mean patient age was 25.6 (standard deviation 17.1) years. Five (41.6%) patients were monocular. The indications for AGV were varied. The mean duration between placement of episcleral encircling element and implantation of AGV was 30.5 (33.8) months. The mean follow-up was 37.4 (22.9) weeks. Preoperatively, the mean intraocular pressure (IOP) was 31.4 (7.9) mmHg and the mean antiglaucoma medications were 2.8. At the final postoperative follow-up, the mean IOP was 12.5 (3.5) mmHg and the mean number of antiglaucoma medications was 0.8 (P < 0.001). The complications observed over the follow-up period did include corneal graft failure in three eyes, tube erosion in two eyes and rhegmatogenous retinal detachment in one eye. AGV is an effective option in the management of intractable glaucoma in eyes with a preexisting episcleral encircling element keeping in mind the possibility of significant postoperative complications.

Two-year survival of Ahmed valve implantation in the first 2 years of life with and without intraoperative mitomycin-C.

PubMed

Al-Mobarak, Faisal; Khan, Arif O

2009-10-01

To evaluate the effect of intraoperative mitomycin-C (MMC) on polypropylene Ahmed glaucoma valve (AGV) survival 2 years after implantation during the first 2 years of life. Retrospective institutional comparative series (1995-2005). Thirty-one eyes of 27 patients (23 unilateral, 4 bilateral; 16 boys, 11 girls) undergoing AGV implantation at a mean age of 11.1 months (standard deviation [SD], 5.46), all of which had 2 years of regular postoperative follow-up. MMC was applied intraoperatively in those cases in the area of AGV implantation in 16 (52%) and was not applied in 15 (48%). In some eyes, MMC was applied intraoperatively in cases done by the surgeons who routinely used MMC for all AGV implantation in young children. Failure was defined as intraocular pressure (IOP) > 22 mmHg with or without glaucoma medications, the need for an additional procedure for IOP control, or the occurrence of significant complications (e.g., endophthalmitis, retinal detachment, persistent hypotony [IOP < 5 mmHg]). Survival was the absence of failure. Failure or significant complications as defined. Mean survival for the non-MMC eyes (22.15 months; standard error [SE], 1.93) was significantly longer than survival for the MMC eyes (16.25 months; SE, 2.17) by the log-rank test (P = 0.025). The difference in cumulative survival at 2 years was also significantly different by log-rank test (P = 0.001): 80.0% (SE 10.3) and 31.3% (SE 11.6), respectively. Rather than improved survival, intraoperative use of MMC was associated with shorter survival 2 years after AGV implantation during the first 2 years of life. We speculate that MMC-induced tissue death can stimulate a reactive fibrosis around the AGV in very young eyes.

Pericardium Plug in the Repair of the Corneoscleral Fistula After Ahmed Glaucoma Valve Explantation

PubMed Central

Yoo, Chungkwon; Kwon, Sung Wook

2008-01-01

We report four cases in which a pericardium (Tutoplast®) plug was used to repair a corneoscleral fistula after Ahmed Glaucoma Valve (AGV) explantation. In four cases in which the AGV tube had been exposed, AGV explantation was performed using a pericardium (Tutoplast®) plug to seal the defect previously occupied by the tube. After debridement of the fistula, a piece of processed pericardium (Tutoplast®), measured 1 mm in width, was plugged into the fistula and secured with two interrupted 10-0 nylon sutures. To control intraocular pressure, a new AGV was implanted elsewhere in case 1, phaco-trabeculectomy was performed concurrently in case 2, cyclophotocoagulation was performed postoperatively in case 3 and anti-glaucomatous medication was added in case 4. No complication related to the fistula developed at the latest follow-up (range: 12~26 months). The pericardium (Tutoplast®) plug seems to be an effective method in the repair of corneoscleral fistulas resulting from explantation of glaucoma drainage implants. PMID:19096247

Changes in corneal endothelial cell density and the cumulative risk of corneal decompensation after Ahmed glaucoma valve implantation.

PubMed

Kim, Kyoung Nam; Lee, Sung Bok; Lee, Yeon Hee; Lee, Jong Joo; Lim, Hyung Bin; Kim, Chang-Sik

2016-07-01

To evaluate changes in the corneal endothelial cell density (ECD) and corneal decompensation following Ahmed glaucoma valve (AGV) implantation. This study was retrospective and observational case series. Patients with refractory glaucoma who underwent AGV implantation and were followed >5 years were consecutively enrolled. We reviewed the medical records, including the results of central corneal specular microscopy. Of the 127 enrolled patients, the annual change in ECD (%) was determined using linear regression for 72 eyes evaluated at least four times using serial specular microscopic examination and compared with 31 control eyes (fellow glaucomatous eyes under medical treatment). The main outcome measures were cumulative risk of corneal decompensation and differences in the ECD loss rates between subjects and controls. The mean follow-up after AGV implantation was 43.1 months. There were no cases of postoperative tube-corneal touch. The cumulative risk of corneal decompensation was 3.3%, 5 years after AGV implantation. There was a more rapid loss of ECD in the 72 subject eyes compared with the 31 controls (-7.0% and -0.1%/year, respectively; p<0.001). However, the rate of loss decreased over time and statistical significance compared with control eyes disappeared after 2 years postoperatively: -10.7% from baseline to 1 year (p<0.01), -7.0% from 1 year to 2 years (p=0.037), -4.2% from 2 years to 3 years (p=0.230) and -2.7% from 3 years to the final follow-up (p=0.111). In case of uncomplicated AGV implantation, the cumulative risk of corneal decompensation was 3.3%, 5 years after the operation. The ECD loss was statistically greater in eyes with AGV than in control eyes without AGV, but the difference was significant only up to 2 years post surgery. Published by the BMJ Publishing Group Limited. For permission to use (where not already granted under a licence) please go to http://www.bmj.com/company/products-services/rights-and-licensing/.

Modeling and deadlock avoidance of automated manufacturing systems with multiple automated guided vehicles.

PubMed

Wu, Naiqi; Zhou, MengChu

2005-12-01

An automated manufacturing system (AMS) contains a number of versatile machines (or workstations), buffers, an automated material handling system (MHS), and is computer-controlled. An effective and flexible alternative for implementing MHS is to use automated guided vehicle (AGV) system. The deadlock issue in AMS is very important in its operation and has extensively been studied. The deadlock problems were separately treated for parts in production and transportation and many techniques were developed for each problem. However, such treatment does not take the advantage of the flexibility offered by multiple AGVs. In general, it is intractable to obtain maximally permissive control policy for either problem. Instead, this paper investigates these two problems in an integrated way. First we model an AGV system and part processing processes by resource-oriented Petri nets, respectively. Then the two models are integrated by using macro transitions. Based on the combined model, a novel control policy for deadlock avoidance is proposed. It is shown to be maximally permissive with computational complexity of O (n2) where n is the number of machines in AMS if the complexity for controlling the part transportation by AGVs is not considered. Thus, the complexity of deadlock avoidance for the whole system is bounded by the complexity in controlling the AGV system. An illustrative example shows its application and power.

Ahmed glaucoma valve in eyes with preexisting episcleral encircling element

PubMed Central

Choudhari, Nikhil Shreeram; George, Ronnie; Shantha, Balekudaru; Neog, Aditya; Tripathi, Shweta; Srinivasan, Bhaskar; Vijaya, Lingam

2014-01-01

Background: To describe the use of Ahmed glaucoma valve (AGV) in the management of intractable glaucoma in eyes with a preexisting episcleral encircling element. Materials and Methods: This is a retrospective, consecutive, noncomparative study. The study included 12 eyes of 12 patients with a preexisting episcleral encircling element that underwent implantation of silicone AGV to treat intractable glaucoma during January 2009 to September 2010. Results: The mean patient age was 25.6 (standard deviation 17.1) years. Five (41.6%) patients were monocular. The indications for AGV were varied. The mean duration between placement of episcleral encircling element and implantation of AGV was 30.5 (33.8) months. The mean follow-up was 37.4 (22.9) weeks. Preoperatively, the mean intraocular pressure (IOP) was 31.4 (7.9) mmHg and the mean antiglaucoma medications were 2.8. At the final postoperative follow-up, the mean IOP was 12.5 (3.5) mmHg and the mean number of antiglaucoma medications was 0.8 (P < 0.001). The complications observed over the follow-up period did include corneal graft failure in three eyes, tube erosion in two eyes and rhegmatogenous retinal detachment in one eye. Conclusion: AGV is an effective option in the management of intractable glaucoma in eyes with a preexisting episcleral encircling element keeping in mind the possibility of significant postoperative complications. PMID:24881603

Intracameral air injection during Ahmed glaucoma valve implantation in neovascular glaucoma for the prevention of tube obstruction with blood clot: Case Report.

PubMed

Hwang, Sung Ha; Yoo, Chungkwon; Kim, Yong Yeon; Lee, Dae Young; Nam, Dong Heun; Lee, Jong Yeon

2017-12-01

Glaucoma drainage implant surgery is a treatment option for the management of neovascular glaucoma. However, tube obstruction by blood clot after Ahmed glaucoma valve (AGV) implantation is an unpredictable clinically challenging situation. We report 4 cases using intracameral air injection for the prevention of the tube obstruction of AGV by blood clot. The first case was a 57-year-old female suffering from ocular pain because of a tube obstruction with blood clot after AGV implantation in neovascular glaucoma. Surgical blood clot removal was performed. However, intractable bleeding was noted during the removal of the blood clot, and so intracameral air injection was performed to prevent a recurrent tube obstruction. After the procedure, although blood clots formed around the tube, the tube opening where air could touch remained patent. In 3 cases of neovascular glaucoma with preoperative severe intraocular hemorrhages, intracameral air injection and AGV implantation were performed simultaneously. In all 3 cases, tube openings were patent. It appears that air impeded the blood clots formation in front of the tube opening. Intracameral air injection could be a feasible option to prevent tube obstruction of AGV implant with a blood clot in neovascular glaucoma with high risk of tube obstruction. Copyright © 2017 The Authors. Published by Wolters Kluwer Health, Inc. All rights reserved.

Outcomes and Complications of Ahmed Tube Implantation in Asian Eyes.

PubMed

Choo, Jessica Qian Hui; Chen, Ziyou David; Koh, Victor; Liang, Shen; Aquino, Cecilia Maria; Sng, Chelvin; Chew, Paul

2018-06-18

There is a lack of long-term Asian studies on the efficacy and safety of Ahmed glaucoma valve (AGV) implantation. This study seeks to determine the outcomes and complications of AGV implantation in Asians. Retrospective review of AGV surgeries performed at a single centre in Singapore was conducted. 76 patients with primary and secondary glaucoma who underwent their first AGV surgery from 1st January 2010 to 31st December 2012 were considered for our study. Primary outcomes evaluated were: failure, intra-ocular pressure, best-corrected visual acuity (BCVA), number of IOP-lowering medications and complications. Failure was defined by: IOP >21▒mm Hg on two consecutive visits after 3 months, IOP ≤5▒mm Hg on two consecutive visits after 3 months, reoperation for glaucoma, removal of implant or loss of light perception vision. Mean follow-up duration was 33.2±6.9 months. There was significant reduction in IOP (mean reduction 25.9%, P<0.001) and number of IOP-lowering medications (mean reduction 77.8%, P<0.001) at 3 years. Absolute failure rate was 23.9% at 3 years with no difference between eyes with or without previous trabeculectomy and between eyes with primary or secondary glaucoma. Occurrence of post-operative hyphema was a significant risk factor for failure. Commonest post-operative complications were hyphema and tube exposure. At 3 years after AGV surgery in Asian eyes, less than one-quarter of the eyes fulfilled the criteria for surgical failure.

Short- to long-term results of Ahmed glaucoma valve in the management of elevated intraocular pressure in patients with pediatric uveitis.

PubMed

Eksioglu, Umit; Yakin, Mehmet; Sungur, Gulten; Satana, Banu; Demirok, Gulizar; Balta, Ozgur; Ornek, Firdevs

2017-06-01

The aim of this study was to evaluate the long-term outcome of Ahmed glaucoma valve (AGV) implant for elevated intraocular pressure (IOP) in pediatric patients with uveitis. This was a retrospective chart review. The study included 16 eyes (11 children) with uveitis. Success was defined as having IOP between 6 and 21 mm Hg with (qualified success) or without (complete success) antiglaucoma medications and without the need for further glaucoma or tube extraction surgery. Mean age of patients at the time of AGV implantation was 14.19 ± 3.25 years. AGV implantation was the first glaucoma surgical procedure in 12 eyes (75%). Average postoperative follow-up period was 64.46 ± 33.56 months. Mean preoperative IOP was 33.50 ± 7.30 mm Hg versus 12.69 ± 3.20 mm Hg at the last follow-up visit (p < 0.001). Three eyes (18.7%) were determined as cases of "failure" because of tube removal in 2 eyes and a second AGV implantation in 1 eye. The cumulative probability of complete success was 68.8% at 6 months, 56.3% at 12 months, 49.2% at 36 months, 42.2% at 48 months, and 35.2% at 84 months, and the cumulative probability of eyes without complication was 75.0% at 6 months, 66.7% at 24 months, 58.3% at 36 months, 48.6% at 48 months and 24.3% at 108 months based on Kaplan-Meier survival analysis. Although AGV implant is an effective choice in the management of elevated IOP in pediatric uveitis, antiglaucoma medications are frequently needed for control of IOP. Tube exposure is an important complication in the long term. Differential diagnosis between relapse of uveitis and endophthalmitis is important in patients who received AGV implantation. Copyright © 2017 Canadian Ophthalmological Society. Published by Elsevier Inc. All rights reserved.

Evaluation of success after second Ahmed glaucoma valve implantation.

PubMed

Nilforushan, Naveed; Yadgari, Maryam; Jazayeri, Anis Alsadat; Karimi, Nasser

2016-03-01

To evaluate the outcome of the second Ahmed glaucoma valve (AGV) surgery in eyes with failed previous AGV surgery. Retrospective case series. Following chart review, 36 eyes of 34 patients with second AGV implantation were enrolled in this study. The primary outcome measure was surgical success defined in terms of intraocular pressure (IOP) control using two criteria: Success was defined as IOP ≤21 mmHg (criterion 1) and IOP ≤16 mmHg (criterion 2), with at least 20% reduction in IOP, either with no medication (complete success) or with no more than two medications (qualified success). Kaplan-Meier survival analysis was used to determine the probability of surgical success. The average age of the patients was 32.7 years (range 4-65), and the mean duration of follow-up was 21.4 months (range 6-96). Preoperatively, the mean IOP was 26.94 mmHg (standard deviation [SD] 7.03), and the patients were using 2.8 glaucoma medications on average (SD 0.9). The mean IOP decreased significantly to 13.28 mmHg (SD 3.59) at the last postoperative visit (P = 0.00) while the patients needed even fewer glaucoma medications on average (1.4 ± 1.1, P = 0.00). Surgical success of second glaucoma drainage devices (Kaplan-Meier analysis), according to criterion 1, at 6, 12, 18, and 42 months was 94%, 85%, 80%, and 53% respectively, and according to criterion 2, was 94%, 85%, 75%, and 45%, respectively. Repeated AGV implantation seems to be a safe modality of treatment with acceptable success rate in cases with failed previous AGV surgery.

Ahmed glaucoma valve in post-penetrating-keratoplasty glaucoma: A critically evaluated prospective clinical study

PubMed Central

Panda, Anita; Prakash, Vadivelu Jaya; Dada, Tanuj; Gupta, Anoop Kishore; Khokhar, Sudarshan; Vanathi, Murugesan

2011-01-01

Aim: The aim was to evaluate the outcome of Ahmed glaucoma valve (AGV) in post-penetrating-keratoplasty glaucoma (PKPG). Materials and Methods: In this prospective study, 20 eyes of 20 adult patients with post-PKPG with intraocular pressure (IOP) >21 mmHg, on two or more antiglaucoma medications, underwent AG (model FP7) implantation and were followed up for a minimum of 6 months. Absolute success was defined as 5

Delicate Ag/V2O5/TiO2 ternary nanostructures as a high-performance photocatalyst

NASA Astrophysics Data System (ADS)

Zhu, Xiao-Dong; Zheng, Ya-Lun; Feng, Yu-Jie; Sun, Ke-Ning

2018-02-01

Here we report, for the first time, delicate ternary nanostructures consisting of TiO2 nanoplatelets co-doped with Ag and V2O5 nanoparticles. The relationship between the composition and the morphology is systematically studied. We find a remarkable synergistic effect among the three components, and the resulting delicate Ag/V2O5/TiO2 ternary nanostructures exhibit a superior photocatalytic performance over neat TiO2 nanoplatelets as well as Ag/TiO2 and V2O5/TiO2 binary nanostructures for the degradation of methyl orange. We believe our delicate Ag/V2O5/TiO2 ternary nanostructures may lay a basis for developing next-generating, high-performance composite photocatalysts.

Evaluation of success after second Ahmed glaucoma valve implantation

PubMed Central

Nilforushan, Naveed; Yadgari, Maryam; Jazayeri, Anis Alsadat; Karimi, Nasser

2016-01-01

Purpose: To evaluate the outcome of the second Ahmed glaucoma valve (AGV) surgery in eyes with failed previous AGV surgery. Design: Retrospective case series. Patients and Methods: Following chart review, 36 eyes of 34 patients with second AGV implantation were enrolled in this study. The primary outcome measure was surgical success defined in terms of intraocular pressure (IOP) control using two criteria: Success was defined as IOP ≤21 mmHg (criterion 1) and IOP ≤16 mmHg (criterion 2), with at least 20% reduction in IOP, either with no medication (complete success) or with no more than two medications (qualified success). Kaplan–Meier survival analysis was used to determine the probability of surgical success. Results: The average age of the patients was 32.7 years (range 4–65), and the mean duration of follow-up was 21.4 months (range 6–96). Preoperatively, the mean IOP was 26.94 mmHg (standard deviation [SD] 7.03), and the patients were using 2.8 glaucoma medications on average (SD 0.9). The mean IOP decreased significantly to 13.28 mmHg (SD 3.59) at the last postoperative visit (P = 0.00) while the patients needed even fewer glaucoma medications on average (1.4 ± 1.1, P = 0.00). Surgical success of second glaucoma drainage devices (Kaplan–Meier analysis), according to criterion 1, at 6, 12, 18, and 42 months was 94%, 85%, 80%, and 53% respectively, and according to criterion 2, was 94%, 85%, 75%, and 45%, respectively. Conclusion: Repeated AGV implantation seems to be a safe modality of treatment with acceptable success rate in cases with failed previous AGV surgery. PMID:27146930

Comparison of the Outcome of Silicone Ahmed Glaucoma Valve Implantation with a Surface Area between 96 and 184 mm2 in Adult Eyes

PubMed Central

Koh, Kyung Min; Hwang, Young Hoon; Jung, Jong Jin; Sohn, Yong Ho

2013-01-01

Purpose To compare the success rates, complications, and visual outcomes between silicone Ahmed glaucoma valve (AGV) implantation with 96 mm2 (FP8) or 184 mm2 (FP7) surface areas. Methods This study is a retrospective review of the records from 132 adult patients (134 eyes) that underwent silicone AGV implant surgery. Among them, the outcomes of 24 eyes from 24 patients with refractory glaucoma who underwent FP8 AGV implantation were compared with 76 eyes from 76 patients who underwent FP7 AGV implantation. Preoperative and postoperative data, including intraocular pressure (IOP), visual acuity, number of medications, and complications were compared between the 2 groups. Results There were no significant differences in baseline characteristics between the 2 groups (p > 0.05). The postoperative visual acuity of the patients in the FP8 group was better than that of the patients in the FP7 group in some early postoperative periods (p < 0.05); however, after 10 postoperative months, visual acuity was not significantly different through the 3-year follow-up period (p > 0.05). Postoperative IOP was not significantly different between the 2 groups (p > 0.05) except for IOP on postoperative day 1 (11.42 mmHg for the FP7 group and 7.42 mmHg for the FP8 group; p = 0.031). There was no statistical difference in success rates, final IOP, number of medications, or complication rates between the 2 groups (p > 0.05). Conclusions The FP7 and FP8 AGV implants showed no difference in terms of vision preservation, IOP reduction, and number of glaucoma medications required. PMID:24082774

Adjunctive triamcinolone acetonide for Ahmed glaucoma valve implantation: a randomized clinical trial.

PubMed

Yazdani, Shahin; Doozandeh, Azadeh; Pakravan, Mohammad; Ownagh, Vahid; Yaseri, Mehdi

2017-06-26

To evaluate the effect of intraoperative sub-Tenon injection of triamcinolone acetonide (TA) as an adjunct to Ahmed glaucoma valve (AGV) implantation. In this triple-blind randomized clinical trial, 104 eyes with refractory glaucoma were randomly assigned to conventional AGV (non-TA group) or AGV with adjunctive triamcinolone (TA group). In the TA group, 10 mg TA was injected in the sub-Tenon space around the AGV plate intraoperatively. Patients were followed for 1 year. The main outcome measure was intraocular pressure (IOP). Other outcome measures included best-corrected visual acuity (BCVA), occurrence of hypertensive phase (HP), peak IOP, number of antiglaucoma medications, and complications. A total of 90 patients were included in the final analysis. Mean IOP was lower in the TA group at most follow-up visits; however, the difference was statistically significant only at the first month (p = 0.004). Linear mixed model showed that mean IOP was 1.5 mm Hg lower in the TA group throughout the study period (p = 0.006). Peak postoperative IOP was significantly lower in the TA group (19.3 ± 4.8 mm Hg versus 29 ± 9.2 mm Hg, p = 0.032). Rates of success (defined as 6 < IOP <21 mm Hg) were similar in both groups at 12 months. There was no difference in the occurrence of the HP between the 2 groups (p = 0.123). Loss of BCVA >2 lines was more common in the non-TA group (p = 0.032). Adjunctive intraoperative TA injection during AGV implantation can blunt peak IOP levels and reduce mean IOP up to 1 year. Visual outcomes also seem to be superior to standard surgery.

Adjunctive Mitomycin C or Amniotic Membrane Transplantation for Ahmed Glaucoma Valve Implantation: A Randomized Clinical Trial.

PubMed

Yazdani, Shahin; Mahboobipour, Hassan; Pakravan, Mohammad; Doozandeh, Azadeh; Ghahari, Elham

2016-05-01

To determine whether adjunctive mitomycin C (MMC) or amniotic membrane transplantation (AMT) improve the outcomes of Ahmed glaucoma valve (AGV) implantation. This double-blind, stratified, 3-armed randomized clinical trial includes 75 eyes of 75 patients aged 7 to 75 years with refractory glaucoma. Eligible subjects underwent stratified block randomization; eyes were first stratified to surgery in the superior or inferior quadrants based on feasibility; in each subgroup, eyes were randomly assigned to the study arms using random blocks: conventional AGV implantation (group A, 25 eyes), AGV with MMC (group B, 25 eyes), and AGV with AMT (group C, 25 eyes). The 3 study groups were comparable regarding baseline characteristics and mean follow-up (P=0.288). A total of 68 patients including 23 eyes in group A, 25 eyes in group B, and 20 eyes group C completed the follow-up period and were analyzed. Intraocular pressure was lower in the MMC group only 3 weeks postoperatively (P=0.04) but comparable at other time intervals. Overall success rate was comparable in the 3 groups at 12 months (P=0.217). The number of eyes requiring medications (P=0.30), time to initiation of medications (P=0.13), and number of medications (P=0.22) were comparable. Hypertensive phase was slightly but insignificantly more common with standard surgery (82%) as compared with MMC-augmented (60%) and AMT-augmented (70%) procedures (P=0.23). Complications were comparable over 1 year (P=0.28). Although adjunctive MMC and AMT were safe during AGV implantation, they did not influence success rates or intraocular pressure outcomes. Complications, including hypertensive phase, were also comparable.

Admission glycemic variability correlates with in-hospital outcomes in diabetic patients with non-ST segment elevation acute coronary syndrome undergoing percutaneous coronary intervention

PubMed Central

Su, Gong; Zhang, Tao; Yang, Hongxia; Dai, Wenlong; Tian, Lei; Tao, Hong; Wang, Tao; Mi, Shuhua

2018-01-01

Objective The aim of this study is to evaluate the effects of admission glycemic variability (AGV) on in-hospital outcomes in diabetic patients with non-ST segment elevation acute coronary syndrome (NSTE-ACS) undergoing percutaneous coronary intervention (PCI). Methods We studied 759 diabetic patients with NSTE-ACS undergoing PCI. AGV was accessed based on the mean amplitude of glycemic excursions (MAGEs) in the first 24 hours after admission. Primary outcome was a composite of in-hospital events, all-cause mortality, new-onset myocardial infarction, acute heart failure, and stroke. Secondary outcomes were each of these considered separately. Predictive effects of AGV on the in-hospital outcomes in patients were analyzed. Results Patients with high MAGE levels had significantly higher incidence of total outcomes (9.9% vs. 4.8%, p=0.009) and all-cause mortality (2.3% vs. 0.4%, p=0.023) than those with low MAGE levels during hospitalization. Multivariable analysis revealed that AGV was significantly associated with incidence of in-hospital outcomes (Odds ratio=2.024, 95% CI 1.105-3.704, p=0.022) but hemoglobin A1c (HbA1c) was not. In the receiver-operating characteristic curve analysis for MAGE and HbA1c in predicting in-hospital outcomes, the area under the curve for MAGE (0.608, p=0.012) was superior to that for HbA1c (0.556, p=0.193). Conclusion High AGV levels may be closely correlated with increased in-hospital poor outcomes in diabetic patients with NSTE-ACS following PCI. PMID:29848920

Intelligence Level Performance Standards Research for Autonomous Vehicles

PubMed Central

Bostelman, Roger B.; Hong, Tsai H.; Messina, Elena

2017-01-01

United States and European safety standards have evolved to protect workers near Automatic Guided Vehicles (AGV’s). However, performance standards for AGV’s and mobile robots have only recently begun development. Lessons can be learned from research and standards efforts for mobile robots applied to emergency response and military applications. Research challenges, tests and evaluations, and programs to develop higher intelligence levels for vehicles can also used to guide industrial AGV developments towards more adaptable and intelligent systems. These other efforts also provide useful standards development criteria for AGV performance test methods. Current standards areas being considered for AGVs are for docking, navigation, obstacle avoidance, and the ground truth systems that measure performance. This paper provides a look to the future with standards developments in both the performance of vehicles and the dynamic perception systems that measure intelligent vehicle performance. PMID:28649189

Initial Clinical Experience with Ahmed Valve Implantation in Refractory Pediatric Glaucoma

PubMed

Novak-Lauš, Katia; Škunca Herman, Jelena; Šimić Prskalo, Marija; Jurišić, Darija; Mandić, Zdravko

2016-12-01

The purpose is to report on the safety and efficacy of Ahmed Glaucoma Valve (AGV, New World Medical, Inc., Rancho Cucamonga, CA, USA) implantation for the management of refractory pediatric glaucoma observed during one-year follow up period. A retrospective chart review was conducted on 10 eyes, all younger than 11 years, with pediatric glaucoma that underwent AGV implantation for medicamentously uncontrolled intraocular pressure (IOP) between 2010 and 2014. Outcome measures were control of IOP below 23 mm Hg (with or without antiglaucoma medications) and changes in visual acuity. Complications were recorded. After AGV implantation, IOP values ranged from 18 mm Hg to 23 mm Hg (except for one eye with postoperative hypotonia due to suprachoroid hemorrhage, where the postoperative IOP value was 4 mm Hg). The number of antiglaucoma medications was reduced, i.e. four patients had two medications, one patient had one medication, and the others did not need antiglaucoma medication on the last follow-up visit. One eye had suprachoroid hemorrhage, one eye had long-term persistent uveitic membrane, and two eyes had tube-cornea touch. In conclusion, AGV implantation appears to be a viable option for the management of refractory pediatric glaucoma and shows success in IOP control. However, there was a relatively high complication rate limiting the overall success rate.

Investigation of Matlab® as platform in navigation and control of an Automatic Guided Vehicle utilising an omnivision sensor.

PubMed

Kotze, Ben; Jordaan, Gerrit

2014-08-25

Automatic Guided Vehicles (AGVs) are navigated utilising multiple types of sensors for detecting the environment. In this investigation such sensors are replaced and/or minimized by the use of a single omnidirectional camera picture stream. An area of interest is extracted, and by using image processing the vehicle is navigated on a set path. Reconfigurability is added to the route layout by signs incorporated in the navigation process. The result is the possible manipulation of a number of AGVs, each on its own designated colour-signed path. This route is reconfigurable by the operator with no programming alteration or intervention. A low resolution camera and a Matlab® software development platform are utilised. The use of Matlab® lends itself to speedy evaluation and implementation of image processing options on the AGV, but its functioning in such an environment needs to be assessed.

Local navigation and fuzzy control realization for autonomous guided vehicle

NASA Astrophysics Data System (ADS)

El-Konyaly, El-Sayed H.; Saraya, Sabry F.; Shehata, Raef S.

1996-10-01

This paper addresses the problem of local navigation for an autonomous guided vehicle (AGV) in a structured environment that contains static and dynamic obstacles. Information about the environment is obtained via a CCD camera. The problem is formulated as a dynamic feedback control problem in which speed and steering decisions are made on the fly while the AGV is moving. A decision element (DE) that uses local information is proposed. The DE guides the vehicle in the environment by producing appropriate navigation decisions. Dynamic models of a three-wheeled vehicle for driving and steering mechanisms are derived. The interaction between them is performed via the local feedback DE. A controller, based on fuzzy logic, is designed to drive the vehicle safely in an intelligent and human-like manner. The effectiveness of the navigation and control strategies in driving the AGV is illustrated and evaluated.

Investigation of Matlab® as Platform in Navigation and Control of an Automatic Guided Vehicle Utilising an Omnivision Sensor

PubMed Central

Kotze, Ben; Jordaan, Gerrit

2014-01-01

Automatic Guided Vehicles (AGVs) are navigated utilising multiple types of sensors for detecting the environment. In this investigation such sensors are replaced and/or minimized by the use of a single omnidirectional camera picture stream. An area of interest is extracted, and by using image processing the vehicle is navigated on a set path. Reconfigurability is added to the route layout by signs incorporated in the navigation process. The result is the possible manipulation of a number of AGVs, each on its own designated colour-signed path. This route is reconfigurable by the operator with no programming alteration or intervention. A low resolution camera and a Matlab® software development platform are utilised. The use of Matlab® lends itself to speedy evaluation and implementation of image processing options on the AGV, but its functioning in such an environment needs to be assessed. PMID:25157548

Polypropylene vs silicone Ahmed valve with adjunctive mitomycin C in paediatric age group: a prospective controlled study

PubMed Central

El Sayed, Y; Awadein, A

2013-01-01

Purpose To compare the results of silicone and polypropylene Ahmed glaucoma valves (AGV) implanted during the first 10 years of life. Methods A prospective study was performed on 50 eyes of 33 patients with paediatric glaucoma. Eyes were matched to either polypropylene or silicone AGV. In eyes with bilateral glaucoma, one eye was implanted with polypropylene and the other eye was implanted with silicone AGV. Results Fifty eyes of 33 children were reviewed. Twenty five eyes received a polypropylene valve, and 25 eyes received a silicone valve. Eyes implanted with silicone valves achieved a significantly lower intraocular pressure (IOP) compared with the polypropylene group at 6 months, 1 year, and 2 years postoperatively. The average survival time was significantly longer (P=0.001 by the log-rank test) for the silicone group than for the polypropylene group and the cumulative probability of survival by the log-rank test at the end of the second year was 80% (SE: 8.0, 95% confidence interval (CI): 64–96%) in the silicone group and 56% (SE: 9.8, 95% CI: 40–90%) in the polypropylene group. The difference in the number of postoperative interventions and complications between both groups was statistically insignificant. Conclusion Silicone AGVs can achieve better IOP control, and longer survival with less antiglaucoma drops compared with polypropylene valves in children younger than 10 years. PMID:23579403

Hypertensive phase and early complications after Ahmed glaucoma valve implantation with intraoperative subtenon triamcinolone acetonide.

PubMed

Turalba, Angela V; Pasquale, Louis R

2014-01-01

To evaluate intraoperative subtenon triamcinolone acetonide (TA) as an adjunct to Ahmed glaucoma valve (AGV) implantation. Retrospective comparative case series. Forty-two consecutive cases of uncontrolled glaucoma undergoing AGV implantation: 19 eyes receiving intraoperative subtenon TA and 23 eyes that did not receive TA. A retrospective chart review was performed on consecutive pseudophakic adult patients with uncontrolled glaucoma undergoing AGV with and without intraoperative subtenon TA injection by a single surgeon. Clinical data were collected from 42 eyes and analyzed for the first 6 months after surgery. Primary outcomes included intraocular pressure (IOP) and number of glaucoma medications prior to and after AGV implantation. The hypertensive phase (HP) was defined as an IOP measurement of greater than 21 mmHg (with or without medications) during the 6-month postoperative period that was not a result of tube obstruction, retraction, or malfunction. Postoperative complications and visual acuity were analyzed as secondary outcome measures. Five out of 19 (26%) TA cases and 12 out of 23 (52%) non-TA cases developed the HP (P=0.027). Mean IOP (14.2±4.6 in TA cases versus [vs] 14.7±5.0 mmHg in non-TA cases; P=0.78), and number of glaucoma medications needed (1.8±1.3 in TA cases vs 1.6±1.1 in the comparison group; P=0.65) were similar between both groups at 6 months. Although rates of serious complications did not differ between the groups (13% in the TA group vs 16% in the non-TA group), early tube erosion (n=1) and bacterial endophthalmitis (n=1) were noted with TA but not in the non-TA group. Subtenon TA injection during AGV implantation may decrease the occurrence of the HP but does not alter the ultimate IOP outcome and may pose increased risk of serious complications within the first 6 months of surgery.

Hypertensive phase and early complications after Ahmed glaucoma valve implantation with intraoperative subtenon triamcinolone acetonide

PubMed Central

Turalba, Angela V; Pasquale, Louis R

2014-01-01

Objective To evaluate intraoperative subtenon triamcinolone acetonide (TA) as an adjunct to Ahmed glaucoma valve (AGV) implantation. Design Retrospective comparative case series. Participants Forty-two consecutive cases of uncontrolled glaucoma undergoing AGV implantation: 19 eyes receiving intraoperative subtenon TA and 23 eyes that did not receive TA. Methods A retrospective chart review was performed on consecutive pseudophakic adult patients with uncontrolled glaucoma undergoing AGV with and without intraoperative subtenon TA injection by a single surgeon. Clinical data were collected from 42 eyes and analyzed for the first 6 months after surgery. Main outcome measures Primary outcomes included intraocular pressure (IOP) and number of glaucoma medications prior to and after AGV implantation. The hypertensive phase (HP) was defined as an IOP measurement of greater than 21 mmHg (with or without medications) during the 6-month postoperative period that was not a result of tube obstruction, retraction, or malfunction. Postoperative complications and visual acuity were analyzed as secondary outcome measures. Results Five out of 19 (26%) TA cases and 12 out of 23 (52%) non-TA cases developed the HP (P=0.027). Mean IOP (14.2±4.6 in TA cases versus [vs] 14.7±5.0 mmHg in non-TA cases; P=0.78), and number of glaucoma medications needed (1.8±1.3 in TA cases vs 1.6±1.1 in the comparison group; P=0.65) were similar between both groups at 6 months. Although rates of serious complications did not differ between the groups (13% in the TA group vs 16% in the non-TA group), early tube erosion (n=1) and bacterial endophthalmitis (n=1) were noted with TA but not in the non-TA group. Conclusions Subtenon TA injection during AGV implantation may decrease the occurrence of the HP but does not alter the ultimate IOP outcome and may pose increased risk of serious complications within the first 6 months of surgery. PMID:25050061

Long-term results of Ahmed glaucoma valve implantation in Egyptian population

PubMed Central

Elhefney, Eman; Mokbel, Tharwat; Abou Samra, Waleed; Kishk, Hanem; Mohsen, Tarek; El-Kannishy, Amr

2018-01-01

AIM To evaluate the long-term results and complications of Ahmed glaucoma valve (AGV) implantation in a cohort of Egyptian patients. METHODS A retrospective study of 124 eyes of 99 patients with refractory glaucoma who underwent AGV implantation and had a minimum follow-up of 5y was performed. All patients underwent complete ophthalmic examination and intraocular pressure (IOP) measurement before surgery and at 1d, weekly for the 1st month, 3, 6mo, and 1y after surgery and yearly afterward for 5y. IOP was measured by Goldmann applanation tonometry and/or Tono-Pen. Complications and the number of anti-glaucoma medications needed were recorded. Success was defined as IOP less than 21 mm Hg with or without anti-glaucoma medication and without additional glaucoma surgery. RESULTS Mean age was 23.1±19.9y. All eyes had at least one prior glaucoma surgery. IOP was reduced from a mean of 37.2±6.8 to 19.2±5.2 mm Hg after 5y follow-up with a reduced number of medications from 2.64±0.59 to 1.81±0.4. Complete and qualified success rates were 31.5% and 46.0% respectively at the end of follow-up. The most common complications were encapsulated cyst formation in 51 eyes (41.1%), complicated cataract in 9 eyes (7.25%), recessed tube in 8 eyes (6.45%), tube exposure in 6 eyes (4.8%) and corneal touch in 6 eyes (4.8%). Other complications included extruded AGV, endophthalmitis and persistent hypotony. Each of them was recorded in only 2 eyes (1.6%). CONCLUSION Although refractory glaucoma is a difficult problem to manage, AGV is effective and relatively safe procedure in treating refractory glaucoma in Egyptian patients with long-term follow-up. Encapsulated cyst formation was the most common complication, which limits successful IOP control after AGV implantation. However, effective complications management can improve the rate of success. PMID:29600175

The Ahmed shunt versus the Baerveldt shunt for refractory glaucoma: a meta-analysis.

PubMed

Wang, Shiming; Gao, Xiaoming; Qian, Nana

2016-06-08

The purpose of this study was to compare the efficacy and tolerability of the Ahmed glaucoma valve (AGV) implant and the Baerveldt implant for the treatment of refractory glaucoma. We comprehensively searched four databases, including PubMed, EMBASE, Web of Science, and the Cochrane Library databases, selecting the relevant studies. The continuous variables, namely, intraocular pressure reduction (IOPR) and a reduction in glaucoma medication, were pooled by the weighted mean differences (WMDs), and the dichotomous outcomes, including success rates and tolerability estimates, were pooled by the odds ratio (ORs). A total of 929 patients from six studies were included. The WMDs of the IOPR between the AGV implant and the Baerveldt implant were 1.58 [95 % confidence interval (CI): -2.99 to 6.15] at 6 months, -1.01 (95 % CI: -3.40 to 1.98) at 12 months, -0.54 (95 % CI: -4.89 to 3.82) at 24 months, and -0.47 (95 % CI: -3.29 to 2.35) at 36 months. No significant difference was detected between the two groups at any point in time. The pooled ORs comparing the AGV implant with the Baerveldt implant were 0.51 (95 % CI: 0.33 to 0.80) for the complete success rate and 0.67 (95 % CI: 0.50 to 0.91) for qualified success rate. The Baerveldt implant was associated with a reduction in glaucoma medication at -0.51 (95 % CI: -0.90 to -0.12). There were no significant differences between the AGV implant and the Baerveldt implant on the rates of adverse events. The Baerveldt implant is more effective in both its surgical success rate and reducing glaucoma medication, but it is comparable to the AGV implant in lowering IOP. Both implants may have comparable incidences of adverse events.

Long-term results of Ahmed glaucoma valve implantation in Egyptian population.

PubMed

Elhefney, Eman; Mokbel, Tharwat; Abou Samra, Waleed; Kishk, Hanem; Mohsen, Tarek; El-Kannishy, Amr

2018-01-01

To evaluate the long-term results and complications of Ahmed glaucoma valve (AGV) implantation in a cohort of Egyptian patients. A retrospective study of 124 eyes of 99 patients with refractory glaucoma who underwent AGV implantation and had a minimum follow-up of 5y was performed. All patients underwent complete ophthalmic examination and intraocular pressure (IOP) measurement before surgery and at 1d, weekly for the 1 st month, 3, 6mo, and 1y after surgery and yearly afterward for 5y. IOP was measured by Goldmann applanation tonometry and/or Tono-Pen. Complications and the number of anti-glaucoma medications needed were recorded. Success was defined as IOP less than 21 mm Hg with or without anti-glaucoma medication and without additional glaucoma surgery. Mean age was 23.1±19.9y. All eyes had at least one prior glaucoma surgery. IOP was reduced from a mean of 37.2±6.8 to 19.2±5.2 mm Hg after 5y follow-up with a reduced number of medications from 2.64±0.59 to 1.81±0.4. Complete and qualified success rates were 31.5% and 46.0% respectively at the end of follow-up. The most common complications were encapsulated cyst formation in 51 eyes (41.1%), complicated cataract in 9 eyes (7.25%), recessed tube in 8 eyes (6.45%), tube exposure in 6 eyes (4.8%) and corneal touch in 6 eyes (4.8%). Other complications included extruded AGV, endophthalmitis and persistent hypotony. Each of them was recorded in only 2 eyes (1.6%). Although refractory glaucoma is a difficult problem to manage, AGV is effective and relatively safe procedure in treating refractory glaucoma in Egyptian patients with long-term follow-up. Encapsulated cyst formation was the most common complication, which limits successful IOP control after AGV implantation. However, effective complications management can improve the rate of success.

Dual infection by streptococcus and atypical mycobacteria following Ahmed glaucoma valve surgery.

PubMed

Rao, Aparna; Wallang, Batriti; Padhy, Tapas Ranjan; Mittal, Ruchi; Sharma, Savitri

2013-07-01

To report a case of late postoperative endophthalmitis caused by Streptococcus pneumoniae and conjunctival necrosis by Streptococcus pneumoniae and Mycobacterium fortuitum following Ahmed glaucoma valve (AGV) surgery in a young patient. Case report of a 13-year-old boy with purulent exudates and extensive conjunctival necrosis two months following amniotic membrane graft and conjunctival closure (for conjunctival retraction post AGV for secondary glaucoma). The conjunctiva showed extensive necrosis causing exposure of the tube and plate associated with frank exudates in the area adjoining the plate and anterior chamber mandating explantation of the plate along with intravitreal antibiotics. The vitreous aspirate grew Streptococcus pneumoniae while Streptococcus pneumoniae with Mycobacterium fortuitum was isolated from the explanted plate. Despite adequate control of infection following surgery, the final visual outcome was poor owing to disc pallor. Conjunctival necrosis and retraction post-AGV can cause late postoperative co-infections by fulminant and slow-growing organisms. A close follow-up is therefore essential in these cases to prevent sight-threatening complications.

Small Imaging Depth LIDAR and DCNN-Based Localization for Automated Guided Vehicle †

PubMed Central

Ito, Seigo; Hiratsuka, Shigeyoshi; Ohta, Mitsuhiko; Matsubara, Hiroyuki; Ogawa, Masaru

2018-01-01

We present our third prototype sensor and a localization method for Automated Guided Vehicles (AGVs), for which small imaging LIght Detection and Ranging (LIDAR) and fusion-based localization are fundamentally important. Our small imaging LIDAR, named the Single-Photon Avalanche Diode (SPAD) LIDAR, uses a time-of-flight method and SPAD arrays. A SPAD is a highly sensitive photodetector capable of detecting at the single-photon level, and the SPAD LIDAR has two SPAD arrays on the same chip for detection of laser light and environmental light. Therefore, the SPAD LIDAR simultaneously outputs range image data and monocular image data with the same coordinate system and does not require external calibration among outputs. As AGVs travel both indoors and outdoors with vibration, this calibration-less structure is particularly useful for AGV applications. We also introduce a fusion-based localization method, named SPAD DCNN, which uses the SPAD LIDAR and employs a Deep Convolutional Neural Network (DCNN). SPAD DCNN can fuse the outputs of the SPAD LIDAR: range image data, monocular image data and peak intensity image data. The SPAD DCNN has two outputs: the regression result of the position of the SPAD LIDAR and the classification result of the existence of a target to be approached. Our third prototype sensor and the localization method are evaluated in an indoor environment by assuming various AGV trajectories. The results show that the sensor and localization method improve the localization accuracy. PMID:29320434

Small Imaging Depth LIDAR and DCNN-Based Localization for Automated Guided Vehicle.

PubMed

Ito, Seigo; Hiratsuka, Shigeyoshi; Ohta, Mitsuhiko; Matsubara, Hiroyuki; Ogawa, Masaru

2018-01-10

We present our third prototype sensor and a localization method for Automated Guided Vehicles (AGVs), for which small imaging LIght Detection and Ranging (LIDAR) and fusion-based localization are fundamentally important. Our small imaging LIDAR, named the Single-Photon Avalanche Diode (SPAD) LIDAR, uses a time-of-flight method and SPAD arrays. A SPAD is a highly sensitive photodetector capable of detecting at the single-photon level, and the SPAD LIDAR has two SPAD arrays on the same chip for detection of laser light and environmental light. Therefore, the SPAD LIDAR simultaneously outputs range image data and monocular image data with the same coordinate system and does not require external calibration among outputs. As AGVs travel both indoors and outdoors with vibration, this calibration-less structure is particularly useful for AGV applications. We also introduce a fusion-based localization method, named SPAD DCNN, which uses the SPAD LIDAR and employs a Deep Convolutional Neural Network (DCNN). SPAD DCNN can fuse the outputs of the SPAD LIDAR: range image data, monocular image data and peak intensity image data. The SPAD DCNN has two outputs: the regression result of the position of the SPAD LIDAR and the classification result of the existence of a target to be approached. Our third prototype sensor and the localization method are evaluated in an indoor environment by assuming various AGV trajectories. The results show that the sensor and localization method improve the localization accuracy.

A nonlinear model predictive control formulation for obstacle avoidance in high-speed autonomous ground vehicles in unstructured environments

NASA Astrophysics Data System (ADS)

Liu, Jiechao; Jayakumar, Paramsothy; Stein, Jeffrey L.; Ersal, Tulga

2018-06-01

This paper presents a nonlinear model predictive control (MPC) formulation for obstacle avoidance in high-speed, large-size autono-mous ground vehicles (AGVs) with high centre of gravity (CoG) that operate in unstructured environments, such as military vehicles. The term 'unstructured' in this context denotes that there are no lanes or traffic rules to follow. Existing MPC formulations for passenger vehicles in structured environments do not readily apply to this context. Thus, a new nonlinear MPC formulation is developed to navigate an AGV from its initial position to a target position at high-speed safely. First, a new cost function formulation is used that aims to find the shortest path to the target position, since no reference trajectory exists in unstructured environments. Second, a region partitioning approach is used in conjunction with a multi-phase optimal control formulation to accommodate the complicated forms the obstacle-free region can assume due to the presence of multiple obstacles in the prediction horizon in an unstructured environment. Third, the no-wheel-lift-off condition, which is the major dynamical safety concern for high-speed, high-CoG AGVs, is ensured by limiting the steering angle within a range obtained offline using a 14 degrees-of-freedom vehicle dynamics model. Thus, a safe, high-speed navigation is enabled in an unstructured environment. Simulations of an AGV approaching multiple obstacles are provided to demonstrate the effectiveness of the algorithm.

Outcomes of Ahmed Glaucoma Valve Revision in Pediatric Glaucoma.

PubMed

Al-Omairi, Ahmed Mansour; Al Ameri, Aliah H; Al-Shahwan, Sami; Khan, Arif O; Al-Jadaan, Ibrahim; Mousa, Ahmed; Edward, Deepak P

2017-11-01

Encapsulation of the Ahmed glaucoma valve (AGV) plate is a common cause for postoperative elevation of intraocular pressure, especially in children. Many reports have described the outcomes of AGV revision in adults. However, the outcomes of AGV revision in children are poorly documented. The aim of this study was to determine the outcomes of AGV revision in children. Retrospective cross-sectional study. A retrospective chart review of patients less than 15 years of age who underwent AGV revision with a minimum postoperative follow-up of 6 months was conducted. Outcome measures included reduction in intraocular pressure from baseline, survival analysis, and reduction in the number of antiglaucoma medications. Postoperative complications were also noted. Complete success was defined as an IOP of 21 mm Hg or less without medications, while qualified success was defined as having an IOP of 21 mm Hg or less with medications. A total of 44 eyes met the inclusion criteria. Primary congenital glaucoma was present in 39 eyes (88.6%), aphakic glaucoma in 4 eyes (9.1%), and Peters anomaly-associated glaucoma in 1 eye (2.3%). The mean number of previous surgeries was 1.4, and the mean age was 6.7 years (range, 1.9-13 years) with a median follow-up of 12 months (range, 6-24 months). The IOP was reduced from a preoperative mean of 30.4 (± 10.3) to 24.9 (± 10.6) mm Hg at 6 months postoperatively. Kaplan-Meier analysis showed that the complete success rate at 1 month was 100% followed by a rapid decline at 6 months to 38.6%, 27.7% at 1 year, and 5.5% at 2 years. Qualified success rate was 100% at 1 month followed by a 6-month and 1-year survival rate of approximately 50% and a 2-year survival rate of approximately 16%. The median survival time was 14 months. No specific risk factors for failure were identified. Visual acuity remained unchanged following revision. The most common complication was recurrence of encapsulation with elevated IOP (15.9%). Other complications included hyphema (n = 3; 6.8%), endophthalmitis (n = 1; 2.3%), wound leak (n = 1; 2.3%), and choroidal detachment (n = 2; 4.5%). Although the short-term success rate of AGV revision in children is high, with longer follow-up the success rate decreases significantly. Copyright © 2017 Elsevier Inc. All rights reserved.

Diverse task scheduling for individualized requirements in cloud manufacturing

NASA Astrophysics Data System (ADS)

Zhou, Longfei; Zhang, Lin; Zhao, Chun; Laili, Yuanjun; Xu, Lida

2018-03-01

Cloud manufacturing (CMfg) has emerged as a new manufacturing paradigm that provides ubiquitous, on-demand manufacturing services to customers through network and CMfg platforms. In CMfg system, task scheduling as an important means of finding suitable services for specific manufacturing tasks plays a key role in enhancing the system performance. Customers' requirements in CMfg are highly individualized, which leads to diverse manufacturing tasks in terms of execution flows and users' preferences. We focus on diverse manufacturing tasks and aim to address their scheduling issue in CMfg. First of all, a mathematical model of task scheduling is built based on analysis of the scheduling process in CMfg. To solve this scheduling problem, we propose a scheduling method aiming for diverse tasks, which enables each service demander to obtain desired manufacturing services. The candidate service sets are generated according to subtask directed graphs. An improved genetic algorithm is applied to searching for optimal task scheduling solutions. The effectiveness of the scheduling method proposed is verified by a case study with individualized customers' requirements. The results indicate that the proposed task scheduling method is able to achieve better performance than some usual algorithms such as simulated annealing and pattern search.

Testing Task Schedulers on Linux System

NASA Astrophysics Data System (ADS)

Jelenković, Leonardo; Groš, Stjepan; Jakobović, Domagoj

Testing task schedulers on Linux operating system proves to be a challenging task. There are two main problems. The first one is to identify which properties of the scheduler to test. The second problem is how to perform it, e.g., which API to use that is sufficiently precise and in the same time supported on most platforms. This paper discusses the problems in realizing test framework for testing task schedulers and presents one potential solution. Observed behavior of the scheduler is the one used for “normal” task scheduling (SCHED_OTHER), unlike one used for real-time tasks (SCHED_FIFO, SCHED_RR).

A Scheduling Algorithm for Cloud Computing System Based on the Driver of Dynamic Essential Path.

PubMed

Xie, Zhiqiang; Shao, Xia; Xin, Yu

2016-01-01

To solve the problem of task scheduling in the cloud computing system, this paper proposes a scheduling algorithm for cloud computing based on the driver of dynamic essential path (DDEP). This algorithm applies a predecessor-task layer priority strategy to solve the problem of constraint relations among task nodes. The strategy assigns different priority values to every task node based on the scheduling order of task node as affected by the constraint relations among task nodes, and the task node list is generated by the different priority value. To address the scheduling order problem in which task nodes have the same priority value, the dynamic essential long path strategy is proposed. This strategy computes the dynamic essential path of the pre-scheduling task nodes based on the actual computation cost and communication cost of task node in the scheduling process. The task node that has the longest dynamic essential path is scheduled first as the completion time of task graph is indirectly influenced by the finishing time of task nodes in the longest dynamic essential path. Finally, we demonstrate the proposed algorithm via simulation experiments using Matlab tools. The experimental results indicate that the proposed algorithm can effectively reduce the task Makespan in most cases and meet a high quality performance objective.

A Scheduling Algorithm for Cloud Computing System Based on the Driver of Dynamic Essential Path

PubMed Central

Xie, Zhiqiang; Shao, Xia; Xin, Yu

2016-01-01

To solve the problem of task scheduling in the cloud computing system, this paper proposes a scheduling algorithm for cloud computing based on the driver of dynamic essential path (DDEP). This algorithm applies a predecessor-task layer priority strategy to solve the problem of constraint relations among task nodes. The strategy assigns different priority values to every task node based on the scheduling order of task node as affected by the constraint relations among task nodes, and the task node list is generated by the different priority value. To address the scheduling order problem in which task nodes have the same priority value, the dynamic essential long path strategy is proposed. This strategy computes the dynamic essential path of the pre-scheduling task nodes based on the actual computation cost and communication cost of task node in the scheduling process. The task node that has the longest dynamic essential path is scheduled first as the completion time of task graph is indirectly influenced by the finishing time of task nodes in the longest dynamic essential path. Finally, we demonstrate the proposed algorithm via simulation experiments using Matlab tools. The experimental results indicate that the proposed algorithm can effectively reduce the task Makespan in most cases and meet a high quality performance objective. PMID:27490901

WETTING AND REACTIVE AIR BRAZING OF BSCF FOR OXYGEN SEPARATION DEVICES

DOE Office of Scientific and Technical Information (OSTI.GOV)

LaDouceur, Richard M.; Meier, Alan; Joshi, Vineet V.

Reactive air brazes Ag-CuO and Ag-V2O5 were evaluated for brazing Ba0.5Sr0.5Co0.8Fe0.2O(3-δ) (BSCF). BSCF has been determined in previous work to have the highest potential mixed ionic/electronic conducting (MIEC) ceramic material based on the design and oxygen flux requirements of an oxy-fuel plant such as an integrated gasification combined cycle (IGCC) used to facilitate high-efficiency carbon capture. Apparent contact angles were observed for Ag-CuO and Ag-V2O5 mixtures at 1000 °C for isothermal hold times of 0, 10, 30, and 60 minutes. Wetting apparent contact angles (θ<90°) were obtained for 1%, 2%, and 5% Ag-CuO and Ag-V2O5 mixtures, with the apparent contactmore » angles between 74° and 78° for all compositions and furnace dwell times. Preliminary microstructural analysis indicates that two different interfacial reactions are occurring: Ag-CuO interfacial microstructures revealed the same dissolution of copper oxide into the BSCF matrix to form copper-cobalt-oxygen rich dissolution products along the BSCF grain boundaries and Ag-V2O5 interfacial microstructures revealed the infiltration and replacement of cobalt and iron with vanadium and silver filling pores in the BSCF microstructure. The Ag-V2O5 interfacial reaction product layer was measured to be significantly thinner than the Ag-CuO reaction product layer. Using a fully articulated four point flexural bend test fixture, the flexural fracture strength for BSCF was determined to be 95 ± 33 MPa. The fracture strength will be used to ascertain the success of the reactive air braze alloys. Based on these results, brazes were fabricated and mechanically tested to begin to optimize the brazing parameters for this system. Ag-2.5% CuO braze alloy with a 2.5 minute thermal cycle achieved a hermetic seal with a joint flexural strength of 34 ± 15 MPa and Ag-1% V2O5 with a 30 minute thermal cycle had a joint flexural strength of 20 ± 15 MPa.« less

Ahmed Glaucoma Valve Implantation in Vitrectomized Eyes.

PubMed

Erçalık, Nimet Yeşim; İmamoğlu, Serhat

2018-01-01

To evaluate the outcomes of Ahmed glaucoma valve (AGV) implantation in vitrectomized eyes. The medical records of 13 eyes that developed glaucoma due to emulsified silicon oil or neovascularization following pars plana vitrectomy and underwent AGV implantation were retrospectively reviewed. The main outcome measures were intraocular pressure (IOP), best-corrected visual acuity (BCVA), number of antiglaucoma medications, and postoperative complications. Surgical success was defined as last IOP ≤21 mmHg or ≥6 mmHg and without loss of light perception. The mean follow-up duration was 11.7 ± 5.5 (range, 6-23) months. The mean IOP before the AGV implantation was 37.9 ± 6.7 mmHg with an average of 3.5 ± 1.2 drugs. At the final visit, the mean IOP was 15.9 ± 4.6 mmHg ( p =0.001) and the mean number of glaucoma medications decreased to 2.3 ± 1.3 ( p =0.021). At the last visit, 11 eyes (84.4%) had stable or improved VA and one eye (7.7%) had a final VA of no light perception. Surgical success was achieved in 11 of the 13 eyes (84.4%). Postoperative complications were bleb encapsulation (69.2%), early hypotony (38.5%), hyphema (23.1%), decompression retinopathy (23.1%), choroidal detachment (15.4%), intraocular hemorrhage (7.7%), and late endophthalmitis (7.7%). One eye (7.7%) was enucleated because of late endophthalmitis. Despite complications necessitating medical and surgical interventions, vitrectomized eyes were effectively managed with AGV implantation.

Clinical outcomes of trabeculectomy vs. Ahmed glaucoma valve implantation in patients with penetrating keratoplasty : (Trabeculectomy vs. Ahmed galucoma valve in patients with penetrating keratoplasty).

PubMed

Akdemir, Mehmet Orcun; Acar, Banu Torun; Kokturk, Furuzan; Acar, Suphi

2016-08-01

The aim of this study was to compare the visual outcomes, intraocular pressure (IOP), and endothelial cell loss caused by trabeculectomy (TRAB) and Ahmed glaucoma valve (AGV) implantation in patients who had previously undergone penetrating keratoplasty (PKP). The data from all patients who underwent surgical treatment of glaucoma after PKP were reviewed at the Cornea Department of Haydarpasa Numune Education and Research Hospital. Eighteen patients who had undergone surgical treatment of glaucoma after PKP were included in this retrospective study. Time between PKP and glaucoma surgeries, visual acuity results, IOP results, endothelial cell counts (ECC) before the surgery, at 1st, 6th, and 12th month of surgery were recorded. Differences between two groups were evaluated. Mean loss of ECC was 315 cells/mm(2) in the AGV group and 197 cells/mm(2) in TRAB group at 12th month of glaucoma surgery. The difference between endothelial cell loss at 12th month of surgery was statistically significant and higher in AGV group (p < 0.001). The decrease in IOP was 64.2 % in AGV group and 46.9 % in TRAB group at 12th month of surgery. Both differences were statistically significant between 2 groups (p = 0.001, 0.001). TRAB successfully decreased both the IOP and endothelial cell loss in patients with post-PKP glaucoma. Ahmed glaucoma valve had a significantly better IOP lowering but higher endothelial cell loss effect.

Long-term clinical outcomes of Ahmed valve implantation in patients with refractory glaucoma.

PubMed

Lee, Chang Kyu; Ma, Kyoung Tak; Hong, Young Jae; Kim, Chan Yun

2017-01-01

To evaluate the long-term efficacy of intraocular pressure (IOP) reduction and complications of Ahmed Glaucoma Valve (AGV) implantation in patients with refractory glaucoma. Retrospective study. The study involved 302 refractory glaucoma patients who underwent AGV implantation and had a minimum follow-up of 6 months between March 1995 and December 2013. An operation was defined as successful when (1) the postoperative IOP remained between 5 and 21 mmHg and was reduced 30% compared to the baseline IOP with or without medication, (2) there was no loss of light perception or vision-threatening severe complications, and (3) no additional filtering or aqueous drainage surgery was required. Clinical records were reviewed. IOP, anti-glaucoma medications, and complications. The mean follow-up period was 62.25 months (range, 6 to 190 months). The cumulative probability of success was 89% at 6 months, 81% at 1 year, 66% at 3 years, 44% at 10 years, and 26% at 15 years. IOP was reduced from a mean of 32.2 ± 10.5 mmHg to 18.6 ± 9.1 mmHg at 1 month, 15.2 ± 7.0 mmHg at 6 months, and 14.2 ± 3.5 mmHg at 15 years. Surgical failures were significantly increased when preoperative IOP was high, and when severe complications occurred after AGV implantation (P < 0.05). AGV implantation was successful for IOP control in patients with refractive glaucoma in the long term. However, the success rate of surgery decreased over time. Preoperative high IOP and severe complications related to the operation were significant risk factors for failure.

Histopathologic and immunohistochemical features of capsular tissue around failed Ahmed glaucoma valves.

PubMed

Mahale, Alka; Fikri, Fatma; Al Hati, Khitam; Al Shahwan, Sami; Al Jadaan, Ibrahim; Al Katan, Hind; Khandekar, Rajiv; Maktabi, Azza; Edward, Deepak P

2017-01-01

Impervious encapsulation around Ahmed glaucoma valve (AGV) results in surgical failure raising intraocular pressure (IOP). Dysregulation of extracellular matrix (ECM) molecules and cellular factors might contribute to increased hydraulic resistance to aqueous drainage. Therefore, we examined these molecules in failed AGV capsular tissue. Immunostaining for ECM molecules (collagen I, collagen III, decorin, lumican, chondroitin sulfate, aggrecan and keratan sulfate) and cellular factors (αSMA and TGFβ) was performed on excised capsules from failed AGVs and control tenon's tissue. Staining intensity of ECM molecules was assessed using Image J. Cellular factors were assessed based on positive cell counts. Histopathologically two distinct layers were visible in capsules. The inner layer (proximal to the AGV) showed significant decrease in most ECM molecules compared to outer layer. Furthermore, collagen III (p = 0.004), decorin (p = 0.02), lumican (p = 0.01) and chondroitin sulfate (p = 0.02) was significantly less in inner layer compared to tenon's tissue. Outer layer labelling however was similar to control tenon's for most ECM molecules. Significantly increased cellular expression of αSMA (p = 0.02) and TGFβ (p = 0.008) was detected within capsular tissue compared to controls. Our results suggest profibrotic activity indicated by increased αSMA and TGFβ expression and decreased expression of proteoglycan (decorin and lumican) and glycosaminoglycans (chondroitin sulfate). Additionally, we observed decreased collagen III which might reflect increased myofibroblast contractility when coupled with increased TGFβ and αSMA expression. Together these events lead to tissue dysfunction potentially resulting in hydraulic resistance that may affect aqueous flow through the capsular wall.

Tenon advancement and duplication technique to prevent postoperative Ahmed valve tube exposure in patients with refractory glaucoma.

PubMed

Tamcelik, Nevbahar; Ozkok, Ahmet; Sarıcı, Ahmet Murat; Atalay, Eray; Yetik, Huseyin; Gungor, Kivanc

2013-07-01

To present and compare the long-term results of Dr. Tamcelik's previously described technique of Tenon advancement and duplication with the conventional Ahmed glaucoma valve (AGV) implantation technique in patients with refractory glaucoma. This study was a multicenter, retrospective case series that included 303 eyes of 276 patients with refractory glaucoma who underwent glaucoma valve implantation surgery. The patients were divided into three groups according to the surgical technique applied and the outcomes compared. In group 1, 96 eyes of 86 patients underwent AGV implant surgery without patch graft; in group 2, 78 eyes of 72 patients underwent AGV implant surgery with donor scleral patch; in group 3, 129 eyes of 118 patients underwent Ahmed valve implant surgery with "combined short scleral tunnel with Tenon advancement and duplication technique". The endpoint assessed was tube exposure through the conjunctiva. In group 1, conjunctival tube exposure was seen in 11 eyes (12.9 %) after a mean 9.2 ± 3.7 years of follow-up. In group 2, conjunctival tube exposure was seen in six eyes (2.2 %) after a mean 8.9 ± 3.3 years of follow-up. In group 3, there was no conjunctival exposure after a mean 7.8 ± 2.8 years of follow-up. The difference between the groups was statistically significant. (P = 0.0001, Chi-square test). This novel surgical technique combining a short scleral tunnel with Tenon advancement and duplication was found to be effective and safe to prevent conjunctival tube exposure after AGV implantation surgery in patients with refractory glaucoma.

Evaluation of scheduling techniques for payload activity planning

NASA Technical Reports Server (NTRS)

Bullington, Stanley F.

1991-01-01

Two tasks related to payload activity planning and scheduling were performed. The first task involved making a comparison of space mission activity scheduling problems with production scheduling problems. The second task consisted of a statistical analysis of the output of runs of the Experiment Scheduling Program (ESP). Details of the work which was performed on these two tasks are presented.

A hybrid online scheduling mechanism with revision and progressive techniques for autonomous Earth observation satellite

NASA Astrophysics Data System (ADS)

Li, Guoliang; Xing, Lining; Chen, Yingwu

2017-11-01

The autonomicity of self-scheduling on Earth observation satellite and the increasing scale of satellite network attract much attention from researchers in the last decades. In reality, the limited onboard computational resource presents challenge for the online scheduling algorithm. This study considered online scheduling problem for a single autonomous Earth observation satellite within satellite network environment. It especially addressed that the urgent tasks arrive stochastically during the scheduling horizon. We described the problem and proposed a hybrid online scheduling mechanism with revision and progressive techniques to solve this problem. The mechanism includes two decision policies, a when-to-schedule policy combining periodic scheduling and critical cumulative number-based event-driven rescheduling, and a how-to-schedule policy combining progressive and revision approaches to accommodate two categories of task: normal tasks and urgent tasks. Thus, we developed two heuristic (re)scheduling algorithms and compared them with other generally used techniques. Computational experiments indicated that the into-scheduling percentage of urgent tasks in the proposed mechanism is much higher than that in periodic scheduling mechanism, and the specific performance is highly dependent on some mechanism-relevant and task-relevant factors. For the online scheduling, the modified weighted shortest imaging time first and dynamic profit system benefit heuristics outperformed the others on total profit and the percentage of successfully scheduled urgent tasks.

Wave scheduling - Decentralized scheduling of task forces in multicomputers

NASA Technical Reports Server (NTRS)

Van Tilborg, A. M.; Wittie, L. D.

1984-01-01

Decentralized operating systems that control large multicomputers need techniques to schedule competing parallel programs called task forces. Wave scheduling is a probabilistic technique that uses a hierarchical distributed virtual machine to schedule task forces by recursively subdividing and issuing wavefront-like commands to processing elements capable of executing individual tasks. Wave scheduling is highly resistant to processing element failures because it uses many distributed schedulers that dynamically assign scheduling responsibilities among themselves. The scheduling technique is trivially extensible as more processing elements join the host multicomputer. A simple model of scheduling cost is used by every scheduler node to distribute scheduling activity and minimize wasted processing capacity by using perceived workload to vary decentralized scheduling rules. At low to moderate levels of network activity, wave scheduling is only slightly less efficient than a central scheduler in its ability to direct processing elements to accomplish useful work.

CQPSO scheduling algorithm for heterogeneous multi-core DAG task model

NASA Astrophysics Data System (ADS)

Zhai, Wenzheng; Hu, Yue-Li; Ran, Feng

2017-07-01

Efficient task scheduling is critical to achieve high performance in a heterogeneous multi-core computing environment. The paper focuses on the heterogeneous multi-core directed acyclic graph (DAG) task model and proposes a novel task scheduling method based on an improved chaotic quantum-behaved particle swarm optimization (CQPSO) algorithm. A task priority scheduling list was built. A processor with minimum cumulative earliest finish time (EFT) was acted as the object of the first task assignment. The task precedence relationships were satisfied and the total execution time of all tasks was minimized. The experimental results show that the proposed algorithm has the advantage of optimization abilities, simple and feasible, fast convergence, and can be applied to the task scheduling optimization for other heterogeneous and distributed environment.

Study on store-space assignment based on logistic AGV in e-commerce goods to person picking pattern

NASA Astrophysics Data System (ADS)

Xu, Lijuan; Zhu, Jie

2017-10-01

This paper studied on the store-space assignment based on logistic AGV in E-commerce goods to person picking pattern, and established the store-space assignment model based on the lowest picking cost, and design for store-space assignment algorithm after the cluster analysis based on similarity coefficient. And then through the example analysis, compared the picking cost between store-space assignment algorithm this paper design and according to item number and storage according to ABC classification allocation, and verified the effectiveness of the design of the store-space assignment algorithm.

Non-Evolutionary Algorithms for Scheduling Dependent Tasks in Distributed Heterogeneous Computing Environments

DOE Office of Scientific and Technical Information (OSTI.GOV)

Wayne F. Boyer; Gurdeep S. Hura

2005-09-01

The Problem of obtaining an optimal matching and scheduling of interdependent tasks in distributed heterogeneous computing (DHC) environments is well known to be an NP-hard problem. In a DHC system, task execution time is dependent on the machine to which it is assigned and task precedence constraints are represented by a directed acyclic graph. Recent research in evolutionary techniques has shown that genetic algorithms usually obtain more efficient schedules that other known algorithms. We propose a non-evolutionary random scheduling (RS) algorithm for efficient matching and scheduling of inter-dependent tasks in a DHC system. RS is a succession of randomized taskmore » orderings and a heuristic mapping from task order to schedule. Randomized task ordering is effectively a topological sort where the outcome may be any possible task order for which the task precedent constraints are maintained. A detailed comparison to existing evolutionary techniques (GA and PSGA) shows the proposed algorithm is less complex than evolutionary techniques, computes schedules in less time, requires less memory and fewer tuning parameters. Simulation results show that the average schedules produced by RS are approximately as efficient as PSGA schedules for all cases studied and clearly more efficient than PSGA for certain cases. The standard formulation for the scheduling problem addressed in this paper is Rm|prec|Cmax.,« less

An Integrated Approach to Locality-Conscious Processor Allocation and Scheduling of Mixed-Parallel Applications

DOE Office of Scientific and Technical Information (OSTI.GOV)

Vydyanathan, Naga; Krishnamoorthy, Sriram; Sabin, Gerald M.

2009-08-01

Complex parallel applications can often be modeled as directed acyclic graphs of coarse-grained application-tasks with dependences. These applications exhibit both task- and data-parallelism, and combining these two (also called mixedparallelism), has been shown to be an effective model for their execution. In this paper, we present an algorithm to compute the appropriate mix of task- and data-parallelism required to minimize the parallel completion time (makespan) of these applications. In other words, our algorithm determines the set of tasks that should be run concurrently and the number of processors to be allocated to each task. The processor allocation and scheduling decisionsmore » are made in an integrated manner and are based on several factors such as the structure of the taskgraph, the runtime estimates and scalability characteristics of the tasks and the inter-task data communication volumes. A locality conscious scheduling strategy is used to improve inter-task data reuse. Evaluation through simulations and actual executions of task graphs derived from real applications as well as synthetic graphs shows that our algorithm consistently generates schedules with lower makespan as compared to CPR and CPA, two previously proposed scheduling algorithms. Our algorithm also produces schedules that have lower makespan than pure taskand data-parallel schedules. For task graphs with known optimal schedules or lower bounds on the makespan, our algorithm generates schedules that are closer to the optima than other scheduling approaches.« less

Exploiting Vector and Multicore Parallelsim for Recursive, Data- and Task-Parallel Programs

DOE Office of Scientific and Technical Information (OSTI.GOV)

Ren, Bin; Krishnamoorthy, Sriram; Agrawal, Kunal

Modern hardware contains parallel execution resources that are well-suited for data-parallelism-vector units-and task parallelism-multicores. However, most work on parallel scheduling focuses on one type of hardware or the other. In this work, we present a scheduling framework that allows for a unified treatment of task- and data-parallelism. Our key insight is an abstraction, task blocks, that uniformly handles data-parallel iterations and task-parallel tasks, allowing them to be scheduled on vector units or executed independently as multicores. Our framework allows us to define schedulers that can dynamically select between executing task- blocks on vector units or multicores. We show that thesemore » schedulers are asymptotically optimal, and deliver the maximum amount of parallelism available in computation trees. To evaluate our schedulers, we develop program transformations that can convert mixed data- and task-parallel pro- grams into task block-based programs. Using a prototype instantiation of our scheduling framework, we show that, on an 8-core system, we can simultaneously exploit vector and multicore parallelism to achieve 14×-108× speedup over sequential baselines.« less

A Genetic-Based Scheduling Algorithm to Minimize the Makespan of the Grid Applications

NASA Astrophysics Data System (ADS)

Entezari-Maleki, Reza; Movaghar, Ali

Task scheduling algorithms in grid environments strive to maximize the overall throughput of the grid. In order to maximize the throughput of the grid environments, the makespan of the grid tasks should be minimized. In this paper, a new task scheduling algorithm is proposed to assign tasks to the grid resources with goal of minimizing the total makespan of the tasks. The algorithm uses the genetic approach to find the suitable assignment within grid resources. The experimental results obtained from applying the proposed algorithm to schedule independent tasks within grid environments demonstrate the applicability of the algorithm in achieving schedules with comparatively lower makespan in comparison with other well-known scheduling algorithms such as, Min-min, Max-min, RASA and Sufferage algorithms.

Ahmed Glaucoma Valve Implantation in Vitrectomized Eyes

PubMed Central

İmamoğlu, Serhat

2018-01-01

Purpose To evaluate the outcomes of Ahmed glaucoma valve (AGV) implantation in vitrectomized eyes. Materials and Methods The medical records of 13 eyes that developed glaucoma due to emulsified silicon oil or neovascularization following pars plana vitrectomy and underwent AGV implantation were retrospectively reviewed. The main outcome measures were intraocular pressure (IOP), best-corrected visual acuity (BCVA), number of antiglaucoma medications, and postoperative complications. Surgical success was defined as last IOP ≤21 mmHg or ≥6 mmHg and without loss of light perception. Results The mean follow-up duration was 11.7 ± 5.5 (range, 6–23) months. The mean IOP before the AGV implantation was 37.9 ± 6.7 mmHg with an average of 3.5 ± 1.2 drugs. At the final visit, the mean IOP was 15.9 ± 4.6 mmHg (p=0.001) and the mean number of glaucoma medications decreased to 2.3 ± 1.3 (p=0.021). At the last visit, 11 eyes (84.4%) had stable or improved VA and one eye (7.7%) had a final VA of no light perception. Surgical success was achieved in 11 of the 13 eyes (84.4%). Postoperative complications were bleb encapsulation (69.2%), early hypotony (38.5%), hyphema (23.1%), decompression retinopathy (23.1%), choroidal detachment (15.4%), intraocular hemorrhage (7.7%), and late endophthalmitis (7.7%). One eye (7.7%) was enucleated because of late endophthalmitis. Conclusions Despite complications necessitating medical and surgical interventions, vitrectomized eyes were effectively managed with AGV implantation. PMID:29862068

Short-term to Long-term Results of Ahmed Glaucoma Valve Implantation for Uveitic Glaucoma Secondary to Behçet Disease.

PubMed

Yakin, Mehmet; Eksioglu, Umit; Sungur, Gulten; Satana, Banu; Demirok, Gulizar; Ornek, Firdevs

2017-01-01

To evaluate short-term to long-term outcomes of Ahmed glaucoma valve (AGV) implantation in the management of uveitic glaucoma (UG) secondary to Behçet disease (BD). A retrospective chart review of 47 eyes of 35 patients with UG secondary to BD who underwent AGV implantation was conducted. Success was defined as having an intraocular pressure (IOP) between 6 and 21 mm Hg with (qualified success) or without (complete success) antiglaucomatous medications and without need for further glaucoma surgery. Mean postoperative follow-up was 57.72±26.13 months. Mean preoperative IOP was 35.40±8.33 mm Hg versus 12.28±2.90 mm Hg at the last follow-up visit (P<0.001). Mean number of preoperative topical antiglaucomatous medications was 2.96±0.29 versus 0.68±1.12 at the last follow-up visit (P<0.001). In all eyes, IOP could be maintained between 6 and 21 mm Hg with or without antiglaucomatous medications during follow-up. The cumulative probability of complete success was 46.8% at 6 months, 40.4% at 12 months, and 35.9% at 36 months, and the cumulative probability of eyes without complication was 53.2% at 6 months, 46.5% at 12 months, and 39.6% at 24 months postoperatively based on Kaplan-Meier survival analysis. No persistent or irreparable complications were observed. This study includes one of the largest series of AGV implantation in the management of UG with the longest follow-up reported. AGV implantation can be considered as a primary surgical option in the management of UG secondary to BD with 100% total success rate (with or without medications).

Combined Ahmed Glaucoma Valve Placement, Intravitreal Fluocinolone Acetonide Implantation and Cataract Extraction for Chronic Uveitis.

PubMed

Chang, Ingrid T; Gupta, Divakar; Slabaugh, Mark A; Vemulakonda, Gurunadh A; Chen, Philip P

2016-10-01

To report the outcomes of combined Ahmed glaucoma valve (AGV) placement, intravitreal fluocinolone acetonide implant, and cataract extraction procedure in the treatment of chronic noninfectious uveitis. Retrospective case series of patients with chronic noninfectious uveitis who underwent AGV placement, intravitreal fluocinolone acetonide implantation, and cataract extraction in a single surgical session performed at 1 institution from January 2009 to November 2014. Outcome measures included intraocular pressure (IOP) and glaucoma medication use. Secondary outcome measures included visual acuity, systemic anti-inflammatory medications, number of uveitis flares, and complications. Fifteen eyes of 10 patients were studied, with a mean age of 40.3±15.7 and mean follow-up duration of 26 months (range, 13 to 39 mo). Before surgery, the IOP was 18.5±7.3 mm Hg and patients were using 1.5±1.5 topical glaucoma medications. At the 12-month follow-up, IOP was 12.8±3.2 mm Hg (P=0.01) and patients were using 0.5±0.8 (P=0.03) topical glaucoma medications. At 36 months of follow-up, late, nonsustained hypotony had occurred in 3 eyes (20%), and 1 eye (6%) had received a second AGV for IOP control. Before treatment, patients had 2.7±1.5 uveitis flares in the year before surgery while on an average of 2.1±0.6 systemic anti-inflammatory medications, which decreased to an average of 0.1±0.3 (P<0.01) flares the year after surgery while on an average of 0.4±1.1 (P<0.01) systemic medications. Combined AGV, intravitreal fluocinolone acetonide implant, and cataract extraction is effective in controlling IOP and reducing the number of glaucoma medications at 12 months after treatment in patients with chronic uveitis.

Outcomes of Ahmed Valve Implant Following a Failed Initial Trabeculotomy and Trabeculectomy in Refractory Primary Congenital Glaucoma

PubMed Central

Dave, Paaraj; Senthil, Sirisha; Choudhari, Nikhil; Sekhar, Garudadri Chandra

2015-01-01

Purpose: The aim was to report the outcome of Ahmed glaucoma valve (AGV) (New World Medical, Inc., Rancho Cucamonga, CA, USA) implantation as a surgical intervention following an initial failed combined trabeculotomy + trabeculectomy (trab + trab) in refractory primary congenital glaucoma (RPCG). Materials and Methods: Retrospective chart review of 11 eyes of 8 patients who underwent implantation of AGV (model FP8) for RPCG between 2009 and 2011. Prior trab + trab had failed in all the eyes. Success was defined as an intraocular pressure (IOP) >5 and ≤ 18 mmHg during examination under anesthesia with or without medications and without serious complications or additional glaucoma surgery. Results: The mean age at AGV implantation was 15.4 ± 4.9 months. The mean preoperative IOP was 28 ± 5.7 mmHg which reduced to 13.6 ± 3.4 mmHg postoperatively at the last follow-up (P < 0.0001). The number of topical antiglaucoma medications reduced from a mean of 2.6 ± 0.5 to 1.6 ± 0.9 postoperatively (P = 0.009). The definition of qualified success was met in 10 (90%) eyes. One eye developed a shallow anterior chamber with choroidal detachment at 1-week, which resolved spontaneously with medications. None of the eyes developed a hypertensive phase. One eye had a long tube resulting in tube corneal touch that required trimming of the tube. One eye developed tube retraction, which was treated with a tube extender. The mean follow-up was 17.9 ± 9.3 (6.2-35.4) months. Conclusion: Managing RPCG remains a challenge. AGV implant was successful in a significant proportion of cases. PMID:25624676

Clinical Outcomes of FP-7/8 Ahmed Glaucoma Valves in the Management of Refractory Glaucoma in the Mainland Chinese Population

PubMed Central

Yang, Xuejiao; Deng, Shuifeng; Li, Zuohong; Li, Fei; Zhuo, Yehong

2015-01-01

Background To evaluate the efficacy and safety of the Ahmed glaucoma valve (AGV) and the risk factors associated with AGV implantation failure in a population of Chinese patients with refractory glaucoma. Method In total, 79 eyes with refractory glaucoma from 79 patients treated in our institution from November 2007 to November 2010 were enrolled in this retrospective study. The demographic data, preoperative and postoperative intraocular pressures (IOPs), best corrected visual acuity (BCVA), number of anti-glaucoma medications used, completed and qualified surgery success rates and postoperative complications were recorded to evaluate the outcomes of AGV implantation. Factors that were associated with implant failure were determined using Cox proportional hazard regression model analysis and multiple linear regression analysis. Principle Findings The average follow-up time was 12.7±5.8 months (mean±SD). We observed a significant reduction in the mean IOP from 39.9±12.6 mm Hg before surgery to 19.3±9.6 mm Hg at the final follow-up. The complete success rate was 59.5%, and the qualified success rate was 83.5%. The number of previous surgeries was negatively correlated with qualified success rate (P<0.05, OR=0.736, 95% CI 0.547-0.99). Patients with previous trabeculectomy were more likely to use multiple anti-glaucoma drugs to control IOP (P<0.01). The primary complication was determined to be a flat anterior chamber (AC). Conclusion AGV implantation was safe and effective for the management of refractory glaucoma. Patients with a greater number of previous surgeries were more likely to experience surgical failure, and patients with previous trabeculectomy were more likely to use multiple anti-glaucoma drugs to control postoperative IOP. PMID:25996991

Long-term clinical outcomes of Ahmed valve implantation in patients with refractory glaucoma

PubMed Central

Lee, Chang Kyu; Ma, Kyoung Tak; Hong, Young Jae

2017-01-01

Purpose To evaluate the long-term efficacy of intraocular pressure (IOP) reduction and complications of Ahmed Glaucoma Valve (AGV) implantation in patients with refractory glaucoma. Design Retrospective study. Subjects The study involved 302 refractory glaucoma patients who underwent AGV implantation and had a minimum follow-up of 6 months between March 1995 and December 2013. Methods An operation was defined as successful when (1) the postoperative IOP remained between 5 and 21 mmHg and was reduced 30% compared to the baseline IOP with or without medication, (2) there was no loss of light perception or vision-threatening severe complications, and (3) no additional filtering or aqueous drainage surgery was required. Clinical records were reviewed. Main outcome measures IOP, anti-glaucoma medications, and complications Results The mean follow-up period was 62.25 months (range, 6 to 190 months). The cumulative probability of success was 89% at 6 months, 81% at 1 year, 66% at 3 years, 44% at 10 years, and 26% at 15 years. IOP was reduced from a mean of 32.2 ± 10.5 mmHg to 18.6 ± 9.1 mmHg at 1 month, 15.2 ± 7.0 mmHg at 6 months, and 14.2 ± 3.5 mmHg at 15 years. Surgical failures were significantly increased when preoperative IOP was high, and when severe complications occurred after AGV implantation (P < 0.05). Conclusion AGV implantation was successful for IOP control in patients with refractive glaucoma in the long term. However, the success rate of surgery decreased over time. Preoperative high IOP and severe complications related to the operation were significant risk factors for failure. PMID:29095931

Ahmed Glaucoma Valve Implantation for Uveitic Glaucoma Secondary to Behçet Disease.

PubMed

Satana, Banu; Yalvac, Ilgaz S; Sungur, Gulten; Eksioglu, Umit; Basarir, Berna; Altan, Cigdem; Duman, Sunay

2015-01-01

To evaluate outcomes of patients with uveitic glaucoma secondary to Behçet disease (BD) who underwent Ahmed glaucoma valve (AGV) implantation. A retrospective chart review of 14 eyes of 10 patients with uveitic glaucoma associated with BD who underwent AGV implantation at a tertiary referral center. Treatment success was defined as intraocular pressure (IOP) between 6 and 21 mm Hg with or without antiglaucoma medication, without further additional glaucoma surgery or loss of light perception. The main outcome measures were IOP, best-corrected visual acuity measured with Snellen charts, and number of glaucoma medications. Mean duration of postoperative follow-up was 18.2±6.6 months (range, 6 to 31 mo). Of the 14 eyes, 10 (71.4%) were pseudophakic and 5 (35.7%) had primary AGV implantation without a history of previous glaucoma surgery. At the most recent follow-up visit, 13 of the 14 eyes had an IOP between 6 and 21 mm Hg. Mean IOP was significantly reduced during follow-up, as compared with preoperative values (P≤0.005). The cumulative probability of surgical success rate was 90.9% at 18 months based on Kaplan-Meier survival analysis. The mean number of antiglaucoma medications required to achieve the desired IOP decreased from 3.4±0.5 preoperatively to 1.0±1.1 postoperatively (P≤0.05). Visual acuity loss of >2 lines occurred in 4 eyes (28.5%) due to optic atrophy associated with retinal vasculitis. Temporary hypotony developed during follow-up in 4 eyes (28.5%) at first postoperative week. For the management of uveitic glaucoma associated with BD, AGV implantation is a successful method for glaucoma control but requires additional surgical interventions for high early hypotony rates.

Clinical Outcomes of FP-7/8 Ahmed Glaucoma Valves in the Management of Refractory Glaucoma in the Mainland Chinese Population.

PubMed

Zhu, Yingting; Wei, Yantao; Yang, Xuejiao; Deng, Shuifeng; Li, Zuohong; Li, Fei; Zhuo, Yehong

2015-01-01

To evaluate the efficacy and safety of the Ahmed glaucoma valve (AGV) and the risk factors associated with AGV implantation failure in a population of Chinese patients with refractory glaucoma. In total, 79 eyes with refractory glaucoma from 79 patients treated in our institution from November 2007 to November 2010 were enrolled in this retrospective study. The demographic data, preoperative and postoperative intraocular pressures (IOPs), best corrected visual acuity (BCVA), number of anti-glaucoma medications used, completed and qualified surgery success rates and postoperative complications were recorded to evaluate the outcomes of AGV implantation. Factors that were associated with implant failure were determined using Cox proportional hazard regression model analysis and multiple linear regression analysis. The average follow-up time was 12.7±5.8 months (mean±SD). We observed a significant reduction in the mean IOP from 39.9±12.6 mm Hg before surgery to 19.3±9.6 mm Hg at the final follow-up. The complete success rate was 59.5%, and the qualified success rate was 83.5%. The number of previous surgeries was negatively correlated with qualified success rate (P<0.05, OR=0.736, 95% CI 0.547-0.99). Patients with previous trabeculectomy were more likely to use multiple anti-glaucoma drugs to control IOP (P<0.01). The primary complication was determined to be a flat anterior chamber (AC). AGV implantation was safe and effective for the management of refractory glaucoma. Patients with a greater number of previous surgeries were more likely to experience surgical failure, and patients with previous trabeculectomy were more likely to use multiple anti-glaucoma drugs to control postoperative IOP.

Schedule Risk Assessment

NASA Technical Reports Server (NTRS)

Smith, Greg

2003-01-01

Schedule Risk Assessment needs to determine the probability of finishing on or before a given point in time. Task in a schedule should reflect the "most likely" duration for each task. IN reality, each task is different and has a varying degree of probability of finishing within or after the duration specified. Schedule risk assessment attempt to quantify these probabilities by assigning values to each task. Bridges the gap between CPM scheduling and the project's need to know the likelihood of "when".

Applying dynamic priority scheduling scheme to static systems of pinwheel task model in power-aware scheduling.

PubMed

Seol, Ye-In; Kim, Young-Kuk

2014-01-01

Power-aware scheduling reduces CPU energy consumption in hard real-time systems through dynamic voltage scaling (DVS). In this paper, we deal with pinwheel task model which is known as static and predictable task model and could be applied to various embedded or ubiquitous systems. In pinwheel task model, each task's priority is static and its execution sequence could be predetermined. There have been many static approaches to power-aware scheduling in pinwheel task model. But, in this paper, we will show that the dynamic priority scheduling results in power-aware scheduling could be applied to pinwheel task model. This method is more effective than adopting the previous static priority scheduling methods in saving energy consumption and, for the system being still static, it is more tractable and applicable to small sized embedded or ubiquitous computing. Also, we introduce a novel power-aware scheduling algorithm which exploits all slacks under preemptive earliest-deadline first scheduling which is optimal in uniprocessor system. The dynamic priority method presented in this paper could be applied directly to static systems of pinwheel task model. The simulation results show that the proposed algorithm with the algorithmic complexity of O(n) reduces the energy consumption by 10-80% over the existing algorithms.

Applying Dynamic Priority Scheduling Scheme to Static Systems of Pinwheel Task Model in Power-Aware Scheduling

PubMed Central

2014-01-01

Power-aware scheduling reduces CPU energy consumption in hard real-time systems through dynamic voltage scaling (DVS). In this paper, we deal with pinwheel task model which is known as static and predictable task model and could be applied to various embedded or ubiquitous systems. In pinwheel task model, each task's priority is static and its execution sequence could be predetermined. There have been many static approaches to power-aware scheduling in pinwheel task model. But, in this paper, we will show that the dynamic priority scheduling results in power-aware scheduling could be applied to pinwheel task model. This method is more effective than adopting the previous static priority scheduling methods in saving energy consumption and, for the system being still static, it is more tractable and applicable to small sized embedded or ubiquitous computing. Also, we introduce a novel power-aware scheduling algorithm which exploits all slacks under preemptive earliest-deadline first scheduling which is optimal in uniprocessor system. The dynamic priority method presented in this paper could be applied directly to static systems of pinwheel task model. The simulation results show that the proposed algorithm with the algorithmic complexity of O(n) reduces the energy consumption by 10–80% over the existing algorithms. PMID:25121126

On-the-fly scheduling as a manifestation of partial-order planning and dynamic task values.

PubMed

Hannah, Samuel D; Neal, Andrew

2014-09-01

The aim of this study was to develop a computational account of the spontaneous task ordering that occurs within jobs as work unfolds ("on-the-fly task scheduling"). Air traffic control is an example of work in which operators have to schedule their tasks as a partially predictable work flow emerges. To date, little attention has been paid to such on-the-fly scheduling situations. We present a series of discrete-event models fit to conflict resolution decision data collected from experienced controllers operating in a high-fidelity simulation. Our simulations reveal air traffic controllers' scheduling decisions as examples of the partial-order planning approach of Hayes-Roth and Hayes-Roth. The most successful model uses opportunistic first-come-first-served scheduling to select tasks from a queue. Tasks with short deadlines are executed immediately. Tasks with long deadlines are evaluated to assess whether they need to be executed immediately or deferred. On-the-fly task scheduling is computationally tractable despite its surface complexity and understandable as an example of both the partial-order planning strategy and the dynamic-value approach to prioritization.

Superior versus inferior Ahmed glaucoma valve implantation.

PubMed

Pakravan, Mohammad; Yazdani, Shahin; Shahabi, Camelia; Yaseri, Mehdi

2009-02-01

To compare the efficacy and safety of Ahmed glaucoma valve (AGV) (New World Medical Inc., Rancho Cucamonga, CA) implantation in the superior versus inferior quadrants. Prospective parallel cohort study. A total of 106 eyes of 106 patients with refractory glaucoma. Consecutive patients with refractory glaucoma underwent AGV implantation in the superior or inferior quadrants. Main outcome measures included intraocular pressure (IOP) and rate of complications. Other outcome measures included best corrected visual acuity (BCVA), number of glaucoma medications, and success rate (defined as at least 30% IOP reduction and 50.122). After 1 year, statistically significant but comparable IOP reduction from baseline (P<0.001) was achieved in both groups (47.0%+/-27.2% and 43.0%+/-24.5% reduction for superior and inferior groups, respectively, P = 0.725). The mean number of glaucoma medications was comparable after 1 year (1.3+/-1.2 vs. 1.9+/-0.8 for superior and inferior implants, respectively, P = 0.256). Success rates were also similar at 1 year: 27 eyes (81.8%) versus 20 eyes (95.2%) for superior and inferior implants, respectively (P = 0.227). However, the overall rate of complications, such as implant exposure necessitating removal, cosmetically unappealing appearance, and endophthalmitis, was higher in the inferior group: 12 eyes (25%) versus 3 eyes (5.2%) for superior and inferior groups, respectively, (P = 0.004). Superior and inferior AGV implants have similar intermediate efficacy in terms of IOP reduction, decrease in number of glaucoma medications, and preservation of vision. However, the inferior quadrants entail significantly more complications. It may be prudent to avoid AGV implantation in the inferior quadrants if the superior quadrants have no contraindications to surgery. Proprietary or commercial disclosure may be found after the references.

Comparison of 1-year outcomes after Ahmed glaucoma valve implantation with and without Ologen adjuvant.

PubMed

Kim, Tai Jun; Kang, Sohyun; Jeoung, Jin Wook; Kim, Young Kook; Park, Ki Ho

2018-02-14

Many studies have investigated the clinical benefits of Ologen for trabeculectomy. However, its benefits for Ahmed glaucoma valve (AGV) implantation have not been investigated as extensively. The aim of this study was to compare the 1-year outcomes of AGV implantation with and without Ologen adjuvant for the treatment of refractory glaucoma. This retrospective study included a total of 20 eyes of 20 glaucoma patients, who were followed for at least 1-year after undergoing AGV implantation. In 12 eyes of 12 patients, conventional AGV (CAGV) surgery was performed, while in 8 eyes of 8 patients, Ologen-augmented AGV (OAGV) implantation was performed. The outcomes were evaluated according to intraocular pressure (IOP) and the number of IOP-lowering medications. Complete success was defined as IOP ≤ 21 mmHg without medications throughout the 1-year follow-up period, and qualified success was defined as IOP ≤ 21 mmHg with or without medications throughout the 1-year follow-up period. The rate of complete success was significantly higher in the OAGV group (50.0%) than in the CAGV group (8.3%) (p = 0.035). There were no significant differences between the two groups in terms of qualified success or incidence of the early hypertensive phase. The IOP changes were similar between the groups within 1-year postoperatively, though the number of IOP-lowering medications was significantly lower in the OAGV group during the early hypertensive phase (p = 0.031, 0.031, and 0.025 at postoperative months 1, 2, and 3, respectively). When subjects were divided into groups according to the occurrence of the early hypertensive phase, the group with early hypertensive phase was more likely to use IOP-lowering medications at postoperative 6 months and 1 year (p = 0.002 and 0.005, respectively). OAGV surgery shows encouraging results for patients with refractory glaucoma, specifically with respect to the achievement of complete success and the reduction of the number of IOP-lowering medications during the early hypertensive phase. Furthermore, our results suggest that occurrence of the early hypertensive phase is predictive of which patients will require IOP-lowering medications at postoperative 6 months and 1 year.

A Model and Algorithms For a Software Evolution Control System

DTIC Science & Technology

1993-12-01

dynamic scheduling approaches can be found in [67). Task scheduling can also be characterized as preemptive and nonpreemptive . A task is preemptive ...is NP-hard for both the preemptive and nonpreemptive cases [671 [84). Scheduling nonpreemptive tasks with arbitrary ready times is NP-hard in both...the preemptive and nonpreemptive cases [671 [841. Scheduling nonpreemptive tasks with arbitrary ready times is NP-hard in both multiprocessor and

Cloud computing task scheduling strategy based on improved differential evolution algorithm

NASA Astrophysics Data System (ADS)

Ge, Junwei; He, Qian; Fang, Yiqiu

2017-04-01

In order to optimize the cloud computing task scheduling scheme, an improved differential evolution algorithm for cloud computing task scheduling is proposed. Firstly, the cloud computing task scheduling model, according to the model of the fitness function, and then used improved optimization calculation of the fitness function of the evolutionary algorithm, according to the evolution of generation of dynamic selection strategy through dynamic mutation strategy to ensure the global and local search ability. The performance test experiment was carried out in the CloudSim simulation platform, the experimental results show that the improved differential evolution algorithm can reduce the cloud computing task execution time and user cost saving, good implementation of the optimal scheduling of cloud computing tasks.

Designing a fuzzy scheduler for hard real-time systems

NASA Technical Reports Server (NTRS)

Yen, John; Lee, Jonathan; Pfluger, Nathan; Natarajan, Swami

1992-01-01

In hard real-time systems, tasks have to be performed not only correctly, but also in a timely fashion. If timing constraints are not met, there might be severe consequences. Task scheduling is the most important problem in designing a hard real-time system, because the scheduling algorithm ensures that tasks meet their deadlines. However, the inherent nature of uncertainty in dynamic hard real-time systems increases the problems inherent in scheduling. In an effort to alleviate these problems, we have developed a fuzzy scheduler to facilitate searching for a feasible schedule. A set of fuzzy rules are proposed to guide the search. The situation we are trying to address is the performance of the system when no feasible solution can be found, and therefore, certain tasks will not be executed. We wish to limit the number of important tasks that are not scheduled.

Segment Fixed Priority Scheduling for Self Suspending Real Time Tasks

DTIC Science & Technology

2016-08-11

Segment-Fixed Priority Scheduling for Self-Suspending Real -Time Tasks Junsung Kim, Department of Electrical and Computer Engineering, Carnegie...4 2.1 Application of a Multi-Segment Self-Suspending Real -Time Task Model ............................. 5 3 Fixed Priority Scheduling...1 Figure 2: A multi-segment self-suspending real -time task model

A new task scheduling algorithm based on value and time for cloud platform

NASA Astrophysics Data System (ADS)

Kuang, Ling; Zhang, Lichen

2017-08-01

Tasks scheduling, a key part of increasing resource utilization and enhancing system performance, is a never outdated problem especially in cloud platforms. Based on the value density algorithm of the real-time task scheduling system and the character of the distributed system, the paper present a new task scheduling algorithm by further studying the cloud technology and the real-time system: Least Level Value Density First (LLVDF). The algorithm not only introduces some attributes of time and value for tasks, it also can describe weighting relationships between these properties mathematically. As this feature of the algorithm, it can gain some advantages to distinguish between different tasks more dynamically and more reasonably. When the scheme was used in the priority calculation of the dynamic task scheduling on cloud platform, relying on its advantage, it can schedule and distinguish tasks with large amounts and many kinds more efficiently. The paper designs some experiments, some distributed server simulation models based on M/M/C model of queuing theory and negative arrivals, to compare the algorithm against traditional algorithm to observe and show its characters and advantages.

Efficacy of long scleral tunnel technique in preventing Ahmed glaucoma valve tube exposure through conjunctiva.

PubMed

Kugu, Suleyman; Erdogan, Gurkan; Sevim, M Sahin; Ozerturk, Yusuf

2015-01-01

To evaluate the efficacy of long scleral tunnel technique used in Ahmed glaucoma valve (AGV) implantation in preventing tube exposure through conjunctiva. Patients of adult age, who were unresponsive to maximum medical treatment and underwent AGV implantation, were divided into two groups and investigated retrospectively. Group 1 consisted of 40 eyes of 38 patients that underwent surgery by long scleral tunnel technique and Group 2 consisted of 38 eyes of 35 patients that underwent implantation by processed pericardium patch graft method. The mean age was 54.8 ± 14.6 years (range 26-68 years) and the mean follow-up duration was 46.7 ± 19.4 months (range 18-76 months) for the patients in Group 1, whereas the mean age was 58.6 ± 16.7 years (range 32-74 years) and mean follow-up period was 43.6 ± 15.7 months (range 20-72 months) for the patients in Group 2 (p > 0.05). In the course of follow-up, tube exposure was detected in one (2.5%) eye in Group 1 and in three (7.9%) eyes in Group 2 (p = 0.042). Long scleral tunnel technique is beneficial in preventing conjunctival tube exposure in AGV implantation surgery.

Initial Experience With the New Ahmed Glaucoma Valve Model M4: Short-term Results.

PubMed

Cvintal, Victor; Moster, Marlene R; Shyu, Andrew P; McDermott, Katie; Ekici, Feyzahan; Pro, Michael J; Waisbourd, Michael

2016-05-01

To evaluate the clinical outcomes of the new Ahmed glaucoma valve (AGV) model M4. The device consists of a porous polyethylene shell designed for improved tissue integration and reduced encapsulation of the plate for better intraocular pressure (IOP) control. Medical records of patients with an AGV M4 implantation between December 1, 2012 and December 31, 2013 were reviewed. The main outcome measure was surgical failure, defined as either (1) IOP<5 mm Hg or >21 mm Hg and/or <20% reduction of IOP at last follow-up visit, (2) a reoperation for glaucoma, and/or (3) loss of light perception. Seventy-five eyes of 73 patients were included. Postoperative IOP at all follow-up visits significantly decreased from a baseline IOP of 31.2 mm Hg (P<0.01). However, IOP increased significantly at 3 months (20.4 mm Hg), 6 months (19.3 mm Hg), and 12 months (20.3 mm Hg) compared with 1 month (13.8 mm Hg) postoperatively (P<0.05). At 6 months and 1 year, the cumulative probability of failure was 32% and 72%, respectively. The AGV M4 effectively reduced IOP in the first postoperative month, but IOP steadily increased thereafter. Consequently, failure rates were high after 1 year of follow-up.

Fault-tolerant dynamic task graph scheduling

DOE Office of Scientific and Technical Information (OSTI.GOV)

Kurt, Mehmet C.; Krishnamoorthy, Sriram; Agrawal, Kunal

2014-11-16

In this paper, we present an approach to fault tolerant execution of dynamic task graphs scheduled using work stealing. In particular, we focus on selective and localized recovery of tasks in the presence of soft faults. We elicit from the user the basic task graph structure in terms of successor and predecessor relationships. The work stealing-based algorithm to schedule such a task graph is augmented to enable recovery when the data and meta-data associated with a task get corrupted. We use this redundancy, and the knowledge of the task graph structure, to selectively recover from faults with low space andmore » time overheads. We show that the fault tolerant design retains the essential properties of the underlying work stealing-based task scheduling algorithm, and that the fault tolerant execution is asymptotically optimal when task re-execution is taken into account. Experimental evaluation demonstrates the low cost of recovery under various fault scenarios.« less

Schedule Risk Assessment

NASA Technical Reports Server (NTRS)

Smith, Greg

2003-01-01

Schedule risk assessments determine the likelihood of finishing on time. Each task in a schedule has a varying degree of probability of being finished on time. A schedule risk assessment quantifies these probabilities by assigning values to each task. This viewgraph presentation contains a flow chart for conducting a schedule risk assessment, and profiles applicable several methods of data analysis.

Interaction of reinforcement schedules, a behavioral prosthesis, and work-related behavior in adults with mental retardation.

PubMed

Saunders, Richard R; McEntee, Julie E; Saunders, Muriel D

2005-01-01

The effects of variable-interval (VI) and fixed-ratio (FR) schedules of reinforcement for work-related behavior and an organizer for the work materials (behavioral prosthesis) were evaluated with 3 adults with severe or profound mental retardation. The participants had been recommended for study because of high rates of off-task and aberrant behavior in their daily vocational training programs. For 2 participants, VI and FR schedules resulted in the same outcome: more aberrant behavior than on-task and off-task behavior combined. The FR schedule nearly eliminated emission of aberrant and off-task behavior by the 3rd participant. Combining the behavioral prosthesis with FR reinforcement (FR+O) increased the proportion of time spent in on-task behavior by all participants under certain FR schedule parameters. Second-by-second analyses of the observation records revealed that FR schedules reduced off-task and aberrant behavior during work sequences (i.e., ratio runs), and FR+O led to a further reduction of these behaviors during postreinforcement pauses. Overall, the results show how organizer and schedule parameters can be adjusted to produce an optimized balance between productivity and reinforcement while undesirable behavior is minimized.

Maximally Expressive Modeling of Operations Tasks

NASA Technical Reports Server (NTRS)

Jaap, John; Richardson, Lea; Davis, Elizabeth

2002-01-01

Planning and scheduling systems organize "tasks" into a timeline or schedule. The tasks are defined within the scheduling system in logical containers called models. The dictionary might define a model of this type as "a system of things and relations satisfying a set of rules that, when applied to the things and relations, produce certainty about the tasks that are being modeled." One challenging domain for a planning and scheduling system is the operation of on-board experiments for the International Space Station. In these experiments, the equipment used is among the most complex hardware ever developed, the information sought is at the cutting edge of scientific endeavor, and the procedures are intricate and exacting. Scheduling is made more difficult by a scarcity of station resources. The models to be fed into the scheduler must describe both the complexity of the experiments and procedures (to ensure a valid schedule) and the flexibilities of the procedures and the equipment (to effectively utilize available resources). Clearly, scheduling International Space Station experiment operations calls for a "maximally expressive" modeling schema.

On scheduling task systems with variable service times

NASA Astrophysics Data System (ADS)

Maset, Richard G.; Banawan, Sayed A.

1993-08-01

Several strategies have been proposed for developing optimal and near-optimal schedules for task systems (jobs consisting of multiple tasks that can be executed in parallel). Most such strategies, however, implicitly assume deterministic task service times. We show that these strategies are much less effective when service times are highly variable. We then evaluate two strategies—one adaptive, one static—that have been proposed for retaining high performance despite such variability. Both strategies are extensions of critical path scheduling, which has been found to be efficient at producing near-optimal schedules. We found the adaptive approach to be quite effective.

Task Scheduling in Desktop Grids: Open Problems

NASA Astrophysics Data System (ADS)

Chernov, Ilya; Nikitina, Natalia; Ivashko, Evgeny

2017-12-01

We survey the areas of Desktop Grid task scheduling that seem to be insufficiently studied so far and are promising for efficiency, reliability, and quality of Desktop Grid computing. These topics include optimal task grouping, "needle in a haystack" paradigm, game-theoretical scheduling, domain-imposed approaches, special optimization of the final stage of the batch computation, and Enterprise Desktop Grids.

A design fix to supervisory control for fault-tolerant scheduling of real-time multiprocessor systems with aperiodic tasks

NASA Astrophysics Data System (ADS)

Devaraj, Rajesh; Sarkar, Arnab; Biswas, Santosh

2015-11-01

In the article 'Supervisory control for fault-tolerant scheduling of real-time multiprocessor systems with aperiodic tasks', Park and Cho presented a systematic way of computing a largest fault-tolerant and schedulable language that provides information on whether the scheduler (i.e., supervisor) should accept or reject a newly arrived aperiodic task. The computation of such a language is mainly dependent on the task execution model presented in their paper. However, the task execution model is unable to capture the situation when the fault of a processor occurs even before the task has arrived. Consequently, a task execution model that does not capture this fact may possibly be assigned for execution on a faulty processor. This problem has been illustrated with an appropriate example. Then, the task execution model of Park and Cho has been modified to strengthen the requirement that none of the tasks are assigned for execution on a faulty processor.

Use of Autologous Scleral Graft in Ahmed Glaucoma Valve Surgery.

PubMed

Wolf, Alvit; Hod, Yair; Buckman, Gila; Stein, Nili; Geyer, Orna

2016-04-01

To compare the efficacy of an autoscleral free-flap graft versus an autoscleral rotational flap graft in Ahmed glaucoma valve (AGV) surgery. Medical records (2005 to 2012) of 51 consecutive patients (51 eyes) who underwent AGV surgery with the use of either an autoscleral free-flap graft or an autoscleral rotational flap graft to cover the external tube at the limbus were retrieved for review. The main outcome measure was the incidence of tube exposure associated with each surgical approach. Twenty-seven consecutive patients (27 eyes) received a free-flap graft and 24 consecutive patients (24 eyes) received a rotational flap graft. The mean follow-up time was 55.6 ± 18.3 months for the former and 24.2± 5 .0 months for the latter (P<0.0001). Two patients in the free-flap group (8.9%) developed tube exposure at 24 and 55 months postoperatively compared with none of the patients in the rotational flap group. Graft thinning without evidence of conjunctival erosion was observed in 15 patients (55%) in the free-flap group and in 7 patients (29.1%) in the rotational flap group. The use of an autoscleral rotational flap graft is an efficacious technique for primary tube patch grafting in routine AGV surgery, and yielded better results than an autoscleral free-flap graft. Its main advantages over donor graft material are availability and lower cost.

Excisional Bleb Revision for Management of Failed Ahmed Glaucoma Valve.

PubMed

Eslami, Yadollah; Fakhraie, Ghasem; Moghimi, Sasan; Zarei, Reza; Mohammadi, Masoud; Nabavi, Amin; Yaseri, Mehdi; Izadi, Ali

2017-12-01

To evaluate the outcome of excisonal bleb revision in patients with failed Ahmed glaucoma valve (AGV). In total, 29 patients with uncontrolled intraocular pressure (IOP) despite of maximal tolerated medical therapy at least 6 months after AGV implantation were enrolled in this prospective interventional case series. Excision of fibrotic tissue around the reservoir with application of mitomycin C 0.02% was performed. IOP, number of glaucoma medications were evaluated at baseline and 1 week and 1, 3, 6, and 12 months postoperatively. Complete and qualified success was defined as IOP≤21 mm Hg with or without glaucoma medications, respectively. Intraoperative and postopervative complications were also recorded. Mean IOP was reduced from 30±4.2 mm Hg at baseline to 19.2±3.1 mm Hg at 12-month follow-up visit (P<0.001). Average number of glaucoma medications was decrease from 3.2±0.5 at baseline to 1.9±0.7 at 12-month follow-up (P<0.001). Qualified and complete success rates at 12-month follow-up were 65.5% and 6.9%, respectively. Younger age and higher number of previous glaucoma surgeries were significantly associated with the failure of excisonal bleb revision. Excisional bleb revision could be considered as a relatively effective alternative option for management of inadequate IOP control after AGV implantation.

Task and Participant Scheduling of Trading Platforms in Vehicular Participatory Sensing Networks

PubMed Central

Shi, Heyuan; Song, Xiaoyu; Gu, Ming; Sun, Jiaguang

2016-01-01

The vehicular participatory sensing network (VPSN) is now becoming more and more prevalent, and additionally has shown its great potential in various applications. A general VPSN consists of many tasks from task, publishers, trading platforms and a crowd of participants. Some literature treats publishers and the trading platform as a whole, which is impractical since they are two independent economic entities with respective purposes. For a trading platform in markets, its purpose is to maximize the profit by selecting tasks and recruiting participants who satisfy the requirements of accepted tasks, rather than to improve the quality of each task. This scheduling problem for a trading platform consists of two parts: which tasks should be selected and which participants to be recruited? In this paper, we investigate the scheduling problem in vehicular participatory sensing with the predictable mobility of each vehicle. A genetic-based trading scheduling algorithm (GTSA) is proposed to solve the scheduling problem. Experiments with a realistic dataset of taxi trajectories demonstrate that GTSA algorithm is efficient for trading platforms to gain considerable profit in VPSN. PMID:27916807

Task and Participant Scheduling of Trading Platforms in Vehicular Participatory Sensing Networks.

PubMed

Shi, Heyuan; Song, Xiaoyu; Gu, Ming; Sun, Jiaguang

2016-11-28

The vehicular participatory sensing network (VPSN) is now becoming more and more prevalent, and additionally has shown its great potential in various applications. A general VPSN consists of many tasks from task, publishers, trading platforms and a crowd of participants. Some literature treats publishers and the trading platform as a whole, which is impractical since they are two independent economic entities with respective purposes. For a trading platform in markets, its purpose is to maximize the profit by selecting tasks and recruiting participants who satisfy the requirements of accepted tasks, rather than to improve the quality of each task. This scheduling problem for a trading platform consists of two parts: which tasks should be selected and which participants to be recruited? In this paper, we investigate the scheduling problem in vehicular participatory sensing with the predictable mobility of each vehicle. A genetic-based trading scheduling algorithm (GTSA) is proposed to solve the scheduling problem. Experiments with a realistic dataset of taxi trajectories demonstrate that GTSA algorithm is efficient for trading platforms to gain considerable profit in VPSN.

A method of operation scheduling based on video transcoding for cluster equipment

NASA Astrophysics Data System (ADS)

Zhou, Haojie; Yan, Chun

2018-04-01

Because of the cluster technology in real-time video transcoding device, the application of facing the massive growth in the number of video assignments and resolution and bit rate of diversity, task scheduling algorithm, and analyze the current mainstream of cluster for real-time video transcoding equipment characteristics of the cluster, combination with the characteristics of the cluster equipment task delay scheduling algorithm is proposed. This algorithm enables the cluster to get better performance in the generation of the job queue and the lower part of the job queue when receiving the operation instruction. In the end, a small real-time video transcode cluster is constructed to analyze the calculation ability, running time, resource occupation and other aspects of various algorithms in operation scheduling. The experimental results show that compared with traditional clustering task scheduling algorithm, task delay scheduling algorithm has more flexible and efficient characteristics.

Using Activity Schedules to Increase On-Task Behavior in Children at Risk for Attention-Deficit/Hyperactivity Disorder

ERIC Educational Resources Information Center

Cirelli, Christe A.; Sidener, Tina M.; Reeve, Kenneth F.; Reeve, Sharon A.

2016-01-01

The effects of activity schedules on on-task and on-schedule behavior were assessed with two boys at risk for attention-deficit/hyperactivity disorder (ADHD) and referred by their public school teachers as having difficulty during independent work time. On-task behavior increased for both participants after two training sessions. Teachers, peers,…

Machine Learning Based Online Performance Prediction for Runtime Parallelization and Task Scheduling

DOE Office of Scientific and Technical Information (OSTI.GOV)

Li, J; Ma, X; Singh, K

2008-10-09

With the emerging many-core paradigm, parallel programming must extend beyond its traditional realm of scientific applications. Converting existing sequential applications as well as developing next-generation software requires assistance from hardware, compilers and runtime systems to exploit parallelism transparently within applications. These systems must decompose applications into tasks that can be executed in parallel and then schedule those tasks to minimize load imbalance. However, many systems lack a priori knowledge about the execution time of all tasks to perform effective load balancing with low scheduling overhead. In this paper, we approach this fundamental problem using machine learning techniques first to generatemore » performance models for all tasks and then applying those models to perform automatic performance prediction across program executions. We also extend an existing scheduling algorithm to use generated task cost estimates for online task partitioning and scheduling. We implement the above techniques in the pR framework, which transparently parallelizes scripts in the popular R language, and evaluate their performance and overhead with both a real-world application and a large number of synthetic representative test scripts. Our experimental results show that our proposed approach significantly improves task partitioning and scheduling, with maximum improvements of 21.8%, 40.3% and 22.1% and average improvements of 15.9%, 16.9% and 4.2% for LMM (a real R application) and synthetic test cases with independent and dependent tasks, respectively.« less

Considerations for Using an Incremental Scheduler for Human Exploration Task Scheduling

NASA Technical Reports Server (NTRS)

Jaap, John; Phillips, Shaun

2005-01-01

As humankind embarks on longer space missions farther from home, the requirements and environments for scheduling the activities performed on these missions are changing. As we begin to prepare for these missions it is appropriate to evaluate the merits and applicability of the different types of scheduling engines. Scheduling engines temporally arrange tasks onto a timeline so that all constraints and objectives are met and resources are not overbooked. Scheduling engines used to schedule space missions fall into three general categories: batch, mixed-initiative, and incremental. This paper presents an assessment of the engine types, a discussion of the impact of human exploration of the moon and Mars on planning and scheduling, and the applicability of the different types of scheduling engines. This paper will pursue the hypothesis that incremental scheduling engines may have a place in the new environment; they have the potential to reduce cost, to improve the satisfaction of those who execute or benefit from a particular timeline (the customers), and to allow astronauts to plan their own tasks.

Investigating the Effect of Voltage-Switching on Low-Energy Task Scheduling in Hard Real-Time Systems

DTIC Science & Technology

2005-01-01

We investigate the effect of voltage-switching on task execution times and energy consumption for dual-speed hard real - time systems , and present a...scheduling algorithm and apply it to two real-life task sets. Our results show that energy can be conserved in embedded real - time systems using energy...aware task scheduling. We also show that switching times have a significant effect on the energy consumed in hard real - time systems .

Heimdall System for MSSS Sensor Tasking

NASA Astrophysics Data System (ADS)

Herz, A.; Jones, B.; Herz, E.; George, D.; Axelrad, P.; Gehly, S.

In Norse Mythology, Heimdall uses his foreknowledge and keen eyesight to keep watch for disaster from his home near the Rainbow Bridge. Orbit Logic and the Colorado Center for Astrodynamics Research (CCAR) at the University of Colorado (CU) have developed the Heimdall System to schedule observations of known and uncharacterized objects and search for new objects from the Maui Space Surveillance Site. Heimdall addresses the current need for automated and optimized SSA sensor tasking driven by factors associated with improved space object catalog maintenance. Orbit Logic and CU developed an initial baseline prototype SSA sensor tasking capability for select sensors at the Maui Space Surveillance Site (MSSS) using STK and STK Scheduler, and then added a new Track Prioritization Component for FiSST-inspired computations for predicted Information Gain and Probability of Detection, and a new SSA-specific Figure-of-Merit (FOM) for optimized SSA sensor tasking. While the baseline prototype addresses automation and some of the multi-sensor tasking optimization, the SSA-improved prototype addresses all of the key elements required for improved tasking leading to enhanced object catalog maintenance. The Heimdall proof-of-concept was demonstrated for MSSS SSA sensor tasking for a 24 hour period to attempt observations of all operational satellites in the unclassified NORAD catalog, observe a small set of high priority GEO targets every 30 minutes, make a sky survey of the GEO belt region accessible to MSSS sensors, and observe particular GEO regions that have a high probability of finding new objects with any excess sensor time. This Heimdall prototype software paves the way for further R&D that will integrate this technology into the MSSS systems for operational scheduling, improve the software's scalability, and further tune and enhance schedule optimization. The Heimdall software for SSA sensor tasking provides greatly improved performance over manual tasking, improved coordinated sensor usage, and tasking schedules driven by catalog improvement goals (reduced overall covariance, etc.). The improved performance also enables more responsive sensor tasking to address external events, newly detected objects, newly detected object activity, and sensor anomalies. Instead of having to wait until the next day's scheduling phase, events can be addressed with new tasking schedules immediately (within seconds or minutes). Perhaps the most important benefit is improved SSA based on an overall improvement to the quality of the space catalog. By driving sensor tasking and scheduling based on predicted Information Gain and other relevant factors, better decisions are made in the application of available sensor resources, leading to an improved catalog and better information about the objects of most interest. The Heimdall software solution provides a configurable, automated system to improve sensor tasking efficiency and responsiveness for SSA applications. The FISST algorithms for Track Prioritization, SSA specific task and resource attributes, Scheduler algorithms, and configurable SSA-specific Figure-of-Merit together provide optimized and tunable scheduling for the Maui Space Surveillance Site and possibly other sites and organizations across the U.S. military and for allies around the world.

Assessment of Filtration Bleb and Endplate Positioning Using Magnetic Resonance Imaging in Eyes Implanted with Long-Tube Glaucoma Drainage Devices.

PubMed

Sano, Ichiya; Tanito, Masaki; Uchida, Koji; Katsube, Takashi; Kitagaki, Hajime; Ohira, Akihiro

2015-01-01

To evaluate ocular fluid filtration and endplate positioning in glaucomatous eyes with long-tube glaucoma drainage devices (GDDs) using magnetic resonance imaging (MRI) and the effects of various factors on postoperative intraocular pressure (IOP). This observational case series included 27 consecutive glaucomatous eyes (18 men, 7 women; mean age ± standard error, 63.0±2.0 years) who underwent GDD implantation (n = 8 Ahmed Glaucoma Valves [AGV] and n = 19 Baerveldt Glaucoma Implants [BGI]). Tubes were inserted into the pars plana in 23 eyes and anterior chamber in 4 eyes. Six months postoperatively, high-resolution orbital images were obtained using 3-Tesla MRI with head-array coils, and the filtering bleb volume, bleb height, and distances between the anterior endplate edge and corneal center or limbus or between the endplate and orbital wall were measured. In MR images obtained by three-dimensional fast imaging employing steady-state acquisition (3D-FIESTA) sequences, the shunt endplate was identified as low-intensity signal, and the filtering bleb was identified as high-intensity signals above and below the endplate in all eyes. The 6-month-postoperative IOP level was correlated negatively with bleb volume (r = -0.4510, P = 0.0182) and bleb height (r = -0.3954, P = 0.0412). The postoperative IOP was significantly (P = 0.0026) lower in BGI-implanted eyes (12.2±0.7 mmHg) than AGV-implanted eyes (16.7±1.2 mmHg); bleb volume was significantly (P = 0.0093) larger in BGI-implanted eyes (478.8±84.2 mm3) than AGV-implanted eyes (161.1±52.3 mm3). Other parameters did not differ. The presence of intraorbital/periocular accumulation of ocular fluid affects postoperative IOP levels in eyes implanted with long-tube GDDs. Larger filtering blebs after BGI than AGI implantations explain lower postoperative IOP levels achieved with BGI than AGV. The findings will contribute to better understanding of IOP reducing mechanism of long-tube GDDs.

Performance comparison of heuristic algorithms for task scheduling in IaaS cloud computing environment.

PubMed

Madni, Syed Hamid Hussain; Abd Latiff, Muhammad Shafie; Abdullahi, Mohammed; Abdulhamid, Shafi'i Muhammad; Usman, Mohammed Joda

2017-01-01

Cloud computing infrastructure is suitable for meeting computational needs of large task sizes. Optimal scheduling of tasks in cloud computing environment has been proved to be an NP-complete problem, hence the need for the application of heuristic methods. Several heuristic algorithms have been developed and used in addressing this problem, but choosing the appropriate algorithm for solving task assignment problem of a particular nature is difficult since the methods are developed under different assumptions. Therefore, six rule based heuristic algorithms are implemented and used to schedule autonomous tasks in homogeneous and heterogeneous environments with the aim of comparing their performance in terms of cost, degree of imbalance, makespan and throughput. First Come First Serve (FCFS), Minimum Completion Time (MCT), Minimum Execution Time (MET), Max-min, Min-min and Sufferage are the heuristic algorithms considered for the performance comparison and analysis of task scheduling in cloud computing.

Performance comparison of heuristic algorithms for task scheduling in IaaS cloud computing environment

PubMed Central

Madni, Syed Hamid Hussain; Abd Latiff, Muhammad Shafie; Abdullahi, Mohammed; Usman, Mohammed Joda

2017-01-01

Cloud computing infrastructure is suitable for meeting computational needs of large task sizes. Optimal scheduling of tasks in cloud computing environment has been proved to be an NP-complete problem, hence the need for the application of heuristic methods. Several heuristic algorithms have been developed and used in addressing this problem, but choosing the appropriate algorithm for solving task assignment problem of a particular nature is difficult since the methods are developed under different assumptions. Therefore, six rule based heuristic algorithms are implemented and used to schedule autonomous tasks in homogeneous and heterogeneous environments with the aim of comparing their performance in terms of cost, degree of imbalance, makespan and throughput. First Come First Serve (FCFS), Minimum Completion Time (MCT), Minimum Execution Time (MET), Max-min, Min-min and Sufferage are the heuristic algorithms considered for the performance comparison and analysis of task scheduling in cloud computing. PMID:28467505

An expert system for planning and scheduling in a telerobotic environment

NASA Technical Reports Server (NTRS)

Ntuen, Celestine A.; Park, Eui H.

1991-01-01

A knowledge based approach to assigning tasks to multi-agents working cooperatively in jobs that require a telerobot in the loop was developed. The generality of the approach allows for such a concept to be applied in a nonteleoperational domain. The planning architecture known as the task oriented planner (TOP) uses the principle of flow mechanism and the concept of planning by deliberation to preserve and use knowledge about a particular task. The TOP is an open ended architecture developed with a NEXPERT expert system shell and its knowledge organization allows for indirect consultation at various levels of task abstraction. Considering that a telerobot operates in a hostile and nonstructured environment, task scheduling should respond to environmental changes. A general heuristic was developed for scheduling jobs with the TOP system. The technique is not to optimize a given scheduling criterion as in classical job and/or flow shop problems. For a teleoperation job schedule, criteria are situation dependent. A criterion selection is fuzzily embedded in the task-skill matrix computation. However, goal achievement with minimum expected risk to the human operator is emphasized.

VAXELN Experimentation: Programming a Real-Time Periodic Task Dispatcher Using VAXELN Ada 1.1

DTIC Science & Technology

1987-11-01

synchronization to the SQM and VAXELN semaphores. Based on real-time scheduling theory, the optimal rate-monotonic scheduling algorithm [Lui 73...schedulability test based on the rate-monotonic algorithm , namely task-lumping [Sha 871, was necessary to cal- culate the theoretically expected schedulability...8217 Guide Digital Equipment Corporation, Maynard, MA, 1986. [Lui 73] Liu, C.L., Layland, J.W. Scheduling Algorithms for Multi-programming in a Hard-Real-Time

Utilizing Novel Non-traditional Sensor Tasking Approaches to Enhance the Space Situational Awareness Picture Maintained by the Space Surveillance Network

NASA Astrophysics Data System (ADS)

Herz, A.; Herz, E.; Center, K.; George, P.; Axelrad, P.; Mutschler, S.; Jones, B.

2016-09-01

The Space Surveillance Network (SSN) is tasked with the increasingly difficult mission of detecting, tracking, cataloging and identifying artificial objects orbiting the Earth, including active and inactive satellites, spent rocket bodies, and fragmented debris. Much of the architecture and operations of the SSN are limited and outdated. Efforts are underway to modernize some elements of the systems. Even so, the ability to maintain the best current Space Situational Awareness (SSA) picture and identify emerging events in a timely fashion could be significantly improved by leveraging non-traditional sensor sites. Orbit Logic, the University of Colorado and the University of Texas at Austin are developing an innovative architecture and operations concept to coordinate the tasking and observation information processing of non - traditional assets based on information-theoretic approaches. These confirmed tasking schedules and the resulting data can then be used to "inform" the SSN tasking process. The 'Heimdall Web' system is comprised of core tasking optimization components and accompanying Web interfaces within a secure, split architecture that will for the first time allow non-traditional sensors to support SSA and improve SSN tasking. Heimdall Web application components appropriately score/prioritize space catalog objects based on covariance, priority, observability, expected information gain, and probability of detect - then coordinate an efficient sensor observation schedule for non-SSN sensors contributing to the overall SSA picture maintained by the Joint Space Operations Center (JSpOC). The Heimdall Web Ops concept supports sensor participation levels of "Scheduled", "Tasked" and "Contributing". Scheduled and Tasked sensors are provided optimized observation schedules or object tracking lists from central algorithms, while Contributing sensors review and select from a list of "desired track objects". All sensors are "Web Enabled" for tasking and feedback, supplying observation schedules, confirmed observations and related data back to Heimdall Web to complete the feedback loop for the next scheduling iteration.

Sort-Mid tasks scheduling algorithm in grid computing.

PubMed

Reda, Naglaa M; Tawfik, A; Marzok, Mohamed A; Khamis, Soheir M

2015-11-01

Scheduling tasks on heterogeneous resources distributed over a grid computing system is an NP-complete problem. The main aim for several researchers is to develop variant scheduling algorithms for achieving optimality, and they have shown a good performance for tasks scheduling regarding resources selection. However, using of the full power of resources is still a challenge. In this paper, a new heuristic algorithm called Sort-Mid is proposed. It aims to maximizing the utilization and minimizing the makespan. The new strategy of Sort-Mid algorithm is to find appropriate resources. The base step is to get the average value via sorting list of completion time of each task. Then, the maximum average is obtained. Finally, the task has the maximum average is allocated to the machine that has the minimum completion time. The allocated task is deleted and then, these steps are repeated until all tasks are allocated. Experimental tests show that the proposed algorithm outperforms almost other algorithms in terms of resources utilization and makespan.

Sort-Mid tasks scheduling algorithm in grid computing

PubMed Central

Reda, Naglaa M.; Tawfik, A.; Marzok, Mohamed A.; Khamis, Soheir M.

2014-01-01

Scheduling tasks on heterogeneous resources distributed over a grid computing system is an NP-complete problem. The main aim for several researchers is to develop variant scheduling algorithms for achieving optimality, and they have shown a good performance for tasks scheduling regarding resources selection. However, using of the full power of resources is still a challenge. In this paper, a new heuristic algorithm called Sort-Mid is proposed. It aims to maximizing the utilization and minimizing the makespan. The new strategy of Sort-Mid algorithm is to find appropriate resources. The base step is to get the average value via sorting list of completion time of each task. Then, the maximum average is obtained. Finally, the task has the maximum average is allocated to the machine that has the minimum completion time. The allocated task is deleted and then, these steps are repeated until all tasks are allocated. Experimental tests show that the proposed algorithm outperforms almost other algorithms in terms of resources utilization and makespan. PMID:26644937

Research on schedulers for astronomical observatories

NASA Astrophysics Data System (ADS)

Colome, Josep; Colomer, Pau; Guàrdia, Josep; Ribas, Ignasi; Campreciós, Jordi; Coiffard, Thierry; Gesa, Lluis; Martínez, Francesc; Rodler, Florian

2012-09-01

The main task of a scheduler applied to astronomical observatories is the time optimization of the facility and the maximization of the scientific return. Scheduling of astronomical observations is an example of the classical task allocation problem known as the job-shop problem (JSP), where N ideal tasks are assigned to M identical resources, while minimizing the total execution time. A problem of higher complexity, called the Flexible-JSP (FJSP), arises when the tasks can be executed by different resources, i.e. by different telescopes, and it focuses on determining a routing policy (i.e., which machine to assign for each operation) other than the traditional scheduling decisions (i.e., to determine the starting time of each operation). In most cases there is no single best approach to solve the planning system and, therefore, various mathematical algorithms (Genetic Algorithms, Ant Colony Optimization algorithms, Multi-Objective Evolutionary algorithms, etc.) are usually considered to adapt the application to the system configuration and task execution constraints. The scheduling time-cycle is also an important ingredient to determine the best approach. A shortterm scheduler, for instance, has to find a good solution with the minimum computation time, providing the system with the capability to adapt the selected task to varying execution constraints (i.e., environment conditions). We present in this contribution an analysis of the task allocation problem and the solutions currently in use at different astronomical facilities. We also describe the schedulers for three different projects (CTA, CARMENES and TJO) where the conclusions of this analysis are applied to develop a suitable routine.

Enhancing independent time-management skills of individuals with mental retardation using a Palmtop personal computer.

PubMed

Davies, Daniel K; Stock, Steven E; Wehmeyer, Michael L

2002-10-01

Achieving greater independence for individuals with mental retardation depends upon the acquisition of several key skills, including time-management and scheduling skills. The ability to perform tasks according to a schedule is essential to domains like independent living and employment. The use of a portable schedule prompting system to increase independence and self-regulation in time-management for individuals with mental retardation was examined. Twelve people with mental retardation participated in a comparison of their use of the technology system to perform tasks on a schedule with use of a written schedule. Results demonstrated the utility of a Palmtop computer with schedule prompting software to increase independence in the performance of vocational and daily living tasks by individuals with mental retardation.

Telematic Problems of Unmanned Vehicles Positioning at Container Terminals and Warehouses

NASA Astrophysics Data System (ADS)

Kwasniowski, Stanisław; Zajac, Mateusz; Zajac, Paweł

This paper describes the issues of transshipment container terminals operations, in the light of the development of this kind of transport. An increase in handling requires an expansion of stacking yard and automation of handling and transport processes. The development in this area first and foremost depends on modern handling technologies and automatic identification systems. AGV trucks play a key role in in those systems. The role of universities is to promote innovative technologies. Paper [2] contains the status of intermodal terminals development in Poland, which was awarded the prize of the Minister of Infrastructure of Poland in the field of "organization and management." The paper contains a detailed description of the principles of positioning, control and propulsion of AGV vehicles. The content was developed to make it understandable to logisticians responsible for the implementation question in Poland.

Automatic generation of efficient orderings of events for scheduling applications

NASA Technical Reports Server (NTRS)

Morris, Robert A.

1994-01-01

In scheduling a set of tasks, it is often not known with certainty how long a given event will take. We call this duration uncertainty. Duration uncertainty is a primary obstacle to the successful completion of a schedule. If a duration of one task is longer than expected, the remaining tasks are delayed. The delay may result in the abandonment of the schedule itself, a phenomenon known as schedule breakage. One response to schedule breakage is on-line, dynamic rescheduling. A more recent alternative is called proactive rescheduling. This method uses statistical data about the durations of events in order to anticipate the locations in the schedule where breakage is likely prior to the execution of the schedule. It generates alternative schedules at such sensitive points, which can be then applied by the scheduler at execution time, without the delay incurred by dynamic rescheduling. This paper proposes a technique for making proactive error management more effective. The technique is based on applying a similarity-based method of clustering to the problem of identifying similar events in a set of events.

Load Balancing in Cloud Computing Environment Using Improved Weighted Round Robin Algorithm for Nonpreemptive Dependent Tasks.

PubMed

Devi, D Chitra; Uthariaraj, V Rhymend

2016-01-01

Cloud computing uses the concepts of scheduling and load balancing to migrate tasks to underutilized VMs for effectively sharing the resources. The scheduling of the nonpreemptive tasks in the cloud computing environment is an irrecoverable restraint and hence it has to be assigned to the most appropriate VMs at the initial placement itself. Practically, the arrived jobs consist of multiple interdependent tasks and they may execute the independent tasks in multiple VMs or in the same VM's multiple cores. Also, the jobs arrive during the run time of the server in varying random intervals under various load conditions. The participating heterogeneous resources are managed by allocating the tasks to appropriate resources by static or dynamic scheduling to make the cloud computing more efficient and thus it improves the user satisfaction. Objective of this work is to introduce and evaluate the proposed scheduling and load balancing algorithm by considering the capabilities of each virtual machine (VM), the task length of each requested job, and the interdependency of multiple tasks. Performance of the proposed algorithm is studied by comparing with the existing methods.

Load Balancing in Cloud Computing Environment Using Improved Weighted Round Robin Algorithm for Nonpreemptive Dependent Tasks

PubMed Central

Devi, D. Chitra; Uthariaraj, V. Rhymend

2016-01-01

Cloud computing uses the concepts of scheduling and load balancing to migrate tasks to underutilized VMs for effectively sharing the resources. The scheduling of the nonpreemptive tasks in the cloud computing environment is an irrecoverable restraint and hence it has to be assigned to the most appropriate VMs at the initial placement itself. Practically, the arrived jobs consist of multiple interdependent tasks and they may execute the independent tasks in multiple VMs or in the same VM's multiple cores. Also, the jobs arrive during the run time of the server in varying random intervals under various load conditions. The participating heterogeneous resources are managed by allocating the tasks to appropriate resources by static or dynamic scheduling to make the cloud computing more efficient and thus it improves the user satisfaction. Objective of this work is to introduce and evaluate the proposed scheduling and load balancing algorithm by considering the capabilities of each virtual machine (VM), the task length of each requested job, and the interdependency of multiple tasks. Performance of the proposed algorithm is studied by comparing with the existing methods. PMID:26955656

Maximally Expressive Modeling

NASA Technical Reports Server (NTRS)

Jaap, John; Davis, Elizabeth; Richardson, Lea

2004-01-01

Planning and scheduling systems organize tasks into a timeline or schedule. Tasks are logically grouped into containers called models. Models are a collection of related tasks, along with their dependencies and requirements, that when met will produce the desired result. One challenging domain for a planning and scheduling system is the operation of on-board experiments for the International Space Station. In these experiments, the equipment used is among the most complex hardware ever developed; the information sought is at the cutting edge of scientific endeavor; and the procedures are intricate and exacting. Scheduling is made more difficult by a scarcity of station resources. The models to be fed into the scheduler must describe both the complexity of the experiments and procedures (to ensure a valid schedule) and the flexibilities of the procedures and the equipment (to effectively utilize available resources). Clearly, scheduling International Space Station experiment operations calls for a maximally expressive modeling schema.

Novel Hybrid Scheduling Technique for Sensor Nodes with Mixed Criticality Tasks.

PubMed

Micea, Mihai-Victor; Stangaciu, Cristina-Sorina; Stangaciu, Valentin; Curiac, Daniel-Ioan

2017-06-26

Sensor networks become increasingly a key technology for complex control applications. Their potential use in safety- and time-critical domains has raised the need for task scheduling mechanisms specially adapted to sensor node specific requirements, often materialized in predictable jitter-less execution of tasks characterized by different criticality levels. This paper offers an efficient scheduling solution, named Hybrid Hard Real-Time Scheduling (H²RTS), which combines a static, clock driven method with a dynamic, event driven scheduling technique, in order to provide high execution predictability, while keeping a high node Central Processing Unit (CPU) utilization factor. From the detailed, integrated schedulability analysis of the H²RTS, a set of sufficiency tests are introduced and demonstrated based on the processor demand and linear upper bound metrics. The performance and correct behavior of the proposed hybrid scheduling technique have been extensively evaluated and validated both on a simulator and on a sensor mote equipped with ARM7 microcontroller.

Real-time design with peer tasks

NASA Technical Reports Server (NTRS)

Goforth, Andre; Howes, Norman R.; Wood, Jonathan D.; Barnes, Michael J.

1995-01-01

We introduce a real-time design methodology for large scale, distributed, parallel architecture, real-time systems (LDPARTS), as an alternative to those methods using rate or dead-line monotonic analysis. In our method the fundamental units of prioritization, work items, are domain specific objects with timing requirements (deadlines) found in user's specification. A work item consists of a collection of tasks of equal priority. Current scheduling theories are applied with artifact deadlines introduced by the designer whereas our method schedules work items to meet user's specification deadlines (sometimes called end-to-end deadlines). Our method supports these scheduling properties. Work item scheduling is based on domain specific importance instead of task level urgency and still meets as many user specification deadlines as can be met by scheduling tasks with respect to urgency. Second, the minimum (closest) on-line deadline that can be guaranteed for a work item of highest importance, scheduled at run time, is approximately the inverse of the throughput, measured in work items per second. Third, throughput is not degraded during overload and instead of resorting to task shedding during overload, the designer can specify which work items to shed. We prove these properties in a mathematical model.

Emergency response nurse scheduling with medical support robot by multi-agent and fuzzy technique.

PubMed

Kono, Shinya; Kitamura, Akira

2015-08-01

In this paper, a new co-operative re-scheduling method corresponding the medical support tasks that the time of occurrence can not be predicted is described, assuming robot can co-operate medical activities with the nurse. Here, Multi-Agent-System (MAS) is used for the co-operative re-scheduling, in which Fuzzy-Contract-Net (FCN) is applied to the robots task assignment for the emergency tasks. As the simulation results, it is confirmed that the re-scheduling results by the proposed method can keep the patients satisfaction and decrease the work load of the nurse.

Underwater Robot Task Planning Using Multi-Objective Meta-Heuristics

PubMed Central

Landa-Torres, Itziar; Manjarres, Diana; Bilbao, Sonia; Del Ser, Javier

2017-01-01

Robotics deployed in the underwater medium are subject to stringent operational conditions that impose a high degree of criticality on the allocation of resources and the schedule of operations in mission planning. In this context the so-called cost of a mission must be considered as an additional criterion when designing optimal task schedules within the mission at hand. Such a cost can be conceived as the impact of the mission on the robotic resources themselves, which range from the consumption of battery to other negative effects such as mechanic erosion. This manuscript focuses on this issue by devising three heuristic solvers aimed at efficiently scheduling tasks in robotic swarms, which collaborate together to accomplish a mission, and by presenting experimental results obtained over realistic scenarios in the underwater environment. The heuristic techniques resort to a Random-Keys encoding strategy to represent the allocation of robots to tasks and the relative execution order of such tasks within the schedule of certain robots. The obtained results reveal interesting differences in terms of Pareto optimality and spread between the algorithms considered in the benchmark, which are insightful for the selection of a proper task scheduler in real underwater campaigns. PMID:28375160

Underwater Robot Task Planning Using Multi-Objective Meta-Heuristics.

PubMed

Landa-Torres, Itziar; Manjarres, Diana; Bilbao, Sonia; Del Ser, Javier

2017-04-04

Robotics deployed in the underwater medium are subject to stringent operational conditions that impose a high degree of criticality on the allocation of resources and the schedule of operations in mission planning. In this context the so-called cost of a mission must be considered as an additional criterion when designing optimal task schedules within the mission at hand. Such a cost can be conceived as the impact of the mission on the robotic resources themselves, which range from the consumption of battery to other negative effects such as mechanic erosion. This manuscript focuses on this issue by devising three heuristic solvers aimed at efficiently scheduling tasks in robotic swarms, which collaborate together to accomplish a mission, and by presenting experimental results obtained over realistic scenarios in the underwater environment. The heuristic techniques resort to a Random-Keys encoding strategy to represent the allocation of robots to tasks and the relative execution order of such tasks within the schedule of certain robots. The obtained results reveal interesting differences in terms of Pareto optimality and spread between the algorithms considered in the benchmark, which are insightful for the selection of a proper task scheduler in real underwater campaigns.

OGUPSA sensor scheduling architecture and algorithm

NASA Astrophysics Data System (ADS)

Zhang, Zhixiong; Hintz, Kenneth J.

1996-06-01

This paper introduces a new architecture for a sensor measurement scheduler as well as a dynamic sensor scheduling algorithm called the on-line, greedy, urgency-driven, preemptive scheduling algorithm (OGUPSA). OGUPSA incorporates a preemptive mechanism which uses three policies, (1) most-urgent-first (MUF), (2) earliest- completed-first (ECF), and (3) least-versatile-first (LVF). The three policies are used successively to dynamically allocate and schedule and distribute a set of arriving tasks among a set of sensors. OGUPSA also can detect the failure of a task to meet a deadline as well as generate an optimal schedule in the sense of minimum makespan for a group of tasks with the same priorities. A side benefit is OGUPSA's ability to improve dynamic load balance among all sensors while being a polynomial time algorithm. Results of a simulation are presented for a simple sensor system.

Enabling New Operations Concepts for Lunar and Mars Exploration

NASA Astrophysics Data System (ADS)

Jaap, John; Maxwell, Theresa

2005-02-01

The planning and scheduling of human space activities is an expensive and time-consuming task that seldom provides the crew with the control, flexibility, or insight that they need. During the past thirty years, scheduling software has seen only incremental improvements; however, software limitations continue to prevent even evolutionary improvements in the ``operations concept'' that is used for human space missions. Space missions are planned on the ground long before they are executed in space, and the crew has little input or influence on the schedule. In recent years the crew has been presented with a ``job jar'' of activities that they can do whenever they have time, but the contents of the jar is limited to tasks that do not use scarce shared resources and do not have external timing constraints. Consequently, the crew has no control over the schedule of the majority of their own tasks. As humans venture farther from earth for longer durations, it will become imperative that they have the ability to plan and schedule not only their own activities, but also the unattended activities of the systems, equipment, and robots on the journey with them. Significant software breakthroughs are required to enable the change in the operations concept. The crew does not have the time to build or modify the schedule by hand. They only need to issue a request to schedule a task and the system should automatically do the rest. Of course, the crew should not be required to build the complete schedule. Controllers on the ground should contribute the models and schedules where they have the better knowledge. The system must allow multiple simultaneous users, some on earth and some in space. The Mission Operations Laboratory at NASA's Marshall Space Flight Center has been researching and prototyping a modeling schema, scheduling engine, and system architecture that can enable the needed paradigm shift - it can make the crew autonomous. This schema and engine can be the core of a planning and scheduling system that would enable multiple planners, some on the earth and some in space, to build one integrated timeline. Its modeling schema can capture all the task requirements; its scheduling engine can build the schedule automatically; and its architecture can allow those (on earth and in space) with the best knowledge of the tasks to schedule them. This paper describes the enabling technology and proposes an operations concept for astronauts autonomously scheduling their activities and the activities around them.

Enabling New Operations Concepts for Lunar and Mars Exploration

NASA Technical Reports Server (NTRS)

Jaap, John; Maxwell, Theresa

2005-01-01

The planning and scheduling of human space activities is an expensive and time-consuming task that seldom provides the crew with the control, flexibility, or insight that they need. During the past thirty years, scheduling software has seen only incremental improvements; however, software limitations continue to prevent even evolutionary improvements in the operations concept that is used for human space missions. Space missions are planned on the ground long before they are executed in space, and the crew has little input or influence on the schedule. In recent years the crew has been presented with a job jar of activities that they can do whenever they have time, but the contents of the jar is limited to tasks that do not use scarce shared resources and do not have external timing constraints. Consequently, the crew has no control over the schedule of the majority of their own tasks. As humans venture farther from earth for longer durations, it will become imperative that they have the ability to plan and schedule not only their own activities, but also the unattended activities of the systems, equipment, and robots on the journey with them. Significant software breakthroughs are required to enable the change in the operations concept. The crew does not have the time to build or modify the schedule by hand. They only need to issue a request to schedule a task and the system should automatically do the rest. Of course, the crew should not be required to build the complete schedule. Controllers on the ground should contribute the models and schedules where they have the better knowledge. The system must allow multiple simultaneous users, some on earth and some in space. The Mission Operations Laboratory at NASA's Marshall Space flight Center has been researching and prototyping a modeling schema, scheduling engine, and system architecture that can enable the needed paradigm shift - it can make the crew autonomous. This schema and engine can be the core of a planning and scheduling system that would enable multiple planners, some on the earth and some in space, to build one integrated timeline. Its modeling schema can capture all the task requirements; its scheduling engine can build the schedule automatically, and its architecture can allow those (on earth and in space) with the best knowledge of the tasks to schedule them. This paper describes the enabling technology and proposes an operations concept for astronauts autonomously scheduling their activities and the activities around them.

The Results of the Use of Ahmed Valve in Refractory Glaucoma Surgery

PubMed Central

Bikbov, Mukharram Mukhtaramovich

2015-01-01

ABSTRACT The treatment of refractory glaucoma (RG) is challenging. The commonly adopted strategy in RG treatment is a glaucoma drainage device (GDD) implantation, which despite its radical nature may not always provide the desired intraocular pressure (IOP) levels for a long term. This review is based on the scientific literature on Ahmed glaucoma valve (AGV) implantation for refractory glaucoma. The technique of AGV implantation is described and data for both the types, FP7 and FP8 performance are presented. The outcome with adjunct antimetabolite and anti-VEGF drugs are also highlighted. An insight is given about experimental and histological examinations of the filtering bleb encapsulation. The article also describes various complications and measures to prevent them. How to cite this article: Bikbov MM, Khusnitdinov II. The Results of the Use of Ahmed Valve in Refractory Glaucoma Surgery. J Curr Glaucoma Pract 2015;9(3):86-91. PMID:26997843

Novel Hybrid Scheduling Technique for Sensor Nodes with Mixed Criticality Tasks

PubMed Central

Micea, Mihai-Victor; Stangaciu, Cristina-Sorina; Stangaciu, Valentin; Curiac, Daniel-Ioan

2017-01-01

Sensor networks become increasingly a key technology for complex control applications. Their potential use in safety- and time-critical domains has raised the need for task scheduling mechanisms specially adapted to sensor node specific requirements, often materialized in predictable jitter-less execution of tasks characterized by different criticality levels. This paper offers an efficient scheduling solution, named Hybrid Hard Real-Time Scheduling (H2RTS), which combines a static, clock driven method with a dynamic, event driven scheduling technique, in order to provide high execution predictability, while keeping a high node Central Processing Unit (CPU) utilization factor. From the detailed, integrated schedulability analysis of the H2RTS, a set of sufficiency tests are introduced and demonstrated based on the processor demand and linear upper bound metrics. The performance and correct behavior of the proposed hybrid scheduling technique have been extensively evaluated and validated both on a simulator and on a sensor mote equipped with ARM7 microcontroller. PMID:28672856

A sustainable genetic algorithm for satellite resource allocation

NASA Technical Reports Server (NTRS)

Abbott, R. J.; Campbell, M. L.; Krenz, W. C.

1995-01-01

A hybrid genetic algorithm is used to schedule tasks for 8 satellites, which can be modelled as a robot whose task is to retrieve objects from a two dimensional field. The objective is to find a schedule that maximizes the value of objects retrieved. Typical of the real-world tasks to which this corresponds is the scheduling of ground contacts for a communications satellite. An important feature of our application is that the amount of time available for running the scheduler is not necessarily known in advance. This requires that the scheduler produce reasonably good results after a short period but that it also continue to improve its results if allowed to run for a longer period. We satisfy this requirement by developing what we call a sustainable genetic algorithm.

Multiresource allocation and scheduling for periodic soft real-time applications

NASA Astrophysics Data System (ADS)

Gopalan, Kartik; Chiueh, Tzi-cker

2001-12-01

Real-time applications that utilize multiple system resources, such as CPU, disks, and network links, require coordinated scheduling of these resources in order to meet their end-to-end performance requirements. Most state-of-the-art operating systems support independent resource allocation and deadline-driven scheduling but lack coordination among multiple heterogeneous resources. This paper describes the design and implementation of an Integrated Real-time Resource Scheduler (IRS) that performs coordinated allocation and scheduling of multiple heterogeneous resources on the same machine for periodic soft real-time application. The principal feature of IRS is a heuristic multi-resource allocation algorithm that reserves multiple resources for real-time applications in a manner that can maximize the number of applications admitted into the system in the long run. At run-time, a global scheduler dispatches the tasks of the soft real-time application to individual resource schedulers according to the precedence constraints between tasks. The individual resource schedulers, which could be any deadline based schedulers, can make scheduling decisions locally and yet collectively satisfy a real-time application's performance requirements. The tightness of overall timing guarantees is ultimately determined by the properties of individual resource schedulers. However, IRS maximizes overall system resource utilization efficiency by coordinating deadline assignment across multiple tasks in a soft real-time application.

Outcomes of using a sutureless bovine pericardial patch graft for Ahmed glaucoma valve implantation.

PubMed

Quaranta, Luciano; Riva, Ivano; Floriani, Irene C

2013-01-01

To evaluate the long-term outcomes of a surgical technique using a sutureless bovine pericardial patch graft for the implantation of an Ahmed glaucoma valve (AGV). 
 This was a pilot study on patients with primary open-angle glaucoma refractory to repeated surgical filtering procedures. All patients underwent AGV implant technique using a sutureless bovine pericardial patch graft. The pericardial membrane was cut using an ordinary corneal trephine with a diameter of 9.0 or 10.0 mm. The anterior part of the tube was covered with the graft and kept in place with fibrin glue. Subsequently, the cap was stitched all around the tube and the dissected conjunctiva was laid over it. Intraocular pressure (IOP) and complications were evaluated 1 week and 1, 3, 6, 12, and 24 months after surgery.
 The procedure was used to treat 20 eyes of 20 consecutive patients (12 men and 8 women: mean age [SD] 64.8 [7.8] years). Mean IOP was 28.1 mm Hg (SD 4.9) at baseline and decreased to 14.9 mm Hg (SD 1.5) 24 months after surgery (p<0.001). The overall mean number of topical medications was 3.1 (SD 0.5) at baseline and decreased to 1.4 (SD 0.8) after 24 months (p<0.001). During follow-up, there was no conjunctival erosion, thinning of pericardial patch graft over the tube, or tube exposure; no signs of endophthalmitis were recorded.
 The results suggest that the sutureless technique using a bovine pericardial graft patch is a safe and rapid procedure for AGV implantation.

Evaluation of Ahmed glaucoma valve implantation through a needle-generated scleral tunnel in Mexican children with glaucoma.

PubMed

Albis-Donado, Oscar; Gil-Carrasco, Félix; Romero-Quijada, Rafael; Thomas, Ravi

2010-01-01

To evaluate the results and extrusion rates of the Ahmed glaucoma valve (AGV) implantation through a needle-generated scleral tunnel, without a tube-covering patch, in children. A retrospective review of the charts of 106 Mexican children implanted with 128 AGVs operated between 1994 and 2002, with the needle track technique, at our institution, with at least six months follow up was done. Main outcome measures were intraocular pressure (IOP) control, tube extrusions or exposure and other complications. Kaplan-Meier analysis demonstrated a 96.9% survival rate at six months, 82.4% at one year, 78.7% at two years, 70% at three years and 41.6% at four years. Total success at the last follow-up (IOP between 6 and 21 mm Hg without medications) was achieved in 30 eyes (23.5%), 58 eyes (45.3%) had qualified success (only topical hypotensive drugs) and 40 eyes (31.3%) were failures. The mean pre- and post-operative IOP at the last follow up was 28.4 mmHg (SD 9.3) and 14.5 mmHg (SD 6.3), respectively. No tube extrusions or exposures were observed. Tube-related complications included five retractions, a lens touch and a transitory endothelial touch. The risk of failure increased if the eye had any complication or previous glaucoma surgeries. Medium-term IOP control in Mexican children with glaucoma can be achieved with AGV implantation using a needle-generated tunnel, without constructing a scleral flap or using a patch to cover the tube. There were no tube extrusions, nor any tube exposures with this technique.

Serial intracameral visualization of the Ahmed glaucoma valve tube by anterior segment optical coherence tomography.

PubMed

Lopilly Park, H-Y; Jung, K I; Park, C K

2012-09-01

To investigate serial changes of the Ahmed glaucoma valve (AGV) implant tube in the anterior chamber by anterior segment optical coherence tomography (AS-OCT). Patients who had received AGV implantation without complications (n=48) were included in this study. Each patient received follow-up examinations including AS-OCT at days 1 and 2, week 1, and months 1, 3, 6, and 12. Tube parameters were defined to measure its length and position. The intracameral length of the tube was from the tip of the bevel-edged tube to the sclerolimbal junction. The distance between the extremity of the tube and the anterior iris surface (T-I distance), and the angle between the tube and the posterior endothelial surface of the cornea (T-C angle) were defined. Factors that were related to tube parameters were analysed by multiple regression analysis. The mean change in tube length was -0.20 ± 0.17 mm, indicating that the tube length shortened from the initial inserted length. The mean T-I distance change was 0.11 ± 0.07 mm and the mean T-C angle change was -6.7 ± 5.6°. Uveitic glaucoma and glaucoma following penetrating keratoplasty showed the most changes in tube parameters. By multiple regression analysis, diagnosis of glaucoma including uveitic glaucoma (P=0.049) and glaucoma following penetrating keratoplasty (P=0.008) were related to the change of intracameral tube length. These results suggest that the length and position of the AGV tube changes after surgery. The change was prominent in uveitic glaucoma and glaucoma following penetrating keratoplasty.

A new parallel DNA algorithm to solve the task scheduling problem based on inspired computational model.

PubMed

Wang, Zhaocai; Ji, Zuwen; Wang, Xiaoming; Wu, Tunhua; Huang, Wei

2017-12-01

As a promising approach to solve the computationally intractable problem, the method based on DNA computing is an emerging research area including mathematics, computer science and molecular biology. The task scheduling problem, as a well-known NP-complete problem, arranges n jobs to m individuals and finds the minimum execution time of last finished individual. In this paper, we use a biologically inspired computational model and describe a new parallel algorithm to solve the task scheduling problem by basic DNA molecular operations. In turn, we skillfully design flexible length DNA strands to represent elements of the allocation matrix, take appropriate biological experiment operations and get solutions of the task scheduling problem in proper length range with less than O(n 2 ) time complexity. Copyright © 2017. Published by Elsevier B.V.

An algorithm for a single machine scheduling problem with sequence dependent setup times and scheduling windows

NASA Technical Reports Server (NTRS)

Moore, J. E.

1975-01-01

An enumeration algorithm is presented for solving a scheduling problem similar to the single machine job shop problem with sequence dependent setup times. The scheduling problem differs from the job shop problem in two ways. First, its objective is to select an optimum subset of the available tasks to be performed during a fixed period of time. Secondly, each task scheduled is constrained to occur within its particular scheduling window. The algorithm is currently being used to develop typical observational timelines for a telescope that will be operated in earth orbit. Computational times associated with timeline development are presented.

TTSA: An Effective Scheduling Approach for Delay Bounded Tasks in Hybrid Clouds.

PubMed

Yuan, Haitao; Bi, Jing; Tan, Wei; Zhou, MengChu; Li, Bo Hu; Li, Jianqiang

2017-11-01

The economy of scale provided by cloud attracts a growing number of organizations and industrial companies to deploy their applications in cloud data centers (CDCs) and to provide services to users around the world. The uncertainty of arriving tasks makes it a big challenge for private CDC to cost-effectively schedule delay bounded tasks without exceeding their delay bounds. Unlike previous studies, this paper takes into account the cost minimization problem for private CDC in hybrid clouds, where the energy price of private CDC and execution price of public clouds both show the temporal diversity. Then, this paper proposes a temporal task scheduling algorithm (TTSA) to effectively dispatch all arriving tasks to private CDC and public clouds. In each iteration of TTSA, the cost minimization problem is modeled as a mixed integer linear program and solved by a hybrid simulated-annealing particle-swarm-optimization. The experimental results demonstrate that compared with the existing methods, the optimal or suboptimal scheduling strategy produced by TTSA can efficiently increase the throughput and reduce the cost of private CDC while meeting the delay bounds of all the tasks.

A General Cross-Layer Cloud Scheduling Framework for Multiple IoT Computer Tasks.

PubMed

Wu, Guanlin; Bao, Weidong; Zhu, Xiaomin; Zhang, Xiongtao

2018-05-23

The diversity of IoT services and applications brings enormous challenges to improving the performance of multiple computer tasks' scheduling in cross-layer cloud computing systems. Unfortunately, the commonly-employed frameworks fail to adapt to the new patterns on the cross-layer cloud. To solve this issue, we design a new computer task scheduling framework for multiple IoT services in cross-layer cloud computing systems. Specifically, we first analyze the features of the cross-layer cloud and computer tasks. Then, we design the scheduling framework based on the analysis and present detailed models to illustrate the procedures of using the framework. With the proposed framework, the IoT services deployed in cross-layer cloud computing systems can dynamically select suitable algorithms and use resources more effectively to finish computer tasks with different objectives. Finally, the algorithms are given based on the framework, and extensive experiments are also given to validate its effectiveness, as well as its superiority.

The Design of a Real Time Operating System for a Fault Tolerant Microcomputer

DTIC Science & Technology

1986-12-01

Scheduler then enqueues all the new jobs for the new frame. Upon completion of the Purge and Task Scheduler routines the Cycle Interrupt Handler returns...the scheduling of new tasks in a new minor cycle to make room for the new jobs . The purge operation will usually not remove the same number of jobs each

Time-critical multirate scheduling using contemporary real-time operating system services

NASA Technical Reports Server (NTRS)

Eckhardt, D. E., Jr.

1983-01-01

Although real-time operating systems provide many of the task control services necessary to process time-critical applications (i.e., applications with fixed, invariant deadlines), it may still be necessary to provide a scheduling algorithm at a level above the operating system in order to coordinate a set of synchronized, time-critical tasks executing at different cyclic rates. The scheduling requirements for such applications and develops scheduling algorithms using services provided by contemporary real-time operating systems.

An Optimal Static Scheduling Algorithm for Hard Real-Time Systems Specified in a Prototyping Language

DTIC Science & Technology

1989-12-01

to construct because the mechanism is a dispatching procedure. Since all nonpreemptive schedules are contained in the set of all preemptive schedules...the optimal value of T’.. in the preemptive case is at least a lower bound on the optimal T., for the nonpreemptive schedules. This principle is the...adapt to changes in the enviro.nment. In hard real-time systems, tasks are also distinguished as preemptable and nonpreemptable . A task is preemptable

Hybrid Symbiotic Organisms Search Optimization Algorithm for Scheduling of Tasks on Cloud Computing Environment.

PubMed

Abdullahi, Mohammed; Ngadi, Md Asri

2016-01-01

Cloud computing has attracted significant attention from research community because of rapid migration rate of Information Technology services to its domain. Advances in virtualization technology has made cloud computing very popular as a result of easier deployment of application services. Tasks are submitted to cloud datacenters to be processed on pay as you go fashion. Task scheduling is one the significant research challenges in cloud computing environment. The current formulation of task scheduling problems has been shown to be NP-complete, hence finding the exact solution especially for large problem sizes is intractable. The heterogeneous and dynamic feature of cloud resources makes optimum task scheduling non-trivial. Therefore, efficient task scheduling algorithms are required for optimum resource utilization. Symbiotic Organisms Search (SOS) has been shown to perform competitively with Particle Swarm Optimization (PSO). The aim of this study is to optimize task scheduling in cloud computing environment based on a proposed Simulated Annealing (SA) based SOS (SASOS) in order to improve the convergence rate and quality of solution of SOS. The SOS algorithm has a strong global exploration capability and uses fewer parameters. The systematic reasoning ability of SA is employed to find better solutions on local solution regions, hence, adding exploration ability to SOS. Also, a fitness function is proposed which takes into account the utilization level of virtual machines (VMs) which reduced makespan and degree of imbalance among VMs. CloudSim toolkit was used to evaluate the efficiency of the proposed method using both synthetic and standard workload. Results of simulation showed that hybrid SOS performs better than SOS in terms of convergence speed, response time, degree of imbalance, and makespan.

Hybrid Symbiotic Organisms Search Optimization Algorithm for Scheduling of Tasks on Cloud Computing Environment

PubMed Central

Abdullahi, Mohammed; Ngadi, Md Asri

2016-01-01

Cloud computing has attracted significant attention from research community because of rapid migration rate of Information Technology services to its domain. Advances in virtualization technology has made cloud computing very popular as a result of easier deployment of application services. Tasks are submitted to cloud datacenters to be processed on pay as you go fashion. Task scheduling is one the significant research challenges in cloud computing environment. The current formulation of task scheduling problems has been shown to be NP-complete, hence finding the exact solution especially for large problem sizes is intractable. The heterogeneous and dynamic feature of cloud resources makes optimum task scheduling non-trivial. Therefore, efficient task scheduling algorithms are required for optimum resource utilization. Symbiotic Organisms Search (SOS) has been shown to perform competitively with Particle Swarm Optimization (PSO). The aim of this study is to optimize task scheduling in cloud computing environment based on a proposed Simulated Annealing (SA) based SOS (SASOS) in order to improve the convergence rate and quality of solution of SOS. The SOS algorithm has a strong global exploration capability and uses fewer parameters. The systematic reasoning ability of SA is employed to find better solutions on local solution regions, hence, adding exploration ability to SOS. Also, a fitness function is proposed which takes into account the utilization level of virtual machines (VMs) which reduced makespan and degree of imbalance among VMs. CloudSim toolkit was used to evaluate the efficiency of the proposed method using both synthetic and standard workload. Results of simulation showed that hybrid SOS performs better than SOS in terms of convergence speed, response time, degree of imbalance, and makespan. PMID:27348127

Research on Scheduling Algorithm for Multi-satellite and Point Target Task on Swinging Mode

NASA Astrophysics Data System (ADS)

Wang, M.; Dai, G.; Peng, L.; Song, Z.; Chen, G.

2012-12-01

Nowadays, using satellite in space to observe ground is an important and major method to obtain ground information. With the development of the scientific technology in the field of space, many fields such as military and economic and other areas have more and more requirement of space technology because of the benefits of the satellite's widespread, timeliness and unlimited of area and country. And at the same time, because of the wide use of all kinds of satellites, sensors, repeater satellites and ground receiving stations, ground control system are now facing great challenge. Therefore, how to make the best value of satellite resources so as to make full use of them becomes an important problem of ground control system. Satellite scheduling is to distribute the resource to all tasks without conflict to obtain the scheduling result so as to complete as many tasks as possible to meet user's requirement under considering the condition of the requirement of satellites, sensors and ground receiving stations. Considering the size of the task, we can divide tasks into point task and area task. This paper only considers point targets. In this paper, a description of satellite scheduling problem and a chief introduction of the theory of satellite scheduling are firstly made. We also analyze the restriction of resource and task in scheduling satellites. The input and output flow of scheduling process are also chiefly described in the paper. On the basis of these analyses, we put forward a scheduling model named as multi-variable optimization model for multi-satellite and point target task on swinging mode. In the multi-variable optimization model, the scheduling problem is transformed the parametric optimization problem. The parameter we wish to optimize is the swinging angle of every time-window. In the view of the efficiency and accuracy, some important problems relating the satellite scheduling such as the angle relation between satellites and ground targets, positive and negative swinging angle and the computation of time window are analyzed and discussed. And many strategies to improve the efficiency of this model are also put forward. In order to solve the model, we bring forward the conception of activity sequence map. By using the activity sequence map, the activity choice and the start time of the activity can be divided. We also bring forward three neighborhood operators to search the result space. The front movement remaining time and the back movement remaining time are used to analyze the feasibility to generate solution from neighborhood operators. Lastly, the algorithm to solve the problem and model is put forward based genetic algorithm. Population initialization, crossover operator, mutation operator, individual evaluation, collision decrease operator, select operator and collision elimination operator is designed in the paper. Finally, the scheduling result and the simulation for a practical example on 5 satellites and 100 point targets with swinging mode is given, and the scheduling performances are also analyzed while the swinging angle in 0, 5, 10, 15, 25. It can be shown by the result that the model and the algorithm are more effective than those ones without swinging mode.

Cloud computing task scheduling strategy based on differential evolution and ant colony optimization

NASA Astrophysics Data System (ADS)

Ge, Junwei; Cai, Yu; Fang, Yiqiu

2018-05-01

This paper proposes a task scheduling strategy DEACO based on the combination of Differential Evolution (DE) and Ant Colony Optimization (ACO), aiming at the single problem of optimization objective in cloud computing task scheduling, this paper combines the shortest task completion time, cost and load balancing. DEACO uses the solution of the DE to initialize the initial pheromone of ACO, reduces the time of collecting the pheromone in ACO in the early, and improves the pheromone updating rule through the load factor. The proposed algorithm is simulated on cloudsim, and compared with the min-min and ACO. The experimental results show that DEACO is more superior in terms of time, cost, and load.

Hybrid glowworm swarm optimization for task scheduling in the cloud environment

NASA Astrophysics Data System (ADS)

Zhou, Jing; Dong, Shoubin

2018-06-01

In recent years many heuristic algorithms have been proposed to solve task scheduling problems in the cloud environment owing to their optimization capability. This article proposes a hybrid glowworm swarm optimization (HGSO) based on glowworm swarm optimization (GSO), which uses a technique of evolutionary computation, a strategy of quantum behaviour based on the principle of neighbourhood, offspring production and random walk, to achieve more efficient scheduling with reasonable scheduling costs. The proposed HGSO reduces the redundant computation and the dependence on the initialization of GSO, accelerates the convergence and more easily escapes from local optima. The conducted experiments and statistical analysis showed that in most cases the proposed HGSO algorithm outperformed previous heuristic algorithms to deal with independent tasks.

Characterizing and Mitigating Work Time Inflation in Task Parallel Programs

DOE PAGES

Olivier, Stephen L.; de Supinski, Bronis R.; Schulz, Martin; ...

2013-01-01

Task parallelism raises the level of abstraction in shared memory parallel programming to simplify the development of complex applications. However, task parallel applications can exhibit poor performance due to thread idleness, scheduling overheads, and work time inflation – additional time spent by threads in a multithreaded computation beyond the time required to perform the same work in a sequential computation. We identify the contributions of each factor to lost efficiency in various task parallel OpenMP applications and diagnose the causes of work time inflation in those applications. Increased data access latency can cause significant work time inflation in NUMA systems.more » Our locality framework for task parallel OpenMP programs mitigates this cause of work time inflation. Our extensions to the Qthreads library demonstrate that locality-aware scheduling can improve performance up to 3X compared to the Intel OpenMP task scheduler.« less

Imaging Tasks Scheduling for High-Altitude Airship in Emergency Condition Based on Energy-Aware Strategy

PubMed Central

Zhimeng, Li; Chuan, He; Dishan, Qiu; Jin, Liu; Manhao, Ma

2013-01-01

Aiming to the imaging tasks scheduling problem on high-altitude airship in emergency condition, the programming models are constructed by analyzing the main constraints, which take the maximum task benefit and the minimum energy consumption as two optimization objectives. Firstly, the hierarchy architecture is adopted to convert this scheduling problem into three subproblems, that is, the task ranking, value task detecting, and energy conservation optimization. Then, the algorithms are designed for the sub-problems, and the solving results are corresponding to feasible solution, efficient solution, and optimization solution of original problem, respectively. This paper makes detailed introduction to the energy-aware optimization strategy, which can rationally adjust airship's cruising speed based on the distribution of task's deadline, so as to decrease the total energy consumption caused by cruising activities. Finally, the application results and comparison analysis show that the proposed strategy and algorithm are effective and feasible. PMID:23864822

Expert mission planning and replanning scheduling system for NASA KSC payload operations

NASA Technical Reports Server (NTRS)

Pierce, Roger

1987-01-01

EMPRESS (Expert Mission Planning and REplanning Scheduling System) is an expert system created to assist payload mission planners at Kennedy in the long range planning and scheduling of horizontal payloads for space shuttle flights. Using the current flight manifest, these planners develop mission and payload schedules detailing all processing to be performed in the Operations and Checkout building at Kennedy. With the EMPRESS system, schedules are generated quickly using standard flows that represent the tasks and resources required to process a specific horizontal carrier. Resources can be tracked and resource conflicts can be determined and resolved interactively. Constraint relationships between tasks are maintained and can be enforced when a task is moved or rescheduled. The domain, structure, and functionality of the EMPRESS system is briefly designed. The limitations of the EMPRESS system are described as well as improvements expected with the EMPRESS-2 development.

Immunological Effect of aGV Rabies Vaccine Administered Using the Essen and Zagreb Regimens: A Double-Blind, Randomized Clinical Trial.

PubMed

Miao, Li; Shi, Liwei; Yang, Yi; Yan, Kunming; Sun, Hongliang; Mo, Zhaojun; Li, Li

2018-04-01

This study evaluated the immunological effect of an aGV rabies virus strain using the Essen and Zagreb immunization programs. A total of 1,944 subjects were enrolled and divided into three groups: the Essen test group, Essen control group, and Zagreb test group. Neutralizing antibody levels and antibody seroconversion rates were determined at 7 and 14 days after the initial inoculations and then 14 days after the final inoculation in all of the subjects. The seroconversion rates for the Essen test group, Essen control group, and Zagreb test group, which were assessed 7 days after the first dosing in a susceptible population, were 35.74%, 26.92%, and 45.49%, respectively, and at 14 days, the seroconversion rates in this population were 100%, 100%, and 99.63%, respectively. At 14 days after the final dosing, the seroconversion rates were 100% in all three of the groups. The neutralizing serum antibody levels of the Essen test group, Essen control group, and Zagreb test group at 7 days after the first dosing in the susceptible population were 0.37, 0.26, and 0.56 IU/mL, respectively, and at 14 days after the initial dosing, these levels were 16.71, 13.85, and 16.80 IU/mL. At 14 days after the final dosing, the neutralizing antibody levels were 22.9, 16.3, and 18.62 IU/mL, respectively. The results of this study suggested that the aGV rabies vaccine using the Essen program resulted in a good serum immune response, and the seroconversion rates and the neutralizing antibody levels generated with the Zagreb regimen were higher than those with the Essen regimen when measured 7 days after the first dose.

Evaluation of Ahmed glaucoma valve implantation through a needle-generated scleral tunnel in Mexican children with glaucoma

PubMed Central

Albis-Donado, Oscar; Gil-Carrasco, Félix; Romero-Quijada, Rafael; Thomas, Ravi

2010-01-01

Purpose: To evaluate the results and extrusion rates of the Ahmed glaucoma valve (AGV) implantation through a needle-generated scleral tunnel, without a tube-covering patch, in children. Materials and Methods: A retrospective review of the charts of 106 Mexican children implanted with 128 AGVs operated between 1994 and 2002, with the needle track technique, at our institution, with at least six months follow up was done. Main outcome measures were intraocular pressure (IOP) control, tube extrusions or exposure and other complications. Results: Kaplan-Meier analysis demonstrated a 96.9% survival rate at six months, 82.4% at one year, 78.7% at two years, 70% at three years and 41.6% at four years. Total success at the last follow-up (IOP between 6 and 21 mm Hg without medications) was achieved in 30 eyes (23.5%), 58 eyes (45.3%) had qualified success (only topical hypotensive drugs) and 40 eyes (31.3%) were failures. The mean pre- and post-operative IOP at the last follow up was 28.4 mmHg (SD 9.3) and 14.5 mmHg (SD 6.3), respectively. No tube extrusions or exposures were observed. Tube-related complications included five retractions, a lens touch and a transitory endothelial touch. The risk of failure increased if the eye had any complication or previous glaucoma surgeries. Conclusion: Medium-term IOP control in Mexican children with glaucoma can be achieved with AGV implantation using a needle-generated tunnel, without constructing a scleral flap or using a patch to cover the tube. There were no tube extrusions, nor any tube exposures with this technique. PMID:20689189

Assessment of conditions affecting surgical success of Ahmed glaucoma valve implants in glaucoma secondary to different uveitis etiologies in adults.

PubMed

Sungur, G; Yakin, M; Eksioglu, U; Satana, B; Ornek, F

2017-10-01

PurposeThere is little known about the long-term efficacy and safety of Ahmed glaucoma valve (AGV) implant and about the conditions affecting surgical success in uveitic glaucoma (UG).Patients and methodsThe charts of adult patients with UG who underwent AGV implantation from 2006 to 2015 were reviewed retrospectively.ResultsData of 46 eyes of 39 patients were evaluated. Mean follow-up was 51.93±23.08 months. Mean preoperative IOP was 37.05±9.62 mm Hg and mean number of preoperative topical anti-glaucomatous medications was 2.98±0.27. One eye (2%) was defined as failure because of implant extraction surgery. In the rest of the eyes, intraocular pressure (IOP) was under control with or without anti-glaucomatous medications during follow-up. The cumulative probability of complete success (IOP control without medications) was 78% at 6 months, 76% at 1 year, 71% at 2 years, 66% at 3 years, and 63% at 4 years (95% confidence interval, 61.24-87.81). The cumulative probability of eyes without complication was 64% at 6 months, 48% at 12 months, 44% at 24 months, 41% at 36 months, and 38% at 48 months (95% confidence interval, 34.64-62.85). Complete success was lower in eyes with previous ocular surgery than the eyes without (P=0.061) and it was lower in eyes with active inflammation at the time of surgery than the eyes without (P=0.011).ConclusionAGV implantation is an effective and safe alternative method in the management of UG, especially when it is performed as a primary surgical option and when no inflammation is present preoperatively.

Ahmed glaucoma valve implantation with tube insertion through the ciliary sulcus in pseudophakic/aphakic eyes.

PubMed

Eslami, Yadolla; Mohammadi, Massood; Fakhraie, Ghasem; Zarei, Reza; Moghimi, Sasan

2014-02-01

To report the efficacy and safety of Ahmed glaucoma valve (AGV) insertion into the ciliary sulcus in pseudophakic/aphakic patients. A chart review was done on patients with uncontrolled glaucoma, who underwent AGV implantation with tube inserted into the ciliary sulcus. Baseline intraocular pressure (IOP) and number of medications were compared with that of postoperative follow-up visits. Surgical success was defined as last IOP <21 mm Hg and 20% reduction in IOP, without further surgery for complications or glaucoma control, and without loss of light perception. Postoperative complications were recorded. Twenty-three eyes of 23 patients were recruited with the mean follow-up of 9 months (range, 3 to 24 mo). The mean (SD) age of patients was 49.9 (16.9) years (range, 22 to 80 years). The mean (SD) IOP (mm Hg) was reduced from 37.9 (12.4) before surgery to 16.2 (3.6) at the last follow-up visit (P<0.001). The mean (SD) number of medications was reduced from 3.3 (0.9) preoperatively to 1 (1.1) at the last follow-up (P<0.001). Success rate was 18/23 (78.6%). Complications included endophthalmitis in 1 eye, tube exposure in 1 diabetic patient, and vitreous tube occlusion in 1 eye. No case of corneal decompensation or graft failure was seen during follow-up. Ciliary sulcus placement of the tube of AGV effectively reduces IOP and medication use in short term. It has the potential to lower corneal complications of anterior chamber tube insertion and avoids the need for pars plana vitrectomy and tube insertion in patients at higher risk of corneal decompensation.

Clinical outcomes of Ahmed glaucoma valve in anterior chamber versus ciliary sulcus.

PubMed

Bayer, A; Önol, M

2017-04-01

PurposeTo evaluate the outcomes of Ahmed glaucoma valve (AGV) tube insertion through the anterior chamber angle (ACA) or through the ciliary sulcus (CS).Patients and methodsIn this case-control study, we retrospectively reviewed the charts of consecutive glaucoma patients who had undergone AGV implantation either through the ACA or the CS between March 2009 and December 2014. The main outcome measures were intraocular pressure (IOP), number of glaucoma medications prescribed, best corrected visual acuity (BCVA), glaucoma type, success rate, complications, and survival ratios. Statistical analysis was carried out using SPSS.ResultsThere were 68 eyes in the ACA group and 35 eyes in the CS group. There were no significant differences between the groups for age, sex, laterality, IOP, preoperative glaucoma medication number, BCVA or glaucoma type (P>0.05). The postoperative follow-up period was 27.2±16.5 months and 30.2±17.7 months for the ACA and the CS groups (P=0.28); IOP values were significantly reduced at the last visit to 16.4±7.2 mm Hg and 14.4±6.8 mm Hg. The difference in the last-visit IOP between the groups was not significant (P=0.06), but the IOP reduction ratio was higher in the CS group (P=0.03). There was no significant difference in the number of postoperative medications (P=0.18). Postoperative complications were similar, but the incidence of flat anterior chamber was higher in the ACA group (P=0.05).ConclusionsThe use of an AGV can control IOP in the majority of cases whether placed in the ACA or the CS. The IOP reduction ratio seemed to be higher in the CS group.

Long-term Outcomes of Ahmed Glaucoma Valve Implantation in Refractory Glaucoma at Farabi Eye Hospital, Tehran, Iran

PubMed Central

Zarei, Reza; Amini, Heidar; Daneshvar, Ramin; Nabi, Fahimeh Naderi; Moghimi, Sasan; Fakhraee, Ghasem; Eslami, Yadollah; Mohammadi, Masoud; Amini, Nima

2016-01-01

Purpose: To describe long-term outcomes and complications of Ahmed glaucoma valve (AGV) implantation in subjects with refractory glaucoma at Farabi Eye Hospital, Tehran, Iran. Materials and Methods: This retrospective cohort study evaluated patient records of all subjects with refractory glaucoma who had undergone AGV implantation up to January 2013. The main outcome measure was the surgical success rate. Complete success was defined as intraocular pressure (IOP) <22 mmHg, without anti-glaucoma medications or additional surgery. Qualified success was IOP <22 mmHg regardless of number of anti-glaucoma medications. In all cases, loss of vision (no light perception) was considered an independent indicator of failure. Data were also collected on intraoperative and postoperative complications. Results: Twenty-eight eyes were included in the study. With a mean follow-up of 48.2 ± 31.7 months (median: 40.50 months; range: 3–124 months), the IOP decreased from a mean preoperative value of 30.8 ± 5.6 mmHg to 20.0 ± 6.4 mmHg at last visit. The number of medications decreased from 3.7 ± 0.4 preoperatively to 2.5 ± 1.1 postoperatively. Cumulative qualified success was achieved in 69% of eyes. Mean time to failure according to qualified success criteria was 92.3 ± 9.4 months. Postoperative complications were recorded in 16 (57.1%) eyes. The most common complication was focal endothelial corneal decompensation at the site of tube-cornea touch. Conclusion: AGV implantation with adjunctive topical anti-glaucoma drops controlled IOP in approximately 70% of eyes with refractory glaucoma with a median of 40.5 months of follow-up. However, complication rates were higher. PMID:26957848

Clinical outcomes of Ahmed glaucoma valve in anterior chamber versus ciliary sulcus

PubMed Central

Bayer, A; Önol, M

2017-01-01

Purpose To evaluate the outcomes of Ahmed glaucoma valve (AGV) tube insertion through the anterior chamber angle (ACA) or through the ciliary sulcus (CS). Patients and methods In this case-control study, we retrospectively reviewed the charts of consecutive glaucoma patients who had undergone AGV implantation either through the ACA or the CS between March 2009 and December 2014. The main outcome measures were intraocular pressure (IOP), number of glaucoma medications prescribed, best corrected visual acuity (BCVA), glaucoma type, success rate, complications, and survival ratios. Statistical analysis was carried out using SPSS. Results There were 68 eyes in the ACA group and 35 eyes in the CS group. There were no significant differences between the groups for age, sex, laterality, IOP, preoperative glaucoma medication number, BCVA or glaucoma type (P>0.05). The postoperative follow-up period was 27.2±16.5 months and 30.2±17.7 months for the ACA and the CS groups (P=0.28); IOP values were significantly reduced at the last visit to 16.4±7.2 mm Hg and 14.4±6.8 mm Hg. The difference in the last-visit IOP between the groups was not significant (P=0.06), but the IOP reduction ratio was higher in the CS group (P=0.03). There was no significant difference in the number of postoperative medications (P=0.18). Postoperative complications were similar, but the incidence of flat anterior chamber was higher in the ACA group (P=0.05). Conclusions The use of an AGV can control IOP in the majority of cases whether placed in the ACA or the CS. The IOP reduction ratio seemed to be higher in the CS group. PMID:27983734

Short term outcome of Ahmed glaucoma valve implantation in management of refractory glaucoma in a tertiary hospital in Oman

PubMed Central

Shah, Manali R.; Khandekar, Rajiv B.; Zutshi, Rajiv; Mahrooqi, Rahima

2013-01-01

Background: We present outcomes of Ahmed Glaucoma Valve (AGV) implantation in treating refractory glaucoma in a tertiary hospital in Oman. Refractory glaucoma was defined as previously failed conventional glaucoma surgery and an uncontrolled intraocular pressure (IOP) of more than 21 mm Hg despite treatment with three topical and/or oral therapy. Materials and Methods: This historical cohort study was conducted in 2010. Details of medical and surgical treatment were recorded. Ophthalmologists examined eyes and performed glaucoma surgeries using AGV. The best corrected distant vision, IOP, and glaucoma medications were prospectively reviewed on 1st day, 1st, 6th, 12th week postoperatively, and at the last follow up. Result: Glaucoma specialists examined and treated 40 eyes with refractory glaucoma of 39 patients (20 males + 19 females). Neo-vascular glaucoma was present in 23 eyes. Vision before surgery was <3/60 in 21 eyes. At 12 weeks, one eye had vision better than 6/12, seven eyes had vision 6/18 to 6/60, and eight eyes had vision 6/60 to 3/60. Mean IOP was reduced from 42.9 (SD 16) to 14.2 (SD 8) and 19.1 (SD 7.8) mmHg at one and 12 weeks after surgery, respectively. At 12 weeks, five (12.5%) eyes had IOP controlled without medication. In 33 (77.5%) eyes, pressure was controlled by using one or two eye drops. The mean number of preoperative anti-glaucoma medications (2.38; SD 1.1) was reduced compared to the mean number of postoperative medications (1.92; SD 0.9) at 12 weeks. Conclusion: We succeeded in reducing visual disabilities and the number of anti-glaucoma medications used to treat refractory glaucoma by AGV surgery. PMID:23772122

Long-term Outcomes of Ahmed Glaucoma Valve Implantation in Refractory Glaucoma at Farabi Eye Hospital, Tehran, Iran.

PubMed

Zarei, Reza; Amini, Heidar; Daneshvar, Ramin; Nabi, Fahimeh Naderi; Moghimi, Sasan; Fakhraee, Ghasem; Eslami, Yadollah; Mohammadi, Masoud; Amini, Nima

2016-01-01

To describe long-term outcomes and complications of Ahmed glaucoma valve (AGV) implantation in subjects with refractory glaucoma at Farabi Eye Hospital, Tehran, Iran. This retrospective cohort study evaluated patient records of all subjects with refractory glaucoma who had undergone AGV implantation up to January 2013. The main outcome measure was the surgical success rate. Complete success was defined as intraocular pressure (IOP) <22 mmHg, without anti-glaucoma medications or additional surgery. Qualified success was IOP <22 mmHg regardless of number of anti-glaucoma medications. In all cases, loss of vision (no light perception) was considered an independent indicator of failure. Data were also collected on intraoperative and postoperative complications. Twenty-eight eyes were included in the study. With a mean follow-up of 48.2 ± 31.7 months (median: 40.50 months; range: 3-124 months), the IOP decreased from a mean preoperative value of 30.8 ± 5.6 mmHg to 20.0 ± 6.4 mmHg at last visit. The number of medications decreased from 3.7 ± 0.4 preoperatively to 2.5 ± 1.1 postoperatively. Cumulative qualified success was achieved in 69% of eyes. Mean time to failure according to qualified success criteria was 92.3 ± 9.4 months. Postoperative complications were recorded in 16 (57.1%) eyes. The most common complication was focal endothelial corneal decompensation at the site of tube-cornea touch. AGV implantation with adjunctive topical anti-glaucoma drops controlled IOP in approximately 70% of eyes with refractory glaucoma with a median of 40.5 months of follow-up. However, complication rates were higher.

Clinical Outcomes of Ahmed Glaucoma Valve Implantation Using Tube Ligation and Removable External Stents

PubMed Central

Lee, Jong Joo; Kim, Dong Myung; Kim, Tae Woo

2009-01-01

Purpose To investigate the immediate and long-term outcomes of Ahmed glaucoma valve (AGV) implantation with silicone tube ligation and removable external stents. Methods This retrospective non-comparative study investigated the outcomes of AGV implantation with silicone tube ligation and removable external stents in 95 eyes (90 patients) with at least 12 months of postoperative follow-up. Qualified success was defined as an intraocular pressure (IOP) of ≤21 mmHg and ≥6 mmHg regardless of anti-glaucoma medication. Those who required additional glaucoma surgery, implant removal or who had phthisis bulbi were considered failures. Hypotony was defined as an IOP of <6 mmHg. Results Mean IOP reduced from 37.1±9.7 mmHg preoperatively to 15.2±5.6 mmHg at 12 months postoperatively (p<0.001). Qualified success was achieved in 84.2% at 1 year. Hypotony with an IOP of <6 mmHg was seen in 8.4% and an IOP of <5 mmHg in 3.2% on the first postoperative day. No case of hypotony required surgical intervention. Suprachoroidal hemorrhage did not occur in this study. When stents were removed on the first postoperative day because of an insufficient IOP decrease, the mean IOP decreased significantly from 42.0 mmHg to 14.1 mmHg (p<0.001) after 1 hour. The most common complication was hyphema, which occurred in 17.9%. Conclusions Hypotony-related early complications requiring surgical intervention were reduced by ligation and external stents in the tube. In addition, early postoperative high IOPs were managed by removing external stents. The described method can prevent postoperative hypotony after AGV implantation and showed long-term success rates comparable to those reported previously. PMID:19568356

Clinical outcomes of Ahmed glaucoma valve implantation using tube ligation and removable external stents.

PubMed

Lee, Jong Joo; Park, Ki Ho; Kim, Dong Myung; Kim, Tae Woo

2009-06-01

To investigate the immediate and long-term outcomes of Ahmed glaucoma valve (AGV) implantation with silicone tube ligation and removable external stents. This retrospective non-comparative study investigated the outcomes of AGV implantation with silicone tube ligation and removable external stents in 95 eyes (90 patients) with at least 12 months of postoperative follow-up. Qualified success was defined as an intraocular pressure (IOP) of or=6 mmHg regardless of anti-glaucoma medication. Those who required additional glaucoma surgery, implant removal or who had phthisis bulbi were considered failures. Hypotony was defined as an IOP of <6 mmHg. Mean IOP reduced from 37.1+/-9.7 mmHg preoperatively to 15.2+/-5.6 mmHg at 12 months postoperatively (p<0.001). Qualified success was achieved in 84.2% at 1 year. Hypotony with an IOP of <6 mmHg was seen in 8.4% and an IOP of <5 mmHg in 3.2% on the first postoperative day. No case of hypotony required surgical intervention. Suprachoroidal hemorrhage did not occur in this study. When stents were removed on the first postoperative day because of an insufficient IOP decrease, the mean IOP decreased significantly from 42.0 mmHg to 14.1 mmHg (p<0.001) after 1 hour. The most common complication was hyphema, which occurred in 17.9%. Hypotony-related early complications requiring surgical intervention were reduced by ligation and external stents in the tube. In addition, early postoperative high IOPs were managed by removing external stents. The described method can prevent postoperative hypotony after AGV implantation and showed long-term success rates comparable to those reported previously.

Scheduling periodic jobs that allow imprecise results

NASA Technical Reports Server (NTRS)

Chung, Jen-Yao; Liu, Jane W. S.; Lin, Kwei-Jay

1990-01-01

The problem of scheduling periodic jobs in hard real-time systems that support imprecise computations is discussed. Two workload models of imprecise computations are presented. These models differ from traditional models in that a task may be terminated any time after it has produced an acceptable result. Each task is logically decomposed into a mandatory part followed by an optional part. In a feasible schedule, the mandatory part of every task is completed before the deadline of the task. The optional part refines the result produced by the mandatory part to reduce the error in the result. Applications are classified as type N and type C, according to undesirable effects of errors. The two workload models characterize the two types of applications. The optional parts of the tasks in an N job need not ever be completed. The resulting quality of each type-N job is measured in terms of the average error in the results over several consecutive periods. A class of preemptive, priority-driven algorithms that leads to feasible schedules with small average error is described and evaluated.

Defense Science Board Task Force Report: The Role of Autonomy in DoD Systems

DTIC Science & Technology

2012-07-01

ASD(R&E) and the Military Services should schedule periodic, on-site collaborations that bring together academia, government and not-for-profit labs...expressing UxV activities, increased problem solving, planning and scheduling capabilities to enable dynamic tasking of distributed UxVs and tools for...industrial, governmental and military. Manufacturing has long exploited planning for logistics and matching product demand to production schedules

In-Space Crew-Collaborative Task Scheduling

NASA Technical Reports Server (NTRS)

Jaap, John; Meyer, Patrick; Davis, Elizabeth; Richardson, Lea

2007-01-01

For all past and current human space missions, the final scheduling of tasks to be done in space has been devoid of crew control, flexibility, and insight. Ground controllers, with minimal input from the crew, schedule the tasks and uplink the timeline to the crew or uplink the command sequences to the hardware. Prior to the International Space Station (ISS), the crew could make requests about tomorrow s timeline, they could omit a task, or they could request that something in the timeline be delayed. This lack of control over one's own schedule has had negative consequences. There is anecdotal consensus among astronauts that control over their own schedules will mitigate the stresses of long duration missions. On ISS, a modicum of crew control is provided by the job jar. Ground controllers prepare a task list (a.k.a. "job jar") of non-conflicting tasks from which jobs can be chosen by the in space crew. Because there is little free time and few interesting non-conflicting activities, the task-list approach provides little relief from the tedium of being micro-managed by the timeline. Scheduling for space missions is a complex and laborious undertaking which usually requires a large cadre of trained specialists and suites of complex software tools. It is a giant leap from today s ground prepared timeline (with a job jar) to full crew control of the timeline. However, technological advances, currently in-work or proposed, make it reasonable to consider scheduling a collaborative effort by the ground-based teams and the in-space crew. Collaboration would allow the crew to make minor adjustments, add tasks according to their preferences, understand the reasons for the placement of tasks on the timeline, and provide them a sense of control. In foreseeable but extraordinary situations, such as a quick response to anomalies and extended or unexpected loss of signal, the crew should have the autonomous ability to make appropriate modifications to the timeline, extend the timeline, or even start over with a new timeline. The Vision for Space Exploration (VSE), currently being pursued by the National Aeronautics and Space Administration (NASA), will send humans to Mars in a few decades. Stresses on the human mind will be exacerbated by the longer durations and greater distances, and it will be imperative to implement stress-reducing innovations such as giving the crew control of their daily activities.

Astronaut Office Scheduling System Software

NASA Technical Reports Server (NTRS)

Brown, Estevancio

2010-01-01

AOSS is a highly efficient scheduling application that uses various tools to schedule astronauts weekly appointment information. This program represents an integration of many technologies into a single application to facilitate schedule sharing and management. It is a Windows-based application developed in Visual Basic. Because the NASA standard office automation load environment is Microsoft-based, Visual Basic provides AO SS developers with the ability to interact with Windows collaboration components by accessing objects models from applications like Outlook and Excel. This also gives developers the ability to create newly customizable components that perform specialized tasks pertaining to scheduling reporting inside the application. With this capability, AOSS can perform various asynchronous tasks, such as gathering/ sending/ managing astronauts schedule information directly to their Outlook calendars at any time.

Distributed Processor/Memory Architectures Design Program

DTIC Science & Technology

1975-02-01

Event Scheduling Plo 31 Globat LAl Message Input Event Sicheduling Fhou ..... ............... 106 32 It tc Iata Representation...298 138 GEX LEX Scheduling Phlmophy ....... ...................... 300 139 Executive Comirol Herarchy... Scheduler Subroutine lnterrelatiomhips . ..... ................. 312 145 Task Scheduler Message Scatuer. . ...... ....................... 315 146

Rabies in southeast Brazil: a change in the epidemiological pattern.

PubMed

Queiroz, Luzia Helena; Favoretto, Silvana Regina; Cunha, Elenice Maria S; Campos, Angélica Cristine A; Lopes, Marissol Cardoso; de Carvalho, Cristiano; Iamamoto, Keila; Araújo, Danielle Bastos; Venditti, Leandro Lima R; Ribeiro, Erica S; Pedro, Wagner André; Durigon, Edison Luiz

2012-01-01

This epidemiological study was conducted using antigenic and genetic characterisation of rabies virus isolates obtained from different animal species in the southeast of Brazil from 1993 to 2007. An alteration in the epidemiological profile was observed. One hundred two samples were tested using a panel of eight monoclonal antibodies, and 94 were genetically characterised by sequencing the nucleoprotein gene. From 1993 to 1997, antigenic variant 2 (AgV-2), related to a rabies virus maintained in dog populations, was responsible for rabies cases in dogs, cats, cattle and horses. Antigenic variant 3 (AgV-3), associated with Desmodus rotundus, was detected in a few cattle samples from rural areas. From 1998 to 2007, rabies virus was detected in bats and urban pets, and four distinct variants were identified. A nucleotide similarity analysis resulted in two primary groups comprising the dog and bat antigenic variants and showing the distinct endemic cycles maintained in the different animal species in this region.

Case study of rotating sonar sensor application in unmanned automated guided vehicle

NASA Astrophysics Data System (ADS)

Chandak, Pravin; Cao, Ming; Hall, Ernest L.

2001-10-01

A single rotating sonar element is used with a restricted angle of sweep to obtain readings to develop a range map for the unobstructed path of an autonomous guided vehicle (AGV). A Polaroid ultrasound transducer element is mounted on a micromotor with an encoder feedback. The motion of this motor is controlled using a Galil DMC 1000 motion control board. The encoder is interfaced with the DMC 1000 board using an intermediate IMC 1100 break-out board. By adjusting the parameters of the Polaroid element, it is possible to obtain range readings at known angles with respect to the center of the robot. The readings are mapped to obtain a range map of the unobstructed path in front of the robot. The idea can be extended to a 360 degree mapping by changing the assembly level programming on the Galil Motion control board. Such a system would be compact and reliable over a range of environments and AGV applications.

The Effect of Self-Regulated and Experimenter-Imposed Practice Schedules on Motor Learning for Tasks of Varying Difficulty

ERIC Educational Resources Information Center

Keetch, Katherine M.; Lee, Timothy D.

2007-01-01

Research suggests that allowing individuals to control their own practice schedule has a positive effect on motor learning. In this experiment we examined the effect of task difficulty and self-regulated practice strategies on motor learning. The task was to move a mouse-operated cursor through pattern arrays that differed in two levels of…

Scheduling techniques in the Request Oriented Scheduling Engine (ROSE)

NASA Technical Reports Server (NTRS)

Zoch, David R.

1991-01-01

Scheduling techniques in the ROSE are presented in the form of the viewgraphs. The following subject areas are covered: agenda; ROSE summary and history; NCC-ROSE task goals; accomplishments; ROSE timeline manager; scheduling concerns; current and ROSE approaches; initial scheduling; BFSSE overview and example; and summary.

Self-powered information measuring wireless networks using the distribution of tasks within multicore processors

NASA Astrophysics Data System (ADS)

Zhuravska, Iryna M.; Koretska, Oleksandra O.; Musiyenko, Maksym P.; Surtel, Wojciech; Assembay, Azat; Kovalev, Vladimir; Tleshova, Akmaral

2017-08-01

The article contains basic approaches to develop the self-powered information measuring wireless networks (SPIM-WN) using the distribution of tasks within multicore processors critical applying based on the interaction of movable components - as in the direction of data transmission as wireless transfer of energy coming from polymetric sensors. Base mathematic model of scheduling tasks within multiprocessor systems was modernized to schedule and allocate tasks between cores of one-crystal computer (SoC) to increase energy efficiency SPIM-WN objects.

A hierarchically distributed architecture for fault isolation expert systems on the space station

NASA Technical Reports Server (NTRS)

Miksell, Steve; Coffer, Sue

1987-01-01

The Space Station Axiomatic Fault Isolating Expert Systems (SAFTIES) system deals with the hierarchical distribution of control and knowledge among independent expert systems doing fault isolation and scheduling of Space Station subsystems. On its lower level, fault isolation is performed on individual subsystems. These fault isolation expert systems contain knowledge about the performance requirements of their particular subsystem and corrective procedures which may be involved in repsonse to certain performance errors. They can control the functions of equipment in their system and coordinate system task schedules. On a higher level, the Executive contains knowledge of all resources, task schedules for all systems, and the relative priority of all resources and tasks. The executive can override any subsystem task schedule in order to resolve use conflicts or resolve errors that require resources from multiple subsystems. Interprocessor communication is implemented using the SAFTIES Communications Interface (SCI). The SCI is an application layer protocol which supports the SAFTIES distributed multi-level architecture.

Scheduling in the Face of Uncertain Resource Consumption and Utility

NASA Technical Reports Server (NTRS)

Frank, Jeremy; Dearden, Richard

2003-01-01

We discuss the problem of scheduling tasks that consume uncertain amounts of a resource with known capacity and where the tasks have uncertain utility. In these circumstances, we would like to find schedules that exceed a lower bound on the expected utility when executed. We show that the problems are NP- complete, and present some results that characterize the behavior of some simple heuristics over a variety of problem classes.

Strategic behavior, workload, and performance in task scheduling

NASA Technical Reports Server (NTRS)

Moray, Neville; Dessouky, Mohamed I.; Kijowski, Brian A.; Adapathya, Ravi

1991-01-01

Scheduling theory is proposed as a normative model for strategic behavior when operators are confronted by several tasks, all of which should be completed within a fixed time span, and when they are free to choose the order in which the tasks should be done. Three experiments are described to investigate the effect of knowing the correct scheduling rule on the efficiency of performance, subjective workload, and choice of strategy under different conditions of time pressure. The most potent effects are from time pressure. The reasons for the weak effect of knowing the rules are discussed, and implications for strategic behavior, displays, and decision aids are indicated.

Design and Analysis of Self-Adapted Task Scheduling Strategies in Wireless Sensor Networks

PubMed Central

Guo, Wenzhong; Xiong, Naixue; Chao, Han-Chieh; Hussain, Sajid; Chen, Guolong

2011-01-01

In a wireless sensor network (WSN), the usage of resources is usually highly related to the execution of tasks which consume a certain amount of computing and communication bandwidth. Parallel processing among sensors is a promising solution to provide the demanded computation capacity in WSNs. Task allocation and scheduling is a typical problem in the area of high performance computing. Although task allocation and scheduling in wired processor networks has been well studied in the past, their counterparts for WSNs remain largely unexplored. Existing traditional high performance computing solutions cannot be directly implemented in WSNs due to the limitations of WSNs such as limited resource availability and the shared communication medium. In this paper, a self-adapted task scheduling strategy for WSNs is presented. First, a multi-agent-based architecture for WSNs is proposed and a mathematical model of dynamic alliance is constructed for the task allocation problem. Then an effective discrete particle swarm optimization (PSO) algorithm for the dynamic alliance (DPSO-DA) with a well-designed particle position code and fitness function is proposed. A mutation operator which can effectively improve the algorithm’s ability of global search and population diversity is also introduced in this algorithm. Finally, the simulation results show that the proposed solution can achieve significant better performance than other algorithms. PMID:22163971

An Optimal Scheduling Algorithm with a Competitive Factor for Real-Time Systems

DTIC Science & Technology

1991-07-29

real - time systems in which the value of a task is proportional to its computation time. The system obtains the value of a given task if the task completes by its deadline. Otherwise, the system obtains no value for the task. When such a system is underloaded (i.e. there exists a schedule for which all tasks meet their deadlines), Dertouzos [6] showed that the earliest deadline first algorithm will achieve 100% of the possible value. We consider the case of a possibly overloaded system and present an algorithm which: 1. behaves like the earliest deadline first

SUMO: operation and maintenance management web tool for astronomical observatories

NASA Astrophysics Data System (ADS)

Mujica-Alvarez, Emma; Pérez-Calpena, Ana; García-Vargas, María. Luisa

2014-08-01

SUMO is an Operation and Maintenance Management web tool, which allows managing the operation and maintenance activities and resources required for the exploitation of a complex facility. SUMO main capabilities are: information repository, assets and stock control, tasks scheduler, executed tasks archive, configuration and anomalies control and notification and users management. The information needed to operate and maintain the system must be initially stored at the tool database. SUMO shall automatically schedule the periodical tasks and facilitates the searching and programming of the non-periodical tasks. Tasks planning can be visualized in different formats and dynamically edited to be adjusted to the available resources, anomalies, dates and other constrains that can arise during daily operation. SUMO shall provide warnings to the users notifying potential conflicts related to the required personal availability or the spare stock for the scheduled tasks. To conclude, SUMO has been designed as a tool to help during the operation management of a scientific facility, and in particular an astronomical observatory. This is done by controlling all operating parameters: personal, assets, spare and supply stocks, tasks and time constrains.

A transportation-scheduling system for managing silvicultural projects

Treesearch

Jorge F. Valenzuela; H. Hakan Balci; Timothy McDonald

2005-01-01

A silvicultural project encompasses tasks such as sitelevel planning, regeneration, harvestin, and stand-tending treatments. an essential problem in managing silvicultural projects is to efficiently schedule the operations while considering project task due dates and costs of moving scarce resources to specific job locations. Transportation costs represent a...

It Is Not Just about the Schedule: Key Factors in Effective Reference Desk Scheduling and Management

ERIC Educational Resources Information Center

Sciammarella, Susan; Fernandes, Maria Isabel; McKay, Devin

2008-01-01

Reference desk scheduling is one of the most challenging tasks in the organizational structure of an academic library. The ability to turn this challenge into a workable and effective function lies with the scheduler and indirectly the cooperation of all librarians scheduled for reference desk service. It is the scheduler's sensitivity to such…

Task path planning, scheduling and learning for free-ranging robot systems

NASA Technical Reports Server (NTRS)

Wakefield, G. Steve

1987-01-01

The development of robotics applications for space operations is often restricted by the limited movement available to guided robots. Free ranging robots can offer greater flexibility than physically guided robots in these applications. Presented here is an object oriented approach to path planning and task scheduling for free-ranging robots that allows the dynamic determination of paths based on the current environment. The system also provides task learning for repetitive jobs. This approach provides a basis for the design of free-ranging robot systems which are adaptable to various environments and tasks.

In-Space Crew-Collaborative Task Scheduling

NASA Technical Reports Server (NTRS)

Jaap, John; Meyer, Patrick; Davis, Elizabeth; Richardson, Lea

2006-01-01

As humans venture farther from Earth for longer durations, it will become essential for those on the journey to have significant control over the scheduling of their own activities as well as the activities of their companion systems and robots. However, the crew will not do all the scheduling; timelines will be the result of collaboration with ground personnel. Emerging technologies such as in-space message buses, delay-tolerant networks, and in-space internet will be the carriers on which the collaboration rides. Advances in scheduling technology, in the areas of task modeling, scheduling engines, and user interfaces will allow the crew to become virtual scheduling experts. New concepts of operations for producing the timeline will allow the crew and the ground support to collaborate while providing safeguards to ensure that the mission will be effectively accomplished without endangering the systems or personnel.

Completable scheduling: An integrated approach to planning and scheduling

NASA Technical Reports Server (NTRS)

Gervasio, Melinda T.; Dejong, Gerald F.

1992-01-01

The planning problem has traditionally been treated separately from the scheduling problem. However, as more realistic domains are tackled, it becomes evident that the problem of deciding on an ordered set of tasks to achieve a set of goals cannot be treated independently of the problem of actually allocating resources to the tasks. Doing so would result in losing the robustness and flexibility needed to deal with imperfectly modeled domains. Completable scheduling is an approach which integrates the two problems by allowing an a priori planning module to defer particular planning decisions, and consequently the associated scheduling decisions, until execution time. This allows a completable scheduling system to maximize plan flexibility by allowing runtime information to be taken into consideration when making planning and scheduling decision. Furthermore, through the criteria of achievability placed on deferred decision, a completable scheduling system is able to retain much of the goal-directedness and guarantees of achievement afforded by a priori planning. The completable scheduling approach is further enhanced by the use of contingent explanation-based learning, which enables a completable scheduling system to learn general completable plans from example and improve its performance through experience. Initial experimental results show that completable scheduling outperforms classical scheduling as well as pure reactive scheduling in a simple scheduling domain.

Individual differences in strategic flight management and scheduling

NASA Technical Reports Server (NTRS)

Wickens, Christopher D.; Raby, Mireille

1991-01-01

A group of 30 instrument-rated pilots was made to fly simulator approaches to three airports under conditions of low, medium, and high workload conditions. An analysis is presently conducted of the difference in discrete task scheduling between the group of 10 highest and 10 lowest performing pilots in the sample; this categorization was based on the mean of various flight-profile measures. The two groups were found to differ from each other only in terms of the time when specific events were conducted, and of the optimality of scheduling for certain high-priority tasks. These results are assessed in view of the relative independence of task-management skills from aircraft-control skills.

ComprehensiveBench: a Benchmark for the Extensive Evaluation of Global Scheduling Algorithms

NASA Astrophysics Data System (ADS)

Pilla, Laércio L.; Bozzetti, Tiago C.; Castro, Márcio; Navaux, Philippe O. A.; Méhaut, Jean-François

2015-10-01

Parallel applications that present tasks with imbalanced loads or complex communication behavior usually do not exploit the underlying resources of parallel platforms to their full potential. In order to mitigate this issue, global scheduling algorithms are employed. As finding the optimal task distribution is an NP-Hard problem, identifying the most suitable algorithm for a specific scenario and comparing algorithms are not trivial tasks. In this context, this paper presents ComprehensiveBench, a benchmark for global scheduling algorithms that enables the variation of a vast range of parameters that affect performance. ComprehensiveBench can be used to assist in the development and evaluation of new scheduling algorithms, to help choose a specific algorithm for an arbitrary application, to emulate other applications, and to enable statistical tests. We illustrate its use in this paper with an evaluation of Charm++ periodic load balancers that stresses their characteristics.

A Chaotic Particle Swarm Optimization-Based Heuristic for Market-Oriented Task-Level Scheduling in Cloud Workflow Systems.

PubMed

Li, Xuejun; Xu, Jia; Yang, Yun

2015-01-01

Cloud workflow system is a kind of platform service based on cloud computing. It facilitates the automation of workflow applications. Between cloud workflow system and its counterparts, market-oriented business model is one of the most prominent factors. The optimization of task-level scheduling in cloud workflow system is a hot topic. As the scheduling is a NP problem, Ant Colony Optimization (ACO) and Particle Swarm Optimization (PSO) have been proposed to optimize the cost. However, they have the characteristic of premature convergence in optimization process and therefore cannot effectively reduce the cost. To solve these problems, Chaotic Particle Swarm Optimization (CPSO) algorithm with chaotic sequence and adaptive inertia weight factor is applied to present the task-level scheduling. Chaotic sequence with high randomness improves the diversity of solutions, and its regularity assures a good global convergence. Adaptive inertia weight factor depends on the estimate value of cost. It makes the scheduling avoid premature convergence by properly balancing between global and local exploration. The experimental simulation shows that the cost obtained by our scheduling is always lower than the other two representative counterparts.

A Chaotic Particle Swarm Optimization-Based Heuristic for Market-Oriented Task-Level Scheduling in Cloud Workflow Systems

PubMed Central

Li, Xuejun; Xu, Jia; Yang, Yun

2015-01-01

Cloud workflow system is a kind of platform service based on cloud computing. It facilitates the automation of workflow applications. Between cloud workflow system and its counterparts, market-oriented business model is one of the most prominent factors. The optimization of task-level scheduling in cloud workflow system is a hot topic. As the scheduling is a NP problem, Ant Colony Optimization (ACO) and Particle Swarm Optimization (PSO) have been proposed to optimize the cost. However, they have the characteristic of premature convergence in optimization process and therefore cannot effectively reduce the cost. To solve these problems, Chaotic Particle Swarm Optimization (CPSO) algorithm with chaotic sequence and adaptive inertia weight factor is applied to present the task-level scheduling. Chaotic sequence with high randomness improves the diversity of solutions, and its regularity assures a good global convergence. Adaptive inertia weight factor depends on the estimate value of cost. It makes the scheduling avoid premature convergence by properly balancing between global and local exploration. The experimental simulation shows that the cost obtained by our scheduling is always lower than the other two representative counterparts. PMID:26357510

Operations mission planner

NASA Technical Reports Server (NTRS)

Biefeld, Eric; Cooper, Lynne

1990-01-01

The findings are documented of the OMP research task, which investigated the applicability of artificial intelligence (AI) technology in support of automated scheduling. The goals of the effort are summarized and the technical accomplishments are highlighted. The OMP task succeeded in identifying how AI technology could be applied and demonstrated an AI-based automated scheduling approach through the OMP prototypes.

Memory consolidation and contextual interference effects with computer games.

PubMed

Shewokis, Patricia A

2003-10-01

Some investigators of the contextual interference effect contend that there is a direct relation between the amount of practice and the contextual interference effect based on the prediction that the improvement in learning tasks in a random practice schedule, compared to a blocked practice schedule, increases in magnitude as the amount of practice during acquisition on the tasks increases. Research using computer games in contextual interference studies has yielded a large effect (f = .50) with a random practice schedule advantage during transfer. These investigations had a total of 36 and 72 acquisition trials, respectively. The present study tested this prediction by having 72 college students, who were randomly assigned to a blocked or random practice schedule, practice 102 trials of three computer-game tasks across three days. After a 24-hr. interval, 6 retention and 5 transfer trials were performed. Dependent variables were time to complete an event in seconds and number of errors. No significant differences were found for retention and transfer. These results are discussed in terms of how the amount of practice, task-related factors, and memory consolidation mediate the contextual interference effect.

Automated Scheduling Via Artificial Intelligence

NASA Technical Reports Server (NTRS)

Biefeld, Eric W.; Cooper, Lynne P.

1991-01-01

Artificial-intelligence software that automates scheduling developed in Operations Mission Planner (OMP) research project. Software used in both generation of new schedules and modification of existing schedules in view of changes in tasks and/or available resources. Approach based on iterative refinement. Although project focused upon scheduling of operations of scientific instruments and other equipment aboard spacecraft, also applicable to such terrestrial problems as scheduling production in factory.

A derived heuristics based multi-objective optimization procedure for micro-grid scheduling

NASA Astrophysics Data System (ADS)

Li, Xin; Deb, Kalyanmoy; Fang, Yanjun

2017-06-01

With the availability of different types of power generators to be used in an electric micro-grid system, their operation scheduling as the load demand changes with time becomes an important task. Besides satisfying load balance constraints and the generator's rated power, several other practicalities, such as limited availability of grid power and restricted ramping of power output from generators, must all be considered during the operation scheduling process, which makes it difficult to decide whether the optimization results are accurate and satisfactory. In solving such complex practical problems, heuristics-based customized optimization algorithms are suggested. However, due to nonlinear and complex interactions of variables, it is difficult to come up with heuristics in such problems off-hand. In this article, a two-step strategy is proposed in which the first task deciphers important heuristics about the problem and the second task utilizes the derived heuristics to solve the original problem in a computationally fast manner. Specifically, the specific operation scheduling is considered from a two-objective (cost and emission) point of view. The first task develops basic and advanced level knowledge bases offline from a series of prior demand-wise optimization runs and then the second task utilizes them to modify optimized solutions in an application scenario. Results on island and grid connected modes and several pragmatic formulations of the micro-grid operation scheduling problem clearly indicate the merit of the proposed two-step procedure.

Incremental Scheduling Engines for Human Exploration of the Cosmos

NASA Technical Reports Server (NTRS)

Jaap, John; Phillips, Shaun

2005-01-01

As humankind embarks on longer space missions farther from home, the requirements and environments for scheduling the activities performed on these missions are changing. As we begin to prepare for these missions it is appropriate to evaluate the merits and applicability of the different types of scheduling engines. Scheduling engines temporally arrange tasks onto a timeline so that all constraints and objectives are met and resources are not overbooked. Scheduling engines used to schedule space missions fall into three general categories: batch, mixed-initiative, and incremental. This paper presents an assessment of the engine types, a discussion of the impact of human exploration of the moon and Mars on planning and scheduling, and the applicability of the different types of scheduling engines. This paper will pursue the hypothesis that incremental scheduling engines may have a place in the new environment; they have the potential to reduce cost, to improve the satisfaction of those who execute or benefit from a particular timeline (the customers), and to allow astronauts to plan their own tasks and those of their companion robots.

Incremental Scheduling Engines: Cost Savings through Automation

NASA Technical Reports Server (NTRS)

Jaap, John; Phillips, Shaun

2005-01-01

As humankind embarks on longer space missions farther from home, the requirements and environments for scheduling the activities performed on these missions are changing. As we begin to prepare for these missions it is appropriate to evaluate the merits and applicability of the different types of scheduling engines. Scheduling engines temporally arrange tasks onto a timeline so that all constraints and ob.jectives are met and resources are not over-booked. Scheduling engines used to schedule space missions fall into three general categories: batch, mixed-initiative, and incremental. This paper, presents an assessment of the engine types, a discussion of the impact of human exploration of the moon and Mars on planning and scheduling, and the applicability of the different types of scheduling engines. This paper will pursue the hypothesis that incremental scheduling engines may have a place in the new environment; they have the potential to reduce cost, to improve the satisfaction of those who execute or benefit from a particular timeline (the customers), and to allow astronauts to plan their own tasks and those of their companion robots.

Maximally Expressive Task Modeling

NASA Technical Reports Server (NTRS)

Japp, John; Davis, Elizabeth; Maxwell, Theresa G. (Technical Monitor)

2002-01-01

Planning and scheduling systems organize "tasks" into a timeline or schedule. The tasks are defined within the scheduling system in logical containers called models. The dictionary might define a model of this type as "a system of things and relations satisfying a set of rules that, when applied to the things and relations, produce certainty about the tasks that are being modeled." One challenging domain for a planning and scheduling system is the operation of on-board experiment activities for the Space Station. The equipment used in these experiments is some of the most complex hardware ever developed by mankind, the information sought by these experiments is at the cutting edge of scientific endeavor, and the procedures for executing the experiments are intricate and exacting. Scheduling is made more difficult by a scarcity of space station resources. The models to be fed into the scheduler must describe both the complexity of the experiments and procedures (to ensure a valid schedule) and the flexibilities of the procedures and the equipment (to effectively utilize available resources). Clearly, scheduling space station experiment operations calls for a "maximally expressive" modeling schema. Modeling even the simplest of activities cannot be automated; no sensor can be attached to a piece of equipment that can discern how to use that piece of equipment; no camera can quantify how to operate a piece of equipment. Modeling is a human enterprise-both an art and a science. The modeling schema should allow the models to flow from the keyboard of the user as easily as works of literature flowed from the pen of Shakespeare. The Ground Systems Department at the Marshall Space Flight Center has embarked on an effort to develop a new scheduling engine that is highlighted by a maximally expressive modeling schema. This schema, presented in this paper, is a synergy of technological advances and domain-specific innovations.

Energy-driven scheduling algorithm for nanosatellite energy harvesting maximization

NASA Astrophysics Data System (ADS)

Slongo, L. K.; Martínez, S. V.; Eiterer, B. V. B.; Pereira, T. G.; Bezerra, E. A.; Paiva, K. V.

2018-06-01

The number of tasks that a satellite may execute in orbit is strongly related to the amount of energy its Electrical Power System (EPS) is able to harvest and to store. The manner the stored energy is distributed within the satellite has also a great impact on the CubeSat's overall efficiency. Most CubeSat's EPS do not prioritize energy constraints in their formulation. Unlike that, this work proposes an innovative energy-driven scheduling algorithm based on energy harvesting maximization policy. The energy harvesting circuit is mathematically modeled and the solar panel I-V curves are presented for different temperature and irradiance levels. Considering the models and simulations, the scheduling algorithm is designed to keep solar panels working close to their maximum power point by triggering tasks in the appropriate form. Tasks execution affects battery voltage, which is coupled to the solar panels through a protection circuit. A software based Perturb and Observe strategy allows defining the tasks to be triggered. The scheduling algorithm is tested in FloripaSat, which is an 1U CubeSat. A test apparatus is proposed to emulate solar irradiance variation, considering the satellite movement around the Earth. Tests have been conducted to show that the scheduling algorithm improves the CubeSat energy harvesting capability by 4.48% in a three orbit experiment and up to 8.46% in a single orbit cycle in comparison with the CubeSat operating without the scheduling algorithm.

Remote Collaboration on Task Scheduling for Humans at Mars

NASA Technical Reports Server (NTRS)

Jaap, John; Meyer, Patrick; Davis, Elizabeth; Richardson, Lea

2006-01-01

As humans venture farther from Earth for longer durations, it will become essential for those on the journey to have significant control over the scheduling of their own activities as well as the activities of their companion systems and robots. However, the crew will not do all the scheduling; timelines will be the result of collaboration with ground personnel. Emerging technologies such as in-space message buses, delay-tolerant networks, and in-space internet will be the carriers on which the collaboration rides. Advances in scheduling technology, in the areas of task modeling, scheduling engines, and user interfaces will allow the crew to become virtual scheduling experts. New concepts of operations for producing the timeline will allow the crew and the ground support to collaborate while providing safeguards to ensure that the mission will be effectively accomplished without endangering the systems or personnel.

In-Space Crew-Collaborative Task Scheduling

NASA Technical Reports Server (NTRS)

Jaap, John; Meyer, Patrick; Davis, Elizabeth; Richardson, Lea

2006-01-01

As humans venture farther from earth for longer durations, it will become essential for those on the journey to have significant control over the scheduling of their own activities as well as the activities of their companion systems and robots. However, there are many reasons why the crew will not do all the scheduling; timelines will be the result of collaboration with ground personnel. Emerging technologies such as in-space message buses, delay-tolerant networks, and in-space internet will be the carriers on which the collaboration rides. Advances in scheduling technology, in the areas of task modeling, scheduling engines, and user interfaces will allow the crew to become virtual scheduling experts. New concepts of operations for producing the timeline will allow the crew and the ground support to collaborate while providing safeguards to ensure that the mission will be effectively accomplished without endangering the systems or personnel.

Rabies Virus in Bats, State of Pará, Brazil, 2005-2011.

PubMed

Pereira, Armando de Souza; Casseb, Livia Medeiros Neves; Barbosa, Taciana Fernandes Souza; Begot, Alberto Lopes; Brito, Roberto Messias Oliveira; Vasconcelos, Pedro Fernando da Costa; Travassos da Rosa, Elizabeth Salbé

2017-08-01

Rabies is an acute, progressive zoonotic viral infection that in general produces a fatal outcome. This disease is responsible for deaths in humans and animals worldwide and, because it can affect all mammals, is considered one of the most important viral infections for public health. This study aimed to determine the prevalence of rabies in bats of different species found in municipalities of the state of Pará from 2005 to 2011. The rabies virus was detected in 12 (0.39%) bats in a total of 3100 analyzed, including hematophagous, frugivorous, and insectivorous bats. Of these, eleven were characterized as AgV3, which is characteristic of the hematophagous bat Desmodus rotundus (E. Geoffroy 1810); one insectivorous animal showed a different profile compatible with the Eptesicus pattern and may therefore be a new antigenic variant. This study identified the need for greater intensification of epidemiological surveillance in municipalities lacking rabies surveillance (silent areas); studies of rabies virus in bats with different alimentary habits, studies investigating the prevalence of AgV3, and prophylactic measures in areas where humans may be infected are also needed.

A new memetic algorithm for mitigating tandem automated guided vehicle system partitioning problem

NASA Astrophysics Data System (ADS)

Pourrahimian, Parinaz

2017-11-01

Automated Guided Vehicle System (AGVS) provides the flexibility and automation demanded by Flexible Manufacturing System (FMS). However, with the growing concern on responsible management of resource use, it is crucial to manage these vehicles in an efficient way in order reduces travel time and controls conflicts and congestions. This paper presents the development process of a new Memetic Algorithm (MA) for optimizing partitioning problem of tandem AGVS. MAs employ a Genetic Algorithm (GA), as a global search, and apply a local search to bring the solutions to a local optimum point. A new Tabu Search (TS) has been developed and combined with a GA to refine the newly generated individuals by GA. The aim of the proposed algorithm is to minimize the maximum workload of the system. After all, the performance of the proposed algorithm is evaluated using Matlab. This study also compared the objective function of the proposed MA with GA. The results showed that the TS, as a local search, significantly improves the objective function of the GA for different system sizes with large and small numbers of zone by 1.26 in average.

Artificial intelligence for the CTA Observatory scheduler

NASA Astrophysics Data System (ADS)

Colomé, Josep; Colomer, Pau; Campreciós, Jordi; Coiffard, Thierry; de Oña, Emma; Pedaletti, Giovanna; Torres, Diego F.; Garcia-Piquer, Alvaro

2014-08-01

The Cherenkov Telescope Array (CTA) project will be the next generation ground-based very high energy gamma-ray instrument. The success of the precursor projects (i.e., HESS, MAGIC, VERITAS) motivated the construction of this large infrastructure that is included in the roadmap of the ESFRI projects since 2008. CTA is planned to start the construction phase in 2015 and will consist of two arrays of Cherenkov telescopes operated as a proposal-driven open observatory. Two sites are foreseen at the southern and northern hemispheres. The CTA observatory will handle several observation modes and will have to operate tens of telescopes with a highly efficient and reliable control. Thus, the CTA planning tool is a key element in the control layer for the optimization of the observatory time. The main purpose of the scheduler for CTA is the allocation of multiple tasks to one single array or to multiple sub-arrays of telescopes, while maximizing the scientific return of the facility and minimizing the operational costs. The scheduler considers long- and short-term varying conditions to optimize the prioritization of tasks. A short-term scheduler provides the system with the capability to adapt, in almost real-time, the selected task to the varying execution constraints (i.e., Targets of Opportunity, health or status of the system components, environment conditions). The scheduling procedure ensures that long-term planning decisions are correctly transferred to the short-term prioritization process for a suitable selection of the next task to execute on the array. In this contribution we present the constraints to CTA task scheduling that helped classifying it as a Flexible Job-Shop Problem case and finding its optimal solution based on Artificial Intelligence techniques. We describe the scheduler prototype that uses a Guarded Discrete Stochastic Neural Network (GDSN), for an easy representation of the possible long- and short-term planning solutions, and Constraint Propagation techniques. A simulation platform, an analysis tool and different test case scenarios for CTA were developed to test the performance of the scheduler and are also described.

VM Capacity-Aware Scheduling within Budget Constraints in IaaS Clouds

PubMed Central

Thanasias, Vasileios; Lee, Choonhwa; Hanif, Muhammad; Kim, Eunsam; Helal, Sumi

2016-01-01

Recently, cloud computing has drawn significant attention from both industry and academia, bringing unprecedented changes to computing and information technology. The infrastructure-as-a-Service (IaaS) model offers new abilities such as the elastic provisioning and relinquishing of computing resources in response to workload fluctuations. However, because the demand for resources dynamically changes over time, the provisioning of resources in a way that a given budget is efficiently utilized while maintaining a sufficing performance remains a key challenge. This paper addresses the problem of task scheduling and resource provisioning for a set of tasks running on IaaS clouds; it presents novel provisioning and scheduling algorithms capable of executing tasks within a given budget, while minimizing the slowdown due to the budget constraint. Our simulation study demonstrates a substantial reduction up to 70% in the overall task slowdown rate by the proposed algorithms. PMID:27501046

VM Capacity-Aware Scheduling within Budget Constraints in IaaS Clouds.

PubMed

Thanasias, Vasileios; Lee, Choonhwa; Hanif, Muhammad; Kim, Eunsam; Helal, Sumi

2016-01-01

Recently, cloud computing has drawn significant attention from both industry and academia, bringing unprecedented changes to computing and information technology. The infrastructure-as-a-Service (IaaS) model offers new abilities such as the elastic provisioning and relinquishing of computing resources in response to workload fluctuations. However, because the demand for resources dynamically changes over time, the provisioning of resources in a way that a given budget is efficiently utilized while maintaining a sufficing performance remains a key challenge. This paper addresses the problem of task scheduling and resource provisioning for a set of tasks running on IaaS clouds; it presents novel provisioning and scheduling algorithms capable of executing tasks within a given budget, while minimizing the slowdown due to the budget constraint. Our simulation study demonstrates a substantial reduction up to 70% in the overall task slowdown rate by the proposed algorithms.

Analysis of tasks for dynamic man/machine load balancing in advanced helicopters

DOE Office of Scientific and Technical Information (OSTI.GOV)

Jorgensen, C.C.

1987-10-01

This report considers task allocation requirements imposed by advanced helicopter designs incorporating mixes of human pilots and intelligent machines. Specifically, it develops an analogy between load balancing using distributed non-homogeneous multiprocessors and human team functions. A taxonomy is presented which can be used to identify task combinations likely to cause overload for dynamic scheduling and process allocation mechanisms. Designer criteria are given for function decomposition, separation of control from data, and communication handling for dynamic tasks. Possible effects of n-p complete scheduling problems are noted and a class of combinatorial optimization methods are examined.

A meta-heuristic method for solving scheduling problem: crow search algorithm

NASA Astrophysics Data System (ADS)

Adhi, Antono; Santosa, Budi; Siswanto, Nurhadi

2018-04-01

Scheduling is one of the most important processes in an industry both in manufacturingand services. The scheduling process is the process of selecting resources to perform an operation on tasks. Resources can be machines, peoples, tasks, jobs or operations.. The selection of optimum sequence of jobs from a permutation is an essential issue in every research in scheduling problem. Optimum sequence becomes optimum solution to resolve scheduling problem. Scheduling problem becomes NP-hard problem since the number of job in the sequence is more than normal number can be processed by exact algorithm. In order to obtain optimum results, it needs a method with capability to solve complex scheduling problems in an acceptable time. Meta-heuristic is a method usually used to solve scheduling problem. The recently published method called Crow Search Algorithm (CSA) is adopted in this research to solve scheduling problem. CSA is an evolutionary meta-heuristic method which is based on the behavior in flocks of crow. The calculation result of CSA for solving scheduling problem is compared with other algorithms. From the comparison, it is found that CSA has better performance in term of optimum solution and time calculation than other algorithms.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Edwards, Harold C.; Ibanez, Daniel Alejandro

This report documents the ASC/ATDM Kokkos deliverable "Production Portable Dy- namic Task DAG Capability." This capability enables applications to create and execute a dynamic task DAG ; a collection of heterogeneous computational tasks with a directed acyclic graph (DAG) of "execute after" dependencies where tasks and their dependencies are dynamically created and destroyed as tasks execute. The Kokkos task scheduler executes the dynamic task DAG on the target execution resource; e.g. a multicore CPU, a manycore CPU such as Intel's Knights Landing (KNL), or an NVIDIA GPU. Several major technical challenges had to be addressed during development of Kokkos' Taskmore » DAG capability: (1) portability to a GPU with it's simplified hardware and micro- runtime, (2) thread-scalable memory allocation and deallocation from a bounded pool of memory, (3) thread-scalable scheduler for dynamic task DAG, (4) usability by applications.« less

Scheduling periodic jobs using imprecise results

NASA Technical Reports Server (NTRS)

Chung, Jen-Yao; Liu, Jane W. S.; Lin, Kwei-Jay

1987-01-01

One approach to avoid timing faults in hard, real-time systems is to make available intermediate, imprecise results produced by real-time processes. When a result of the desired quality cannot be produced in time, an imprecise result of acceptable quality produced before the deadline can be used. The problem of scheduling periodic jobs to meet deadlines on a system that provides the necessary programming language primitives and run-time support for processes to return imprecise results is discussed. Since the scheduler may choose to terminate a task before it is completed, causing it to produce an acceptable but imprecise result, the amount of processor time assigned to any task in a valid schedule can be less than the amount of time required to complete the task. A meaningful formulation of the scheduling problem must take into account the overall quality of the results. Depending on the different types of undesirable effects caused by errors, jobs are classified as type N or type C. For type N jobs, the effects of errors in results produced in different periods are not cumulative. A reasonable performance measure is the average error over all jobs. Three heuristic algorithms that lead to feasible schedules with small average errors are described. For type C jobs, the undesirable effects of errors produced in different periods are cumulative. Schedulability criteria of type C jobs are discussed.

FALCON: A distributed scheduler for MIMD architectures

DOE Office of Scientific and Technical Information (OSTI.GOV)

Grimshaw, A.S.; Vivas, V.E. Jr.

1991-01-01

This paper describes FALCON (Fully Automatic Load COordinator for Networks), the scheduler for the Mentat parallel processing system. FALCON has a modular structure and is designed for systems that use a task scheduling mechanism. FALCON is distributed, stable, supports system heterogeneities, and employs a sender-initiated adaptive load sharing policy with static task assignment. FALCON is parameterizable and is implemented in Mentat, a working distributed system. We present the design and implementation of FALCON as well as a brief introduction to those features of the Mentat run-time system that influence FALCON. Performance measures under different scheduler configurations are also presented andmore » analyzed with respect to the system parameters. 36 refs., 8 figs.« less

A human factors approach to range scheduling for satellite control

NASA Technical Reports Server (NTRS)

Wright, Cameron H. G.; Aitken, Donald J.

1991-01-01

Range scheduling for satellite control presents a classical problem: supervisory control of a large-scale dynamic system, with unwieldy amounts of interrelated data used as inputs to the decision process. Increased automation of the task, with the appropriate human-computer interface, is highly desirable. The development and user evaluation of a semi-automated network range scheduling system is described. The system incorporates a synergistic human-computer interface consisting of a large screen color display, voice input/output, a 'sonic pen' pointing device, a touchscreen color CRT, and a standard keyboard. From a human factors standpoint, this development represents the first major improvement in almost 30 years to the satellite control network scheduling task.

Range Scheduling Aid (RSA)

NASA Technical Reports Server (NTRS)

Logan, J. R.; Pulvermacher, M. K.

1991-01-01

Range Scheduling Aid (RSA) is presented in the form of the viewgraphs. The following subject areas are covered: satellite control network; current and new approaches to range scheduling; MITRE tasking; RSA features; RSA display; constraint based analytic capability; RSA architecture; and RSA benefits.

Effect of Spatial Titration on Task Performance

ERIC Educational Resources Information Center

Glowacki, Lawrence

1976-01-01

A reinforcement schedule and spatial titration method were used to determine task-reinforcement area separation most preferred and effective in two third-grade boys. Errors in task performance decreased task-reinforcement area separation, while correct responses in task performance increased task-reinforcement area separation. (Author)

Outcomes of Ahmed glaucoma valve implantation in advanced primary congenital glaucoma with previous surgical failure.

PubMed

Huang, Jingjing; Lin, Jialiu; Wu, Ziqiang; Xu, Hongzhi; Zuo, Chengguo; Ge, Jian

2015-01-01

The purpose of this study was to evaluate the intermediate surgical results of Ahmed glaucoma valve (AGV) implantation in patients less than 7 years of age, with advanced primary congenital glaucoma who have failed previous surgeries. Consecutive patients with advanced primary congenital glaucoma that failed previous operations and had undergone subsequent AGV implantation were evaluated retrospectively. Surgical success was defined as 1) intraocular pressure (IOP) ≥6 and ≤21 mmHg; 2) IOP reduction of at least 30% relative to preoperative values; and 3) without the need for additional surgical intervention for IOP control, loss of light perception, or serious complications. Fourteen eyes of eleven patients were studied. Preoperatively, the average axial length was 27.71±1.52 (25.56-30.80) mm, corneal diameter was 14.71±1.07 (13.0-16.0) mm, cup-to-disc ratio was 0.95±0.04 (0.9-1.0), and IOP was 39.5±5.7 (30-55) mmHg. The mean follow-up time was 18.29±10.96 (5-44, median 18) months. There were significant reductions in IOPs and the number of glaucoma medications (P<0.001) postoperatively. The IOPs after operation were 11.3±3.4, 13.6±5.1, 16.3±2.7, and 16.1±2.6 mmHg at 1 month, 6 months, 12 months, and 18 months, respectively. Kaplan-Meier estimates of the cumulative probability of valve success were 85.7%, 71.4%, and 71.4% at 6, 12, and 18 months, respectively. Severe surgical complications, including erosion of tube, endophthalmitis, retinal detachment, choroidal detachment, and delayed suprachoroidal hemorrhage, occurred in 28.6% cases. AGV implantation remains a viable option for patients with advanced primary congenital glaucoma unresponsive to previous surgical intervention, despite a relatively high incidence of severe surgical complications.

Long-term outcomes of uveitic glaucoma treated with Ahmed valve implant in a series of Chinese patients.

PubMed

Bao, Ning; Jiang, Zheng-Xuan; Coh, Paul; Tao, Li-Ming

2018-01-01

To report long-term outcomes of secondary glaucoma due to uveitis treated with Ahmed glaucoma valve (AGV) implantation in a series of Chinese patients. The retrospective study included 67 eyes from 56 patients with uveitic glaucoma who underwent AGV implantation. Success of the treatment was defined as patients achieving intraocular pressure (IOP) levels between 6 and 21 mm Hg with or without additional anti-glaucoma medications and/or a minimum of 20% reduction from baseline IOP. The main outcome measurements included IOP, the number of glaucoma medications at 1, 3, 6, 12, 24, 36, 48 and 60mo after surgery, surgical complications, final best-corrected vision acuity (BCVA), visual field (VF) and retinal nerve fiber layer (RNFL). The mean follow-up was 53.3±8.5 (range 48 to 60)mo. The cumulative probability of success rate was 98.5%, 95.5%, 89.6%, 83.6%, 76.1%, 70.1%, 65.7% and 61.2% at 1, 3, 6, 12, 24, 36, 48 and 60mo, respectively. IOP was reduced from a baseline of 30.8±6.8 to 9.9±4.1, 10.1±4.2, 10.9±3.7, 12.9±4.6, 13.8±3.9, 13.2±4.6, 12.3±3.5 and 13.1±3.7 mm Hg at 1, 3, 6, 12, 24, 36, 48 and 60mo, respectively ( P <0.01). The number of postoperative glaucoma medications was significantly decreased compared with baseline at all time points during the study period ( P <0.05). There was no significant difference between preoperative and postoperative BCVA. Remarkable surgical complications were not found after surgery. The VF and RNFL of the patients were stable after the surgery. AGV implantation is safe and effect in terms of reducing IOP, decreasing the number of glaucoma medications, and preserving vision for patients with uveitic glaucoma.

Use of Mitomycin C to reduce the incidence of encapsulated cysts following ahmed glaucoma valve implantation in refractory glaucoma patients: a new technique.

PubMed

Zhou, Minwen; Wang, Wei; Huang, Wenbin; Zhang, Xiulan

2014-09-06

To evaluate the surgical outcome of Ahmed glaucoma valve (AGV) implantation with a new technique of mitomycin C (MMC) application. This is a retrospective study. All patients with refractory glaucoma underwent FP-7 AGV implantation. Two methods of MMC application were used. In the traditional technique, 6 × 4 mm cotton soaked with MMC (0.25-0.33 mg/ml) was placed in the implantation area for 2-5mins; in the new technique, the valve plate first was encompassed with a thin layer of cotton soaked with MMC, then inserted into the same area. A 200 ml balanced salt solution was applied for irrigation of MMC. The surgical success rate, intraocular pressure (IOP), number of anti-glaucoma medications used, and postoperative complications were analyzed between the groups. The surgical outcomes of two MMC applied techniques were compared. The new technique group had only one case (2.6%) of encapsulated cyst formation out of 38 eyes, while there were eight (19.5%) cases out of 41 eyes the in traditional group. The difference was statistically significant (P = 0.030). According to the definition of success rate, there was 89.5% in the new technique group and 70.7% in the traditional group at the follow-up end point. There was a significant difference between the two groups (P = 0.035). Mean IOP in the new technique group were significantly lower than those of the traditional group at 3 and 6 months (P < 0.05). By using a thin layer of cotton soaked with MMC to encompass the valve plate, the new MMC application technique could greatly decrease the incidence of encapsulated cyst and increase the success rate following AGV implantation.

Outcomes of Ahmed glaucoma valve implantation in advanced primary congenital glaucoma with previous surgical failure

PubMed Central

Huang, Jingjing; Lin, Jialiu; Wu, Ziqiang; Xu, Hongzhi; Zuo, Chengguo; Ge, Jian

2015-01-01

Purpose The purpose of this study was to evaluate the intermediate surgical results of Ahmed glaucoma valve (AGV) implantation in patients less than 7 years of age, with advanced primary congenital glaucoma who have failed previous surgeries. Patients and methods Consecutive patients with advanced primary congenital glaucoma that failed previous operations and had undergone subsequent AGV implantation were evaluated retrospectively. Surgical success was defined as 1) intraocular pressure (IOP) ≥6 and ≤21 mmHg; 2) IOP reduction of at least 30% relative to preoperative values; and 3) without the need for additional surgical intervention for IOP control, loss of light perception, or serious complications. Results Fourteen eyes of eleven patients were studied. Preoperatively, the average axial length was 27.71±1.52 (25.56–30.80) mm, corneal diameter was 14.71±1.07 (13.0–16.0) mm, cup-to-disc ratio was 0.95±0.04 (0.9–1.0), and IOP was 39.5±5.7 (30–55) mmHg. The mean follow-up time was 18.29±10.96 (5–44, median 18) months. There were significant reductions in IOPs and the number of glaucoma medications (P<0.001) postoperatively. The IOPs after operation were 11.3±3.4, 13.6±5.1, 16.3±2.7, and 16.1±2.6 mmHg at 1 month, 6 months, 12 months, and 18 months, respectively. Kaplan–Meier estimates of the cumulative probability of valve success were 85.7%, 71.4%, and 71.4% at 6, 12, and 18 months, respectively. Severe surgical complications, including erosion of tube, endophthalmitis, retinal detachment, choroidal detachment, and delayed suprachoroidal hemorrhage, occurred in 28.6% cases. Conclusion AGV implantation remains a viable option for patients with advanced primary congenital glaucoma unresponsive to previous surgical intervention, despite a relatively high incidence of severe surgical complications. PMID:26082610

Clinical efficacy analysis of Ahmed glaucoma valve implantation in neovascular glaucoma and influencing factors

PubMed Central

He, Ye; Tian, Ying; Song, Weitao; Su, Ting; Jiang, Haibo; Xia, Xiaobo

2017-01-01

Abstract This study aimed to evaluate the efficacy of Ahmed glaucoma valve (AGV) implantation in treating neovascular glaucoma (NVG) and to analyze the factors influencing the surgical success rate. This is a retrospective review of 40 eyes of 40 NVG patients who underwent AGV implantation at Xiangya Hospital of Central South University, China, between January 2014 and December 2016. Pre- and postoperative intraocular pressure (IOP), visual acuity, surgical success rate, medications, and complications were observed. Surgical success criteria were defined as IOP ≤21 and >6 mm Hg with or without additional medications. Kaplan–Meier survival curves and Multivariate cox regression analysis were used to examine success rates and risk factors for surgical outcomes. The mean follow-up period was 8.88 ± 3.12 months (range: 3–17). IOP declined at each visit postoperatively and it was statistically significant (P < .001). An average of 3.55 ± 0.86 drugs was applied preoperatively, while an average of 0.64 ± 0.90 drugs was used postoperatively, with the difference being of statistical significance (P < .05). The complete surgical success rate of 3, 6, and 12 months after the operation was 85%, 75%, and 65%, respectively. Meanwhile, the qualified success rate of 3, 6, and 12 months after the operation was 85%, 80%, and 77.5%, respectively. The multivariate cox regression analysis showed that age (hazard ratio: 3.717, 7.246; 95% confidence interval: 1.149–12.048, 1.349–38.461; P = .028, .021) was influencing factors for complete success rate and qualified success rate among all NVG patients. Gender, previous operation history, primary disease, and preoperative IOP were found to be not significant. AGV implantation is an effective and safe surgical method to treat NVG. Age is an important factor influencing the surgical success rate. PMID:29049253

Outcome of Descemet stripping automated endothelial keratoplasty in eyes with an Ahmed glaucoma valve.

PubMed

Chiam, Patrick J; Cheeseman, Robert; Ho, Vivian W; Romano, Vito; Choudhary, Anshoo; Batterbury, Mark; Kaye, Stephen B; Willoughby, Colin E

2017-05-01

The purpose was to investigate the survival of Descemet stripping automated endothelial keratoplasty (DSAEK) in eyes with an Ahmed glaucoma valve (AGV). The study had a retrospective case-series of patients with an AGV in the anterior chamber undergoing a DSAEK. Included in the analysis were graft size, number of previous operations, post-operative glaucoma medications, post-operative intraocular pressure (IOP) control, graft size and donor factors (age, endothelial cell density, and post-mortem time). A generalised linear model with binary logistic regression was used to test for an effect on graft survival at 1 year and 1.5 years. Fourteen eyes from 13 patients were included. The survival rate of the first DSAEK at 6, 12, 18, 24 and 30-months was 85%, 71%, 50%, 36% and 30%, respectively. The mean duration to graft failure was 12.9 ± 6.2 months. Five of the seven failed first grafts went on to have a repeat DSAEK. The mean follow-up in this subgroup was 30.7 ± 18.4 months. The survival rate of second DSAEK at 6, 12, 18 and 24 months was 100% (5/5), 100% (5/5), 75% (3/4) and 67% (2/3). Only one second DSAEK failed in the duration of the study and went on to receive a third DSAEK which failed at 18-months. The mean IOP within the first year was significantly lower for grafts that survived at 1 and 1.5 years (17.4 mmHg, 16.9 mmHg) than for grafts that failed (19.4 mmHg, 19.4 mmHg) (p = 0.04, p = 0.009). DSAEK is a viable alternative to PK to restore visual function in eyes with an AGV sited in the anterior chamber. IOP is an important risk factor for graft failure.

Surprise Benefits of Arena Scheduling

ERIC Educational Resources Information Center

Surloff, Andrew

2008-01-01

One of the most challenging tasks a principal must accomplish every year is the construction of the master schedule. Free from the magnetic scheduling boards and wall charts of yesteryear, principals now have technological tools--such as programs that offer schools solutions for their scheduling needs--that can save time and enable them to work…

Differential effects of massed and spaced training on place and response learning: A memory systems perspective.

PubMed

Wingard, Jeffrey C; Goodman, Jarid; Leong, Kah-Chung; Packard, Mark G

2015-09-01

Studies employing brain lesion or intracerebral drug infusions in rats have demonstrated a double dissociation between the roles of the hippocampus and dorsolateral striatum in place and response learning. The hippocampus mediates a rapid cognitive learning process underlying place learning, whereas the dorsolateral striatum mediates a relatively slower learning process in which stimulus-response habits underlying response learning are acquired in an incremental fashion. One potential implication of these findings is that hippocampus-dependent learning may benefit from a relative massing of training trials, whereas dorsal striatum-dependent learning may benefit from a relative distribution of training trials. In order to examine this hypothesis, the present study compared the effects of massed (30s inter-trial interval; ITI) or spaced (30min ITI) training on acquisition of a hippocampus-dependent place learning task, and a dorsolateral striatum-dependent response task in a plus-maze. In the place task rats swam from varying start points (N or S) to a hidden escape platform located in a consistent spatial location (W). In the response task rats swam from varying start points (N or S) to a hidden escape platform located in the maze arm consistent with a body-turn response (left). In the place task, rats trained with the massed trial schedule acquired the task quicker than rats trained with the spaced trial schedule. In the response task, rats trained with the spaced trial schedule acquired the task quicker than rats trained with the massed trial schedule. The double dissociation observed suggests that the reinforcement parameters most conducive to effective learning in hippocampus-dependent and dorsolateral striatum-dependent learning may have differential temporal characteristics. Copyright © 2015 Elsevier B.V. All rights reserved.

A format for the interchange of scheduling models

NASA Technical Reports Server (NTRS)

Jaap, John P.; Davis, Elizabeth K.

1994-01-01

In recent years a variety of space-activity schedulers have been developed within the aerospace community. Space-activity schedulers are characterized by their need to handle large numbers of activities which are time-window constrained and make high demands on many scarce resources, but are minimally constrained by predecessor/successor requirements or critical paths. Two needs to exchange data between these schedulers have materialized. First, there is significant interest in comparing and evaluating the different scheduling engines to ensure that the best technology is applied to each scheduling endeavor. Second, there is a developing requirement to divide a single scheduling task among different sites, each using a different scheduler. In fact, the scheduling task for International Space Station Alpha (ISSA) will be distributed among NASA centers and among the international partners. The format used to interchange scheduling data for ISSA will likely use a growth version of the format discussed in this paper. The model interchange format (or MIF, pronounced as one syllable) discussed in this paper is a robust solution to the need to interchange scheduling requirements for space activities. It is highly extensible, human-readable, and can be generated or edited with common text editors. It also serves well the need to support a 'benchmark' data case which can be delivered on any computer platform.

Multi-Satellite Scheduling Approach for Dynamic Areal Tasks Triggered by Emergent Disasters

NASA Astrophysics Data System (ADS)

Niu, X. N.; Zhai, X. J.; Tang, H.; Wu, L. X.

2016-06-01

The process of satellite mission scheduling, which plays a significant role in rapid response to emergent disasters, e.g. earthquake, is used to allocate the observation resources and execution time to a series of imaging tasks by maximizing one or more objectives while satisfying certain given constraints. In practice, the information obtained of disaster situation changes dynamically, which accordingly leads to the dynamic imaging requirement of users. We propose a satellite scheduling model to address dynamic imaging tasks triggered by emergent disasters. The goal of proposed model is to meet the emergency response requirements so as to make an imaging plan to acquire rapid and effective information of affected area. In the model, the reward of the schedule is maximized. To solve the model, we firstly present a dynamic segmenting algorithm to partition area targets. Then the dynamic heuristic algorithm embedding in a greedy criterion is designed to obtain the optimal solution. To evaluate the model, we conduct experimental simulations in the scene of Wenchuan Earthquake. The results show that the simulated imaging plan can schedule satellites to observe a wider scope of target area. We conclude that our satellite scheduling model can optimize the usage of satellite resources so as to obtain images in disaster response in a more timely and efficient manner.

A Hybrid Task Graph Scheduler for High Performance Image Processing Workflows.

PubMed

Blattner, Timothy; Keyrouz, Walid; Bhattacharyya, Shuvra S; Halem, Milton; Brady, Mary

2017-12-01

Designing applications for scalability is key to improving their performance in hybrid and cluster computing. Scheduling code to utilize parallelism is difficult, particularly when dealing with data dependencies, memory management, data motion, and processor occupancy. The Hybrid Task Graph Scheduler (HTGS) improves programmer productivity when implementing hybrid workflows for multi-core and multi-GPU systems. The Hybrid Task Graph Scheduler (HTGS) is an abstract execution model, framework, and API that increases programmer productivity when implementing hybrid workflows for such systems. HTGS manages dependencies between tasks, represents CPU and GPU memories independently, overlaps computations with disk I/O and memory transfers, keeps multiple GPUs occupied, and uses all available compute resources. Through these abstractions, data motion and memory are explicit; this makes data locality decisions more accessible. To demonstrate the HTGS application program interface (API), we present implementations of two example algorithms: (1) a matrix multiplication that shows how easily task graphs can be used; and (2) a hybrid implementation of microscopy image stitching that reduces code size by ≈ 43% compared to a manually coded hybrid workflow implementation and showcases the minimal overhead of task graphs in HTGS. Both of the HTGS-based implementations show good performance. In image stitching the HTGS implementation achieves similar performance to the hybrid workflow implementation. Matrix multiplication with HTGS achieves 1.3× and 1.8× speedup over the multi-threaded OpenBLAS library for 16k × 16k and 32k × 32k size matrices, respectively.

Modeling the Violation of Reward Maximization and Invariance in Reinforcement Schedules

PubMed Central

La Camera, Giancarlo; Richmond, Barry J.

2008-01-01

It is often assumed that animals and people adjust their behavior to maximize reward acquisition. In visually cued reinforcement schedules, monkeys make errors in trials that are not immediately rewarded, despite having to repeat error trials. Here we show that error rates are typically smaller in trials equally distant from reward but belonging to longer schedules (referred to as “schedule length effect”). This violates the principles of reward maximization and invariance and cannot be predicted by the standard methods of Reinforcement Learning, such as the method of temporal differences. We develop a heuristic model that accounts for all of the properties of the behavior in the reinforcement schedule task but whose predictions are not different from those of the standard temporal difference model in choice tasks. In the modification of temporal difference learning introduced here, the effect of schedule length emerges spontaneously from the sensitivity to the immediately preceding trial. We also introduce a policy for general Markov Decision Processes, where the decision made at each node is conditioned on the motivation to perform an instrumental action, and show that the application of our model to the reinforcement schedule task and the choice task are special cases of this general theoretical framework. Within this framework, Reinforcement Learning can approach contextual learning with the mixture of empirical findings and principled assumptions that seem to coexist in the best descriptions of animal behavior. As examples, we discuss two phenomena observed in humans that often derive from the violation of the principle of invariance: “framing,” wherein equivalent options are treated differently depending on the context in which they are presented, and the “sunk cost” effect, the greater tendency to continue an endeavor once an investment in money, effort, or time has been made. The schedule length effect might be a manifestation of these phenomena in monkeys. PMID:18688266

Modeling the violation of reward maximization and invariance in reinforcement schedules.

PubMed

La Camera, Giancarlo; Richmond, Barry J

2008-08-08

It is often assumed that animals and people adjust their behavior to maximize reward acquisition. In visually cued reinforcement schedules, monkeys make errors in trials that are not immediately rewarded, despite having to repeat error trials. Here we show that error rates are typically smaller in trials equally distant from reward but belonging to longer schedules (referred to as "schedule length effect"). This violates the principles of reward maximization and invariance and cannot be predicted by the standard methods of Reinforcement Learning, such as the method of temporal differences. We develop a heuristic model that accounts for all of the properties of the behavior in the reinforcement schedule task but whose predictions are not different from those of the standard temporal difference model in choice tasks. In the modification of temporal difference learning introduced here, the effect of schedule length emerges spontaneously from the sensitivity to the immediately preceding trial. We also introduce a policy for general Markov Decision Processes, where the decision made at each node is conditioned on the motivation to perform an instrumental action, and show that the application of our model to the reinforcement schedule task and the choice task are special cases of this general theoretical framework. Within this framework, Reinforcement Learning can approach contextual learning with the mixture of empirical findings and principled assumptions that seem to coexist in the best descriptions of animal behavior. As examples, we discuss two phenomena observed in humans that often derive from the violation of the principle of invariance: "framing," wherein equivalent options are treated differently depending on the context in which they are presented, and the "sunk cost" effect, the greater tendency to continue an endeavor once an investment in money, effort, or time has been made. The schedule length effect might be a manifestation of these phenomena in monkeys.

Constraint based scheduling for the Goddard Space Flight Center distributed Active Archive Center's data archive and distribution system

NASA Technical Reports Server (NTRS)

Short, Nick, Jr.; Bedet, Jean-Jacques; Bodden, Lee; Boddy, Mark; White, Jim; Beane, John

1994-01-01

The Goddard Space Flight Center (GSFC) Distributed Active Archive Center (DAAC) has been operational since October 1, 1993. Its mission is to support the Earth Observing System (EOS) by providing rapid access to EOS data and analysis products, and to test Earth Observing System Data and Information System (EOSDIS) design concepts. One of the challenges is to ensure quick and easy retrieval of any data archived within the DAAC's Data Archive and Distributed System (DADS). Over the 15-year life of EOS project, an estimated several Petabytes (10(exp 15)) of data will be permanently stored. Accessing that amount of information is a formidable task that will require innovative approaches. As a precursor of the full EOS system, the GSFC DAAC with a few Terabits of storage, has implemented a prototype of a constraint-based task and resource scheduler to improve the performance of the DADS. This Honeywell Task and Resource Scheduler (HTRS), developed by Honeywell Technology Center in cooperation the Information Science and Technology Branch/935, the Code X Operations Technology Program, and the GSFC DAAC, makes better use of limited resources, prevents backlog of data, provides information about resources bottlenecks and performance characteristics. The prototype which is developed concurrently with the GSFC Version 0 (V0) DADS, models DADS activities such as ingestion and distribution with priority, precedence, resource requirements (disk and network bandwidth) and temporal constraints. HTRS supports schedule updates, insertions, and retrieval of task information via an Application Program Interface (API). The prototype has demonstrated with a few examples, the substantial advantages of using HTRS over scheduling algorithms such as a First In First Out (FIFO) queue. The kernel scheduling engine for HTRS, called Kronos, has been successfully applied to several other domains such as space shuttle mission scheduling, demand flow manufacturing, and avionics communications scheduling.

Control over the Scheduling of Simulated Office Work Reduces the Impact of Workload on Mental Fatigue and Task Performance

ERIC Educational Resources Information Center

Hockey, G. Robert J.; Earle, Fiona

2006-01-01

Two experiments tested the hypothesis that task-induced mental fatigue is moderated by control over work scheduling. Participants worked for 2 hr on simulated office work, with control manipulated by a yoking procedure. Matched participants were assigned to conditions of either high control (HC) or low control (LC). HC participants decided their…

Feelings of energy, exercise-related self-efficacy, and voluntary exercise participation.

PubMed

Yoon, Seok; Buckworth, Janet; Focht, Brian; Ko, Bomna

2013-12-01

This study used a path analysis approach to examine the relationship between feelings of energy, exercise-related self-efficacy beliefs, and exercise participation. A cross-sectional mailing survey design was used to measure feelings of physical and mental energy, task and scheduling self-efficacy beliefs, and voluntary moderate and vigorous exercise participation in 368 healthy, full-time undergraduate students (mean age = 21.43 ± 2.32 years). The path analysis revealed that the hypothesized path model had a strong fit to the study data. The path model showed that feelings of physical energy had significant direct effects on task and scheduling self-efficacy beliefs as well as exercise behaviors. In addition, scheduling self-efficacy had direct effects on moderate and vigorous exercise participation. However, there was no significant direct relationship between task self-efficacy and exercise participation. The path model also revealed that scheduling self-efficacy partially mediated the relationship between feelings of physical energy and exercise participation.

Sources of unbounded priority inversions in real-time systems and a comparative study of possible solutions

NASA Technical Reports Server (NTRS)

Davari, Sadegh; Sha, Lui

1992-01-01

In the design of real-time systems, tasks are often assigned priorities. Preemptive priority driven schedulers are used to schedule tasks to meet the timing requirements. Priority inversion is the term used to describe the situation when a higher priority task's execution is delayed by lower priority tasks. Priority inversion can occur when there is contention for resources among tasks of different priorities. The duration of priority inversion could be long enough to cause tasks to miss their dead lines. Priority inversion cannot be completely eliminated. However, it is important to identify sources of priority inversion and minimize the duration of priority inversion. In this paper, a comprehensive review of the problem of and solutions to unbounded priority inversion is presented.

Effort in Multitasking: Local and Global Assessment of Effort.

PubMed

Kiesel, Andrea; Dignath, David

2017-01-01

When performing multiple tasks in succession, self-organization of task order might be superior compared to external-controlled task schedules, because self-organization allows optimizing processing modes and thus reduces switch costs, and it increases commitment to task goals. However, self-organization is an additional executive control process that is not required if task order is externally specified and as such it is considered as time-consuming and effortful. To compare self-organized and externally controlled task scheduling, we suggest assessing global subjective and objectives measures of effort in addition to local performance measures. In our new experimental approach, we combined characteristics of dual tasking settings and task switching settings and compared local and global measures of effort in a condition with free choice of task sequence and a condition with cued task sequence. In a multi-tasking environment, participants chose the task order while the task requirement of the not-yet-performed task remained the same. This task preview allowed participants to work on the previously non-chosen items in parallel and resulted in faster responses and fewer errors in task switch trials than in task repetition trials. The free-choice group profited more from this task preview than the cued group when considering local performance measures. Nevertheless, the free-choice group invested more effort than the cued group when considering global measures. Thus, self-organization in task scheduling seems to be effortful even in conditions in which it is beneficiary for task processing. In a second experiment, we reduced the possibility of task preview for the not-yet-performed tasks in order to hinder efficient self-organization. Here neither local nor global measures revealed substantial differences between the free-choice and a cued task sequence condition. Based on the results of both experiments, we suggest that global assessment of effort in addition to local performance measures might be a useful tool for multitasking research.

Job-shop scheduling applied to computer vision

NASA Astrophysics Data System (ADS)

Sebastian y Zuniga, Jose M.; Torres-Medina, Fernando; Aracil, Rafael; Reinoso, Oscar; Jimenez, Luis M.; Garcia, David

1997-09-01

This paper presents a method for minimizing the total elapsed time spent by n tasks running on m differents processors working in parallel. The developed algorithm not only minimizes the total elapsed time but also reduces the idle time and waiting time of in-process tasks. This condition is very important in some applications of computer vision in which the time to finish the total process is particularly critical -- quality control in industrial inspection, real- time computer vision, guided robots. The scheduling algorithm is based on the use of two matrices, obtained from the precedence relationships between tasks, and the data obtained from the two matrices. The developed scheduling algorithm has been tested in one application of quality control using computer vision. The results obtained have been satisfactory in the application of different image processing algorithms.

Response requirement and increases in accuracy produced by stimulant drugs in a 5-choice serial reaction-time task in rats.

PubMed

Koffarnus, Mikhail N; Katz, Jonathan L

2011-02-01

Increased signal-detection accuracy on the 5-choice serial reaction time (5-CSRT) task has been shown with drugs that are useful clinically in treating attention deficit hyperactivity disorder (ADHD), but these increases are often small and/or unreliable. By reducing the reinforcer frequency, it may be possible to increase the sensitivity of this task to pharmacologically induced improvements in accuracy. Rats were trained to respond on the 5-CSRT task on a fixed ratio (FR) 1, FR 3, or FR 10 schedule of reinforcement. Drugs that were and were not expected to enhance performance were then administered before experimental sessions. Significant increases in accuracy of signal detection were not typically obtained under the FR 1 schedule with any drug. However, d-amphetamine, methylphenidate, and nicotine typically increased accuracy under the FR 3 and FR 10 schedules. Increasing the FR requirement in the 5-CSRT task increases the likelihood of a positive result with clinically effective drugs, and may more closely resemble conditions in children with attention deficits.

Effects of practice schedule and task specificity on the adaptive process of motor learning.

PubMed

Barros, João Augusto de Camargo; Tani, Go; Corrêa, Umberto Cesar

2017-10-01

This study investigated the effects of practice schedule and task specificity based on the perspective of adaptive process of motor learning. For this purpose, tasks with temporal and force control learning requirements were manipulated in experiments 1 and 2, respectively. Specifically, the task consisted of touching with the dominant hand the three sequential targets with specific movement time or force for each touch. Participants were children (N=120), both boys and girls, with an average age of 11.2years (SD=1.0). The design in both experiments involved four practice groups (constant, random, constant-random, and random-constant) and two phases (stabilisation and adaptation). The dependent variables included measures related to the task goal (accuracy and variability of error of the overall movement and force patterns) and movement pattern (macro- and microstructures). Results revealed a similar error of the overall patterns for all groups in both experiments and that they adapted themselves differently in terms of the macro- and microstructures of movement patterns. The study concludes that the effects of practice schedules on the adaptive process of motor learning were both general and specific to the task. That is, they were general to the task goal performance and specific regarding the movement pattern. Copyright © 2017 Elsevier B.V. All rights reserved.

Practice schedule and acquisition, retention, and transfer of a throwing task in 6-yr.-old children.

PubMed

Granda Vera, Juan; Montilla, Mariano Medina

2003-06-01

Earlier studies have raised questions about the usefulness of variable and random practice in learning motor tasks so this study was designed to investigate the effects of contextual interference in young children, and specifically to evaluate the effectiveness of variable or random practice structure in 6-yr.-old boys and girls. Participants on a variable practice schedule showed better performances than those on a blocked schedule. The differences between the two groups were significant in the acquisition, retention, and transfer phases. These results support the hypothesis that contextual interference enhances skill learning. Because the study involved groups of young children in the setting of their normally scheduled physical education class, the practical applications of the results are evident.

Scheduling quality of precise form sets which consist of tasks of circular type in GRID systems

NASA Astrophysics Data System (ADS)

Saak, A. E.; Kureichik, V. V.; Kravchenko, Y. A.

2018-05-01

Users’ demand in computer power and rise of technology favour the arrival of Grid systems. The quality of Grid systems’ performance depends on computer and time resources scheduling. Grid systems with a centralized structure of the scheduling system and user’s task are modeled by resource quadrant and re-source rectangle accordingly. A Non-Euclidean heuristic measure, which takes into consideration both the area and the form of an occupied resource region, is used to estimate scheduling quality of heuristic algorithms. The authors use sets, which are induced by the elements of square squaring, as an example of studying the adapt-ability of a level polynomial algorithm with an excess and the one with minimal deviation.

Power plant maintenance scheduling using ant colony optimization: an improved formulation

NASA Astrophysics Data System (ADS)

Foong, Wai Kuan; Maier, Holger; Simpson, Angus

2008-04-01

It is common practice in the hydropower industry to either shorten the maintenance duration or to postpone maintenance tasks in a hydropower system when there is expected unserved energy based on current water storage levels and forecast storage inflows. It is therefore essential that a maintenance scheduling optimizer can incorporate the options of shortening the maintenance duration and/or deferring maintenance tasks in the search for practical maintenance schedules. In this article, an improved ant colony optimization-power plant maintenance scheduling optimization (ACO-PPMSO) formulation that considers such options in the optimization process is introduced. As a result, both the optimum commencement time and the optimum outage duration are determined for each of the maintenance tasks that need to be scheduled. In addition, a local search strategy is presented in this article to boost the robustness of the algorithm. When tested on a five-station hydropower system problem, the improved formulation is shown to be capable of allowing shortening of maintenance duration in the event of expected demand shortfalls. In addition, the new local search strategy is also shown to have significantly improved the optimization ability of the ACO-PPMSO algorithm.

The Effect of Practice Schedule on Context-Dependent Learning.

PubMed

Lee, Ya-Yun; Fisher, Beth E

2018-03-02

It is well established that random practice compared to blocked practice enhances motor learning. Additionally, while information in the environment may be incidental, learning is also enhanced when an individual performs a task within the same environmental context in which the task was originally practiced. This study aimed to disentangle the effects of practice schedule and incidental/environmental context on motor learning. Participants practiced three finger sequences under either a random or blocked practice schedule. Each sequence was associated with specific incidental context (i.e., color and location on the computer screen) during practice. The participants were tested under the conditions when the sequence-context associations remained the same or were changed from that of practice. When the sequence-context association was changed, the participants who practiced under blocked schedule demonstrated greater performance decrement than those who practiced under random schedule. The findings suggested that those participants who practiced under random schedule were more resistant to the change of environmental context.

Young Children's Affective Decision-Making in a Gambling Task: Does Difficulty in Learning the Gain/Loss Schedule Matter?

ERIC Educational Resources Information Center

Gao, Shan; Wei, Yonggang; Bai, Junjie; Lin, Chongde; Li, Hong

2009-01-01

This research investigated the development of affective decision-making (ADM) during early childhood, in particular role of difficulty in learning a gain/loss schedule. In Experiment 1, we administrated the Children's Gambling Task (CGT) to 60 Chinese children aged 3 and 4, replicating the results obtained by Kerr and Zelazo [Kerr, A., & Zelazo,…

A distributed computing environment with support for constraint-based task scheduling and scientific experimentation

DOE Office of Scientific and Technical Information (OSTI.GOV)

Ahrens, J.P.; Shapiro, L.G.; Tanimoto, S.L.

1997-04-01

This paper describes a computing environment which supports computer-based scientific research work. Key features include support for automatic distributed scheduling and execution and computer-based scientific experimentation. A new flexible and extensible scheduling technique that is responsive to a user`s scheduling constraints, such as the ordering of program results and the specification of task assignments and processor utilization levels, is presented. An easy-to-use constraint language for specifying scheduling constraints, based on the relational database query language SQL, is described along with a search-based algorithm for fulfilling these constraints. A set of performance studies show that the environment can schedule and executemore » program graphs on a network of workstations as the user requests. A method for automatically generating computer-based scientific experiments is described. Experiments provide a concise method of specifying a large collection of parameterized program executions. The environment achieved significant speedups when executing experiments; for a large collection of scientific experiments an average speedup of 3.4 on an average of 5.5 scheduled processors was obtained.« less

Particle swarm optimization based space debris surveillance network scheduling

NASA Astrophysics Data System (ADS)

Jiang, Hai; Liu, Jing; Cheng, Hao-Wen; Zhang, Yao

2017-02-01

The increasing number of space debris has created an orbital debris environment that poses increasing impact risks to existing space systems and human space flights. For the safety of in-orbit spacecrafts, we should optimally schedule surveillance tasks for the existing facilities to allocate resources in a manner that most significantly improves the ability to predict and detect events involving affected spacecrafts. This paper analyzes two criteria that mainly affect the performance of a scheduling scheme and introduces an artificial intelligence algorithm into the scheduling of tasks of the space debris surveillance network. A new scheduling algorithm based on the particle swarm optimization algorithm is proposed, which can be implemented in two different ways: individual optimization and joint optimization. Numerical experiments with multiple facilities and objects are conducted based on the proposed algorithm, and simulation results have demonstrated the effectiveness of the proposed algorithm.

Exercise-related goals and self-efficacy as correlates of aquatic exercise in individuals with arthritis.

PubMed

Gyurcsik, Nancy C; Estabrooks, Paul A; Frahm-Templar, Melissa J

2003-06-15

To examine whether aquatic exercise-related goals, task self-efficacy, and scheduling self-efficacy are predictive of aquatic exercise attendance in individuals with arthritis. A secondary objective was to determine whether high attendees differed from low attendees on goals and self-efficacy. The sample comprised 216 adults with arthritis (mean age 69.21 years). Measures included exercise-related goal difficulty and specificity, task and scheduling self-efficacy, and 8-week aquatic exercise attendance. Results of a multiple hierarchical regression analysis were significant (P < 0.01). Goal difficulty, specificity, and task self-efficacy were independent predictors of attendance (P < 0.05). A significant multivariate analysis of variance (P < 0.01) indicated that high attendees had higher task and scheduling self-efficacy and lower goal difficulty than did low attendees (P < 0.05). Support for the importance of exercise-related goal setting and self-efficacy was demonstrated. Implications pertain to the design of interventions to impact aquatic exercise.

Utilization Bound of Non-preemptive Fixed Priority Schedulers

NASA Astrophysics Data System (ADS)

Park, Moonju; Chae, Jinseok

It is known that the schedulability of a non-preemptive task set with fixed priority can be determined in pseudo-polynomial time. However, since Rate Monotonic scheduling is not optimal for non-preemptive scheduling, the applicability of existing polynomial time tests that provide sufficient schedulability conditions, such as Liu and Layland's bound, is limited. This letter proposes a new sufficient condition for non-preemptive fixed priority scheduling that can be used for any fixed priority assignment scheme. It is also shown that the proposed schedulability test has a tighter utilization bound than existing test methods.

Decreasing inventory of a cement factory roller mill parts using reliability centered maintenance method

NASA Astrophysics Data System (ADS)

Witantyo; Rindiyah, Anita

2018-03-01

According to data from maintenance planning and control, it was obtained that highest inventory value is non-routine components. Maintenance components are components which procured based on maintenance activities. The problem happens because there is no synchronization between maintenance activities and the components required. Reliability Centered Maintenance method is used to overcome the problem by reevaluating maintenance activities required components. The case chosen is roller mill system because it has the highest unscheduled downtime record. Components required for each maintenance activities will be determined by its failure distribution, so the number of components needed could be predicted. Moreover, those components will be reclassified from routine component to be non-routine component, so the procurement could be carried out regularly. Based on the conducted analysis, failure happens in almost every maintenance task are classified to become scheduled on condition task, scheduled discard task, schedule restoration task and no schedule maintenance. From 87 used components for maintenance activities are evaluated and there 19 components that experience reclassification from non-routine components to routine components. Then the reliability and need of those components were calculated for one-year operation period. Based on this invention, it is suggested to change all of the components in overhaul activity to increase the reliability of roller mill system. Besides, the inventory system should follow maintenance schedule and the number of required components in maintenance activity so the value of procurement will be decreased and the reliability system will increase.

Secure Scientific Applications Scheduling Technique for Cloud Computing Environment Using Global League Championship Algorithm

PubMed Central

Abdulhamid, Shafi’i Muhammad; Abd Latiff, Muhammad Shafie; Abdul-Salaam, Gaddafi; Hussain Madni, Syed Hamid

2016-01-01

Cloud computing system is a huge cluster of interconnected servers residing in a datacenter and dynamically provisioned to clients on-demand via a front-end interface. Scientific applications scheduling in the cloud computing environment is identified as NP-hard problem due to the dynamic nature of heterogeneous resources. Recently, a number of metaheuristics optimization schemes have been applied to address the challenges of applications scheduling in the cloud system, without much emphasis on the issue of secure global scheduling. In this paper, scientific applications scheduling techniques using the Global League Championship Algorithm (GBLCA) optimization technique is first presented for global task scheduling in the cloud environment. The experiment is carried out using CloudSim simulator. The experimental results show that, the proposed GBLCA technique produced remarkable performance improvement rate on the makespan that ranges between 14.44% to 46.41%. It also shows significant reduction in the time taken to securely schedule applications as parametrically measured in terms of the response time. In view of the experimental results, the proposed technique provides better-quality scheduling solution that is suitable for scientific applications task execution in the Cloud Computing environment than the MinMin, MaxMin, Genetic Algorithm (GA) and Ant Colony Optimization (ACO) scheduling techniques. PMID:27384239

Secure Scientific Applications Scheduling Technique for Cloud Computing Environment Using Global League Championship Algorithm.

PubMed

Abdulhamid, Shafi'i Muhammad; Abd Latiff, Muhammad Shafie; Abdul-Salaam, Gaddafi; Hussain Madni, Syed Hamid

2016-01-01

Cloud computing system is a huge cluster of interconnected servers residing in a datacenter and dynamically provisioned to clients on-demand via a front-end interface. Scientific applications scheduling in the cloud computing environment is identified as NP-hard problem due to the dynamic nature of heterogeneous resources. Recently, a number of metaheuristics optimization schemes have been applied to address the challenges of applications scheduling in the cloud system, without much emphasis on the issue of secure global scheduling. In this paper, scientific applications scheduling techniques using the Global League Championship Algorithm (GBLCA) optimization technique is first presented for global task scheduling in the cloud environment. The experiment is carried out using CloudSim simulator. The experimental results show that, the proposed GBLCA technique produced remarkable performance improvement rate on the makespan that ranges between 14.44% to 46.41%. It also shows significant reduction in the time taken to securely schedule applications as parametrically measured in terms of the response time. In view of the experimental results, the proposed technique provides better-quality scheduling solution that is suitable for scientific applications task execution in the Cloud Computing environment than the MinMin, MaxMin, Genetic Algorithm (GA) and Ant Colony Optimization (ACO) scheduling techniques.

Enabling a New Planning and Scheduling Paradigm

NASA Technical Reports Server (NTRS)

Jaap, John; Davis, Elizabeth

2004-01-01

The Flight Projects Directorate at NASA's Marshall Space Flight Center is developing a new planning and scheduling environment and a new scheduling algorithm to enable a paradigm shift in planning and scheduling concepts. Over the past 33 years Marshall has developed and evolved a paradigm for generating payload timelines for Skylab, Spacelab, various other Shuttle payloads, and the International Space Station. The current paradigm starts by collecting the requirements, called "tasks models," from the scientists and technologists for the tasks that they want to be done. Because of shortcomings in the current modeling schema, some requirements are entered as notes. Next a cadre with knowledge of vehicle and hardware modifies these models to encompass and be compatible with the hardware model; again, notes are added when the modeling schema does not provide a better way to represent the requirements. Finally, another cadre further modifies the models to be compatible with the scheduling engine. This last cadre also submits the models to the scheduling engine or builds the timeline manually to accommodate requirements that are expressed in notes. A future paradigm would provide a scheduling engine that accepts separate science models and hardware models. The modeling schema would have the capability to represent all the requirements without resorting to notes. Furthermore, the scheduling engine would not require that the models be modified to account for the capabilities (limitations) of the scheduling engine. The enabling technology under development at Marshall has three major components. (1) A new modeling schema allows expressing all the requirements of the tasks without resorting to notes or awkward contrivances. The chosen modeling schema is both maximally expressive and easy to use. It utilizes graphics methods to show hierarchies of task constraints and networks of temporal relationships. (2) A new scheduling algorithm automatically schedules the models without the intervention of a scheduling expert. The algorithm is tuned for the constraint hierarchies and the complex temporal relationships provided by the modeling schema. It has an extensive search algorithm which can exploit timing flexibilities and constraint and relationship options. (3) A web-based architecture allows multiple remote users to simultaneously model science and technology requirements and other users to model vehicle and hardware characteristics. The architecture allows the users to submit scheduling requests directly to the scheduling engine and immediately see the results. These three components are integrated so that science and technology experts with no knowledge of the vehicle or hardware subsystems and no knowledge of the internal workings of the scheduling engine have the ability to build and submit scheduling requests and see the results. The immediate feedback will hone the users' modeling skills and ultimately enable them to produce the desired timeline. This paper summarizes the three components of the enabling technology and describes how this technology would make a new paradigm possible.

Effects of a Photo Activity Schedule Book on Independent Task Changes by Students with Intellectual Disabilities in Community and School Job Sites

ERIC Educational Resources Information Center

Carson, Keyla D; Gast, David L.; Ayres, Kevin M.

2008-01-01

The purpose of this study was to evaluate the effectiveness of using a photo activity schedule book to increase independent transitioning between vocational tasks inside a school cafeteria and at a community job site. Three students with mild to moderate intellectual disabilities, enrolled in a self-contained classroom in a public high school,…

Modeling Motivational and Action Attitudes

DTIC Science & Technology

2015-01-14

build on a few branches of this work to establish the properties of a productive schedule. As procrastination is one of the most damaging errors in...time manage- ment, we first reference recent work that has documented the negative effects of procrastination on performance. In one study, O’Donoghue...and Rabin [25] showed that people procrastinate more on important tasks, which inspired us to prioritize important tasks in scheduling. Motivation for

Use of Perceive, Recall, Plan, Perform Stage Two Cognitive Task Analysis for Students with Autism and Intellectual Disability: The Impact of a Sensory Activity Schedule

ERIC Educational Resources Information Center

Mills, Caroline; Chapparo, Christine

2017-01-01

The aim of this study was to determine the impact of a classroom sensory activity schedule (SAS) on cognitive strategy use during task performance. This work studies a single-system AB research design with seven students with autism and intellectual disability. Repeated measures using the Perceive, Recall, Plan and Perform (PRPP) Cognitive Task…

Work schedule manager gap analysis : assessing the future training needs of work schedule managers using a strategic job analysis approach.

DOT National Transportation Integrated Search

2010-05-01

This report documents the results of a strategic job analysis that examined the job tasks and knowledge, skills, abilities, and other characteristics (KSAOs) needed to perform the job of a work schedule manager. The strategic job analysis compared in...

Work schedule manager gap analysis : assessing the future training needs of work schedule managers using a strategic job analysis approach

DOT National Transportation Integrated Search

2010-05-01

This report documents the results of a strategic job analysis that examined the job tasks and knowledge, skills, abilities, and other characteristics (KSAOs) needed to perform the job of a work schedule manager. The strategic job analysis compared in...

Alternative Work Schedules: Definitions

ERIC Educational Resources Information Center

Journal of the College and University Personnel Association, 1977

1977-01-01

The term "alternative work schedules" encompasses any variation of the requirement that all permanent employees in an organization or one shift of employees adhere to the same five-day, seven-to-eight-hour schedule. This article defines staggered hours, flexible working hours (flexitour and gliding time), compressed work week, the task system, and…

Effects of Activity Schedules on Challenging Behavior for Children with Autism

ERIC Educational Resources Information Center

Scalzo, Rachel; Davis, Tonya N.; Weston, Regan; Dukes, Elizabeth; Leeper, Dana; Min, Nandar; Mom, Allen; Stone, Jessica; Weber, Alex

2017-01-01

This study examined activity schedules as an intervention to decrease challenging behavior and increase academic engagement during work tasks scheduled after free play activities in three boys diagnosed with autism spectrum disorder (ASD). Functional analysis results indicated all participants' challenging behavior was maintained, at least in…

Naval Postgraduate School Solar Cell Array Tester

DTIC Science & Technology

2010-12-01

PROGRAM MANAGEMENT ................................45 1. SCHEDULE .....................................47 B. BUDGET...budget and schedule from December 2009 to September 2010. In addition, a total development cost estimate, including labor, equipment, and testing... scheduler becomes active, all tasks become eligible to run, and normal operations begin. Figure 21 shows a diagram of the startup actions [32

A vision-based automated guided vehicle system with marker recognition for indoor use.

PubMed

Lee, Jeisung; Hyun, Chang-Ho; Park, Mignon

2013-08-07

We propose an intelligent vision-based Automated Guided Vehicle (AGV) system using fiduciary markers. In this paper, we explore a low-cost, efficient vehicle guiding method using a consumer grade web camera and fiduciary markers. In the proposed method, the system uses fiduciary markers with a capital letter or triangle indicating direction in it. The markers are very easy to produce, manipulate, and maintain. The marker information is used to guide a vehicle. We use hue and saturation values in the image to extract marker candidates. When the known size fiduciary marker is detected by using a bird's eye view and Hough transform, the positional relation between the marker and the vehicle can be calculated. To recognize the character in the marker, a distance transform is used. The probability of feature matching was calculated by using a distance transform, and a feature having high probability is selected as a captured marker. Four directional signals and 10 alphabet features are defined and used as markers. A 98.87% recognition rate was achieved in the testing phase. The experimental results with the fiduciary marker show that the proposed method is a solution for an indoor AGV system.

Ecology and geography of transmission of two bat-borne rabies lineages in Chile.

PubMed

Escobar, Luis E; Peterson, A Townsend; Favi, Myriam; Yung, Verónica; Pons, Daniel J; Medina-Vogel, Gonzalo

2013-01-01

Rabies was known to humans as a disease thousands of years ago. In America, insectivorous bats are natural reservoirs of rabies virus. The bat species Tadarida brasiliensis and Lasiurus cinereus, with their respective, host-specific rabies virus variants AgV4 and AgV6, are the principal rabies reservoirs in Chile. However, little is known about the roles of bat species in the ecology and geographic distribution of the virus. This contribution aims to address a series of questions regarding the ecology of rabies transmission in Chile. Analyzing records from 1985-2011 at the Instituto de Salud Pública de Chile (ISP) and using ecological niche modeling, we address these questions to help in understanding rabies-bat ecological dynamics in South America. We found ecological niche identity between both hosts and both viral variants, indicating that niches of all actors in the system are undifferentiated, although the viruses do not necessarily occupy the full geographic distributions of their hosts. Bat species and rabies viruses share similar niches, and our models had significant predictive power even across unsampled regions; results thus suggest that outbreaks may occur under consistent, stable, and predictable circumstances.

Ecology and Geography of Transmission of Two Bat-Borne Rabies Lineages in Chile

PubMed Central

Escobar, Luis E.; Peterson, A. Townsend; Favi, Myriam; Yung, Verónica; Pons, Daniel J.; Medina-Vogel, Gonzalo

2013-01-01

Rabies was known to humans as a disease thousands of years ago. In America, insectivorous bats are natural reservoirs of rabies virus. The bat species Tadarida brasiliensis and Lasiurus cinereus, with their respective, host-specific rabies virus variants AgV4 and AgV6, are the principal rabies reservoirs in Chile. However, little is known about the roles of bat species in the ecology and geographic distribution of the virus. This contribution aims to address a series of questions regarding the ecology of rabies transmission in Chile. Analyzing records from 1985–2011 at the Instituto de Salud Pública de Chile (ISP) and using ecological niche modeling, we address these questions to help in understanding rabies-bat ecological dynamics in South America. We found ecological niche identity between both hosts and both viral variants, indicating that niches of all actors in the system are undifferentiated, although the viruses do not necessarily occupy the full geographic distributions of their hosts. Bat species and rabies viruses share similar niches, and our models had significant predictive power even across unsampled regions; results thus suggest that outbreaks may occur under consistent, stable, and predictable circumstances. PMID:24349592

Optimizing Music Learning: Exploring How Blocked and Interleaved Practice Schedules Affect Advanced Performance.

PubMed

Carter, Christine E; Grahn, Jessica A

2016-01-01

Repetition is the most commonly used practice strategy by musicians. Although blocks of repetition continue to be suggested in the pedagogical literature, work in the field of cognitive psychology suggests that repeated events receive less processing, thereby reducing the potential for long-term learning. Motor skill learning and sport psychology research offer an alternative. Instead of using a blocked practice schedule, with practice completed on one task before moving on to the next task, an interleaved schedule can be used, in which practice is frequently alternated between tasks. This frequent alternation involves more effortful processing, resulting in increased long-term learning. The finding that practicing in an interleaved schedule leads to better retention than practicing in a blocked schedule has been labeled the "contextual interference effect." While the effect has been observed across a wide variety of fields, few studies have researched this phenomenon in a music-learning context, despite the broad potential for application to music practice. This study compared the effects of blocked and interleaved practice schedules on advanced clarinet performance in an ecologically valid context. Ten clarinetists were given one concerto exposition and one technical excerpt to practice in a blocked schedule (12 min per piece) and a second concerto exposition and technical excerpt to practice in an interleaved schedule (3 min per piece, alternating until a total of 12 min of practice were completed on each piece). Participants sight-read the four pieces prior to practice and performed them at the end of practice and again one day later. The sight-reading and two performance run-throughs of each piece were recorded and given to three professional clarinetists to rate using a percentage scale. Overall, whenever there was a ratings difference between the conditions, pieces practiced in the interleaved schedule were rated better than those in the blocked schedule, although results varied across raters. Participant questionnaires also revealed that the interleaved practice schedule had positive effects on factors such as goal setting, focus, and mistake identification. Taken together, these results suggest that an interleaved practice schedule may be a more effective practice strategy than continuous repetition in a music-learning context.

Optimizing Music Learning: Exploring How Blocked and Interleaved Practice Schedules Affect Advanced Performance

PubMed Central

Carter, Christine E.; Grahn, Jessica A.

2016-01-01

Repetition is the most commonly used practice strategy by musicians. Although blocks of repetition continue to be suggested in the pedagogical literature, work in the field of cognitive psychology suggests that repeated events receive less processing, thereby reducing the potential for long-term learning. Motor skill learning and sport psychology research offer an alternative. Instead of using a blocked practice schedule, with practice completed on one task before moving on to the next task, an interleaved schedule can be used, in which practice is frequently alternated between tasks. This frequent alternation involves more effortful processing, resulting in increased long-term learning. The finding that practicing in an interleaved schedule leads to better retention than practicing in a blocked schedule has been labeled the “contextual interference effect.” While the effect has been observed across a wide variety of fields, few studies have researched this phenomenon in a music-learning context, despite the broad potential for application to music practice. This study compared the effects of blocked and interleaved practice schedules on advanced clarinet performance in an ecologically valid context. Ten clarinetists were given one concerto exposition and one technical excerpt to practice in a blocked schedule (12 min per piece) and a second concerto exposition and technical excerpt to practice in an interleaved schedule (3 min per piece, alternating until a total of 12 min of practice were completed on each piece). Participants sight-read the four pieces prior to practice and performed them at the end of practice and again one day later. The sight-reading and two performance run-throughs of each piece were recorded and given to three professional clarinetists to rate using a percentage scale. Overall, whenever there was a ratings difference between the conditions, pieces practiced in the interleaved schedule were rated better than those in the blocked schedule, although results varied across raters. Participant questionnaires also revealed that the interleaved practice schedule had positive effects on factors such as goal setting, focus, and mistake identification. Taken together, these results suggest that an interleaved practice schedule may be a more effective practice strategy than continuous repetition in a music-learning context. PMID:27588014

Cooperative Scheduling of Imaging Observation Tasks for High-Altitude Airships Based on Propagation Algorithm

PubMed Central

Chuan, He; Dishan, Qiu; Jin, Liu

2012-01-01

The cooperative scheduling problem on high-altitude airships for imaging observation tasks is discussed. A constraint programming model is established by analyzing the main constraints, which takes the maximum task benefit and the minimum cruising distance as two optimization objectives. The cooperative scheduling problem of high-altitude airships is converted into a main problem and a subproblem by adopting hierarchy architecture. The solution to the main problem can construct the preliminary matching between tasks and observation resource in order to reduce the search space of the original problem. Furthermore, the solution to the sub-problem can detect the key nodes that each airship needs to fly through in sequence, so as to get the cruising path. Firstly, the task set is divided by using k-core neighborhood growth cluster algorithm (K-NGCA). Then, a novel swarm intelligence algorithm named propagation algorithm (PA) is combined with the key node search algorithm (KNSA) to optimize the cruising path of each airship and determine the execution time interval of each task. Meanwhile, this paper also provides the realization approach of the above algorithm and especially makes a detailed introduction on the encoding rules, search models, and propagation mechanism of the PA. Finally, the application results and comparison analysis show the proposed models and algorithms are effective and feasible. PMID:23365522

Toward an Autonomous Telescope Network: the TBT Scheduler

NASA Astrophysics Data System (ADS)

Racero, E.; Ibarra, A.; Ocaña, F.; de Lis, S. B.; Ponz, J. D.; Castillo, M.; Sánchez-Portal, M.

2015-09-01

Within the ESA SSA program, it is foreseen to deploy several robotic telescopes to provide surveillance and tracking services for hazardous objects. The TBT project will procure a validation platform for an autonomous optical observing system in a realistic scenario, consisting of two telescopes located in Spain and Australia, to collect representative test data for precursor SSA services. In this context, the planning and scheduling of the night consists of two software modules, the TBT Scheduler, that will allow the manual and autonomous planning of the night, and the control of the real-time response of the system, done by the RTS2 internal scheduler. The TBT Scheduler allocates tasks for both telescopes without human intervention. Every night it takes all the inputs needed and prepares the schedule following some predefined rules. The main purpose of the scheduler is the distribution of the time for follow-up of recently discovered targets and surveys. The TBT Scheduler considers the overall performance of the system, and combine follow-up with a priori survey strategies for both kind of objects. The strategy is defined according to the expected combined performance for both systems the upcoming night (weather, sky brightness, object accessibility and priority). Therefore, TBT Scheduler defines the global approach for the network and relies on the RTS2 internal scheduler for the final detailed distribution of tasks at each sensor.

Scheduling in the Face of Uncertain Resource Consumption and Utility

NASA Technical Reports Server (NTRS)

Koga, Dennis (Technical Monitor); Frank, Jeremy; Dearden, Richard

2003-01-01

We discuss the problem of scheduling tasks that consume a resource with known capacity and where the tasks have varying utility. We consider problems in which the resource consumption and utility of each activity is described by probability distributions. In these circumstances, we would like to find schedules that exceed a lower bound on the expected utility when executed. We first show that while some of these problems are NP-complete, others are only NP-Hard. We then describe various heuristic search algorithms to solve these problems and their drawbacks. Finally, we present empirical results that characterize the behavior of these heuristics over a variety of problem classes.

Effects of workload preview on task scheduling during simulated instrument flight.

PubMed

Andre, A D; Heers, S T; Cashion, P A

1995-01-01

Our study examined pilot scheduling behavior in the context of simulated instrument flight. Over the course of the flight, pilots flew along specified routes while scheduling and performing several flight-related secondary tasks. The first phase of flight was flown under low-workload conditions, whereas the second phase of flight was flown under high-workload conditions in the form of increased turbulence and a disorganized instrument layout. Six pilots were randomly assigned to each of three workload preview groups. Subjects in the no-preview group were not given preview of the increased-workload conditions. Subjects in the declarative preview group were verbally informed of the nature of the flight workload manipulation but did not receive any practice under the high-workload conditions. Subjects in the procedural preview group received the same instructions as the declarative preview group but also flew half of the practice flight under the high-workload conditions. The results show that workload preview fostered efficient scheduling strategies. Specifically, those pilots with either declarative or procedural preview of future workload demands adopted an efficient strategy of scheduling more of the difficult secondary tasks during the low-workload phase of flight. However, those pilots given a procedural preview showed the greatest benefits in overall flight performance.

A task scheduler framework for self-powered wireless sensors.

PubMed

Nordman, Mikael M

2003-10-01

The cost and inconvenience of cabling is a factor limiting widespread use of intelligent sensors. Recent developments in short-range, low-power radio seem to provide an opening to this problem, making development of wireless sensors feasible. However, for these sensors the energy availability is a main concern. The common solution is either to use a battery or to harvest ambient energy. The benefit of harvested ambient energy is that the energy feeder can be considered as lasting a lifetime, thus it saves the user from concerns related to energy management. The problem is, however, the unpredictability and unsteady behavior of ambient energy sources. This becomes a main concern for sensors that run multiple tasks at different priorities. This paper proposes a new scheduler framework that enables the reliable assignment of task priorities and scheduling in sensors powered by ambient energy. The framework being based on environment parameters, virtual queues, and a state machine with transition conditions, dynamically manages task execution according to priorities. The framework is assessed in a test system powered by a solar panel. The results show the functionality of the framework and how task execution reliably is handled without violating the priority scheme that has been assigned to it.

User-Assisted Store Recycling for Dynamic Task Graph Schedulers

DOE Office of Scientific and Technical Information (OSTI.GOV)

Kurt, Mehmet Can; Krishnamoorthy, Sriram; Agrawal, Gagan

The emergence of the multi-core era has led to increased interest in designing effective yet practical parallel programming models. Models based on task graphs that operate on single-assignment data are attractive in several ways: they can support dynamic applications and precisely represent the available concurrency. However, they also require nuanced algorithms for scheduling and memory management for efficient execution. In this paper, we consider memory-efficient dynamic scheduling of task graphs. Specifically, we present a novel approach for dynamically recycling the memory locations assigned to data items as they are produced by tasks. We develop algorithms to identify memory-efficient store recyclingmore » functions by systematically evaluating the validity of a set of (user-provided or automatically generated) alternatives. Because recycling function can be input data-dependent, we have also developed support for continued correct execution of a task graph in the presence of a potentially incorrect store recycling function. Experimental evaluation demonstrates that our approach to automatic store recycling incurs little to no overheads, achieves memory usage comparable to the best manually derived solutions, often produces recycling functions valid across problem sizes and input parameters, and efficiently recovers from an incorrect choice of store recycling functions.« less

A multitasking general executive for compound continuous tasks.

PubMed

Salvucci, Dario D

2005-05-06

As cognitive architectures move to account for increasingly complex real-world tasks, one of the most pressing challenges involves understanding and modeling human multitasking. Although a number of existing models now perform multitasking in real-world scenarios, these models typically employ customized executives that schedule tasks for the particular domain but do not generalize easily to other domains. This article outlines a general executive for the Adaptive Control of Thought-Rational (ACT-R) cognitive architecture that, given independent models of individual tasks, schedules and interleaves the models' behavior into integrated multitasking behavior. To demonstrate the power of the proposed approach, the article describes an application to the domain of driving, showing how the general executive can interleave component subtasks of the driving task (namely, control and monitoring) and interleave driving with in-vehicle secondary tasks (radio tuning and phone dialing). 2005 Lawrence Erlbaum Associates, Inc.

48 CFR 1852.216-80 - Task ordering procedure.

Code of Federal Regulations, 2010 CFR

2010-10-01

... specified in the schedule. The Contractor may incur costs under this contract in performance of task orders... contemplated task order. (2) Proposed performance standards to be used as criteria for determining whether the... the task order, including special instructions or other information necessary for performance of the...

System engineering techniques for establishing balanced design and performance guidelines for the advanced telerobotic testbed

NASA Technical Reports Server (NTRS)

Zimmerman, W. F.; Matijevic, J. R.

1987-01-01

Novel system engineering techniques have been developed and applied to establishing structured design and performance objectives for the Telerobotics Testbed that reduce technical risk while still allowing the testbed to demonstrate an advancement in state-of-the-art robotic technologies. To estblish the appropriate tradeoff structure and balance of technology performance against technical risk, an analytical data base was developed which drew on: (1) automation/robot-technology availability projections, (2) typical or potential application mission task sets, (3) performance simulations, (4) project schedule constraints, and (5) project funding constraints. Design tradeoffs and configuration/performance iterations were conducted by comparing feasible technology/task set configurations against schedule/budget constraints as well as original program target technology objectives. The final system configuration, task set, and technology set reflected a balanced advancement in state-of-the-art robotic technologies, while meeting programmatic objectives and schedule/cost constraints.

Development of Milestone Schedules for Selected Logistics Support Directorate Programs. Appendix A. Part 2. Task Summaries.

DTIC Science & Technology

1987-09-15

MAC; CODE NUMBER: NONE AND REPAIR PARTS AND SPECIAL TOOLS LIST (RPSTL). RESPONSIBILITY: ROY & ILS DURATION: 32.00 WORK DAYS PRE PPPL SCHEDULE...ILS DURATION: 22.00 WORK DAYS R/V PPPL SCHEDULE: DVPMARPS REVIEW AND VALIDATE PRELIMINARY PROVISIONING PARTS LIST. CODE NUMBER: NONE RESPONSIBILITY

Power Aware Distributed Systems

DTIC Science & Technology

2004-01-01

detection or threshold functions to trigger the main CPU. The main processor can sleep and either wakeup on a schedule or by a positive threshold event...the RTOS must determine if wake-up latency can be tolerated (or, if it could be hidden by pre- wakeup ). The prediction accuracy for scheduling ...and processor shutdown/ wakeup . This analysis can be used to accurately analyze the schedulability of non-concrete periodic task sets, scheduled using

Scheduling real-time, periodic jobs using imprecise results

NASA Technical Reports Server (NTRS)

Liu, Jane W. S.; Lin, Kwei-Jay; Natarajan, Swaminathan

1987-01-01

A process is called a monotone process if the accuracy of its intermediate results is non-decreasing as more time is spent to obtain the result. The result produced by a monotone process upon its normal termination is the desired result; the error in this result is zero. External events such as timeouts or crashes may cause the process to terminate prematurely. If the intermediate result produced by the process upon its premature termination is saved and made available, the application may still find the result unusable and, hence, acceptable; such a result is said to be an imprecise one. The error in an imprecise result is nonzero. The problem of scheduling periodic jobs to meet deadlines on a system that provides the necessary programming language primitives and run-time support for processes to return imprecise results is discussed. This problem differs from the traditional scheduling problems since the scheduler may choose to terminate a task before it is completed, causing it to produce an acceptable but imprecise result. Consequently, the amounts of processor time assigned to tasks in a valid schedule can be less than the amounts of time required to complete the tasks. A meaningful formulation of this problem taking into account the quality of the overall result is discussed. Three algorithms for scheduling jobs for which the effects of errors in results produced in different periods are not cumulative are described, and their relative merits are evaluated.

Advanced Mirror Technology Development (AMTD) Project Status

NASA Technical Reports Server (NTRS)

Stahl, H. Philip

2014-01-01

To date, AMTD Phase 1 has accomplished all of its technical tasks on-schedule and on-budget. AMTD was awarded a Phase 2 contract. We are now performing Phase 2 tasks along with those tasks continued from Phase 1.

Strategic workload management and decision biases in aviation

NASA Technical Reports Server (NTRS)

Raby, Mireille; Wickens, Christopher D.

1994-01-01

Thirty pilots flew three simulated landing approaches under conditions of low, medium, and high workload. Workload conditions were created by varying time pressure and external communications requirements. Our interest was in how the pilots strategically managed or adapted to the increasing workload. We independently assessed the pilot's ranking of the priority of different discrete tasks during the approach and landing. Pilots were found to sacrifice some aspects of primary flight control as workload increased. For discrete tasks, increasing workload increased the amount of time in performing the high priority tasks, decreased the time in performing those of lowest priority, and did not affect duration of performance episodes or optimality of scheduling of tasks of any priority level. Individual differences analysis revealed that high-performing subjects scheduled discrete tasks earlier in the flight and shifted more often between different activities.

Teaching Task Sequencing via Verbal Mediation.

ERIC Educational Resources Information Center

Rusch, Frank R.; And Others

1987-01-01

Verbal sequence training was used to teach a moderately mentally retarded woman to sequence job-related tasks. Learning to say the tasks in the proper sequence resulted in the employee performing her tasks in that sequence, and the employee was capable of mediating her own work behavior when scheduled changes occurred. (Author/JDD)

The influence of professional expertise and task complexity upon the potency of the contextual interference effect.

PubMed

Ollis, Stewart; Button, Chris; Fairweather, Malcolm

2005-03-01

The contextual interference (CI) effect has been investigated through practice schedule manipulations within both basic and applied studies. Despite extensive research activity there is little conclusive evidence regarding the optimal practice structure of real world manipulative tasks in professional training settings. The present study therefore assessed the efficacy of practising simple and complex knot-tying skills in professional fire-fighters training. Forty-eight participants were quasi-randomly assigned to various practice schedules along the CI continuum. Twenty-four participants were students selected for their novice knot-tying capabilities and 24 were experienced fire-fighters who were more 'experienced knot-tiers'. They were assessed for skill acquisition, retention and transfer effects having practiced tying knots classified as simple or complex. Surprisingly, high levels of CI scheduling enhance learning for novices even when practising a complex task. The findings also revealed that CI benefits are most apparent as learners engage in tasks high in transfer distality. In conclusion, complexity and experience are mediating factors influencing the potency of the CI training effect in real-world settings.

The Limits of Soviet Airpower: The Bear Versus the Mujahideen in Afghanistan, 1979-1989

DTIC Science & Technology

1997-06-01

satellite imagery identified Soviet TMS-65 decontamination vehicles and AGV-3 detox chambers in the vicinity of combat areas. In addition, the...Vladislav Tamarov, Afghanistan: Soviet Vietnam, trans. Naomi Marcus, Marianne Clarke Trangen, and Vladislav Tamarov (San Francisco: Mercury House...Tamarov. San Francisco: Mercury House, 1992. Turbiville, Graham. Ambush! The Road War in Afghanistan. Fort Leavenworth, KS: Soviet Army Studies Office

The Effects of Task Fluency and Concurrent Reinforcement Schedules on Student Choice Allocation between Math Tasks

ERIC Educational Resources Information Center

Zaman, Maliha

2010-01-01

Students may avoid working on difficult tasks because it takes them longer to complete those tasks, which results in a delay to reinforcement. Research studies show that reinforcer and response dimensions can be manipulated within a concurrent operants framework to bias choice allocation toward more difficult tasks. The current study extends…

Intraocular pressure control after the implantation of a second Ahmed glaucoma valve.

PubMed

Jiménez-Román, Jesús; Gil-Carrasco, Félix; Costa, Vital Paulino; Schimiti, Rui Barroso; Lerner, Fabián; Santana, Priscila Rezende; Vascocellos, Jose Paulo Cabral; Castillejos-Chévez, Armando; Turati, Mauricio; Fabre-Miranda, Karina

2016-06-01

The objective of this study is to evaluate the efficacy and safety of a second Ahmed glaucoma valve (AGV) in eyes with refractory glaucoma that had undergone prior Ahmed device implantation. This multicenter, retrospective study evaluated 58 eyes (58 patients) that underwent a second AGV (model S2-n = 50, model FP7-n = 8) due to uncontrolled IOP under maximal medical therapy. Outcome measures included IOP, visual acuity, number of glaucoma medications, and postoperative complications. Success was defined as IOP <21 mmHg (criterion 1) or 30 % reduction of IOP (criterion 2) with or without hypotensive medications. Persistent hypotony (IOP <5 mmHg after 3 months of follow-up), loss of light perception, and reintervention for IOP control were defined as failure. Mean preoperative IOP and mean IOPs at 12 and 30 months were 27.55 ± 1.16 mmHg (n = 58), 14.45 ± 0.83 mmHg (n = 42), and 14.81 ± 0.87 mmHg (n = 16), respectively. The mean numbers of glaucoma medications preoperatively at 12 and 30 months were 3.17 ± 0.16 (n = 58), 1.81 ± 0.2 (n = 42), and 1.83 ± 0.35 (n = 18), respectively. The reductions in mean IOP and number of medications were statistically significant at all time intervals (P < 0.001). According to criterion 1, Kaplan-Meier survival curves disclosed success rates of 62.9 % at 12 months and 56.6 % at 30 months. According to criterion 2, Kaplan-Meier survival curves disclosed success rates of 43.9 % at 12 months and 32.9 % at 30 months. The most frequent early complication was hypertensive phase (10.3 %) and the most frequent late complication was corneal edema (17.2 %). Second AGV implantation may effectively reduce IOP in eyes with uncontrolled glaucoma, and is associated with relatively few complications.

Supra-Tenon Capsule Implantation of the Ahmed Glaucoma Valve in Refractory Pediatric Glaucoma.

PubMed

Elhefney, Eman M; Al-Sharkawy, Hossam T; Kishk, Hanem M

2016-09-01

To evaluate the efficacy of supra-Tenon capsule implantation of an Ahmed glaucoma valve (AGV) as a measure to decrease the fibrotic potential of the Tenon capsule on bleb formation and its subsequent effect on intraocular pressure (IOP) control in children with refractory glaucoma. Mansoura Ophthalmic Centre, Faculty of Medicine, Mansoura University, Egypt. A prospective interventional study. Twenty-two eyes of 12 children with refractory glaucoma underwent supra-Tenon capsule implantation of AGV. Ophthalmic examinations under general anesthesia including measurement of the corneal diameter and the IOP with Perkin's tonometer were performed preoperatively, on the first postoperative day, the first postoperative week, weekly for the first month, 2-weekly for the following 3 months, and monthly for at least 18 months. Postoperative complications and the number of glaucoma medications used preoperatively and postoperatively were recorded. The paired Student t test was used to compare preoperative and postoperative data. There were 12 eyes (54.6%) with refractory congenital glaucoma, 7 eyes (31.8%) with refractory pseudophakic glaucoma, and 3 eyes (13.6%) with refractory aphakic glaucoma. Patients included 10 male (83.3%) and 2 female (16.7%) children with a mean age of 16.3±9.7 months. The mean follow-up duration was 24.1±4.3 months. There was a statistically significant difference between the mean preoperative IOP (30.7±2.88 mm Hg) and the mean postoperative IOP (16.1±3.60 mm Hg) (t=16.22 and P=0.000, with a mean decrease in the IOP by 47.6%). The difference between the mean number of antiglaucoma medications before surgery (1.86±0.4) and after surgery (1.0±0.9) was also statistically significant (t=4.31 and P=0.000). Total success was achieved in 18 eyes (81.9%). Postoperative complications included tube exposure and slippage (10%), hypotony (10%), and hyphema (5%). Supra-Tenon capsule implantation of the AGV was successful in controlling the IOP with few postoperative complications in the management of children with refractory glaucoma.

Determination of the Underlying Task Scheduling Algorithm for an Ada Runtime System

DTIC Science & Technology

1989-12-01

was also curious as to how well I could model the test cases with Ada programs . In particular, I wanted to see whether I could model the equal arrival...parameter relationshis=s required to detect the execution of individual algorithms. These test cases were modeled using Ada programs . Then, the...results were analyzed to determine whether the Ada programs were capable of revealing the task scheduling algorithm used by the Ada run-time system. This

Analyzing railroad dispatchers' strategies : a cognitive task analysis of a distributed planning task

DOT National Transportation Integrated Search

1998-10-11

This paper describes a preliminary cognitive task analysis (CTA) that is being conducted to examine how experienced train dispatchers manage and schedule trains. The CTA uses ethnographic field observations and structured interview techniques. The ob...

Fixed-Time Schedule Effects in Combination with Response-Dependent Schedules

ERIC Educational Resources Information Center

Borrero, John C.; Bartels-Meints, Jamie A.; Sy, Jolene R.; Francisco, Monica T.

2011-01-01

We evaluated the effects of fixed-interval (FI), fixed-time (FT), and conjoint (combined) FI FT reinforcement schedules on the responding of 3 adults who had been diagnosed with schizophrenia. Responding on vocational tasks decreased for 2 of 3 participants under FT alone relative to FI alone. Responding under FI FT resulted in response…

Robust Aircraft Squadron Scheduling in the Face of Absenteeism

DTIC Science & Technology

2008-03-01

Complicating matters is absenteeism . If one or more pilots are unable to perform their previously assigned tasks, due to sickness, aircraft failure, or...ROBUST AIRCRAFT SQUADRON SCHEDULING IN THE FACE OF ABSENTEEISM THESIS Osman B Gokcen, 1st...or the United States Government. AFIT/GOR/ENS/08-06 ROBUST AIRCRAFT SQUADRON SCHEDULING IN THE FACE OF ABSENTEEISM THESIS

The R-Shell approach - Using scheduling agents in complex distributed real-time systems

NASA Technical Reports Server (NTRS)

Natarajan, Swaminathan; Zhao, Wei; Goforth, Andre

1993-01-01

Large, complex real-time systems such as space and avionics systems are extremely demanding in their scheduling requirements. The current OS design approaches are quite limited in the capabilities they provide for task scheduling. Typically, they simply implement a particular uniprocessor scheduling strategy and do not provide any special support for network scheduling, overload handling, fault tolerance, distributed processing, etc. Our design of the R-Shell real-time environment fcilitates the implementation of a variety of sophisticated but efficient scheduling strategies, including incorporation of all these capabilities. This is accomplished by the use of scheduling agents which reside in the application run-time environment and are responsible for coordinating the scheduling of the application.

Genetic algorithm based task reordering to improve the performance of batch scheduled massively parallel scientific applications

DOE PAGES

Sankaran, Ramanan; Angel, Jordan; Brown, W. Michael

2015-04-08

The growth in size of networked high performance computers along with novel accelerator-based node architectures has further emphasized the importance of communication efficiency in high performance computing. The world's largest high performance computers are usually operated as shared user facilities due to the costs of acquisition and operation. Applications are scheduled for execution in a shared environment and are placed on nodes that are not necessarily contiguous on the interconnect. Furthermore, the placement of tasks on the nodes allocated by the scheduler is sub-optimal, leading to performance loss and variability. Here, we investigate the impact of task placement on themore » performance of two massively parallel application codes on the Titan supercomputer, a turbulent combustion flow solver (S3D) and a molecular dynamics code (LAMMPS). Benchmark studies show a significant deviation from ideal weak scaling and variability in performance. The inter-task communication distance was determined to be one of the significant contributors to the performance degradation and variability. A genetic algorithm-based parallel optimization technique was used to optimize the task ordering. This technique provides an improved placement of the tasks on the nodes, taking into account the application's communication topology and the system interconnect topology. As a result, application benchmarks after task reordering through genetic algorithm show a significant improvement in performance and reduction in variability, therefore enabling the applications to achieve better time to solution and scalability on Titan during production.« less

An effective repetitive training schedule to achieve skill proficiency using a novel robotic virtual reality simulator.

PubMed

Kang, Sung Gu; Ryu, Byung Ju; Yang, Kyung Sook; Ko, Young Hwii; Cho, Seok; Kang, Seok Ho; Patel, Vipul R; Cheon, Jun

2015-01-01

A robotic virtual reality simulator (Mimic dV-Trainer) can be a useful training method for the da Vinci surgical system. Herein, we investigate several repetitive training schedules and determine which is the most effective. A total of 30 medical students were enrolled and were divided into 3 groups according to the training schedule. Group 1 performed the task 1 hour daily for 4 consecutive days, group II performed the task on once per week for 1 hour for 4 consecutive weeks, and group III performed the task for 4 consecutive hours in 1 day. The effects of training were investigated by analyzing the number of repetitions and the time required to complete the "Tube 2" simulation task when the learning curve plateau was reached. The point at which participants reached a stable score was evaluated using the cumulative sum control graph. The average time to complete the task at the learning curve plateau was 150.3 seconds in group I, 171.9 seconds in group II, and 188.5 seconds in group III. The number of task repetitions required to reach the learning curve plateau was 45 repetitions in group I, 36 repetitions in group II, and 39 repetitions in group III. Therefore, there was continuous improvement in the time required to perform the task after 40 repetitions in group I only. There was a significant correlation between improvement in each trial interval and attempt, and the correlation coefficient (0.924) in group I was higher than that in group II (0.899) and group III (0.838). Daily 1-hour practice sessions performed for 4 consecutive days resulted in the best final score, continuous score improvement, and effective training while minimizing fatigue. This repetition schedule can be used for effectively training novices in future. Copyright © 2015 Association of Program Directors in Surgery. Published by Elsevier Inc. All rights reserved.

Dissociable effects of practice variability on learning motor and timing skills.

PubMed

Caramiaux, Baptiste; Bevilacqua, Frédéric; Wanderley, Marcelo M; Palmer, Caroline

2018-01-01

Motor skill acquisition inherently depends on the way one practices the motor task. The amount of motor task variability during practice has been shown to foster transfer of the learned skill to other similar motor tasks. In addition, variability in a learning schedule, in which a task and its variations are interweaved during practice, has been shown to help the transfer of learning in motor skill acquisition. However, there is little evidence on how motor task variations and variability schedules during practice act on the acquisition of complex motor skills such as music performance, in which a performer learns both the right movements (motor skill) and the right time to perform them (timing skill). This study investigated the impact of rate (tempo) variability and the schedule of tempo change during practice on timing and motor skill acquisition. Complete novices, with no musical training, practiced a simple musical sequence on a piano keyboard at different rates. Each novice was assigned to one of four learning conditions designed to manipulate the amount of tempo variability across trials (large or small tempo set) and the schedule of tempo change (randomized or non-randomized order) during practice. At test, the novices performed the same musical sequence at a familiar tempo and at novel tempi (testing tempo transfer), as well as two novel (but related) sequences at a familiar tempo (testing spatial transfer). We found that practice conditions had little effect on learning and transfer performance of timing skill. Interestingly, practice conditions influenced motor skill learning (reduction of movement variability): lower temporal variability during practice facilitated transfer to new tempi and new sequences; non-randomized learning schedule improved transfer to new tempi and new sequences. Tempo (rate) and the sequence difficulty (spatial manipulation) affected performance variability in both timing and movement. These findings suggest that there is a dissociable effect of practice variability on learning complex skills that involve both motor and timing constraints.

Report of the Cost Assessment and Validation Task Force on the International Space Station

NASA Technical Reports Server (NTRS)

1998-01-01

The Cost Assessment and Validation (CAV) Task Force was established for independent review and assessment of cost, schedule and partnership performance on the International Space Station (ISS) Program. The CAV Task Force has made the following key findings: The International Space Station Program has made notable and reasonable progress over the past four years in defining and executing a very challenging and technically complex effort. The Program size, complexity, and ambitious schedule goals were beyond that which could be reasonably achieved within the $2.1 billion annual cap or $17.4 billion total cap. A number of critical risk elements are likely to have an adverse impact on the International Space Station cost and schedule. The schedule uncertainty associated with Russian implementation of joint Partnership agreements is the major threat to the ISS Program. The Fiscal Year (FY) 1999 budget submission to Congress is not adequate to execute the baseline ISS Program, cover normal program growth, and address the known critical risks. Additional annual funding of between $130 million and $250 million will be required. Completion of ISS assembly is likely to be delayed from one to three years beyond December 2003.

Cost Assessment and Validation Task Force on the International Space Station

NASA Technical Reports Server (NTRS)

1998-01-01

The Cost Assessment and Validation (CAV) Task Force was established for independent review and assessment of cost, schedule and partnership performance on the International Space Station (ISS) Program. The CAV Task Force has made the following key findings: The International Space Station Program has made notable and reasonable progress over the past four years in defining and executing a very challenging and technically complex effort; The Program, size, complexity, and ambitious schedule goals were beyond that which could be reasonably achieved within the $2.1 billion annual cap or $17.4 billion total cap; A number of critical risk elements are likely to have an adverse impact on the International Space Station cost and schedule; The schedule uncertainty associated with Russian implementation of joint Partnership agreements is the major threat to the ISS Program; The Fiscal Year (FY) 1999 budget submission to Congress is not adequate to execute the baseline ISS Program, cover normal program, growth, and address the known critical risks. Additional annual funding of between $130 million and $250 million will be required; and Completion of ISS assembly is likely to be delayed from, one to three years beyond December 2003.

Nonpreemptive run-time scheduling issues on a multitasked, multiprogrammed multiprocessor with dependencies, bidimensional tasks, folding and dynamic graphs

DOE Office of Scientific and Technical Information (OSTI.GOV)

Miller, Allan Ray

1987-05-01

Increases in high speed hardware have mandated studies in software techniques to exploit the parallel capabilities. This thesis examines the effects a run-time scheduler has on a multiprocessor. The model consists of directed, acyclic graphs, generated from serial FORTRAN benchmark programs by the parallel compiler Parafrase. A multitasked, multiprogrammed environment is created. Dependencies are generated by the compiler. Tasks are bidimensional, i.e., they may specify both time and processor requests. Processor requests may be folded into execution time by the scheduler. The graphs may arrive at arbitrary time intervals. The general case is NP-hard, thus, a variety of heuristics aremore » examined by a simulator. Multiprogramming demonstrates a greater need for a run-time scheduler than does monoprogramming for a variety of reasons, e.g., greater stress on the processors, a larger number of independent control paths, more variety in the task parameters, etc. The dynamic critical path series of algorithms perform well. Dynamic critical volume did not add much. Unfortunately, dynamic critical path maximizes turnaround time as well as throughput. Two schedulers are presented which balance throughput and turnaround time. The first requires classification of jobs by type; the second requires selection of a ratio value which is dependent upon system parameters. 45 refs., 19 figs., 20 tabs.« less

A Scheduling Algorithm for Replicated Real-Time Tasks

NASA Technical Reports Server (NTRS)

Yu, Albert C.; Lin, Kwei-Jay

1991-01-01

We present an algorithm for scheduling real-time periodic tasks on a multiprocessor system under fault-tolerant requirement. Our approach incorporates both the redundancy and masking technique and the imprecise computation model. Since the tasks in hard real-time systems have stringent timing constraints, the redundancy and masking technique are more appropriate than the rollback techniques which usually require extra time for error recovery. The imprecise computation model provides flexible functionality by trading off the quality of the result produced by a task with the amount of processing time required to produce it. It therefore permits the performance of a real-time system to degrade gracefully. We evaluate the algorithm by stochastic analysis and Monte Carlo simulations. The results show that the algorithm is resilient under hardware failures.

Task scheduling in dataflow computer architectures

NASA Technical Reports Server (NTRS)

Katsinis, Constantine

1994-01-01

Dataflow computers provide a platform for the solution of a large class of computational problems, which includes digital signal processing and image processing. Many typical applications are represented by a set of tasks which can be repetitively executed in parallel as specified by an associated dataflow graph. Research in this area aims to model these architectures, develop scheduling procedures, and predict the transient and steady state performance. Researchers at NASA have created a model and developed associated software tools which are capable of analyzing a dataflow graph and predicting its runtime performance under various resource and timing constraints. These models and tools were extended and used in this work. Experiments using these tools revealed certain properties of such graphs that require further study. Specifically, the transient behavior at the beginning of the execution of a graph can have a significant effect on the steady state performance. Transformation and retiming of the application algorithm and its initial conditions can produce a different transient behavior and consequently different steady state performance. The effect of such transformations on the resource requirements or under resource constraints requires extensive study. Task scheduling to obtain maximum performance (based on user-defined criteria), or to satisfy a set of resource constraints, can also be significantly affected by a transformation of the application algorithm. Since task scheduling is performed by heuristic algorithms, further research is needed to determine if new scheduling heuristics can be developed that can exploit such transformations. This work has provided the initial development for further long-term research efforts. A simulation tool was completed to provide insight into the transient and steady state execution of a dataflow graph. A set of scheduling algorithms was completed which can operate in conjunction with the modeling and performance tools previously developed. Initial studies on the performance of these algorithms were done to examine the effects of application algorithm transformations as measured by such quantities as number of processors, time between outputs, time between input and output, communication time, and memory size.

Scheduling time-critical graphics on multiple processors

NASA Technical Reports Server (NTRS)

Meyer, Tom W.; Hughes, John F.

1995-01-01

This paper describes an algorithm for the scheduling of time-critical rendering and computation tasks on single- and multiple-processor architectures, with minimal pipelining. It was developed to manage scientific visualization scenes consisting of hundreds of objects, each of which can be computed and displayed at thousands of possible resolution levels. The algorithm generates the time-critical schedule using progressive-refinement techniques; it always returns a feasible schedule and, when allowed to run to completion, produces a near-optimal schedule which takes advantage of almost the entire multiple-processor system.

System-level power optimization for real-time distributed embedded systems

NASA Astrophysics Data System (ADS)

Luo, Jiong

Power optimization is one of the crucial design considerations for modern electronic systems. In this thesis, we present several system-level power optimization techniques for real-time distributed embedded systems, based on dynamic voltage scaling, dynamic power management, and management of peak power and variance of the power profile. Dynamic voltage scaling has been widely acknowledged as an important and powerful technique to trade off dynamic power consumption and delay. Efficient dynamic voltage scaling requires effective variable-voltage scheduling mechanisms that can adjust voltages and clock frequencies adaptively based on workloads and timing constraints. For this purpose, we propose static variable-voltage scheduling algorithms utilizing criticalpath driven timing analysis for the case when tasks are assumed to have uniform switching activities, as well as energy-gradient driven slack allocation for a more general scenario. The proposed techniques can achieve closeto-optimal power savings with very low computational complexity, without violating any real-time constraints. We also present algorithms for power-efficient joint scheduling of multi-rate periodic task graphs along with soft aperiodic tasks. The power issue is addressed through both dynamic voltage scaling and power management. Periodic task graphs are scheduled statically. Flexibility is introduced into the static schedule to allow the on-line scheduler to make local changes to PE schedules through resource reclaiming and slack stealing, without interfering with the validity of the global schedule. We provide a unified framework in which the response times of aperiodic tasks and power consumption are dynamically optimized simultaneously. Interconnection network fabrics point to a new generation of power-efficient and scalable interconnection architectures for distributed embedded systems. As the system bandwidth continues to increase, interconnection networks become power/energy limited as well. Variable-frequency links have been designed by circuit designers for both parallel and serial links, which can adaptively regulate the supply voltage of transceivers to a desired link frequency, to exploit the variations in bandwidth requirement for power savings. We propose solutions for simultaneous dynamic voltage scaling of processors and links. The proposed solution considers real-time scheduling, flow control, and packet routing jointly. It can trade off the power consumption on processors and communication links via efficient slack allocation, and lead to more power savings than dynamic voltage scaling on processors alone. For battery-operated systems, the battery lifespan is an important concern. Due to the effects of discharge rate and battery recovery, the discharge pattern of batteries has an impact on the battery lifespan. Battery models indicate that even under the same average power consumption, reducing peak power current and variance in the power profile can increase the battery efficiency and thereby prolong battery lifetime. To take advantage of these effects, we propose battery-driven scheduling techniques for embedded applications, to reduce the peak power and the variance in the power profile of the overall system under real-time constraints. The proposed scheduling algorithms are also beneficial in addressing reliability and signal integrity concerns by effectively controlling peak power and variance of the power profile.

Cache Sharing and Isolation Tradeoffs in Multicore Mixed-Criticality Systems

DTIC Science & Technology

2015-05-01

form of lockdown registers, to provide way-based partitioning. These alternatives are illustrated in Fig. 1 with respect to a quad-core ARM Cortex A9... processor (as we do for Level-A and -B tasks), but they did not consider MC systems. Altmeyer et al. [1] considered uniprocessor scheduling on a system with a...framework. We randomly generated task sets and determined the fraction that were schedulable on our target hardware platform, the quad-core ARM Cortex A9

The Use of the MASCOT Philosophy for the Construction of Ada Programs,

DTIC Science & Technology

1983-10-01

dependent units must be recompiled. Because of Ada’s commitment to abstract data types tasks are treated as data types with certain restrictions. A task...3.3.3.1.4 End of Slice Action The scheduling algorithm determines, for each type of Slice termination, how the Scheduler treats Activities whose Slice has...Pools. The MASCOT Machine treats them as constructionally equivalent (refer 3.3.1.1.1). Because of the constraints brought in by the formulation of

Effects of Simulated Surface Effect Ship Motions on Crew Habitability. Phase II. Volume 3. Visual-Motor Tasks and Subjective Evaluations

DTIC Science & Technology

1977-05-01

simulated rmotions ; and detaiJl.s on the daily work/rest schedule, as well as the overall run ,schedule (Ref.20). * Volume 4, "Crew Cognitive Functions...the outset: 1) the very small sampling of well- motivated crewmen made it difficult to generalize the results to a wider population; and 2) the...a:; backups. Selection of primary crewmen was based on satisfactory task learning and motivation demonstrated during the training period, any minor

Follow-On Development of Structured Training for the Close Combat Tactical Trainer.

DTIC Science & Technology

1998-07-01

and Evaluation ( IOT &E) scheduled for the second quarter of FY 1998. Though the STRUCCTT Project provided a variety of exercises for the initial...References 73 APPENDIX A. ACRONYMS A-l B. FORMATIVE EVALUATION PROJECT LOG B-l C. TASK CHARTS C-l D. TASK FORCE SCHEDULE D-l E. SURVEY...phases of all three missions. The proponent selected tables to be developed assuring that most capabilities of the CCTT were used during the IOT &E

DEVELOPMENT AND APPLICATION OF METHODS TO ASSESS HUMAN EXPOSURE TO PESTICIDES

EPA Science Inventory

Note: this task is schedule to end September 2003. Two tasks will take its place: method development for emerging pesticides including chiral chemistry applications, and in-house laboratory operations. Field sampling methods are covered under a new task proposed this year.
<...

An Evaluation of the Value of Choice-Making Opportunities in Single-Operant Arrangements: Simple Fixed- and Progressive-Ratio Schedules

ERIC Educational Resources Information Center

Tiger, Jeffrey H.; Toussaint, Karen A.; Roath, Christopher T.

2010-01-01

The current study compared the effects of choice and no-choice reinforcement conditions on the task responding of 3 children with autism across 2 single-operant paradigm reinforcer assessments. The first assessment employed simple fixed-ratio (FR) schedules; the second used progressive-ratio (PR) schedules. The latter assessment identified the…

Procedural Tests for Anti-G Protective Devices. Volume II. G-Sensitivity Tests

DTIC Science & Technology

1979-12-01

of these valves was used in only one type of aircraft--the ALAR AGV in ...pattern. 3) Total included, inexplicitly in the total for this column along with Failures au.d OTH/MAL’s are Type 6 HOW MALFUNCTION CODES--which...maintenance. Because Type 6 HOW MALFUNCTION CODESI. .were not considered pertinent to this investigation, they wer!. not included in the report. All figures of

Endophthalmitis associated with the Ahmed glaucoma valve implant

PubMed Central

Al-Torbak, A A; Al-Shahwan, S; Al-Jadaan, I; Al-Hommadi, A; Edward, D P

2005-01-01

Aim: To investigate the rate, risk factors, clinical course, and treatment outcomes of endophthalmitis following glaucoma drainage implant (GDI) surgery. Methods: A computerised relational database search was conducted to identify all patients who were implanted with Ahmed glaucoma valve (AGV) and developed endophthalmitis following surgery at the King Khaled Eye Specialist Hospital in Riyadh, Saudi Arabia, between 1 January 1994 and 30 November 2003. Only medical records of the patients who developed endophthalmitis were retrospectively reviewed. Results: 542 eyes of 505 patients who were on active follow up were included in the study. Endophthalmitis developed in nine (1.7%) eyes; the rate was five times higher in children than in adults. Delayed endophthalmitis (developed 6 weeks after surgery) occurred in eight of nine eyes. Conjunctival erosion overlying the AGV tube was present in six of nine eyes. Common organisms isolated in the vitreous included Haemophilus influenzae and Streptococcus species. Multiple regression analysis revealed that younger age and conjunctival erosion over the tube were significant risk factors associated with endophthalmitis. Conclusion: Endophthalmitis is a rare complication of GDI surgery that appears to be more common in children. Conjunctival dehiscence over the GDI tube seems to represent a major risk factor for endophthalmitis. Prompt surgical revision of an exposed GDI tube is highly recommended. PMID:15774923

Endophthalmitis associated with the Ahmed glaucoma valve implant.

PubMed

Al-Torbak, A A; Al-Shahwan, S; Al-Jadaan, I; Al-Hommadi, A; Edward, D P

2005-04-01

To investigate the rate, risk factors, clinical course, and treatment outcomes of endophthalmitis following glaucoma drainage implant (GDI) surgery. A computerised relational database search was conducted to identify all patients who were implanted with Ahmed glaucoma valve (AGV) and developed endophthalmitis following surgery at the King Khaled Eye Specialist Hospital in Riyadh, Saudi Arabia, between 1 January 1994 and 30 November 2003. Only medical records of the patients who developed endophthalmitis were retrospectively reviewed. 542 eyes of 505 patients who were on active follow up were included in the study. Endophthalmitis developed in nine (1.7%) eyes; the rate was five times higher in children than in adults. Delayed endophthalmitis (developed 6 weeks after surgery) occurred in eight of nine eyes. Conjunctival erosion overlying the AGV tube was present in six of nine eyes. Common organisms isolated in the vitreous included Haemophilus influenzae and Streptococcus species. Multiple regression analysis revealed that younger age and conjunctival erosion over the tube were significant risk factors associated with endophthalmitis. Endophthalmitis is a rare complication of GDI surgery that appears to be more common in children. Conjunctival dehiscence over the GDI tube seems to represent a major risk factor for endophthalmitis. Prompt surgical revision of an exposed GDI tube is highly recommended.

Agent-Based Simulations for Project Management

NASA Technical Reports Server (NTRS)

White, J. Chris; Sholtes, Robert M.

2011-01-01

Currently, the most common approach used in project planning tools is the Critical Path Method (CPM). While this method was a great improvement over the basic Gantt chart technique being used at the time, it now suffers from three primary flaws: (1) task duration is an input, (2) productivity impacts are not considered , and (3) management corrective actions are not included. Today, computers have exceptional computational power to handle complex simulations of task e)(eculion and project management activities (e.g ., dynamically changing the number of resources assigned to a task when it is behind schedule). Through research under a Department of Defense contract, the author and the ViaSim team have developed a project simulation tool that enables more realistic cost and schedule estimates by using a resource-based model that literally turns the current duration-based CPM approach "on its head." The approach represents a fundamental paradigm shift in estimating projects, managing schedules, and reducing risk through innovative predictive techniques.

The Effects of a Treatment Package in Establishing Independent Academic Work Skills in Children with Autism.

ERIC Educational Resources Information Center

Pelios, Lillian V.; MacDuff, Gregory S.; Axelrod, Saul

2003-01-01

This study evaluated a treatment package to improve on-task academic skills by three children with autism. Program components included delayed reinforcement for on-task and on-schedule responding, fading of instructional prompts and instructor's presence, unpredictable supervision, and response cost for off-task responding. On-task and on-schedule…

Assessing and Increasing Staff Preference for Job Tasks Using Concurrent-Chains Schedules and Probabilistic Outcomes

ERIC Educational Resources Information Center

Reed, Derek D.; DiGennaro Reed, Florence D.; Campisano, Natalie; Lacourse, Kristen; Azulay, Richard L.

2012-01-01

The assessment and improvement of staff members' subjective valuation of nonpreferred work tasks may be one way to increase the quality of staff members' work life. The Task Enjoyment Motivation Protocol (Green, Reid, Passante, & Canipe, 2008) provides a process for supervisors to identify the aversive qualities of nonpreferred job tasks.…

Space station human productivity study. Volume 5: Management plans

NASA Technical Reports Server (NTRS)

1985-01-01

The 67 Management Plans represent recommended study approaches for resolving 108 of the 305 Issues which were identified. Each study Management Plan is prepared in three formats: Management Plan Overview (lists the subsumed Issues, study background, and related overview information); Study Plan (details the study approach by tasks, lists special needs, and describes expected study products); Schedule-Task Flow (provides a time-lined schedule for the study tasks and resource requirements). The Management Relationships Matrix, included in this volume, shows the data input-output relationships among all recommended studies. A listing is also included which cross-references the unresolved requirements to Issues to management plans. A glossary of all abbreviations utilized is provided.

NPS-SCAT; Communications System Design, Test and Integration of NPS’ First CubeSat

DTIC Science & Technology

2010-09-01

18 c. MHX (Primary Transceiver) Wakeup Task ...19 d. Transmit MHX (Primary Transceiver) Task .20 e. Receive MHX (Primary Transceiver...Beacon Antenna Deploy Task......................17  Figure 8.  Collect Data Task...............................19  Figure 9.  MHX Wakeup Task...to provide education while keeping scheduling and cost minimal, and maintaining a standard for building a launchable spacecraft. The CubeSat

Mirtazapine and ketanserin alter preference for gambling-like schedules of reinforcement in rats.

PubMed

Persons, Amanda L; Tedford, Stephanie E; Celeste Napier, T

2017-07-03

Drug and behavioral addictions have overlapping features, e.g., both manifest preference for larger, albeit costlier, reinforcement options in cost/benefit decision-making tasks. Our prior work revealed that the mixed-function serotonergic compound, mirtazapine, attenuates behaviors by rats motivated by abused drugs. To extend this work to behavioral addictions, here we determined if mirtazapine and/or ketanserin, another mixed-function serotonin-acting compound, can alter decision-making in rats that is independent of drug (or food)-motivated reward. Accordingly, we developed a novel variable-ratio task in rats wherein intracranial self-stimulation was used as the positive reinforcer. Using lever pressing for various levels of brain stimulation, the operant task provided choices between a small brain stimulation current delivered on a fixed-ratio schedule (i.e., a predictable reward) and a large brain stimulation delivered following an unpredictable number of responses (i.e., a variable-ratio schedule). This task allowed for demonstration of individualized preference and detection of shifts in motivational influences during a pharmacological treatment. Once baseline preference was established, we determined that pretreatment with mirtazapine or ketanserin significantly decreased preference for the large reinforcer presented after gambling-like schedules of reinforcement. When the rats were tested the next day without drug, preference for the unpredictable large reinforcer option was restored. These data demonstrate that mirtazapine and ketanserin can reduce preference for larger, costlier reinforcement options, and illustrate the potential for these drugs to alter behavior. Copyright © 2017 Elsevier Inc. All rights reserved.

An Enabling Technology for New Planning and Scheduling Paradigms

NASA Technical Reports Server (NTRS)

Jaap, John; Davis, Elizabeth

2004-01-01

The Night Projects Directorate at NASA's Marshall Space Flight Center is developing a new planning and scheduling environment and a new scheduling algorithm to enable a paradigm shift in planning and scheduling concepts. Over the past 33 years Marshall has developed and evolved a paradigm for generating payload timelines for Skylab, Spacelab, various other Shuttle payloads, and the International Space Station. The current paradigm starts by collecting the requirements, called ?ask models," from the scientists and technologists for the tasks that are to be scheduled. Because of shortcomings in the current modeling schema, some requirements are entered as notes. Next, a cadre with knowledge of vehicle and hardware modifies these models to encompass and be compatible with the hardware model; again, notes are added when the modeling schema does not provide a better way to represent the requirements. Finally, the models are modified to be compatible with the scheduling engine. Then the models are submitted to the scheduling engine for automatic scheduling or, when requirements are expressed in notes, the timeline is built manually. A future paradigm would provide a scheduling engine that accepts separate science models and hardware models. The modeling schema would have the capability to represent all the requirements without resorting to notes. Furthermore, the scheduling engine would not require that the models be modified to account for the capabilities (limitations) of the scheduling engine. The enabling technology under development at Marshall has three major components: (1) A new modeling schema allows expressing all the requirements of the tasks without resorting to notes or awkward contrivances. The chosen modeling schema is both maximally expressive and easy to use. It utilizes graphical methods to show hierarchies of task constraints and networks of temporal relationships. (2) A new scheduling algorithm automatically schedules the models without the intervention of a scheduling expert. The algorithm is tuned for the constraint hierarchies and the complex temporal relationships provided by the modeling schema. It has an extensive search algorithm that can exploit timing flexibilities and constraint and relationship options. (3) An innovative architecture allows multiple remote users to simultaneously model science and technology requirements and other users to model vehicle and hardware characteristics. The architecture allows the remote users to submit scheduling requests directly to the scheduling engine and immediately see the results. These three components are integrated so that science and technology experts with no knowledge of the vehicle or hardware subsystems and no knowledge of the internal workings of the scheduling engine have the ability to build and submit scheduling requests and see the results. The immediate feedback will hone the users' modeling skills and ultimately enable them to produce the desired timeline. This paper summarizes the three components of the enabling technology and describes how this technology would make a new paradigm possible.

A Multitasking General Executive for Compound Continuous Tasks

ERIC Educational Resources Information Center

Salvucci, Dario D.

2005-01-01

As cognitive architectures move to account for increasingly complex real-world tasks, one of the most pressing challenges involves understanding and modeling human multitasking. Although a number of existing models now perform multitasking in real-world scenarios, these models typically employ customized executives that schedule tasks for the…

Parasites modulate within-colony activity and accelerate the temporal polyethism schedule of a social insect, the honey bee.

PubMed

Natsopoulou, Myrsini E; McMahon, Dino P; Paxton, Robert J

Task allocation in social insect colonies is generally organised into an age-related division of labour, termed the temporal polyethism schedule, which may in part have evolved to reduce infection of the colony's brood by pests and pathogens. The temporal polyethism schedule is sensitive to colony perturbations that may lead to adaptive changes in task allocation, maintaining colony homeostasis. Though social insects can be infected by a range of parasites, little is known of how these parasites impact within-colony behaviour and the temporal polyethism schedule. We use honey bees ( Apis mellifera ) experimentally infected by two of their emerging pathogens, Deformed wing virus (DWV), which is relatively understudied concerning its behavioural impact on its host, and the exotic microsporidian Nosema ceranae . We examined parasite effects on host temporal polyethism and patterns of activity within the colony. We found that pathogens accelerated the temporal polyethism schedule, but without reducing host behavioural repertoire. Infected hosts exhibited increased hyperactivity, allocating more time to self-grooming and foraging-related tasks. The strength of behavioural alterations we observed was found to be pathogen specific; behavioural modifications were more pronounced in virus-treated hosts versus N. ceranae -treated hosts, with potential benefits for the colony in terms of reducing within-colony transmission. Investigating the effects of multiple pathogens on behavioural patterns of social insects could play a crucial role in understanding pathogen spread within a colony and their effects on colony social organisation.

An Analysis of Task-Scheduling for a Generic Avionics Mission Computer

DTIC Science & Technology

2006-04-01

3 3. 1. 3 Response Time Analysis........................................................................... 8 3. 2 Non - Preemptive ...Fixed Priority Scheduling ...................................................... 10 3. 2. 1 Simple Non - Preemptive Response Time Test...10 3. 2. 2 Non - Preemptive Response Time Test .................................................. 12 3. 3 Asynchronous Fixed

Maintenance and operations tasks accomplished at DSS 12 during the antenna panel replacement downtime

NASA Technical Reports Server (NTRS)

Butcher, L.; Jonas, T.; Wood, W.

1982-01-01

The heavy schedule of tracking activities at the Echo Deep Space Station (DSS 12) prevents some time-consuming maintenance tasks from being performed. Careful coordination prior to and during a mandatory task (antenna panel replacement) made it possible to do a large number of unrelated tasks that ordinarily would have to be deferred. The maintenance and operations tasks accomplished during the downtime are described.

A Dynamic Scheduling Method of Earth-Observing Satellites by Employing Rolling Horizon Strategy

PubMed Central

Dishan, Qiu; Chuan, He; Jin, Liu; Manhao, Ma

2013-01-01

Focused on the dynamic scheduling problem for earth-observing satellites (EOS), an integer programming model is constructed after analyzing the main constraints. The rolling horizon (RH) strategy is proposed according to the independent arriving time and deadline of the imaging tasks. This strategy is designed with a mixed triggering mode composed of periodical triggering and event triggering, and the scheduling horizon is decomposed into a series of static scheduling intervals. By optimizing the scheduling schemes in each interval, the dynamic scheduling of EOS is realized. We also propose three dynamic scheduling algorithms by the combination of the RH strategy and various heuristic algorithms. Finally, the scheduling results of different algorithms are compared and the presented methods in this paper are demonstrated to be efficient by extensive experiments. PMID:23690742

Developing optimal nurses work schedule using integer programming

NASA Astrophysics Data System (ADS)

Shahidin, Ainon Mardhiyah; Said, Mohd Syazwan Md; Said, Noor Hizwan Mohamad; Sazali, Noor Izatie Amaliena

2017-08-01

Time management is the art of arranging, organizing and scheduling one's time for the purpose of generating more effective work and productivity. Scheduling is the process of deciding how to commit resources between varieties of possible tasks. Thus, it is crucial for every organization to have a good work schedule for their staffs. The job of Ward nurses at hospitals runs for 24 hours every day. Therefore, nurses will be working using shift scheduling. This study is aimed to solve the nurse scheduling problem at an emergency ward of a private hospital. A 7-day work schedule for 7 consecutive weeks satisfying all the constraints set by the hospital will be developed using Integer Programming. The work schedule for the nurses obtained gives an optimal solution where all the constraints are being satisfied successfully.

A dynamic scheduling method of Earth-observing satellites by employing rolling horizon strategy.

PubMed

Dishan, Qiu; Chuan, He; Jin, Liu; Manhao, Ma

2013-01-01

Focused on the dynamic scheduling problem for earth-observing satellites (EOS), an integer programming model is constructed after analyzing the main constraints. The rolling horizon (RH) strategy is proposed according to the independent arriving time and deadline of the imaging tasks. This strategy is designed with a mixed triggering mode composed of periodical triggering and event triggering, and the scheduling horizon is decomposed into a series of static scheduling intervals. By optimizing the scheduling schemes in each interval, the dynamic scheduling of EOS is realized. We also propose three dynamic scheduling algorithms by the combination of the RH strategy and various heuristic algorithms. Finally, the scheduling results of different algorithms are compared and the presented methods in this paper are demonstrated to be efficient by extensive experiments.

Technology Insertion (TI)/Industrial Process Improvement (IP) Task Order Number 18. Contract Summary Report/Quick Fix Plan for OO-ALC (Optical Repair).

DTIC Science & Technology

1991-01-30

states that continual education and training at all levels of the company is the most important element in enabling companies to gain competitive...staked on information known to be inaccurate and educated guesses from the same people who provided much of the original inaccurate information. The second... educated guesses. 7.1.2.6 Implementation Cost/Schedule Refer to Paragraph 7.1.1.6. 7.1-8 TASK ORDER NO. 18 PROCESS CHARACTERIZATION SCHEDULER RECEIVES ITEM

Space Tug Docking Study. Volume 5: Cost Analysis

NASA Technical Reports Server (NTRS)

1976-01-01

The cost methodology, summary cost data, resulting cost estimates by Work Breakdown Structure (WBS), technical characteristics data, program funding schedules and the WBS for the costing are discussed. Cost estimates for two tasks of the study are reported. The first, developed cost estimates for design, development, test and evaluation (DDT&E) and theoretical first unit (TFU) at the component level (Level 7) for all items reported in the data base. Task B developed total subsystem DDT&E costs and funding schedules for the three candidate Rendezvous and Docking Systems: manual, autonomous, and hybrid.

Treatment of Escape-Maintained Challenging Behavior Using Chained Schedules: An Evaluation of the Effects of Thinning Positive plus Negative Reinforcement During Functional Communication Training.

PubMed

Zangrillo, Amanda N; Fisher, Wayne W; Greer, Brian D; Owen, Todd M; DeSouza, Andresa A

2016-01-01

Previous research has supported functional communication training (FCT) as an effective intervention for reducing challenging behavior. Clinicians often program schedule-thinning procedures to increase the portability of the treatment (i.e., reinforcement is provided less frequently). For individuals with escape-maintained problem behavior, chained schedules have proven effective in increasing task completion and supplemental procedures may ameliorate reemergence of challenging behavior as access to reinforcement is decreased. The present study compared the use of a chained schedule-thinning procedure with and without alternative reinforcement (e.g., toys and activities) embedded in an intervention in which escape from the task is provided contingent on a request for a break. Two individuals with escape-maintained challenging behavior participated. We compared two treatment conditions, escape-only and escape-to-tangibles, using a single-subject, alternating treatments design with each treatment implemented in a distinct academic context. With the escape-to-tangibles treatment, we reached the final schedule in both contexts with both participants (4 successes out of 4 applications). We did not reach the final schedule with either participant with the escape-only intervention (0 successes out of 2 applications). The current results provided preliminary confirmation that providing positive plus negative reinforcement would decrease destructive behavior, increase compliance, and facilitate reinforcer-schedule thinning.

Treatment of Escape-Maintained Challenging Behavior Using Chained Schedules: An Evaluation of the Effects of Thinning Positive plus Negative Reinforcement During Functional Communication Training

PubMed Central

Zangrillo, Amanda N.; Fisher, Wayne W.; Greer, Brian D.; Owen, Todd M.; DeSouza, Andresa A.

2016-01-01

Objective Previous research has supported functional communication training (FCT) as an effective intervention for reducing challenging behavior. Clinicians often program schedule-thinning procedures to increase the portability of the treatment (i.e., reinforcement is provided less frequently). For individuals with escape-maintained problem behavior, chained schedules have proven effective in increasing task completion and supplemental procedures may ameliorate reemergence of challenging behavior as access to reinforcement is decreased. The present study compared the use of a chained schedule-thinning procedure with and without alternative reinforcement (e.g., toys and activities) embedded in an intervention in which escape from the task is provided contingent on a request for a break. Method Two individuals with escape-maintained challenging behavior participated. We compared two treatment conditions, escape-only and escape-to-tangibles, using a single-subject, alternating treatments design with each treatment implemented in a distinct academic context. Results With the escape-to-tangibles treatment, we reached the final schedule in both contexts with both participants (4 successes out of 4 applications). We did not reach the final schedule with either participant with the escape-only intervention (0 successes out of 2 applications). Conclusion The current results provided preliminary confirmation that providing positive plus negative reinforcement would decrease destructive behavior, increase compliance, and facilitate reinforcer-schedule thinning. PMID:28626579

Achieving reutilization of scheduling software through abstraction and generalization

NASA Technical Reports Server (NTRS)

Wilkinson, George J.; Monteleone, Richard A.; Weinstein, Stuart M.; Mohler, Michael G.; Zoch, David R.; Tong, G. Michael

1995-01-01

Reutilization of software is a difficult goal to achieve particularly in complex environments that require advanced software systems. The Request-Oriented Scheduling Engine (ROSE) was developed to create a reusable scheduling system for the diverse scheduling needs of the National Aeronautics and Space Administration (NASA). ROSE is a data-driven scheduler that accepts inputs such as user activities, available resources, timing contraints, and user-defined events, and then produces a conflict-free schedule. To support reutilization, ROSE is designed to be flexible, extensible, and portable. With these design features, applying ROSE to a new scheduling application does not require changing the core scheduling engine, even if the new application requires significantly larger or smaller data sets, customized scheduling algorithms, or software portability. This paper includes a ROSE scheduling system description emphasizing its general-purpose features, reutilization techniques, and tasks for which ROSE reuse provided a low-risk solution with significant cost savings and reduced software development time.

Operations mission planner beyond the baseline

NASA Technical Reports Server (NTRS)

Biefeld, Eric; Cooper, Lynne

1991-01-01

The scheduling of Space Station Freedom must satisfy four major requirements. It must ensure efficient housekeeping operations, maximize the collection of science, respond to changes in tasking and available resources, and accommodate the above changes in a manner that minimizes disruption of the ongoing operations of the station. While meeting these requirements the scheduler must cope with the complexity, scope, and flexibility of SSF operations. This requires the scheduler to deal with an astronomical number of possible schedules. The Operations Mission Planner (OMP) is centered around minimally disruptive replanning and the use of heuristics limit search in scheduling. OMP has already shown several artificial intelligence based scheduling techniques such as Interleaved Iterative Refinement and Bottleneck Identification using Process Chronologies.

Advanced Platform Systems Technology study. Volume 4: Technology advancement program plan

NASA Technical Reports Server (NTRS)

1983-01-01

An overview study of the major technology definition tasks and subtasks along with their interfaces and interrelationships is presented. Although not specifically indicated in the diagram, iterations were required at many steps to finalize the results. The development of the integrated technology advancement plan was initiated by using the results of the previous two tasks, i.e., the trade studies and the preliminary cost and schedule estimates for the selected technologies. Descriptions for the development of each viable technology advancement was drawn from the trade studies. Additionally, a logic flow diagram depicting the steps in developing each technology element was developed along with descriptions for each of the major elements. Next, major elements of the logic flow diagrams were time phased, and that allowed the definition of a technology development schedule that was consistent with the space station program schedule when possible. Schedules show the major milestone including tests required as described in the logic flow diagrams.

TASKILLAN II - Pilot strategies for workload management

NASA Technical Reports Server (NTRS)

Segal, Leon D.; Wickens, Christopher D.

1990-01-01

This study focused on the strategies used by pilots in managing their workload level, and their subsequent task performance. Sixteen licensed pilots flew 42 missions on a helicopter simulation, and were evaluated on their performance of the overall mission, as well as individual tasks. Pilots were divided in four groups, defined by the presence or absence of scheduling control over tasks and the availability of intelligence concerning the type and stage of difficulties imposed during the flight. Results suggest that intelligence supported strategies that yielded significant higher performance levels, while scheduling control seemed to have no impact on performance. Both difficulty type and the stage of difficulty impacted performance significantly, with strongest effects for time stresss and difficulties imposed late in the flight.

Integration of domain and resource-based reasoning for real-time control in dynamic environments

NASA Technical Reports Server (NTRS)

Morgan, Keith; Whitebread, Kenneth R.; Kendus, Michael; Cromarty, Andrew S.

1993-01-01

A real-time software controller that successfully integrates domain-based and resource-based control reasoning to perform task execution in a dynamically changing environment is described. The design of the controller is based on the concept of partitioning the process to be controlled into a set of tasks, each of which achieves some process goal. It is assumed that, in general, there are multiple ways (tasks) to achieve a goal. The controller dynamically determines current goals and their current criticality, choosing and scheduling tasks to achieve those goals in the time available. It incorporates rule-based goal reasoning, a TMS-based criticality propagation mechanism, and a real-time scheduler. The controller has been used to build a knowledge-based situation assessment system that formed a major component of a real-time, distributed, cooperative problem solving system built under DARPA contract. It is also being employed in other applications now in progress.

Efficient parallel architecture for highly coupled real-time linear system applications

NASA Technical Reports Server (NTRS)

Carroll, Chester C.; Homaifar, Abdollah; Barua, Soumavo

1988-01-01

A systematic procedure is developed for exploiting the parallel constructs of computation in a highly coupled, linear system application. An overall top-down design approach is adopted. Differential equations governing the application under consideration are partitioned into subtasks on the basis of a data flow analysis. The interconnected task units constitute a task graph which has to be computed in every update interval. Multiprocessing concepts utilizing parallel integration algorithms are then applied for efficient task graph execution. A simple scheduling routine is developed to handle task allocation while in the multiprocessor mode. Results of simulation and scheduling are compared on the basis of standard performance indices. Processor timing diagrams are developed on the basis of program output accruing to an optimal set of processors. Basic architectural attributes for implementing the system are discussed together with suggestions for processing element design. Emphasis is placed on flexible architectures capable of accommodating widely varying application specifics.

A novel flexible microfluidic meshwork to reduce fibrosis in glaucoma surgery.

PubMed

Amoozgar, Behzad; Wei, Xiaoling; Hui Lee, Jun; Bloomer, Michele; Zhao, Zhengtuo; Coh, Paul; He, Fei; Luan, Lan; Xie, Chong; Han, Ying

2017-01-01

Fibrosis and hence capsule formation around the glaucoma implants are the main reasons for glaucoma implant failure. To address these issues, we designed a microfluidic meshwork and tested its biocompatibility in a rabbit eye model. The amount of fibrosis elicited by the microfluidic meshwork was compared to the amount elicited by the plate of conventional glaucoma drainage device. Six eyes from 3 New Zealand albino rabbits were randomized to receive either the novel microfluidic meshwork or a plate of Ahmed glaucoma valve model PF7 (AGV PF7). The flexible microfluidic implant was made from negative photoresist SU-8 by using micro-fabrication techniques. The overall size of the meshwork was 7 mm × 7 mm with a grid period of 100 μm. Both implants were placed in the subtenon space at the supratemporal quadrant in a standard fashion. There was no communication between the implants and the anterior chamber via a tube. All animal eyes were examined for signs of infection and implant erosion on days 1, 3, 7, and 14 and then monthly. Exenterations were performed in which the entire orbital contents were removed at 3 months. Histology slides of the implant and the surrounding tissues were prepared and stained with hematoxylin-eosin. Thickness of the fibrous capsules beneath the implants were measured and compared with paired student's t-test between the two groups. The gross histological sections showed that nearly no capsule formed around the microfluidic meshwork in contrast to the thick capsule formed around the plate of AGV PF7. Thickness of the fibrotic capsules beneath the AGV PF7 plate from the 3 rabbit eyes was 90μm, 82μm, and 95 μm, respectively. The thickness at the bottom of fibrotic capsules around the new microfluidic implant were 1μm, 2μm, and 1μm, respectively. The difference in thickness of capsule between the two groups was significant (P = 0.002). No complications were noticed in the 6 eyes, and both implants were tolerated well by all rabbits. The microfluidic meshwork elicited minimal fibrosis and capsule formation after 3-months implantation in a rabbit model. This provides promising evidence to aid in future development of a new glaucoma drainage implant that will elicit minimal scar formation and provide better long-term surgical outcomes.

Application of decentralized cooperative problem solving in dynamic flexible scheduling

NASA Astrophysics Data System (ADS)

Guan, Zai-Lin; Lei, Ming; Wu, Bo; Wu, Ya; Yang, Shuzi

1995-08-01

The object of this study is to discuss an intelligent solution to the problem of task-allocation in shop floor scheduling. For this purpose, the technique of distributed artificial intelligence (DAI) is applied. Intelligent agents (IAs) are used to realize decentralized cooperation, and negotiation is realized by using message passing based on the contract net model. Multiple agents, such as manager agents, workcell agents, and workstation agents, make game-like decisions based on multiple criteria evaluations. This procedure of decentralized cooperative problem solving makes local scheduling possible. And by integrating such multiple local schedules, dynamic flexible scheduling for the whole shop floor production can be realized.

Space shuttle maintenance program planning document

NASA Technical Reports Server (NTRS)

Brown, D. V.

1972-01-01

A means for developing a space shuttle maintenance program which will be acceptable to the development centers, the operators (KSC and AF), and the manufacturer is presented. The general organization and decision processes for determining the essential scheduled maintenance requirements for the space shuttle orbiter are outlined. The development of initial scheduled maintenance programs is discussed. The remaining maintenance, that is non-scheduled or non-routine maintenance, is directed by the findings of the scheduled maintenance program and the normal operation of the shuttle. The remaining maintenance consists of maintenance actions to correct discrepancies noted during scheduled maintenance tasks, nonscheduled maintenance, normal operation, or condition monitoring.

Comparing Book- and Tablet-Based Picture Activity Schedules: Acquisition and Preference.

PubMed

Giles, Aimee; Markham, Victoria

2017-09-01

Picture activity schedules consist of a sequence of images representing the order of tasks for a person to complete. Although, picture activity schedules have traditionally been presented in a book format, recently picture activity schedules have been evaluated on technological devices such as an iPod™ touch. The present study compared the efficiency of picture activity schedule acquisition on book- and tablet-based modalities. In addition, participant preference for each modality was assessed. Three boys aged below 5 years with a diagnosis of autism participated. Participants were taught to follow the schedules using both modalities. Following mastery of each modality of picture activity schedule, a concurrent-chains preference assessment was conducted to evaluate participant preference for each modality. Differences in acquisition rates across the two modalities were marginal. Preference for book- or tablet-based schedules was idiosyncratic across participants.

A modified generalized extremal optimization algorithm for the quay crane scheduling problem with interference constraints

NASA Astrophysics Data System (ADS)

Guo, Peng; Cheng, Wenming; Wang, Yi

2014-10-01

The quay crane scheduling problem (QCSP) determines the handling sequence of tasks at ship bays by a set of cranes assigned to a container vessel such that the vessel's service time is minimized. A number of heuristics or meta-heuristics have been proposed to obtain the near-optimal solutions to overcome the NP-hardness of the problem. In this article, the idea of generalized extremal optimization (GEO) is adapted to solve the QCSP with respect to various interference constraints. The resulting GEO is termed the modified GEO. A randomized searching method for neighbouring task-to-QC assignments to an incumbent task-to-QC assignment is developed in executing the modified GEO. In addition, a unidirectional search decoding scheme is employed to transform a task-to-QC assignment to an active quay crane schedule. The effectiveness of the developed GEO is tested on a suite of benchmark problems introduced by K.H. Kim and Y.M. Park in 2004 (European Journal of Operational Research, Vol. 156, No. 3). Compared with other well-known existing approaches, the experiment results show that the proposed modified GEO is capable of obtaining the optimal or near-optimal solution in a reasonable time, especially for large-sized problems.

Dynamic scheduling and planning parallel observations on large Radio Telescope Arrays with the Square Kilometre Array in mind

NASA Astrophysics Data System (ADS)

Buchner, Johannes

2011-12-01

Scheduling, the task of producing a time table for resources and tasks, is well-known to be a difficult problem the more resources are involved (a NP-hard problem). This is about to become an issue in Radio astronomy as observatories consisting of hundreds to thousands of telescopes are planned and operated. The Square Kilometre Array (SKA), which Australia and New Zealand bid to host, is aiming for scales where current approaches -- in construction, operation but also scheduling -- are insufficent. Although manual scheduling is common today, the problem is becoming complicated by the demand for (1) independent sub-arrays doing simultaneous observations, which requires the scheduler to plan parallel observations and (2) dynamic re-scheduling on changed conditions. Both of these requirements apply to the SKA, especially in the construction phase. We review the scheduling approaches taken in the astronomy literature, as well as investigate techniques from human schedulers and today's observatories. The scheduling problem is specified in general for scientific observations and in particular on radio telescope arrays. Also taken into account is the fact that the observatory may be oversubscribed, requiring the scheduling problem to be integrated with a planning process. We solve this long-term scheduling problem using a time-based encoding that works in the very general case of observation scheduling. This research then compares algorithms from various approaches, including fast heuristics from CPU scheduling, Linear Integer Programming and Genetic algorithms, Branch-and-Bound enumeration schemes. Measures include not only goodness of the solution, but also scalability and re-scheduling capabilities. In conclusion, we have identified a fast and good scheduling approach that allows (re-)scheduling difficult and changing problems by combining heuristics with a Genetic algorithm using block-wise mutation operations. We are able to explain and eradicate two problems in the literature: The inability of a GA to properly improve schedules and the generation of schedules with frequent interruptions. Finally, we demonstrate the scheduling framework for several operating telescopes: (1) Dynamic re-scheduling with the AUT Warkworth 12m telescope, (2) Scheduling for the Australian Mopra 22m telescope and scheduling for the Allen Telescope Array. Furthermore, we discuss the applicability of the presented scheduling framework to the Atacama Large Millimeter/submillimeter Array (ALMA, in construction) and the SKA. In particular, during the development phase of the SKA, this dynamic, scalable scheduling framework can accommodate changing conditions.

Task rotation in an underground coal mine: A pilot study.

PubMed

Jones, Olivia F; James, Carole L

2018-01-01

Task rotation is used to decrease the risk of workplace injuries and improve work satisfaction. To investigate the feasibility, benefits and challenges of implementing a task rotation schedule within an underground coalmine in NSW, Australia. A mixed method case control pilot study with the development and implementation of a task rotation schedule for 6 months with two work crews. A questionnaire including The Nordic Musculoskeletal Questionnaire, The Need for Recovery after Work Scale, and The Australian WHOQOL- BREF Australian Edition was used to survey workers at baseline, 3 and 6 months. A focus group was completed with the intervention crew and management at the completion of the study. In total, twenty-seven participants completed the survey. Significant improvements in the psychological and environmental domains of the WHOQOL-BREF questionnaire were found in the intervention crew. Musculoskeletal pain was highest in the elbow, lower back and knee, and fatigue scores improved, across both groups. The intervention crew felt 'mentally fresher', 'didn't do the same task twice in a row', and 'had more task variety which made the shift go quickly'. Task rotation was positively regarded, with psychological benefits identified. Three rotations during a 9-hour shift were feasible and practical in this environment.

Dynamic I/O Power Management for Hard Real-Time Systems

DTIC Science & Technology

2005-01-01

recently emerged as an attractive alternative to inflexible hardware solutions. DPM for hard real - time systems has received relatively little attention...In particular, energy-driven I/O device scheduling for real - time systems has not been considered before. We present the first online DPM algorithm...which we call Low Energy Device Scheduler (LEDES), for hard real - time systems . LEDES takes as inputs a predetermined task schedule and a device-usage

Real-Time Tomography Mooring

DTIC Science & Technology

1992-06-01

Vi th this sampling schedule the data logger has enough (data. storage capacity for, a five yea r deploymeneit-. SYsteim specifica tionis are shown...sit [I t ille check is pwrformed as a virttial device. called -Ilinei check". which is scheduled in the task tabhe aid(] executed by the systsenm cot...PCI as FSK carrier detect input- add function (5) to do timer/counter control - stop counter when defaults set I 6. Instrument scheduler software

The Ames-Lockheed orbiter processing scheduling system

NASA Technical Reports Server (NTRS)

Zweben, Monte; Gargan, Robert

1991-01-01

A general purpose scheduling system and its application to Space Shuttle Orbiter Processing at the Kennedy Space Center (KSC) are described. Orbiter processing entails all the inspection, testing, repair, and maintenance necessary to prepare the Shuttle for launch and takes place within the Orbiter Processing Facility (OPF) at KSC, the Vehicle Assembly Building (VAB), and on the launch pad. The problems are extremely combinatoric in that there are thousands of tasks, resources, and other temporal considerations that must be coordinated. Researchers are building a scheduling tool that they hope will be an integral part of automating the planning and scheduling process at KSC. The scheduling engine is domain independent and is also being applied to Space Shuttle cargo processing problems as well as wind tunnel scheduling problems.

An intelligent value-driven scheduling system for Space Station Freedom with special emphasis on the electric power system

NASA Technical Reports Server (NTRS)

Krupp, Joseph C.

1991-01-01

The Electric Power Control System (EPCS) created by Decision-Science Applications, Inc. (DSA) for the Lewis Research Center is discussed. This system makes decisions on what to schedule and when to schedule it, including making choices among various options or ways of performing a task. The system is goal-directed and seeks to shape resource usage in an optimal manner using a value-driven approach. Discussed here are considerations governing what makes a good schedule, how to design a value function to find the best schedule, and how to design the algorithm that finds the schedule that maximizes this value function. Results are shown which demonstrate the usefulness of the techniques employed.

Reconfigurable manufacturing execution system for pipe cutting

NASA Astrophysics Data System (ADS)

Yin, Y. H.; Xie, J. Y.

2011-08-01

This article presents a reconfigurable manufacturing execution system (RMES) filling the gap between enterprise resource planning and resource layer for pipe-cutting production with mass customisation and rapid adaptation to dynamic market, which consists of planning and scheduling layer and executive control layer. Starting from customer's task and process requirements, the cutting trajectories are planned under generalised mathematical model able to reconfigure in accordance with various intersecting types' joint, and all tasks are scheduled by nesting algorithm to maximise the utilisation rate of rough material. This RMES for pipe cutting has been effectively implemented in more than 100 companies.

Mechanism to support generic collective communication across a variety of programming models

DOEpatents

Almasi, Gheorghe [Ardsley, NY; Dozsa, Gabor [Ardsley, NY; Kumar, Sameer [White Plains, NY

2011-07-19

A system and method for supporting collective communications on a plurality of processors that use different parallel programming paradigms, in one aspect, may comprise a schedule defining one or more tasks in a collective operation, an executor that executes the task, a multisend module to perform one or more data transfer functions associated with the tasks, and a connection manager that controls one or more connections and identifies an available connection. The multisend module uses the available connection in performing the one or more data transfer functions. A plurality of processors that use different parallel programming paradigms can use a common implementation of the schedule module, the executor module, the connection manager and the multisend module via a language adaptor specific to a parallel programming paradigm implemented on a processor.

Automated power management and control

NASA Technical Reports Server (NTRS)

Dolce, James L.

1991-01-01

A comprehensive automation design is being developed for Space Station Freedom's electric power system. A joint effort between NASA's Office of Aeronautics and Exploration Technology and NASA's Office of Space Station Freedom, it strives to increase station productivity by applying expert systems and conventional algorithms to automate power system operation. The initial station operation will use ground-based dispatches to perform the necessary command and control tasks. These tasks constitute planning and decision-making activities that strive to eliminate unplanned outages. We perceive an opportunity to help these dispatchers make fast and consistent on-line decisions by automating three key tasks: failure detection and diagnosis, resource scheduling, and security analysis. Expert systems will be used for the diagnostics and for the security analysis; conventional algorithms will be used for the resource scheduling.

Multicore job scheduling in the Worldwide LHC Computing Grid

NASA Astrophysics Data System (ADS)

Forti, A.; Pérez-Calero Yzquierdo, A.; Hartmann, T.; Alef, M.; Lahiff, A.; Templon, J.; Dal Pra, S.; Gila, M.; Skipsey, S.; Acosta-Silva, C.; Filipcic, A.; Walker, R.; Walker, C. J.; Traynor, D.; Gadrat, S.

2015-12-01

After the successful first run of the LHC, data taking is scheduled to restart in Summer 2015 with experimental conditions leading to increased data volumes and event complexity. In order to process the data generated in such scenario and exploit the multicore architectures of current CPUs, the LHC experiments have developed parallelized software for data reconstruction and simulation. However, a good fraction of their computing effort is still expected to be executed as single-core tasks. Therefore, jobs with diverse resources requirements will be distributed across the Worldwide LHC Computing Grid (WLCG), making workload scheduling a complex problem in itself. In response to this challenge, the WLCG Multicore Deployment Task Force has been created in order to coordinate the joint effort from experiments and WLCG sites. The main objective is to ensure the convergence of approaches from the different LHC Virtual Organizations (VOs) to make the best use of the shared resources in order to satisfy their new computing needs, minimizing any inefficiency originated from the scheduling mechanisms, and without imposing unnecessary complexities in the way sites manage their resources. This paper describes the activities and progress of the Task Force related to the aforementioned topics, including experiences from key sites on how to best use different batch system technologies, the evolution of workload submission tools by the experiments and the knowledge gained from scale tests of the different proposed job submission strategies.

Technology for planning and scheduling under complex constraints

NASA Astrophysics Data System (ADS)

Alguire, Karen M.; Pedro Gomes, Carla O.

1997-02-01

Within the context of law enforcement, several problems fall into the category of planning and scheduling under constraints. Examples include resource and personnel scheduling, and court scheduling. In the case of court scheduling, a schedule must be generated considering available resources, e.g., court rooms and personnel. Additionally, there are constraints on individual court cases, e.g., temporal and spatial, and between different cases, e.g., precedence. Finally, there are overall objectives that the schedule should satisfy such as timely processing of cases and optimal use of court facilities. Manually generating a schedule that satisfies all of the constraints is a very time consuming task. As the number of court cases and constraints increases, this becomes increasingly harder to handle without the assistance of automatic scheduling techniques. This paper describes artificial intelligence (AI) technology that has been used to develop several high performance scheduling applications including a military transportation scheduler, a military in-theater airlift scheduler, and a nuclear power plant outage scheduler. We discuss possible law enforcement applications where we feel the same technology could provide long-term benefits to law enforcement agencies and their operations personnel.

Understanding how train dispatchers manage and control trains : results of a cognitive task analysis

DOT National Transportation Integrated Search

2001-05-01

This report documents the results of a Cognitive Task Analysis that examined how experienced railroad dispatchers manage and : schedule trains in todays environment. The objective was to understand the cognitive demands placed on railroad dispatch...

Understanding how train dispatchers manage and control trains : results of a cognitive task analysis

DOT National Transportation Integrated Search

2001-05-01

This report documents the results ofaCognitive Task Analysis that examined how experienced railroad dispatchers manage and : schedule trains in today's environment. The objective was to understand the cognitive demands placed on railroad dispatchers ...

Understanding how train dispatchers manage and control trains : results of a cognitive task analysis.

DOT National Transportation Integrated Search

2001-05-01

This report documents the results of a Cognitive Task Analysis that examined how experienced railroad dispatchers manage and schedule trains in todays environment. The objective was to understand the cognitive demands placed on railroad dispatcher...

40 CFR 52.2059 - Control strategy: Particulate matter.

Code of Federal Regulations, 2012 CFR

2012-07-01

... 40 Protection of Environment 5 2012-07-01 2012-07-01 false Control strategy: Particulate matter... Control strategy: Particulate matter. (a) Pennsylvania has committed to undertake a comprehensive program... Investigating and Controlling Nontraditional Particulate Matter Emissions Task Completion date Scheduled tasks...

40 CFR 52.2059 - Control strategy: Particulate matter.

Code of Federal Regulations, 2013 CFR

2013-07-01

... 40 Protection of Environment 5 2013-07-01 2013-07-01 false Control strategy: Particulate matter... Control strategy: Particulate matter. (a) Pennsylvania has committed to undertake a comprehensive program... Investigating and Controlling Nontraditional Particulate Matter Emissions Task Completion date Scheduled tasks...

40 CFR 52.2059 - Control strategy: Particulate matter.

Code of Federal Regulations, 2010 CFR

2010-07-01

... 40 Protection of Environment 4 2010-07-01 2010-07-01 false Control strategy: Particulate matter... Control strategy: Particulate matter. (a) Pennsylvania has committed to undertake a comprehensive program... Investigating and Controlling Nontraditional Particulate Matter Emissions Task Completion date Scheduled tasks...

40 CFR 52.2059 - Control strategy: Particulate matter.

Code of Federal Regulations, 2011 CFR

2011-07-01

... 40 Protection of Environment 4 2011-07-01 2011-07-01 false Control strategy: Particulate matter... Control strategy: Particulate matter. (a) Pennsylvania has committed to undertake a comprehensive program... Investigating and Controlling Nontraditional Particulate Matter Emissions Task Completion date Scheduled tasks...

Job shop scheduling problem with late work criterion

NASA Astrophysics Data System (ADS)

Piroozfard, Hamed; Wong, Kuan Yew

2015-05-01

Scheduling is considered as a key task in many industries, such as project based scheduling, crew scheduling, flight scheduling, machine scheduling, etc. In the machine scheduling area, the job shop scheduling problems are considered to be important and highly complex, in which they are characterized as NP-hard. The job shop scheduling problems with late work criterion and non-preemptive jobs are addressed in this paper. Late work criterion is a fairly new objective function. It is a qualitative measure and concerns with late parts of the jobs, unlike classical objective functions that are quantitative measures. In this work, simulated annealing was presented to solve the scheduling problem. In addition, operation based representation was used to encode the solution, and a neighbourhood search structure was employed to search for the new solutions. The case studies are Lawrence instances that were taken from the Operations Research Library. Computational results of this probabilistic meta-heuristic algorithm were compared with a conventional genetic algorithm, and a conclusion was made based on the algorithm and problem.

Planning and Scheduling for Fleets of Earth Observing Satellites

NASA Technical Reports Server (NTRS)

Frank, Jeremy; Jonsson, Ari; Morris, Robert; Smith, David E.; Norvig, Peter (Technical Monitor)

2001-01-01

We address the problem of scheduling observations for a collection of earth observing satellites. This scheduling task is a difficult optimization problem, potentially involving many satellites, hundreds of requests, constraints on when and how to service each request, and resources such as instruments, recording devices, transmitters, and ground stations. High-fidelity models are required to ensure the validity of schedules; at the same time, the size and complexity of the problem makes it unlikely that systematic optimization search methods will be able to solve them in a reasonable time. This paper presents a constraint-based approach to solving the Earth Observing Satellites (EOS) scheduling problem, and proposes a stochastic heuristic search method for solving it.

Error Argumentation Enhance Adaptability in Adults With Low Motor Ability.

PubMed

Lee, Chi-Mei; Bo, Jin

2016-01-01

The authors focused on young adults with varying degrees of motor difficulties and examined their adaptability in a visuomotor adaptation task where the visual feedback of participants' movement error was presented with either 1:1 ratio (i.e., regular feedback schedule) or 1:2 ratio (i.e., enhanced feedback schedule). Within-subject design was used with two feedback schedules counter-balanced and separated for 10 days. Results revealed that participants with greater motor difficulties showed less adaptability than those with normal motor abilities in the regular feedback schedule; however, all participants demonstrated similar level of adaptability in the enhanced feedback schedule. The results suggest that error argumentation enhances adaptability in adults with low motor ability.

Different MK-801 administration schedules induce mild to severe learning impairments in an operant conditioning task: role of buspirone and risperidone in ameliorating these cognitive deficits.

PubMed

Rapanelli, Maximiliano; Frick, Luciana Romina; Bernardez-Vidal, Micaela; Zanutto, Bonifacio Silvano

2013-11-15

Blockade of N-methyl-d-aspartate receptor (NMDA) by the noncompetitive NMDA receptor (NMDAR) antagonist MK-801 produces behavioral abnormalities and alterations in prefrontal cortex (PFC) functioning. Due to the critical role of the PFC in operant conditioning task learning, we evaluated the effects of acute, repeated postnatal injections of MK-801 (0.1mg/kg) on learning performance. We injected Long-Evans rats i.p. with MK-801 (0.1mg/kg) using three different administration schedules: injection 40 min before beginning the task (during) (n=12); injection twice daily for six consecutive days prior to beginning the experimental procedures (prior) (n=12); or twice daily subcutaneous injections from postnatal day 7 to 11 (postnatal) (n=12). Next, we orally administered risperidone (serotonin receptor 2A and dopamine receptor 2 antagonist, 1mg/kg) or buspirone (serotonin receptor 1A partial agonist, 10mg/kg) to animals treated with the MK-801 schedule described above. The postnatal and prior administration schedules produced severe learning deficits, whereas injection of MK-801 just before training sessions had only mild effects on acquisition of an operant conditioning. Risperidone was able to reverse the detrimental effect of MK-801 in the animals that were treated with MK-801 during and prior training sessions. In contrast, buspirone was only effective at mitigating the cognitive deficits induced by MK-801 when administered during the training procedures. The data demonstrates that NMDA antagonism disrupts basic mechanisms of learning in a simple PFC-mediated operant conditioning task, and that buspirone and risperidone failed to attenuate the learning deficits when NMDA neurotransmission was blocked in the early stages of the postnatal period. Copyright © 2013 Elsevier B.V. All rights reserved.

Understanding how train dispatchers manage and control trains : results of a cognitive task analysis

DOT National Transportation Integrated Search

1999-03-01

This report documents the results of a preliminary Cognitive Task Analysis (CTA) that examined how experienced train dispatchers manage and : schedule trains in today's environment The objective was to understand the cognitive demands placed on train...

48 CFR 2452.216-70 - Estimated cost, base fee and award fee.

Code of Federal Regulations, 2010 CFR

2010-10-01

...] increments on the schedule set forth in the Performance Evaluation Plan established by the government. The amount payable shall be based on the progress toward completion of contract tasks as determined by the... payments of the award fee in accordance with the schedule established in the Performance Evaluation Plan...

Effectiveness of Time-Based Attention Schedules on Students in Inclusive Classrooms in Turkey

ERIC Educational Resources Information Center

Sazak Pinar, Elif

2015-01-01

This study examines the effectiveness of fixed-time (FT) and variable-time (VT) schedules and attention on the problem behaviors and on-task behaviors of students with and without intellectual disabilities in inclusive classrooms in Turkey. Three second-grade students with intellectual disabilities, three students without intellectual…

A Model Schedule for a Capital Improvement Program.

ERIC Educational Resources Information Center

Oates, Arnold D.; Burch, A. Lee

The Model Schedule for a Capital Improvement Program described in this paper encourages school leaders to consider a more holistic view of the planning process. It is intended to assist those responsible for educational facility planning, who must assure that all important and relevant tasks are accomplished in a timely manner. The model's six…

Static Scheduler for Hard Real-Time Tasks on Multiprocessor Systems

DTIC Science & Technology

1992-09-01

Foundation of Computer Science, 1980 . [SIM83] Simons, B., "Multiprocessor Scheduling of Unit-Time Jobs with Arbitrary Release Times and Deadlines", SIAM...Research Office Attn: Dr. David Hislop P. O. Box 12211 Research Triangle Park, NC 27709-2211 31. Persistent Data Systems 75 W. Chapel Ridge Road Attn: Dr

One for All: Maintaining a Single Schedule Database for Large Development Projects

NASA Technical Reports Server (NTRS)

Hilscher, R.; Howerton, G.

1999-01-01

Efficiently maintaining and controlling a single schedule database in an Integrated Product Team environment is a significant challenge. It's accomplished effectively with the right combination of tools, skills, strategy, creativity, and teamwork. We'll share our lessons learned maintaining a 20,000 plus task network on a 36 month project.

Crew Integration & Automation Testbed and Robotic Follower Programs

DTIC Science & Technology

2001-05-30

Evolving Technologies for Reduced Crew Operation” Vehicle Tech Demo #1 (VTT) Vehicle Tech Demo #2 ( CAT ATD) Two Man Transition Future Combat...Simulation Advanced Electronic Architecture Concept Vehicle Shown with Onboard Safety Driver Advanced Interfaces CAT ATD Exit Criteria...Provide 1000 Hz control loop for critical real-time tasks CAT Workload IPT Process and Product Schedule Crew Task List Task Timelines Workload Analysis

Combating Vigilance Decrements in a Sustained Attention Task: Examination of Two Cognitive Intervention Schedules for a Secondary Task

DTIC Science & Technology

2012-03-01

Vroom , V . H . (1964). Work and motivation . New York: Wiley. 16 Distribution A: Approved for public release; Distribution unlimited. 88 ABW Cleared...sustained attention tasks. Theorists have attempted to explain vigilance decrements as a function of arousal/ motivation ( Vroom , 1964; Yerkes & Dodson...DISTRIBUTION STATEMENT. Allen J. Rowe Gregory J. Barbato Work Unit Manager

Planning the FUSE Mission Using the SOVA Algorithm

NASA Technical Reports Server (NTRS)

Lanzi, James; Heatwole, Scott; Ward, Philip R.; Civeit, Thomas; Calvani, Humberto; Kruk, Jeffrey W.; Suchkov, Anatoly

2011-01-01

Three documents discuss the Sustainable Objective Valuation and Attainability (SOVA) algorithm and software as used to plan tasks (principally, scientific observations and associated maneuvers) for the Far Ultraviolet Spectroscopic Explorer (FUSE) satellite. SOVA is a means of managing risk in a complex system, based on a concept of computing the expected return value of a candidate ordered set of tasks as a product of pre-assigned task values and assessments of attainability made against qualitatively defined strategic objectives. For the FUSE mission, SOVA autonomously assembles a week-long schedule of target observations and associated maneuvers so as to maximize the expected scientific return value while keeping the satellite stable, managing the angular momentum of spacecraft attitude- control reaction wheels, and striving for other strategic objectives. A six-degree-of-freedom model of the spacecraft is used in simulating the tasks, and the attainability of a task is calculated at each step by use of strategic objectives as defined by use of fuzzy inference systems. SOVA utilizes a variant of a graph-search algorithm known as the A* search algorithm to assemble the tasks into a week-long target schedule, using the expected scientific return value to guide the search.

Solidification Structure Synthesis in Undercooled Liquids

DTIC Science & Technology

1993-10-18

Diagrams 32 1. Supersaturation in Sn-Sb Alloys 32 2. Microstructural Transitions in Fe-Ni alloys 33 E. Droplet Nucleation Kinetics 36 F . Controlled...indicated as - F ,,. The curves correspond to the extrapolation of experimental data (exp.). (b) to the approximation of AGv and TAS=-O by Dubey and...Thermodynamic stability of oxide particles in Sn Oxide A Grxn1 A Grxn2 A F (XmOn) (kJ) (kJ) (°C) AI20 3 +1605 +810 144 TiO- +367 +372 142 Y203 +2119 +1067 136

Interactive computer aided shift scheduling.

PubMed

Gaertner, J

2001-12-01

This paper starts with a discussion of computer aided shift scheduling. After a brief review of earlier approaches, two conceptualizations of this field are introduced: First, shift scheduling as a field that ranges from extremely stable rosters at one pole to rather market-like approaches on the other pole. Unfortunately, already small alterations of a scheduling problem (e.g., the number of groups, the number of shifts) may call for rather different approaches and tools. Second, their environment shapes scheduling problems and scheduling has to be done within idiosyncratic organizational settings. This calls for the amalgamation of scheduling with other tasks (e.g., accounting) and for reflections whether better solutions might become possible by changes in the problem definition (e.g., other service levels, organizational changes). Therefore shift scheduling should be understood as a highly connected problem. Building upon these two conceptualizations, a few examples of software that ease scheduling in some areas of this field are given and future research questions are outlined.

Software Cost-Estimation Model

NASA Technical Reports Server (NTRS)

Tausworthe, R. C.

1985-01-01

Software Cost Estimation Model SOFTCOST provides automated resource and schedule model for software development. Combines several cost models found in open literature into one comprehensive set of algorithms. Compensates for nearly fifty implementation factors relative to size of task, inherited baseline, organizational and system environment and difficulty of task.

A Correlation Between Quality Management Metrics and Technical Performance Measurement

DTIC Science & Technology

2007-03-01

Engineering Working Group SME Subject Matter Expert SoS System of Systems SPI Schedule performance Index SSEI System of Systems Engineering and...and stated as such [Q, M , M &G]. The QMM equation is given by: 12 QMM=0.92RQM+0.67EPM+0.55RKM+1.86PM, where: RGM is the requirements management...schedule. Now if corrective action is not taken, the project/task will be completed behind schedule and over budget. m . As well as the derived

Distributed Signal Processing in Wireless Sensor Networks

DTIC Science & Technology

2005-08-01

in sensor networks. Previous endeavors focused on how to schedule trackers to go to sleep or to wake up trackers based on detection outcomes. On the...one hand, all nodes wake up according to a predefined schedule so that only involved nodes are kept active for the exact duration of a task execution...Recently a new MAC - S-MAC [70] has been proposed, and it enables nodes to sleep not only for a scheduled period, but also for other periods for which

Conference Proceedings of NASA/DoD Control Structures Interaction Technology Held in Norfolk, Virginia on 18-21 November 1986. Part 2,

DTIC Science & Technology

1987-06-01

INDUSTRY JOINT ENDEAVOR AGREEMENTS o PRESENT CSI TECHNOLOGY SOA FOR KEY ISSUES o SPECIFIC CSI TECHNOLOGY PROGRAMS/TASKS o SCHEDULE - WHAT IS EXPECTED...RESULTS BE USED IN THIS REGARD? o WHAT ARE SELECTION CRITERIA FOR GUEST INVESTIGATORS? o WHAT IS CURRENT COFS SCHEDULE ? o ARE USERS AND TECHNOLOGY...build to cost and schedule , meeting both the presidentially mandated milestone for permanent manned presence in 1994 and the budget constraints placed

Using Grid Benchmarks for Dynamic Scheduling of Grid Applications

NASA Technical Reports Server (NTRS)

Frumkin, Michael; Hood, Robert

2003-01-01

Navigation or dynamic scheduling of applications on computational grids can be improved through the use of an application-specific characterization of grid resources. Current grid information systems provide a description of the resources, but do not contain any application-specific information. We define a GridScape as dynamic state of the grid resources. We measure the dynamic performance of these resources using the grid benchmarks. Then we use the GridScape for automatic assignment of the tasks of a grid application to grid resources. The scalability of the system is achieved by limiting the navigation overhead to a few percent of the application resource requirements. Our task submission and assignment protocol guarantees that the navigation system does not cause grid congestion. On a synthetic data mining application we demonstrate that Gridscape-based task assignment reduces the application tunaround time.

Development and evaluation of a Fault-Tolerant Multiprocessor (FTMP) computer. Volume 2: FTMP software

NASA Technical Reports Server (NTRS)

Lala, J. H.; Smith, T. B., III

1983-01-01

The software developed for the Fault-Tolerant Multiprocessor (FTMP) is described. The FTMP executive is a timer-interrupt driven dispatcher that schedules iterative tasks which run at 3.125, 12.5, and 25 Hz. Major tasks which run under the executive include system configuration control, flight control, and display. The flight control task includes autopilot and autoland functions for a jet transport aircraft. System Displays include status displays of all hardware elements (processors, memories, I/O ports, buses), failure log displays showing transient and hard faults, and an autopilot display. All software is in a higher order language (AED, an ALGOL derivative). The executive is a fully distributed general purpose executive which automatically balances the load among available processor triads. Provisions for graceful performance degradation under processing overload are an integral part of the scheduling algorithms.

Feasibility of the adaptive and automatic presentation of tasks (ADAPT) system for rehabilitation of upper extremity function post-stroke.

PubMed

Choi, Younggeun; Gordon, James; Park, Hyeshin; Schweighofer, Nicolas

2011-08-03

Current guidelines for rehabilitation of arm and hand function after stroke recommend that motor training focus on realistic tasks that require reaching and manipulation and engage the patient intensively, actively, and adaptively. Here, we investigated the feasibility of a novel robotic task-practice system, ADAPT, designed in accordance with such guidelines. At each trial, ADAPT selects a functional task according to a training schedule and with difficulty based on previous performance. Once the task is selected, the robot picks up and presents the corresponding tool, simulates the dynamics of the tasks, and the patient interacts with the tool to perform the task. Five participants with chronic stroke with mild to moderate impairments (> 9 months post-stroke; Fugl-Meyer arm score 49.2 ± 5.6) practiced four functional tasks (selected out of six in a pre-test) with ADAPT for about one and half hour and 144 trials in a pseudo-random schedule of 3-trial blocks per task. No adverse events occurred and ADAPT successfully presented the six functional tasks without human intervention for a total of 900 trials. Qualitative analysis of trajectories showed that ADAPT simulated the desired task dynamics adequately, and participants reported good, although not excellent, task fidelity. During training, the adaptive difficulty algorithm progressively increased task difficulty leading towards an optimal challenge point based on performance; difficulty was then continuously adjusted to keep performance around the challenge point. Furthermore, the time to complete all trained tasks decreased significantly from pretest to one-hour post-test. Finally, post-training questionnaires demonstrated positive patient acceptance of ADAPT. ADAPT successfully provided adaptive progressive training for multiple functional tasks based on participant's performance. Our encouraging results establish the feasibility of ADAPT; its efficacy will next be tested in a clinical trial.

The LHCb Grid Simulation: Proof of Concept

NASA Astrophysics Data System (ADS)

Hushchyn, M.; Ustyuzhanin, A.; Arzymatov, K.; Roiser, S.; Baranov, A.

2017-10-01

The Worldwide LHC Computing Grid provides access to data and computational resources to analyze it for researchers with different geographical locations. The grid has a hierarchical topology with multiple sites distributed over the world with varying number of CPUs, amount of disk storage and connection bandwidth. Job scheduling and data distribution strategy are key elements of grid performance. Optimization of algorithms for those tasks requires their testing on real grid which is hard to achieve. Having a grid simulator might simplify this task and therefore lead to more optimal scheduling and data placement algorithms. In this paper we demonstrate a grid simulator for the LHCb distributed computing software.

Efficient Execution of Microscopy Image Analysis on CPU, GPU, and MIC Equipped Cluster Systems.

PubMed

Andrade, G; Ferreira, R; Teodoro, George; Rocha, Leonardo; Saltz, Joel H; Kurc, Tahsin

2014-10-01

High performance computing is experiencing a major paradigm shift with the introduction of accelerators, such as graphics processing units (GPUs) and Intel Xeon Phi (MIC). These processors have made available a tremendous computing power at low cost, and are transforming machines into hybrid systems equipped with CPUs and accelerators. Although these systems can deliver a very high peak performance, making full use of its resources in real-world applications is a complex problem. Most current applications deployed to these machines are still being executed in a single processor, leaving other devices underutilized. In this paper we explore a scenario in which applications are composed of hierarchical data flow tasks which are allocated to nodes of a distributed memory machine in coarse-grain, but each of them may be composed of several finer-grain tasks which can be allocated to different devices within the node. We propose and implement novel performance aware scheduling techniques that can be used to allocate tasks to devices. We evaluate our techniques using a pathology image analysis application used to investigate brain cancer morphology, and our experimental evaluation shows that the proposed scheduling strategies significantly outperforms other efficient scheduling techniques, such as Heterogeneous Earliest Finish Time - HEFT, in cooperative executions using CPUs, GPUs, and MICs. We also experimentally show that our strategies are less sensitive to inaccuracy in the scheduling input data and that the performance gains are maintained as the application scales.

Efficient Execution of Microscopy Image Analysis on CPU, GPU, and MIC Equipped Cluster Systems

PubMed Central

Andrade, G.; Ferreira, R.; Teodoro, George; Rocha, Leonardo; Saltz, Joel H.; Kurc, Tahsin

2015-01-01

High performance computing is experiencing a major paradigm shift with the introduction of accelerators, such as graphics processing units (GPUs) and Intel Xeon Phi (MIC). These processors have made available a tremendous computing power at low cost, and are transforming machines into hybrid systems equipped with CPUs and accelerators. Although these systems can deliver a very high peak performance, making full use of its resources in real-world applications is a complex problem. Most current applications deployed to these machines are still being executed in a single processor, leaving other devices underutilized. In this paper we explore a scenario in which applications are composed of hierarchical data flow tasks which are allocated to nodes of a distributed memory machine in coarse-grain, but each of them may be composed of several finer-grain tasks which can be allocated to different devices within the node. We propose and implement novel performance aware scheduling techniques that can be used to allocate tasks to devices. We evaluate our techniques using a pathology image analysis application used to investigate brain cancer morphology, and our experimental evaluation shows that the proposed scheduling strategies significantly outperforms other efficient scheduling techniques, such as Heterogeneous Earliest Finish Time - HEFT, in cooperative executions using CPUs, GPUs, and MICs. We also experimentally show that our strategies are less sensitive to inaccuracy in the scheduling input data and that the performance gains are maintained as the application scales. PMID:26640423

Scheduling for Emergency Tasks in Industrial Wireless Sensor Networks

PubMed Central

Xia, Changqing; Kong, Linghe; Zeng, Peng

2017-01-01

Wireless sensor networks (WSNs) are widely applied in industrial manufacturing systems. By means of centralized control, the real-time requirement and reliability can be provided by WSNs in industrial production. Furthermore, many approaches reserve resources for situations in which the controller cannot perform centralized resource allocation. The controller assigns these resources as it becomes aware of when and where accidents have occurred. However, the reserved resources are limited, and such incidents are low-probability events. In addition, resource reservation may not be effective since the controller does not know when and where accidents will actually occur. To address this issue, we improve the reliability of scheduling for emergency tasks by proposing a method based on a stealing mechanism. In our method, an emergency task is transmitted by stealing resources allocated to regular flows. The challenges addressed in our work are as follows: (1) emergencies occur only occasionally, but the industrial system must deliver the corresponding flows within their deadlines when they occur; (2) we wish to minimize the impact of emergency flows by reducing the number of stolen flows. The contributions of this work are two-fold: (1) we first define intersections and blocking as new characteristics of flows; and (2) we propose a series of distributed routing algorithms to improve the schedulability and to reduce the impact of emergency flows. We demonstrate that our scheduling algorithm and analysis approach are better than the existing ones by extensive simulations. PMID:28726738

Effects of Using an Ipod App to Manage Recreation Tasks

ERIC Educational Resources Information Center

Uphold, Nicole M.; Douglas, Karen H.; Loseke, Dannell L.

2016-01-01

A withdrawal design study evaluated the effectiveness of using constant time delay to teach six adults with a developmental disability to program and use an iPod touch® as an electronic photographic activity schedule (ePAS). The ePAS, created with the First Then Visual Schedule app, consisted of photographs of different exercises to complete…

Operator Objective Function Guidance for a Real-Time Unmanned Vehicle Scheduling Algorithm

DTIC Science & Technology

2012-12-01

Consensus - Based Decentralized Auctions for Robust Task Allocation ,” IEEE Transactions on Robotics and Automation, Vol. 25, No. 4, No. 4, 2009, pp. 912...planning for the fleet. The decentralized task planner used in OPS-USERS is the consensus - based bundle algorithm (CBBA), a decentralized , polynomial...and surveillance (OPS-USERS), which leverages decentralized algorithms for vehicle routing and task allocation . This

Increasing Crew Autonomy for Long Duration Exploration Missions: Self-Scheduling

NASA Technical Reports Server (NTRS)

Marquez, Jessica J.; Hillenius, Steven; Deliz, Ivonne; Kanefsky, Bob; Zheng, Jimin; Reagan, Marcum L.

2017-01-01

Over the last three years, we have been investigating the operational concept of crew self-scheduling as a method of increasing crew autonomy for future exploration missions. Through Playbook, a planning and scheduling software tool, we have incrementally increased the ability for Earth analog mission crews to modify their schedules. Playbook allows the crew to add new activities from scratch, add new activities or groups of activities through a Task List, and reschedule or reassign flexible activities. The crew is also able to identify if plan modifications create violations, i.e., plan constraints not being met. This paper summarizes our observations with qualitative evidence from four NASA Extreme Environment Mission Operations (NEEMO) analog missions that supported self-scheduling as a feasible operational concept.

Teaching children with autism to use photographic activity schedules: maintenance and generalization of complex response chains.

PubMed Central

MacDuff, G S; Krantz, P J; McClannahan, L E

1993-01-01

We used a graduated guidance procedure to teach 4 boys with autism to follow photographic activity schedules to increase on-task and on-schedule behavior. The multiple baseline across participants design included baseline, teaching, maintenance, resequencing of photographs, and generalization to novel photographs phases. The results indicated that photographic activity schedules (albums depicting after-school activities) produced sustained engagement, and skills generalized to a new sequence of photographs and to new photographs. The acquisition of schedule-following skills enabled these children with severe developmental disabilities to display lengthy response chains, independently change activities, and change activities in different group home settings in the absence of immediate supervision and prompts from others. PMID:8473261

A distributed scheduling algorithm for heterogeneous real-time systems

NASA Technical Reports Server (NTRS)

Zeineldine, Osman; El-Toweissy, Mohamed; Mukkamala, Ravi

1991-01-01

Much of the previous work on load balancing and scheduling in distributed environments was concerned with homogeneous systems and homogeneous loads. Several of the results indicated that random policies are as effective as other more complex load allocation policies. The effects of heterogeneity on scheduling algorithms for hard real time systems is examined. A distributed scheduler specifically to handle heterogeneities in both nodes and node traffic is proposed. The performance of the algorithm is measured in terms of the percentage of jobs discarded. While a random task allocation is very sensitive to heterogeneities, the algorithm is shown to be robust to such non-uniformities in system components and load.

Design tool for multiprocessor scheduling and evaluation of iterative dataflow algorithms

NASA Technical Reports Server (NTRS)

Jones, Robert L., III

1995-01-01

A graph-theoretic design process and software tool is defined for selecting a multiprocessing scheduling solution for a class of computational problems. The problems of interest are those that can be described with a dataflow graph and are intended to be executed repetitively on a set of identical processors. Typical applications include signal processing and control law problems. Graph-search algorithms and analysis techniques are introduced and shown to effectively determine performance bounds, scheduling constraints, and resource requirements. The software tool applies the design process to a given problem and includes performance optimization through the inclusion of additional precedence constraints among the schedulable tasks.

Changed nursing scheduling for improved safety culture and working conditions - patients' and nurses' perspectives.

PubMed

Kullberg, Anna; Bergenmar, Mia; Sharp, Lena

2016-05-01

To evaluate fixed scheduling compared with self-scheduling for nursing staff in oncological inpatient care with regard to patient and staff outcomes. Various scheduling models have been tested to attract and retain nursing staff. Little is known about how these schedules affect staff and patients. Fixed scheduling and self-scheduling have been studied to a small extent, solely from a staff perspective. We implemented fixed scheduling on two of four oncological inpatient wards. Two wards kept self-scheduling. Through a quasi-experimental design, baseline and follow-up measurements were collected among staff and patients. The Safety Attitudes Questionnaire was used among staff, as well as study-specific questions for patients and staff. Fixed scheduling was associated with less overtime and fewer possibilities to change shifts. Self-scheduling was associated with more requests from management for short notice shift changes. The type of scheduling did not affect patient-reported outcomes. Fixed scheduling should be considered in order to lower overtime. Further research is necessary and should explore patient outcomes to a greater extent. Scheduling is a core task for nurse managers. Our study suggests fixed scheduling as a strategy for managers to improve the effective use of resources and safety. © 2016 John Wiley & Sons Ltd.

Master plan nurse duty roster using the 0-1 goal programming technique

NASA Astrophysics Data System (ADS)

Ismail, Wan Rosmanira; Jenal, Ruzzakiah

2013-04-01

The scheduling of nurses is particularly challenging because of the nature of the work which is around the clock. In addition, inefficient duty roster can have an effect on the nurses well being as well as their job satisfaction. In nurse scheduling problem (NSP), nurses are generally allocated to periods of work over a specified time horizon. A typical length of the schedule varies from a few weeks to a month. The schedule will be consistently rebuilt after the specified time period and will result in a time-consuming task for the administrative staff involved. Moreover, the task becomes overwhelming when the staff needs to consider the previous duty rosters in order to maintain the quality of schedules. Therefore, this study suggests the development of a master plan for a nurse duty roster for approximately one year. The master plan starts with the development of a blue print for the nurse duty roster using a 0-1 goal programming technique. The appropriate working period for this blue print is formulated based on the number of night shifts and the number of required nurses for night shift per schedule. Subsequently, the blue print is repeated to complete the annual nurse duty roster. These newly developed procedures were then tested on several data sets. The test results found that the master plan has successfully distributed the annual workload evenly among nurses. In addition, the master plan allows nurses to arrange their career and social activities in advance.

IOPS advisor: Research in progress on knowledge-intensive methods for irregular operations airline scheduling

NASA Technical Reports Server (NTRS)

Borse, John E.; Owens, Christopher C.

1992-01-01

Our research focuses on the problem of recovering from perturbations in large-scale schedules, specifically on the ability of a human-machine partnership to dynamically modify an airline schedule in response to unanticipated disruptions. This task is characterized by massive interdependencies and a large space of possible actions. Our approach is to apply the following: qualitative, knowledge-intensive techniques relying on a memory of stereotypical failures and appropriate recoveries; and quantitative techniques drawn from the Operations Research community's work on scheduling. Our main scientific challenge is to represent schedules, failures, and repairs so as to make both sets of techniques applicable to the same data. This paper outlines ongoing research in which we are cooperating with United Airlines to develop our understanding of the scientific issues underlying the practicalities of dynamic, real-time schedule repair.

Efficient Bifacial Semitransparent Perovskite Solar Cells Using Ag/V2O5 as Transparent Anodes.

PubMed

Pang, Shangzheng; Li, Xueyi; Dong, Hang; Chen, Dazheng; Zhu, Weidong; Chang, Jingjing; Lin, Zhenhua; Xi, He; Zhang, Jincheng; Zhang, Chunfu; Hao, Yue

2018-04-18

Bifacial semitransparent inverted planar structured perovskite solar cells (PSCs) based on Cs 0.05 FA 0.3 MA 0.7 PbI 2.51 Br 0.54 using an Ag thin film electrode and V 2 O 5 optical coupling layer are investigated theoretically and experimentally. It is shown that the introduction of the cesium (Cs) ions in the perovskite could obviously improve the device performance and stability. When only the bare Ag film electrode is used, the PSCs show a bifacial performance with the power conversion efficiency (PCE) of 14.62% illuminated from the indium tin oxide (ITO) side and 5.45% from the Ag film side. By introducing a V 2 O 5 optical coupling layer, the PCE is enhanced to 8.91% illuminated from the Ag film side, which is 63% improvement compared with the bare Ag film electrode, whereas the PCE illuminated from the ITO side remains almost unchanged. Moreover, when a back-reflector is employed, the PCE of device could be further improved to 15.39% by illumination from the ITO side and 12.44% by illumination from the Ag side. The devices also show superior semitransparent properties and exhibit negligible photocurrent hysteresis, irrespective of the side from which the light is illuminated. In short, the Ag/V 2 O 5 double layer is a promising semitransparent electrode due to its low cost and simple preparation process, which also point to a new direction for the bifacial PSCs and tandem solar cells.

Control and Diagnosis in Integrated Product Development - Observations during the Development of an AGV

NASA Astrophysics Data System (ADS)

Stetter, R.; Simundsson, A.

2015-11-01

This paper is concerned with the integration of control and diagnosis functionalities into the development of complete systems which include mechanical, electrical and electronic subsystems. For the development of such systems the strategies, methods and tools of integrated product development have attracted significant attention during the last decades. Today, it is generally observed that product development processes of complex systems can only be successful if the activities in the different domains are well connected and synchronised and if an ongoing communication is present - an ongoing communication spanning the technical domains and also including functions such as production planning, marketing/distribution, quality assurance, service and project planning. Obviously, numerous approaches to tackle this challenge are present in scientific literature and in industrial practice, as well. Today, the functionality and safety of most products is to a large degree dependent on control and diagnosis functionalities. Still, there is comparatively little research concentrating on the integration of the development of these functionalities into the overall product development processes. The main source of insight of the presented research is the product development process of an Automated Guided Vehicle (AGV) which is intended to be used on rough terrain. The paper starts with a background describing Integrated Product Development. The second section deals with the product development of the sample product. The third part summarizes some insights and formulates first hypotheses concerning control and diagnosis in Integrated Product Development.

Fuzzy logic control of an AGV

NASA Astrophysics Data System (ADS)

Kelkar, Nikhal; Samu, Tayib; Hall, Ernest L.

1997-09-01

Automated guided vehicles (AGVs) have many potential applications in manufacturing, medicine, space and defense. The purpose of this paper is to describe exploratory research on the design of a modular autonomous mobile robot controller. The controller incorporates a fuzzy logic approach for steering and speed control, a neuro-fuzzy approach for ultrasound sensing (not discussed in this paper) and an overall expert system. The advantages of a modular system are related to portability and transportability, i.e. any vehicle can become autonomous with minimal modifications. A mobile robot test-bed has been constructed using a golf cart base. This cart has full speed control with guidance provided by a vision system and obstacle avoidance using ultrasonic sensors. The speed and steering fuzzy logic controller is supervised by a 486 computer through a multi-axis motion controller. The obstacle avoidance system is based on a micro-controller interfaced with six ultrasonic transducers. This micro- controller independently handles all timing and distance calculations and sends a steering angle correction back to the computer via the serial line. This design yields a portable independent system in which high speed computer communication is not necessary. Vision guidance is accomplished with a CCD camera with a zoom lens. The data is collected by a vision tracking device that transmits the X, Y coordinates of the lane marker to the control computer. Simulation and testing of these systems yielded promising results. This design, in its modularity, creates a portable autonomous fuzzy logic controller applicable to any mobile vehicle with only minor adaptations.

MaGate Simulator: A Simulation Environment for a Decentralized Grid Scheduler

NASA Astrophysics Data System (ADS)

Huang, Ye; Brocco, Amos; Courant, Michele; Hirsbrunner, Beat; Kuonen, Pierre

This paper presents a simulator for of a decentralized modular grid scheduler named MaGate. MaGate’s design emphasizes scheduler interoperability by providing intelligent scheduling serving the grid community as a whole. Each MaGate scheduler instance is able to deal with dynamic scheduling conditions, with continuously arriving grid jobs. Received jobs are either allocated on local resources, or delegated to other MaGates for remote execution. The proposed MaGate simulator is based on GridSim toolkit and Alea simulator, and abstracts the features and behaviors of complex fundamental grid elements, such as grid jobs, grid resources, and grid users. Simulation of scheduling tasks is supported by a grid network overlay simulator executing distributed ant-based swarm intelligence algorithms to provide services such as group communication and resource discovery. For evaluation, a comparison of behaviors of different collaborative policies among a community of MaGates is provided. Results support the use of the proposed approach as a functional ready grid scheduler simulator.

SLS-PLAN-IT: A knowledge-based blackboard scheduling system for Spacelab life sciences missions

NASA Technical Reports Server (NTRS)

Kao, Cheng-Yan; Lee, Seok-Hua

1992-01-01

The primary scheduling tool in use during the Spacelab Life Science (SLS-1) planning phase was the operations research (OR) based, tabular form Experiment Scheduling System (ESS) developed by NASA Marshall. PLAN-IT is an artificial intelligence based interactive graphic timeline editor for ESS developed by JPL. The PLAN-IT software was enhanced for use in the scheduling of Spacelab experiments to support the SLS missions. The enhanced software SLS-PLAN-IT System was used to support the real-time reactive scheduling task during the SLS-1 mission. SLS-PLAN-IT is a frame-based blackboard scheduling shell which, from scheduling input, creates resource-requiring event duration objects and resource-usage duration objects. The blackboard structure is to keep track of the effects of event duration objects on the resource usage objects. Various scheduling heuristics are coded in procedural form and can be invoked any time at the user's request. The system architecture is described along with what has been learned with the SLS-PLAN-IT project.

Interactive Decision Support for Academic Advising

ERIC Educational Resources Information Center

Mohamed, Abdallah

2016-01-01

Purpose: This paper aims to support academic advising, which plays a crucial role in student success and retention. The paper focuses on one of the most challenging tasks involved in academic advising: individual course scheduling. This task includes not only careful planning for different courses over several semesters according to students'…

Effects of n-dominance and group composition on task efficiency in laboratory triads.

NASA Technical Reports Server (NTRS)

Lampkin, E. C.

1972-01-01

Task-oriented triads were formed into various homogeneous and heterogeneous combinations according to their scores on the n-dominance personality trait of the Edwards Personal Preference Schedule. Five group categories were used. The group task required a consensus decision on each trial. High cooperation and interdependence were reinforced by partially restricting the communication network. Results showed heterogeneous groups significantly better at organizing their group communication processes. They consequently performed the task more efficiently than homogeneous triads.

Analysis of Issues for Project Scheduling by Multiple, Dispersed Schedulers (distributed Scheduling) and Requirements for Manual Protocols and Computer-based Support

NASA Technical Reports Server (NTRS)

Richards, Stephen F.

1991-01-01

Although computerized operations have significant gains realized in many areas, one area, scheduling, has enjoyed few benefits from automation. The traditional methods of industrial engineering and operations research have not proven robust enough to handle the complexities associated with the scheduling of realistic problems. To address this need, NASA has developed the computer-aided scheduling system (COMPASS), a sophisticated, interactive scheduling tool that is in wide-spread use within NASA and the contractor community. Therefore, COMPASS provides no explicit support for the large class of problems in which several people, perhaps at various locations, build separate schedules that share a common pool of resources. This research examines the issue of distributing scheduling, as applied to application domains characterized by the partial ordering of tasks, limited resources, and time restrictions. The focus of this research is on identifying issues related to distributed scheduling, locating applicable problem domains within NASA, and suggesting areas for ongoing research. The issues that this research identifies are goals, rescheduling requirements, database support, the need for communication and coordination among individual schedulers, the potential for expert system support for scheduling, and the possibility of integrating artificially intelligent schedulers into a network of human schedulers.

Localized Fault Recovery for Nested Fork-Join Programs

DOE Office of Scientific and Technical Information (OSTI.GOV)

Kestor, Gokcen; Krishnamoorthy, Sriram; Ma, Wenjing

Nested fork-join programs scheduled using work stealing can automatically balance load and adapt to changes in the execution environment. In this paper, we design an approach to efficiently recover from faults encountered by these programs. Specifically, we focus on localized recovery of the task space in the presence of fail-stop failures. We present an approach to efficiently track, under work stealing, the relationships between the work executed by various threads. This information is used to identify and schedule the tasks to be re-executed without interfering with normal task execution. The algorithm precisely computes the work lost, incurs minimal re-execution overhead,more » and can recover from an arbitrary number of failures. Experimental evaluation demonstrates low overheads in the absence of failures, recovery overheads on the same order as the lost work, and much lower recovery costs than alternative strategies.« less

Development of OTM Syngas Process and Testing of Syngas Derived Ultra-clean Fuels in Diesel Engines and Fuel Cells

DOE Office of Scientific and Technical Information (OSTI.GOV)

E.T.; James P. Meagher; Prasad Apte

2002-12-31

This topical report summarizes work accomplished for the Program from November 1, 2001 to December 31, 2002 in the following task areas: Task 1: Materials Development; Task 2: Composite Development; Task 4: Reactor Design and Process Optimization; Task 8: Fuels and Engine Testing; 8.1 International Diesel Engine Program; 8.2 Nuvera Fuel Cell Program; and Task 10: Program Management. Major progress has been made towards developing high temperature, high performance, robust, oxygen transport elements. In addition, a novel reactor design has been proposed that co-produces hydrogen, lowers cost and improves system operability. Fuel and engine testing is progressing well, but wasmore » delayed somewhat due to the hiatus in program funding in 2002. The Nuvera fuel cell portion of the program was completed on schedule and delivered promising results regarding low emission fuels for transportation fuel cells. The evaluation of ultra-clean diesel fuels continues in single cylinder (SCTE) and multiple cylinder (MCTE) test rigs at International Truck and Engine. FT diesel and a BP oxygenate showed significant emissions reductions in comparison to baseline petroleum diesel fuels. Overall through the end of 2002 the program remains under budget, but behind schedule in some areas.« less

Personalized Education; Solving a Group Formation and Scheduling Problem for Educational Content

ERIC Educational Resources Information Center

Bahargam, Sanaz; Erdos, Dóra; Bestavros, Azer; Terzi, Evimaria

2015-01-01

Whether teaching in a classroom or a Massive Online Open Course it is crucial to present the material in a way that benefits the audience as a whole. We identify two important tasks to solve towards this objective; (1) group students so that they can maximally benefit from peer interaction and (2) find an optimal schedule of the educational…

Autonomous planning and scheduling on the TechSat 21 mission

NASA Technical Reports Server (NTRS)

Sherwood, R.; Chien, S.; Castano, R.; Rabideau, G.

2002-01-01

The Autonomous Sciencecraft Experiment (ASE) will fly onboard the Air Force TechSat 21 constellation of three spacecraft scheduled for launch in 2006. ASE uses onboard continuous planning, robust task and goal-based execution, model-based mode identification and reconfiguration, and onboard machine learning and pattern recognition to radically increase science return by enabling intelligent downlink selection and autonomous retargeting.

Parallel processing of real-time dynamic systems simulation on OSCAR (Optimally SCheduled Advanced multiprocessoR)

NASA Technical Reports Server (NTRS)

Kasahara, Hironori; Honda, Hiroki; Narita, Seinosuke

1989-01-01

Parallel processing of real-time dynamic systems simulation on a multiprocessor system named OSCAR is presented. In the simulation of dynamic systems, generally, the same calculation are repeated every time step. However, we cannot apply to Do-all or the Do-across techniques for parallel processing of the simulation since there exist data dependencies from the end of an iteration to the beginning of the next iteration and furthermore data-input and data-output are required every sampling time period. Therefore, parallelism inside the calculation required for a single time step, or a large basic block which consists of arithmetic assignment statements, must be used. In the proposed method, near fine grain tasks, each of which consists of one or more floating point operations, are generated to extract the parallelism from the calculation and assigned to processors by using optimal static scheduling at compile time in order to reduce large run time overhead caused by the use of near fine grain tasks. The practicality of the scheme is demonstrated on OSCAR (Optimally SCheduled Advanced multiprocessoR) which has been developed to extract advantageous features of static scheduling algorithms to the maximum extent.

Acquisition, retention and transfer of simulated laparoscopic tasks using fNIR and a contextual interference paradigm.

PubMed

Shewokis, Patricia A; Shariff, Faiz U; Liu, Yichuan; Ayaz, Hasan; Castellanos, Andres; Lind, D Scott

2017-02-01

Using functional near infrared spectroscopy, a noninvasive, optical brain imaging tool that monitors changes in hemodynamics within the prefrontal cortex (PFC), we assessed performance and cognitive effort during the acquisition, retention and transfer of multiple simulated laparoscopic tasks by novice learners within a contextual interference paradigm. Third-year medical students (n = 10) were randomized to either a blocked or random practice schedule. Across 3 days, students performed 108 acquisition trials of 3 laparoscopic tasks on the LapSim ® simulator followed by delayed retention and transfer tests. Performance metrics (Global score, Total time) and hemodynamic responses (total hemoglobin (μm)) were assessed during skill acquisition, retention and transfer. All acquisition tasks resulted in significant practice schedule X trial block interactions for the left medial anterior PFC. During retention and transfer, random performed the skills in less time and had lower total hemoglobin change in the right dorsolateral PFC than blocked. Compared with blocked, random practice resulted in enhanced learning through better performance and less cognitive load for retention and transfer of simulated laparoscopic tasks. Copyright © 2016 Elsevier Inc. All rights reserved.

Putting ROSE to Work: A Proposed Application of a Request-Oriented Scheduling Engine for Space Station Operations

NASA Technical Reports Server (NTRS)

Jaap, John; Muery, Kim

2000-01-01

Scheduling engines are found at the core of software systems that plan and schedule activities and resources. A Request-Oriented Scheduling Engine (ROSE) is one that processes a single request (adding a task to a timeline) and then waits for another request. For the International Space Station, a robust ROSE-based system would support multiple, simultaneous users, each formulating requests (defining scheduling requirements), submitting these requests via the internet to a single scheduling engine operating on a single timeline, and immediately viewing the resulting timeline. ROSE is significantly different from the engine currently used to schedule Space Station operations. The current engine supports essentially one person at a time, with a pre-defined set of requirements from many payloads, working in either a "batch" scheduling mode or an interactive/manual scheduling mode. A planning and scheduling process that takes advantage of the features of ROSE could produce greater customer satisfaction at reduced cost and reduced flow time. This paper describes a possible ROSE-based scheduling process and identifies the additional software component required to support it. Resulting changes to the management and control of the process are also discussed.

Effectiveness of motor sequential learning according to practice schedules in healthy adults; distributed practice versus massed practice

PubMed Central

Kwon, Yong Hyun; Kwon, Jung Won; Lee, Myoung Hee

2015-01-01

[Purpose] The purpose of the current study was to compare the effectiveness of motor sequential learning according to two different types of practice schedules, distributed practice schedule (two 12-hour inter-trial intervals) and massed practice schedule (two 10-minute inter-trial intervals) using a serial reaction time (SRT) task. [Subjects and Methods] Thirty healthy subjects were recruited and then randomly and evenly assigned to either the distributed practice group or the massed practice group. All subjects performed three consecutive sessions of the SRT task following one of the two different types of practice schedules. Distributed practice was scheduled for two 12-hour inter-session intervals including sleeping time, whereas massed practice was administered for two 10-minute inter-session intervals. Response time (RT) and response accuracy (RA) were measured in at pre-test, mid-test, and post-test. [Results] For RT, univariate analysis demonstrated significant main effects in the within-group comparison of the three tests as well as the interaction effect of two groups × three tests, whereas the between-group comparison showed no significant effect. The results for RA showed no significant differences in neither the between-group comparison nor the interaction effect of two groups × three tests, whereas the within-group comparison of the three tests showed a significant main effect. [Conclusion] Distributed practice led to enhancement of motor skill acquisition at the first inter-session interval as well as at the second inter-interval the following day, compared to massed practice. Consequentially, the results of this study suggest that a distributed practice schedule can enhance the effectiveness of motor sequential learning in 1-day learning as well as for two days learning formats compared to massed practice. PMID:25931727

Improved Space Surveillance Network (SSN) Scheduling using Artificial Intelligence Techniques

NASA Astrophysics Data System (ADS)

Stottler, D.

There are close to 20,000 cataloged manmade objects in space, the large majority of which are not active, functioning satellites. These are tracked by phased array and mechanical radars and ground and space-based optical telescopes, collectively known as the Space Surveillance Network (SSN). A better SSN schedule of observations could, using exactly the same legacy sensor resources, improve space catalog accuracy through more complementary tracking, provide better responsiveness to real-time changes, better track small debris in low earth orbit (LEO) through efficient use of applicable sensors, efficiently track deep space (DS) frequent revisit objects, handle increased numbers of objects and new types of sensors, and take advantage of future improved communication and control to globally optimize the SSN schedule. We have developed a scheduling algorithm that takes as input the space catalog and the associated covariance matrices and produces a globally optimized schedule for each sensor site as to what objects to observe and when. This algorithm is able to schedule more observations with the same sensor resources and have those observations be more complementary, in terms of the precision with which each orbit metric is known, to produce a satellite observation schedule that, when executed, minimizes the covariances across the entire space object catalog. If used operationally, the results would be significantly increased accuracy of the space catalog with fewer lost objects with the same set of sensor resources. This approach inherently can also trade-off fewer high priority tasks against more lower-priority tasks, when there is benefit in doing so. Currently the project has completed a prototyping and feasibility study, using open source data on the SSN's sensors, that showed significant reduction in orbit metric covariances. The algorithm techniques and results will be discussed along with future directions for the research.

Data location-aware job scheduling in the grid. Application to the GridWay metascheduler

NASA Astrophysics Data System (ADS)

Delgado Peris, Antonio; Hernandez, Jose; Huedo, Eduardo; Llorente, Ignacio M.

2010-04-01

Grid infrastructures constitute nowadays the core of the computing facilities of the biggest LHC experiments. These experiments produce and manage petabytes of data per year and run thousands of computing jobs every day to process that data. It is the duty of metaschedulers to allocate the tasks to the most appropriate resources at the proper time. Our work reviews the policies that have been proposed for the scheduling of grid jobs in the context of very data-intensive applications. We indicate some of the practical problems that such models will face and describe what we consider essential characteristics of an optimum scheduling system: aim to minimise not only job turnaround time but also data replication, flexibility to support different virtual organisation requirements and capability to coordinate the tasks of data placement and job allocation while keeping their execution decoupled. These ideas have guided the development of an enhanced prototype for GridWay, a general purpose metascheduler, part of the Globus Toolkit and member of the EGEE's RESPECT program. Current GridWay's scheduling algorithm is unaware of data location. Our prototype makes it possible for job requests to set data needs not only as absolute requirements but also as functions for resource ranking. As our tests show, this makes it more flexible than currently used resource brokers to implement different data-aware scheduling algorithms.

Schedule-induced masseter EMG in facial pain subjects vs. no-pain controls.

PubMed

Gramling, S E; Grayson, R L; Sullivan, T N; Schwartz, S

1997-02-01

Empirical reports suggest that oral habits (e.g., teeth clenching) may be behavioral mediators linking stress to muscle hyperreactivity and the development of facial pain. Another report suggests that excessive behavioral adjuncts develop in conjunction with fixed-time stimulus presentation. The present study assessed the extent to which the oral habits exhibited by facial pain patients are schedule-induced. Subjects with Temporomandibular Disorder (TMD) symptomatology (n = 15) and pain-free controls (n = 15) participated in a 4-phase experiment (adaptation, baseline, task, recovery) designed to elicit schedule-induced behaviors. Self-report of oral habits and negative affect were recorded after each phase. Objective measures of oral habits were obtained via behavioral observation and masseter EMG recordings. Results revealed that negative arousal significantly increased during the fixed-time (FT) task and was also associated with increased oral habits among the TMD subjects. Moreover, 40% of the TMD subjects and none of the controls exhibited a pattern of EMG elevations in the early part of the inter-stimulus interval that met a strict criteria for scheduled-induced behavior per se. Taken together, these results suggest that the TMD subjects were engaging in schedule-induced oral habits. The adjunctive behavior literature seems to provide a plausible explanation as to how oral habits develop and are maintained in TMD patients, despite their painful consequences.

Voltage scheduling for low power/energy

NASA Astrophysics Data System (ADS)

Manzak, Ali

2001-07-01

Power considerations have become an increasingly dominant factor in the design of both portable and desk-top systems. An effective way to reduce power consumption is to lower the supply voltage since voltage is quadratically related to power. This dissertation considers the problem of lowering the supply voltage at (i) the system level and at (ii) the behavioral level. At the system level, the voltage of the variable voltage processor is dynamically changed with the work load. Processors with limited sized buffers as well as those with very large buffers are considered. Given the task arrival times, deadline times, execution times, periods and switching activities, task scheduling algorithms that minimize energy or peak power are developed for the processors equipped with very large buffers. A relation between the operating voltages of the tasks for minimum energy/power is determined using the Lagrange multiplier method, and an iterative algorithm that utilizes this relation is developed. Experimental results show that the voltage assignment obtained by the proposed algorithm is very close (0.1% error) to that of the optimal energy assignment and the optimal peak power (1% error) assignment. Next, on-line and off-fine minimum energy task scheduling algorithms are developed for processors with limited sized buffers. These algorithms have polynomial time complexity and present optimal (off-line) and close-to-optimal (on-line) solutions. A procedure to calculate the minimum buffer size given information about the size of the task (maximum, minimum), execution time (best case, worst case) and deadlines is also presented. At the behavioral level, resources operating at multiple voltages are used to minimize power while maintaining the throughput. Such a scheme has the advantage of allowing modules on the critical paths to be assigned to the highest voltage levels (thus meeting the required timing constraints) while allowing modules on non-critical paths to be assigned to lower voltage levels (thus reducing the power consumption). A polynomial time resource and latency constrained scheduling algorithm is developed to distribute the available slack among the nodes such that power consumption is minimum. The algorithm is iterative and utilizes the slack based on the Lagrange multiplier method.

T-L Plane Abstraction-Based Energy-Efficient Real-Time Scheduling for Multi-Core Wireless Sensors.

PubMed

Kim, Youngmin; Lee, Ki-Seong; Pham, Ngoc-Son; Lee, Sun-Ro; Lee, Chan-Gun

2016-07-08

Energy efficiency is considered as a critical requirement for wireless sensor networks. As more wireless sensor nodes are equipped with multi-cores, there are emerging needs for energy-efficient real-time scheduling algorithms. The T-L plane-based scheme is known to be an optimal global scheduling technique for periodic real-time tasks on multi-cores. Unfortunately, there has been a scarcity of studies on extending T-L plane-based scheduling algorithms to exploit energy-saving techniques. In this paper, we propose a new T-L plane-based algorithm enabling energy-efficient real-time scheduling on multi-core sensor nodes with dynamic power management (DPM). Our approach addresses the overhead of processor mode transitions and reduces fragmentations of the idle time, which are inherent in T-L plane-based algorithms. Our experimental results show the effectiveness of the proposed algorithm compared to other energy-aware scheduling methods on T-L plane abstraction.

Proceedings of the Annual Academic Apparel Research Conference on Advanced Apparel Manufacturing Technology Demonstration (1st) Held in Philadelphia, Pennsylvania on 14-16 February 1990. Volume 2

DTIC Science & Technology

1990-02-16

Philadelphia, PA by Dr. Leo E. Hanifin, Director Center for Manufacturing Productivity and Technology Transfer and Co-Principal Investigator Background In...Is coordinated by Dr. Leo E. Hanifin and Involves an additional four graduate students, two programmers, one engineer and one technician. In addition...the transfer bit5 - Whether the transfer is a load or unload * 4 bit4 - Which side of the AGV to perform the transfer bit3 through bitO - The number of

Learning to integrate reactivity and deliberation in uncertain planning and scheduling problems

NASA Technical Reports Server (NTRS)

Chien, Steve A.; Gervasio, Melinda T.; Dejong, Gerald F.

1992-01-01

This paper describes an approach to planning and scheduling in uncertain domains. In this approach, a system divides a task on a goal by goal basis into reactive and deliberative components. Initially, a task is handled entirely reactively. When failures occur, the system changes the reactive/deliverative goal division by moving goals into the deliberative component. Because our approach attempts to minimize the number of deliberative goals, we call our approach Minimal Deliberation (MD). Because MD allows goals to be treated reactively, it gains some of the advantages of reactive systems: computational efficiency, the ability to deal with noise and non-deterministic effects, and the ability to take advantage of unforseen opportunities. However, because MD can fall back upon deliberation, it can also provide some of the guarantees of classical planning, such as the ability to deal with complex goal interactions. This paper describes the Minimal Deliberation approach to integrating reactivity and deliberation and describe an ongoing application of the approach to an uncertain planning and scheduling domain.

Scheduling algorithms for automatic control systems for technological processes

NASA Astrophysics Data System (ADS)

Chernigovskiy, A. S.; Tsarev, R. Yu; Kapulin, D. V.

2017-01-01

Wide use of automatic process control systems and the usage of high-performance systems containing a number of computers (processors) give opportunities for creation of high-quality and fast production that increases competitiveness of an enterprise. Exact and fast calculations, control computation, and processing of the big data arrays - all of this requires the high level of productivity and, at the same time, minimum time of data handling and result receiving. In order to reach the best time, it is necessary not only to use computing resources optimally, but also to design and develop the software so that time gain will be maximal. For this purpose task (jobs or operations), scheduling techniques for the multi-machine/multiprocessor systems are applied. Some of basic task scheduling methods for the multi-machine process control systems are considered in this paper, their advantages and disadvantages come to light, and also some usage considerations, in case of the software for automatic process control systems developing, are made.

Social Experience and the Development of Social Cognition in Orthopedically Disabled and Non Disabled Children.

ERIC Educational Resources Information Center

Volpe, Richard

Evaluated were the cognitive and social development of 40 orthopedially handicapped children ages 6 to 12 years. Social development was measured by the Children's Social Relations Rating Scale, the Children's Social Relations Interview Schedule, and the Children's Role Taking Task. The Concrete Operations Tasks assessed cognitive ability. Data…

The Effect of Feedback Schedule Manipulation on Speech Priming Patterns and Reaction Time

ERIC Educational Resources Information Center

Slocomb, Dana; Spencer, Kristie A.

2009-01-01

Speech priming tasks are frequently used to delineate stages in the speech process such as lexical retrieval and motor programming. These tasks, often measured in reaction time (RT), require fast and accurate responses, reflecting maximized participant performance, to result in robust priming effects. Encouraging speed and accuracy in responding…

Teaching Students How to Write a Description with Photos

ERIC Educational Resources Information Center

Chong, Ivan

2017-01-01

In writing instruction, teachers often struggle with developing engaging and interactive activities given constraints such as large classes and packed teaching schedules. A purposeful and appealing pre-task can energize the writing process and set the context for the subsequent writing task. With this purpose in mind, the author designed the…

Coordinating space telescope operations in an integrated planning and scheduling architecture

NASA Technical Reports Server (NTRS)

Muscettola, Nicola; Smith, Stephen F.; Cesta, Amedeo; D'Aloisi, Daniela

1992-01-01

The Heuristic Scheduling Testbed System (HSTS), a software architecture for integrated planning and scheduling, is discussed. The architecture has been applied to the problem of generating observation schedules for the Hubble Space Telescope. This problem is representative of the class of problems that can be addressed: their complexity lies in the interaction of resource allocation and auxiliary task expansion. The architecture deals with this interaction by viewing planning and scheduling as two complementary aspects of the more general process of constructing behaviors of a dynamical system. The principal components of the software architecture are described, indicating how to model the structure and dynamics of a system, how to represent schedules at multiple levels of abstraction in the temporal database, and how the problem solving machinery operates. A scheduler for the detailed management of Hubble Space Telescope operations that has been developed within HSTS is described. Experimental performance results are given that indicate the utility and practicality of the approach.

EXAMINING THE GENERALITY OF CHILDREN'S PREFERENCE FOR CONTINGENT REINFORCEMENT VIA EXTENSION TO DIFFERENT RESPONSES, REINFORCERS, AND SCHEDULES

PubMed Central

Luczynski, Kevin C; Hanley, Gregory P

2010-01-01

Studies that have assessed whether children prefer contingent reinforcement (CR) or noncontingent reinforcement (NCR) have shown that they prefer CR. Preference for CR has, however, been evaluated only under continuous reinforcement (CRF) schedules. The prevalence of intermittent reinforcement (INT) warrants an evaluation of whether preference for CR persists as the schedule of reinforcement is thinned. In the current study, we evaluated 2 children's preference for contingent versus noncontingent delivery of highly preferred edible items for academic task completion under CRF and INT schedules. Children (a) preferred CR to NCR under the CRF schedule, (b) continued to prefer CR as the schedule of reinforcement became intermittent, and (c) exhibited a shift in preference from CR to NCR as the schedule became increasingly thin. These findings extend the generality of and provide one set of limits to the preference for CR. Applied implications, variables controlling preferences, and future research are discussed. PMID:21358901

A space station onboard scheduling assistant

NASA Technical Reports Server (NTRS)

Brindle, A. F.; Anderson, B. H.

1988-01-01

One of the goals for the Space Station is to achieve greater autonomy, and have less reliance on ground commanding than previous space missions. This means that the crew will have to take an active role in scheduling and rescheduling their activities onboard, perhaps working from preliminary schedules generated on the ground. Scheduling is a time intensive task, whether performed manually or automatically, so the best approach to solving onboard scheduling problems may involve crew members working with an interactive software scheduling package. A project is described which investigates a system that uses knowledge based techniques for the rescheduling of experiments within the Materials Technology Laboratory of the Space Station. Particular attention is paid to: (1) methods for rapid response rescheduling to accommodate unplanned changes in resource availability, (2) the nature of the interface to the crew, (3) the representation of the many types of data within the knowledge base, and (4) the possibility of applying rule-based and constraint-based reasoning methods to onboard activity scheduling.

Task and work performance on Skylab missions 2, 3, and 4: Time and motion study: Experiment M151

NASA Technical Reports Server (NTRS)

Kubis, J. F.; Mclaughlin, E. J.; Jackson, J. M.; Rusnak, R.; Mcbride, G. H.; Saxon, S. V.

1977-01-01

Human task performance was evaluated under weightlessness conditions during long duration space flight in order to study the characteristics of the adaptation function. Results show that despite pronounced variability in training schedules and in initial reaction to the Skylab environment, in-flight task performance was relatively equivalent among Skylab crews, and behavioral performance continued to improve from beginning to end of all missions.

Reducing Response Time Bounds for DAG-Based Task Systems on Heterogeneous Multicore Platforms

DTIC Science & Technology

2016-01-01

synchronous parallel tasks on multicore platforms. In 25th ECRTS, 2013. [10] U. Devi. Soft Real - Time Scheduling on Multiprocessors. PhD thesis...report, Washington University in St Louis, 2014. [18] C. Liu and J. Anderson. Supporting soft real - time DAG-based sys- tems on multiprocessors with...analysis for DAG-based real - time task systems im- plemented on heterogeneous multicore platforms. The spe- cific analysis problem that is considered was

Non-traditional Sensor Tasking for SSA: A Case Study

NASA Astrophysics Data System (ADS)

Herz, A.; Herz, E.; Center, K.; Martinez, I.; Favero, N.; Clark, C.; Therien, W.; Jeffries, M.

Industry has recognized that maintaining SSA of the orbital environment going forward is too challenging for the government alone. Consequently there are a significant number of commercial activities in various stages of development standing-up novel sensors and sensor networks to assist in SSA gathering and dissemination. Use of these systems will allow government and military operators to focus on the most sensitive space control issues while allocating routine or lower priority data gathering responsibility to the commercial side. The fact that there will be multiple (perhaps many) commercial sensor capabilities available in this new operational model begets a common access solution. Absent a central access point to assert data needs, optimized use of all commercial sensor resources is not possible and the opportunity for coordinated collections satisfying overarching SSA-elevating objectives is lost. Orbit Logic is maturing its Heimdall Web system - an architecture facilitating “data requestor” perspectives (allowing government operations centers to assert SSA data gathering objectives) and “sensor operator” perspectives (through which multiple sensors of varying phenomenology and capability are integrated via machine -machine interfaces). When requestors submit their needs, Heimdall’s planning engine determines tasking schedules across all sensors, optimizing their use via an SSA-specific figure-of-merit. ExoAnalytic was a key partner in refining the sensor operator interfaces, working with Orbit Logic through specific details of sensor tasking schedule delivery and the return of observation data. Scant preparation on both sides preceded several integration exercises (walk-then-run style), which culminated in successful demonstration of the ability to supply optimized schedules for routine public catalog data collection – then adapt sensor tasking schedules in real-time upon receipt of urgent data collection requests. This paper will provide a narrative of the joint integration process - detailing decision points, compromises, and results obtained on the road toward a set of interoperability standards for commercial sensor accommodation.

Influence of a scheduled-waiting task on EMG reactivity and oral habits among facial pain patients and no-pain controls.

PubMed

Nicholson, R A; Townsend, D R; Gramling, S E

2000-12-01

Recent research has strongly implicated the role of psychological stress in the development of temporomandibular disorders (TMD). It is widely reported that oral habits (e.g., teeth grinding) probably provide a behavioral link between stress and the development of TMD symptomatology. Extrapolation of research in the field of adjunctive behavior to the TMD disorders suggests that oral behaviors may develop conjointly with fixed-time (FT) stimulus presentation. The current experiment extended previous research examining this possibility by assessing the influence of experimental stress on masseter EMG and oral habits among persons who met broadband criteria for TMD and no-pain controls. Oral habit activity was assessed via self-report questionnaire whereas masseter muscle activity was measured continuously via electromyography across four phases (Adaptation, Free-Play, Scheduled-Play, Recovery). The Scheduled-Play phase was designed as a stress-reactivity task that included an FT schedule. Results indicated that, consistent with the stress-reactivity model, the Scheduled-Play phase resulted in a significant increase in masseter EMG levels relative to Free-Play and Adaptation, and that this effect was significantly larger for the TMD group relative to controls. The results suggest an adjunctive behavior effect although the effect was not specific to those with facial pain. Oral habit data showed a significant phase effect with oral habits that was significantly higher during the Scheduled-Play phase relative to Adaptation. The findings are the impetus for further study regarding the mechanisms whereby oral habits are developed and maintained despite their painful consequences.

Task 2 Report: Algorithm Development and Performance Analysis

DTIC Science & Technology

1993-07-01

separated peaks ............................................. 39 7-16 Example ILGC data for schedule 3 phosphites showing an analysis method which integrates...more closely follows the baseline ................. 40 7-18 Example R.GC data for schedule 3 phosphites showing an analysis method resulting in unwanted...much of the ambiguity that can arise in GC/MS with trace environmental samples, for example. Correlated chromatography, on the other hand, separates the

Teaching Community Skills to Two Young Children with Autism Using a Digital Self-Managed Activity Schedule

ERIC Educational Resources Information Center

Cheung, Yvonne; Schulze, Kimberly A.; Leaf, Justin B.; Rudrud, Eric

2016-01-01

The current study investigated the efficacy of a self-managed activity schedule to teach 2 participants how to effectively order food items from a local community bakery. 2 participants who were on the autism spectrum were taught to follow a task analysis that was displayed on an iPhone. We used a multiple baseline design across participants to…

How to Build the Master Schedule in 10 Easy Steps: A Guide for Secondary School Administrators

ERIC Educational Resources Information Center

Kussin, Steven S.

2007-01-01

This book is an incredibly valuable resource to anyone involved in building a master schedule. The author provides a comprehensive description of the processes involved and makes the reader aware of what needs to be considered and done throughout the process. One of the most time-consuming tasks for school leaders is creating a master schedule…

Feasibility of the adaptive and automatic presentation of tasks (ADAPT) system for rehabilitation of upper extremity function post-stroke

PubMed Central

2011-01-01

Background Current guidelines for rehabilitation of arm and hand function after stroke recommend that motor training focus on realistic tasks that require reaching and manipulation and engage the patient intensively, actively, and adaptively. Here, we investigated the feasibility of a novel robotic task-practice system, ADAPT, designed in accordance with such guidelines. At each trial, ADAPT selects a functional task according to a training schedule and with difficulty based on previous performance. Once the task is selected, the robot picks up and presents the corresponding tool, simulates the dynamics of the tasks, and the patient interacts with the tool to perform the task. Methods Five participants with chronic stroke with mild to moderate impairments (> 9 months post-stroke; Fugl-Meyer arm score 49.2 ± 5.6) practiced four functional tasks (selected out of six in a pre-test) with ADAPT for about one and half hour and 144 trials in a pseudo-random schedule of 3-trial blocks per task. Results No adverse events occurred and ADAPT successfully presented the six functional tasks without human intervention for a total of 900 trials. Qualitative analysis of trajectories showed that ADAPT simulated the desired task dynamics adequately, and participants reported good, although not excellent, task fidelity. During training, the adaptive difficulty algorithm progressively increased task difficulty leading towards an optimal challenge point based on performance; difficulty was then continuously adjusted to keep performance around the challenge point. Furthermore, the time to complete all trained tasks decreased significantly from pretest to one-hour post-test. Finally, post-training questionnaires demonstrated positive patient acceptance of ADAPT. Conclusions ADAPT successfully provided adaptive progressive training for multiple functional tasks based on participant's performance. Our encouraging results establish the feasibility of ADAPT; its efficacy will next be tested in a clinical trial. PMID:21813010

Supporting Real-Time Operations and Execution through Timeline and Scheduling Aids

NASA Technical Reports Server (NTRS)

Marquez, Jessica J.; Pyrzak, Guy; Hashemi, Sam; Ahmed, Samia; McMillin, Kevin Edward; Medwid, Joseph Daniel; Chen, Diana; Hurtle, Esten

2013-01-01

Since 2003, the NASA Ames Research Center has been actively involved in researching and advancing the state-of-the-art of planning and scheduling tools for NASA mission operations. Our planning toolkit SPIFe (Scheduling and Planning Interface for Exploration) has supported a variety of missions and field tests, scheduling activities for Mars rovers as well as crew on-board International Space Station and NASA earth analogs. The scheduled plan is the integration of all the activities for the day/s. In turn, the agents (rovers, landers, spaceships, crew) execute from this schedule while the mission support team members (e.g., flight controllers) follow the schedule during execution. Over the last couple of years, our team has begun to research and validate methods that will better support users during realtime operations and execution of scheduled activities. Our team utilizes human-computer interaction principles to research user needs, identify workflow processes, prototype software aids, and user test these. This paper discusses three specific prototypes developed and user tested to support real-time operations: Score Mobile, Playbook, and Mobile Assistant for Task Execution (MATE).

Schedule-Aware Workflow Management Systems

NASA Astrophysics Data System (ADS)

Mans, Ronny S.; Russell, Nick C.; van der Aalst, Wil M. P.; Moleman, Arnold J.; Bakker, Piet J. M.

Contemporary workflow management systems offer work-items to users through specific work-lists. Users select the work-items they will perform without having a specific schedule in mind. However, in many environments work needs to be scheduled and performed at particular times. For example, in hospitals many work-items are linked to appointments, e.g., a doctor cannot perform surgery without reserving an operating theater and making sure that the patient is present. One of the problems when applying workflow technology in such domains is the lack of calendar-based scheduling support. In this paper, we present an approach that supports the seamless integration of unscheduled (flow) and scheduled (schedule) tasks. Using CPN Tools we have developed a specification and simulation model for schedule-aware workflow management systems. Based on this a system has been realized that uses YAWL, Microsoft Exchange Server 2007, Outlook, and a dedicated scheduling service. The approach is illustrated using a real-life case study at the AMC hospital in the Netherlands. In addition, we elaborate on the experiences obtained when developing and implementing a system of this scale using formal techniques.

NASA replanning efforts continue

NASA Astrophysics Data System (ADS)

Katzoff, Judith A.

A task force of the National Aeronautics and Space Administration (NASA) is producing new launch schedules for NASA's three remaining space shuttle orbiters, possibly supplemented by expendable launch vehicles. In the wake of the explosion of the space shuttle Challenger on January 28, 1986, the task force is assuming a delay of 12-18 months before resumption of shuttle flights.NASA's Headquarters Replanning Task Force, which meets daily, is separate from the agency's Data and Design Analysis Task Force, which collects and analyzes information about the accident for the use of the investigative commission appointed by President Ronald Reagan.

Self-Reinforcement Compared to Teacher-Delivered Reinforcement during Activity Schedules on the iPod Touch

ERIC Educational Resources Information Center

Beaver, Brittany N.; Reeve, Sharon A.; Reeve, Kenneth F.; DeBar, Ruth M.

2017-01-01

The current study assessed whether four 15- to 17-year-old individuals diagnosed with autism would remain on-task for more intervals and complete tasks independently as a function of using self-reinforcement or teacher-delivered reinforcement. An adapted alternating-treatments design with teacher-delivered reinforcement, self-reinforcement, and a…

Impact of Collaborative Tools Utilization on Group Performance in University Students

ERIC Educational Resources Information Center

Hidayanto, Achmad Nizar; Setyady, Stella Tantra

2014-01-01

Nowadays the growth of technology influences the changes in group collaboration's process either for the professional or for the students. The requirement of interaction in group collaboration while doing task forces the students to schedule their meeting in order to finish the task given. So the technology starts to influence the process of group…

Energy-Efficient Scheduling for Hybrid Tasks in Control Devices for the Internet of Things

PubMed Central

Gao, Zhigang; Wu, Yifan; Dai, Guojun; Xia, Haixia

2012-01-01

In control devices for the Internet of Things (IoT), energy is one of the critical restriction factors. Dynamic voltage scaling (DVS) has been proved to be an effective method for reducing the energy consumption of processors. This paper proposes an energy-efficient scheduling algorithm for IoT control devices with hard real-time control tasks (HRCTs) and soft real-time tasks (SRTs). The main contribution of this paper includes two parts. First, it builds the Hybrid tasks with multi-subtasks of different function Weight (HoW) task model for IoT control devices. HoW describes the structure of HRCTs and SRTs, and their properties, e.g., deadlines, execution time, preemption properties, and energy-saving goals, etc. Second, it presents the Hybrid Tasks' Dynamic Voltage Scaling (HTDVS) algorithm. HTDVS first sets the slowdown factors of subtasks while meeting the different real-time requirements of HRCTs and SRTs, and then dynamically reclaims, reserves, and reuses the slack time of the subtasks to meet their ideal energy-saving goals. Experimental results show HTDVS can reduce energy consumption about 10%–80% while meeting the real-time requirements of HRCTs, HRCTs help to reduce the deadline miss ratio (DMR) of systems, and HTDVS has comparable performance with the greedy algorithm and is more favorable to keep the subtasks' ideal speeds. PMID:23112659

The use of irradiated corneal patch grafts in pediatric Ahmed drainage implant surgery.

PubMed

Nolan, Kaitlyn Wallace; Lucas, Jordyn; Abbasian, Javaneh

2015-10-01

To describe the use of irradiated cornea for scleral reinforcement in Ahmed glaucoma valve drainage implant (AGV) devices in children. The medical records of patients <18 years of age who underwent AGV surgery with irradiated cornea as scleral reinforcement were reviewed retrospectively. The primary outcome measure was erosion of the drainage tube through the corneal patch graft. Secondary outcome measures included other major complications: persistent inflammation, wound dehiscence, transmission of infectious disease, endophthalmitis, and tube/plate self-explantation. A total of 25 procedures (20 patients) met inclusion criteria. Average patient age was 70 months (range, 2 months to 17 years). Mean follow-up was 24.8 months (range, 6 months to 6.2 years). One tube experienced conjunctival exposure through two separate corneal grafts (2/25 cases [8%]), sequentially in the same eye. The first event occurred at month 3.5 after primary implantation of the tube shunt; the second erosion occurred following revision of the existing implant at month 1.5 postoperatively. There were 2 cases of auto-explantation, 2 cases of wound dehiscence, and 1 case of persistent inflammation. There were no cases of endophthalmitis or other infections. To our knowledge, this is the first report describing the use of corneal patch grafts in children. Irradiated cornea improves cosmesis and enhances visualization of the tube. The risk of tube exposure was found to be low and comparable to other materials used as a patch graft. Copyright © 2015 American Association for Pediatric Ophthalmology and Strabismus. Published by Elsevier Inc. All rights reserved.

A new distributed systems scheduling algorithm: a swarm intelligence approach

NASA Astrophysics Data System (ADS)

Haghi Kashani, Mostafa; Sarvizadeh, Raheleh; Jameii, Mahdi

2011-12-01

The scheduling problem in distributed systems is known as an NP-complete problem, and methods based on heuristic or metaheuristic search have been proposed to obtain optimal and suboptimal solutions. The task scheduling is a key factor for distributed systems to gain better performance. In this paper, an efficient method based on memetic algorithm is developed to solve the problem of distributed systems scheduling. With regard to load balancing efficiently, Artificial Bee Colony (ABC) has been applied as local search in the proposed memetic algorithm. The proposed method has been compared to existing memetic-Based approach in which Learning Automata method has been used as local search. The results demonstrated that the proposed method outperform the above mentioned method in terms of communication cost.

The Consolidated Planning and Scheduling System for Space Transportation and Space Station operations - Successful development experience

NASA Technical Reports Server (NTRS)

Hornstein, Rhoda S.; Willoughby, John K.; Gardner, Jo A.; Shinkle, Gerald L.

1993-01-01

In 1992, NASA made the decision to evolve a Consolidated Planning System (CPS) by adding the Space Transportation System (STS) requirements to the Space Station Freedom (SSF) planning software. This paper describes this evolutionary process, which began with a series of six-month design-build-test cycles, using a domain-independent architecture and a set of developmental tools known as the Advanced Scheduling Environment. It is shown that, during these tests, the CPS could be used at multiple organizational levels of planning and for integrating schedules from geographically distributed (including international) planning environments. The potential for using the CPS for other planning and scheduling tasks in the SSF program is being currently examined.

Expert system for on-board satellite scheduling and control

NASA Technical Reports Server (NTRS)

Barry, John M.; Sary, Charisse

1988-01-01

An Expert System is described which Rockwell Satellite and Space Electronics Division (S&SED) is developing to dynamically schedule the allocation of on-board satellite resources and activities. This expert system is the Satellite Controller. The resources to be scheduled include power, propellant and recording tape. The activities controlled include scheduling satellite functions such as sensor checkout and operation. The scheduling of these resources and activities is presently a labor intensive and time consuming ground operations task. Developing a schedule requires extensive knowledge of the system and subsystems operations, operational constraints, and satellite design and configuration. This scheduling process requires highly trained experts anywhere from several hours to several weeks to accomplish. The process is done through brute force, that is examining cryptic mnemonic data off line to interpret the health and status of the satellite. Then schedules are formulated either as the result of practical operator experience or heuristics - that is rules of thumb. Orbital operations must become more productive in the future to reduce life cycle costs and decrease dependence on ground control. This reduction is required to increase autonomy and survivability of future systems. The design of future satellites require that the scheduling function be transferred from ground to on board systems.

Handling Qualities of a Capsule Spacecraft During Atmospheric Entry

NASA Technical Reports Server (NTRS)

Bilimoria, Karl D.; Mueller, Eric R.

2010-01-01

A piloted simulation was conducted to study handling qualities for capsule spacecraft entering the Earth s atmosphere. Eight evaluation pilots, including six pilot astronauts, provided Cooper-Harper ratings, workload ratings, and qualitative comments. The simulation began after descending through the atmospheric entry interface point and continued until the drogue parachutes deployed. There were two categories of piloting tasks, both of which required bank angle control. In one task category, the pilot followed a closed-loop bank angle command computed by the backup guidance system to manage g-loads during entry. In the other task category, the pilot used intuitive rules to determine the desired bank angle independently, based on an open-loop schedule of vertical speed, Mach, and total energy specified at several range-to-target gates along the entry trajectory. Pilots were able to accurately track the bank angle guidance commands and steered the capsule toward the recovery site with essentially the same range error as the benchmark autopilot trajectory albeit with substantially higher propellant usage, and the handling qualities for this task were satisfactory. Another key result was that the complex piloting task of atmospheric entry could be performed satisfactorily, even in the presence of large dispersions, by controlling bank angle to follow a simple open-loop schedule.

Population-based learning of load balancing policies for a distributed computer system

NASA Technical Reports Server (NTRS)

Mehra, Pankaj; Wah, Benjamin W.

1993-01-01

Effective load-balancing policies use dynamic resource information to schedule tasks in a distributed computer system. We present a novel method for automatically learning such policies. At each site in our system, we use a comparator neural network to predict the relative speedup of an incoming task using only the resource-utilization patterns obtained prior to the task's arrival. Outputs of these comparator networks are broadcast periodically over the distributed system, and the resource schedulers at each site use these values to determine the best site for executing an incoming task. The delays incurred in propagating workload information and tasks from one site to another, as well as the dynamic and unpredictable nature of workloads in multiprogrammed multiprocessors, may cause the workload pattern at the time of execution to differ from patterns prevailing at the times of load-index computation and decision making. Our load-balancing policy accommodates this uncertainty by using certain tunable parameters. We present a population-based machine-learning algorithm that adjusts these parameters in order to achieve high average speedups with respect to local execution. Our results show that our load-balancing policy, when combined with the comparator neural network for workload characterization, is effective in exploiting idle resources in a distributed computer system.

An Analysis of Mission Critical Computer Software in Naval Aviation

DTIC Science & Technology

1991-03-01

No. Task No. Work Unit Accesion Number 11. TITLE (Include Security Classification) AN ANALYSIS OF MISSION CRITICAL COMPUTER SOFTWARE IN NAVAL AVIATION...software development schedules were sustained without a milestone change being made. Also, software that was released to the fleet had no major...fleet contain any major defects? This research has revealed that only about half of the original software development schedules were sustained without a

A Study of the Operating Room Scheduling System at Tripler Army Medical Center, Hawaii

DTIC Science & Technology

1981-08-01

PROCESSING CLASS V SYSTEM .... .......... . A BIBLIOGRAPHY ....... ........... . . . .. . ii ’I. INTRODUCTIO9 Development of the Problem Convinced that...of the most difficult administrativo tasks that a modern hospital must face, and proposed using a combination of a master posting sheet and a...deal with scheduling problems.9 This particular process also incorporates the two-room system doscribed earlier, and the author admits that this

AgRISTARS: Renewable resources inventory. Land information support system implementation plan and schedule. [San Juan National Forest pilot test

NASA Technical Reports Server (NTRS)

Yao, S. S. (Principal Investigator)

1981-01-01

The planning and scheduling of the use of remote sensing and computer technology to support the land management planning effort at the national forests level are outlined. The task planning and system capability development were reviewed. A user evaluation is presented along with technological transfer methodology. A land management planning pilot test of the San Juan National Forest is discussed.

Ant Colony Optimization for Mapping, Scheduling and Placing in Reconfigurable Systems

DOE Office of Scientific and Technical Information (OSTI.GOV)

Ferrandi, Fabrizio; Lanzi, Pier Luca; Pilato, Christian

Modern heterogeneous embedded platforms, com- posed of several digital signal, application specific and general purpose processors, also include reconfigurable devices support- ing partial dynamic reconfiguration. These devices can change the behavior of some of their parts during execution, allowing hardware acceleration of more sections of the applications. Never- theless, partial dynamic reconfiguration imposes severe overheads in terms of latency. For such systems, a critical part of the design phase is deciding on which processing elements (mapping) and when (scheduling) executing a task, but also how to place them on the reconfigurable device to guarantee the most efficient reuse of themore » programmable logic. In this paper we propose an algorithm based on Ant Colony Optimization (ACO) that simultaneously executes the scheduling, the mapping and the linear placing of tasks, hiding reconfiguration overheads through prefetching. Our heuristic gradually constructs solutions and then searches around the best ones, cutting out non-promising areas of the design space. We show how to consider the partial dynamic reconfiguration constraints in the scheduling, placing and mapping problems and compare our formulation to other heuristics that address the same problems. We demonstrate that our proposal is more general and robust, and finds better solutions (16.5% in average) with respect to competing solutions.« less

Improving DOE Project Performance Using the DOD Integrated Master Plan - 12481

DOE Office of Scientific and Technical Information (OSTI.GOV)

Alleman, Glen B.; Nosbisch, Michael R.

2012-07-01

DOE O 413 measures a project's progress to plan by the consumption of funding, the passage of time, and the meeting of milestones. In March of 2003, then Under Secretary, Energy, Science, Card received a memo directing the implementation of Project Management and the Project Management Manual, including the Integrated Master Plan and Integrated Master Schedule. This directive states 'the integrated master plan and schedule tie together all project tasks by showing their logical relationships and any constraints controlling the start or finish of each task. This process results in a hierarchy of related functional and layered schedules derived frommore » the Work Breakdown Structure that can be used for monitoring and controlling project progress'. This paper shows how restoring the IMP/IMS paradigm to DOE program management increases the probability of program success in ways not currently available using DOD O 413 processes alone. Using DOE O 413 series guidance, adding the Integrated Master Plan and Integrated Master Schedule paradigm would provide a hierarchical set of performance measures for each 'package of work,' that provides measurable visibility to the increasing maturity of the project. This measurable maturity provides the mechanism to forecast future performance of cost, schedule, and technical outcomes in ways not available using just the activities in DOE O 413. With this information project managers have another tool available to address the issues identified in GAO-07-336 and GAO-09-406. (authors)« less

Facilitating preemptive hardware system design using partial reconfiguration techniques.

PubMed

Dondo Gazzano, Julio; Rincon, Fernando; Vaderrama, Carlos; Villanueva, Felix; Caba, Julian; Lopez, Juan Carlos

2014-01-01

In FPGA-based control system design, partial reconfiguration is especially well suited to implement preemptive systems. In real-time systems, the deadline for critical task can compel the preemption of noncritical one. Besides, an asynchronous event can demand immediate attention and, then, force launching a reconfiguration process for high-priority task implementation. If the asynchronous event is previously scheduled, an explicit activation of the reconfiguration process is performed. If the event cannot be previously programmed, such as in dynamically scheduled systems, an implicit activation to the reconfiguration process is demanded. This paper provides a hardware-based approach to explicit and implicit activation of the partial reconfiguration process in dynamically reconfigurable SoCs and includes all the necessary tasks to cope with this issue. Furthermore, the reconfiguration service introduced in this work allows remote invocation of the reconfiguration process and then the remote integration of off-chip components. A model that offers component location transparency is also presented to enhance and facilitate system integration.

Facilitating Preemptive Hardware System Design Using Partial Reconfiguration Techniques

PubMed Central

Rincon, Fernando; Vaderrama, Carlos; Villanueva, Felix; Caba, Julian; Lopez, Juan Carlos

2014-01-01

In FPGA-based control system design, partial reconfiguration is especially well suited to implement preemptive systems. In real-time systems, the deadline for critical task can compel the preemption of noncritical one. Besides, an asynchronous event can demand immediate attention and, then, force launching a reconfiguration process for high-priority task implementation. If the asynchronous event is previously scheduled, an explicit activation of the reconfiguration process is performed. If the event cannot be previously programmed, such as in dynamically scheduled systems, an implicit activation to the reconfiguration process is demanded. This paper provides a hardware-based approach to explicit and implicit activation of the partial reconfiguration process in dynamically reconfigurable SoCs and includes all the necessary tasks to cope with this issue. Furthermore, the reconfiguration service introduced in this work allows remote invocation of the reconfiguration process and then the remote integration of off-chip components. A model that offers component location transparency is also presented to enhance and facilitate system integration. PMID:24672292

42 CFR 441.505 - Definitions.

Code of Federal Regulations, 2013 CFR

2013-10-01

... including, but not limited to, tasks such as eating, toileting, grooming, dressing, bathing, and... exercise as much control as desired to select, train, supervise, schedule, determine duties, and dismiss...

42 CFR 441.505 - Definitions.

Code of Federal Regulations, 2014 CFR

2014-10-01

... including, but not limited to, tasks such as eating, toileting, grooming, dressing, bathing, and... exercise as much control as desired to select, train, supervise, schedule, determine duties, and dismiss...

42 CFR 441.505 - Definitions.

Code of Federal Regulations, 2012 CFR

2012-10-01

... including, but not limited to, tasks such as eating, toileting, grooming, dressing, bathing, and... exercise as much control as desired to select, train, supervise, schedule, determine duties, and dismiss...

Space station payload operations scheduling with ESP2

NASA Technical Reports Server (NTRS)

Stacy, Kenneth L.; Jaap, John P.

1988-01-01

The Mission Analysis Division of the Systems Analysis and Integration Laboratory at the Marshall Space Flight Center is developing a system of programs to handle all aspects of scheduling payload operations for Space Station. The Expert Scheduling Program (ESP2) is the heart of this system. The task of payload operations scheduling can be simply stated as positioning the payload activities in a mission so that they collect their desired data without interfering with other activities or violating mission constraints. ESP2 is an advanced version of the Experiment Scheduling Program (ESP) which was developed by the Mission Integration Branch beginning in 1979 to schedule Spacelab payload activities. The automatic scheduler in ESP2 is an expert system that embodies the rules that expert planners would use to schedule payload operations by hand. This scheduler uses depth-first searching, backtracking, and forward chaining techniques to place an activity so that constraints (such as crew, resources, and orbit opportunities) are not violated. It has an explanation facility to show why an activity was or was not scheduled at a certain time. The ESP2 user can also place the activities in the schedule manually. The program offers graphical assistance to the user and will advise when constraints are being violated. ESP2 also has an option to identify conflict introduced into an existing schedule by changes to payload requirements, mission constraints, and orbit opportunities.

A hierarchical scheduling and management solution for dynamic reconfiguration in FPGA-based embedded systems

NASA Astrophysics Data System (ADS)

Cervero, T.; Gómez, A.; López, S.; Sarmiento, R.; Dondo, J.; Rincón, F.; López, J. C.

2013-05-01

One of the limiting factors that have prevented a widely dissemination of the reconfigurable technology is the absence of an appropriate model for certain target applications capable of offering a reliable control. Moreover, the lack of flexible and easy-to-use scheduling and management systems are also relevant drawbacks to be considered. Under static scenarios, it is relatively easy to schedule and manage the reconfiguration process since all the variations corresponding to predetermined and well-known tasks. However, the difficulty increases when the adaptation needs of the overall system change semi-randomly according to the environmental fluctuations. In this context, this work proposes a change in the paradigm of dynamically reconfigurable systems, by attending to the dynamically reconfigurable control problematic as a whole, in which the scheduling and the placement issues are packed together as a hierarchical management structure, interacting together as one entity from the system point of view, but performing their tasks with certain degree of independence each other. In this sense, the top hierarchical level corresponds with a dynamic scheduler in charge of planning and adjusting all the reconfigurable modules according to the variations of the external stimulus. The lower level interacts with the physical layer of the device by means of instantiating, relocating, removing a reconfigurable module following the scheduler's instructions. In regards to how fast is the proposed solution, the total partial reconfiguration time achieved with this proposal has been measured and compared with other two approaches: 1) using traditional Xilinx's tools; 2) using an optimized version of the Xilinx's drivers. The collected numbers demonstrate that our solution reaches a gain up to 10 times faster than the other approaches.

HURON (HUman and Robotic Optimization Network) Multi-Agent Temporal Activity Planner/Scheduler

NASA Technical Reports Server (NTRS)

Hua, Hook; Mrozinski, Joseph J.; Elfes, Alberto; Adumitroaie, Virgil; Shelton, Kacie E.; Smith, Jeffrey H.; Lincoln, William P.; Weisbin, Charles R.

2012-01-01

HURON solves the problem of how to optimize a plan and schedule for assigning multiple agents to a temporal sequence of actions (e.g., science tasks). Developed as a generic planning and scheduling tool, HURON has been used to optimize space mission surface operations. The tool has also been used to analyze lunar architectures for a variety of surface operational scenarios in order to maximize return on investment and productivity. These scenarios include numerous science activities performed by a diverse set of agents: humans, teleoperated rovers, and autonomous rovers. Once given a set of agents, activities, resources, resource constraints, temporal constraints, and de pendencies, HURON computes an optimal schedule that meets a specified goal (e.g., maximum productivity or minimum time), subject to the constraints. HURON performs planning and scheduling optimization as a graph search in state-space with forward progression. Each node in the graph contains a state instance. Starting with the initial node, a graph is automatically constructed with new successive nodes of each new state to explore. The optimization uses a set of pre-conditions and post-conditions to create the children states. The Python language was adopted to not only enable more agile development, but to also allow the domain experts to easily define their optimization models. A graphical user interface was also developed to facilitate real-time search information feedback and interaction by the operator in the search optimization process. The HURON package has many potential uses in the fields of Operations Research and Management Science where this technology applies to many commercial domains requiring optimization to reduce costs. For example, optimizing a fleet of transportation truck routes, aircraft flight scheduling, and other route-planning scenarios involving multiple agent task optimization would all benefit by using HURON.

T-L Plane Abstraction-Based Energy-Efficient Real-Time Scheduling for Multi-Core Wireless Sensors

PubMed Central

Kim, Youngmin; Lee, Ki-Seong; Pham, Ngoc-Son; Lee, Sun-Ro; Lee, Chan-Gun

2016-01-01

Energy efficiency is considered as a critical requirement for wireless sensor networks. As more wireless sensor nodes are equipped with multi-cores, there are emerging needs for energy-efficient real-time scheduling algorithms. The T-L plane-based scheme is known to be an optimal global scheduling technique for periodic real-time tasks on multi-cores. Unfortunately, there has been a scarcity of studies on extending T-L plane-based scheduling algorithms to exploit energy-saving techniques. In this paper, we propose a new T-L plane-based algorithm enabling energy-efficient real-time scheduling on multi-core sensor nodes with dynamic power management (DPM). Our approach addresses the overhead of processor mode transitions and reduces fragmentations of the idle time, which are inherent in T-L plane-based algorithms. Our experimental results show the effectiveness of the proposed algorithm compared to other energy-aware scheduling methods on T-L plane abstraction. PMID:27399722

Nonstandard Work Schedules, Family Dynamics, and Mother-Child Interactions During Early Childhood.

PubMed

Prickett, Kate C

2018-03-01

The rising number of parents who work nonstandard schedules has led to a growing body of research concerned with what this trend means for children. The negative outcomes for children of parents who work nonstandard schedules are thought to arise from the disruptions these schedules place on family life, and thus, the types of parenting that support their children's development, particularly when children are young. Using a nationally representative sample of two-parent families (Early Childhood Longitudinal Study-Birth cohort, n = 3,650), this study examined whether mothers' and their partners' nonstandard work schedules were associated with mothers' parenting when children were 2 and 4 years old. Structural equation models revealed that mothers' and their partners' nonstandard work schedules were associated with mothers' lower scores on measures of positive and involved parenting. These associations were mediated by fathers' lower levels of participation in cognitively supportive parenting and greater imbalance in cognitively supportive tasks conducted by mothers versus fathers.

Constraint-based scheduling

NASA Technical Reports Server (NTRS)

Zweben, Monte

1991-01-01

The GERRY scheduling system developed by NASA Ames with assistance from the Lockheed Space Operations Company, and the Lockheed Artificial Intelligence Center, uses a method called constraint-based iterative repair. Using this technique, one encodes both hard rules and preference criteria into data structures called constraints. GERRY repeatedly attempts to improve schedules by seeking repairs for violated constraints. The system provides a general scheduling framework which is being tested on two NASA applications. The larger of the two is the Space Shuttle Ground Processing problem which entails the scheduling of all the inspection, repair, and maintenance tasks required to prepare the orbiter for flight. The other application involves power allocation for the NASA Ames wind tunnels. Here the system will be used to schedule wind tunnel tests with the goal of minimizing power costs. In this paper, we describe the GERRY system and its application to the Space Shuttle problem. We also speculate as to how the system would be used for manufacturing, transportation, and military problems.

Constraint-based scheduling

NASA Technical Reports Server (NTRS)

Zweben, Monte

1991-01-01

The GERRY scheduling system developed by NASA Ames with assistance from the Lockheed Space Operations Company, and the Lockheed Artificial Intelligence Center, uses a method called constraint based iterative repair. Using this technique, one encodes both hard rules and preference criteria into data structures called constraints. GERRY repeatedly attempts to improve schedules by seeking repairs for violated constraints. The system provides a general scheduling framework which is being tested on two NASA applications. The larger of the two is the Space Shuttle Ground Processing problem which entails the scheduling of all inspection, repair, and maintenance tasks required to prepare the orbiter for flight. The other application involves power allocations for the NASA Ames wind tunnels. Here the system will be used to schedule wind tunnel tests with the goal of minimizing power costs. In this paper, we describe the GERRY system and its applications to the Space Shuttle problem. We also speculate as to how the system would be used for manufacturing, transportation, and military problems.

Constraint-based scheduling

NASA Technical Reports Server (NTRS)

Zweben, Monte

1993-01-01

The GERRY scheduling system developed by NASA Ames with assistance from the Lockheed Space Operations Company, and the Lockheed Artificial Intelligence Center, uses a method called constraint-based iterative repair. Using this technique, one encodes both hard rules and preference criteria into data structures called constraints. GERRY repeatedly attempts to improve schedules by seeking repairs for violated constraints. The system provides a general scheduling framework which is being tested on two NASA applications. The larger of the two is the Space Shuttle Ground Processing problem which entails the scheduling of all the inspection, repair, and maintenance tasks required to prepare the orbiter for flight. The other application involves power allocation for the NASA Ames wind tunnels. Here the system will be used to schedule wind tunnel tests with the goal of minimizing power costs. In this paper, we describe the GERRY system and its application to the Space Shuttle problem. We also speculate as to how the system would be used for manufacturing, transportation, and military problems.

A System for Planning Ahead

NASA Technical Reports Server (NTRS)

2002-01-01

A software system that uses artificial intelligence techniques to help with complex Space Shuttle scheduling at Kennedy Space Center is commercially available. Stottler Henke Associates, Inc.(SHAI), is marketing its automatic scheduling system, the Automated Manifest Planner (AMP), to industries that must plan and project changes many different times before the tasks are executed. The system creates optimal schedules while reducing manpower costs. Using information entered into the system by expert planners, the system automatically makes scheduling decisions based upon resource limitations and other constraints. It provides a constraint authoring system for adding other constraints to the scheduling process as needed. AMP is adaptable to assist with a variety of complex scheduling problems in manufacturing, transportation, business, architecture, and construction. AMP can benefit vehicle assembly plants, batch processing plants, semiconductor manufacturing, printing and textiles, surface and underground mining operations, and maintenance shops. For most of SHAI's commercial sales, the company obtains a service contract to customize AMP to a specific domain and then issues the customer a user license.

Compilation time analysis to minimize run-time overhead in preemptive scheduling on multiprocessors

NASA Astrophysics Data System (ADS)

Wauters, Piet; Lauwereins, Rudy; Peperstraete, J.

1994-10-01

This paper describes a scheduling method for hard real-time Digital Signal Processing (DSP) applications, implemented on a multi-processor. Due to the very high operating frequencies of DSP applications (typically hundreds of kHz) runtime overhead should be kept as small as possible. Because static scheduling introduces very little run-time overhead it is used as much as possible. Dynamic pre-emption of tasks is allowed if and only if it leads to better performance in spite of the extra run-time overhead. We essentially combine static scheduling with dynamic pre-emption using static priorities. Since we are dealing with hard real-time applications we must be able to guarantee at compile-time that all timing requirements will be satisfied at run-time. We will show that our method performs at least as good as any static scheduling method. It also reduces the total amount of dynamic pre-emptions compared with run time methods like deadline monotonic scheduling.

Self-paced preparation for a task switch eliminates attentional inertia but not the performance switch cost.

PubMed

Longman, Cai S; Lavric, Aureliu; Monsell, Stephen

2017-06-01

The performance overhead associated with changing tasks (the "switch cost") usually diminishes when the task is specified in advance but is rarely eliminated by preparation. A popular account of the "residual" (asymptotic) switch cost is that it reflects "task-set inertia": carry-over of task-set parameters from the preceding trial(s). New evidence for a component of "task-set inertia" comes from eye-tracking, where the location associated with the previously (but no longer) relevant task is fixated preferentially over other irrelevant locations, even when preparation intervals are generous. Might such limits in overcoming task-set inertia in general, and "attentional inertia" in particular, result from suboptimal scheduling of preparation when the time available is outside one's control? In the present study, the stimulus comprised 3 digits located at the points of an invisible triangle, preceded by a central verbal cue specifying which of 3 classification tasks to perform, each consistently applied to just 1 digit location. The digits were presented only when fixation moved away from the cue, thus giving the participant control over preparation time. In contrast to our previous research with experimenter-determined preparation intervals, we found no sign of attentional inertia for the long preparation intervals. Self-paced preparation reduced but did not eliminate the performance switch cost-leaving a clear residual component in both reaction time and error rates. That the scheduling of preparation accounts for some, but not all, components of the residual switch cost, challenges existing accounts of the switch cost, even those which distinguish between preparatory and poststimulus reconfiguration processes. (PsycINFO Database Record (c) 2017 APA, all rights reserved).

Differential modulatory effects of cocaine on marmoset monkey recognition memory.

PubMed

Melamed, Jonathan L; de Jesus, Fernando M; Aquino, Jéssica; Vannuchi, Clarissa R S; Duarte, Renata B M; Maior, Rafael S; Tomaz, Carlos; Barros, Marilia

2017-01-01

Acute and repeated exposure to cocaine alters the cognitive performance of humans and animals. How each administration schedule affects the same memory task has yet to be properly established in nonhuman primates. Therefore, we assessed the performance of marmoset monkeys in a spontaneous object-location (SOL) recognition memory task after acute and repeated exposure to cocaine (COC; 5mg/kg, ip). Two identical neutral stimuli were explored on the 10-min sample trial, after which preferential exploration of the displaced vs the stationary object was analyzed on the 10-min test trial. For the acute treatment, cocaine was given immediately after the sample presentation, and spatial recognition was then tested after a 24-h interval. For the repeated exposure schedule, daily cocaine injections were given on 7 consecutive days. After a 7-day drug-free period, the SOL task was carried out with a 10-min intertrial interval. When given acutely postsample, COC improved the marmosets' recognition memory, whereas it had a detrimental effect after the repeated exposure. Thus, depending on the administration schedule, COC exerted opposing effects on the marmosets' ability to recognize spatial changes. This agrees with recent studies in rodents and the recognition impairment seen in human addicts. Further studies related to the effects of cocaine's acute×prior drug history on the same cognitive domain are warranted. © 2017 Elsevier B.V. All rights reserved.

Integrated scheduling of a container handling system with simultaneous loading and discharging operations

NASA Astrophysics Data System (ADS)

Li, Chen; Lu, Zhiqiang; Han, Xiaole; Zhang, Yuejun; Wang, Li

2016-03-01

The integrated scheduling of container handling systems aims to optimize the coordination and overall utilization of all handling equipment, so as to minimize the makespan of a given set of container tasks. A modified disjunctive graph is proposed and a mixed 0-1 programming model is formulated. A heuristic algorithm is presented, in which the original problem is divided into two subproblems. In the first subproblem, contiguous bay crane operations are applied to obtain a good quay crane schedule. In the second subproblem, proper internal truck and yard crane schedules are generated to match the given quay crane schedule. Furthermore, a genetic algorithm based on the heuristic algorithm is developed to search for better solutions. The computational results show that the proposed algorithm can efficiently find high-quality solutions. They also indicate the effectiveness of simultaneous loading and discharging operations compared with separate ones.

Human Performance in Continuous/Sustained Operations and the Demands of Extended Work/Rest Schedules: An Annotated Bibliography. Volume 2

DTIC Science & Technology

1989-06-01

subjective self -report questionnaires and more objective activity measures to estimate the amount of sleep obtained. The aim of the study was to determine...helicopter crews were observed and analyzed. It is concluded that the operational effiency of flight crews can be obtained by adopting four measures...task on simulated truck- driving task performance. Human factors. 27(2): 201-207. A study examined the effects of extra task stimulation and extra

Operation and Maintenance Resources for Small Drinking Water Systems

EPA Pesticide Factsheets

These documents and tools provide information on identifying treatment technologies that remove multiple contaminants, schedules for maintenance tasks and checklists, and logs for easily recording findings.

Multi-Satellite Observation Scheduling for Large Area Disaster Emergency Response

NASA Astrophysics Data System (ADS)

Niu, X. N.; Tang, H.; Wu, L. X.

2018-04-01

an optimal imaging plan, plays a key role in coordinating multiple satellites to monitor the disaster area. In the paper, to generate imaging plan dynamically according to the disaster relief, we propose a dynamic satellite task scheduling method for large area disaster response. First, an initial robust scheduling scheme is generated by a robust satellite scheduling model in which both the profit and the robustness of the schedule are simultaneously maximized. Then, we use a multi-objective optimization model to obtain a series of decomposing schemes. Based on the initial imaging plan, we propose a mixed optimizing algorithm named HA_NSGA-II to allocate the decomposing results thus to obtain an adjusted imaging schedule. A real disaster scenario, i.e., 2008 Wenchuan earthquake, is revisited in terms of rapid response using satellite resources and used to evaluate the performance of the proposed method with state-of-the-art approaches. We conclude that our satellite scheduling model can optimize the usage of satellite resources so as to obtain images in disaster response in a more timely and efficient manner.

An Experimental Investigation of the Effect of Worry on Responses to a Discrimination Learning Task

ERIC Educational Resources Information Center

Salters-Pedneault, Kristalyn; Suvak, Michael; Roemer, Lizabeth

2008-01-01

The current study examined the impact of both the tendency to worry (trait worry) and the process of worry (state worry) on subsequent behavioral responding in a schedule discrimination learning task. High and low trait worriers were randomly assigned to a state worry or relaxation incubation condition and completed a test of executive functioning…

Verifiable Task Assignment and Scheduling Controller

DTIC Science & Technology

2017-07-01

15 Figure 8. Summary of results for NASA -TLX overall workload and individual...using the NASA Task Load Index ( NASA -TLX; Hart & Staveland, 1988), which was completed using a computerized version of the questionnaire. The...filled out the NASA -TLX. Then prior to the second trial, participants were trained on how to use SPEC. SPEC training consisted of: an explanation of the

A Preliminary Investigation of the Reinforcement Function of Signal Detections in Simulated Baggage Screening: Further Support for the Vigilance Reinforcement Hypothesis

ERIC Educational Resources Information Center

Hogan, Lindsey C.; Bell, Matthew; Olson, Ryan

2009-01-01

The vigilance reinforcement hypothesis (VRH) asserts that errors in signal detection tasks are partially explained by operant reinforcement and extinction processes. VRH predictions were tested with a computerized baggage screening task. Our experiment evaluated the effects of signal schedule (extinction vs. variable interval 6 min) and visual…

Multiobjective Resource-Constrained Project Scheduling with a Time-Varying Number of Tasks

PubMed Central

Abello, Manuel Blanco

2014-01-01

In resource-constrained project scheduling (RCPS) problems, ongoing tasks are restricted to utilizing a fixed number of resources. This paper investigates a dynamic version of the RCPS problem where the number of tasks varies in time. Our previous work investigated a technique called mapping of task IDs for centroid-based approach with random immigrants (McBAR) that was used to solve the dynamic problem. However, the solution-searching ability of McBAR was investigated over only a few instances of the dynamic problem. As a consequence, only a small number of characteristics of McBAR, under the dynamics of the RCPS problem, were found. Further, only a few techniques were compared to McBAR with respect to its solution-searching ability for solving the dynamic problem. In this paper, (a) the significance of the subalgorithms of McBAR is investigated by comparing McBAR to several other techniques; and (b) the scope of investigation in the previous work is extended. In particular, McBAR is compared to a technique called, Estimation Distribution Algorithm (EDA). As with McBAR, EDA is applied to solve the dynamic problem, an application that is unique in the literature. PMID:24883398

Determination of carrier yields for neutron activation analysis using energy dispersive X-ray spectrometry

USGS Publications Warehouse

Johnson, R.G.; Wandless, G.A.

1984-01-01

A new method is described for determining carrier yield in the radiochemical neutron activation analysis of rare-earth elements in silicate rocks by group separation. The method involves the determination of the rare-earth elements present in the carrier by means of energy-dispersive X-ray fluorescence analysis, eliminating the need to re-irradiate samples in a nuclear reactor after the gamma ray analysis is complete. Results from the analysis of USGS standards AGV-1 and BCR-1 compare favorably with those obtained using the conventional method. ?? 1984 Akade??miai Kiado??.

Program Scheduling Handbook.

DTIC Science & Technology

1980-03-01

account the outcome of any other task. Each activity must be estimated as a stand-alone entity from the network (statistical indep ndence). The... stress the term program as miiore in dUsive than contract in the WBS and Master Schedule. In this chapter we will present one very usable approach to...questions, not raise them. Use different colored cards to represent the SPO, the contractior, procurement, and any other agency that play, a major role in the

Alternative Methods to Standby Gain Scheduling Following Air Data System Failure

DTIC Science & Technology

2009-09-01

in the event of air data system failures. There are two problems with this current method. First, the pilot must take time away from other ...pertinent tasks to manually position the standby-gains via the landing gear handle, air-to-air refueling door switch or some other means. Second, the...the way, the original airspeed estimator was improved and two other alternatives to standby-gain-scheduling were investigated. Knowing what

The development of a structured rating schedule (the BAS) to assess skills in breaking bad news

PubMed Central

Miller, S J; Hope, T; Talbot, D C

1999-01-01

There has been considerable interest in how doctors break bad news, with calls from within the profession and from patients for doctors to improve their communication skills. In order to aid clinical training and assessment of the skills used in breaking bad news there is a need for a reliable, practical and valid, structured rating schedule. Such a rating schedule was compiled from agreed criteria in the literature. Video-taped recordings of simulated consultations breaking bad news were independently assessed by three raters using the schedule and compared to three experts who gave global ratings. The primary outcome measures were internal consistency of the schedule and level of agreement between raters. The internal consistency was high with a Cronbach's alpha of 0.93. Agreement between raters using the schedule was moderate to good. The majority of the variation in scores was due to the differences in skills demonstrated in the interviews. The agreement between raters not using the schedule was poor. The BAS provides a simple to use, reliable, and consistent rating schedule for assessing skills used in breaking bad news. It could be a valuable aid to teaching this difficult task. © 1999 Cancer Research Campaign PMID:10360657

Scheduling Operations for Massive Heterogeneous Clusters

NASA Technical Reports Server (NTRS)

Humphrey, John; Spagnoli, Kyle

2013-01-01

High-performance computing (HPC) programming has become increasingly difficult with the advent of hybrid supercomputers consisting of multicore CPUs and accelerator boards such as the GPU. Manual tuning of software to achieve high performance on this type of machine has been performed by programmers. This is needlessly difficult and prone to being invalidated by new hardware, new software, or changes in the underlying code. A system was developed for task-based representation of programs, which when coupled with a scheduler and runtime system, allows for many benefits, including higher performance and utilization of computational resources, easier programming and porting, and adaptations of code during runtime. The system consists of a method of representing computer algorithms as a series of data-dependent tasks. The series forms a graph, which can be scheduled for execution on many nodes of a supercomputer efficiently by a computer algorithm. The schedule is executed by a dispatch component, which is tailored to understand all of the hardware types that may be available within the system. The scheduler is informed by a cluster mapping tool, which generates a topology of available resources and their strengths and communication costs. Software is decoupled from its hardware, which aids in porting to future architectures. A computer algorithm schedules all operations, which for systems of high complexity (i.e., most NASA codes), cannot be performed optimally by a human. The system aids in reducing repetitive code, such as communication code, and aids in the reduction of redundant code across projects. It adds new features to code automatically, such as recovering from a lost node or the ability to modify the code while running. In this project, the innovators at the time of this reporting intend to develop two distinct technologies that build upon each other and both of which serve as building blocks for more efficient HPC usage. First is the scheduling and dynamic execution framework, and the second is scalable linear algebra libraries that are built directly on the former.

Enhanced Software for Scheduling Space-Shuttle Processing

NASA Technical Reports Server (NTRS)

Barretta, Joseph A.; Johnson, Earl P.; Bierman, Rocky R.; Blanco, Juan; Boaz, Kathleen; Stotz, Lisa A.; Clark, Michael; Lebovitz, George; Lotti, Kenneth J.; Moody, James M.;

Dataflow Design Tool: User's Manual

NASA Technical Reports Server (NTRS)

Jones, Robert L., III

1996-01-01

The Dataflow Design Tool is a software tool for selecting a multiprocessor scheduling solution for a class of computational problems. The problems of interest are those that can be described with a dataflow graph and are intended to be executed repetitively on a set of identical processors. Typical applications include signal processing and control law problems. The software tool implements graph-search algorithms and analysis techniques based on the dataflow paradigm. Dataflow analyses provided by the software are introduced and shown to effectively determine performance bounds, scheduling constraints, and resource requirements. The software tool provides performance optimization through the inclusion of artificial precedence constraints among the schedulable tasks. The user interface and tool capabilities are described. Examples are provided to demonstrate the analysis, scheduling, and optimization functions facilitated by the tool.

A high performance load balance strategy for real-time multicore systems.

PubMed

Cho, Keng-Mao; Tsai, Chun-Wei; Chiu, Yi-Shiuan; Yang, Chu-Sing

2014-01-01

Finding ways to distribute workloads to each processor core and efficiently reduce power consumption is of vital importance, especially for real-time systems. In this paper, a novel scheduling algorithm is proposed for real-time multicore systems to balance the computation loads and save power. The developed algorithm simultaneously considers multiple criteria, a novel factor, and task deadline, and is called power and deadline-aware multicore scheduling (PDAMS). Experiment results show that the proposed algorithm can greatly reduce energy consumption by up to 54.2% and the deadline times missed, as compared to the other scheduling algorithms outlined in this paper.

A High Performance Load Balance Strategy for Real-Time Multicore Systems

PubMed Central

Cho, Keng-Mao; Tsai, Chun-Wei; Chiu, Yi-Shiuan; Yang, Chu-Sing

2014-01-01

Finding ways to distribute workloads to each processor core and efficiently reduce power consumption is of vital importance, especially for real-time systems. In this paper, a novel scheduling algorithm is proposed for real-time multicore systems to balance the computation loads and save power. The developed algorithm simultaneously considers multiple criteria, a novel factor, and task deadline, and is called power and deadline-aware multicore scheduling (PDAMS). Experiment results show that the proposed algorithm can greatly reduce energy consumption by up to 54.2% and the deadline times missed, as compared to the other scheduling algorithms outlined in this paper. PMID:24955382

The JPL Resource Allocation Planning and Scheduling Office (RAPSO) process

NASA Technical Reports Server (NTRS)

Morris, D. G.; Burke, E. S.

2002-01-01

The Jet Propulsion Laboratory's Resource Allocation Planning and Scheduling Office is chartered to divide the limited amount of tracking hours of the Deep Space Network amongst the various missions in as equitable allotment as can be achieved. To best deal with this division of assets and time, an interactive process has evolved that promotes discussion with agreement by consensus between all of the customers that use the Deep Space Network (DSN). Aided by a suite of tools, the task of division of asset time is then performed in three stages of granularity. Using this approach, DSN loads are either forecasted or scheduled throughout a moving 10-year window.

Rail Mounted Gantry Crane Scheduling Optimization in Railway Container Terminal Based on Hybrid Handling Mode

PubMed Central

Zhu, Xiaoning

2014-01-01

Rail mounted gantry crane (RMGC) scheduling is important in reducing makespan of handling operation and improving container handling efficiency. In this paper, we present an RMGC scheduling optimization model, whose objective is to determine an optimization handling sequence in order to minimize RMGC idle load time in handling tasks. An ant colony optimization is proposed to obtain near optimal solutions. Computational experiments on a specific railway container terminal are conducted to illustrate the proposed model and solution algorithm. The results show that the proposed method is effective in reducing the idle load time of RMGC. PMID:25538768

Effects of the NMDA receptor antagonists dizocilpine and Ro 63-1908 on delay-discounting and risky decision-making in a gambling task.

PubMed

Higgins, Guy A; Silenieks, Leo B; MacMillan, Cam; Zeeb, Fiona D; Thevarkunnel, Sandy

2018-04-22

Previous studies demonstrated that NMDA receptor antagonists such as dizocilpine (MK801) and the GluN2B NMDA antagonist Ro 63-1908 promote impulsive action (motor impulsivity). The effects of these treatments on impulsive choice and decision-making is less well characterized. Two experiments were undertaken. In the first experiment, given evidence for delay order as a factor in choice selection, the effect of dizocilpine was examined in a delay discounting task with separate groups of male Long-Evans rats trained to a schedule of either ascending (i.e. 0-40 s), or descending delays (i.e. 40-0 s). Under the ascending-delay schedule, dizocilpine (0.03-0.06 mg/kg SC) reduced discounting, yet on the descending-delay schedule discounting was increased. Subgrouping rats according to discounting rate under vehicle pretreatment were consistent with a treatment-induced choice perseveration. In a second experiment, male Long-Evans rats were trained to a gambling task (rGT). Neither dizocilpine (0.01-0.06 mg/kg SC) nor Ro 63-1908 (0.1-1 mg/kg SC) shifted choice from the advantageous to the disadvantageous options. However dizocilpine, and marginally Ro 63-1908, increased choice of the least risky, but suboptimal option. This effect was most evident in rats that initially preferred the disadvantageous options. Consistent with previous studies, both treatments increased measures of motor impulsivity. These results demonstrate that dizocilpine has effects on discounting dependent on delay order and likely reflective of perseveration. On the rGT task, neither dizocilpine nor Ro 63-1908 promoted risky choice, yet both NMDA receptor antagonists increased impulsive action. Copyright © 2018 Elsevier B.V. All rights reserved.

Cancer Diagnosis Epigenomics Scientific Workflow Scheduling in the Cloud Computing Environment Using an Improved PSO Algorithm

PubMed

N, Sadhasivam; R, Balamurugan; M, Pandi

2018-01-27

Objective: Epigenetic modifications involving DNA methylation and histone statud are responsible for the stable maintenance of cellular phenotypes. Abnormalities may be causally involved in cancer development and therefore could have diagnostic potential. The field of epigenomics refers to all epigenetic modifications implicated in control of gene expression, with a focus on better understanding of human biology in both normal and pathological states. Epigenomics scientific workflow is essentially a data processing pipeline to automate the execution of various genome sequencing operations or tasks. Cloud platform is a popular computing platform for deploying large scale epigenomics scientific workflow. Its dynamic environment provides various resources to scientific users on a pay-per-use billing model. Scheduling epigenomics scientific workflow tasks is a complicated problem in cloud platform. We here focused on application of an improved particle swam optimization (IPSO) algorithm for this purpose. Methods: The IPSO algorithm was applied to find suitable resources and allocate epigenomics tasks so that the total cost was minimized for detection of epigenetic abnormalities of potential application for cancer diagnosis. Result: The results showed that IPSO based task to resource mapping reduced total cost by 6.83 percent as compared to the traditional PSO algorithm. Conclusion: The results for various cancer diagnosis tasks showed that IPSO based task to resource mapping can achieve better costs when compared to PSO based mapping for epigenomics scientific application workflow. Creative Commons Attribution License