Spelling suggestions: "subject:"chord"" "subject:"thord""
31 |
Properties of Graphs Used to Model DNA RecombinationArredondo, Ryan 21 March 2014 (has links)
A model for DNA recombination uses 4-valent rigid vertex graphs,
called assembly graphs. An assembly graph,
similarly to the projection of knots, can be associated with an
unsigned Gauss code, or double occurrence word.
We define biologically motivated reductions that act on double
occurrence words and, in turn, on their associated assembly graphs. For
every double occurrence word w there is a sequence of reduction
operations that may be applied to w so that what remains is the
empty word, [epsilon]. Then the nesting index of a word w,
denoted by NI(w), is defined to to be the least number of reduction
operations necessary to reduce w to [epsilon]. The nesting index
is the first property of assembly graphs that we study. We use chord
diagrams as tools in our study of the nesting index. We observe two
double occurrence words that correspond to the same circle graph,
but that have arbitrarily large differences in nesting index values.
In 2012, Buck et al. considered the cellular
embeddings of assembly graphs into orientable surfaces. The genus
range of an assembly graph [Gamma], denoted gr([Gamma]), was defined to
be the set of integers g where g is the genus of an orientable
surface F into which [Gamma] cellularly embeds. The genus range is
the second property of assembly graphs that we study. We generalize
the notion of the genus range to that of the genus spectrum, where
for each g [isin] gr([Gamma]) we consider the number of orientable
surfaces F obtained from [Gamma] by a special construction, called a
ribbon graph construction, that have genus g. By
considering this more general notion we gain a better understanding
of the genus range property. Lastly, we show how one can obtain the
genus spectrum of a double occurrence word from the genus spectrums
of its irreducible parts, i.e., its double occurrence subwords.
In the final chapter we consider constructions of double occurrence
words that recognize certain values for nesting index and genus
range. In general, we find that for arbitrary values of nesting index
[ge] 2 and genus range, there is a double occurrence word that
recognizes those values.
|
32 |
Comparing the Emotional Impact of a Vadd11 Chord versus a V ChordYork, Perrin 01 January 2019 (has links)
The psychological research on music and emotion supports how the two concepts have always been intertwined. The most common line of research in this field is related to the commonly experienced phenomenon that major chords sound happy while minor chords sound sad. This proposed study takes a specific extended major chord (the Vadd11 chord) and tests whether the V chord with a color note, an added 11, has a significantly different emotional impact on listeners as compared to a V chord without an 11. The chord will be played within a I-V-I progression so that the Vadd11 chord is given musical context. Participants are asked to rate the how emotional the progression is and to indicate their preference between the two chords. Both piano and strings timbres will be tested. The chord progression change is hypothesized to cause a significantly increased emotional impact. Multiple confounding variables will be examined within the study (specifically cultural musical background, or what culture’s music participants listened to in their upbringing, and musical sophistication, or how musically adept participants are). Neither of these variables nor the timbre are anticipated to affect the changes in emotional reaction.
|
33 |
Experimental Determination of the Stiffness and Strength of Continuity Tie Connections in Large Wood Roof Dipahragms, and Impact on the Collective Chord ModelYarber, Caroline Nicole 01 August 2012 (has links)
The goal of this thesis is to determine whether continuity ties in large wood diaphragms are stiff enough to engage and provide diaphragm flexural stiffness in a collective chord model. Four series of continuity tie assemblies using Simpson Strong-Tie steel connectors were tested to determine the stiffness of each assembly. The results found from testing were applied to an example building and then analyzed using both the traditional chord method and the collective chord method.
The completed analysis on a typical size warehouse building showed that the collective chord model will act inadvertently on an existing building designed with a traditional chord, or alternatively will potentially act intentionally in the design of a new building. The relative stiffness of the continuity ties will determine if they engage and allow them to act collectively. The testing and analysis completed creates a basis for further research into the actual static and dynamic behavior of these diaphragms. The collective chord model does seem to be a reasonable approximation for how diaphragms actually behave. If more research is conducted into different shaped and sized buildings to confirm that the collective chord model will work on most buildings then it will be a more accurate way to design new diaphragms and analyze existing diaphragms than the current traditional model.
|
34 |
在有基礎架構之車載網路中利用Chord機制改善P2P效能的研究 / Using chord structure to improve P2P performance over infrastructure-based vehicular network許孜銚, Hsu, Tzu Yao Unknown Date (has links)
在vehicular network中應用Peer to peer (p2p)是目前尚在研究的一項領域。不同於一般wired network的環境,vehicular network環境中變動性相當高,且車輛移動速度快,車輛間無法長時間維持連線,所以若要在vehicular network上分享檔案資源,會遭遇到許多問題,像是如何在網路上有效率地搜尋所需要的檔案、相距甚遠的車輛如何分享彼此的資源、在有限的頻寬中如何發揮最大的分享效益,皆是十分重要的課題。本研究提出Urban Multi Layered Chord (UML-Chord)架構,在市區環境的vehicular network中,引入infrastructure-based的架構,以解決ad-hoc環境中只能靠車輛機會相遇時交換訊息,僅能做範圍內搜尋的缺點。另外我們使用multi-layered chord來管理網路上分享的檔案資源,此種結構化的p2p架構可以有比較好的搜尋效率。在檔案傳輸上,我們加入交通號誌的狀況後,讓車輛間連線預估時間(connection lifetime)更加精確,得以選出最適合的節點下載檔案,增加檔案的傳輸效率,提昇整體p2p應用的效能。 / Peer-to-peer (p2p) applications on vehicular network is a significant research topic today .Vehicular network is different from traditional wired network environment in some characteristics. Topology is very dynamic and vehicles driving in high speed, the connection between vehicles can’t maintain in a long time in vehicular network. If we want to share file resources on vehicular network, there are some problems to confronted, like the efficiency of query operations, sharing files with distance vehicles and fully utilizing the limited bandwidth.
Our paper proposes an Urban Multi-layered Chord (UML-Chord) method in urban Vehicular network. Introducing infrastructure based architecture to deal with the problem that cars can exchange their files only when they meet each other in ad-hoc mode. In addition, we use multi layered chord to manage file resources which should be shared on Internet. This kind of structured p2p architecture has better efficiency in searching files. For file transfer part, we take stop light into account. We modify connection lifetime, let it be used in choosing appropriated download peers, enhancing the efficiency of p2p application.
|
35 |
P2P-based Mobility Management for Heterogeneous Wireless Networks and Mesh NetworksNawrath, Thomas 14 July 2006 (has links) (PDF)
Today Moblity Management is one of the most important
tasks that need to be accomplished to secure availability
and performance of communication between people. This paper
explains how moblity management is currently structured
and what algorithms and approaches from Peer-To-Peer
technology could be used to increase availability and
performance.
|
36 |
Chord - A Distributed Hash TableLiao, Yimei 24 July 2006 (has links) (PDF)
An introduction to Chord Algorithm.
|
37 |
Chord - A Distributed Hash TableLiao, Yimei 21 August 2007 (has links) (PDF)
Source is converted into pdf format.
An introduction to Chord Algorithm.
|
38 |
Πρόγραμμα αυτόματης εναρμόνισης μελωδίαςΣφυράκης, Χαράλαμπος 22 January 2009 (has links)
Στη παρούσα διπλωματική εργασία αναπτύσσεται ένα πρόγραμμα σε Java που εναρμονίζει μία μονοφωνική ή πολυφωνική μελωδία, η οποία θα εισάγεται στο σύστημα με τη μορφή MIDI αρχείων. Η βασική τεχνική που χρησιμοποιείται είναι τα κρυμμένα μοντέλα Markov. Εισάγονται διάφορες βελτιώσεις που ενσωματώνουν γνώσεις θεωρίας μουσική στα κρυμμένα μοντέλα Μαρκόφ. Τα πειραματικά αποτελέσματα έδειξαν ότι μπορούν να βελτιώσουν την συνολική απόδοση. / In this diploma dissertation an automatic melody harmonization program is developed, written in Java. It can harmonize either a monophonic or a polyphonic melody contained in a MIDI file using the power of hidden Markov Models. We introduce several methods which incorporate musical knowledge into hidden markov models. Experiment results show higher performance in chord recognition than the initial approach.
|
39 |
J.S. Bach's BWV 232: Augmented Sixth Chords in the Symbolum Nicenum as Structural and Theological Unifying FactorsLusted, Luke Alan January 2015 (has links)
The focus of the present research is to examine Johann Sebastian Bach's (1685-1750) use of augmented sixth chords in the Symbolum Nicenum portion of his Mass in B Minor, BWV 232, as structural and theological unifying factors. Previous scholarly research has focused on other composers' settings of the Crucifixus text and detailed the conventions of chromatic harmony that many have incorporated in their works. Analysis of Bach's works dealing with Christ's crucifixion indicates that Bach was aware of both the augmented sixth chord and the conventions such a chord provided in service of Affekt. Further investigation of Bach's placement of these augmented sixth chords in the Symbolum Nicenum suggests that he intended to emphasize specific theological arguments presented in Martin Luther's (1483-1546) Ein Sermon von der Betrachtung des heiligen Leidens Christi ("A Sermon of Meditation on Christ's Holy Passion") written in 1519. In analyzing J.S. Bach's usage of augmented sixth chords in the Symbolum Nicenum, one recognizes his use of this sonority in service of Affekt for Christ's crucifixion related to Lutheran Passion theology.
|
40 |
Attacks on structured P2P overlay networks : Simulating Sybil AttacksTefera, Mismaku Hiruy January 2014 (has links)
No description available.
|
Page generated in 0.0473 seconds