Workflow Interruptions and Failed Action Regulation in Surgery Personnel

Background Workflow interruptions during surgery may cause a threat to patient's safety. Workflow interruptions were tested to predict failure in action regulation that in turn predicts near-accidents in surgery and related health care. Methods One-hundred-and-thirty-three theater nurses and physicians from eight Swiss hospitals participated in a cross-sectional questionnaire survey. The study participation rate was 43%. Results Structural equation modeling confirmed an indirect path from workflow interruptions through cognitive failure in action regulation on near-accidents (p < 0.05). The indirect path was stronger for workflow interruptions by malfunctions and task organizational blockages compared with workflow interruptions that were caused by persons. The indirect path remained meaningful when individual differences in conscientiousness and compliance with safety regulations were controlled. Conclusion Task interruptions caused by malfunction and organizational constraints are likely to trigger errors in surgery. Work redesign is recommended to reduce workflow interruptions by malfunction and regulatory constraints.

A systematized workflow for assessing land resources using readily available spatial datasets

Land degradation as well as land conservation maps at a (sub-) national scale are critical for pro-ject planning for sustainable land management. It has long been recognized that online accessible and low-cost raster data sets (e.g. Landsat imagery, SRTM-DEM’s) provide a readily available basis for land resource assessments for developing countries. However, choice of spatial, tempo-ral and spectral resolution of such data is often limited. Furthermore, while local expert knowl-edge on land degradation processes is abundant, difficulties are often encountered when linking existing knowledge with modern approaches including GIS and RS. The aim of this study was to develop an easily applicable, standardized workflow for preliminary spatial assessments of land degradation and conservation, which also allows the integration of existing expert knowledge. The core of the developed method consists of a workflow for rule-based land resource assess-ment. In a systematic way, this workflow leads from predefined land degradation and conserva-tion classes to field indicators, to suitable spatial proxy data, and finally to a set of rules for clas-sification of spatial datasets. Pre-conditions are used to narrow the area of interest. Decision tree models are used for integrating the different rules. It can be concluded that the workflow presented assists experts from different disciplines in col-laboration GIS/RS specialists in establishing a preliminary model for assessing land degradation and conservation in a spatially explicit manner. The workflow provides support when linking field indicators and spatial datasets, and when determining field indicators for groundtruthing.

Institutional Repository Workflow from Initial Inquiry to Repository Upload

A workflow flowchart on the verification steps involved in preparation to uploading assets to the University of Connecticut's institutional repository (http://digitalcommons.uconn.edu). This flowchart is geared towards assisting subject liaisons who also serve as series administrators for UConn@DigitalCommons.

Execution der An̄a Maria Karpffin : ihres Alters 28 Jahr, v. Unterdencken gebürtig, welche Zu Dahlhoffen ein Kind jämerl. ermordet und noch ein anders WochenKind gestohlen ...

Thomas Bäck sc. exc.

Vorstellung der scharpffen Execution, wie selbige an 6 Malefitz Personen in der Fürstlichen Statt Wohlau, den 27. April, vnd II July deß 1661. Jahrs, vollzogen worden : Von ihrem abscheulichen Verbrechen, meldet der Text weitläufftig

Original: Text fehlt. Risse u. kleinere Fehlstellen im Kupferstich

Keyserliche Execution vber die Aechter vnd Malefitz Personen in Franckfuhrt am Mayn ergangenn : 1616

Simon Severin Aegemann fecit Anno 1616[?]

Vorstellung der Execution, welche an den beyden Wallachischen Rebellen, Horia und Klotska, zu Karlsburg vollzogen worden

I. D. D. [d.i. wahrscheinl. Johann David Donnhäuser]

Warhaffte Contrafactur und Abbildung, deren ehmals Vornehm-Berühmten drey Ungarischen Grafen : nachmals aber an Ihrer Römischen Kayserl. Mayst. höchst-vergriffenen Rebellen, Nadasti, Serini und Frangipani, mit beygefügter ausführlicher Beschreibung, was massen selbige, dem billich-ergangenem Urtheil gemäß zur Execution gezogen, und den 30. April dieses 1671. Jahrs vom Leben zum Tod gebracht worden

Portr.-Medaillons d. Rebellen u. d. Hinrichtungsszenen

Parallel execution of Prolog programs: a survey

