On the Sensitivity of a Hollow Sphere as a Multi-modal Resonant Gravitational Wave Detector

We present a numerical analysis to simulate the response of a spherical resonant gravitational wave detector and to compute its sensitivity. Under the assump- tion of optimal filtering, we work out the sensitivity curve for a sphere first taking into account only a single transducer, and then using a coherent analysis of the whole set of transducers.Comment: 24 pages, 11 figures, published versio

Which Classes of Origin Graphs Are Generated by Transducers.

We study various models of transducers equipped with origin information. We consider the semantics of these models as particular graphs, called origin graphs, and we characterise the families of such graphs recognised by streaming string transducers

XQuery Streaming by Forest Transducers

Streaming of XML transformations is a challenging task and only very few systems support streaming. Research approaches generally define custom fragments of XQuery and XPath that are amenable to streaming, and then design custom algorithms for each fragment. These languages have several shortcomings. Here we take a more principles approach to the problem of streaming XQuery-based transformations. We start with an elegant transducer model for which many static analysis problems are well-understood: the Macro Forest Transducer (MFT). We show that a large fragment of XQuery can be translated into MFTs --- indeed, a fragment of XQuery, that can express important features that are missing from other XQuery stream engines, such as GCX: our fragment of XQuery supports XPath predicates and let-statements. We then rely on a streaming execution engine for MFTs, one which uses a well-founded set of optimizations from functional programming, such as strictness analysis and deforestation. Our prototype achieves time and memory efficiency comparable to the fastest known engine for XQuery streaming, GCX. This is surprising because our engine relies on the OCaml built in garbage collector and does not use any specialized buffer management, while GCX's efficiency is due to clever and explicit buffer management.Comment: Full version of the paper in the Proceedings of the 30th IEEE International Conference on Data Engineering (ICDE 2014

Automata in SageMath---Combinatorics meet Theoretical Computer Science

The new finite state machine package in the mathematics software system SageMath is presented and illustrated by many examples. Several combinatorial problems, in particular digit problems, are introduced, modeled by automata and transducers and solved using SageMath. In particular, we compute the asymptotic Hamming weight of a non-adjacent-form-like digit expansion, which was not known before

Length mode piezoelectric ultrasonic transducer for inspection of solid objects

The transducer is constructed from individual transducer elements arranged in an array and configured to exhibit a predominant, longitudinal mode transversely to the array. The elements are interconnected through thin flexible sheets. Each element is individually damped, and the transducer as a whole is electrically damped through resonance with the clamped capacitance and dissipation. Electrical control permits inphase operation of all transducer elements or control with preselected phase differences

Tactons: structured tactile messages for non-visual information display

Tactile displays are now becoming available in a form that can be easily used in a user interface. This paper describes a new form of tactile output. Tactons, or tactile icons, are structured, abstract messages that can be used to communicate messages non-visually. A range of different parameters can be used for Tacton construction including: frequency, amplitude and duration of a tactile pulse, plus other parameters such as rhythm and location. Tactons have the potential to improve interaction in a range of different areas, particularly where the visual display is overloaded, limited in size or not available, such as interfaces for blind people or in mobile and wearable devices. This paper describes Tactons, the parameters used to construct them and some possible ways to design them. Examples of where Tactons might prove useful in user interfaces are given

The Equivalence Problem for Deterministic MSO Tree Transducers is Decidable

It is decidable for deterministic MSO definable graph-to-string or graph-to-tree transducers whether they are equivalent on a context-free set of graphs

Challenges in Signal Analysis of Resonant-Mass Gravitational Wave Detectors

An overview of the main points related to data analysis in resonant-mass gravitational wave detectors will be presented. Recent developments on the data analysis system for the Brazilian detector SCHENBERG will be emphasized.Comment: 6 pages, 3 figures, presented at the international conference "100 Years of Relativity" (Sao Paulo, Brazil, 22-24 August 2005), to appear in Brazilian Journal of Physics (Dec. 2005

The copying power of one-state tree transducers

One-state deterministic top-down tree transducers (or, tree homomorphisms) cannot handle "prime copying," i.e., their class of output (string) languages is not closed under the operation L → {$(w$)f(n) w ε L, f(n) ≥ 1}, where f is any integer function whose range contains numbers with arbitrarily large prime factors (such as a polynomial). The exact amount of nonclosure under these copying operations is established for several classes of input (tree) languages. These results are relevant to the extended definable (or, restricted parallel level) languages, to the syntax-directed translation of context-free languages, and to the tree transducer hierarchy.\ud \u