Coordinating Large Distributed Process Structures

Representing a business process as interacting small processes has become feasible with data-centric business process management paradigms. These small processes have relations and, thereby, form a relational process structure. The interactions of processes within this relational process structure must be coordinated to arrive at a meaningful overall business goal. However, relational process structures may become arbitrarily large and, with cloud technology, they may additionally be distributed over multiple nodes. Coordination processes have been proposed to coordinate relational process structures, where processes have one-to-many and many-to-many relations at run-time. This paper shows how multiple coordination processes can be used in a decentralized fashion to coordinate large, distributed process structures. The main challenge is to effectively realize the coordination responsibility of each coordination process. Key components of the solution are the subsidiary principle and the hierarchy of the relational process structure. Moreover, from these key components and the technical properties of coordination processes, an implementation based on microservices was developed, which allows fast and concurrent enactment of multiple, decentralized coordination processes in large, distributed process structures

Coordinating Large Distributed Relational Process Structures

Representing a business process as a collaboration of interacting processes has become feasible with the emergence of data-centric business process management paradigms. Usually, these interacting processes have relations and, thereby, form a complex relational process structure. The interactions of processes within this relational process structure need to be coordinated to arrive at a meaningful overall business goal. However, relational process structures may become arbitrarily large. With the use of cloud technology, they may additionally be distributed over multiple nodes, allowing for scalability. Coordination processes have been proposed to coordinate relational process structures, where processes may have one-to-many and many-to-many relations at run-time. This paper shows how multiple coordination processes can be used in a decentralized fashion to more efficiently coordinate large, distributed process structures. The main challenge of using multiple coordination processes is to effectively realize the coordination responsibility of each coordination process. Key components of the solution are the subsidiary principle and the hierarchy of the relational process structure. Finally, an implementation of the coordination process concept based on microservices was developed, which allows for fast and concurrent enactment of multiple, decentralized coordination processes in large, distributed process structures

Worker Control in Worker Co-operatives?

This paper (presented at ICA Research Conference, Paris, May, 2015) is based on research conducted in the 1980s. It has been updated, and addresses the timeless questions: if worker co-operatives embody the principle “Labour hires Capital”, does this mean that in co-operatives workers are able to control their own jobs? Can new work relations be constructed from grassroots in a democratic fashion? It is based on five case studies, which present possibly the most challenges to a positive response to these questions. The paper develops a theory based analytical framework embracing three different levels of control, and identifying four factors limiting worker influence: expert power, imported rationalities and expectations, external financing, market relations. Given these “worst case” scenarios, the findings demonstrate achievements regarding work organisation, different forms of supervision, and terms and conditions of employment

Multiscale Design for Solid Freeform Fabrication

One of the advantages of solid freeform fabrication is the ability to fabricate complex structures on multiple scales, from the macroscale features of an overall part to the mesoscale topology of its internal architecture and even the microstructure or composition of the constituent material. This manufacturing freedom poses the challenge of designing across these scales, especially when a part with designed mesostructure is part of a larger system with changing requirements that propagate across scales. A setbased multiscale design method is presented for coordinating design across scales and reducing iterative redesign of SFF parts and their mesostructures. The method is applied to design a miniature unmanned aerial vehicle system. The system is decomposed into disciplinary subsystems and constituent parts, including wings with honeycomb mesostructures that are topologically tailored for stiffness and strength and fabricated with selective laser sintering. The application illustrates how the design of freeform parts can be coordinated more efficiently with the design of parent systems.Mechanical Engineerin

Exploring Meaningful Patient Engagement in ADAPTABLE (Aspirin Dosing: A Patient-centric Trial Assessing Benefits and Long-term Effectiveness).

BackgroundGenuine patient engagement can improve research relevance, impact and is required for studies using the National Patient-Centered Clinical Research Network including major multicenter research projects. It is unclear, however, how best to integrate patients into governance of such projects.MethodsADAPTABLE (Aspirin Dosing: A Patient-centric Trial Assessing Benefits and Long-term Effectiveness) is the first major multicenter research project to be conducted in National Patient-Centered Clinical Research Network. Here, we provide a description of how we implemented patient engagement in ADAPTABLE thus far, including a description of committee structures and composition, first-hand patient testimonials, specific contributions, and lessons learned during the planning and early implementation of ADAPTABLE.ResultsWe recruited 1 patient leader from 6 of the 7 enrolling networks to serve on a Patient Review Board for ADAPTABLE, supported the Board with an experienced patient engagement team including an "investigator-advocate" not otherwise involved in the trial, and facilitated bidirectional communication between the Board and ADAPTABLE Coordinating Center. The Board has reviewed and provided substantial input on the informed consent procedure, recruitment materials, patient portal design, and study policy including compensation of participants. Although it was "too late" for some suggested modifications, most modifications suggested by the patient leaders have been implemented, and they are enthusiastic about the study and their role. The patient leaders also attend Steering and Executive Committee calls; these experiences have been somewhat less productive.ConclusionsWith adequate support, a cadre of committed patient leaders can provide substantial value to design and implementation of a major multicenter clinical trial

Towards structured sharing of raw and derived neuroimaging data across existing resources

Data sharing efforts increasingly contribute to the acceleration of scientific discovery. Neuroimaging data is accumulating in distributed domain-specific databases and there is currently no integrated access mechanism nor an accepted format for the critically important meta-data that is necessary for making use of the combined, available neuroimaging data. In this manuscript, we present work from the Derived Data Working Group, an open-access group sponsored by the Biomedical Informatics Research Network (BIRN) and the International Neuroimaging Coordinating Facility (INCF) focused on practical tools for distributed access to neuroimaging data. The working group develops models and tools facilitating the structured interchange of neuroimaging meta-data and is making progress towards a unified set of tools for such data and meta-data exchange. We report on the key components required for integrated access to raw and derived neuroimaging data as well as associated meta-data and provenance across neuroimaging resources. The components include (1) a structured terminology that provides semantic context to data, (2) a formal data model for neuroimaging with robust tracking of data provenance, (3) a web service-based application programming interface (API) that provides a consistent mechanism to access and query the data model, and (4) a provenance library that can be used for the extraction of provenance data by image analysts and imaging software developers. We believe that the framework and set of tools outlined in this manuscript have great potential for solving many of the issues the neuroimaging community faces when sharing raw and derived neuroimaging data across the various existing database systems for the purpose of accelerating scientific discovery

Evaluating distributed cognitive resources for wayfinding in a desktop virtual environment.

As 3D interfaces, and in particular virtual environments, become increasingly realistic there is a need to investigate the location and configuration of information resources, as distributed in the humancomputer system, to support any required activities. It is important for the designer of 3D interfaces to be aware of information resource availability and distribution when considering issues such as cognitive load on the user. This paper explores how a model of distributed resources can support the design of alternative aids to virtual environment wayfinding with varying levels of cognitive load. The wayfinding aids have been implemented and evaluated in a desktop virtual environment

A customizable multi-agent system for distributed data mining

We present a general Multi-Agent System framework for distributed data mining based on a Peer-to-Peer model. Agent protocols are implemented through message-based asynchronous communication. The framework adopts a dynamic load balancing policy that is particularly suitable for irregular search algorithms. A modular design allows a separation of the general-purpose system protocols and software components from the specific data mining algorithm. The experimental evaluation has been carried out on a parallel frequent subgraph mining algorithm, which has shown good scalability performances