This paper discusses about several combinations of protein similarity measurement-methods, with respect to normalization, spatial partitions, geometrical properties, and distance metrics. We compare the effectiveness of possible combinations to each other. Our experiment shows that the feature based on fractional occupancy outperforms other methods. In addition, merging individual features might also yield good result. A prototype of 3D protein geometrical-similarity retrieval system is built for implementing our approach
{"title":"Exploiting Geometrical Properties on Protein Similarity Search","authors":"S. Akbar, J. Küng, R. Wagner","doi":"10.1109/DEXA.2006.56","DOIUrl":"https://doi.org/10.1109/DEXA.2006.56","url":null,"abstract":"This paper discusses about several combinations of protein similarity measurement-methods, with respect to normalization, spatial partitions, geometrical properties, and distance metrics. We compare the effectiveness of possible combinations to each other. Our experiment shows that the feature based on fractional occupancy outperforms other methods. In addition, merging individual features might also yield good result. A prototype of 3D protein geometrical-similarity retrieval system is built for implementing our approach","PeriodicalId":282986,"journal":{"name":"17th International Workshop on Database and Expert Systems Applications (DEXA'06)","volume":"160 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127928699","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In the recent time the eXtensible Markup Language (XML) is playing an increasing role in the exchange of nearly all kind of Web-based data and elsewhere. Hence, the development and enhancement of XML document transformation technologies and concepts become essential in the future. However, numerous specific transformation approaches specify their transformation definitions in XML files themselves. In this paper we present the XML transformation coordinator (XTC) which supports the composition and adaptation step in the development of these XML transformation definitions implementing a hierarchy concept of transformation operators. This hierarchy concept allows the specification of complex transformation operators without changing the underlying transformation technology. The complex operators are either generic or specifically suited to develop transformations in a certain domain or application area
{"title":"XTC -- The XML Transformation Coordinator for XML Document Transformation Technologies","authors":"Daniel Fötsch, A. Speck","doi":"10.1109/DEXA.2006.151","DOIUrl":"https://doi.org/10.1109/DEXA.2006.151","url":null,"abstract":"In the recent time the eXtensible Markup Language (XML) is playing an increasing role in the exchange of nearly all kind of Web-based data and elsewhere. Hence, the development and enhancement of XML document transformation technologies and concepts become essential in the future. However, numerous specific transformation approaches specify their transformation definitions in XML files themselves. In this paper we present the XML transformation coordinator (XTC) which supports the composition and adaptation step in the development of these XML transformation definitions implementing a hierarchy concept of transformation operators. This hierarchy concept allows the specification of complex transformation operators without changing the underlying transformation technology. The complex operators are either generic or specifically suited to develop transformations in a certain domain or application area","PeriodicalId":282986,"journal":{"name":"17th International Workshop on Database and Expert Systems Applications (DEXA'06)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127631187","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The security and trust in P2P systems are quite complex mainly because of their heterogeneity. Conventional approaches for dealing with these issues are not satisfactory. In this paper the trust issue is investigated and an innovative approach is discussed
{"title":"Trust and Security in Peer-to-Peer System","authors":"Vijay Kumar","doi":"10.1109/DEXA.2006.142","DOIUrl":"https://doi.org/10.1109/DEXA.2006.142","url":null,"abstract":"The security and trust in P2P systems are quite complex mainly because of their heterogeneity. Conventional approaches for dealing with these issues are not satisfactory. In this paper the trust issue is investigated and an innovative approach is discussed","PeriodicalId":282986,"journal":{"name":"17th International Workshop on Database and Expert Systems Applications (DEXA'06)","volume":"18 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128937995","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper we present an innovative approach to develop a domain ontology in collaborative fashion. This approach is synthesized in a groupware application which is called Co-Protege, a set of plug-ins which extends Protege. This approach is innovative because Co-Protege enables the coexistence of divergent conceptualizations and the discussion thread in order to record the ontology evolution
{"title":"Co-Protégé: Collaborative Ontology Building with Divergences","authors":"A. Díaz, Guillermo Baldo, G. Canals","doi":"10.1109/DEXA.2006.41","DOIUrl":"https://doi.org/10.1109/DEXA.2006.41","url":null,"abstract":"In this paper we present an innovative approach to develop a domain ontology in collaborative fashion. This approach is synthesized in a groupware application which is called Co-Protege, a set of plug-ins which extends Protege. This approach is innovative because Co-Protege enables the coexistence of divergent conceptualizations and the discussion thread in order to record the ontology evolution","PeriodicalId":282986,"journal":{"name":"17th International Workshop on Database and Expert Systems Applications (DEXA'06)","volume":"154155 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116777502","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Y. Tanaka, Naohiro Hayashibara, T. Enokido, M. Takizawa
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
{"title":"Fault-Tolerant Destributed Systems in a Mobile Agent Model","authors":"Y. Tanaka, Naohiro Hayashibara, T. Enokido, M. Takizawa","doi":"10.1109/DEXA.2006.60","DOIUrl":"https://doi.org/10.1109/DEXA.2006.60","url":null,"abstract":"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","PeriodicalId":282986,"journal":{"name":"17th International Workshop on Database and Expert Systems Applications (DEXA'06)","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128216763","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
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
{"title":"Regularity Analysis Using Time Slot Counting in the Mobile Clickstream","authors":"T. Yamakami","doi":"10.1109/DEXA.2006.122","DOIUrl":"https://doi.org/10.1109/DEXA.2006.122","url":null,"abstract":"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","PeriodicalId":282986,"journal":{"name":"17th International Workshop on Database and Expert Systems Applications (DEXA'06)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130303096","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Schema matching is an important prerequisite to the transformation of XML documents with different schemas. In this work, we are interested in the process of matching between data schemes in order to transform documents XML. After explaining related works in the domain, we choose the EXSMAL algorithm to generate a set of correspondences. Then we try to filter this set in order to obtain 1-1 correspondences. In this purpose, two calculations of similarity are applied: path similarity and internal similarity. This refinement helps to facilitate the transformation of the documents XML. We also base on a dynamic ontology updated by a user feedback which describes the semantic relation between nodes like IsA, PartOf, Similar, etc. These semantic relations are then expressed in LIMXS data model. The transformation will use operations such as: connect and rename for the simple matching, merge and split for the complex ones
{"title":"Refinement of Correspondences in EXSMAL for XML Document Transformation","authors":"Herzi Khaled, A. Benharkat, Y. Amghar","doi":"10.1109/DEXA.2006.121","DOIUrl":"https://doi.org/10.1109/DEXA.2006.121","url":null,"abstract":"Schema matching is an important prerequisite to the transformation of XML documents with different schemas. In this work, we are interested in the process of matching between data schemes in order to transform documents XML. After explaining related works in the domain, we choose the EXSMAL algorithm to generate a set of correspondences. Then we try to filter this set in order to obtain 1-1 correspondences. In this purpose, two calculations of similarity are applied: path similarity and internal similarity. This refinement helps to facilitate the transformation of the documents XML. We also base on a dynamic ontology updated by a user feedback which describes the semantic relation between nodes like IsA, PartOf, Similar, etc. These semantic relations are then expressed in LIMXS data model. The transformation will use operations such as: connect and rename for the simple matching, merge and split for the complex ones","PeriodicalId":282986,"journal":{"name":"17th International Workshop on Database and Expert Systems Applications (DEXA'06)","volume":"726 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132325665","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
We introduce the notion of opportunistic networks or oppnets, some of which can be considered a subclass of the peer-to-peer (P2P) networks. Initially, a relatively small seed oppnet is deployed, which grows into a bigger expanded oppnet. Oppnet growth starts with detecting diverse systems existing in its relative vicinity. Systems with best evaluations are invited by an oppnet to become its helpers. The oppnet leverages vast collective capabilities and resources of its helpers, employing them to execute diverse tasks in support of its goals. Though oppnet characteristics make them a natural fit for emergency response applications, we expect that they will prove beneficial in many other application areas. We discuss challenges in the development and use of the oppnet technology. Oppnets that use P2P interactions can be viewed as a specialization of the more general paradigm of P2P networks. To the best of our knowledge, we were the first to define and are now the first to investigate oppnets
{"title":"Opportunistic Networks: Challenges in Specializing the P2P Paradigm","authors":"L. Lilien, Z. Kamal, Ajay K. Gupta","doi":"10.1109/DEXA.2006.107","DOIUrl":"https://doi.org/10.1109/DEXA.2006.107","url":null,"abstract":"We introduce the notion of opportunistic networks or oppnets, some of which can be considered a subclass of the peer-to-peer (P2P) networks. Initially, a relatively small seed oppnet is deployed, which grows into a bigger expanded oppnet. Oppnet growth starts with detecting diverse systems existing in its relative vicinity. Systems with best evaluations are invited by an oppnet to become its helpers. The oppnet leverages vast collective capabilities and resources of its helpers, employing them to execute diverse tasks in support of its goals. Though oppnet characteristics make them a natural fit for emergency response applications, we expect that they will prove beneficial in many other application areas. We discuss challenges in the development and use of the oppnet technology. Oppnets that use P2P interactions can be viewed as a specialization of the more general paradigm of P2P networks. To the best of our knowledge, we were the first to define and are now the first to investigate oppnets","PeriodicalId":282986,"journal":{"name":"17th International Workshop on Database and Expert Systems Applications (DEXA'06)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124224983","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This paper presents a policy definition language which forms part of a generic policy toolkit for autonomic computing systems in which the policies themselves can be modified dynamically and automatically. Targeted enhancements to the current state of practice include: policy self-adaptation where the policy itself is dynamically modified to match environmental conditions; improved support for non autonomies-expert developers; and facilitating easy deployment of adaptive policies into legacy code. The policy definition language permits powerful expression of self-managing behaviours and facilitates a diverse policy behaviour space. Features include support for multiple versions of a given policy type, multiple configuration templates, and meta-policies to dynamically select between policy instances. An example deployment scenario illustrates advanced functionality in the context of a multi-policy stock trading system which is sensitive to environmental volatility
{"title":"Generic Support for Policy-Based Self-Adaptive Systems","authors":"R. Anthony","doi":"10.1109/DEXA.2006.63","DOIUrl":"https://doi.org/10.1109/DEXA.2006.63","url":null,"abstract":"This paper presents a policy definition language which forms part of a generic policy toolkit for autonomic computing systems in which the policies themselves can be modified dynamically and automatically. Targeted enhancements to the current state of practice include: policy self-adaptation where the policy itself is dynamically modified to match environmental conditions; improved support for non autonomies-expert developers; and facilitating easy deployment of adaptive policies into legacy code. The policy definition language permits powerful expression of self-managing behaviours and facilitates a diverse policy behaviour space. Features include support for multiple versions of a given policy type, multiple configuration templates, and meta-policies to dynamically select between policy instances. An example deployment scenario illustrates advanced functionality in the context of a multi-policy stock trading system which is sensitive to environmental volatility","PeriodicalId":282986,"journal":{"name":"17th International Workshop on Database and Expert Systems Applications (DEXA'06)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121073363","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Nickolas J. G. Falkner, P. Coddington, A. Wendelborn
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
{"title":"Optimising Performance in Network-Based Information Systems: Virtual Organisations and Customised Views","authors":"Nickolas J. G. Falkner, P. Coddington, A. Wendelborn","doi":"10.1109/DEXA.2006.108","DOIUrl":"https://doi.org/10.1109/DEXA.2006.108","url":null,"abstract":"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","PeriodicalId":282986,"journal":{"name":"17th International Workshop on Database and Expert Systems Applications (DEXA'06)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128724367","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：