21716413
Advance Reservation Policies for Workflows
Advance reservation of resources has been suggested as a means to provide a certain level of support that meets user expectations with respect to specific job start times in parallel systems. Those expectations may relate to a single job application or an application that consists of a collection of dependent jobs. In the context of Grid computing, applications consisting of dependent tasks become increasingly important, usually known as workflows. This paper focuses on the problem of planning advance reservations for individual tasks of workflow-type of applications when the user specifies a requirement only for the whole workflow application. Two policies to automate advance reservation planning for individual tasks efficiently are presented and evaluated.
7262387
An Experimental Investigation into the Rank Function of the Heterogeneous Earliest Finish Time Scheduling Algorithm
This paper considers the Heterogeneous Earliest Finish Time (HEFT) algorithm for scheduling the tasks of an application, represented by a directed acyclic graph, onto a bounded number of heterogeneous machines. We focus on the appropriate selection of the weight for the nodes and edges of the graph, and experiment with a number of different schemes for computing these weights. Our findings indicate that the length of the schedule produced may be affected significantly by the scheme used, and suggest that the mean value based approach used by HEFT may not be a particularly good choice.
17735073
On problems and conjectures on adjointly equivalent graphs
For a graph G, let h(G,x) denote its adjoint polynomial and @b(G) denote the minimum real root of h(G,x). Two graphs H and G are said to be adjointly equivalent if h(H,x)=h(G,x). Let F"1={G|@b(G)>-4} and F"2={G|@b(G)>=-4}. In this paper, we give a necessary and sufficient condition for two graphs H and G in F"i to be adjointly equivalent, where i=1,2. We also solve some problems and conjectures proposed by Dong et al. (Discrete Math. 258 (2002) 303-321).
15074010
A Modular Reduction Method for k-NN Algorithm with Self-recombination Learning
A difficulty faced by existing reduction techniques for k-NN algorithm is to require loading the whole training data set. Therefore, these approaches often become inefficient when they are used for solving large-scale problems. To overcome this deficiency, we propose a new method for reducing samples for k-NN algorithm. The basic idea behind the proposed method is a self-recombination learning strategy, which is originally designed for combining classifiers to speed up response time by reducing the number of base classifiers to be checked and improve the generalization performance by rearranging the order of training samples. Experimental results on several benchmark problems indicate that the proposed method is valid and efficient.
738592
A General Procedure for Combining Binary Classifiers and Its Performance Analysis
A general procedure for combining binary classifiers for multiclass classification problems with one-against-one decomposition policy is presented in this paper. Two existing schemes, namely the min-max combination and the most-winning combination, may be regarded as its two special cases. We show that the accuracy of the combination procedure will increase and time complexity will decrease as its main parameter increases under a proposed selection algorithm. The experiments verify our main results, and our theoretical analysis gives a valuable criterion for choosing different schemes of combining binary classifiers.
590214
The Chromaticity of Certain Complete Multipartite Graphs
Abstract.In this paper, we first establish a useful inequality on the minimum real roots of the adjoint polynomials of the complete graphs. By using it, we investigate the chromatic uniqueness of certain complete multipartite graphs. An unsolved problem (i.e., Problem 11), posed by Koh and Teo in Graph and Combin. 6(1990) 259–285, is completely solved by giving it a positive answer. Moreover, many existing results on the chromatic uniqueness of complete multipartite graphs are generalized.
5682481
VitaPad: visualization tools for the analysis of pathway data
MOTIVATION
Packages that support the creation of pathway diagrams are limited by their inability to be readily extended to new classes of pathway-related data.


RESULTS
VitaPad is a cross-platform application that enables users to create and modify biological pathway diagrams and incorporate microarray data with them. It improves on existing software in the following areas: (i) It can create diagrams dynamically through graph layout algorithms. (ii) It is open-source and uses an open XML format to store data, allowing for easy extension or integration with other tools. (iii) It features a cutting-edge user interface with intuitive controls, high-resolution graphics and fully customizable appearance.


AVAILABILITY
http://bioinformatics.med.yale.edu


CONTACTS
matthew.holford@yale.edu; hongyu.zhao@yale.edu.