Coevolution of variability models and related software artifacts

Variant-rich software systems offer a large degree of customization, allowing users to configure the target system according to their preferences and needs. Facing high degrees of variability, these systems often employ variability models to explicitly capture user-configurable features (e.g., systems options) and the constraints they impose. The explicit representation of features allows them to be referenced in different variation points across different artifacts, enabling the latter to vary according to specific feature selections. In such settings, the evolution of variability models interplays with the evolution of related artifacts, requiring the two to evolve together, or coevolve. Interestingly, little is known about how such coevolution occurs in real-world systems, as existing research has focused mostly on variability evolution as it happens in variability models only. Furthermore, existing techniques supporting variability evolution are usually validated with randomly-generated variability models or evolution scenarios that do not stem from practice. As the community lacks a deep understanding of how variability evolution occurs in real-world systems and how it relates to the evolution of different kinds of software artifacts, it is not surprising that industry reports existing tools and solutions ineffective, as they do not handle the complexity found in practice. Attempting to mitigate this overall lack of knowledge and to support tool builders with insights on how variability models coevolve with other artifact types, we study a large and complex real-world variant-rich software system: the Linux kernel. Specifically, we extract variability-coevolution patterns capturing changes in the variability model of the Linux kernel with subsequent changes in Makefiles and C source code. From the analysis of the patterns, we report on findings concerning evolution principles found in the kernel, and we reveal deficiencies in existing tools and theory when handling changes captured by our patterns.     

Adding flexibility to workflows through incremental planning

Workflow management systems usually interpret a workflow definition rigidly. However, there are real life situations where users should be allowed to deviate from the prescribed static workflow definition for various reasons, including lack of information, unavailability of the required resources and unanticipated situations. Furthermore, workflow complexity may grow exponentially if all possible combinations of anticipated scenarios must be compiled into the workflow definition. To flexibilize workflow execution and help reduce workflow complexity, this paper proposes a dual strategy that combines a library of predefined typical workflows with a planner mechanism capable of incrementally synthesizing new workflows, at execution time. This dual strategy is motivated by the difficulty of designing emergency plans, modeled as workflows, which account for real-life complex crisis or accident scenarios.     

Using patterns to design rules in workflows

In order to design workflows in changing and dynamic environments, a flexible, correct, and rapid realization of models of the activity flow is required. In particular, techniques are needed to design workflows capable of adapting themselves effectively when exceptional situations occur during process execution. The authors present an approach to flexible workflow design based on rules and patterns developed in the framework of the WIDE project. Rules allow a high degree of flexibility during workflow design by modeling exceptional aspects of the workflow separately from the main activity flow. Patterns model frequently occurring exceptional situations in a generalized way by providing the designer with skeletons of rules and suggestions about their instantiation, together with indications on relationships with other rules, with the activity flow, and with related information. Pattern based design relies on a pattern catalog containing patterns to be reused and on a formal basis for specializing and instantiating available patterns     

Application of if-conversion to verification and optimization of workflows

Based on the workflow analysis graphs proposed in [1] and the well-known if-conversion method [2], a new algorithm of workflow verification is developed. This algorithm is based on the Boolean algebra principles, which is reflected in its name—Boolean Verification Algorithm (BVA). The BVA operates with arbitrary overlapping structures of the graph and with cycles. In the case of dense graphs, the time complexity of the algorithm does not exceed that of most other algorithms of workflow verification [3–6]. In the course of verification, the BVA determines an execution condition for each node of the graph, which makes it possible to create an additional algorithm of workflow optimization. Unlike the well-known algorithms of structural workflow optimization based on pattern transformations [7, 8], the proposed optimization algorithm allows for maximum (within a cycle) parallelization of workflows containing arbitrary overlapping structures.     

Inheritance of workflows: an approach to tackling problems related to change

Inheritance is one of the key issues of object-orientation. The inheritance mechanism allows for the definition of a subclass which inherits the features of a specific superclass. When adapting a workflow process definition to specific needs (ad-hoc change) or changing the structure of the workflow process as a result of reengineering efforts (evolutionary change), inheritance concepts are useful to check whether the new workflow process inherits some desirable properties of the old workflow process. Today's workflow management systems have problems dealing with both ad-hoc changes and evolutionary changes. As a result, a workflow management system is not used to support dynamically changing workflow processes or the workflow processes are supported in a rigid manner, i.e., changes are not allowed or handled outside of the workflow management system. In this paper, we propose inheritance-preserving transformation rules for workflow processes and show that these rules can be used to avoid problems such as the “dynamic-change bug.” The dynamic-change bug refers to errors introduced by migrating a case (i.e., a process instance) from an old process definition to a new one. A transfer from an old process to a new process can lead to duplication of work, skipping of tasks, deadlocks, and livelocks. Restricting change to the inheritance-preserving transformation rules guarantees transfers without any of these problems. Moreover, the transformation rules can also be used to extract aggregate management information in case more than one version of a workflow process cannot be avoided.     

