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}
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 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}
The common object request broker architecture (CORBA) specification originally did not include any support for fault-tolerance. The fault-tolerant CORBA standard was added to address this issue. One drawback of the standard is that it does not include fault-tolerance in the case of network partitioning faults. The main contribution of this paper is the design of a fault-tolerance CORBA add-on for partitionable environments. In contrast to other solutions, our modular design separates replication and reconciliation policies from the basic replication mechanisms. This modularity allows the replication and reconciliation strategies to be modified easily
{"title":"CORBA Replication Support for Fault-Tolerance in a Partitionable Distributed System","authors":"S. Beyer, F. D. Muñoz-Escoí, Pablo Galdámez","doi":"10.1109/DEXA.2006.44","DOIUrl":"https://doi.org/10.1109/DEXA.2006.44","url":null,"abstract":"The common object request broker architecture (CORBA) specification originally did not include any support for fault-tolerance. The fault-tolerant CORBA standard was added to address this issue. One drawback of the standard is that it does not include fault-tolerance in the case of network partitioning faults. The main contribution of this paper is the design of a fault-tolerance CORBA add-on for partitionable environments. In contrast to other solutions, our modular design separates replication and reconciliation policies from the basic replication mechanisms. This modularity allows the replication and reconciliation strategies to be modified easily","PeriodicalId":282986,"journal":{"name":"17th International Workshop on Database and Expert Systems Applications (DEXA'06)","volume":"18 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":"125971571","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}
N. Sato, M. Uehara, K. Shimomura, Hirobumi Yamamoto, K. Kamijo
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
{"title":"Efficient Target Selection in Similarity Preserve Hash for Distributed Geographical Origin Identification System of Vegetables","authors":"N. Sato, M. Uehara, K. Shimomura, Hirobumi Yamamoto, K. Kamijo","doi":"10.1109/DEXA.2006.55","DOIUrl":"https://doi.org/10.1109/DEXA.2006.55","url":null,"abstract":"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","PeriodicalId":282986,"journal":{"name":"17th International Workshop on Database and Expert Systems Applications (DEXA'06)","volume":"18 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":"127213254","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
Organisations may wish to use a standards-defined distributed system in a global sense but also have a requirement for non-standard local behaviour. This reflects the production of, and desire to use, organisational knowledge developed over time. The efficient and effective management of this knowledge can be a deciding factor in an organisation's success or failure. Virtual organisations, where members share a problem-solving purpose rather than a location-based or formal organisation, have no formal bodies to manage change requests and may be restricted in how they can apply their knowledge. These organisations are also the most likely to seek divergent local behaviour since their locale is formed by the members' desire to solve a particular problem and this problem-based approach may lead to user requirements that exist only in that virtual organisation. We describe a method for capturing and representing operational semantics so that global and local behaviour can co-exist without leading to operational impairment in either sphere. The approach applies to virtual and traditional organisations equally well as both entities can use it to integrate their local knowledge and requirements into a much larger framework and, potentially, share these with their collaborators. We illustrate our approach with reference to our implementation of an ontologically enhanced domain name system (DNS) server
{"title":"Capturing and Using the Operational Semantics of Large Distributed Systems: Sharing Common Application Requirements in Virtual Organisations","authors":"Nickolas J. G. Falkner, P. Coddington, A. Wendelborn","doi":"10.1109/DEXA.2006.152","DOIUrl":"https://doi.org/10.1109/DEXA.2006.152","url":null,"abstract":"Organisations may wish to use a standards-defined distributed system in a global sense but also have a requirement for non-standard local behaviour. This reflects the production of, and desire to use, organisational knowledge developed over time. The efficient and effective management of this knowledge can be a deciding factor in an organisation's success or failure. Virtual organisations, where members share a problem-solving purpose rather than a location-based or formal organisation, have no formal bodies to manage change requests and may be restricted in how they can apply their knowledge. These organisations are also the most likely to seek divergent local behaviour since their locale is formed by the members' desire to solve a particular problem and this problem-based approach may lead to user requirements that exist only in that virtual organisation. We describe a method for capturing and representing operational semantics so that global and local behaviour can co-exist without leading to operational impairment in either sphere. The approach applies to virtual and traditional organisations equally well as both entities can use it to integrate their local knowledge and requirements into a much larger framework and, potentially, share these with their collaborators. We illustrate our approach with reference to our implementation of an ontologically enhanced domain name system (DNS) server","PeriodicalId":282986,"journal":{"name":"17th International Workshop on Database and Expert Systems Applications (DEXA'06)","volume":"4 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":"127882261","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
扫码关注我们
求助内容：
应助结果提醒方式：