scholarly journals Recurrent sequences and the harmonic progression in genetic biomechanics

2021 ◽  
Vol 1129 (1) ◽  
pp. 012050
Author(s):  
V Verevkin ◽  
S Petoukhov
Keyword(s):  
Harmonic Progression ◽  
Recurrent Sequences

Recurrent sequences and endomorphisms of Euclidean spaces

1994 ◽  
Vol 63 (1) ◽  
pp. 92-96
Author(s):  
Lutz Lucht ◽  
Cordelia Methfessel
Keyword(s):  
Euclidean Spaces ◽  
Recurrent Sequences

Harmonic Factors in the Perception of Tonal Melodies

2002 ◽  
Vol 20 (1) ◽  
pp. 51-85 ◽  
Author(s):  
Dirk-Jan Povel ◽  
Erik Jansen
Keyword(s):  
Mental Representation ◽  
Tone Sequence ◽  
Minor Role ◽  
Pitch Height ◽  
Common Assumption ◽  
Harmonic Progression ◽  
A Minor

By common assumption, the first step in processing a tonal melody consists in setting up the appropriate metrical and harmonic frames required for the mental representation of the sequence of tones. Focusing on the generation of a harmonic frame, this study aims (a) to discover the factors that facilitate or interfere with the development of a harmonic interpretation, and (b) to test the hypothesis that goodness ratings of tone sequences largely depend on whether the listener succeeds in creating a suitable harmonic interpretation. In two experiments, listeners rated the melodic goodness of selected sequences of 10 and 13 tones and indicated which individual tones seemed not to fit. Results indicate that goodness ratings (a) are higher the more common the induced harmonic progression, (b) are strongly affected by the occurrence and position of nonchord tones: sequences without nonchord tones were rated highest, sequences with anchoring nonchord tones intermediately, and nonanchoring nonchord tones lowest. The explanation offered is compared with predictions derived from other theories, which leads to the conclusion that when a tone sequence is perceived as a melody, it is represented in terms of its underlying harmony, in which exact pitch-height characteristics play a minor role.

Algorithm for implementation of the «third decision scheme» of increasing the efficiency of search and synchronization of difficult broadband noise like signals

2021 ◽  
Author(s):  
I.I. Snytkin ◽  
T.I. Snytkin
Keyword(s):  
Central Element ◽  
Broadband Noise ◽  
Telecommunication Networks ◽  
Complex Signals ◽  
The Third ◽  
Recurrent Sequences ◽  
Decision Scheme ◽  
Code Structure ◽  
Wideband Signals ◽  
Derivatives Of

The construction of telecommunication networks with a guaranteed level of quality of service involves assessing and ensuring the security of both the networks themselves and information flows from unauthorized access and various kinds of interference, in particular at the 1st (physical) level of the network. In this regard, research in the field of creating recurrent code sequences with improved systemic, correlation, secretive, imitation-resistant properties is constantly relevant. In particular, research in the development and application of derivative nonlinear recurrent sequences, as a central element in the developed theory of the «third decision scheme». Goal of the work is to develop an algorithm for increasing the efficiency of search and synchronization of broadband signals in the form of double derivatives of nonlinear recurrent sequences, which directly uses the features of their code structure, the properties of determinism of their auto- and cross-correlation functions. The results of the research and development of the efficiency of the algorithm for accelerated search and synchronization of broadband complex signals in the form of phase-shift keyed derivatives of nonlinear recurrent sequences, which implements the principles of the «third decision schema» The developed algorithm, based on the use of double derivatives of nonlinear recurrent sequences as wideband signals, can be applied in the construction of promising packet radio networks.

Revision of the Imitation Rules in the Madrigals of Luca Marenzio and Carlo Gesualdo

2020 ◽  
pp. 95-106
Author(s):  
Л.Л. Гервер
Keyword(s):  
Harmonic Progression ◽  
The Moment

Статья посвящена пересмотру правил строгого стиля в имитационном письме мадригалов Луки Маренцио и Карло Джезуальдо. Показаны основные признаки мадригальной имитации: 1) особые типы соджетто, которые можно объяснить воздействием идеи imitazione delle parole: соджетто-возглас (с текстом Ahimè, Io moro и т. п.) и звукоизобразительное соджетто; 2) предельная краткость имитационных построений и их группировка по принципу имитационного «ядра» и имитационного «развертывания»; 3) контрастные сопоставления смежных имитационных групп; 4) паузирование во всех голосах ансамбля как один из приемов такого сопоставления; 5) окказиональный характер интервалов имитации, определяемых гармонической вертикалью, идеей хроматического порядка тонов в каждой партии ансамбля (у Джезуальдо) и т. п. This article focuses on the imitative writing in the madrigals of Luca Marenzio and Carlo Gesualdo. Many of the properties of these imitations do not conform to the rules of strict style. Among special features of madrigal imitation are: 1) new types of soggetto which can be attributed to the influence of the idea of imitazione delle parole: soggetto-exclamation (with the text Ahimè, Io moro, etc.) and sound-visual soggetto; 2) the utmost brevity of the imitative section; 3) the opposition of the adjacent imitative sections; 4) simultaneous rests in all the voices of the ensemble at the moment of such opposition; 5) occasional intervals of imitation caused by the harmonic progression or chromatic order of the tones in each voice of the madrigal (Gesualdo), etc.

scholarly journals A fast algorithm for solving linearly recurrent sequences

2019 ◽  
Vol 52 (3) ◽  
pp. 100-103
Author(s):  
Seung Gyu Hyun ◽  
Stephen Melczer ◽  
Catherine St-Pierre
Keyword(s):  
Fast Algorithm ◽  
Recurrent Sequences

scholarly journals Secure Linear Algebra Using Linearly Recurrent Sequences

2007 ◽  
pp. 291-310 ◽  
Author(s):  
Eike Kiltz ◽  
Payman Mohassel ◽  
Enav Weinreb ◽  
Matthew Franklin
Keyword(s):  
Linear Algebra ◽  
Recurrent Sequences

The Ellis semigroup of certain constant-length substitutions

2019 ◽  
pp. 1-26
Author(s):  
PETRA STAYNOVA
Keyword(s):  
Dynamical Systems ◽  
Constant Length ◽  
Almost Automorphic ◽  
Recurrent Sequences ◽  
Alternative Approach ◽  
Binary Case ◽  
The One ◽  
Ellis Semigroup ◽  
Cluster Points

In this article, we calculate the Ellis semigroup of a certain class of constant-length substitutions. This generalizes a result of Haddad and Johnson [IP cluster points, idempotents, and recurrent sequences. Topology Proc.22 (1997) 213–226] from the binary case to substitutions over arbitrarily large finite alphabets. Moreover, we provide a class of counterexamples to one of the propositions in their paper, which is central to the proof of their main theorem. We give an alternative approach to their result, which centers on the properties of the Ellis semigroup. To do this, we also show a new way to construct an almost automorphic–isometric tower to the maximal equicontinuous factor of these systems, which gives a more particular approach than the one given by Dekking [The spectrum of dynamical systems arising from substitutions of constant length. Z. Wahrscheinlichkeitstheor. Verw. Geb.41(3) (1977/78) 221–239].

Sign in / Sign up

Export Citation Format

Share Document