A two-layered approach to communicative artifacts

A key issue in social intelligence design is the realization of artifacts that can fluently communicate with people. Thus, we proposed a two-layered approach to enhance a robot’s capacity of involvement and engagement. The upper layer flexibly controls social interaction by dynamic Bayesian networks (DBN) representing social interaction patterns. The lower layer improves the robustness of the system by detecting rhythmic and repetitive gestures. We designed a listener robot that can follow and record humans’ explanation on how to assemble and/or disassemble a bicycle. The implementation of this system is described by assembling the key algorithms presented in this paper.     

A flexible deadline-driven resource provisioning and scheduling algorithm for multiple workflows with VM sharing protocol on WaaS-cloud

The Journal of Supercomputing - Maximized deployment of workflows in the research organizations has motivated the emergence of multi-tenant environment that offer these workflows deployment as a...     

Using cognitive artifacts to understand distributed cognition

Studies of patient safety have identified gaps in current work including the need for research about communication and information sharing among healthcare providers. They have also encouraged the use of decision support tools to improve human performance. Distributed cognition is the shared awareness of goals, plans, and details that no single individual grasps. Cognitive artifacts are objects such as: schedules, display boards, lists, and worksheets that form part of a distributed cognition. Cognitive artifacts that are related to operating room (OR) scheduling include: the availabilities sheet, master schedule, OR graph, and OR board. All provide a "way in" to understand how teams in the acute care setting dynamically plan and manage the balance between demand for care and the resources available to provide it. This work has import for the way that information technology supports the organization, management, and use of healthcare resources. Better computer-supported cognitive artifacts will benefit patient safety by making teamwork processes, planning, communications, and resource management more resilient.     

Joint multiple parameters estimation for coherent chirp signals using vector sensor array

In this paper, an algorithm is proposed to estimate starting frequency （SF）, chirp rate （CR）, 2-D direction-of-arrivals （DOA） and polarization of coherent chirp signals with vector sensor arrays. The fractional Fourier transformation （FRFT） is used to estimate SF and CR of chirp signals in this method. And a new correlation matrix is reconstructed to suppress the noise. The property of the vector sensor array is employed to solve the problem of insufficient rank from signal coherence. The L-shaped uniform array of expend aperture is used to improve the precision of es- timation, and the method of solving the ambiguity of angle under the condition of coherent signals is presented. The performance of this algorithm is compared with that of spatial smoothing method to verify the efficacy of this approach.     

A probabilistic approach to modeling and estimating the QoS of web-services-based workflows

Web services promise to become a key enabling technology for B2B e-commerce. One of the most-touted features of Web services is their capability to recursively construct a Web service as a workflow of other existing Web services. The quality of service (QoS) of Web-services-based workflows may be an essential determinant when selecting constituent Web services and determining the service-level agreement with users. To make such a selection possible, it is essential to estimate the QoS of a WS workflow based on the QoSs of its constituent WSs. In the context of WS workflow, this estimation can be made by a method called QoS aggregation. While most of the existing work on QoS aggregation treats the QoS as a deterministic value, we argue that due to some uncertainty related to a WS, it is more realistic to model its QoS as a random variable, and estimate the QoS of a WS workflow probabilistically. In this paper, we identify a set of QoS metrics in the context of WS workflows, and propose a unified probabilistic model for describing QoS values of a broader spectrum of atomic and composite Web services. Emulation data are used to demonstrate the efficiency and accuracy of the proposed approach.     

LCD models to analyze and simulate motion artifacts

Abstract— In this paper, two models to evaluate the temporal behavior of liquid‐crystal displays are described: a model assuming a linear display behavior and a model that incorporates non‐linear effects. For the linear temporal model, it can be predicted that the response time starts to contribute to motion blur when it is longer than one‐sixth of the hold time and becomes dominant when it is longer than eight times the hold time. The non‐linear model can be used to visualize the appearance of effects that cannot be determined via linear system theory. Also, some means to reduce display artifacts are described and its impact is illustrated. Although the main focus in this article is on the temporal behavior of liquid‐crystal displays, the spatial properties defined by the pixel structure can be simulated as well. A formula for the spatio‐temporal display behavior is given, which can be evaluated numerically to simulate the perceived image for arbitrary image‐sequence input material.     

