An End-to-end Workflow Pipeline for Large-scale Grid Computing
In this paper we describe a service-based, software architecture that enables end-to-end, high-level workflow processing in a Grid environment consisting of many heterogeneous resources. Our architecture is essentially a pipeline that extends from the abstract application specification phase to the deployment and execution stages through to returning the results to the user. We envision a large-scale Grid environment that contains heterogeneous resources. Our architecture caters for flexible deployment, performance, reliability and charging for resource usage. These are addressed at the specification level as well as at the realisation (brokering) and execution levels. The proposed architecture is derived from previous work in LeSC that has produced the ICENI pipeline, and our experience with e-Science projects, such as GENIE, e-Protein and RealityGrid from which we derive a set of key requirements.

title: An Architecture for a Next-Generation Internet Based on Web Services and Utility Computing
abstract: We present an architecture for a next-generation Internet based on Web services and utility computing. This architecture would be realised as a series of open but interacting markets. We present a scenario whereby these markets could develop, driven by economic forces and market opportunities, exploiting technologies developed in e-Science and grid computing. We argue that, if properly realised such an architecture would provide a safer and more cost-effective way of supporting the Internet than the current infrastructure and would provide many opportunities for radical developments, affecting and unifying many areas of academia, business and society

title: Generating Animatable 3D Virtual Humans from Photographs
abstract: We present an easy, practical and efficient full body cloningmethodology. This system utilizes photos taken from the front, side and back of a person in any given imaging envir onment without requiring a special background or a controlled illuminating condition. A seamless generic bo dy specified in the VRML H-Anim 1.1 format is used to generate an individualized virtual human. The system is c of two major components: face-cloning and body-cloning. The face-cloning component uses feature poi nts on front and side images and then applies DFFD for shape modification. Next a fully automatic seamless text ure mapping is generated for 360 o coloring on a 3D polygonal model. The body-cloning component has two step s: (i) feature points specification, which enables automatic silhouette detection in an arbitrary background(ii) two-stage body modification by using feature points and body silhouette respectively. The final integrated huma n model has photo-realistic animatable face, hands, feet and body. The result can be visualized in any VRML compli ant browser.

title: Distributed scalable location data management system based on the GALIS architecture
abstract: A challenging task in the LBS system engineering is to implement a highly scalable system architecture which can manage moderate-size configurations handling thousands of moving items as well as upper-end configurations handling millions of moving items. The architecture named the GALIS is a cluster-based distributed computing system architecture that consists of multiple data processors, each dedicated to keeping records relevant to a different geographical zone and a different time zone. In this paper, we explain a prototype location data management system structuring major components of GALIS by employing the TMO programming scheme, including the execution engine middleware developed to support real-time distributed object programming and real-time distributed computing system design. We present how to generate realistic location sensing reports and how to process such location reports and location-related queries. Some experimental results showing performance factors regarding distributed query processing are also explained.

title: An effective hardware architecture for bump mapping using angular operation
abstract: In this paper, we propose an effective bump mapping algorithm that utilizes the reference space with the polar coordinate system and also propose a new hardware architecture associated with the proposed bump mapping algorithm. The proposed architecture reduces the computations to transform the vectors from the object space into the reference space by using a new vector rotation method. It also reduces the computations for the illumination calculation by using the law of cosine. Compared with the previous approaches, the proposed architecture reduces multiplication operations up to 78%.

title: Using path information for query processing in object-oriented database systems
abstract: This paper argues that most queries in object-oriented databases require traversing from one object to another in the aggregation hierarchy. Thus, the connections between objects through object identifiers are essential to the efficiency of query processing and should be represented separately from the database. We introduce the concept of path dictionary and describe how it supports queries of different types. We evaluate the storage overhead, query and update costs of the path dictionary. Compared to the path index, the path dictionary has better overall query and update performance and lower storage overhead.

title: q-gram matching using tree models
abstract: q-gram matching is used for approximate substring matching problems in a wide range of application areas, including intrusion detection. In this paper, we present a tree-based model to perform fast linear time q-gram matching. All q-grams present in the text are stored in a tree structure similar to trie. We use a tree redundancy pruning algorithm to reduce the size of the tree without losing any information. We also use suffix links for fast q-gram search during query matching. We compare our work with the Rabin-Karp-based hash-table technique, commonly used for multiple q-gram search. We present results of experiments on system call sequence data used for intrusion detection.