bluuebunny/crossref_metadata_2025_split huggingface dataset:
Plato`'s Ideas on Poetry
Authors: AVDYLI Merxhan NAZMI 
Published: January 2020

In his most important and most voluminous creation â€œThe Stateâ€ (Republic, Politeia), Plato included the most characteristically philosophical concepts which were an expression of his interests. Apart various fields of teaching, such metaphysics, theology, ethics, psychology, pedagogy, State system, which result from this creation, art and poetry could not go without being included as well (including the music). Otherwise, the Plato himself, in young age, except with mathematics he also dealt with poetry by believing that he is going to be more dedicated to it. But, it seems that acquaintance with the Socrates since he was 20 years old changed his mind and he was fully committed to the philosophy. His general philosophical reviews sublimating his philosophical ideas, which arise on the basis of the idea, as an alpha and omega of every human been in the world, took Plato away from poetry by making him more and more torrential in philosophy and more and more critical, even more cynical towards the poetry.
Key words: Plato, Aesthetics, Poetry, Idea, The beauty, Ideal, Philosophy, Time, Creation, Culture, Imitation, Dialogue, Literature.
How Does Mass Immigration Transform the Destination Societies?
Authors: SABRI ALI Dilshad 
Published: January 2020

The phenomenon of mass migration is explained thoroughly in this paper. It explains how easy global transportation by air and sea in a technological advanced world has made mass migration much easier. Mass Migration has also been made easier by globalization in that borders and boundaries between countries are being eliminated. Mass migration is explained in the sense that it takes into account the immigrants effect on destination countries such as the European Union, the United States of America, and also Canada. It takes into account how destination countries integrate and absorb these migrants within their economic sectors. It also takes into account how global security has been threatened by mass immigration. This paper also explains how national identity is being maintained in destination countries as mass migration influences the culture and beliefs of a country. The content analysis as methodology was used to discover the issue in this article.
Key words: Mass Immigration, 11th September, National Identity, Globalization, Content Analysis.
Effects of Wet Separated and High Speed Milling Fly Ash Added in High Volume to Cementitious Materials
Authors: Haider Usman , Ali Asif , Bittnar Zdeněk , Humayon Muhammad , Valentin Jan 
Published: January 2020

In this research high speed milling was carried out on particles of brown coal raw fly ash, on second layer, and on third layer particles obtained from wet separation of brown coal raw fly ash. Due to milling process, median particle size d50 of raw fly ash, second layer, and third layer reduced by 46 %, 23 %, and 77 %, densities reduced by 11 %, 17 %, and 8 % respectively. Due to milling process, formation of agglomerations was observed, the standard deviation of the chemical composition of each element from the mean value reduced. After milling, high volume cementitious paste mixes were prepared with 60 % cement replacement. Due to the milling process the increase in compressive strength at 28 and 90 days was observed for raw fly ash is 59 % and 16 %, for second layer is 12 % and 15 %, for third layer and milled third layer is 78 % and 75 %. Flexural strength testing showed that due to the milling process the deflections at maximum loads have reduced considerably leading to brittle behavior of milled cementitious specimens. The testing for Mercury Intrusion Porosimetry showed that the cementitious specimens of third layer have maximum concentration of large capillary pores between 0.05 and 10 µm, whereas, all others have maximum concentration of medium capillary pores between 0.01 and 0.05 µm. Autogenous shrinkage of cementitious specimens was measured for first sixteen hours after mixing which showed that the second layer particles have the least shrinkage as compared to all other specimens.
Peranan Kitosan dalam Menghasilkan Produk Ternak Unggas yang Sehat
Authors: Sahara Eli 
Published: January 2020

AbstrakKecenderungan masyarakat memilih bahan pangan yang sehat semakin meningkat seiring dengan peningkatan kesadaran konsumen terhadap pentingnya kesehatan. Bahan pangan berupa daging dan telur merupakan sumber protein hewani asal unggas. Telur dan daging unggas merupakan bahan pangan utama yang dipilih masyarakat karena bergizi tinggi dengan harga terjangkau. Untuk mempertahankan kepercayaan konsumen terhadap kualitas daging dan telur maka, perlu dijaga nilai keamanan bahan pangan asal unggas ini dari cemaran residu, dan infeksi kuman.Abstract The tendency of people to choose healthy food ingredients is increasing along with increasing consumer awareness of the benefits of maintaining health. Food ingredients such as meat and eggs are a source of animal protein from poultry. Eggs and poultry meat are the main foodstuffs that are chosen by the community because of their high nutritional value at affordable prices. To maintain consumer confidence in the quality of meat and eggs, it is necessary to maintain the value of the safety of food from poultry origin from contamination of residues, and bacterial infections.
Pemanfaatan Tepung Biji Alpukat (Persea americana Mill.) dalam Ransum terhadap Performa Ayam Ras Pedaging
Authors: ERWAN EDI 
Published: January 2020

Biji alpukat (Persea americana Mill.) merupakan limbah yang mengandung nutrisi diantaranya protein kasar, energi metabolis yang dijadikan digunakan sebagai bahan pakan unggas. Penelitian ini bertujuan untuk mengetahui pengaruh penggunaan tepung biji alpukat (TBA) di dalam ransum terhadap performa ayam ras pedaging yang meliputi konsumsi ransum, pertambahan bobot badan, konversi ransum dan income over feed cost. Penelitian ini telah dilaksanakan pada bulan Maret sampai April 2019 di laboratorium UIN Agriculture Research and Development Station (UARDS) Fakultas Pertanian dan Peternakan UIN Suska Riau. Penelitian ini menggunakan 80 ekor DOC strain cobb yang diberi ransum basal dengan penambahan TBA yang dipelihara selama 5 minggu. Penelitian ini menggunakan Rancangan Acak Lengkap dengan 4 perlakuan dan 5 ulangan. Perlakuan yang diberikan terdiri dari T0 (ransum basal dengan TBA 0%), T1 (ransum basal dengan TBA 5%), T2 (ransum basal dengan TBA 10%), dan T3 (ransum basal dengan TBA 15%). Hasil penelitian ini menunjukkan bahwa penggunaan tepung biji alpukat dalam ransum sampai 15% tidak berpengaruh nyata (P>0,05) terhadap konsumsi ransum namun berpengaruh sangat nyata (P<0,01) menurunkan pertambahan bobot badan, konversi ransum dan income over feed cost ayam ras pedaging. Kesimpulan dari penelitian ini adalah tepung biji alpukat dapat digunakan hingga 5% dalam ransum ayam ras pedaging.
A OPTIMALISASI PENDAPATAN DAERAH MELALUI TATA KELOLA PENDAPATAN DAERAH SATU PINTU
Authors: Maita Anshar 
Published: January 2020

Abtract
Optimizing regional income through one-stop regional revenue management. The purpose of this study was to determine the optimization of regional income through one-stop regional revenue management. The population in this study is Regional Revenue through One Stop Local Revenue Management. Data collection methods in this study were interviews and documentation. The method of data analysis uses descriptive methods and qualitative methods, namely the analysis of data trigulation. The results of this study indicate that the optimization of regional income through the management of one-stop regional revenue is a solution that must be implemented to avoid and minimize the occurrence of a decrease in PDRD revenue in the management of regional income.
Optimalisasi pendapatan daerah melalui tata kelola pendapatan daerah satu pintu. Tujuan penelitian ini adalah untuk mengetahui Optimalisasi pendapatan daerah melalui tata kelola pendapatan daerah satu pintu. Populasi dalam penelitian ini Pendapatan Daerah Melalui Tata Kelola Pendapatan Daerah Satu Pintu. Metode pengumpulan data dalam penelitian ini adalah wawancara dan dokumentasi. Metode analisis data menggunakan metode deskriptif dan metode kualitatif yaitu dengan analisis triamgulasi data. Hasil penelitian ini menunjukkan bahwa optimalisasi pendapatan daerah melalui tata kelola pendapatan daerah satu pintu merupakan solusi yang harus diterapkan untuk menghindari dan meminimalisasi terjadinya penurunan penerimaan PDRD dalam pengelolaan pendapatan daerah.
МЕТOДИ РOЗВ’ЯЗКУ ТЕМПЕРАТУРНИХ ЗАЛЕЖНOCТЕЙ В’ЯЗКOCТЕЙ МЕТАЛІЧНИХ РOЗПЛАВІВ: OГЛЯД
Authors: Михайлюк Ірина , Царева Олександра , Ваврик Тетяна , Царев Володимир 
Published: January 2020

У cтатті дocлідженo метoди рoзв’язку температурних залежнocтей в’язкocтей металічних рoзплавів для пoдальшoї їх реалізації заcoбами ПЕOМ. Виведенo ocнoвні ocoбливocті кoжнoгo з запрoпoнoваних метoдів, ocнoвні підхoди дo вирішення пocтавленoї прoблеми. Прoаналізoванo переваги та недoліки кoжнoгo з наведених метoдів. Ключoві cлoва: металічні рoзплави, температурні залежнocті, заcoби ПЕOМ, прoграмна реалізація, метoди рoзв’язку.
Limit Probabilities for Random Sparse Bit Strings
Authors: St. John Katherine 
Published: January 2020

Let $n$ be a positive integer, $c$ a real positive constant, and $p(n) = c/n$. Let $U_{n,p}$ be the random unary predicate under the linear order, and $S_c$ the almost sure theory of $U_{n,{c\over n}}$. We show that for every first-order sentence $\phi$: $$	f_{\phi}(c) = \lim_{n\rightarrow\infty}{\Pr}[U_{n,{c\over n}} { has\ property\ } \phi] $$ is an infinitely differentiable function. Further, let $S = \bigcap_c S_c$ be the set of all sentences that are true in every almost sure theory. Then, for every $c>0$, $S_c = S$.
The Chromatic Number and the Least Eigenvalue of a Graph
Authors: Fan Yi-Zheng , Yu Gui-Dong , Wang Yi 
Published: January 2020

In this paper we get a structural property for a graph having the minimal least eigenvalue among all graphs of fixed order and given chromatic number, and characterize such graphs under the condition that the chromatic number is not larger than half the order of the graph. As a result, we obtain a lower bound on the least eigenvalue in terms of the chromatic number, and an upper bound on the chromatic number in terms of the least eigenvalue of a graph.
The Full Automorphism Group of Cayley Graphs of $\mathbb{Z}_p\times\mathbb{Z}_{p^2}$
Authors: Dobson Edward 
Published: January 2020

Let $p\ge 5$ be prime. We determine the full automorphism groups of Cayley digraphs of $\mathbb{Z}_p\times\mathbb{Z}_{p^2}$.
Some Remarks on the Joint Distribution of Descents and Inverse Descents
Authors: Visontai Mirkó 
Published: January 2020

We study the joint distribution of descents and inverse descents over the set of permutations of $n$ letters. Gessel conjectured that the two-variable generating function of this distribution can be expanded in a given basis with nonnegative integer coefficients. We investigate the action of the Eulerian operators that give the recurrence for these generating functions. As a result we devise a recurrence for the coefficients in question but are unable to settle the conjecture. We examine generalizations of the conjecture and obtain a type $B$ analog of the recurrence satisfied by the two-variable generating function. We also exhibit some connections to cyclic descents and cyclic inverse descents. Finally, we propose a combinatorial model for the joint distribution of descents and inverse descents in terms of statistics on inversion sequences.
Hamiltonicity of Minimum Distance Graphs of 1-Perfect Codes
Authors: Romanov Alexander Mikhailovich 
Published: January 2020

A 1-perfect code $\mathcal{C}_{q}^{n}$ is called Hamiltonian if its minimum distance graph $G(\mathcal{C}_{q}^{n})$ contains a Hamiltonian cycle. In this paper, for all admissible lengths $n \geq 13$, we construct Hamiltonian nonlinear ternary 1-perfect codes, and for all admissible lengths $n \geq 21$, we construct Hamiltonian nonlinear quaternary 1-perfect codes. The existence of Hamiltonian nonlinear $q$-ary 1-perfect codes of length $N = qn + 1$ is reduced to the question of the existence of such codes of length $n$. Consequently, for $q = p^r$, where $p$ is prime, $r \geq 1$ there exist Hamiltonian nonlinear $q$-ary 1-perfect codes of length $n = (q ^{m} -1) / (q-1)$, $m \geq 2$. If $q =2, 3, 4$, then $ m \neq 2$. If $q =2$, then $ m \neq 3$.
Generalized Galois Numbers, Inversions, Lattice Paths, Ferrers Diagrams and Limit Theorems
Authors: Janson Svante 
Published: January 2020

Bliem and Kousidis recently considered a family of random variables whose distributions are given by the generalized Galois numbers (after normalization). We give probabilistic interpretations of these random variables, using inversions in random words, random lattice paths and random Ferrers diagrams, and use these to give new proofs of limit theorems as well as some further limit results.
From Heaps of Matches to the Limits of Computability
Authors: Larsson Urban , Wästlund Johan 
Published: January 2020

We study so-called invariant games played with a fixed number $d$ of heaps of matches. A game is described by a finite list $\mathcal{M}$ of integer vectors of length $d$ specifying the legal moves. A move consists in changing the current game-state by adding one of the vectors in $\mathcal{M}$, provided all elements of the resulting vector are nonnegative. For instance, in a two-heap game, the vector $(1,-2)$ would mean adding one match to the first heap and removing two matches from the second heap. If $(1,-2) \in \mathcal{M}$, such a move would be permitted provided there are at least two matches in the second heap. Two players take turns, and a player unable to make a move loses. We show that these games embrace computational universality, and that therefore a number of basic questions about them are algorithmically undecidable. In particular, we prove that there is no algorithm that takes two games $\mathcal{M}$ and $\mathcal{M}'$ (with the same number of heaps) as input, and determines whether or not they are equivalent in the sense that every starting-position which is a first player win in one of the games is a first player win in the other.
Arithmetic Properties of Overpartition Pairs into Odd Parts
Authors: Lin Lishuang 
Published: January 2020

In this work, we investigate various arithmetic properties of the function $\overline{pp}_o(n)$, the number of overpartition pairs of $n$ into odd parts. We obtain a number of Ramanujan type congruences modulo small powers of $2$ for $\overline{pp}_o(n)$. For a fixed positive integer $k$, we further show that $\overline{pp}_o(n)$ is divisible by $2^k$ for almost all $n$. We also find several infinite families of congruences for $\overline{pp}_o(n)$ modulo $3$ and two formulae for $\overline{pp}_o(6n+3)$ and $\overline{pp}_o(12n)$ modulo $3$.
On Codes that are Invariant under the Affine Group
Authors: Sin Peter 
Published: January 2020

Let $k[V]$ be the space of functions from a finite vector space into the algebraically closure of its field of scalars. This paper describes the lattice of subspaces of $k[V]$ which are invariant under the affine group ${\mathrm AGL}(V)$. The description provides a simple method for finding the submodule generated by any set of functions given as polynomials in the standard coordinates.
Induced Subarrays of Latin Squares Without Repeated Symbols
Authors: Abel R. Julian R. , Cavenagh Nicholas J. , Kuhl Jaromy 
Published: January 2020

We show that for any Latin square $L$ of order $2m$, we can partition the rows and columns of $L$ into pairs so that at most $(m+3)/2$ of the $2\times 2$ subarrays induced contain a repeated symbol. We conjecture that any Latin square of order $2m$ (where $m\geq 2$, with exactly five transposition class exceptions of order $6$) has such a partition so that every $2\times 2$ subarray induced contains no repeated symbol. We verify this conjecture by computer when $m\leq 4$.
The Number of Euler Tours of Random Directed Graphs
Authors: Creed Páidí , Cryan Mary 
Published: January 2020

In this paper we obtain the expectation and variance of the number of Euler tours of a random Eulerian directed graph with fixed out-degree sequence. We use this to obtain the asymptotic distribution of the number of Euler tours of a random $d$-in/$d$-out graph and prove a concentration result. We are then able to show that a very simple approach for uniform sampling or approximately counting Euler tours yields algorithms running in expected polynomial time for almost every $d$-in/$d$-out graph. We make use of the BEST theorem of de Bruijn, van Aardenne-Ehrenfest, Smith and Tutte, which shows that the number of Euler tours of an Eulerian directed graph with out-degree sequence $\mathbf{d}$ is the product of the number of arborescences and the term $\frac{1}{|V|}[\prod_{v\in V}(d_v-1)!]$. Therefore most of our effort is towards estimating the moments of the number of arborescences of a random graph with fixed out-degree sequence.
Recurrence Relations and Splitting Formulas for the Domination Polynomial
Authors: Kotek Tomer , Preen James , Simon Frank , Tittmann Peter , Trinks Martin 
Published: January 2020

The domination polynomial $D(G,x)$ of a graph $G$ is the generating function of its dominating sets. We prove that $D(G,x)$ satisfies a wide range of reduction formulas. We show linear recurrence relations for $D(G,x)$ for arbitrary graphs and for various special cases. We give splitting formulas for $D(G,x)$ based on articulation vertices, and more generally, on splitting sets of vertices.
Cooperative Colorings and Independent Systems of Representatives
Authors: Aharoni Ron , Holzman Ron , Howard David , Sprüssel Philipp 
Published: January 2020

We study a generalization of the notion of coloring of graphs, similar in spirit to that of list colorings: a cooperative coloring of a family of graphs $G_1,G_2, \ldots,G_k$ on the same vertex set $V$ is a choice of independent sets $A_i$ in $G_i$ ($1 \le i \le k)$ such that $\bigcup_{i=1}^kA_i=V$. This notion is linked (with translation in both directions) to the notion of ISRs, which are choice functions on given sets, whose range belongs to some simplicial complex. When the complex is that of the independent sets in a graph $G$, an ISR for a partition of the vertex set of a graph $G$ into sets $V_1,\ldots, V_n$ is a choice of a vertex $v_i \in V_i$ for each $i$ such that $\{v_1,\ldots,v_n\}$ is independent in $G$. Using topological tools, we study degree conditions for the existence of cooperative colorings and of ISRs. A sample result: Three cycles on the same vertex set have a cooperative coloring.
Recognition and Characterization of Chronological Interval Digraphs
Authors: Das Sandip , Francis Mathew , Hell Pavol , Huang Jing 
Published: January 2020

Interval graphs admit elegant structural characterizations and linear time recognition algorithms; on the other hand, the usual interval digraphs lack a forbidden structure characterization as well as a low-degree polynomial time recognition algorithm. In this paper we identify another natural digraph analogue of interval graphs that we call ”chronological interval digraphs”. By contrast, the new class admits both a forbidden structure characterization and a linear time recognition algorithm. Chronological interval digraphs arise by interpreting the standard definition of an interval graph with a natural orientation of its edges. Specifically, $G$ is a chronological interval digraph if there exists a family of closed intervals $I_v$, $v \in V(G)$, such that $uv$ is an arc of $G$ if and only if $I_u$ intersects $I_v$ and the left endpoint of $I_u$ is not greater than the left endpoint of $I_v$. (Equivalently, if and only if $I_u$ contains the left endpoint of $I_v$.)We characterize chronological interval digraphs in terms of vertex orderings, in terms of forbidden substructures, and in terms of a novel structure of so-called $Q$-paths. The first two characterizations exhibit strong similarity with the corresponding characterizations of interval graphs. The last characterization leads to a linear time recognition algorithm.
Degree Ramsey Numbers of Closed Blowups of Trees
Authors: Horn Paul , Milans Kevin G. , Rödl Vojtěch 
Published: January 2020

The degree Ramsey number of a graph $G$, denoted $R_\Delta(G;s)$, is $\min\{\Delta(H)\colon\, H\stackrel{s}{\to} G\}$, where $H\stackrel{s}{\to} G$ means that every $s$-edge-coloring of $H$ contains a monochromatic copy of $G$. The closed $k$-blowup of a graph is obtained by replacing every vertex with a clique of size $k$ and every edge with a complete bipartite graph where both partite sets have size $k$. We prove that there is a function $f$ such that $R_\Delta(G;s) \le f(\Delta(G), s)$ when $G$ is a closed blowup of a tree.
Orders Induced by Segments in Floorplans and $(2 - 14 - 3, 3 - 41 - 2)$-Avoiding Permutations
Authors: Asinowski Andrei , Barequet Gill , Bousquet-Mélou Mireille , Mansour Toufik , Pinter Ron Y. 
Published: January 2020

A floorplan is a tiling of a rectangle by rectangles. There are natural ways to order the elements - rectangles and segments - of a floorplan. Ackerman, Barequet and Pinter studied a pair of orders induced by neighborhood relations between rectangles, and obtained a natural bijection between these pairs and $(2 - 41 - 3, 3 - 14 - 2)$-avoiding permutations, also known as (reduced) Baxter permutations.In the present paper, we first perform a similar study for a pair of orders induced by neighborhood relations between segments of a floorplan. We obtain a natural bijection between these pairs and another family of permutations, namely $(2 - 14 - 3, 3 - 41 - 2)$-avoiding permutations.Then, we investigate relations between the two kinds of pairs of orders - and, correspondingly, between $(2 - 41 - 3, 3 - 14 - 2)$- and $(2 - 14 - 3, 3 - 41 - 2)$-avoiding permutations. In particular, we prove that the superposition of both permutations gives a complete Baxter permutation (originally called $w$-admissible by Baxter and Joichi in the sixties). In other words, $(2 - 14 - 3, 3 - 41 - 2)$-avoiding permutations are the hidden part of complete Baxter permutations. We enumerate these permutations. To our knowledge, the characterization of these permutations in terms of forbidden patterns and their enumeration are both new results.Finally, we also study the special case of the so-called guillotine floorplans.
Schur Polynomials, Banded Toeplitz Matrices and Widom's Formula
Authors: Alexandersson Per 
Published: January 2020

We prove that for arbitrary partitions $\mathbf{\lambda} \subseteq \mathbf{\kappa},$ and integers $0\leq c<r\leq n,$ the sequence of Schur polynomials $S_{(\mathbf{\kappa} + k\cdot\mathbf{1}^c)/(\mathbf{\lambda} + k\cdot\mathbf{1}^r)}(x_1,\dots,x_n)$ for $k$ sufficiently large, satisfy a linear recurrence. The roots of the characteristic equation are given explicitly. These recurrences are also valid for certain sequences of minors of banded Toeplitz matrices.In addition, we show that Widom's determinant formula from 1958 is a special case of a well-known identity for Schur polynomials.
The Ramsey Number of Loose Paths in 3-Uniform Hypergraphs
Authors: Maherani Leila , Omidi Gholam Reza , Raeisi Ghaffar , Shahsiah Maryam 
Published: January 2020

Recently, asymptotic values of 2-color Ramsey numbers for loose cycles and also loose paths were determined. Here we determine the 2-color Ramsey number of $3$-uniform loose paths when one of the paths is significantly larger than the other: for every $n\geq \Big\lfloor\frac{5m}{4}\Big\rfloor$, we show that $$R(\mathcal{P}^3_n,\mathcal{P}^3_m)=2n+\Big\lfloor\frac{m+1}{2}\Big\rfloor.$$