82 research outputs found
Neponjatnyj jazyk Kurbskogo: novye podchody k interpretacii „anomalij“ v istoričeskich tekstach
In 2018, the author published a two-volume monograph in German entitled “Eine Syntax des ‘Novyj Margarit’ des A. M. Kurbskij. Philologisch-dependenzgrammatische Analysen zu einem kirchenslavischen Übersetzungskorpus” (“A Syntax of A. M. Kurbskij’s ‘Novyj Margarit’. A Philological and Dependency-grammatical Study of a Corpus of Church Slavonic Translations”). This article presents some results of the study in Russian and extends and complements the analysis begun in the monograph. The article focuses on the remarkable use of deverbal formations with the suffixes *-m- and *-n- having the meaning of passive necessity such as in до просвещаемы(х)/ad illuminandos ‘to those who have to be enlightened’. It is shown that the phenomenon in question, which can be observed in the Church Slavonic texts by Prince Andrei Kurbskij (1528–1583), should not be considered to be linguistically erroneous, as in the past. The fact that the use of the two formations mentioned is repeated in the same text and that examples of this phenomenon occur in different works by different authors suggests that it reflects a usage with a certain tradition. Consequently, the necessitative use of the deverbal suffixations has to be regarded as correct. In addition, a more systematic analysis makes it possible to show that a considerable number of other linguistic “anomalies” in Kurbskij’s works do not actually represent “anomalies”, or at least they are not linguistic errors of Kurbskij’s
Hamiltonicity in partly claw-free graphs
Matthews and Sumner have proved in [10]
that if G is a 2-connected
claw-free graph of order n such that δ(G) ≥ (n-2)/3, then G is
Hamiltonian. We say that a graph is almost claw-free if for every vertex
v of G, 〈N(v)〉 is 2-dominated and the set A of centers of claws of G is
an independent set. Broersma et al. [5]
have proved that if G is
a 2-connected almost claw-free graph of order n such that n such that δ(G) ≥ (n-2)/3, then G is Hamiltonian. We generalize these results
by considering the graphs satisfying the following property: for every
vertex v ∈ A, there exist exactly two vertices x and y of V\A such that N(v) ⊆ N[x] ∪ N[y]. We extend some other known
results on claw-free graphs to this new class of graphs
On new identities for Bell's polynomials
AbstractIn this work, we propose two new methods for the determination of new identities for Bell's polynomials. The first method is based on the Lagrange inversion formula, and the second is based on the binomial sequences. These methods allow the easy recovery of known identities and deduction of some new identities of these polynomials
An algorithm for solving multiple objective integer linear programming problem
In the present paper a complete procedure for solving Multiple
Objective Integer Linear Programming Problems is presented. The algorithm
can be regarded as a corrected form and an alternative to the method that
was proposed by Gupta and Malhotra. A numerical illustration is given to
show that this latter can miss some efficient solutions. Whereas, the
algorithm stated bellow determines all efficient solutions without
missing any one
Transforming Conflicts with Religious Dimensions: Methodologies and Practical Experiences
The locating chromatic number of generalized Petersen graphs with small order
It was conjectured by Asmiati (2018) that the generalized Petersen graph Pn,k has a locating chromatic number 4 if and only if (noddandk=1) or (n=4andk=2). In this paper, we give a negative answer to the conjecture posed by Asmiati. As a consequence, we are able to exhibit many counterexamples to the recent conjecture proposed, by proving that if (5≤n≤12) and (2≤k≤⌊n−12⌋) and (n,k)≠(12,5), then χLP(n,k)=4
Mechanical Behavior of Ultrahigh-Performance Concrete Tunnel Lining Segments
Ultrahigh-performance concrete (UHPC) is a novel material demonstrating superior mechanical, durability and sustainability performance. However, its implementation in massive structures is hampered by its high initial cost and the lack of stakeholders’ confidence, especially in developing countries. Therefore, the present study explores, for the first time, a novel application of UHPC, incorporating hybrid steel fibers in precast tunnel lining segments. Reduced scale curved tunnel lining segments were cast using UHPC incorporating hybrid 8 mm and 16 mm steel fibers at dosages of 1%, 2% and 3% by mixture volume. Flexural and thrust load tests were conducted to investigate the mechanical behavior of UHPC tunnel lining segments thus produced. It was observed that the flow of UHPC mixtures decreased due to steel fibers addition, yet steel fibers increased the mechanical and durability properties. Flexural tests on lining segments showed that both the strain hardening (multiple cracking) and strain softening (post-peak behavior) phases were enhanced due to hybrid addition of steel fibers in comparison with the control segments without fibers. Specimens incorporating 3% of hybrid steel fibers achieved 57% increase in ultimate load carrying capacity and exhibited multiple cracking patterns compared to that of identical UHPC segments with 1% fibers. Moreover, segments without fibers incurred excessive cracking and spalling of concrete at the base under the thrust load test. However, more stable behavior was observed for segments incorporating steel fibers under the thrust load, indicating its capability to resist typical thrust loads during tunnel lining field installation. This study highlights the potential use of UHPC with hybrid steel fibers for improved structural behavior. Moreover, the use of UHPC allows producing structural members with reduced cross-sectional dimensions, leading to reduced overall structural weight and increased clear space
Reference Points in TOPSIS Methods for Group Decision Makers & Interval Data: Study and Comparison
Makespan minimization for two-stage hybrid Flow shop with dedicated machines and additional constraints
International audienc
- …
