{"title":"An infrastructure to help development with reuse","authors":"R. Hajri, L. L. Jilani, H. Ghézala","doi":"10.1109/AICCSA.2005.1387128","DOIUrl":"https://doi.org/10.1109/AICCSA.2005.1387128","url":null,"abstract":"Summary form only given. This paper discusses that in order to help development with reusable software components, various reuse libraries should be available for users, components retrieval, use and comprehension should be facilitated and relations between components should be considered. To achieve this goal, we propose a reuse infrastructure-IRL which preferences various reuse libraries in order to make them available for users all over the world and to facilitate their access, 2) supplies components reuse guidelines, samples and/or demos to facilitate their comprehension and use and 3) extracts components relationships to facilitate their composition and integration. IRL infrastructure is based on a component meta-model and a search process. The meta-model represents a meta-library associated with IRL and encapsulates different views of a reusable component. The search process is strategic and supplies different search techniques which can be applied to search for components independently of their source libraries search techniques. This infrastructure provides an ontology which represents components meta-knowledge. This ontology provides, in one hand a unified vocabulary for various reuse libraries by which ambiguities on the components semantics are removed. On the other hand, this ontology facilitates components search and filling in the meta-library associated with IRL infrastructure. In this paper, the IRL infrastructure is presented, and an experimentation evaluating it is discussed.","PeriodicalId":442289,"journal":{"name":"The 3rd ACS/IEEE International Conference onComputer Systems and Applications, 2005.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130153362","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}
Feng Ji, R. Elmasri, Yiming Zhang, B. Ritesh, Z. Raja
{"title":"Incorporating concepts for bioingormatics data modeling into EER models","authors":"Feng Ji, R. Elmasri, Yiming Zhang, B. Ritesh, Z. Raja","doi":"10.1109/AICCSA.2005.1387039","DOIUrl":"https://doi.org/10.1109/AICCSA.2005.1387039","url":null,"abstract":"Summary form only given. Biological data such as nucleic acids (DNA or RNA), proteins, and pathways require certain conceptual modeling characteristics that are not available in the popular ER (entity-relationship) model and its variations, such as the EER (extended-ER) models. In this paper, we try to make minimal changes to the EER model by introducing special relationships for ordering and process input/output. This allows more accurate modeling of bioinformatics structures that can be used in bioinformatics ontologies and mediator systems. We propose some EER schemas for DNA sequence ordering, the structures of proteins, and pathway processes","PeriodicalId":442289,"journal":{"name":"The 3rd ACS/IEEE International Conference onComputer Systems and Applications, 2005.","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127225859","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}
{"title":"The human genome project: software challenges and future directions","authors":"N. Stojanovic","doi":"10.1109/AICCSA.2005.1387117","DOIUrl":"https://doi.org/10.1109/AICCSA.2005.1387117","url":null,"abstract":"Summary form only given. The sequencing of the human genome would not have been possible without software - and, because of the specific nature of this effort, very little of it was previously available. We provide an overview of the programs developed for the human genome project, some of which have not been published before. The sequencing was officially completed in 2003, but its results (in combination with other obtained genomes) enabled the analysis on a grand scale. That mandated even more complex programming work. We conclude with an outline of several research directions which, in this author's opinion, become increasingly important.","PeriodicalId":442289,"journal":{"name":"The 3rd ACS/IEEE International Conference onComputer Systems and Applications, 2005.","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125690683","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}
{"title":"A novel approach for managing and reusing business rules in business architectures","authors":"H. Hamza, M. Fayad","doi":"10.1109/AICCSA.2005.1387165","DOIUrl":"https://doi.org/10.1109/AICCSA.2005.1387165","url":null,"abstract":"Business architectures are models that describe the business entities, their relationships, their dynamics, and the rules that govern their interaction. These rules are usually called business rules. A major challenge in developing effective business architectures is to define and implement business rules effectively so that the architecture can be adapted whenever new requirements evolve. Current approaches that address business rules do not provide a balance between effective management and reuse of the business rules within the architecture. In this paper. we discuss current solution to manage business rules. and then we propose a new approach for developing business architectures and their business rules. The proposed approach allows for both managing and reusing business rules. The approach is demonstrated through the means of a case study.","PeriodicalId":442289,"journal":{"name":"The 3rd ACS/IEEE International Conference onComputer Systems and Applications, 2005.","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126637088","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}
{"title":"On the design of hybrid prioritized multiple access protocols for bank data center LANs","authors":"M. Sklira, A. Pomportsis","doi":"10.1109/AICCSA.2005.1387054","DOIUrl":"https://doi.org/10.1109/AICCSA.2005.1387054","url":null,"abstract":"Summary form only given. The communication systems of commercial banks support four classes of traffic: Alarm, BSC, SNA and IP traffic, with each class of traffic having different priority requirements. In this paper, a new approach to the design of multiple access protocols which are capable of handling the above priority classes is introduced. Furthermore, a hybrid multiple access protocol that has been designed according to the proposed approach is presented and evaluated by means of extensive simulation results.","PeriodicalId":442289,"journal":{"name":"The 3rd ACS/IEEE International Conference onComputer Systems and Applications, 2005.","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114414199","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}
{"title":"A new approach to manage roaming in IPv6","authors":"O. R. Rojas, J. Ben-othman, S. Sfar","doi":"10.1109/AICCSA.2005.1387050","DOIUrl":"https://doi.org/10.1109/AICCSA.2005.1387050","url":null,"abstract":"Summary form only given. VHE (virtual home environment) poses new challenges in terms of services customization and the integration of end-to-end QoS management. Our approach provides a model for the mobility management in IPv6 according to VHE context. In this paper we introduce an architecture which guarantees authorized user access and user mobility management. The mechanism used for user authentication is based on LDAP (lightweight directory access protocol) and RADIUS (remote access dial in user service) services, giving accurate localization of the mobile node even in the presence of hadover; at this point, the user must be re-authenticated and consequently the VHE services are activated to transport the user profile to the foreign network.","PeriodicalId":442289,"journal":{"name":"The 3rd ACS/IEEE International Conference onComputer Systems and Applications, 2005.","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128242493","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}
{"title":"Watershed segmentation for carotid artery ultrasound images","authors":"A. Abdel-Dayem, M. El-Sakka, A. Fenster","doi":"10.1109/AICCSA.2005.1387120","DOIUrl":"https://doi.org/10.1109/AICCSA.2005.1387120","url":null,"abstract":"Summary form only given. This paper introduces a novel segmentation scheme for carotid artery ultrasound images. The proposed scheme is based on watershed segmentation algorithm. It consists of four major stages. These stages are preprocessing, watershed segmentation, region merging and finally boundary extraction. The proposed scheme is tested using a set of carotid artery ultrasound images. The experimental results show that the proposed scheme can produce accurate contours.","PeriodicalId":442289,"journal":{"name":"The 3rd ACS/IEEE International Conference onComputer Systems and Applications, 2005.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128935129","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}
{"title":"A XML format secure protocol - OpenSST","authors":"Xinhua Zhang, C. Jiang, Wanjun Huang, C. Meinel","doi":"10.1109/AICCSA.2005.1387080","DOIUrl":"https://doi.org/10.1109/AICCSA.2005.1387080","url":null,"abstract":"Summary form only given. OpenSST (Open Simple Secure Transaction) is a free software project and aims to create an efficient, open and secure alternative to the secure proprietary transaction protocol. OpenSST uses XML syntax to specify its message format, and relies on prevalent cryptographic algorithms to secure the transaction. OpenSST is designed to provide user with the guarantee on confidentiality, integrity, authenticity and non-repudiation. One feature of OpenSST's is that it defines a simple message structure so that it can easily be integrated into different usage frameworks. This paper mainly describes OpenSST's logic architecture and message format through an http-based prototype.","PeriodicalId":442289,"journal":{"name":"The 3rd ACS/IEEE International Conference onComputer Systems and Applications, 2005.","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129014378","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}
S. Crisóstomo, S. Sargento, M. Natkaniec, Norbert Vicari
{"title":"A QoS architecture integrating mobile Ad-Hoc and infrastructure networks","authors":"S. Crisóstomo, S. Sargento, M. Natkaniec, Norbert Vicari","doi":"10.1109/AICCSA.2005.1387151","DOIUrl":"https://doi.org/10.1109/AICCSA.2005.1387151","url":null,"abstract":"Ahstract-This paper proposes an Ad-hoc QoS architecture, using as basis some concepts from SWAN, extending it to fulfill our requirements. It also proposes the modules required in the network elements and its interaction to provide optimized QoS in the ad-hoc network and integration between both networks. We also present the overall integration QoS signaling protocol and the differentiation mechanisms to address end-to-end QoS for real-time multimedia applications. Furthermore, the proposed solution addresses the use of multipath routing in order to provide load balancing and increased network reliability","PeriodicalId":442289,"journal":{"name":"The 3rd ACS/IEEE International Conference onComputer Systems and Applications, 2005.","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124667588","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}
{"title":"Determining all pairs edge connectivity of a 4-regular graph in O(|V|)","authors":"A. Fit-Florea, D. Matula","doi":"10.1109/AICCSA.2005.1387014","DOIUrl":"https://doi.org/10.1109/AICCSA.2005.1387014","url":null,"abstract":"Summary form only given. The edge connectivity of a graph G = (V, E) is defined as the function, /spl lambda/: V /spl times/ V /spl rarr/ N, that associates to any pair of vertices (u, v) the maximum number of edge-disjoint paths connecting the two vertices, /spl lambda/(u, v). In this paper, we present a method for determining the function /spl lambda/(u,v) for all vertex pairs in a 4-regular graph which achieves O(|V|) running time (with a small constant factor) and O(|V|) space complexity. We show with our method that determination and traversal of an Eulerian tour of each component of the 4-regular graph along with appropriate bookkeeping is enough for determining /spl lambda/(u, v) for all pairs (u,v).","PeriodicalId":442289,"journal":{"name":"The 3rd ACS/IEEE International Conference onComputer Systems and Applications, 2005.","volume":"15 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126969870","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}