Search

Start Over Coverage 85-98

2. Projevy lidové zbožnosti ve štukové výzdobě venkovských staven na Vysočině

Creator:
Minář, Ivan
Format:
bez média and svazek
Type:
model:article and TEXT
Subject:
village architecture, popular art, religious art, Vysočina, and stucco decoration
Language:
Czech
Description:
The study focuses on a unique manifestation of popular art: the fi guration by stucco reliefs with religious themes, from the first half of the nineteenth century, that are found on the facades of the village buildings in the region Vy-sočina (on the border between Bohemia and Moravia). These stucco decorations follow the example of the popular glass paintings, paintings on procession flags, but especially the motives of pilgrimage badges and medallions (so called „little sacraments“). These reliefs, documented mostly on historical photographs, decorated in a whole 11 objects in 6 localities. In most of the cases original polychromy was proven. The themes were, besides the traditional saints, Saint Florian or Saint John Nepomucene, or Virgin Mary, also the depictions of closer or more distant pilgrimage places (Křemešník, Vranov u Brna, Sonntagberg, Lorch). Due to the fact of the limited durability of the material, as well as the social and cultural development, until today only two exemplars and one torso of the decoration were preserved. The study is supplemented by pictorial reconstruction of the original decoration, made by the author on the basis of preserved photographs.
Rights:
http://creativecommons.org/publicdomain/mark/1.0/ and policy:public

3. Rainbow connection in graphs

Creator:
Chartrand, Gary, Johns, Garry L., McKeon, Kathleen A., and Zhang, Ping
Format:
bez média and svazek
Type:
model:article and TEXT
Subject:
edge coloring, rainbow coloring, and strong rainbow coloring
Language:
English
Description:
Let G be a nontrivial connected graph on which is defined a coloring c : E(G) → {1, 2, . . . , k}, k ∈ N, of the edges of G, where adjacent edges may be colored the same. A path P in G is a rainbow path if no two edges of P are colored the same. The graph G is rainbow-connected if G contains a rainbow u − v path for every two vertices u and v of G. The minimum k for which there exists such a k-edge coloring is the rainbow connection number rc(G) of G. If for every pair u, v of distinct vertices, G contains a rainbow u − v geodesic, then G is strongly rainbow-connected. The minimum k for which there exists a k-edge coloring of G that results in a strongly rainbow-connected graph is called the strong rainbow connection number src(G) of G. Thus rc(G) ≤ src(G) for every nontrivial connected graph G. Both rc(G) and src(G) are determined for all complete multipartite graphs G as well as other classes of graphs. For every pair a, b of integers with a ≥ 3 and b ≥ (5a − 6)/3, it is shown that there exists a connected graph G such that rc(G) = a and src(G) = b.
Rights:
http://creativecommons.org/publicdomain/mark/1.0/ and policy:public

4. Stage-by-stage modeling of undisturbed motion of poly-link robots with continual discrete manipulation systems with stiff units of variable geometry

Creator:
Kolev, Petar K.
Format:
bez média and svazek
Type:
model:article and TEXT
Subject:
poly-link robot, stiff unit, and variable geometry
Language:
English
Description:
The notion of ‘undisturbed motion‘ in this paper expresses the natural elastic oscillations of a robot manipulation system (MS) insulated from external effects. The natural frequencies and the normal functions of a two-link robot with a manipulation system of ‘stiff units with variable geometry‘ are determined. The differential equations of the natural oscillations of systems are worked out and their common solution is determined. and Obsahuje seznam literatury
Rights:
http://creativecommons.org/licenses/by-nc-sa/4.0/ and policy:public