oalib

Publish in OALib Journal

ISSN: 2333-9721

APC: Only $99

Submit

Any time

2020 ( 15 )

2019 ( 758 )

2018 ( 879 )

2017 ( 859 )

Custom range...

Search Results: 1 - 10 of 494957 matches for " M. B. Avanzini "
All listed articles are free for downloading (OA Articles)
Page 1 /494957
Display every page Item
Efficient Implementation of Rewriting Revisited Technical Report
Martin Avanzini,Georg Moser
Computer Science , 2010,
Abstract: Recently, many techniques have been introduced that allow the (automated) classification of the runtime complexity of term rewrite systems (TRSs for short). In earlier work, the authors have shown that for confluent TRSs, innermost polynomial runtime complexity induces polytime computability of the functions defined. In this paper, we generalise the above result to full rewriting. Following our previous work, we exploit graph rewriting. We give a new proof of the adequacy of graph rewriting for full rewriting that allows for a precise control of the resources copied. In sum we completely describe an implementation of rewriting on a Turing machine (TM for short). We show that the runtime complexity of the TRS and the runtime complexity of the TM is polynomially related. Our result strengthens the evidence that the complexity of a rewrite system is truthfully represented through the length of derivations. Moreover our result allows the classification of non-deterministic polytime-computation based on runtime complexity analysis of rewrite systems.
A Combination Framework for Complexity
Martin Avanzini,Georg Moser
Computer Science , 2013,
Abstract: In this paper we present a combination framework for polynomial complexity analysis of term rewrite systems. The framework covers both derivational and runtime complexity analysis. We present generalisations of powerful complexity techniques, notably a generalisation of complexity pairs and (weak) dependency pairs. Finally, we also present a novel technique, called dependency graph decomposition, that in the dependency pair setting greatly increases modularity. We employ the framework in the automated complexity tool TCT. TCT implements a majority of the techniques found in the literature, witnessing that our framework is general enough to capture a very brought setting.
A New Term Rewriting Characterisation of ETIME functions
Martin Avanzini,Naohi Eguchi
Computer Science , 2013,
Abstract: Adopting former term rewriting characterisations of polytime and exponential-time computable functions, we introduce a new reduction order, the Path Order for ETIME (POE* for short), that is sound and complete for ETIME computable functions. The proposed reduction order for ETIME makes contrasts to those related complexity classes clear.
Polynomial Path Orders: A Maximal Model
Martin Avanzini,Georg Moser
Computer Science , 2012,
Abstract: This paper is concerned with the automated complexity analysis of term rewrite systems (TRSs for short) and the ramification of these in implicit computational complexity theory (ICC for short). We introduce a novel path order with multiset status, the polynomial path order POP*. Essentially relying on the principle of predicative recursion as proposed by Bellantoni and Cook, its distinct feature is the tight control of resources on compatible TRSs: The (innermost) runtime complexity of compatible TRSs is polynomially bounded. We have implemented the technique, as underpinned by our experimental evidence our approach to the automated runtime complexity analysis is not only feasible, but compared to existing methods incredibly fast. As an application in the context of ICC we provide an order-theoretic characterisation of the polytime computable functions. To be precise, the polytime computable functions are exactly the functions computable by an orthogonal constructor TRS compatible with POP*.
Dependency Pairs and Polynomial Path Orders
Martin Avanzini,Georg Moser
Computer Science , 2009,
Abstract: We show how polynomial path orders can be employed efficiently in conjunction with weak innermost dependency pairs to automatically certify polynomial runtime complexity of term rewrite systems and the polytime computability of the functions computed. The established techniques have been implemented and we provide ample experimental data to assess the new method.
Polynomial Path Orders
Martin Avanzini,Georg Moser
Computer Science , 2013, DOI: 10.2168/LMCS-9(4:9)2013
Abstract: This paper is concerned with the complexity analysis of constructor term rewrite systems and its ramification in implicit computational complexity. We introduce a path order with multiset status, the polynomial path order POP*, that is applicable in two related, but distinct contexts. On the one hand POP* induces polynomial innermost runtime complexity and hence may serve as a syntactic, and fully automatable, method to analyse the innermost runtime complexity of term rewrite systems. On the other hand POP* provides an order-theoretic characterisation of the polytime computable functions: the polytime computable functions are exactly the functions computable by an orthogonal constructor TRS compatible with POP*.
On Sharing, Memoization, and Polynomial Time (Long Version)
Martin Avanzini,Ugo Dal Lago
Computer Science , 2015,
Abstract: We study how the adoption of an evaluation mechanism with sharing and memoization impacts the class of functions which can be computed in polynomial time. We first show how a natural cost model in which lookup for an already computed value has no cost is indeed invariant. As a corollary, we then prove that the most general notion of ramified recurrence is sound for polynomial time, this way settling an open problem in implicit computational complexity.
Study of the performance of a large scale water-Cherenkov detector (MEMPHYS)
L. Agostino,M. Buizza-Avanzini,M. Dracos,D. Duchesneau,M. Marafini,M. Mezzetto,L. Mosca,T. Patzak,A. Tonazzo,N. Vassilopoulos
Physics , 2012, DOI: 10.1088/1475-7516/2013/01/024
Abstract: MEMPHYS (MEgaton Mass PHYSics) is a proposed large-scale water Cherenkov experiment to be performed deep underground. It is dedicated to nucleon decay searches, neutrinos from supernovae, solar and atmospheric neutrinos, as well as neutrinos from a future Super-Beam or Beta-Beam to measure the CP violating phase in the leptonic sector and the mass hierarchy. A full simulation of the detector has been performed to evaluate its performance for beam physics. The results are given in terms of "Migration Matrices" of reconstructed versus true neutrino energy, taking into account all the experimental effects.
Future large-scale water-Cherenkov detector
L. Agostino,M. Buizza-Avanzini,M. Marafini,T. Patzak,A. Tonazzo,M. Dracos,N. Vassilopoulos,D. Duchesneau,M. Mezzetto,L. Mosca
Physics , 2013, DOI: 10.1103/PhysRevSTAB.16.061001
Abstract: MEMPHYS (MEgaton Mass PHYSics) is a proposed large-scale water-Cherenkov experiment to be performed deep underground. It is dedicated to nucleon decay searches and the detection of neutrinos from supernovae, solar, and atmospheric neutrinos, as well as neutrinos from a future beam to measure the CP violating phase in the leptonic sector and the mass hierarchy. This paper provides an overview of the latest studies on the expected performance of MEMPHYS in view of detailed estimates of its physics reach, mainly concerning neutrino beams.
Aortitis requiring aortic repair associated with glaucoma, thyroiditis, glaucoma, and neuropathy: case report
Claudia St?llberger, Marion Avanzini, Aileen Hanafin, Ramona Sanani, Georg Wieselthaler, Nikolaus Wick, Günther Bayer, Günther M?lzer, Josef Finsterer
Journal of Cardiothoracic Surgery , 2011, DOI: 10.1186/1749-8090-6-74
Abstract: Aortitis of the ascending aorta may be due to infectious and non-infectious causes, comprising several systemic disorders [1,2]. Aortitis, associated with glaucoma, thyroiditis, pericarditis, pleural effusion and neuropathy with prompt clinical response to glucocorticoids has not been described so far.A 63-year old HIV-negative Iranian female was hospitalized in May 2004 because of fatigue, undulating fever, night sweats, and weight loss starting 8 weeks before. In 1991 and 1992 she had undergone bilateral iridectomy because of glaucoma. She has had 2 uneventful pregnancies and wan through menopause at the age of 52. Twenty-seven years ago, an intrauterine device (IUD) had been implanted but never been removed. She smoked 20 cigarettes/day.Physical examination was normal, the blood-pressure was 130/75 mmHg bilaterally. Blood tests showed normochromic anaemia (haemoglobin 10.1 g/dl, normal >12.0), elevated CRP levels (12.3 mg/dl, normal <0.6) and an increased erytrocyte sedimentation rate (110 mm, normal <20). Blood cultures remained negative. Stool culture did not grow any pathogens. Antinuclear antibodies, their subsets and antineutrophilic cytoplasmic antibodies were negative. Antibodies against smooth muscle cells were repeatedly positive. Serologic tests for Treponema pallidum, Brucella abortus, Brucella melitensis, Francisella tularensis, Yersinia enterocolitica, Yersinia pseudotuberculosis, Bartonella henselae, Borrelia burgdorferi, Coxiella burnetti, Ehrlichia, Leptospira, Mycoplasma pneumoniae and Ureaplasma urealyticum were negative. Agglutination reaction with Salmonella-H unspecified was 1: 320 and with Salmonella-HD 1: 1280. Chlamydia SP-IgA and IgG Antibodies were repeatedly positive. HLA-B27 testing was negative, while an HLA-DR4 15(2) allele was assessed. Computed-tomography (CT) and magnetic-resonance-imaging (MRI) of the chest showed an ectatic ascending aorta (50 mm) with diffusely thickened walls (Figure 1). She received an empirical antibiotic th
Page 1 /494957
Display every page Item


Home
Copyright © 2008-2017 Open Access Library. All rights reserved.