2,062 research outputs found

    The Geometry of Timed PV Programs

    Get PDF
    AbstractWe introduce a real-time extension of the PV language: A timed PV program consists of a number of timed automata which synchronize by locking and releasing common resources. We give a geometric semantics to such programs in terms of local po-spaces, and we work towards making the established geometric techniques available for detecting deadlocks and unsafe configurations in timed PV programs

    Design, Commissioning and Performance of the PIBETA Detector at PSI

    Full text link
    We describe the design, construction and performance of the PIBETA detector built for the precise measurement of the branching ratio of pion beta decay, pi+ -> pi0 e+ nu, at the Paul Scherrer Institute. The central part of the detector is a 240-module spherical pure CsI calorimeter covering 3*pi sr solid angle. The calorimeter is supplemented with an active collimator/beam degrader system, an active segmented plastic target, a pair of low-mass cylindrical wire chambers and a 20-element cylindrical plastic scintillator hodoscope. The whole detector system is housed inside a temperature-controlled lead brick enclosure which in turn is lined with cosmic muon plastic veto counters. Commissioning and calibration data were taken during two three-month beam periods in 1999/2000 with pi+ stopping rates between 1.3*E3 pi+/s and 1.3*E6 pi+/s. We examine the timing, energy and angular detector resolution for photons, positrons and protons in the energy range of 5-150 MeV, as well as the response of the detector to cosmic muons. We illustrate the detector signatures for the assorted rare pion and muon decays and their associated backgrounds.Comment: 117 pages, 48 Postscript figures, 5 tables, Elsevier LaTeX, submitted to Nucl. Instrum. Meth.

    Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS

    Full text link
    Vector Addition Systems with States (VASS) provide a well-known and fundamental model for the analysis of concurrent processes, parameterized systems, and are also used as abstract models of programs in resource bound analysis. In this paper we study the problem of obtaining asymptotic bounds on the termination time of a given VASS. In particular, we focus on the practically important case of obtaining polynomial bounds on termination time. Our main contributions are as follows: First, we present a polynomial-time algorithm for deciding whether a given VASS has a linear asymptotic complexity. We also show that if the complexity of a VASS is not linear, it is at least quadratic. Second, we classify VASS according to quantitative properties of their cycles. We show that certain singularities in these properties are the key reason for non-polynomial asymptotic complexity of VASS. In absence of singularities, we show that the asymptotic complexity is always polynomial and of the form Θ(nk)\Theta(n^k), for some integer kdk\leq d, where dd is the dimension of the VASS. We present a polynomial-time algorithm computing the optimal kk. For general VASS, the same algorithm, which is based on a complete technique for the construction of ranking functions in VASS, produces a valid lower bound, i.e., a kk such that the termination complexity is Ω(nk)\Omega(n^k). Our results are based on new insights into the geometry of VASS dynamics, which hold the potential for further applicability to VASS analysis.Comment: arXiv admin note: text overlap with arXiv:1708.0925

    A plan for spacecraft automated rendezvous

    Get PDF
    An automated rendezvous approach has been developed that utilizes advances in technology to reduce real-time/near real-time flight operations support personnel to an acceptable level that is near the minimum without jeopardizing the success of the mission. The on-board flight targeting uses a rule-based system to select the pursuit vehicle phasing orbits and uses precise navigation updates from the pursuit/target spacecraft made possible by the global positioning system receivers/processors on both spacecraft to adjust the phasing orbits and achieve rendezvous. The ascent-to-orbit targeting for the pursuit vehicle has been successfully decoupled from the on-orbit orbit transfer phasing targeting. Typical launch window data have been developed for the heavy lift launch vehicle and cargo transfer vehicle for a Space Station Freedom rendezvous mission

    Neural Models of Temporally Organized Behaviors: Handwriting Production and Working Memory

    Full text link
    Advanced Research Projects Agency (ONR N00014-92-J-4015); Office of Naval Research (N00014-91-J-4100, N00014-92-J-1309

    "TNOs are Cool": A survey of the trans-Neptunian region X. Analysis of classical Kuiper belt objects from Herschel and Spitzer observations

    Get PDF
    The classical Kuiper belt contains objects both from a low-inclination, presumably primordial, distribution and from a high-inclination dynamically excited population. Based on a sample of classical TNOs with observations at thermal wavelengths we determine radiometric sizes, geometric albedos and thermal beaming factors as well as study sample properties of dynamically hot and cold classicals. Observations near the thermal peak of TNOs using infra-red space telescopes are combined with optical magnitudes using the radiometric technique with near-Earth asteroid thermal model (NEATM). We have determined three-band flux densities from Herschel/PACS observations at 70.0, 100.0 and 160.0 μ\mum and Spitzer/MIPS at 23.68 and 71.42 μ\mum when available. We have analysed 18 classical TNOs with previously unpublished data and re-analysed previously published targets with updated data reduction to determine their sizes and geometric albedos as well as beaming factors when data quality allows. We have combined these samples with classical TNOs with radiometric results in the literature for the analysis of sample properties of a total of 44 objects. We find a median geometric albedo for cold classical TNOs of 0.14 and for dynamically hot classical TNOs, excluding the Haumea family and dwarf planets, 0.085. We have determined the bulk densities of Borasisi-Pabu (2.1 g/cm^3), Varda-Ilmare (1.25 g/cm^3) and 2001 QC298 (1.14 g/cm^3) as well as updated previous density estimates of four targets. We have determined the slope parameter of the debiased cumulative size distribution of dynamically hot classical TNOs as q=2.3 +- 0.1 in the diameter range 100<D<500 km. For dynamically cold classical TNOs we determine q=5.1 +- 1.1 in the diameter range 160<D<280 km as the cold classical TNOs have a smaller maximum size.Comment: 22 pages, 7 figures Accepted to be published in Astronomy and Astrophysic

    Improving Model-Based Software Synthesis: A Focus on Mathematical Structures

    Get PDF
    Computer hardware keeps increasing in complexity. Software design needs to keep up with this. The right models and abstractions empower developers to leverage the novelties of modern hardware. This thesis deals primarily with Models of Computation, as a basis for software design, in a family of methods called software synthesis. We focus on Kahn Process Networks and dataflow applications as abstractions, both for programming and for deriving an efficient execution on heterogeneous multicores. The latter we accomplish by exploring the design space of possible mappings of computation and data to hardware resources. Mapping algorithms are not at the center of this thesis, however. Instead, we examine the mathematical structure of the mapping space, leveraging its inherent symmetries or geometric properties to improve mapping methods in general. This thesis thoroughly explores the process of model-based design, aiming to go beyond the more established software synthesis on dataflow applications. We starting with the problem of assessing these methods through benchmarking, and go on to formally examine the general goals of benchmarks. In this context, we also consider the role modern machine learning methods play in benchmarking. We explore different established semantics, stretching the limits of Kahn Process Networks. We also discuss novel models, like Reactors, which are designed to be a deterministic, adaptive model with time as a first-class citizen. By investigating abstractions and transformations in the Ohua language for implicit dataflow programming, we also focus on programmability. The focus of the thesis is in the models and methods, but we evaluate them in diverse use-cases, generally centered around Cyber-Physical Systems. These include the 5G telecommunication standard, automotive and signal processing domains. We even go beyond embedded systems and discuss use-cases in GPU programming and microservice-based architectures
    corecore