Notification:
We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

Semantics, Knowledge and Grid, 2006. SKG '06. Second International Conference on

Date 1-3 Nov. 2006

Filter Results

Displaying Results 1 - 25 of 112
  • Second International Conference on Semantics, Knowledge, and Grid - Cover

    Publication Year: 2006 , Page(s): c1
    Save to Project icon | Request Permissions | PDF file iconPDF (212 KB)  
    Freely Available from IEEE
  • Second International Conference on Semantics, Knowledge, and Grid [Title page]

    Publication Year: 2006 , Page(s): i
    Save to Project icon | Request Permissions | PDF file iconPDF (27 KB)  
    Freely Available from IEEE
  • Second International Conference on Semantics, Knowledge, and Grid - Copyright notice

    Publication Year: 2006 , Page(s): iv
    Save to Project icon | Request Permissions | PDF file iconPDF (432 KB)  
    Freely Available from IEEE
  • Second International Conference on Semantics, Knowledge, and Grid - TOC

    Publication Year: 2006 , Page(s): v
    Save to Project icon | Request Permissions | PDF file iconPDF (66 KB)  
    Freely Available from IEEE
  • Committees

    Publication Year: 2006 , Page(s): xiii
    Save to Project icon | Request Permissions | PDF file iconPDF (37 KB)  
    Freely Available from IEEE
  • Program Committee

    Publication Year: 2006 , Page(s): xiv
    Save to Project icon | Request Permissions | PDF file iconPDF (29 KB)  
    Freely Available from IEEE
  • Structure and Dynamics of Emergent Semantics Systems

    Publication Year: 2006 , Page(s): 1
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (97 KB)  

    Summary form only given. Until recently, most data interoperability techniques involved central components, e.g., global schemas or ontologies, to overcome semantic heterogeneity for enabling transparent access to heterogeneous data sources. Today, however, with the democratization of tools facilitating knowledge elicitation in machine-processable formats, one cannot rely on global, centralized schemas anymore as knowledge creation and consumption are getting more and more dynamic and decentralized. Peer Data Management Systems (PDMS) implementing semantic overlay networks are a good example of this new breed of systems eliminating the central semantic component and replacing it through decentralized processes of local schema alignment and query processing. As a result semantic interoperability becomes an emergent property of a self-organizing system. In this talk we provide examples of both structural and dynamic aspects of emergent semantics systems based on semantic overlay networks. From the structural perspective we can show that some of the typical properties of selforganizing networks also appear in semantic overlay networks. They form directed, scale-free graphs. We present both analytical models for characterizing those graphs and empirical results providing insight on their quantitative properties. Then we present semantic gossiping, a model for the dynamic reorganisation of semantic overlay networks resulting from information propagation through the network and local realignment of semantic relationships. The techniques we apply in that context are based belief propagation, a distributed probabilistic reasoning technique frequently encountered in selforganizing systems. Finally we will give a quick glance how these techniques can be implemented at the systems level, based on a peer-to-peer systems approach. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Implications of Web 2.0 for the Semantic Grid

    Publication Year: 2006 , Page(s): 2
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (94 KB)  

    Web 2.0 is characterized by blogs, wikis, mashups and hundreds of websites supporting social exchanges including tagged bookmarks, pictures and personal profiles. This supports universal simple approaches to publication, composition of services and a rich metadata system for adorning URL's and people. The Semantic Grid has related goals but is typically implemented with tools and capabilities of much greater sophistication but with less elegant and robust implementations. It appears interesting to base Semantic Grids on Web2.0 technology as this will facilitate adoption and support. We explore this idea. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Completeness of Query Operations on Resource Spaces

    Publication Year: 2006 , Page(s): 3
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (400 KB)  

    A great variety of languages can be designed by different people for different purposes to operate resource spaces. Two fundamental issues are: can we design more operations in addition to existing operations? and, how many operations are sufficient or necessary? This paper solves these problems by investigating the theoretical basis for determining how complete a selection capability is provided in a resource operation sublanguage independent of any host language. The result is very useful to the design and analysis of operating languages. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • CIC: an integrated approach to checkpointing in mobile agent systems

    Publication Year: 2006 , Page(s): 4
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (268 KB)  

    As a widely used fault tolerance technique, checkpointing has evolved into several schemes: independent, coordinated, and communication-induced (CIC). Independent and coordinated checkpointing have been adopted in many works on fault tolerant mobile agent (MA) systems. However, CIC, a flexible, efficient, and scalable checkpointing scheme, has not been applied to MA systems. Based on the analysis of the behavior of mobile agent, we argue that CIC is a well suited checkpointing scheme for MA systems. CIC not only establishes the consistent recovery lines efficiently but also integrates well with the independent checkpointing for reliable MA migration. Here, we propose an important improvement to CIC, referred to as the deferred message processing based CIC algorithm (DM-CIC), which achieves higher efficiency by exempting the CIC algorithm from making the forced checkpoints in MA systems. Through simulation, we find out that DM-CIC is stable and better suited to large scale MA systems. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Infrastructure for language service composition

    Publication Year: 2006 , Page(s): 5
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (312 KB)  

    Although English has become the standard language in various areas, most people do not use it in local activities. To increase the mutual understanding of different cultures with different languages, it is essential to build a language infrastructure on top of the Internet that improves the accessibility and usability of existing online language services so that users can create new cross-language services for their communities. To realize this infrastructure, this paper proposes the language grid. The language grid consists of the ”horizontal language grid,” which connects the standard languages of nations, and ”vertical language grid,” which combines the language services generated by communities. This approach can facilitate intercultural collaboration through the Internet, such as international online collaborative learning. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dish_Master: an Intelligent and Adaptive Manager for a Web-based Recipe Database System

    Publication Year: 2006 , Page(s): 6
    Cited by:  Patents (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (653 KB)  

    In this paper, we describe Dish_Master as an intelligent, adaptive, and cooperative manager for a Web-based recipe database. Dish_Master employs a multi-dimensional knowledge model, adopts a new way of categorizing recipes, and provides a coaching mechanism able to advise the consequences of adopting and adapting an existing recipe from the database. A practical approach using constraints and rules is devised to facilitate the derivation and evaluation of user-specific recipes based on group/global level recipes. The usefulness and elegancy of Dish_Master are demonstrated through an experimental prototype system. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Simulate Grid Resource Trading via Cognitive Agent: A Case Study

    Publication Year: 2006 , Page(s): 7
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (117 KB)  

    In this paper, we explore the market-based grid resource trading system from the social perspective and the collaborative computing perspective. We firstly introduce a novel framework to simulate the trading system of the grid computing resources, then we give a case study based on this framework. In the case study, an evolutionary dynamics of the resource reservation game is played by agents on the network. We study the evolution of the system with cognitive agents: Study the evolution dynamics of system with agents can automatic adapt to their environment, they can exchange private information and learn experiences from each other. Finally, after analyzing the experiment results, some critical issues about designing the market-based trading system are discussed. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using Ontologies to Support Customisation and Maintain Interoperability in Distributed Information Systems with Application to the Domain Name System

    Publication Year: 2006 , Page(s): 8
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (148 KB)  

    Global distributed systems must be standards-based to allow interoperability between all of their components. While this guarantees interoperability, it often causes local inflexibility and an inability to adapt to specialised local requirements. We show how local flexibility and global consistency can coexist by changing the way that we represent these systems. The proven technologies already in use in the Semantic Web, to support and interpret metadata annotation, provide a well-tested starting point. We can use OWL ontologies and RDF to describe distributed systems using a knowledge-based approach. This allows us to maintain separate local and global operational spaces which, in turn, gives us local flexibility and global consistency. The annotated and well-defined data is better structured, more easily maintained and less prone to errors since its purpose can be clearly determined prior to use. To illustrate the application of our approach in distributed systems, we present our implementation of an ontologically-based Domain Name System (DNS) server and client. We also present performance figures to demonstrate that the use of this approach does not add significant overhead to system performance. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Knowledge discovery and integration based on a novel neural network ensemble model

    Publication Year: 2006 , Page(s): 9
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (161 KB)  

    This article explores the utility of neural network ensembles in knowledge discovery and integration. A novel neural network ensemble model KBNNE (Knowledge-Based Neural Network Ensembles) integrating KDD (Knowledge Discovery in Database) techniques and neural network modeling algorithms by ¿parallel operations¿ is proposed. Through balancing the relative importance of knowledge learned by induction and deduction, KBNNE can avoid the knowledge loss and enhance the "transparency" of neural network models. The effectiveness of the proposed model is demonstrated through computer simulations on simple artificial problems and an actual modeling problem. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Dynamic Setting, Verification and Adjustment of Upper Bound Constraints in Grid Workflow Systems

    Publication Year: 2006 , Page(s): 10
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (327 KB)  

    Upper bound constraints are often set when complex scientific or business processes are modelled as grid workflow specifications. However, many existing processes such as climate modelling or international stock market analysis often have only one end-to-end upper bound constraint. This is not sufficient to control overall temporal correctness as we may not find temporal violations until the last activity. Then, it is too late to take any handling actions. Consequently, the execution results may not be useful and overall cost-effectiveness would be impacted. Therefore, in this paper, we systematically investigate how to set, verify and adjust sub-upper bound constraints within the timeframe of one end-to-end upper bound constraint so that we can control grid workflow execution locally. We develop corresponding setting, verification and adjustment methods and algorithms. The quantitative evaluation demonstrates that with sub-upper bound constraints, we can achieve better cost-effectiveness than only based on one end-to-end upper bound constraint. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Ontology Based Local Index in P2P Networks

    Publication Year: 2006 , Page(s): 11
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (146 KB)  

    Peer-to-peer networks (P2P) are beginning to form the infrastructure offuture applications. One of the problems with unstructured P2P networks is their scalability limitation. This is also the problem in structured P2P networks that use broadcasting to find objects. These networks can't contain a large number of nodes because of the large amount of traffic that they have to handle. Local indexing is a method to reduce this traffic. But local indexes tend to become large with the growth of the network. Also limiting the size of these indexes causes loss of indexing information. In this paper we introduce a novel ontology based local index which limits the size of the local indexes without losing indexing information. We show that the method can be employed by many P2P networks. We also, as an example, apply this local index on HyperCup overlay network, and show that it reduces the network traffic significantly. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mobile Grid Routing Algorithm in Mobile Ad Hoc Networks with Obstacles

    Publication Year: 2006 , Page(s): 12
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (232 KB)  

    Mobile grid provides mobile devices with a high reliability, performance and cost-efficiency. Physical limitations of the mobile devices make necessary the adaptation of the services that mobile grid can provide to the mobile devices. In the paper, we proposed a mobile grid routing algorithm in the presence of obstacles called obstacle mobile grid routing algorithm (OMGR). OMGR consists of mobility model, connected dominating set (CDS) election and mobile gird routing algorithm. In obstacle mobility model, we introduce STANDBY nodes as relaying nodes between two nodes that are invisible. The distributed CDS election algorithm extends Wu and Li's algorithm and utilizes STANDBY nodes to connect the existing dominating-nodes belonging to dominating set. In addition, OMGR based on a CDS uses hybrid routing scheme (flooding-based approach and position-based approach) to forward around any obstacles. Eventually, an example is given to show that the proposed approach can form a CDS and successfully construct routes. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Efficient Token-based Approach for Web-Snippet Clustering

    Publication Year: 2006 , Page(s): 13
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (258 KB)  

    Online clustering of the results returned by search engines becomes prevailing in recent times. It addresses the problem of too many records returned by current search engines, which renders the manual search of actually desired information difficult, especially if the query encompasses several subtopics. Clustering is a useful technique to group records to clusters and thereby make it more convenient to retrieve information of interest. We first propose an innovative approach by using tokens as basic units for clustering, which avoids segmentation for oriental languages and can be applied to any language. Second, we introduce a Directed Probability Graph (DPG) model that identifies meaningful phrases as cluster labels using statistical methods without any external knowledge. The clustering procedure is performed without calculating the similarity between pair-wise documents. As shown by our experiments, our clustering algorithm is very efficient and suitable for online Web-snippet clustering. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • SAHA: A Self-Adaptive Hierarchical Allocation Strategy for Heterogeneous Grid Environments

    Publication Year: 2006 , Page(s): 14
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (256 KB)  

    The allocation of data and I/O operations into nodes in a data Grid environment is a critical issue. Especially, the Grid nodes may have either different performance or different capacity in heterogeneous circumstance. If the system undergoes changes (for example, due to the insertions or removals of disks from Grid nodes), it may be necessary to redistribute the data object with a low time and space complexity. Previous techniques mainly focus on handling these requirements only in part. For instance, some standard hashing and heuristic schedules can be used to decrease the data replacement time, but they usually do not adapt well to a change in the capabilities (both the capacity and performance of Grid nodes). In this paper, we presented a novel self-adaptive hierarchical allocation (called SAHA) based on nodes capacity to satisfy the load balancing. Furthermore, we illustrated the performance evaluation of our placement strategies while we allowed the various test conditions to be changed. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Integrated Time Management Model for Distributed Workflow Management Systems

    Publication Year: 2006 , Page(s): 15
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (247 KB)  

    This paper proposes an integrated time management model, DWfS-TMM, which consists of a set of general time ontology and a set of general rules for unified transformation between different time zones and different time granularity units. The description of build-time and run-time temporal constraints in workflow processes and the temporal consistency checking method in this model are investigated too. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Research on tau-Parameter Fuzzy Concept Lattice for Grid Resource

    Publication Year: 2006 , Page(s): 16
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (780 KB)  

    It is a pivotal task how to organize and manage resources for Grid researches and applications.This paper first proposes Grid resource management strategies by employing τ-parameter fuzzy concept lattice and fuzzy concept trie and combines FCA theory with Grid resource management technology. The formal concept definitions of Grid and resource are given and τ-parameter fuzzy concept lattice model of the Grid resources is proposed.The extent trie and intent trie of fuzzy concepts for the Grid resources are constructed and the algorithms are developed for trie creation and retrieval to resources and services by FCA method.Experiments and application examples show that our method of resource organization and management is feasible and effective. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Semantic Pattern for User-Interactive Question Answering

    Publication Year: 2006 , Page(s): 17
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (445 KB)  

    A new semantic pattern is proposed in this paper, which can be used by users to post questions and answers in user-interactive question answering (QA) system. The necessary procedures of using semantic pattern in a QA system are also presented, which include question structure analysis, pattern matching, pattern generation, pattern classification and answer extraction. A user interface of using semantic pattern is also implemented in our QA system, which allows users to effectively post and answer questions. It gains good overall user satisfaction. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Top Ten Questions To Design A Successful Grid Portal

    Publication Year: 2006 , Page(s): 18
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (102 KB)  

    With the enhancement of Grid application, Grid portal provides a unique interface for end-users to access distributed resources and are used widely in Knowledge Grid, e-Science, e-learning and e-business. A successful Grid portal relies on many factors. This paper focuses primarily on the design aspects of a successful Grid portal implementation. Ten questions of designing Grid portal are discussed in no particular order. The questions detail the key considering areas of Grid portal architecture, Grid portal contents, portal security, reusability, software design, management and programming test. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Towards Integration Services for Heterogeneous Resources: An Integrated Search Engine forWeb Content and TV Programs

    Publication Year: 2006 , Page(s): 19
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (534 KB)  

    A search engine that can handle TV programs and Web content in an integrated way is proposed. Conventional search engines can target Web content and/or data stored in desktop PCs. However, in the future, the information to be searched is expected to be stored in various places such as in hard-disk recorders, digital cameras, mobile devices, and even in real space, and a search engine that can search across such heterogeneous resources will become essential. As a first step towards developing such a next-generation search engine, a prototype search system is proposed that can handle Web content as an information source with hyperlinks and TV programs as another without them, that performs integrated searches of those content, and that can subsequently search for content related to each search result. An integrated search is achieved by generating integrated indices based on keywords obtained from TV programs and Web content and by ranking them, and a chain search for related content is done by calculating the similarities of and ranking the content in the integrated indices. A zoom-based display of the results enables information to be acquired efficiently. Testing a prototype of the system validated the approach of the proposed method. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.