The merchant's polyglot manual, in nine languages: English, German, Dutch, Swedish, Danish and Norwegian, French, Italian, Spanish, Portuguese.

Mode of access: Internet.

Lexicon forestale.

592 s.

Kitab-ı Lehçet ül-lûgat

[Mehmed Esad].

Diccionario manual griego-latino-español /

Con dedicatoria autógrafa.

Technologisches Wörterbuch in deutscher, französischer und englischer Sprache ...

Vol. 2 has imprint: Wiesbaden, J.F. Bergmann; New York, B. Westermann & Co.; [etc., etc.]; v. 3: Wiesbaden, C.W. Kreidel; New York, L.W. Schmidt; [etc., etc.]

Illustrated technical dictionary in six languages, English, German, French, Russian, Italian, Spanish /

Vols. 7-13 have added t.p.: Schlomann-Oldenbourgh illustrierte technische wörterbücher, unter mitwirkung hervorragender fachieute des in- und auslandes, hrsg. von Alfred Schlomann ... Müchen und Berlin, Druck und verlag von R. Oldenbourg; London, Constable & Co., etc.

Dictionary of science and technology in English-French-German-Spanish,

Mode of access: Internet.

Building and Using Existing Hunspell Dictionaries and TEX Hyphenators as Finite-State Automata

There are numerous formats for writing spellcheckers for open-source systems and there are many descriptions for languages written in these formats. Similarly, for word hyphenation by computer there are TEX rules for many languages. In this paper we demonstrate a method for converting these spell-checking lexicons and hyphenation rule sets into finite-state automata, and present a new finite-state based system for writer’s tools used in current open-source software such as Firefox, OpenOffice.org and enchant via the spell-checking library voikko.

Compressive sensing for music signals: comparison of transforms with coherent dictionaries

Compressive Sensing (CS) is a new sensing paradigm which permits sampling of a signal at its intrinsic information rate which could be much lower than Nyquist rate, while guaranteeing good quality reconstruction for signals sparse in a linear transform domain. We explore the application of CS formulation to music signals. Since music signals comprise of both tonal and transient nature, we examine several transforms such as discrete cosine transform (DCT), discrete wavelet transform (DWT), Fourier basis and also non-orthogonal warped transforms to explore the effectiveness of CS theory and the reconstruction algorithms. We show that for a given sparsity level, DCT, overcomplete, and warped Fourier dictionaries result in better reconstruction, and warped Fourier dictionary gives perceptually better reconstruction. “MUSHRA” test results show that a moderate quality reconstruction is possible with about half the Nyquist sampling.

PolyGLoT: A Polyhedral Loop Transformation Framework for a Graphical Dataflow Language

Polyhedral techniques for program transformation are now used in several proprietary and open source compilers. However, most of the research on polyhedral compilation has focused on imperative languages such as C, where the computation is specified in terms of statements with zero or more nested loops and other control structures around them. Graphical dataflow languages, where there is no notion of statements or a schedule specifying their relative execution order, have so far not been studied using a powerful transformation or optimization approach. The execution semantics and referential transparency of dataflow languages impose a different set of challenges. In this paper, we attempt to bridge this gap by presenting techniques that can be used to extract polyhedral representation from dataflow programs and to synthesize them from their equivalent polyhedral representation. We then describe PolyGLoT, a framework for automatic transformation of dataflow programs which we built using our techniques and other popular research tools such as Clan and Pluto. For the purpose of experimental evaluation, we used our tools to compile LabVIEW, one of the most widely used dataflow programming languages. Results show that dataflow programs transformed using our framework are able to outperform those compiled otherwise by up to a factor of seventeen, with a mean speed-up of 2.30x while running on an 8-core Intel system.