Since the early days of logic programming, researchers in the field realized the potential for exploitation of parallelism present in the execution of logic programs. Their high-level nature, the presence of nondeterminism, and their referential transparency, among other characteristics, make logic programs interesting candidates for obtaining speedups through parallel execution. At the same time, the fact that the typical applications of logic programming frequently involve irregular computations, make heavy use of dynamic data structures with logical variables, and involve search and speculation, makes the techniques used in the corresponding parallelizing compilers and run-time systems potentially interesting even outside the field. The objective of this article is to provide a comprehensive survey of the issues arising in parallel execution of logic programming languages along with the most relevant approaches explored to date in the field. Focus is mostly given to the challenges emerging from the parallel execution of Prolog programs. The article describes the major techniques used for shared memory implementation of Or-parallelism, And-parallelism, and combinations of the two. We also explore some related issues, such as memory management, compile-time analysis, and execution visualization.

Knowledge Management and Information Systems based on Workflow Technology

Knowledge management is critical for the success of virtual communities, especially in the case of distributed working groups. A representative example of this scenario is the distributed software development, where it is necessary an optimal coordination to avoid common problems such as duplicated work. In this paper the feasibility of using the workflow technology as a knowledge management system is discussed, and a practical use case is presented. This use case is an information system that has been deployed within a banking environment. It combines common workflow technology with a new conception of the interaction among participants through the extension of existing definition languages.

A new approach for publishing workflows: abstractions, standards, and linked data

In recent years, a variety of systems have been developed that export the workflows used to analyze data and make them part of published articles. We argue that the workflows that are published in current approaches are dependent on the specific codes used for execution, the specific workflow system used, and the specific workflow catalogs where they are published. In this paper, we describe a new approach that addresses these shortcomings and makes workflows more reusable through: 1) the use of abstract workflows to complement executable workflows to make them reusable when the execution environment is different, 2) the publication of both abstract and executable workflows using standards such as the Open Provenance Model that can be imported by other workflow systems, 3) the publication of workflows as Linked Data that results in open web accessible workflow repositories. We illustrate this approach using a complex workflow that we re-created from an influential publication that describes the generation of 'drugomes'.

Cooperative Task Execution between Modular Robots Based on Tight-Loose Cooperation Strategies

The complexity in the execution of cooperative tasks is high due to the fact that a robot team requires movement coordination at the beginning of the mission and continuous coordination during the execution of the task. A variety of techniques have been proposed to give a solution to this problem assuming standard mobile robots. This work focuses on presenting the execution of a cooperative task by a modular robot team. The complexity of the task execution increases due to the fact that each robot is composed of modules which have to be coordinated in a proper way to successfully work. A combined tight and loose cooperation strategy is presented and a bar-pushing example is used as a cooperative task to show the performance of this type of system.

Towards execution time estimation in abstract machine-based languages

Abstract machines provide a certain separation between platformdependent and platform-independent concerns in compilation. Many of the differences between architectures are encapsulated in the speciflc abstract machine implementation and the bytecode is left largely architecture independent. Taking advantage of this fact, we present a framework for estimating upper and lower bounds on the execution times of logic programs running on a bytecode-based abstract machine. Our approach includes a one-time, programindependent proflling stage which calculates constants or functions bounding the execution time of each abstract machine instruction. Then, a compile-time cost estimation phase, using the instruction timing information, infers expressions giving platform-dependent upper and lower bounds on actual execution time as functions of input data sizes for each program. Working at the abstract machine level makes it possible to take into account low-level issues in new architectures and platforms by just reexecuting the calibration stage instead of having to tailor the analysis for each architecture and platform. Applications of such predicted execution times include debugging/veriflcation of time properties, certiflcation of time properties in mobile code, granularity control in parallel/distributed computing, and resource-oriented specialization.

Combining static analysis and profiling for estimating execution times

Effective static analyses have been proposed which infer bounds on the number of resolutions. These have the advantage of being independent from the platform on which the programs are executed and have been shown to be useful in a number of applications, such as granularity control in parallel execution. On the other hand, in distributed computation scenarios where platforms with different capabilities come into play, it is necessary to express costs in metrics that include the characteristics of the platform. In particular, it is specially interesting to be able to infer upper and lower bounds on actual execution times. With this objective in mind, we propose an approach which combines compile-time analysis for cost bounds with a one-time profiling of a given platform in order to determine the valúes of certain parameters for that platform. These parameters calibrate a cost model which, from then on, is able to compute statically time bound functions for procedures and to predict with a significant degree of accuracy the execution times of such procedures in that concrete platform. The approach has been implemented and integrated in the CiaoPP system.