28965598
A semantic matchmaker service on the grid
A fundamental task on the Grid is to decide what jobs to run on what computing resources based on job or application requirements. Our previous work on ontology-based matchmaking discusses a resource matchmaking mechanism using Semantic Web technologies. We extend our previous work to provide dynamic access to such matchmaking capability by building a persistent online matchmaking service. Our implementation uses the Globus Toolkit for the Grid service development, and exploits the monitoring and discovery service in the Grid infrastructure to dynamically discover and update resource information. We describe the architecture of our semantic matchmaker service in the poster.
206892321
Building programmable routing service for sensor networks
Current routing services for sensor networks are application-specific. They are pre-configured into nodes, and thus have difficulty in adapting to different applications and network conditions. This paper describes a framework to build programmable routing services for sensor networks. This framework includes a parameter space that identifies both common and different properties among routing services. With this parameter space, different routing services can be obtained with small programming effort. A programmable routing architecture is proposed to maintain this parameter space and support energy-efficient service deployment. This paper presents implementation details of this programmable framework and shows simulation results.
20615876
Linear Time Algorithms for Parallel Machine Scheduling
This paper addresses linear time algorithms for parallel machine scheduling problems. We introduce a kind of threshold algorithms and discuss their main features. Three linear time threshold algorithm classes DT, PT and DTm are studied thoroughly. For all classes, we study their best possible algorithms among each class. We also present their application to several scheduling problems. The new algorithms are better than classical algorithms in time complexity and/or worst-case ratio. Computer-aided proof method is used in the proof of main results, which greatly simplifies the proof and decreases case by case analysis.
9242551
PIML: the Pathogen Information Markup Language
MOTIVATION
A vast amount of information about human, animal and plant pathogens has been acquired, stored and displayed in varied formats through different resources, both electronically and otherwise. However, there is no community standard format for organizing this information or agreement on machine-readable format(s) for data exchange, thereby hampering interoperation efforts across information systems harboring such infectious disease data.


RESULTS
The Pathogen Information Markup Language (PIML) is a free, open, XML-based format for representing pathogen information. XSLT-based visual presentations of valid PIML documents were developed and can be accessed through the PathInfo website or as part of the interoperable web services federation known as ToolBus/PathPort. Currently, detailed PIML documents are available for 21 pathogens deemed of high priority with regard to public health and national biological defense. A dynamic query system allows simple queries as well as comparisons among these pathogens. Continuing efforts are being taken to include other groups' supporting PIML and to develop more PIML documents.


AVAILABILITY
All the PIML-related information is accessible from http://www.vbi.vt.edu/pathport/pathinfo/
45341657
3-D Reconstruction of Macroscopic Optical Brain Slice Images
We present a method for reconstruction of macroscopic optical images of post-mortem brain slices to form a 3-D volume. This forms a key part of a series of procedures to allow post mortem findings to be accurately registered with MR images, and more generally provides a method for 3-D mapping of the distribution of pathological changes throughout the brain. In this preliminary work, four brains from a study of Creutzfeldt-Jakob disease were examined. After brain fixation, the pathologist cut coronal slices several mm thick through the brain. The anterior and posterior faces of each slice were photographed. We show that the 2-D co-registration of each such pair of images was most effectively obtained if the slice was placed in a jig before photographing. Fiducials on the jig were detected automatically and point-based rigid registration computed. For co-registration between slices, i.e., across a single cut, an intensity-based method for 2-D non-rigid registration is used which provided satisfactory results. By propagating the 2-D registrations through the volume and using the known slice thickness, the 3-D volume was reconstructed.
15248292
Preemptive online algorithms for scheduling with machine cost
Abstract.For most scheduling problems the set of machines is fixed initially and remains unchanged. Recently Imreh and Noga proposed adding the concept of machine cost to scheduling problems and considered the so-called List Model problem. For this problem, we are given a sequence of independent jobs with positive sizes, which must be processed non-preemptively on a machine. No machines are initially provided, and when a job is revealed the algorithm has the option to purchase new machines. The objective is to minimize the sum of the makespan and cost of machines. In this paper, a modified model of List Model is presented where preemption is allowed. For this model, it is shown that better performance is possible. We present an online algorithm with a competitive ratio of $(2\sqrt{6} + 2)/5\approx 1.3798$ while the lower bound is 4/3. For the semi-online problem with decreasing sizes, we design an optimal algorithm with a competitive ratio of 4/3, which improves the known upper bound of 3/2. The algorithm does not introduce any preemption, and hence is also an optimal semi-online algorithm for the non-preemptive semi-online problem. For the semi-online problem with known largest size, we present an optimal algorithm with a competitive ratio of 4/3.
40075454
A relationship between pseudomonotone and monotone mappings
It is well known that monotonicity of a mapping implies its pseudomonotonicity. The purpose of this note is to study the situations under which pseudomonotonicity of a mapping implies its monotonicity.