Biblioteka Nauki - repozytorium artykułów
Not a member yet
    615591 research outputs found

    Warsaw music prints in the legacy of singer Halina Mickiewiczówna (1923-2001). Part 1: Publishers, musical repertoire and the significance of the book collection. Catalog of sheet music

    No full text
    Artykuł stanowi pierwszą część wyników szczegółowych badań nad varsavianami muzycznymi pochodzącymi ze spuścizny śpiewaczki Haliny Mickiewiczówny (1923–2001). Obejmuje rozważania historyczno-bibliologiczne, takie jak ustalenie datacji druków oraz informacji o ich wytwórcach – wydawcach i drukarniach, a także muzykologiczne – omówienie repertuaru wydawniczego i jego recepcji w działalności warszawskich wydawców. Celem artykułu jest przede wszystkim udowodnienie, że kolekcja śpiewaczki stanowi reprezentatywny wycinek warszawskiej produkcji nutowej okresu przedwojennego, międzywojennego i powojennego, a jego zawartość dokumentuje popularność w tych czasach takiego gatunku muzycznego jak pieśń solowa oraz ulubionych przez publiczność i samą Maestrę fragmentów operowych. Artykuł wieńczy katalog omówionych muzykaliów.The article is the first part of the results of a detailed study of musical varsaviana from the legacy of singer Halina Mickiewiczówna (1923–2001). It includes historical and bibliological considerations, such as establishing the dating of the prints and informations about their makers – publishers and printers, as well as musicological considerations, such as a discussion of the publishing repertoire and its reception in the activities of Warsaw publishers. The aim of the article is first and foremost to prove that the singer’s collection represents a representative fragment of Warsaw’s sheet music production of the pre-war, interwar and post-war periods, and its content documents the popularity at these times of such a musical genre as the solo song, as well as operatic excerpts favored by the public and the Maestra herself. The article concludes with a catalog of the musicals discussed

    Multicolor Ramsey numbers and star-critical Ramsey numbers involving fans

    No full text
    For graphs GG and HH, the multicolor Ramsey number rk+1(G;H)r_{k+1}(G;H) is defined as the minimum integer NN such that any edge-coloring of KNK_N by k+1k+1 colors contains either a monochromatic GG in the first kk colors or a monochromatic HH in the last color. We shall write two color Ramsey numbers as r(G,H)r(G,H). For graphs FF, GG and HH, let F(G,H)F\to (G,H) signify that any red/blue edge coloring of FF contains either a red GG or a blue HH. Define the star-critical Ramsey number r(G,H)r^\ast(G,H) as max{sKrK1,s(G,H)}\max\{s | K_r\setminus K_{1,s}\to (G,H)\} where r=R(G,H)r=R(G,H). A fan FnF_n is a graph that consists of nn copies of K3K_3 sharing a common vertex, and a book Bn(p)B_n^{(p)} is a graph that consists of nn copies of Kp+1K_{p+1} sharing a common KpK_p. In this note, we shall show the upper bounds for rk+1(Kt,s;Fn)r_{k+1}(K_{t,s};F_{n}), rk+1(K2,s;Fn)r_{k+1}(K_{2,s};F_{n}), rk+1(C2t;Fn)r_{k+1}(C_{2t};F_{n}), some of which are sharp up to the sub-linear term asymptotically. We also obtain the value of r(Fm,Bn(p))r^\ast(F_m,B_n^{(p)}) as nn\to\infty

    3-neighbor bootstrap percolation on grids

    No full text
    Given a graph GG and assuming that some vertices of GG are infected, the rr-neighbor bootstrap percolation rule makes an uninfected vertex vv infected if vv has at least rr infected neighbors. The rr-percolation number, m(G,r)m(G, r), of GG is the minimum cardinality of a set of initially infected vertices in GG such that after continuously performing the rr-neighbor bootstrap percolation rule each vertex of GG eventually becomes infected. In this paper, we consider the 33-bootstrap percolation number of grids with fixed widths. If GG is the Cartesian product P3PmP_3 □ P_m of two paths of orders 33 and mm, we prove that m(G,3)=32(m+1)1 m(G,3)=\tfrac{3}{2}(m+1)-1 , when mm is odd, and m(G,3)=32m+1 m(G,3)=\tfrac{3}{2}m +1 , when mm is even. Moreover, if GG is the Cartesian product P5PmP_5 □ P_m, we prove that m(G,3)=2m+2m(G,3)=2m+2, when mm is odd, and m(G,3)=2m+3m(G,3)=2m+3, when mm is even. If GG is the Cartesian product P4PmP_4 □ P_m, we prove that m(G,3)m(G,3) takes on one of two possible values, namely m(G,3)=5(m+1)3+1 m(G,3) = \lfloor \tfrac{5(m+1)}{3} \rfloor + 1 or m(G,3)=5(m+1)3+2 m(G,3) = \lfloor \tfrac{5(m+1)}{3} \rfloor + 2

    Sufficient conditions for spanning trees with constrained leaf distance in a graph

    No full text
    The leaf distance of a tree is the minimum of distances between any two leaves of a tree. It is well known that seeking sufficient conditions for a graph to have some special kinds of spanning trees is an interesting and popular problem. In this paper, we first provide a lower bound on the size of a graph GG to guarantee that GG has a spanning tree with leaf distance at least 44. Moreover, for any graph GG with minimum degree δ\delta, we also deduce a lower bound on the spectral radius (or the signless Laplacian spectral radius) of GG to ensure the existence of a spanning tree with leaf distance of at least 44 in GG

    Hamiltonian properties in generalized lexicographic products

    No full text
    The lexicographic product G[H]G[H] of two graphs GG and HH is obtained from GG by replacing each vertex with a copy of HH and adding all edges between any pair of copies corresponding to adjacent vertices of GG. We consider also the generalized lexicographic product such that we replace each vertex of GG with arbitrary graph on the same number of vertices. We present sufficient and necessary conditions for traceability, hamiltonicity and hamiltonian connectivity of G[H]G[H] if GG is a path and hence we improved and extended results in [M. Kriesell, A note on Hamiltonian cycles in lexicographical products, J. Autom. Lang. Comb. 2 (1997) 135–138]

    Better late than never…

    No full text

    Skytinel Network – growth and perspectives

    No full text
    Skytinel is a new fireball network operating in Poland from spring 2024. In less than a year, 35 stations equipped with all-sky and wide field cameras have been set up and six potential meteorite falls have been recorded. One of these was successfully found. This paper summarises the development of the Skytinel project and gives an insight into the hardware, software, and methods used in the daily operations of the network. In addition, the paper provides details of the key phenomena recorded by project participants, especially those related to meteorite falls in Poland and surrounding countries

    Self-awareness of soldiers regarding risk factors for cardiovascular diseases

    No full text
    Objectives Cardiovascular diseases (CVDs) remain the leading cause of death in Europe. There are more and more young people and middle-aged patients with obesity, unrecognized hypertension and metabolic abnormalities. Professional soldiers should not have CVDs. Most cardiovascular risk factors can be controlled and identified. Material and Methods The research was conducted as the online survey. During the study, the level of knowledge regarding to cardiovascular risk factors depending on several variables, was assessed. Moreover, the assess respondents’ awareness of exposure and the level of knowledge about risk factors for CVDs and preventive measures in this area. Results Almost one-fourth of respondents (23.4%, N = 311) indicated the knowledge of most or all cardiovascular factors such as: high level of cholesterol, tobacco smoking, advanced aged, abdominal obesity, alcohol abuse and others. The respondents demonstrated a sufficient level of factors influencing the increase of cholesterol levels in the blood. Conclusions The results obtained during the study show that educational programs are necessary to raise awareness of cardiovascular risk factors and reduce incidence rate in the next step. Conducting training on harmful agents can result in raising general health awareness among Polish Soldiers

    Edge coloring of products of signed graphs

    No full text
    In 2020, Behr defined the problem of edge coloring of signed graphs and showed that every signed graph (G,σ)(G, \sigma) can be colored using exactly Δ(G)\Delta(G) or Δ(G)+1\Delta(G) + 1 colors, where Δ(G)\Delta(G) is the maximum degree in graph GG. In this paper, we focus on products of signed graphs. We recall the definitions of the Cartesian, tensor, strong, and corona products of signed graphs and prove results for them. In particular, we show that (1)(1) the Cartesian product of Δ\Delta-edge-colorable signed graphs is Δ\Delta-edge-colorable, (2)(2) the tensor product of a Δ\Delta-edge-colorable signed graph and a signed tree requires only Δ\Delta colors and (3)(3) the corona product of almost any two signed graphs is Δ\Delta-edge-colorable. We also prove some results related to the coloring of products of signed paths and cycles

    Critical infrastructure as a target of hybrid and conventional attacks. Lessons from the Ukrainian experience

    No full text
    Autor omawia problematykę ataków na infrastrukturę krytyczną Ukrainy, podejmowanych zarówno podczas działań hybrydowych (od 2014 r.), jak i w czasie pełnoskalowej rosyjskiej inwazji (od 2022 r.). Na podstawie dostępnych informacji analizuje operacje przeciwko infrastrukturze energetycznej Ukrainy. Zwraca uwagę na to, że ataki prowadzone przez rosyjskie siły mogą sięgać również na terytorium Unii Europejskiej. Przedstawia także wstępne wnioski dotyczące zarówno odporności, jak i obrony infrastruktury krytycznej.The author discusses the issue of attacks on Ukraine’s critical infrastructure, undertaken both during hybrid operations (since 2014) and during a fullscale Russian invasion (since 2022). Based on the available information, he analyses the operations against Ukraine’s energy infrastructure. He points out that attacks conducted by Russian forces may also reach the territory of the European Union. He also presents preliminary conclusions on both the resilience and defence of critical infrastructure

    0

    full texts

    615,591

    metadata records
    Updated in last 30 days.
    Biblioteka Nauki - repozytorium artykułów
    Access Repository Dashboard
    Do you manage Open Research Online? Become a CORE Member to access insider analytics, issue reports and manage access to outputs from your repository in the CORE Repository Dashboard! 👇