1.

Record Nr.

UNINA9910713674603321

Autore

Schoeffel M. F (Malcolm Francis), <1898-1991, >

Titolo

The installation and correction of compasses in airplanes / / by M.F. Schoeffel

Pubbl/distr/stampa

Washington, [D.C.] : , : National Advisory Committee for Aeronautics, , 1927

Descrizione fisica

1 online resource (17 pages, 4 unnumbered pages) : illustrations

Collana

Technical notes / National Advisory Committee for Aeronautics ; ; No. 262

Soggetti

Aeronautical instruments

Navigation (Aeronautics)

Gyro compass

Airplanes - Fuselage

Lingua di pubblicazione

Inglese

Formato

Materiale a stampa

Livello bibliografico

Monografia

Note generali

"August 1927."

No Federal Depository Library Program (FDLP) item number.



2.

Record Nr.

UNINA9910791049103321

Autore

Recasens i Vives Daniel <1954->

Titolo

Coarticulation and sound change in Romance / / Daniel Recasens

Pubbl/distr/stampa

Amsterdam, Netherlands : , : John Benjamins Publishing Company, , 2014

©2014

ISBN

90-272-7038-4

Descrizione fisica

1 online resource (219 p.)

Collana

Current Issues in Linguistic Theory : Amsterdam Studies in the Theory and History of Linguistic Science ; ; Volume 329, Series IV

Disciplina

440/.0415

Soggetti

Romance languages - Phonology

Romance languages - Accents and accentuation

Romance languages - Word formation

Romance languages - Consonants

Romance languages - Vowels

Mutation (Phonetics)

Linguistic change

Lingua di pubblicazione

Inglese

Formato

Materiale a stampa

Livello bibliografico

Monografia

Note generali

Description based upon print version of record.

Nota di bibliografia

Includes bibliographical references and index.

Nota di contenuto

""COARTICULATION AND SOUND CHANGE IN ROMANCE""; ""Editorial page ""; ""Title page ""; ""LCC data ""; ""Table of contents""; ""Preface and acknowledgments""; ""List of abbreviations""; ""1. Introduction""; ""1.1 Theories of coarticulation and the degree of  articulatory constraint model ""; ""1.2 Segmental articulation and coarticulation: General concepts ""; ""1.2.1 Articulatory constraints for vowels and consonants ""; ""1.2.2 Coarticulatory sensitivity, aggressiveness and directionality ""; ""1.3 Segmental insertion and elision ""; ""1.4 Assimilation and dissimilation ""

""1.5 Organization of the monograph """"1.6 Background information on the Romance languages ""; ""1.6.1 Languages and dialects ""; ""1.6.2 Evolution of Latin linguistic sounds into Romance ""; ""2. Consonant-dependent processes involving target vocalic segments""; ""2.1 Articulatory and coarticulatory characteristics of consonants ""; ""2.1.1 Alveolars [É«] and [r], and the bilabiovelar [w] ""; ""2.1.1.1 Typology and



syllabic allophones ""; ""2.1.1.2 Production ""; ""2.1.1.3 Coarticulation ""; ""2.1.2 (Alveolo)palatals, palatalized consonants and velars  ""; ""2.1.2.1 Production  ""

""2.1.2.2 Coarticulation """"2.1.3 Dentals and clear alveolars  ""; ""2.1.4 Labial and nasal consonants ""; ""2.2 Segmental insertion and elision ""; ""2.2.1 General considerations ""; ""2.2.1.1 Glide insertion and elision mechanisms ""; ""2.2.1.2 Glide insertion and segmental complexity ""; ""2.2.1.3 Vowel insertion and elision mechanisms ""; ""2.2.2 Glide insertion and elision processes ""; ""2.2.2.1 Alveolars [É«] and [r], and the bilabiovelar [w] ""; ""2.2.2.2 (Alveolo)palatals and palatalized consonants ""; ""2.2.2.3 Dentals and alveolars ""; ""2.2.2.4 Velars ""; ""2.2.2.5 Labials  ""

""2.2.2.6 Nasalized vowels """"2.2.3 Vowel insertion and elision processes ""; ""2.2.3.1 Word-initial position ""; ""2.2.3.2 Word-final position ""; ""2.2.3.3 Word-medial position ""; ""2.2.4 Summary ""; ""2.2.4.1 Glide insertion and elision ""; ""2.2.4.2 Vowel insertion and elision ""; ""2.2.4.3 Towards a reinterpretation of vowel diphthongization processes in Romance ""; ""2.3 Assimilation and dissimilation ""; ""2.3.1 Database of the analysis ""; ""2.3.2 Assimilation ""; ""2.3.2.1 Alveolar lateral [É«] and trill [r]  ""; ""2.3.2.2 (Alveolo)palatals ""; ""2.3.2.3 Dentals and alveolars ""

""2.3.2.4 Velars """"2.3.2.5 Labials ""; ""2.3.2.6 Nasality ""; ""2.3.3 Dissimilation ""; ""2.3.3.1 Back consonants and labials ""; ""2.3.3.2 (Alveolo)palatals ""; ""2.3.4 Summary  ""; ""2.3.4.1 Assimilatory and dissimilatory direction ""; ""2.3.4.2 Word position ""; ""2.3.4.3 Interactive contextual effects ""; ""3. Vowel-dependent processes""; ""3.1 Articulatory and acoustic properties of vowels ""; ""3.2 Consonant insertion and elision ""; ""3.2.1 Alveolar lateral [É«] ""; ""3.2.2 (Alveolo)palatal consonants ""; ""3.2.2.1 Insertion ""; ""3.2.2.2 Elision ""; ""3.2.3 Velar consonants ""

