Scheduled System Maintenance:
On Monday, April 27th, IEEE Xplore will undergo scheduled maintenance from 1:00 PM - 3:00 PM ET (17:00 - 19:00 UTC). No interruption in service is anticipated.
By Topic

Database and Expert Systems Applications, 2006. DEXA '06. 17th International Workshop on

Date 4-8 Sept. 2006

Filter Results

Displaying Results 1 - 25 of 152
  • 17th International Conference on Database and Expert Systems Applications - Cover

    Publication Year: 2006 , Page(s): c1
    Save to Project icon | Request Permissions | PDF file iconPDF (86 KB)  
    Freely Available from IEEE
  • 17th International Conference on Database and Expert Systems Applications - Title

    Publication Year: 2006 , Page(s): i - iii
    Save to Project icon | Request Permissions | PDF file iconPDF (108 KB)  
    Freely Available from IEEE
  • 17th International Conference on Database and Expert Systems Applications - Copyright

    Publication Year: 2006 , Page(s): iv
    Save to Project icon | Request Permissions | PDF file iconPDF (127 KB)  
    Freely Available from IEEE
  • 17th International Conference on Database and Expert Systems Applications - TOC

    Publication Year: 2006 , Page(s): v - xvi
    Save to Project icon | Request Permissions | PDF file iconPDF (273 KB)  
    Freely Available from IEEE
  • Message from the Programs Chairs

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

    Publication Year: 2006 , Page(s): xviii - xxi
    Save to Project icon | Request Permissions | PDF file iconPDF (151 KB)  
    Freely Available from IEEE
  • Message from NBiS ’06 Workshop and Program Chairs

    Publication Year: 2006 , Page(s): 3 - 4
    Save to Project icon | Request Permissions | PDF file iconPDF (73 KB) |  | HTML iconHTML  
    Freely Available from IEEE
  • Security on MASs with XML Security Specifications

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

    In the past, multi-agent systems were used in proprietary environments. Nowadays, these systems have been used broadly in open distributed networks, such as e-commerce applications for Internet. An environment such as the Internet cannot be considered a safe place. Thus, multi-agent systems should have security mechanisms, e.g. confidentiality and integrity. The XML security specifications are standards that are based on XML and provide security mechanisms. They include: XML digital signature for digital signature; XML encryption for cryptography; XML key management specification for public key infrastructure. Agents may use a FIPA (foundation for intelligent physical agents) standard called RDF(resource description framework), which is a message content standard in XML language. Using this standard, agents can communicate exchanging XML messages, but these messages are not secure. In this article, we propose a secure communication model for agents based on RDF and the XML security specifications View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Fault-Tolerant Destributed Systems in a Mobile Agent Model

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

    A transactional agent is a mobile agent to manipulate objects with some type of commitment condition. We assume computers may stop by fault while networks are reliable. In the client-server model, servers are fault-tolerant according to the replication and checkpointing technologies. However, an application program cannot be performed if a client is faulty. A program can be performed on another operational computer even if a computer is faulty in the transactional agent model. There are kinds of faulty computers; current, destination, and sibling computers where a transactional agent now exist, will move, and has visited, respectively. We discuss how the transactional agent is tolerant of the types of computer faults View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Model for User Profiling in an ASP Environment

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

    Nowadays an ever increasing number of companies rely on application service providers for hosting some or almost all software applications. In this domain, an effective way for customizing user interfaces would be highly desirable. We propose a profiling system interacting with the applications in order to capture users' behavior. The system is based on Bayesian networks and we show a strategy for combining data collected in each session and previous knowledge. Experiments on a prototype show that the proposed approach is promising View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance Analysis of the varphi Failure Detector with its Tunable Parameters

    Publication Year: 2006 , Page(s): 20 - 24
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (177 KB) |  | HTML iconHTML  

    In this paper, we explain an implementation of an accrual failure detector, that we call the phi failure detector. The particularity of the phi failure detector is that it dynamically adjusts to current network conditions the scale on which the suspicion level is expressed. We have done the experiment in a LAN in a whole day and evaluated the behavior of our phi failure detector. Then we discuss on the parameters of the failure detector based on our experimental result View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Dynamic Fault-Tolerant Model for Open Distributed Computing

    Publication Year: 2006 , Page(s): 25 - 29
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (177 KB) |  | HTML iconHTML  

    Open distributed computer systems are some of the most successful structures ever designed for the computer community together with their undisputed benefits for users. However, their complexity has also introduced a few side-effects, most notably the unpredictable nature of the underlying environments and reconfiguration burdens imposed by environmental changes. Thus, to gain high level of system performance, a required level of reliability has to be maintained. In this paper, we propose a mechanism to analyze the underlying environmental faults and failures. This model provides an adaptable fault-tolerant approach in order to address unanticipated events and unpredictable hazards in distributed systems. Therefore, this model maintains the required reliability by analyzing the environment and selects the optimal replication strategy for existing conditions. This pragmatic and theoretically appealing approach is a part of the Juice system which supports adaptation properties for open distributed environments View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Architecture Evaluation for Distributed Auto-ID Systems

    Publication Year: 2006 , Page(s): 30 - 34
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (162 KB) |  | HTML iconHTML  

    Auto-ID technologies allow capturing the time and location of products in the supply chain for tracking and tracing. This paves the way for a variety of business applications, such as anti-counterfeiting, pedigree, and genealogy, which analyze the trace history of products to detect patterns or anomalies in the supply chain. While these applications have gained considerable interest recently, further work is needed towards integration of event data from heterogeneous auto-ID nodes in order to obtain the complete trace history for products of interest. As a first step, we perform an architectural study on interoperable auto-ID systems and present the results in this paper. We first review established techniques for data integration and data sharing as well as relevant industrial efforts. We then clarify the requirements that need to be addressed by an auto-ID network. Finally, we discuss four possible architecture alternatives for implementing interoperability in such a network and comparatively evaluate the approaches according to the identified requirements View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed Disaster Information System over Japan Gigabit Network

    Publication Year: 2006 , Page(s): 35 - 39
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (185 KB)  

    In this paper, a robust and large scale resident-oriented safety information system on the occurrence of the various disasters constructed over a nationwide high-speed network is introduced. The resident evacuated can registered his/her safety information in the local safety information servers in the evacuation area whether he/she can safely evaluated or not using mobile PCs or terminals at the evacuation area or mobile terminals on the way of evacuation. All of the local information servers are connected each other by wireless network and the safety information can be sent an upper-layer database in the district area and finally integrated into a district safety information in that region. In our system some of the damaged local servers due to the disaster can be detected and recovered manually by the upper-layer database server. On the other hand, the upper-layer database servers are backed up by mirror servers located to mutually different locations with long distance to isolate the influence to the same disaster when the some of them were destroyed or disordered. Thus, by introducing two levels of redundancy and backup functions, more large scale and robust safety information database system can be realized View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient Target Selection in Similarity Preserve Hash for Distributed Geographical Origin Identification System of Vegetables

    Publication Year: 2006 , Page(s): 40 - 44
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (152 KB) |  | HTML iconHTML  

    Recent years, especially in Japan, camouflaging geographical origin of agricultural products is a big problem. Therefore, we introduced a distributed system to identify their geographical origin using their differences of trace elements, or very small quantities of elements. Vegetables grown in farms absorb metals form the soil. Since compositions of trace metal elements differ from geographical places, this can be utilized to identify geographical origin of vegetables. In proposing system, trace element compositions of vegetables are measured when they are shipped from a farm, and the data is stored in databases which are located in farming districts. When a doubtful vegetable is found in food distribution channel, its trace element compositions are measured and compared by calculating correlation coefficients to ones accumulated in databases. This system can be used to verify geographical origin data by food traceability system. Because correlation coefficients are not known when they are once calculated, so correlation coefficients between all accumulated data in databases and doubtful vegetable. This means that proposing system is not scalable when the number of accumulated data is increased. Therefore, we introduced a method to reduce the number of target to calculate correlation coefficients using similarity preserve hash (SPH) which gives similar output for similar input. This could reduce time to calculation itself, however, computation time including picking out target data for calculation of correlation coefficients from database. Therefore, we introduce a method to accelerate picking up data form database by grouping value of SPH View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Quality Enhancement Model Considering Service Providers and Consumers Relation

    Publication Year: 2006 , Page(s): 45 - 49
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (164 KB) |  | HTML iconHTML  

    In this paper, we provide an evaluation model for marketable quality and profitability of corporations. We apply the real values of some leading manufacturing corporations in Japan to our proposed model to analyze its accuracy. From the analysis, we concluded that the theoretical and real standard values of the marketable quality indicator were both 0.6 (that is 60%). From our further analysis, we extracted the turning point from economies of scale to enhancement of marketable quality. The turning point is almost the same with the theoretical standard values of marketable quality and the rate of operation View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Impact of Radio Irregularities on Topology Tradeoffs of WSNs

    Publication Year: 2006 , Page(s): 50 - 54
    Cited by:  Papers (5)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (274 KB) |  | HTML iconHTML  

    The radio model usually used in most of studies on wireless sensor networks is spherical. This means that the received power at a certain distance is the same in all directions. Every radio engineer knows that this is not the case encountered in real hardware. Here, we show that the analysis of such a network by simulation is not trivial when one uses more realistic radio models. We emphasis this problem by comparing the impact of realistic simulations on the study of the infrastructure trade-offs of sensors networks. As expected, simulations confirm that more advanced simulation techniques are required in order to take into account wireless channel models and to bound the simulation time as well View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Regularity Analysis Using Time Slot Counting in the Mobile Clickstream

    Publication Year: 2006 , Page(s): 55 - 59
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (108 KB) |  | HTML iconHTML  

    The ever-changing nature of the mobile Internet contributes to the difficulties encountered in user behavior research. Regularity is an important aspect of the mobile Internet in research and marketing, because it end users easily lose their interest and leave the mobile Web sites due to the limited visibility of the Web. Maintaining user loyalty is a vital challenge for mobile Webs. Therefore, the methods to identify loyalty transitions are important. The author proposes a regularity measure using click counting in the time slots. With the assumption that the users with regular access have more chances to continue to use the mobile Webs, the author examines the monthly prediction of user behavior based on the user access regularity in the previous month. The author obtains approximate 80% accuracy of prediction in the case study. The author discusses the limitation and implications of the comparison View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Interaction Styles for Service Discovery in Mobile Business Applications

    Publication Year: 2006 , Page(s): 60 - 65
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (190 KB) |  | HTML iconHTML  

    As the power of mobile devices continues to grow, and the range of resources accessible via wireless networks expands, there is an increasing need to offer services to users in a customized way, based on their immediate desires and context. At the same time, to construct such applications in a cost-effective and reusable way, there is also a growing pressure on mobile application developers to structure their systems in terms of a service-oriented architecture. However, these two goals are not always compatible. In this paper we present a new set of architectural components and principles which allow context-sensitive, mobile business applications to be assembled in highly flexible and reuse-oriented way based on the principles of SOA. We present the four main configuration patterns and interaction styles which this architecture supports and evaluate their pros and cons from the perspective of different infrastructure and usability issues such as bandwidth usage, latency needs, pricing and, privacy. Finally, we discuss which configuration to use in which circumstances View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Efficient ZHLS Routing Protocol for Mobile Ad Hoc Networks

    Publication Year: 2006 , Page(s): 66 - 70
    Cited by:  Papers (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (128 KB) |  | HTML iconHTML  

    In this paper, in order to reduce communication overhead in mobile ad hoc networks, we present a zone-based hierarchical link state routing protocol with gateway flooding (ZHLS-GF) in which a new flooding scheme, called gateway flooding is proposed. ZHLS-GF is based on ZHLS, a zone-based hierarchical link state routing protocol. ZHLS is a hierarchical routing protocol for mobile ad hoc networks in which a network is divided into non-overlapping zones. All network nodes in ZHLS construct two routing tables, an intrazone routing table and an inter-zone routing table, by flooding NodeLSPs within the zone and ZoneLSPs throughout the network. However, this incurs a large communication overhead in the network. Our proposed flooding scheme floods ZoneLSPs only to the gateway nodes of zones thus reduces the communication overhead significantly. Furthermore in ZHLS-GF, only the gateway nodes store ZoneLSPs and construct interzone routing tables therefore the total storage capacity required in the network is less than ZHLS View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimising Performance in Network-Based Information Systems: Virtual Organisations and Customised Views

    Publication Year: 2006 , Page(s): 71 - 76
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (98 KB) |  | HTML iconHTML  

    Network-based information systems use well-defined standards to ensure interoperability and also have a tightly coupled relationship between their internal data representation and the external network representation. Virtual organisations (VOs), where members share a problem-solving purpose rather than a location-based or formal organisation, constitute an environment where user requirements may not be met by these standards. A virtual organisation has no formal body to manage change requests for these standards so the user requirements cannot be met. We show how the decoupling of the internal and external representations, through the use of ontologies, can enhance the operation of these systems by enabling flexibility and extensibility. We illustrate this by demonstrating a system that implements and enhances the domain name system, a global network-based information system. Migrating an existing system to a decoupled, knowledge-driven system is neither simple nor effortless but can provide significant benefits View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automatic Generation of an Instruction Set Simulator for Educational Use

    Publication Year: 2006 , Page(s): 77 - 82
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (122 KB) |  | HTML iconHTML  

    To develop an embedded system, in which processors are used, a skilled assembler is necessary. An ISA (instruction set architecture) simulator is essential for training assembly programming, and the preparation of a SWDE (software development environment) such as simulator, assembler, disassembler, and compiler for a new processor can put a great strain on processor developers. We have been developing C-DASH (C-like design automation shell), a hardware/software codesign tool for processors that can generate an instruction set level simulator based on a character user interface. In this paper, we construct a graphical user interface for a simulator and describe the utilization of the simulator for education View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tokens for Anonymous Communications in the Internet

    Publication Year: 2006 , Page(s): 83 - 90
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (101 KB) |  | HTML iconHTML  

    With the growth and acceptance of the Internet, there has been increased interest in maintaining anonymity in the network. Using traffic analysis, it is possible to infer who is talking to whom over a public network. This work develops a novel approach to hide the senders and the receivers of messages. Routes are chosen and frames traverse these routes. Each frame consists of a token and a node can send a message through a frame only when the corresponding token is free. The best thing about our protocol is that it poses no bandwidth overhead when there is at least some traffic while posing minimal bandwidth overhead when there is no traffic at all View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Message from the Self-Adaptive Autonomic Computing Systems ’06 Workshop Chairs

    Publication Year: 2006 , Page(s): 91 - 92
    Save to Project icon | Request Permissions | PDF file iconPDF (73 KB) |  | HTML iconHTML  
    Freely Available from IEEE
  • Retrofitting Zeroconf to Type-Safe Self-Organising Systems

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

    The notion of a self-organising system as used within this paper, is of a system that optimises and adapts its architectural composition based on evidence accrued from both internal and external influences. In this way, a self-organising system is defined to be a fluid, unbounded set of components that are organised and configured on demand and at runtime in reaction to the current configuration of the system's operating environment. This paper outlines current theory and assumption in component-based self-organisation, discussing the limitations that exist when producing such systems. The paper highlights, through example, how the introduction of type-safety at a network layer aided by Zeroconf (zero configuration networking) and the author's own Neptune language can yield a powerful self-organisational model, concluding with its use within a healthcare agenda system View full abstract»

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