Steen Vester

Learn More
The incidence of bronchopleural fistula after stapling among 2,243 pulmonary resections at the Rush-Presbyterian-St. Luke's Medical Center has been reviewed. There were 35 fistulas in 1,773 stapled and in 470 sutured bronchi (segmentectomy, 2; lobectomy, 1; bilobectomy, 9; and pneumonectomy, 23). We have found that the stapler is expedient and simple to(More)
Model-checking the alternating-time temporal logics AT L and ATL∗ with incomplete information is undecidable for perfect recall semantics. However, when restricting to memoryless strategies the model-checking problem becomes decidable. In this paper we consider two other types of semantics based on finite-memory strategies. One where the memory size allowed(More)
We study the complexity of the model-checking problem for the branching-time logic CTL∗ and the alternating-time temporal logics ATL/ATL∗ in one-counter processes and one-counter games respectively. The complexity is determined for all three logics when integer weights are input in unary (non-succinct) and binary (succinct) as well as when the input formula(More)
OBJECTIVE To better appreciate the complex nature of the pediatric patient with tracheal stenosis due to congenital complete tracheal rings, we evaluated clinical presentation, methods of evaluation, necessity for surgical repair, associated anomalies, and outcome. DESIGN Retrospective study. PATIENTS Eighteen patients with long-segment tracheal(More)
An unusual case of transvaginal impalement is presented. At initial exploration the broad ligament and vagina were repaired. When bile drained from suction catheters reexploration revealed an injury to the duodenum and diaphragm. Wounds that penetrate the vagina may injure nonpelvic viscera. Vaginal penetrating wounds should be managed like other abdominal(More)
We describe the approach used to develop the multi-agent system of herders that competed as the Jason-DTU team at the Multi-Agent Programming Contest 2010. We also participated in 2009 with a system developed in the agent-oriented programming language Jason which is an extension of AgentSpeak. We used the implementation from 2009 as a foundation and(More)
We describe the solution used by the Python-DTU team in the Multi-Agent Programming Contest 2011, where the scenario was called Agents on Mars. We present our auction-based agreement algorithm and discuss our chosen strategy and our choice of technology used for implementing the system. Finally, we present an analysis of the results of the competition as(More)
We investigate a model for representing large multiplayer games, which satisfy strong symmetry properties. This model is made of multiple copies of an arena; each player plays in his own arena, and can partially observe what the other players do. Therefore, this game has partial information and symmetry constraints, which make the computation of Nash(More)