As the concept of meta-classes was introduced in order to permit the manipulation of classes, we introduce the concept of meta-components, meta-connectors, and meta-architectures to permit the manipulation and the redefinition of architectural elements (structural and behavioral). In this article we present a meta-meta-architecture called MADL (Meta Architecture Description Language) to abstract the notions of architectures (components, connectors, architectures), hence to facilitate their manipulation, reuse, and evolution; and also to ease (hence encourage) the transformation and comparison among ADLs.
{"title":"MADL: Meta Architecture Description Language","authors":"A. Smeda, M. Oussalah, T. Khammaci","doi":"10.1109/SERA.2005.50","DOIUrl":"https://doi.org/10.1109/SERA.2005.50","url":null,"abstract":"As the concept of meta-classes was introduced in order to permit the manipulation of classes, we introduce the concept of meta-components, meta-connectors, and meta-architectures to permit the manipulation and the redefinition of architectural elements (structural and behavioral). In this article we present a meta-meta-architecture called MADL (Meta Architecture Description Language) to abstract the notions of architectures (components, connectors, architectures), hence to facilitate their manipulation, reuse, and evolution; and also to ease (hence encourage) the transformation and comparison among ADLs.","PeriodicalId":424175,"journal":{"name":"Third ACIS Int'l Conference on Software Engineering Research, Management and Applications (SERA'05)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134427642","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}
L. F. Ibrahim, Olaa Metwaly, Amira Kapel, A. Ahmed
This paper introduces an enhancements to Ant Colony system, which is considered one of the most successful ant algorithms used to solve combinatorial optimization problems. Network planning is the problem of how to plan the infrastructure network in the new city. This paper deals with optimization algorithms for network design problem. The objective is to design a distribution network at a minimum cost that satisfies the demand and constraints required by the subscribers. This approach uses the idea of an ant group to represent a solution and can assist the solution of large networks that cannot normally be solved to optimality. The algorithmic implementation of the proposed algorithm is described and computational experience is reported. Results demonstrate the effectiveness and flexibility of the modifying algorithm. Comparisons with related work are presented showing the advantages of the purposed algorithm introduced in this paper.
{"title":"Enhancing the behavior of the ant algorithms to solving network planning problem","authors":"L. F. Ibrahim, Olaa Metwaly, Amira Kapel, A. Ahmed","doi":"10.1109/SERA.2005.39","DOIUrl":"https://doi.org/10.1109/SERA.2005.39","url":null,"abstract":"This paper introduces an enhancements to Ant Colony system, which is considered one of the most successful ant algorithms used to solve combinatorial optimization problems. Network planning is the problem of how to plan the infrastructure network in the new city. This paper deals with optimization algorithms for network design problem. The objective is to design a distribution network at a minimum cost that satisfies the demand and constraints required by the subscribers. This approach uses the idea of an ant group to represent a solution and can assist the solution of large networks that cannot normally be solved to optimality. The algorithmic implementation of the proposed algorithm is described and computational experience is reported. Results demonstrate the effectiveness and flexibility of the modifying algorithm. Comparisons with related work are presented showing the advantages of the purposed algorithm introduced in this paper.","PeriodicalId":424175,"journal":{"name":"Third ACIS Int'l Conference on Software Engineering Research, Management and Applications (SERA'05)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122702178","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 explores the use of program slicing as a tool for "component mining" of Java/spl trade/ source code. We define component mining to be the extraction of an executable slice from source code, which satisfies a specific use case (or set of use cases) and provides a standard component interface for its use. However, before a component can be generated, the desired features themselves must be isolated from the source code. Traditionally, software slicing has concerned itself with the value of a variable of interest (or set of variables) at a specific point of execution. This severely limits the usefulness of the traditional definition of a slicing criterion as a tool for feature isolation. We propose the repurposing of software "unit-tests" to aid in the isolation of features of interest within source code. By executing a target application in our JPDA (Java platform debugging architecture) based slicer, a selected unit-test may then serve as the slicing criterion.
{"title":"A framework for component mining of Java applications via dynamic slicing","authors":"A. Conover, Yeong-Tae Song","doi":"10.1109/SERA.2005.7","DOIUrl":"https://doi.org/10.1109/SERA.2005.7","url":null,"abstract":"This paper explores the use of program slicing as a tool for \"component mining\" of Java/spl trade/ source code. We define component mining to be the extraction of an executable slice from source code, which satisfies a specific use case (or set of use cases) and provides a standard component interface for its use. However, before a component can be generated, the desired features themselves must be isolated from the source code. Traditionally, software slicing has concerned itself with the value of a variable of interest (or set of variables) at a specific point of execution. This severely limits the usefulness of the traditional definition of a slicing criterion as a tool for feature isolation. We propose the repurposing of software \"unit-tests\" to aid in the isolation of features of interest within source code. By executing a target application in our JPDA (Java platform debugging architecture) based slicer, a selected unit-test may then serve as the slicing criterion.","PeriodicalId":424175,"journal":{"name":"Third ACIS Int'l Conference on Software Engineering Research, Management and Applications (SERA'05)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124557711","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}
C. Matsuyama, Toyoshiro Nakashima, N. Ishii, Hidenori Itoh
In authors programming course, students create animations as programming practice because this type of practice will make students interested in learning programming. This type of animation creation practice is well received by students. For the animation creation, we provide students with material such as fundamentals for creating basic animation, explanations of graphics functions, basic animation creation method, its application and its programming example in printed form (black and white). However, it is difficult for students to see the actual color or motion in printed material, because some of the animation is only shown on the screen and it is difficult for the students to actually reproduce the motion or examine the source codes by themselves. In order to overcome those problems, we have developed teaching material on the Web and actually used them in programming course. As a result it is clear that this material contributes to the increase in LOC, FP and the volume of animation created. In this paper, we give the general description of programming course, the objective of developing teaching material on the Web and guidelines for it, a general description of material, its effectiveness and problems we may see in the future.
{"title":"Development of teaching material on the Web for programming course and its evaluation","authors":"C. Matsuyama, Toyoshiro Nakashima, N. Ishii, Hidenori Itoh","doi":"10.1109/SERA.2005.36","DOIUrl":"https://doi.org/10.1109/SERA.2005.36","url":null,"abstract":"In authors programming course, students create animations as programming practice because this type of practice will make students interested in learning programming. This type of animation creation practice is well received by students. For the animation creation, we provide students with material such as fundamentals for creating basic animation, explanations of graphics functions, basic animation creation method, its application and its programming example in printed form (black and white). However, it is difficult for students to see the actual color or motion in printed material, because some of the animation is only shown on the screen and it is difficult for the students to actually reproduce the motion or examine the source codes by themselves. In order to overcome those problems, we have developed teaching material on the Web and actually used them in programming course. As a result it is clear that this material contributes to the increase in LOC, FP and the volume of animation created. In this paper, we give the general description of programming course, the objective of developing teaching material on the Web and guidelines for it, a general description of material, its effectiveness and problems we may see in the future.","PeriodicalId":424175,"journal":{"name":"Third ACIS Int'l Conference on Software Engineering Research, Management and Applications (SERA'05)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123012723","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
扫码关注我们
求助内容：
应助结果提醒方式：