The integrated Network Enhanced Telemetry effort (iNET) was launched to create a telemetry network that will enhance the traditional point-to-point telemetry link from test articles (TAs) to ground stations (GS). Two of the critical needs identified by the Central Test and Evaluation Investment Program (CTEIP) are, “the need to be able to provide reliable coverage in potentially high capacity e...

EXECUTIVE SUMMARY This article presents the E-COLLEG Tool Registration and Management Services (TRMS) with open XML-based data exchange, tool integration and remote invocation capabilities. TRMS is a workflow management middleware tailored to distance spanning engineering collaboration and security enabled data exchange. The infrastructure is validated through two industrial Intranet-crossing c...

This paper presents the major findings from evaluation the most widely used open source learning management systems and identify the most suitable open source e-learning platform. In this study, some analyses and comparisons were made about open source learning management systems the outcome of which was that Moodle was found to be outstanding with many features more than other LMS since it aim...

Examines an increasingly important feature of further and higher education provision: the development of distance-learning opportunities for managers and teachers interested in education management qualifications in the context of a newly marketized education service in England and Wales. Draws on a university survey of prospective distance-learning “clients” who had expressed an interest in po...

Production management is the best and foremost factor in exploiting the production factors more desirably and advantageously. Accordingly, the present study sought to evaluate the factors   affecting the gardening management skills among citrus farmers in Sari, north of Iran. The statistical population for the study was 12,800 people. The stratified random sampling using the Cochran test was ap...

a set $s$ of vertices in a graph $g=(v,e)$ is called a total$k$-distance dominating set if every vertex in $v$ is withindistance $k$ of a vertex in $s$. a graph $g$ is total $k$-distancedomination-critical if $gamma_{t}^{k} (g - x) < gamma_{t}^{k}(g)$ for any vertex $xin v(g)$. in this paper,we investigate some results on total $k$-distance domination-critical of graphs.