Replicators: transformations to address model scalability
In Model Integrated Computing, it is desirable to evaluate different design alternatives as they relate to issues of scalability. A typical approach to address scalability is to create a base model that captures the key interactions of various components (i.e., the essential properties and connections among modeling entities). A collection of base models can be adorned with necessary information to characterize their replication. In current practice, replication is accomplished by scaling the base model manually. This is a time-consuming process that represents a source of error, especially when there are deep interactions between model components. As an alternative to the manual process, this paper presents the idea of a replicator, which is a model transformation that expands the number of elements from the base model and makes the correct connections among the generated modeling elements. The paper motivates the need for replicators through case studies taken from models supporting different domains.

title: Automating change evolution in model-driven engineering
abstract: The escalating complexity of software and system models is making it difficult to rapidly explore the effects of a design decision. Automating such exploration with model transformation and aspect-oriented techniques can improve both productivity and model quality. The combination of model transformation and aspect weaving provides a powerful technology for rapidly transforming legacy systems from the high-level properties that models describe. Further, by applying aspect-oriented techniques and program transformation, small changes at the modeling level can trigger very large transformations at the source code level. Thus, model engineers can explore alternative configurations using an aspect weaver targeted for modeling tools and then use the models to generate program transformation rules for adapting legacy source code on a wide scale.

title: Aspect mining from a modelling perspective
abstract: Aspect mining aims at identifying, analysing, and refactoring crosscutting concerns throughout a legacy system for the purpose of improving software modularisation. This paper presents our investigation into raising the benefits of aspect mining to high level domain-specific models. A key contribution is the capability to identify crosscutting concerns early in development, which will assist in the modularisation of a design through aspects, before proceeding to the implementation level. Furthermore, our experience has led us to believe that aspects are easier to identify at the modelling level, because much of the accidental complexities of implementation concerns are not present in the corresponding modelling abstractions.

title: A Composition-Oriented Approach for Business Process Formal Design
abstract: Traditional approaches to designing business processes are often inadequate for complicated, distributed, and collaborated settings. However since network technologies have become widespread, an increasing number of business processes exhibit these properties. Therefore a new approach is needed. To this end, we describe the motivation, conceptualization, and analysis of a composition-oriented business process design method. The key advance of our method is that it uses process algebra pi-calculus as its formal basis and builds a complex process by composing simple structured process control modules to reduce the complexity of business process design as well as let several designers collaborate the design of a complex process. To make business process more clear, we also provide way of separating exception processing logic from normal process control logic and provide scooping mechanisms to minimize the detrimental effects of unplanned contingencies by ways of composition

title: Model replication: transformations to address model scalability
abstract: 2 SUMMARY In Model-Driven Engineering, it is often desirable to evaluate different design alternatives as they relate to scalability issues of the modeled system. A typical approach to address scalability is model replication, which starts by creating base models that capture the key entities as model elements and their relationships as model connections. A collection of base models can be adorned with necessary information to characterize a specific scalability concern as it relates to how the base modeling elements are replicated and connected together. In current modeling practice, such model replication is usually accomplished by scaling the base model manually. This is a time-consuming process that represents a source of error, especially when there are deep interactions between model components. As an alternative to the manual process, this paper presents the idea of automated model replication through a model transformation process that expands the number of elements from the base model and makes the correct connections among the generated modeling elements. The paper motivates the need for model replication through case studies taken from models supporting different domains.

title: Business Process-Oriented Software Architecture for Supporting Business Process Change
abstract: As a business process is essential in running an enterprise, this paper aims toward improving software architecture by extracting business-relevant semantics from business logic and transforming them as important elements that need to be molded and represented in software architecture. This allows for the development of a business process-oriented software architecture (BPOSA) that can support smoother business process change. The paper introduces the structure of BPOSA and its work mode. Then it describes the steps involved in designing a process-oriented software system, and provides analysis and design methods of extending process-relevant attributes for application in business operations.

