We investigate the problem of creating fast evacuation plans for buildings that are modeled as grid polygons, possibly containing exponentially many cells. We study this problem in two contexts: the “confluent” context in which the routes to exits remain fixed over time, and the “non-confluent” context in which routes may change. Confluent evacuation plans are simpler to carry out, as they allo...

CARP: confluent and reticulated papillomatosis PP: prurigo pigmentosa INTRODUCTION Prurigo pigmentosa (PP) is an uncommon, acquired inflammatory disorder with a predilection for young adults of Asian descent. This condition is manifested by highly pruritic, reticulated, and erythematous papules that resolve with hyperpigmentation. Multiple cases of PP have been reported since its initial descri...

We prove that iterations of confluent supersymmetric transformations (confluent SUSY chains) in quantum mechanics can be represented through Wronskian determinants. It is further shown that the latter Wronskian representation remains valid, if the SUSY chain is built from arbitrary combinations of confluent and non-confluent subchains. In addition, we obtain an integral representation of genera...

A tableau calculus is proof confluent if every partial tableau proof for an unsatisfiable formula can be extended to a closed tableau. A rule application may be redundant but it can never prevent the construction of a proof; there are no “dead ends” in the proof search. Proof confluence is a prerequisite of (a) backtrackingfree proof search and (b) the generation of counter examples to non-theo...

In process semantics of Petri Net, a non-sequential process is a concurrent run of the system represented in a partial order-like structure. For transition systems it is possible to define a similar notion of concurrent run by utilising the idea of confluence. Basically a confluent process is an acyclic confluent transition system that is a partial unfolding of the original system. Given a non-...

This work is concerned with basic issues of the design of calculi and proof procedures for first-order connection methods and tableaux calculi. Proof procedures for these type of calculi developed so far suffer from not exploiting proof confluence, and very often unnecessarily rely on a heavily backtrack oriented control regime. As a new result, we present a variant of a connection calculus and...

We define strict confluent drawing, a form of confluent drawing in which the existence of an edge is indicated by the presence of a smooth path through a system of arcs and junctions (without crossings), and in which such a path, if it exists, must be unique. We prove that it is NP-complete to determine whether a given graph has a strict confluent drawing but polynomial to determine whether it ...

OBJECTIVE To evaluate the in vivo technical feasibility, efficiency, and safety of switching bipolar (SB) and switching monopolar (SM) radiofrequency ablation (RFA) as a no-touch ablation technique in the porcine liver. MATERIALS AND METHODS The animal care and use committee approved this animal study and 16 pigs were used in two independent experiments. In the first experiment, RFA was perfo...

Some liver allograft recipients with hepatitis C virus (HCV) infection develop hyperbilirubinemia, which might be the result of a cholestatic variant of hepatitis C. We evaluated all liver biopsy samples from 6 liver transplant recipients who had polymerase chain reaction-positive HCV infection and histologic evidence of hepatitis and jaundice and compared them with liver biopsy samples from a ...

The present article reveals important properties of the confluent Heun’s functions. We derive a set of novel relations for confluent Heun’s functions and their derivatives of arbitrary order. Specific new subclasses of confluent Heun’s functions are introduced and studied. A new alternative derivation of confluent Heun’s polynomials is presented. MSC: 33E15, 33E20, 33E30