物件導向軟體之架構(Object-Oriented Software Construction)探討

Aspect] is a simple and practical aspect-oriented extension to Java With just a few new constructs, AspectJ provides support for modular implementation of a range of crosscutting concerns. In AspectJ's dynamic join point model, join points are well-defined points in the execution of the program; pointcuts are collections of join points; advice are special method-like constructs that can be attached to pointcuts; and aspects are modular units of crosscutting implementation, comprising pointcuts, advice, and ordinary Java member declarations. AspectJ code is compiled into standard Java bytecode. Simple extensions to existing Java development environments make it possible to browse the crosscutting structure of aspects in the same kind of way as one browses the inheritance structure of classes. Several examples show that AspectJ is powerful, and that programs written using it are easy to understand.

An overview of AspectJ

Software systems dealing with distributed applications in changing environments normally require human supervision to continue operation in all conditions. These (re-)configuring, troubleshooting, and in general maintenance tasks lead to costly and time-consuming procedures during the operating phase. These problems are primarily due to the open-loop structure often followed in software development. Therefore, there is a high demand for management complexity reduction, management automation, robustness, and achieving all of the desired quality requirements within a reasonable cost and time range during operation. Self-adaptive software is a response to these demands; it is a closed-loop system with a feedback loop aiming to adjust itself to changes during its operation. These changes may stem from the software system's self (internal causes, e.g., failure) or context (external events, e.g., increasing requests from users). Such a system is required to monitor itself and its context, detect significant changes, decide how to react, and act to execute such decisions. These processes depend on adaptation properties (called self-a properties), domain characteristics (context information or models), and preferences of stakeholders. Noting these requirements, it is widely believed that new models and frameworks are needed to design self-adaptive software. This survey article presents a taxonomy, based on concerns of adaptation, that is, how, what, when and where, towards providing a unified view of this emerging area. Moreover, as adaptive systems are encountered in many disciplines, it is imperative to learn from the theories and models developed in these other areas. This survey article presents a landscape of research in self-adaptive software by highlighting relevant disciplines and some prominent research projects. This landscape helps to identify the underlying research gaps and elaborates on the corresponding challenges.

/pdf/self-adaptive-software-landscape-and-research-challenges-4rt6vhdmq2.pdf

Self-adaptive software: Landscape and research challenges

http://romisatriawahono.net/lecture/rm/survey/softcomputing/Boussaid%20-%20Optimization%20Metaheuristics%20-%202013.pdf

A survey on optimization metaheuristics

[서평]「Component Software」 - Beyond Object-Oriented Programming -

In this work we review the most important existing developments and future trends in the class of Parallel Genetic Algorithms (PGAs) PGAs are mainly subdivided into coarse and fine grain PGAs, the coarse grain models being the most popular ones An exceptional characteristic of PGAs is that they are not just the parallel version of a sequential algorithm intended to provide speed gains Instead, they represent a new kind of meta-heuristics of higher efficiency and efficacy thanks to their structured population and parallel execution The good robustness of these algorithms on problems of high complexity has led to an increasing number of applications in the fields of artificial intelligence, numeric and combinatorial optimization, business, engineering, etc We make a formalization of these algorithms, and present a timely and topic survey of their most important traditional and recent technical issues Besides that, useful summaries on their main applications plus Internet pointers to important web sites are included in order to help new researchers to access this growing area

A survey of parallel distributed genetic algorithms

http://www.biblioteca.uma.es/bbldoc/tesisuma/16668029.pdf

Analyzing synchronous and asynchronous parallel distributed genetic algorithms

Several notations and languages for software architectural specification have been recently proposed. However, some important aspects of composition, extension, and reuse deserve further research. These problems are particularly relevant in the context of open systems, where system structure can evolve dynamically, either by incorporating new components, or by replacing existing components with compatible ones. Our approach tries to address some of these open problems by combining the use of formal methods, particularly process algebras, with concepts coming from the object-oriented domain. In this paper we present LEDA, an Architecture Description Language for the specification, validation, prototyping and construction of dynamic software systems. Systems specified in LEDA can be checked for compatibility, ensuring that the behaviour of their components conforms to each other and that the systems can be safely composed. A notion of polymorphism of behaviour is used to extend and refine components while maintaining their compatibility, allowing the parameterisation of architectures, and encouraging reuse of architectural designs.

/pdf/specification-and-refinement-of-dynamic-software-2jbn6zgt6a.pdf

Specification and Refinement of Dynamic Software Architectures

http://atarazanas.sci.uma.es/docs/articulos/16665934.pdf

Compatibility and inheritance in software architectures

Component-based software development (CBSD) represents a significant advance towards assembling systems by plugging in independent and (re)usable components. On the other hand, aspect-oriented software development (AOSD) is presently considered as a possible technology to improve the modularity and adaptability of complex and large-scale distributed systems. Both are complementary technologies, so it would be helpful to have models that combine them to take advantage of all their mutual benefits. Thus recent research has tried to combine CBSD and AOSD by considering aspects as reusable parts that can be woven and then attached to the individual components. Our contribution to the integration of these technologies is CAM, a new component and aspect model that defines components and aspects as first-order entities, together with a non-intrusive composition mechanism to plug aspects into components. The underlying infrastructure supporting CAM is the dynamic aspect-oriented platform (DAOP), a component and aspect platform that provides the usual services of distributed applications, as well as a composition mechanism to perform the plugging of software aspects into components at runtime.

http://www.biblioteca.uma.es/bbldoc/tesisuma/16613727.pdf

José M. Troya

Papers

A survey of parallel distributed genetic algorithms

Analyzing synchronous and asynchronous parallel distributed genetic algorithms

Specification and Refinement of Dynamic Software Architectures

Compatibility and inheritance in software architectures

A Dynamic Component and Aspect-Oriented Platform