title: Similarity computing model of high dimension data for symptom classification of Chinese traditional medicine
abstract: In recent years, researchers have paid more and more attention on data mining of practical applications. Aimed to the problem of symptom classification of Chinese traditional medicine, this paper proposes a novel computing model based on the similarities among attributes of high dimension data to compute the similarity between any tuples. This model assumes data attributes as basic vectors of m dimensions and each tuple as a sum vector of all the attribute-vectors. Based on the transcendental concept similarity information among attributes, it suggests a novel distance algorithm to compute the similarity distance of any pair of attribute-vectors. In this method, the computing of similarity between any tuples are turned to the formulas of attribute-vectors and their projections of each other, and the similarity between any pair of tuples can be worked out by computing these vectors and formulas. This paper also presents a novel classification algorithm based on the similarity computing model and successfully applies the algorithm into the symptom classification of Chinese traditional medicine. The efficiency of the algorithm is proved by extensive experiments.

title: D-GridMST: Clustering Large Distributed Spatial Databases
abstract: In this paper, we will propose a distributable clustering algorithm, called Distributed-GridMST (D-GridMST), which deals with large distributed spatial databases. D-GridMST employs the notions of multi-dimensional cube to partition the data space involved and uses density criteria to extract representative points from spatial databases, based on which a global MST of representatives is constructed. Such a MST is partitioned according to users’ clustering specification and used to label data points in the respective distributed spatial database thereafter. Since only the compact information of the distributed spatial databases is transferred via network, D-GridMST is characterized by small network transferring overhead. Experimental results show that D-GridMST is effective since it is able to produce exactly the same clustering result as that produced in centralized paradigm, making D-GridMST a promising tool for clustering large distributed spatial databases.

title: Increase of potential intellectual bandwidth in a scientific community through implementation of an end-user information system
abstract: Qureshi, et al. (2002) presented a case study where they used a framework, the intellectual bandwidth model to measure an organization's ability to create value. The model consists of two dimensions, information assimilation and collaboration. The IB model is a useful tool for managers because it enables them to plan solutions to complex business problems and to easily communicate these plans to key individuals. The model can also serve as a guide when making investment decisions. While it is important to increase an organization's intellectual bandwidth, it is equally important to assure that the resulting increase is employed to improve the organization's ability to innovate since, as it has been shown, innovation is the number one creator of organizational wealth (Baum et al., 2000). In this paper we discuss how intellectual bandwidth as proposed by Nunamaker et al. (2001) can be extended beyond the highest level of information assimilation identified in the model, automated sense-making, to ensure implementation of product innovations. To do this we propose adding two new information assimilation features, automated utilization and automated implementation. A real business example from the bioscience industry is presented in order to demonstrate how the IB model with extensions can be used. The study discusses an end-user information system, its current use and its potential to enhance an organization's value-creating capability.

title: A Simplified Learning Algorithm of Incremental Bayesian
abstract: A proportion factor is constructed though the Maximum Aposteriori Probability of examples in test data to select the training examples in incremental learning process. Instead of complex normal classify loss expression, the proportion factor λ is used to estimate the classify loss to improve classification efficiency. The final experiment shows that this algorithm is feasible, and more accurate than simple Bayesian classifier. The computing time is highly reduced on the optimal selection of examples in incremental learning process.

title: Detecting Projected Outliers in High-Dimensional Data Streams
abstract: In this paper, we study the problem of projected outlier detection in high dimensional data streams and propose a new technique, called Stream Projected Ouliter deTector (SPOT), to identify outliers embedded in subspaces. Sparse Subspace Template (SST), a set of subspaces obtained by unsupervised and/or supervised learning processes, is constructed in SPOT to detect projected outliers effectively. Multi-Objective Genetic Algorithm (MOGA) is employed as an effective search method for finding outlying subspaces from training data to construct SST. SST is able to carry out online self-evolution in the detection stage to cope with dynamics of data streams. The experimental results demonstrate the efficiency and effectiveness of SPOT in detecting outliers in high-dimensional data streams.