Library Of Reusable Components Research Articles

A Component Query Method Based on Facet Description

The representation and retrieval technology of components are two core technology of the reusable component library. Related research think that the component query method based on facet description is much better than other methods, but when the user is not familiar with the term hierarchical tree of facet, they can not accurately represent the needs of their inquiry, so lead to lower query precision.To address this problem, this paper proposes a component query method based on facet description .In this method, the component will be expressed as vector form. Through the iterative process, using the user feedback information on the query results to adjust the user query vector constantly, and making it approximate the ideal query vector. Through the related experiments, this method is proven to improve the effectiveness of the component query precision.

Synthesis from component libraries

Synthesis is the automated construction of a system from its specification. In the classical temporal synthesis algorithms, it is always assumed the system is “constructed from scratch” rather than “composed” from reusable components. This, of course, rarely happens in real life. In real life, almost every non-trivial commercial system, either in hardware or in software system, relies heavily on using libraries of reusable components. Furthermore, other contexts, such as web-service orchestration, can be modeled as synthesis of a system from a library of components. In this work, we define and study the problem of LTL synthesis from libraries of reusable components. We define two notions of composition: data-flow composition, for which we prove the problem is undecidable, and control-flow composition, for which we prove the problem is 2EXPTIME-complete. As a side benefit, we derive an explicit characterization of the information needed by the synthesizer on the underlying components. This characterization can be used as a specification formalism between component providers and integrators.

Building a modular YAWL engine with Cumbia

Nowadays, novel strategies to develop and adapt workflow engines in efficient ways are required in order to have BPM and workflow solutions with the capacity to support frequent changes in the corporate environment. One key strategy is to build new engines by reusing as much as possible from existing components. This requires two things. Firstly, the mechanisms and technologies to build a library of reusable, extensible and adaptable workflow components. And secondly, a platform to integrate those components and form full applications. In this paper we show that Cumbia, being a platform for the development of workflow engines based on the modularisation of workflows according to concerns, suits this task. This is illustrated with YOC, a Cumbia-based implementation of YAWL.

Design and Implementation of Reusable Components Using PowerBuilder

Component technology is a key technology of software reuse. This paper investigates PowerBuilder based technology of software reuse, especially the technology of component design. To build a reusable component, reusable elements in the application system are firstly extracted. The reusable components are then used to form a reusable component library. When designing application system, suitable components are selected from the reusable library and then instantiated. Software system is implemented by composing the instanced components under a reusable framework. Practical results show that the use of reusable components can improve the efficiency of software development.

Synthesis from Recursive-Components Libraries

Synthesis is the automatic construction of a system from its specification. In classical synthesis algorithms it is always assumed that the system is "constructed from scratch" rather than composed from reusable components. This, of course, rarely happens in real life. In real life, almost every non-trivial commercial software system relies heavily on using libraries of reusable components. Furthermore, other contexts, such as web-service orchestration, can be modeled as synthesis of a system from a library of components. In 2009 we introduced LTL synthesis from libraries of reusable components. Here, we extend the work and study synthesis from component libraries with "call and return"' control flow structure. Such control-flow structure is very common in software systems. We define the problem of Nested-Words Temporal Logic (NWTL) synthesis from recursive component libraries, where NWTL is a specification formalism, richer than LTL, that is suitable for "call and return" computations. We solve the problem, providing a synthesis algorithm, and show the problem is 2EXPTIME-complete, as standard synthesis.

On the analysis and design of software for reinforcement learning, with a survey of existing systems

Reinforcement Learning (RL) is a very complex domain and software for RL is correspondingly complex. We analyse the scope, requirements, and potential for RL software, discuss relevant design issues, survey existing software, and make recommendations for designers. We argue that broad and flexible libraries of reusable software components are valuable from a scientific, as well as practical, perspective, as they allow precise control over experimental conditions, encourage comparison of alternative methods, and allow a fuller exploration of the RL domain.

A Mixed Method Approach for Efficient Component Retrieval from a Component Repository

A continuing challenge for software designers is to develop efficient and cost-effective software implementations. Many see software reuse as a potential solution; however, the cost of reuse tends to outweigh the potential benefits. The costs of software reuse include establishing and maintaining a library of reusable components, searching for applicable components to be reused in a design, as well as adapting components toward a proper implementation. In this context, a new method is suggested here for component classification and retrieval which consists of K-nearest Neighbor (KNN) algorithm and Vector space Model Approach. We found that this new approach gives a higher accuracy and precision in component selection and retrieval process compared to the existing formal approaches.

