Constraint-Flow Nets: A Model for Building Constraints from Resource Dependencies

The major research in the resource management literature focuses primarily on two complementary sub-problems: (1) specification languages for formulating resource requests and (2) constraint problems modelling allocation and scheduling. Both directions assume the knowledge of the underlying platform architecture and the dependencies it induces on the usage of the various resources. In this paper, we bridge this gap by introducing constraint-flow nets (cfNets). A cfNet is defined by a set of resources and dependencies between them, each dependency having an associated constraint schema. The model is inspired by Petri nets, with resources corresponding to places and dependencies—to transitions. Given an architecture of dependent resources, an initial resource request is propagated through the dependencies. The generated constraints are then conjuncted into the global allocation constraint. We study the notion of conflicts in cfNets and prove that for conflict-free cfNets the global allocation constraint can be constructed unambiguously. Furthermore, we provide an SMT-based algorithm for conflict detection and discuss the use of priorities to dynamically resolve conflicts at run-time. Finally, we illustrate the use of cfNets on a case study inspired by the Kalray MPPA architecture

Declarative Event-Based Workflow as Distributed Dynamic Condition Response Graphs

We present Dynamic Condition Response Graphs (DCR Graphs) as a declarative, event-based process model inspired by the workflow language employed by our industrial partner and conservatively generalizing prime event structures. A dynamic condition response graph is a directed graph with nodes representing the events that can happen and arrows representing four relations between events: condition, response, include, and exclude. Distributed DCR Graphs is then obtained by assigning roles to events and principals. We give a graphical notation inspired by related work by van der Aalst et al. We exemplify the use of distributed DCR Graphs on a simple workflow taken from a field study at a Danish hospital, pointing out their flexibility compared to imperative workflow models. Finally we provide a mapping from DCR Graphs to Buchi-automata.Comment: In Proceedings PLACES 2010, arXiv:1110.385

A 'snip' in time: what is the best age to circumcise?

<p>Abstract</p> <p>Background</p> <p>Circumcision is a common procedure, but regional and societal attitudes differ on whether there is a need for a male to be circumcised and, if so, at what age. This is an important issue for many parents, but also pediatricians, other doctors, policy makers, public health authorities, medical bodies, and males themselves.</p> <p>Discussion</p> <p>We show here that infancy is an optimal time for clinical circumcision because an infant's low mobility facilitates the use of local anesthesia, sutures are not required, healing is quick, cosmetic outcome is usually excellent, costs are minimal, and complications are uncommon. The benefits of infant circumcision include prevention of urinary tract infections (a cause of renal scarring), reduction in risk of inflammatory foreskin conditions such as balanoposthitis, foreskin injuries, phimosis and paraphimosis. When the boy later becomes sexually active he has substantial protection against risk of HIV and other viral sexually transmitted infections such as genital herpes and oncogenic human papillomavirus, as well as penile cancer. The risk of cervical cancer in his female partner(s) is also reduced. Circumcision in adolescence or adulthood may evoke a fear of pain, penile damage or reduced sexual pleasure, even though unfounded. Time off work or school will be needed, cost is much greater, as are risks of complications, healing is slower, and stitches or tissue glue must be used.</p> <p>Summary</p> <p>Infant circumcision is safe, simple, convenient and cost-effective. The available evidence strongly supports infancy as the optimal time for circumcision.</p

Mixed-Initiative Management of Online Calendars

Abstract. Calendar management has been recognized as a complex, highly personal type of activity, which must take individual preferences and constraints into account in the formulation of satisfactory schedules. Current calendar management services are affected by two limitations: most of them lack any reasoning capabilities and thus cannot help the user in the management of tight schedules, which make the allocation of new tasks particularly challenging. Others are too impositive because they proactively schedule events without involving the user in the decision process. In order to address such issues, we propose a mixed-initiative approach which enables the user to select the events to be considered, receive safe schedule suggestions from the system and select the preferred ones for revising a calendar. A peculiarity of our system is the fact that, in the suggestion of alternative schedules for an event, it searches for solutions which are very similar to the user’s current schedule, with the aim of limiting changes to her/his daily plans as much as possible. Our calendar management service is based on the exploitation of well-known Temporal Constraint Satisfaction Problems techniques, which guarantee the generation of safe scheduling solutions

Data management research at the Middle East Technical University

The Middle East Technical University (METU) (http://www.metu.edu.tr) is the leading technical university in Turkey. The department of Computer Engineering (http://www.ceng.metu.edu.tr) has twenty seven faculty members with PhDs, 550 undergraduate students and 165 graduate-students. The major research funding sources include the Scientific and Technical Research Council of Turkey (TÜBÍTAK), the European Commission, and the internal research funds of METU. Data management research conducted in the department is summarized in this article

Extended Model Driven Architecture to B Method (short version)

International audienceModel Driven Architecture (MDA) design approach proposes to separate design into two stages: implementation independent stage then an implementation-dependent one. This improves the reusability, the reusability, the standability, the maintainability, etc. Here we show how MDA can be augmented using a formal refinement approach: B method. Doing so enables to gradually refine the development from the abstract specification to the executing implementation; furthermore it permits to prove the coherence between components in low levels even if they are implemented in different technologies