The process of design search and optimisation using Computational Fluid Dynamics (CFD) is computationally and data intensive, a problem well-suited to Grid computing. The Geodise toolkit is a suite of Grid-enabled design optimisation and search tools within the Matlab environment. The use of these tools by the engineer is facilitated by intelligent design advisers targeted initially at CFD. The...

This paper describes the VIRGIL (Virtual Meeting Archival) system which was developed to provide a simple, practical, easyto-use method for recording, indexing and archiving large scale distributed videoconferences held over Access Grid nodes. Institutional libraries are coming under increasing pressure to support the storage, access and retrieval of such mixed-media complex digital objects in ...

This paper discusses a Java-based grid computing middleware, ALiCE, to facilitate the development and deployment of generic grid applications on heterogeneous shared computing resources. The ALiCE layered grid architecture comprises of a core layer that provides the basic services for control and communication within a grid. Programming template in the extensions layer provides a distributed sh...

Many machine learning algorithms have hyperparameters flags, values, and other configuration information that guides the algorithm. Sometimes this configuration applies to the space of functions that the learning algorithm searches (e.g. the number of nearest neighbours to use in KNN). Sometimes this configuration applies to the way in which the search is conducted (e.g. the step size in stocha...

Grid and block-based motion vector estimation techniques are proposed for motion tracking in video sequences. The grid technique is referred to the hexagon-diamond pattern. While, block-based technique is referred to 16 × 16 pixels of blocks in a single frame in video sequences. The hexagon and diamond pattern is applied onto the 16 × 16 pixels blocks in a single frame for motion tracking purpo...

where An,i(X) ≡ we are confident in both estimates fn,h(X ± tei). •Fast preprocessing, and online: just 2 estimates of fn,h at X . Metric learning optimizes over a space of possible metrics. •Only 2× 2× 1 param. search grid to adapt to d dimensions. KR with bandwidths {hi}d1 needs d× d param. search grid. •General: preprocessing for any distance-based regressor. Other methods apply to particula...

This paper presents a grid-based interaction model that is designed to encourage searchers to organize a complex search space by managing n × m sub spaces. A search interface was developed based on the proposed interaction model, and its performance was evaluated by a user study carried out in the context of the NTCIR-9 VisEx Task. With the proposed interface, there were cases where subjects di...

Service discovery is a key concept in a distributed Grid environment. The first step towards Grid implement is the discovery of services. In this paper, we build a new Grid service matching graph based on the semantic similarity of function parameters and then an efficient search algorithm is presented to accomplish Grid service discovery. The experiment results show the algorithm proposed in t...