ISDP: Interactive Software Development Platform for Household Appliance Testing Industry

Distributed measurement systems (DMSs) are widely adopted to assist the design and testing of household appliances. Unfortunately, a reference model rarely rules the development of those systems, leading to poor software quality and bringing many troubles in the process of maintenance and integration. Furthermore, the development of measurement systems often suffers from low efficiency due to the complex programming and debugging process. To address the aforementioned issues, we first present a universal reference model serving as a foundation in the design of DMSs, particularly for the household appliance testing industry. The model provides the design criteria and methodologies of DMSs in terms of data collection and management. Then, according to the model, an interactive platform is built to facilitate the software development of DMSs for both local and web-based applications. The platform consists of the reusable component libraries, the client-based assembly subsystem, the web-based assembly subsystem, the data collection subsystem, and the customization subsystem. The software development process for measurement systems is turned into configuring parameters through interactive dialog boxes. The development efficiency and performance of the system generated by the platform are evaluated. Moreover, the model and platform are validated by various development cases for manufacturing enterprises. The results demonstrate that the model is feasible and that the platform remarkably improves the development efficiency and software quality.

A Software Agent-Component Based Framework for Multi-Agent Supply Chain Modelling and Simulation

Multi-agent systems (MASs) have emerged as the most natural intrinsic paradigm for modelling complex systems, such as supply chains (SCs). However, their development process remains quite involved and extremely time consuming, hindering wide-spread adoption in industrial-strength applications. A software agent-component based framework is proposed to simplify and speedup multi-agent (MA) modelling and simulation for SC applications. With the help of pre-developed libraries of reusable components—organizational agents (OAs), SC agents (SCAs), behaviour and policy objects; the framework allows model developers to quickly configure a MAS to simulate SC dynamics and study control and coordination issues. Being generic, flexible, and scalable; it supports development of either pseudo-centralized models by a single model developer, or distributed models by either a single or group of enterprises constituting a SC. The framework is unique; based on requirements it allows for representing different segments of SC network at either aggregated or detailed levels resulting in models of hybrid resolution. It facilitates studies involving intra- and inter-organizational dynamics (either independently or collectively), considering information asymmetry explicitly. The framework is validated through MA-simulation of Tamagotchi SC. Its results are presented, and the research extensions outlined.

Modeling of solid oxide fuel cells for dynamic simulations of integrated systems

Solid oxide fuel cell (SOFC) stacks are at the core of complex and efficient energy conversion systems for distributed power generation. Such systems are currently in various stages of development. These power plants of the future feature complicated configurations, because the fuel cell demands for a complex balance of plant. Moreover, proposed SOFC-based systems for stationary applications are often connected to additional components and subsystems, such as a gasifier with its gas-cleaning section, a gas turbine, and a heat recovery system for thermal cogeneration or additional power production. For the simplest SOFC configurations, and more so for complex integrated systems, the dynamic operation of the power plant is challenging, especially because the fluctuating electrical load of distributed energy systems demand for reliable transient operation. Issues related to dynamic operation must be studied in the early design stage and simulation results can be used to optimize the system configuration, taking into account transient behavior. This paper presents the development and the validation of a non-linear dynamic lumped-parameters model of a SOFC stack suitable for integration into models of complex power plants. Particular emphasis is placed on the systematic approach to model development. The model is implemented using the open-source Modelica language, which allows for a high degree of flexibility and modularity, the main features of the model herein presented. The SOFC stack model will be incorporated into ThermoPower, a freely distributed library of reusable software components for the modeling of thermo-hydraulic processes and power plants.

Model-driven synthesis of SOA solutions