""3.2.3.1 Insertion ""



3.

Record Nr.

UNINA9910767527803321

Titolo

STACS 2007 : 24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, February 22-24, 2007, Proceedings / / edited by Wolfgang Thomas, Pascal Weil

Pubbl/distr/stampa

Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007

ISBN

1-280-86534-2

9786610865345

3-540-70918-5

Edizione

[1st ed. 2007.]

Descrizione fisica

1 online resource (XVIII, 710 p.)

Collana

Theoretical Computer Science and General Issues, , 2512-2029 ; ; 4393

Disciplina

004

Soggetti

Computer science

Algorithms

Machine theory

Artificial intelligence - Data processing

Theory of Computation

Computer Science Logic and Foundations of Programming

Formal Languages and Automata Theory

Data Science

Lingua di pubblicazione

Inglese

Formato

Materiale a stampa

Livello bibliografico

Monografia

Note generali

Bibliographic Level Mode of Issuance: Monograph

Nota di bibliografia

Includes bibliographic references and index.

Nota di contenuto

Invited Talks -- A Calculus and Algebra for Distributed Data Management -- The Büchi Complementation Saga -- Speed-Up Techniques for Shortest-Path Computations -- Session 1A -- Compact Forbidden-Set Routing -- A New Bound for Pure Greedy Hot Potato Routing -- Wavelength Management in WDM Rings to Maximize the Number of Connections -- Session 1B -- A First Investigation of Sturmian Trees -- On the Size of the Universal Automaton of a Regular Language -- Correlations of Partial Words -- Session 2A -- Testing Convexity Properties of Tree Colorings -- Why Almost All k-Colorable Graphs Are Easy -- Session 2B -- On Defining Integers in the Counting Hierarchy and Proving Arithmetic Circuit Lower Bounds -- A New Rank Technique for Formula Size Lower Bounds -- Session 3A -- Hard



Metrics from Cayley Graphs of Abelian Groups -- Broadcasting vs. Mixing and Information Dissemination on Cayley Graphs -- Light Orthogonal Networks with Constant Geometric Dilation -- Session 3B -- Admissibility in Infinite Games -- Pure Stationary Optimal Strategies in Markov Decision Processes -- Symmetries and the Complexity of Pure Nash Equilibrium -- Session 4A -- Computing Representations of Matroids of Bounded Branch-Width -- Characterizing Minimal Interval Completions -- Session 4B -- The Complexity of Unions of Disjoint Sets -- Kolmogorov-Loveland Stochasticity and Kolmogorov Complexity -- Session 5A -- Bounded-Hop Energy-Efficient Broadcast in Low-Dimensional Metrics Via Coresets -- On the Complexity of Affine Image Matching -- Session 5B -- On Fixed Point Equations over Commutative Semirings -- An Exponential Lower Bound for Prefix Gröbner Bases in Free Monoid Rings -- Session 6A -- A Cubic Kernel for Feedback Vertex Set -- The Union of Minimal Hitting Sets: Parameterized Combinatorial Bounds and Counting -- An Optimal, Edges-OnlyFully Dynamic Algorithm for Distance-Hereditary Graphs -- Session 6B -- A Search Algorithm for the Maximal Attractor of a Cellular Automaton -- Universal Tilings -- On the Complexity of Unary Tiling-Recognizable Picture Languages -- Session 7A -- A Characterization of Strong Learnability in the Statistical Query Model -- On the Consistency of Discrete Bayesian Learning -- Session 7B -- VPSPACE and a Transfer Theorem over the Reals -- On Symmetric Signatures in Holographic Algorithms -- Session 8A -- Randomly Rounding Rationals with Cardinality Constraints and Derandomizations -- Cheating to Get Better Roommates in a Random Stable Matching -- A Deterministic Algorithm for Summarizing Asynchronous Streams over a Sliding Window -- Session 8B -- Arithmetizing Classes Around NC 1 and L -- The Polynomially Bounded Perfect Matching Problem Is in NC 2 -- Languages with Bounded Multiparty Communication Complexity -- Session 9A -- New Approximation Algorithms for Minimum Cycle Bases of Graphs -- On Completing Latin Squares -- Small Space Representations for Metric Min-Sum k-Clustering and Their Applications -- Session 9B -- An Optimal Tableau-Based Decision Algorithm for Propositional Neighborhood Logic -- Bounded-Variable Fragments of Hybrid Logics -- Rank-1 Modal Logics Are Coalgebraic -- Session 10A -- An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Extraspecial Groups -- Weak Fourier-Schur Sampling, the Hidden Subgroup Problem, and the Quantum Collision Problem -- Quantum Network Coding -- Session 10B -- Reachability in Unions of Commutative Rewriting Systems Is Decidable -- Associative-Commutative Deducibility Constraints -- On the Automatic Analysis of Recursive Security Protocols with XOR -- Session 11A -- Improved Online Algorithms for the Sorting Buffer Problem -- Cost Sharing Methods forMakespan and Completion Time Scheduling -- Session 11B -- Planar Graphs: Logical Complexity and Parallel Isomorphism Tests -- Enumerating All Solutions for Constraint Satisfaction Problems.

Sommario/riassunto

This book constitutes the refereed proceedings of the 24th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2007, held in Aachen, Germany in February 2007. The 56 revised full papers presented together with 3 invited papers were carefully reviewed and selected from about 400 submissions. The papers address the whole range of theoretical computer science including algorithms and data structures, automata and formal languages, complexity theory, logic in computer science, semantics, specification, and verification of programs, rewriting and deduction, as well as current challenges like biological computing, quantum computing, and mobile and net computing.