Software product lines (SPLs) are used to create tailor-made software products by managing and composing reusable assets. Generating a software product from the assets of an SPL is possible statically before runtime o...
详细信息
ISBN:
(纸本)9781605582672
Software product lines (SPLs) are used to create tailor-made software products by managing and composing reusable assets. Generating a software product from the assets of an SPL is possible statically before runtime or dynamically at load-time or runtime. Both approaches have benefits and drawbacks with respect to composition flexibility, performance, and resource consumption. Which type of composition is preferable should be decided by taking the application scenario into account. Current tools and languages, however, force a programmer to decide between static and dynamic composition during development. In this paper, we present an approach that employs code generation to support static and dynamic composition of features of a single code base. We offer an implementation on top of FeatureC++, an extension of the C++ programming language that supports software composition based on features. To simplify dynamic composition and to avoid creation of invalid products we furthermore provide means to (1) validate the correctness of a composition at runtime, (2) automatically instantiate SPLs in case of stand-alone applications, and (3) automatically apply interaction code of crosscutting concerns.
this paper presents an idea of new algorithm combining advantages of evolutionary algorithm and simple distributed computing to perform tasks which required many re-runs of the same program. Computing time is shorted ...
详细信息
ISBN:
(纸本)9780769531847
this paper presents an idea of new algorithm combining advantages of evolutionary algorithm and simple distributed computing to perform tasks which required many re-runs of the same program. Computing time is shorted due to elementary distribution within a number of common computers via the Internet. Progressive .NET Framework technology allowing this algorithm to run effectively and examples of possible usage are also described. the algorithm deals with a problem of synthesis of the artificial neural networks using the evolutional scanning method. the basic task to be solved is to create a symbolic regression algorithm on principles of analytic programming, which will be capable of performing a convenient neural network synthesis. the main motivation here is the computerization of such synthesis and discovering so far unknown solutions.
Support vector machines (SVMs) have been successfully applied to classification problems. Practical issues involve bow to determine the right type and suitable hyperparameters of kernel functions. Recently, multiple-k...
详细信息
ISBN:
(纸本)9781424420957
Support vector machines (SVMs) have been successfully applied to classification problems. Practical issues involve bow to determine the right type and suitable hyperparameters of kernel functions. Recently, multiple-kernel learning (MKL) algorithms are developed to handle these issues by combining different kernels. the weight with each kernel in the combination is obtained through learning. One of the most popular methods is to learn the weights with semidefinite programming (SDP). However, the amount of time and space required by this method is demanding. In this study. we reformulate the SDP problem to reduce the time and space requirements. Strategies for reducing the search space in solving the SDP problem are introduced. Experimental results obtained from running on synthetic datasets and benchmark datasets of UCI and Stating show that the proposed approach improves the efficiency of the SDP method without degrading the performance.
History-based pointcut languages are a very expressive and powerful means to obtain robust pointcuts. To implement them in an efficient way, people have proposed various optimisations and program history retention str...
详细信息
Many of the problems that stem from the use of exception handling are caused by the local way in which exceptions are handled. It demands that developers understand the source of an exception, the place where it is ha...
详细信息
there are several parallel programming models available for numerical computations at different levels of expressibility and ease of use. For the development of new domain specific programming models, a splitting into...
详细信息
ISBN:
(纸本)9783540681052
there are several parallel programming models available for numerical computations at different levels of expressibility and ease of use. For the development of new domain specific programming models, a splitting into a distributed data container and parallel data iterators is proposed. Data distribution is implemented in application specific libraries. Data iterators are directly analysed and compiled automatically into parallel code. Target architectures of the source-to-source translation include shared (pthreads, Cell SPE), distributed memory (MPI) and hybrid programming styles. A model applications for grid based hierarchical numerical methods and an auto-parallelizing compiler are introduced.
Groovy AOP is a general-purpose AOP system for Groovy, a JVM-based dynamic language. Groovy AOP provides a hybrid dynamic AOP implementation based on both metaprogramming and bytecode transformation. It implements the...
详细信息
In the past, repositories of examples of the well-known Gang-of-Four design patterns brought insights on the potential contributions of aspect-oriented programming, as well as providing a suitable case study for subse...
详细信息
Malleable tasks are a way of modelling jobs that can be parallelized to get a (usually sublinear) speedup. the best currently known approximation algorithms for scheduling malleable tasks with precedence constraints a...
详细信息
ISBN:
(纸本)9783540681052
Malleable tasks are a way of modelling jobs that can be parallelized to get a (usually sublinear) speedup. the best currently known approximation algorithms for scheduling malleable tasks with precedence constraints are a) a 2.62-approximation for certain classes of precedence constraints such as series-parallel graphs [1], and b) a 4.72-approximation for general graphs via linear programming [2]. We show that these rates are tight, i.e. there exist instances that achieve the upper bounds.
the proceedings contain 60 papers. the topics discussed include: accountable game designs for classroom learning;utilizing technology to support the development of empathy;digital learning ecosystems: authoring, colla...
ISBN:
(纸本)9781595939944
the proceedings contain 60 papers. the topics discussed include: accountable game designs for classroom learning;utilizing technology to support the development of empathy;digital learning ecosystems: authoring, collaboration, immersion and mobility;designing and evaluating affective open-learner modeling tutors;tangible computer programming for informal science learning;supporting children as they program to make physical and virtual objects interact;robotics in special needs education;supporting parent-child interaction in divorced families;a role for grammar in autism CAIs;iSET: interactive social-emotional toolkit for autism spectrum disorder;can ICT support inclusion? evidence from multi-user edutainment experiences based on 3D worlds;Mocotos: mobile communications tools for children with special needs;youth as media art designers: workshops for creative coding;handcrafted physical syntax elements for illiterate children: initial concepts;and KEI-time traveler: visiting a past world with mobile phones to enhance learning motivation.
暂无评论