Grid computing which is based on the high performance computing environment, basically used for solving complex computational demands. In the grid computing environment, scheduling of tasks is a big challenge. The task scheduling problem can be defined as a problem of assigning the number of resources to tasks where number of resources is less than the number of available tasks. Particle swarm ...

This report summarizes two focused efforts with a common theme of coupling commercial database technology with the world-wide web to facilitate the presentation and management of large information spaces. The two project titles are “Web-Linked Databases for Domain-Specific Information Repositories” and “Interfacing Databases and the Web: Management of Large WWW Sites Using Commercial Database T...

There is a large body of research on motion control of legs in human models. However, they require specification of global paths in which to move. A method for automatically computing a global motion path for a human in 3D environment of obstacles is presented. Object space is discretized into a 3D grid of uniform cells and an optimal path is generated between two points as a discrete cell path...

Solving the structure prediction problem for complex proteins is difficult and computationally expensive. In this paper, we propose a bicriterion parallel hybrid genetic algorithm (GA) in order to efficiently deal with the problem using the computational grid. The use of a near-optimal metaheuristic, such as a GA, allows a significant reduction in the number of explored potential structures. Ho...

In this paper, I analyze the constant factors for implementations of line segment intersection algorithms. I explore how these algorithms could be applied to stochastic local search algorithms to determine the rectilinear crossing number of complete graphs.

The traditional focus of combinatorial search research is to speed up the search algorithm. An alternative, however, is to create a sparser representation of the search space. This relates to the idea of spanners from graph theory. These are subgraphs which retain paths between any two vertices of the original graph while guaranteeing a maximum stretch in path length. In practice, the path degr...

Interpolation of field data from unstructured meshes requires the potentially expensive identification of the finite element or volume within which the interpolating point lies. A number of geometric search algorithms have been proposed to reduce this expense at the cost of setting up and storing additional search tables. Using tetrahedral finite element models we show that a structured auxilia...

The dynamics of knowledge is important for virtual organizations (VOs) knowledge management (KM) to improve the fast response capabilities and flexible problem solving capabilities of VOs in complex environments. This paper proposes a method of modeling knowledge dynamics in VOs, which is composed of three models: knowledge flow model, knowledge conversion model and knowledge sharing space mode...

In this paper we operationally define and measure tacit knowledge at the team level in the software development domain. Through a series of three empirical studies we developed and validated the Team Tacit Knowledge Measure (TTKM) for software developers. In the first study, initial scale items were developed using the repertory grid technique and content analysis. In Study 2, supplied repertor...