Graphs composed of node and link are the most common way of representing street networks for any analysis beyond pure visual representation. The intuitive primal approach to convert a physical street network into an abstract mathematical graph is mapping street intersections as nodes while mapping street segments between intersections as links connecting nodes in the graph. Correspondingly, a d...

It is generally recognized that 3-D models are compact representations for rendering. While pure image-based rendering techniques are capable of producing highly photorealistic outputs, the size of the input “model” is usually very large. The important issues in trading off geometry versus images include compactness of representation, photorealism of reconstructed views, and speed of rendering....

S1. AXIOMS AND ADDITIVE EXPECTED-UTILITY REPRESENTATION Let B = {b1 bK} denote the set of pure outcomes. Let ∆(B) denote the set of probability distributions on B. Finally, let denote a preference relation on the set of nonempty subsets of ∆(B), where this space is endowed with the Hausdorff topology. Let dh(x y) denote the Hausdorff distance between x and y .1 DLR (2001) considered the followi...

We prove that functions of intrinsic-mode type (a classical models for signals) behave essentially like holomorphic functions: adding a pure carrier frequency eint ensures that the anti-holomorphic part is much smaller than the holomorphic part ‖P−(f)‖L2 ‖P+(f)‖L2 . This enables us to use techniques from complex analysis, in particular the unwinding series. We study its stability and convergenc...

Let A be an arrangement of n complex hyperplanes. The fundamental group of the complement of A is determined by a braid monodromy homomorphism, α : Fs → Pn. Using the Gassner representation of the pure braid group, we find an explicit presentation for the Alexander invariant of A. From this presentation, we obtain combinatorial lower bounds for the ranks of the Chen groups of A. We also provide...

We propose a highly efficient "worm"-like cluster Monte Carlo algorithm for the quantum rotor model in the link-current representation. We explicitly prove detailed balance for the algorithm even in the presence of disorder. For the pure quantum rotor model with mu=0, the algorithm yields high- precision estimates for the critical point K(c)=0.333 05(5) and the correlation length exponent nu=0....

BACKGROUND This is to describe a restricted sensory syndrome of unique distribution due to thalamic infarct. CASE DESCRIPTION We report a case of pure sensory disturbance involving the left intraoral and perioral regions and the tips of the thumb and forefinger of the left hand. Magnetic resonance imaging revealed a small infarct in the contralateral thalamus, presumably affecting the nucleus...

We investigate the phase structure of pure SU(2) LGT at finite temperature in the mixed fundamental and adjoint representation modified with a Z2 monopole chemical potential. The decoupling of the finite temperature phase transition from unphysical zero temperature bulk phase transitions is analyzed with special emphasis on the continuum limit. The possible relation of the adjoint Polyakov loop...

This work describes one parametrization of quantum states and channels and several of its possible applications. This parametrization works in any dimension and there is an explicit algorithm which produces it. Included in the list of applications are a simple characterization of pure states, an explicit formula for one additive entropic quantity which does not require knowledge of eigenvalues,...

We propose a software architecture for user-cooperative systems, like knowledge systems. This architecture incorporates important notions for building up a context, such as cooperation, explanations and incremental knowledge acquisition. Our main concern in this paper is representation methodology. We show that the architecture can be realized as a pure first order theory, which we argue consti...