The current approach to the design, maintenance, and governance of service-oriented architecture (SOA) solutions has focused primarily on flow-driven assembly and orchestration of reusable service components. The practical application of this approach in creating industry solutions has been limited, because flow-driven assembly and orchestration models are too rigid and static to accommodate complex, real-world business processes. Furthermore, the approach assumes a rich, easily configured library of reusable service components when in fact the development, maintenance, and governance of these libraries is difficult. An alternative approach pioneered by the IBM Research Division, model-driven business transformation (MDBT), uses a model-driven software synthesis technology to automatically generate production-quality business service components from high-level business process models. In this paper, we present the business entity life cycle analysis (BELA) technique for MDBT-based SOA solution realization and its integration into service-oriented modeling and architecture (SOMA), the end-to-end method from IBM for SOA application and solution development. BELA shifts the process-modeling paradigm from one that is centered on activities to one that is centered on entities. BELA teams process subject-matter experts with IT and data architects to identify and specify business entities and decompose business processes. Supporting synthesis tools then automatically generate the interacting business entity service components and their associated data stores and service interface definitions. We use a large-scale project as an example demonstrating the benefits of this innovation, which include an estimated 40 percent project cost reduction and an estimated 20 percent reduction in cycle time when compared with conventional SOA approaches.

Integrating Matlab Neural Networks Toolbox functionality in a fully reusable software component library

In this work, we present a reusable software component library, called IMO.Net Artificial Neural Networks library, which encapsulates the functionality of the Matlab Neural Networks Toolbox (MNNT). The MNNT is a powerful tool to work with neural networks. However, MNNT has not been conceived as a reusable and integrable software piece, and its results are clearly inadequate to be used for development of applications. The component library presented in this paper is fully reusable, allowing the integration of the neural networks toolbox objects and functions in software applications, independently of the platform and tools used to build it. Furthermore, this library provides two different sets of classes to the programmers, one of them presenting an application program interface (API) similar to the Matlab toolbox, and the other a fully object-oriented designed API, which is easier to use and more adequate for object-oriented and rapid application development. This library combines the advantages of being fully reusable and internally employing the MNNT to perform the algorithmic task, consequently inheriting all its power, robustness and comprehensiveness, but without its reusability limitations.

Comparing requirements analysis methods for developing reusable component libraries

Two approaches to requirements modelling are compared—the Domain Theory [Sutcliffe, A.G., 2002. The Domain Theory: Patterns for Knowledge and Software Reuse. Lawrence Erlbaum Associates, Mahwah, NJ.] and Problem Frames [Jackson, M., 2001. Problem Frames: Analysing and Structuring Software Development Problems, Pearson Education, Harlow.]—as a means of domain analysis for creating a reusable library of software components for constructing telemedicine applications. Experience of applying each approach as a domain analysis method to specify abstract components (object system models and Problem Frames) is reported. The two approaches produced detailed specifications although at different levels of abstraction: problems frames were better for monitoring, updating and data integrity requirements whereas the Domain Theory proved more useful for task support and user interface requirements. The lessons learned from using model-based approaches to requirements specification, and their merits for creating consistent specifications for reuse libraries, are discussed.

Foundations for MDA-based Forward Engineering.

Model Driven Architecture (MDA) is an emerging technology that is supposed to provide a technical framework for information integration and tools interoperation; many UML tools claim to be compliant with it. Model-to-model transformations are essential in MDA. This article describes foundations for UML-based transformation tools. We introduce the NEREUS language to cope with concepts of UML metamodel. A transformational system to translate OCL to NEREUS was defined. In this framework, we describe the NEREUS process to forward engineering UML static models to objectoriented code. Eiffel was the language of choice in which to show the feasibility of our approach. Transformations are supported by a library of reusable components and by a system of transformation rules that allow translating UML/OCL constructions to NEREUS specifications and Eiffel step-by-step.

The PragmAda reusable components

The PragmAda Reusable Components (PragmARCs) are a library of reusable components in a number of categories, and ranging from very basic to some quite high-level concepts. The PragmARCs have existed for over a decade, first in Ada 83 and now in Ada 95, and have been used on a variety of projects. A new version will probably appear once Ada 0X is standardized and widely available.

SPARTACAS: automating component reuse and adaptation

A continuing challenge for software designers is to develop efficient and cost-effective software implementations. Many see software reuse as a potential solution; however, the cost of reuse tends to outweigh the potential benefits. The costs of software reuse include establishing and maintaining a library of reusable components, searching for applicable components to be reused in a design, as well as adapting components toward a proper implementation. We introduce SPARTACAS, a framework for automating specification-based component retrieval and adaptation that has been successfully applied to synthesis of software for embedded and digital signal processing systems. Using specifications to abstractly represent implementations allows automated theorem-provers to formally verify logical reusability relationships between specifications. These logical relationships are used to evaluate the feasibility of reusing the implementations of components to implement a problem. Retrieving a component that is a complete match to a problem is rare. It is more common to retrieve a component that partially satisfies the requirements of a problem. Such components have to be adapted. Rather than adapting components at the code level, SPARTACAS adapts the behavior of partial matches by imposing interactions with other components at the architecture level. A subproblem is synthesized that specifies the missing functionality required to complete the problem; the subproblem is used to query the library for components to adapt the partial match. The framework was implemented and evaluated empirically, the results suggest that automated adaptation using architectures successfully promotes software reuse, and hierarchically organizes a solution to a design problem.

