Now showing 1 - 4 of 4
  • Publication
    Contextual partitioning for comprehension of OODB schemas
    ( 2004)
    Gu, H.
    ;
    Perl, Y.
    ;
    Halper, M.
    ;
    Geller, J.
    ;
    Neuhold, E.J.
    Object-oriented databases (OODBs) have been utilized for complex modeling tasks within a variety of application domains. The OODB schema, typically expressed in a graphical notation, can serve as a useful presentation tool for the information contained in the underlying OODB. However, such a schema can be a large, complex network of classes and relationships. This may greatly hinder its effectiveness in helping users gain an understanding of the OODB's contents and data organization. To facilitate this orientation process, a theoretical framework is presented that guides the refinement of an existing schema's subclass-of relationship hierarchy - the backbone of any OODB. The framework sets forth three rules which, when satisfied, lead to the establishment of a collection of contexts, each of which exhibits an internal subclass-of tree structure. A formal proof of this result is presented. An algorithmic methodology, involving a human-computer interaction, describes how the approach can be applied to a given OODB schema. An application of the methodology to an example OODB schema is included.
  • Publication
    Architektur Multimedialer Informationssysteme
    ( 2002)
    Berthold, H.
    ;
    Binkowski, F.
    ;
    Henrich, A.
    ;
    Hollfelder, S.
    ;
    Lindner, W.
    ;
    Marder, U.
    ;
    Meyer-Wegner, K.
    ;
    Robbert, G.
  • Publication
    Arbitration Protocols for Competing Software Agents
    ( 2001)
    Tesch, T.
    ;
    Fankhauser, P.
    ;
    Ouksel, A.M.
    The exchange of goods and services between bargaining software agents requires new forms of brokering mechanisms which achieve consensus between conflicting pal-ties. Such mechanisms have to be designed in a way that they give rational self-interested agents no incentives for insincere behavior. We introduce an arbiter as third party that resolves conflicting bargaining situations between the agents. To achieve non-manipulative agent behavior, we investigate three arbitration protocols that avoid different forms of manipulations and show how each trades net efficiency for robustness against manipulations. We describe the applicability of the protocols in bilateral bargaining situations and, analyze their robustness against manipulations analytically and by simulations. We compare the protocols with Nash's arbitration(1) and the Groves-Clarke tax(2) and characterize situations in which our protocols are superior.
  • Publication