On verification of nested workflows with extra constraints: From theory to practice

Workflows are used to formally describe processes of various types such as business and manufacturing processes. One of the critical tasks of workflow management is automated discovery of possible flaws in the workflow – workflow verification. In this paper, we formalize the problem of workflow verification as the problem of verifying that there exists a feasible process for each task in the workflow. This problem is tractable for nested workflows that are the workflows with a hierarchical structure similar to hierarchical task networks in planning. However, we show that if extra synchronization, precedence, or causal constraints are added to the nested structure, the workflow verification problem becomes NP-complete. We present a workflow verification algorithm for nested workflows with extra constraints that is based on constraint satisfaction techniques and exploits an incremental temporal reasoning algorithm. We then experimentally demonstrate efficiency of the proposed techniques on randomly generated workflows with various structures and sizes. The paper is concluded by notes on exploiting the presented techniques in the application FlowOpt for modeling, optimizing, visualizing, and analyzing production workflows.     

A hybrid approach to scheduling real-time IoT workflows in fog and cloud environments

Multimedia Tools and Applications - In this paper, we propose a hybrid fog and cloud-aware heuristic for the dynamic scheduling of multiple real-time Internet of Things (IoT) workflows in a...     

A containerized task clustering for scheduling workflows to utilize processors and containers on clouds

The Journal of Supercomputing - Recent advancements of virtualization technologies for parallel processing involve scheduling containerized tasks in a workflow. Since a container can include...     

多组关联SQL SERVER 数据表删除功能的设计与实现

论述了基于网络的数字化资源信息系统中信息维护的一个重要功能的,即数据信息删功能的设计与实现。根据装备的树型信息组织体系结构 客户端的浏览功能。构造了两组SQL SERVER数据表,介绍了数据表的构成,根据每组表的特点论述了删除功能的实现思路,并给出了数据表删除功能的流程图。     

The DOPLER meta-tool for decision-oriented variability modeling: a multiple case study

The variability of a product line is typically defined in models. However, many existing variability modeling approaches are rigid and don’t allow sufficient domain-specific adaptations. We have thus been developing a flexible and extensible approach for defining product line variability models. Its main purposes are to guide stakeholders through product derivation and to automatically generate product configurations. Our approach is supported by the DOPLER (Decision-Oriented Product Line Engineering for effective Reuse) meta-tool that allows modelers to specify the types of reusable assets, their attributes, and dependencies for their specific system and context. The aim of this paper is to investigate the suitability of our approach for different domains. More specifically, we explored two research questions regarding the implementation of variability and the utility of DOPLER for variability modeling in different domains. We conducted a multiple case study consisting of four cases in the domains of industrial automation systems and business software. In each of these case studies we analyzed variability implementation techniques. Experts from our industry partners then developed domain-specific meta-models, tool extensions, and variability models for their product lines using DOPLER. The four cases demonstrate the flexibility of the DOPLER approach and the extensibility and adaptability of the supporting meta tool.     

Co-designing HPC-systems by computing capabilities and management flexibility to accommodate bioinformatic workflows at different complexity levels

The Journal of Supercomputing - The field of biology is producing data faster than ever before. To approach its analysis efficiently, one can take advantage of a systematic symbiosis between the...     

A coherent computational approach to model bottom-up visual attention

Visual attention is a mechanism which filters out redundant visual information and detects the most relevant parts of our visual field. Automatic determination of the most visually relevant areas would be useful in many applications such as image and video coding, watermarking, video browsing, and quality assessment. Many research groups are currently investigating computational modeling of the visual attention system. The first published computational models have been based on some basic and well-understood human visual system (HVS) properties. These models feature a single perceptual layer that simulates only one aspect of the visual system. More recent models integrate complex features of the HVS and simulate hierarchical perceptual representation of the visual input. The bottom-up mechanism is the most occurring feature found in modern models. This mechanism refers to involuntary attention (i.e., salient spatial visual features that effortlessly or involuntary attract our attention). This paper presents a coherent computational approach to the modeling of the bottom-up visual attention. This model is mainly based on the current understanding of the HVS behavior. Contrast sensitivity functions, perceptual decomposition, visual masking, and center-surround interactions are some of the features implemented in this model. The performances of this algorithm are assessed by using natural images and experimental measurements from an eye-tracking system. Two adequate well-known metrics (correlation coefficient and Kullbacl-Leibler divergence) are used to validate this model. A further metric is also defined. The results from this model are finally compared to those from a reference bottom-up model.