1,371,744 research outputs found
Capoeta mauricii Kucuk, Turan, Sahin & Gulle 2008
No full textCapoeta mauricii Küçük, Turan, Şahin & Gülle, 2008 (Fig. 9) Holotype: FFR 3800, 138 mm SL, male; Konya prov.: stream Sarıöz, 1 km west of Beyşehir, Lake Beyşehir drainage, 37.6887N 31.7506E. Paratypes: FFR 3801, 14 (9 males, 5 females), 114–238 mm SL; same data as holotype. Status: Both molecular (Geiger et al. 2014, Bektaş et al. 2017, 2019) and morphologic (Kaya 2019) studies did not fully confirm the morphological differences between C. pestai and C. mauricii originally proposed by Turan et al. (2006). Capoeta mauricii is accepted as a synonym of C. pestai by Özeren et al. (2019).Published as part of Kaya, Cüneyt, Bayçelebi, Esra & Turan, Davut, 2021, Illustrated type specimens catalogue of Recep Tayyip Erdogan University Zoology Museum of the Faculty of Fisheries, pp. 401-442 in Zootaxa 4996 (3) on page 409, DOI: 10.11646/zootaxa.4996.3.1, http://zenodo.org/record/507432
A Comparison of Islamic Vs Conventional Banks in Turkey
No full text##nofulltext##Semen Son Turan (MEF Author)..
Designing the Radio Link for a Lunar CubeSat: the LUMIO Case
No full textThe Lunar Meteoroid Impact Observer (LUMIO) is a mission designed to observe, quantify, and characterize the meteoroid impacts by detecting their flashes on the lunar far side. Earth-based lunar observations are restricted by weather, geometric and illumination conditions, while a lunar orbiter can improve the detection rate of lunar meteoroid impact flashes, as it would allow for longer monitoring periods. This paper will focus on the communications and radio navigation system of the mission, designed for the ESA roadmap for lunar exploration. LUMIO has been designed to operate autonomously after deployment from a lunar mother spacecraft in a low inclination lunar orbit and to reach without human intervention his final destination orbit close to the Earth-Moon L2 point, where science can be carried out. Being the destination orbit always in view from Earth (despite a distance of 460000 - 480000 km), Direct-to-Earth communication was added to the mission as a mean to reduce risk and allow independent verification of several of the innovative technologies that would be demonstrated, first of all autonomous navigation. A detailed link budget analysis will be presented for all mission phases for both the link with the mother spacecraft in low lunar orbit and the link with Earth. Beside defining the achievable data transfer, we will focus also on evaluating the available ground stations to better evaluate mission cost with respect to science return. Radio-navigation performances will also be evaluated to estimate the position and relative velocity accuracy, given also the limited performances available for the on-board navigation transponder. This will help also better defining the on-board autonomous navigation system, constraining the total error budget. Further strategies, such as beacon tones, will be evaluated to lower the overall operational cost by employing continuous monitoring with a low performances ground station and, only when needed, perform high speed downlink using a deep-space class ground station. This strategy is considered of extreme importance, especially for small missions, to allow opportunistic operations on high gain antennas, given their very busy schedule. Keywords: LUMIO, CubeSat, Lunar, Radio, linkGreen Open Access added to TU Delft Institutional Repository ‘You share, we take care!’ – Taverne project https://www.openaccess.nl/en/you-share-we-take-care Otherwise as indicated in the copyright section: the publisher is the copyright holder of this work and the author uses the Dutch legislation to make this work public.Space Systems Egineerin
On Turan hypergraphs
No full textLet α(H) be the stability number of a hypergraph H = (X, E). T(n, k, α) is the smallest q such that there exists a k-uniform hypergraph H with n vertices, q edges and with α(H) ≤ α. A k-uniform hypergraph H, with n vertices, T(n, k, α) edges and α(H) ≤α is a Turan hypergraph. The value of T(n, 2, α) is given by a theorem of Turan. In this paper new lower bounds to T(n, k, α) are obtained and it is proved that an infinity of affine spaces are Turan hypergraphs. © 1978.SCOPUS: ar.jinfo:eu-repo/semantics/publishe
Computational techniques in Turan problems
No full textA Turan set system, T(n, I, k), is a k -uniform hypergraph on n points, such that any subset of / vertices contains at least one edge. The Turan number T{n, l, k) is the minimal number of edges in any Turan set system T(n,l,k). The known nontrivial values of Turan numbers are rare. Using the algorithm turexp for extending T(n, I, k) systems to 7(n+1, I, k) systems and procedures nauty for determining the automorphism group of a graph, the new Turan numbers 7(13, 4, 3), 7(11, 5, 3), 7(12, 5, 3), 7(13, 5, 3) are determined, a new lower bound for 7(14, 5, 3) is given, the Turan numbers 7(10, 4, 3), 7(11, 4, 3), 7(12, 4, 3) are confirmed to be the same as the previous unpublished results of other authors, and all minimal Turan T(n, 4, 3) (n \u3c 12), 7(n, 6, 5) (n \u3c 9), T(n, 5, 3) (n \u3c 13) are obtained
l-Degree Turan Density
No full textLet H-n be a k-graph on n vertices. For 0 <= l < k and an l-subset T of V (H-n), define the degree deg(T) of T to be the number of (k - l)-subsets S such that S boolean OR T is an edge in H-n. Let the minimum l-degree of H-n be delta(l) (H-n) = min{deg(T) : T subset of V (H-n) and vertical bar T vertical bar = l}. Given a family F of k-graphs, the l-degree Turan number ex(l) (n, F) is the largest delta(l) (H-n) over all F-free k-graphs H-n on n vertices. Hence, ex(0) (n, F) is the Turan number. We define l-degree Turan density to be pi(kappa)(l) (F) = lim sup(n ->infinity) ex(l)(n, F)/kappa(n-l). In this paper, we show that for k > l > 1, the set of pi(kappa)(l) (F) is dense in the interval [0, 1). Hence, there is no "jump" for l-degree Turan density when k > l > 1. We also give a lower bound on pi(kappa)(l) (F) in terms of an ordinary Turan density
Rainbow Turan Methods for Trees
No full textThe rainbow Turan number, a natural extension of the well-studied traditionalTuran number, was introduced in 2007 by Keevash, Mubayi, Sudakov and Verstraete. The rainbow Tur ́an number of a graph F , ex*(n, F ), is the largest number of edges for an n vertex graph G that can be properly edge colored with no rainbow F subgraph. Chapter 1 of this dissertation gives relevant definitions and a brief history of extremal graph theory. Chapter 2 defines k-unique colorings and the related k-unique Turan number and provides preliminary results on this new variant. In Chapter 3, we explore the reduction method for finding upper bounds on rainbow Turan numbers and use this to inform results for the rainbow Turan numbers of specific families of trees. These results are used in Chapter 4 to prove that the rainbow Turan numbers of all trees are linear in n, which correlates to a well-known property of the traditional Turan numbers of trees. We discuss improvements to the constant term in Chapters 4 and 5, and conclude with a discussion on avenues for future work
Generalized rainbow Turan problems
No full textAlon and Shikhelman [J. Comb. Theory, B. 121 (2016)] initiated the systematic study of the following generalized Turan problem: for fixed graphs H and F and an integer n, what is the maximum number of copies of H in an n-vertex F-free graph?An edge-colored graph is called rainbow if all its edges have different colors. The rainbow Turan number of F is defined as the maximum number of edges in a properly edge-colored graph on n vertices with no rainbow copy of F. The study of rainbow Turan problems was initiated by Keevash, Mubayi, Sudakov and Verstraete [Comb. Probab. Comput. 16 (2007)].Motivated by the above problems, we study the following problem: What is the maximum number of copies of F in a properly edge-colored graph on n vertices without a rainbow copy of F? We establish several results, including when F is a path, cycle or tree
Some exact results for generalized Turan problems
No full textFix a k-chromatic graph F. In this paper we consider the question to determine for which graphs H does the Turan graph Tk-1(n) have the maximum number of copies of H among all n-vertex F-free graphs (for n large enough). We say that such a graph H is F-Turan-good. In addition to some general results, we give (among others) the following concrete results: (i) For every complete multipartite graph H, there is k large enough such that H is K-k-Turan-good. (ii) The path P-3 is F-Turan-good for F with chi(F) >= 4. (iii) The path P-4 and cycle C-4 are C5-Turan-good. (iv) The cycle C-4 is F-2-Turan-good where F-2 is the graph of two triangles sharing exactly one vertex
The situation of the genus Dianous (Staphylinidae: Steninae) in Turkey and its dark spots in the World Zoogeography
No full textThe Staphylinidae family is the most species-rich and ecologically diverse insect family (Parker, 2017).
Steninae is one of the most species-rich subfamilies in Staphylinidae and has two genera. One of them
is Stenus and the other is Dianous. The genus Dianous has 262 species (Puthz, 2016, 2021). In Turkey,
only two species belonging to the genus Dianous were identified and three subspecies of one of these
species were given (Puthz, 1979, 1981, 2002; Turan&Sert, 2019, 2021). When the studies carried out in
Turkey are examined, it has been seen that there are very few studies on this genus in our country. Only
records from the Eastern Black Sea Region, Erciyes Mountain in the Central Anatolia Region, Sultan
Mountains in the Aegean Region, Adana in the Mediterranean Region and Bilecik in the Marmara
Region are given. Apart from these records, there is no study conducted in other regions of Turkey and
potential habitats of species belonging to this genus. For this reason, the Dianous fauna of Turkey is not
known clearly.
When the world zoogeographic distribution of the genus Dianous is examined, it is seen that there are
some question marks. The east of Turkey's Anatolian diagonal is completely uncertain. In addition, there
are no records other than Bilecik and Sultan Mountains in the west. However, there are no records of
this genus in most of Iran after Turkey, Turkmenistan and a large area of Afghanistan. The question
asked here is; why there is no species in these regions?
A comprehensive project proposal has been prepared for TÜBITAK in order to reveal the faunistic
situation of the genus Dianous in Turkey, to evaluate the zoogeographic situation in the world, to
evaluate the future situation of the habitats of this genus, which only lives in waterfall habitats, due to
climate change
- …