Knowledge modelling for the motion detection task: the algorithmic lateral inhibition method

In this article knowledge modelling at the knowledge level for the task of moving objects detection in image sequences is introduced. Three items have been the focus of the approach: (1) the convenience of knowledge modelling of tasks and methods in terms of a library of reusable components and in advance to the phase of operationalization of the primitive inferences; (2) the potential utility of looking for inspiration in biology; (3) the convenience of using these biologically inspired problem-solving methods (PSMs) to solve motion detection tasks. After studying a summary of the methods used to solve the motion detection task, the moving targets in indefinite sequences of images detection task is approached by means of the algorithmic lateral inhibition (ALI) PSM. The task is decomposed in four subtasks: (a) thresholded segmentation; (b) motion detection; (c) silhouettes parts obtaining; and (d) moving objects silhouettes fusion. For each one of these subtasks, first, the inferential scheme is obtained and then each one of the inferences is operationalized. Finally, some experimental results are presented along with comments on the potential value of our approach. q 2004 Published by Elsevier Ltd.

Assessing the cost-effectiveness of software reuse: A model for planned reuse

Information systems development is typically acknowledged as an expensive and lengthy process, often producing code that is of uneven quality and difficult to maintain. Software reuse has been advocated as a means of revolutionizing this process. The claimed benefits from software reuse are reduction in development cost and time, improvement in software quality, increase in programmer productivity, and improvement in maintainability. Software reuse entails undeniable costs of creating, populating, and maintaining a library of reusable components. There is anecdotal evidence to suggest that some organizations benefit from reuse. However, many software developers practicing reuse claim these benefits without formal demonstration thereof. There is little research to suggest when the benefits are expected and to what extent they will be realized. For example, does a larger library of reusable components lead to increased savings? What is the impact of component size on the effectiveness of reuse? This research seeks to address some of these questions. It represents the first step in a series wherein the effects of software reuse on overall development effort and costs are modeled with a view to understanding when it is most effective.

SPAnDX: a process-based population dynamics model to explore management and climate change impacts on an invasive alien plant, Acacia nilotica

This paper describes a process-based metapopulation dynamics and phenology model of prickly acacia, Acacia nilotica, an invasive alien species in Australia. The model, SPAnDX, describes the interactions between riparian and upland sub-populations of A. nilotica within livestock paddocks, including the effects of extrinsic factors such as temperature, soil moisture availability and atmospheric concentrations of carbon dioxide. The model includes the effects of management events such as changing the livestock species or stocking rate, applying fire, and herbicide application. The predicted population behaviour of A. nilotica was sensitive to climate. Using 35 years daily weather datasets for five representative sites spanning the range of conditions that A. nilotica is found in Australia, the model predicted biomass levels that closely accord with expected values at each site. SPAnDX can be used as a decision-support tool in integrated weed management, and to explore the sensitivity of cultural management practices to climate change throughout the range of A. nilotica. The cohort-based DYMEX modelling package used to build and run SPAnDX provided several advantages over more traditional population modelling approaches (e.g. an appropriate specific formalism (discrete time, cohort-based, process-oriented), user-friendly graphical environment, extensible library of reusable components, and useful and flexible input/output support framework).

Counting with range concatenation grammars

The class of range concatenation grammars appears to be a convincing challenger as a syntactic base for various tasks, especially in natural language processing. These grammars are powerful, since they strictly contain the class of mildly context-sensitive formalisms, while staying computationally tractable, since their sentences can be parsed in polynomial time. The output of their parsers are structures of polynomial size that can be seen as a generalization of classical context-free shared forest. Moreover, this formalism allows a form of modularity which may lead to the design of libraries of reusable grammatical components. And, finally, it can act as a syntactic backbone upon which decorations from other domains (say feature structures) can be grafted. In this paper we explore the behavior of range concatenation grammars in counting, a domain in which bad reputation of other classical syntactic formalisms is well known. This study leads to some surprising results.