bluuebunny/crossref_metadata_2025 huggingface dataset:
Avaliação de aplicativos de apoio a comunicação das pessoas surdas na perspectiva de um surdo
Authors: Costa Bruno Fernando da , Melo Amarildo , Nascimento Tamila , França Sônia , Costa Catarina
Published: June 2023

Os surdos estão acompanhando as transformações e evoluções do mundo digital por meio das tecnologias assistivas, ferramentas que oferecem suporte em acessibilidade e colaboram para a inclusão social desses sujeitos. As tecnologias assistivas voltadas para a comunidade surda devem levar em conta a forma única de comunicação, de visão de mundo e de necessidades. Assim, foi realizada uma pesquisa com o objetivo de avaliar, na visão de uma pessoa surda, os aplicativos Hand Talk e Central de Libras que auxiliam sujeitos surdos a se comunicarem. O checklist utilizado é formado por 52 questões que consideram os fatores de Usabilidade, Experiência do Usuário (UX) e Acessibilidade em conjunto. Os resultados mostram que os aplicativos avaliados, em sua maior parte, atendem positivamente aos itens verificados.
Gesellschafter-Trennung in Verbundenheit – Transformative Mediation
Authors: Hartwig Christian
Published: June 2023

Dieser Artikel bietet eine detaillierte Beschreibung einer Mediation, die mit Hilfe des transformativen Praxisansatzes durchgeführt wurde. Es geht hierbei um drei Führungskräfte einer Unternehmensberatung, die unterschiedliche Vorstellungen von den Gesamtzielen des Unternehmens haben. Der Mediator konzentriert sich auf die momentane Kommunikation der Parteien, um den Wandel der Parteien hin zu mehr Selbstwirksamkeit und gegenseitiger Anerkennung zu unterstützen. Dabei bleibt er während der gesamten Sitzungen auf der »Mikroebene«. Indem sich die Parteien auf die genaue Spiegelung jedes Einzelnen verlassen, können sie sich darüber klar werden, was für jeden von ihnen wichtig ist. Sie sind in der Lage, die zwischen ihnen bestehenden Unterschiede zu erkennen, sobald der Mediator umfassende Zusammenfassungen der Themen anbietet. So können die Parteien »sehen«, in welche Richtung sie sich mit ihren Gesprächen und Entscheidungen bewegen wollen.
On the number of tangencies among 1-intersecting curves
Authors: Ackerman Eyal , Keszegh Balázs
Published: June 2023

Let $\cC$ be a set of curves in the plane such that no three curves in $\cC$ intersect at a single point and every pair of curves in $\cC$ intersect at exactly one point which is either a crossing or a touching point. According to a conjecture of J\'anos Pach the number of pairs of curves in $\cC$ that touch each other is $O(|\cC|)$. We prove this conjecture for $x$-monotone curves.
A lower bound for set-colouring Ramsey numbers
Authors: Aragão Lucas , Collares Maurício , Marciano João , Martins Taísa , Morris Robert
Published: June 2023

The set-colouring Ramsey number $R_{r,s}(k)$ is defined to be the minimum $n$ such that if each edge of the complete graph $K_n$ is assigned a set of $s$ colours from $\{1,\ldots,r\}$, then one of the colours contains a monochromatic clique of size $k$. The case $s = 1$ is the usual $r$-colour Ramsey number, and the case $s = r - 1$ was studied by Erd\H{o}s, Hajnal and Rado in 1965, and by Erd\H{o}s and Szemerédi in 1972. The first significant results for general $s$ were obtained only recently, by Conlon, Fox, He, Mubayi, Suk and Verstra\"ete, who showed that $R_{r,s}(k) = 2^{\Theta(kr)}$ if $s/r$ is bounded away from $0$ and $1$. In the range $s = r - o(r)$, however, their upper and lower bounds diverge significantly. In this note we introduce a new (random) colouring, and use it to determine $R_{r,s}(k)$ up to polylogarithmic factors in the exponent for essentially all $r$, $s$ and $k$.
Type-respecting amalgamation and big Ramsey degrees
Authors: Aranda Andrés , Braunfeld Samuel , Chodounský David , Hubička Jan , Konečný Matěj , Nešetřil Jarsolav , Zucker Andy
Published: June 2023

We give an infinitary extension of the Nešetřil-Rödl theorem for category of relational structures with special type-respecting embeddings.
The Localization game on locally finite trees
Authors: Bonato Anthony , Lehner Florian , Marbach Trent , Nir Jd
Published: June 2023

We study the Localization game on locally finite graphs and trees, where each vertex has finite degree. As in finite graphs, we prove that any locally finite graph contains a subdivision where one cop can capture the robber. In contrast to the finite case, for $n$ a positive integer, we construct a locally finite tree with localization number $n$ for any choice of $n$. Such trees contain uncountably many ends, and we show this is necessary by proving that graphs with countably many ends have localization number at most 2. We finish with questions on characterizing the localization number of locally finite trees.
Chordal graphs with bounded tree-width
Authors: Castellví Jordi , Drmota Michael , Noy Marc , Requilé Clément
Published: June 2023

Given $t\ge 2$ and $0\le k\le t$, we prove that the number of labelled $k$-connected chordal graphs with $n$ vertices and tree-width at most $t$ is asymptotically $c n^{-5/2} \gamma^n n!$, as $n\to\infty$, for some constants $c,\gamma >0$ depending on $t$ and $k$. Additionally, we show that the number of $i$-cliques ($2\le i\le t$) in a uniform random $k$-connected chordal graph with tree-width at most $t$ is normally distributed as $n\to\infty$. The asymptotic enumeration of graphs of tree-width at most $t$ is wide open for $t\ge 3$. To the best of our knowledge, this is the first non-trivial class of graphs with bounded tree-width where the asymptotic counting problem is solved. Our starting point is the work of Wormald [Counting Labelled Chordal Graphs, \textit{Graphs and Combinatorics} (1985)], were an algorithm is developed to obtain the exact number of labelled chordal graphs on $n$ vertices..
Monochromatic configurations on a circle
Authors: Damásdi Gábor , Frankl Nora , Pach Janos , Pálvölgyi Dömötör
Published: June 2023

For $k\geq 3$, call a $k$-tuple $(d_1,d_2,\dots,d_k)$ with $d_1\geq d_2\geq \dots \geq d_k>0$ and $\sum_{i=1}^k d_i=1$ a \emph{Ramsey $k$-tuple} if the following is true: in every two-colouring of the circle of unit perimeter, there is a monochromatic $k$-tuple of points in which the distances of cyclically consecutive points, measured along the arcs, are $d_1,d_2,\dots,d_k$ in some order. By a conjecture of Stromquist, if $d_i=\frac{2^{k-i}}{2^k-1}$, then $(d_1,\dots,d_k)$ is Ramsey. Our main result is a proof of the converse of this conjecture. That is, we show that if $(d_1,\dots,d_k)$ is Ramsey, then $d_i=\frac{2^{k-i}}{2^k-1}$. We do this by finding connections of the problem to certain questions from number theory about partitioning $\mathbb{N}$ into so-called \emph{Beatty sequences}. We also disprove a majority version of Stromquist's conjecture, study a robust version, and discuss a discrete version.
Cop number of random k-uniform hypergraphs
Authors: Erde Joshua , Kang Mihyun , Lehner Florian , Mohar Bojan , Schmid Dominik
Published: June 2023

The game of \emph{Cops and Robber} is usually played on a graph, in which a group of cops attempt to catch a robber moving along the edges of the graph. The \emph{cop number} of a graph is the minimum number of cops required to win the game. An important conjecture in this area, due to Meyniel, states that the cop number of an $n$-vertex connected graph is $O(\sqrt{n})$. In 2016, Pra\l at and Wormald [Meyniel's conjecture holds for random graphs, Random Structures Algorithms. 48 (2016), no. 2, 396–421. MR3449604] showed that this conjecture holds with high probability for random graphs above the connectedness threshold. Moreoever, \L uczak and Pra\l at [Chasing robbers on random graphs: Zigzag theorem, Random Structures Algorithms. 37 (2010), no. 4, 516–524. MR2760362] showed that on a $\log$-scale the cop number demonstrates a surprising \emph{zigzag} behaviour in dense regimes of the binomial random graph $\Gnp$. In this paper, we consider the game of Cops and Robber on a hypergraph, where the players move along hyperedges instead of edges. We show that with high probability the cop number of the $k$-uniform binomial random hypergraph $G^k(n,p)$ is $O\left(\sqrt{\frac{n}{k}} \log n \right)$ for a broad range of parameters $p$ and $k$. As opposed to the case of $G(n,p)$, on a $\log$-scale our upper bound on the cop number arises as the minimum of \emph{two} complementary zigzag curves. Furthermore, we conjecture that the cop number of a connected $k$-uniform hypergraph on $n$ vertices is $O\left(\sqrt{\frac{n}{k}}\right)$.
A general bound for the induced poset saturation problem
Authors: Freschi Andrea , Piga Simon , Sharifzadeh Maryam , Treglown Andrew
Published: June 2023

For a fixed poset $P$, a family $\mathcal F$ of subsets of $[n]$ is induced $P$-saturated if $\mathcal F$ does not contain an induced copy of $P$, but for every subset $S$ of $[n]$ such that $ S\not \in \mathcal F$, then $P$ is an induced subposet of $\mathcal F \cup \{S\}$. The size of the smallest such family $\mathcal F$ is denoted by $\text{sat}^* (n,P)$. Keszegh, Lemons, Martin, P\'alv\"olgyi and Patk\'os [Journal of Combinatorial Theory Series A, 2021] proved that there is a dichotomy of behaviour for this parameter: given any poset $P$, either $\text{sat}^* (n,P)=O(1)$ or $\text{sat}^* (n,P)\geq \log _2 n$. We improve this general result showing that either $\text{sat}^* (n,P)=O(1)$ or $\text{sat}^* (n,P) \geq 2 \sqrt{n-2}$. Our proof makes use of a Tur\'an-type result for digraphs. Curiously, it remains open as to whether our result is essentially best possible or not. On the one hand, a conjecture of Ivan states that for the so-called diamond poset $\Diamond$ we have $\text{sat}^* (n,\Diamond)=\Theta (\sqrt{n})$; so if true this conjecture implies our result is tight up to a multiplicative constant. On the other hand, a conjecture of Keszegh, Lemons, Martin, P\'alv\"olgyi and Patk\'os states that given any poset $P$, either $\text{sat}^* (n,P)=O(1)$ or $\text{sat}^* (n,P)\geq n+1$. We prove that this latter conjecture is true for a certain class of posets $P$.
The Minimum Degree Removal Lemma Thresholds
Authors: Gishboliner Lior , Sudakov Benny , Jin Zhihan
Published: June 2023

The graph removal lemma is a fundamental result in extremal graph theory which says that for every fixed graph $H$ and $\varepsilon > 0$, if an $n$-vertex graph $G$ contains $\varepsilon n^2$ edge-disjoint copies of $H$ then $G$ contains $\delta n^{v(H)}$ copies of $H$ for some $\delta = \delta(\varepsilon,H) > 0$. The current proofs of the removal lemma give only very weak bounds on $\delta(\varepsilon,H)$, and it is also known that $\delta(\varepsilon,H)$ is not polynomial in $\varepsilon$ unless $H$ is bipartite. Recently, Fox and Wigderson initiated the study of minimum degree conditions guaranteeing that $\delta(\varepsilon,H)$ depends polynomially or linearly on $\varepsilon$. We answer several questions of Fox and Wigderson on this topic.
Random perfect matchings in regular graphs
Authors: Granet Bertille , Joos Felix
Published: June 2023

We prove that in all regular robust expanders $G$, every edge is asymptotically equally likely contained in a uniformly chosen perfect matching $M$. We also show that given any fixed matching or spanning regular graph $N$ in $G$, the random variable $|M\cap E(N)|$ is approximately Poisson distributed. This in particular confirms a conjecture and a question due to Spiro and Surya, and complements results due to Kahn and Kim who proved that in a regular graph every vertex is asymptotically equally likely contained in a uniformly chosen matching. Our proofs rely on the switching method and the fact that simple random walks mix rapidly in robust expanders.
A general approach to transversal versions of Dirac-type theorems
Authors: Gupta Pranshu , Hamann Fabian , Müyesser Alp , Parczyk Olaf , Sgueglia Amedeo
Published: June 2023

Given a collection of hypergraphs $\fH=(H_1, \ldots, H_m)$ with the same vertex set, an $m$-edge graph $F\subset \cup_{i\in [m]}H_i$ is a transversal if there is a bijection $\phi:E(F)\to [m]$ such that $e\in E(H_{\phi(e)})$ for each $e\in E(F)$. How large does the minimum degree of each $H_i$ need to be so that $\fH$ necessarily contains a copy of $F$ that is a transversal? Each $H_i$ in the collection could be the same hypergraph, hence the minimum degree of each $H_i$ needs to be large enough to ensure that $F\subseteq H_i$. Since its general introduction by Joos and Kim~[Bull. Lond. Math. Soc., 2020, 52(3): 498–504], a growing body of work has shown that in many cases this lower bound is tight. In this paper, we give a unified approach to this problem by providing a widely applicable sufficient condition for this lower bound to be asymptotically tight. This is general enough to recover many previous results in the area and obtain novel transversal variants of several classical Dirac-type results for (powers of) Hamilton cycles. For example, we derive that any collection of $rn$ graphs on an $n$-vertex set, each with minimum degree at least $(r/(r+1)+o(1))n$, contains a transversal copy of the $r$-th power of a Hamilton cycle. This can be viewed as a rainbow version of the P\'osa-Seymour conjecture.
Twin-width of Planar Graphs; a Short Proof
Authors: Hlineny Petr
Published: June 2023

The fascinating question of the maximum value of twin-width on planar graphs is nowadays not far from a final resolution; there is a lower bound of~$7$ coming from a construction by Kr\'al' and Lamaison [arXiv, September 2022], and an upper bound of~$8$ by Hlin\v{e}n\'y and Jedelsk\'y [arXiv, October 2022]. The upper bound (currently best) of~$8$, however, is rather complicated and involved. We give a short and simple self-contained proof that the twin-width of planar graphs is at most~$11$.
Crux, space constraints and subdivisions
Authors: Im Seonghyuk , Kim Jaehoon , Kim Younjin , Liu Hong
Published: June 2023

The existence of $H$-subdivisions within a graph $G$ has deep connections with topological, structural and extremal properties of $G$. One prominent example of such a connection, due to Bollob\'{a}s and Thomason and independently Koml\'os and Szemer\'edi, asserts that the average degree of $G$ being $d$ ensures a $K_{\Omega(\sqrt{d})}$-subdivision in $G$. Although this square-root bound is the best possible, various results showed that much larger clique subdivisions can be found in a graph for many natural classes. We investigate the connection between crux, a notion capturing the essential order of a graph, and the existence of large clique subdivisions. Our main result gives an asymptotically optimal bound on the size of a largest clique subdivision in a generic graph $G$, which is determined by both its average degree and its crux size. As corollaries, we obtain \begin{itemize} \item a characterisation of extremal graphs for which the square-root bound above is tight: they are essentially a disjoint union of graphs each of which has the crux size linear in $d$; \item a unifying approach to find a clique subdivision of almost optimal size in graphs which do not contain a fixed bipartite graph as a subgraph; \item and that the clique subdivision size in random graphs $G(n,p)$ witnesses a dichotomy: when $p = \omega(n^{-1/2})$, the barrier is the space, while when $p=o( n^{-1/2})$, the bottleneck is the density. \end{itemize}
Semi-algebraic and semi-linear Ramsey numbers
Authors: Jin Zhihan , Tomon István
Published: June 2023

An $r$-uniform hypergraph $H$ is \emph{semi-algebraic} of complexity $\mathbf{t}=(d,D,m)$ if the vertices of $H$ correspond to points in $\mathbb{R}^{d}$, and the edges of $H$ are determined by the sign-pattern of $m$ degree-$D$ polynomials. Semi-algebraic hypergraphs of bounded complexity provide a general framework for studying geometrically defined hypergraphs. The much-studied \emph{semi-algebraic Ramsey number} $R_{r}^{\mathbf{t}}(s,n)$ denotes the smallest $N$ such that every $r$-uniform semi-algebraic hypergraph of complexity $\mathbf{t}$ on $N$ vertices contains either a clique of size $s$, or an independent set of size $n$. Conlon, Fox, Pach, Sudakov and Suk proved that $R_{r}^{\mathbf{t}}(n,n)n^{(\log n)^{1/3-o(1)}}$ for some complexity $\mathbf{t}$. In addition, motivated by the results of Bukh-Matou\v sek and Basit-Chernikov-Starchenko-Tao-Tran, we study the complexity of the Ramsey problem when the defining polynomials are linear, that is, when $D=1$. In particular, we prove that $R_{r}^{d,1,m}(n,n)\leq 2^{O(n^{4r^2m^2})}$, while from below, we establish $R^{1,1,1}_{r}(n,n)\geq 2^{\Omega(n^{\lfloor r/2\rfloor-1})}$.
Perfect-matching covers of cubic graphs with colouring defect 3
Authors: Karabáš Ján , Macajova Edita , Nedela Roman , Skoviera Martin
Published: June 2023

The colouring defect of a cubic graph is the smallest number of edges left uncovered by any set of three perfect matchings. While $3$-edge-colourable graphs have defect~$0$, those that cannot be $3$-edge-coloured have defect at least $3$. We show that every bridgeless cubic graph with defect $3$ can have its edges covered with at most five perfect matchings, which verifies a long-standing conjecture of Berge for this class of graphs. Moreover, we determine the extremal graphs.
Finding pairwise disjoint vector pairs in F_2^n with a prescribed sequence of differences
Authors: Kovács Benedek
Published: June 2023

We consider the following question by Balister, Győri and Schelp: given $2^{n-1}$ nonzero vectors in $\ff_2^n$ with zero sum, is it always possible to partition $\ff_2^n$ into pairs such that the difference between the two elements of the $i$-th pair is equal to the $i$-th given vector? An analogous question in $\ff_p$ was resolved by Preissmann and Mischler in 2009. In this paper, we prove the conjecture in $\ff_2^n$ in the case when there are at most $n-2\log n-1$ distinct values among the given differences, and also in the case when at least a fraction $\frac{28}{29}$ of the differences are equal.
Almost partitioning every 2-edge-coloured complete k-graph into k monochromatic tight cycles
Authors: Lo Allan , Pfenninger Vincent
Published: June 2023

A $k$-uniform tight cycle is a $k$-graph with a cyclic order of its vertices such that every~$k$ consecutive vertices from an edge. We show that for $k\geq 3$, every red-blue edge-coloured complete $k$-graph on~$n$ vertices contains~$k$ vertex-disjoint monochromatic tight cycles that together cover $n - o(n)$ vertices.
Minimum vertex degree conditions for loose spanning trees in 3-graphs
Authors: Pehova Yanitsa , Petrova Kalina
Published: June 2023

In 1995, Koml\'os, S\'ark\"ozy and Szemer\'edi showed that for large $n$, every $n$-vertex graph with minimum degree at least $(1/2 + \gamma)n$ contains all spanning trees of bounded degree. We consider a generalization of this result to loose spanning hypertrees, that is, linear hypergraphs obtained by successively appending edges sharing a single vertex with a previous edge, in 3-graphs. We show that for all $\gamma$ and $\Delta$, and $n$ large, every $n$-vertex 3-uniform hypergraph of minimum vertex degree $(5/9 + \gamma)\binom{n}{2}$ contains every loose spanning tree with maximum vertex degree $\Delta$. This bound is asymptotically tight, since some loose trees contain perfect matchings.
Strengthening the Directed Brooks' Theorem for oriented graphs and consequences on digraph redicolouring.
Authors: Picasarri-Arrieta Lucas
Published: June 2023

Let $D=(V,A)$ be a digraph. We define $\Delta_{\max}(D)$ as the maximum of $\{ \max(d^+(v),d^-(v)) \mid v \in V \}$ and $\Delta_{\min}(D)$ as the maximum of $\{ \min(d^+(v),d^-(v)) \mid v \in V \}$. It is known that the dichromatic number of $D$ is at most $\Delta_{\min}(D) + 1$. In this work, we prove that every digraph $D$ which has dichromatic number exactly $\Delta_{\min}(D) + 1$ must contain the directed join of $\overleftrightarrow{K_r}$ and $\overleftrightarrow{K_s}$ for some $r,s$ such that $r+s = \Delta_{\min}(D) + 1$, except if $\Delta_{\min}(D) = 2$ in which case $D$ must contain a digon. In particular, every oriented graph $\vec{G}$ with $\Delta_{\min}(\vec{G}) \geq 2$ has dichromatic number at most $\Delta_{\min}(\vec{G})$. Let $\vec{G}$ be an oriented graph of order $n$ such that $\Delta_{\min}(\vec{G}) \leq 1$. Given two 2-dicolourings of $\vec{G}$, we show that we can transform one into the other in at most $n$ steps, by recolouring one vertex at each step while maintaining a dicolouring at any step. Furthermore, we prove that, for every oriented graph $\vec{G}$ on $n$ vertices, the distance between two $k$-dicolourings is at most $2\Delta_{\min}(\vec{G})n$ when $k\geq \Delta_{\min}(\vec{G}) + 1$. We then extend a theorem of Feghali, Johnson and Paulusma to digraphs. We prove that, for every digraph $D$ with $\Delta_{\max}(D) = \Delta \geq 3$ and every $k\geq \Delta +1$, the $k$-dicolouring graph of $D$ consists of isolated vertices and at most one further component that has diameter at most $c_{\Delta}n^2$, where $c_{\Delta} = O(\Delta^2)$ is a constant depending only on $\Delta$.
On asymptotic confirmation of the Faudree-Lehel Conjecture on the irregularity strength of graphs
Authors: Przybyło Jakub , Wei Fan
Published: June 2023

We call a multigraph irregular if it has pairwise distinct vertex degrees. No nontrivial (simple) graph is thus irregular. The irregularity strength of a graph $G$, $s(G)$, is a specific measure of the ``level of irregularity'' of $G$. It might be defined as the least $k$ such that one may obtain an irregular multigraph of $G$ by multiplying any selected edges of $G$, each into at most $k$ its copies. In other words, $s(G)$ is the least $k$ admitting a $\{1,2,\ldots,k\}$-weighting of the edges of $G$ assuring distinct weighted degrees for all the vertices, where the weighted degree of a vertex is the sum of its incident weights. The most well-known open problem concerning this graph invariant is the conjecture posed in 1987 by Faudree and Lehel that there exists an absolute constant $C$ such that $s(G)\leq \frac{n}{d}+C$ for each $d$-regular graph $G$ with $n$ vertices and $d\geq 2$, whereas a straightforward counting argument implies that $s(G)\geq \frac{n}{d}+\frac{d-1}{d}$. Until very recently this conjecture had remained widely open. We shall discuss recent results confirming it asymptotically, up to a lower order term. If time permits we shall also mention a few related problems, such as the 1--2--3 Conjecture or the concept of irregular subgraphs, introduced recently by Alon and Wei, and progress in research concerning these.
The Turán Number of Surfaces
Authors: Sankar Maya
Published: June 2023

We show that there is a constant $c$ such that any 3-uniform hypergraph $\HH$ with $n$ vertices and at least $cn^{5/2}$ edges contains a triangulation of the real projective plane as a sub-hypergraph. This resolves a conjecture of \kptz. Furthermore, our work, combined with prior results, asymptotically determines the Tur\'an number of all surfaces.
Upaya Mencegah Perilaku Bullying dan Meningkatkan Self Esteem Siswa SMP YP PGRI Disamakan Makassar
Authors: Angreini Dewi , Tajuddin Andi , Purwanto Joko , Munaing  , Aswar
Published: June 2023

Tujuan kegiatan Pangabdian Kepada Masyarakat (PKM) yaitu 1) untuk meningkatkan pengetahuan, sikap dan perilaku bullying oleh siswa, 2). Untuk meningkatkan upaya pencegahan bullying pada lingkungan sekolah dan lingkungan teman sebaya, serta 3) mewujudkan sekolah yag sehat dan bebas bullying. Kegiatan PKM ini dibuat dalam bentuk Sosialisasi dan Workshop yang berlangsung pada tanggal 7-8 Februari 2023 bertempat di Aula Sekolah SMP YP PGRI Disamakan Makassar. Yang melibatkan peserta sebanyak 30 orang siswa. Metode kegiatan PKM terdiri dari kegiatan observasi, wawancara dan metode ceramah serta diskusi yang diawali dengan pre-test dan post-tes, yang terbagi dalam Empat Tahapan yaitu Persiapan, Perencanaan, Pelaksanaan dan Evaluasi. Hasil dari kegiatan sosialisasi siswa SMP YP PGRI Disamakan Makassar telah mampu memhami dan menjelaskan pengetian dan jenis-jenis, dampak perilaku bullying serta dapat mencegah dan menekan perilaku bullying melalui peningkatan self esteem siswa. dengan nilai kasar sebesar 53.3 %. Serta telah terbentuk kelompok siswa yang menjadi pelopor untuk mewujudkan sekolah bebas bullying.
Pengolahan Buah Pisang Menjadi Nugget Pisang Oatmeal yang Bernial Jual
Authors: Aida Nurul , Wunta Krismariana , Anton Tirani , Tridawati Yunaini , Hikrawati  , Hajeni
Published: June 2023

Desa Tumbubara merupakan salah satu desa yang terletak di Kecamatan Bajo Barat, Kabupaten Luwu, Provinsi Sulawesi Selatan, memiliki tanah yang subur sehingga menghasilkan perkebunan buah pisang yang melimpah. Dari situlah mahasiswa Universitas Muhammadiya Palopo berkerja sama dan membuka peluang usaha bagi masyarakat yang ada di Desa Tumbubara untuk mendapatkan penghasilan dari panen buah pisang mereka dengan mengolah buah pisang menjadi makanan yang enak. Pengolahan buah pisang menjadi nugget pisang oatmeal yang bernilai jual bertujuan mengembangkan dan meningkatkan keterampilan mahasiswa untuk berwirausaha, sedangkan masyarakat bisa mendapat penghasilan dari jual-beli pisang kepada mahasiswa untuk diolah menjadi makan ringan yang enak dan sehat dikonsumsi. Kegiatan dilakukan melalui metode input, proses (produksi), output, dan evaluasi. Usaha homemade ini dipromosikan melalui media sosial, seperti instagram dan whatsapp, dan juga akan dipasarkan secara langsung ke masyarakat. Hasil dari usaha  pengelohan buah pisang menjadi nugget pisang outmeal yang bernilai jual ini memberikan peluang bagi mahasiswa untuk berwirausaha sebelum menyelesaikan studi, sehingga mereka nanti bisa membuka usaha sediri atau dapat melanjutkan usaha ini.
Effectiveness in a Political Context – Implications for Migration
Authors: Brunsson Karin
Published: June 2023

This paper builds on the presumption that the idea of effectiveness refers primarily to an organizational and managerial context. It asks the question how this idea is transformed when used as a rationale for action in contexts where economy and efficiency are of minor significance and where no organizational survival is at stake. The EU and Swedish migration policies show, however, that persistent egoistic implications help construct a specific territory as an organization to be managed much like a business firm.  It is concluded that the meaning of effectiveness does not necessarily change when this concept is used in an alien context. Instead, references to effectiveness help transform the context to which the concept is applied.
Kyai Achjat Irsjad Membangun Organisasi Politik dan Dakwah di Banyuwangi Tahun 1944-1963
Authors: Pratama Moch Sholeh , Mujahidul Anwari Ikhsan Rosyid
Published: June 2023

Abstract This paper examines the biography of Kyai Achjat Irsjad during his leadership in initiating and directing the NU Blambangan in 1944-1963. Kyai Achjat Irsjad's decision to establish the NU Blambangan was intended for the development of NU in the southern Banyuwangi. This study specifically writes about the arena of character, spiritual, and intellectual forging of Kyai Achjat Irsjad within the family, Islamic boarding schools and NU organizations. From the forging arena, Kyai Achjat Irsjad played a progressive role as a social, political and religious activist in Banyuwangi. The method used in this research is the Historical Method. The research data obtained from the Pegon Community, the memories of Kyai Achjat Irsjad's children, as well as supporting data in the form of scientific works. The results of the study found that Kyai Achjat Irsjad played an important role, some of which were in increasing access to education, performing the first edition of the Qur'an at the Indonesian Ministry of Religion, and strengthening the existence and influence of NU in southern Banyuwangi in the community.
Plataforma eVirtual de la UASLP: caso de implementación de un curso teórico
Authors: Nogueira Ruiz Guadalupe E.
Published: June 2023

El presente artículo muestra los resultados del estudio de la puesta en práctica de un curso teórico con el apoyo de la plataforma de eVirtual de la uaslp. En la primera parte, se muestran las generalidades de dicha plataforma, los objetos que proporciona y sus posibles aplicaciones; en la segunda la planeación y estructura del curso colocado en la Red, los cambios necesarios en la operatividad y dinámica del curso tradicional; y para terminar, los resultados obtenidos en respuesta a las preguntas y categorías preestablecidas para este estudio.
Movilidad intraurbana, modelos de gestión y complejidad de las ciudades: el caso del corredor de transporte confinado Optibús en la zona metropolitana de León, Guanajuato
Authors: Moreno Mata Adrián
Published: June 2023

El fenómeno de la dispersión metropolitana y su relación con la movilidad intraurbana, en particular con el problema del transporte público, pueden ser observados a través de distintas dimensiones y escalas de análisis. Tomando como caso de estudio la Zona Metropolitana de León, Guanajuato en México, y en particular el corredor confinado o carril exclusivo de transporte público Optibús, este artículo analiza la complejidad que puede alcanzar la implementación de diversas acciones dirigidas a mejorar el funcionamiento del transporte público urbano de superficie, mediante la instrumentación de un modelo de transporte denominado genéricamente brt (Bus Rapid Transit, por sus siglas en inglés). Para efectos prácticos, se examina el impacto de la instauración de este sistema de transporte en la zmleón, a partir de 2003, en las diferencias intraurbanas de accesibilidad y calidad del servicio de transporte público, así como su relación con otras variables espaciales, socioeconómicas y demográficas.
La enseñanza del dibujo en la formación del diseñador
Authors: Ariza Ampudia Silvia Verónica , Gaytán Aguirre Guadalupe
Published: June 2023

Desde tiempos inmemoriales el dibujo ha sido un medio de expresión fundamental para el ser humano, en el arte y el diseño el dominio de las manifestaciones gráficas es esencial para el entendimiento y la práctica de ambas disciplinas. Aún con las nuevas herramientas y los cambios en la conceptualización de la forma y el objeto artístico, así como los que se han dado en la proyección de soluciones objetual visuales, el dibujo sigue siendo esencial en la formación del diseñador y el profesional del arte. La forma en que han evolucionado los medios (el dibujo ya no sólo es grafito sobre papel, puede ser también luz en el espacio) nos da un norte sobre cómo ha cambiado su didáctica, lo hacen también el estudio de los procesos cognitivos y procedimentales así como la experiencia estética y creativa que se llevan a cabo en su aprendizaje.
La ciudad habla y escribe por sus muros
Authors: Guzmán Lechuga Adolfo
Published: June 2023

Este artículo tiene que ver con el tema del graffiti. El tema se desarrolla sobre la función y significado de éste dentro en la ciudad. Además el tema se expone con un enfoque comunicacional que intenta la reflexión en el lector, en la manera de ver y comprender el fenómeno de comunicación entre el graffiti y la ciudad; entendiendo éste, como la acción de escribir en los muros un mensaje con una carga ideológica y estética por los habitantes de la urbe, al mismo tiempo se muestra al graffiti, como una herencia lógica y natural de los primeros hombres para el resto de las generaciones. También es de interés para el autor, lograr que el lector reconozca la importancia y vigencia de las expresiones del graffiti tipográfico. El trabajo está estructurado en cinco subtemas en los que se expone la relación entre el graffiti y la ciudad.
Ciudad global. Imagen urbana, identidad cultural y marca
Authors: Acosta Mendoza Carina
Published: June 2023

A través de este estudio se analiza la visión actual del concepto de la ciudad global, tomando como puntos particulares las implicaciones en imagen urbana, la identidad cultural y la marca. Si bien, las ciudades hoy en día constituyen un papel vital para sus países, tratando de lograr un avance significativo que las haga diferentes de las demás, éstos cambios o avances son persuadidos por la globalización. Este trabajo comienza a partir de una recopilación bibliográfica de los conceptos de globalización, imagen, imagen urbana, identidad cultural y marca, ya que es importante tener una revisión de conceptos que fundamenten el ensayo. Se pretende hacer un análisis de puntos de vista de diferentes autores que afirman que la globalización es un fenómeno cuya finalidad podría ser causante de la disolución de las ciudades, así se rastrearán casos de estudio para concebir de una manera puntual estas transformaciones.
Los medios electrónicos como una alternativa sustentable para la disminución en el consumo de papel
Authors: Guerrero Salinas Manuel
Published: June 2023

El presente artículo es una reflexión sobre el quehacer de la disciplina, sus implicaciones ambientales y la utilización de medios electrónicos como alternativa para disminuir el impacto ambiental causado por el uso y abuso en el consumo de papel, utilizando de manera desmedida los recursos naturales y de igual manera contaminando el planeta. Por ello, actualmente las preocupaciones por el medio ambiente, el calentamiento global, la extinción de especies y el fin de los recursos naturales es evidente, al punto que se ha convertido en un tema central en diferentes disciplinas como la arquitectura, el urbanismo, la ingeniería, las ciencias químicas, etc.; y aunque en menor medida, es un tema que se ha abordado también desde el diseño gráfico.
Dampak Tindak Pidana Pungli terhadap Perekonomian dan Investasi di Indonesia
Authors: Alfaridzi Muhammad , Agustin Nenty , Susanto Aldo Permana Putra , Hosnah Asmak UI
Published: June 2023

The purpose of this study is to explain that extortion (illegal levies) is the imposition of fees in places that should not be charged or collected. Extortion itself (illegal levies) is also often equated with extortion, fraud, or corruption. This is the impact of criminal acts in the Criminal Code rules. Extortion (illegal levies) itself is not clearly contained in the Criminal 2 Code, but illegal levies are the same as included in the criminal acts of fraud, extortion, and corruption that have been regulated in the Criminal Code. This research method uses library research (Library Research). Extortion (illegal levies) has a major impact on the economy and investment in Indonesia by having a negative impact on people who have a direct interest in public services. Extortion (illegal levies) has several causative factors such as cultural factors and organizational culture. Efforts to deal with extortion (illegal levies) are by means of repressive measures in the form of investigations into eradicating extortion in terms of its object, namely from the law itself.
Genetic Profiling of African American Patients With Prostatic Adenocarcinoma Metastatic to the Lymph Nodes: A Pilot Study
Authors: Bidot Samuel , Yin Jun , Zhou Pengbo , Zhang Linsheng , Deeb Kristin K. , Smith Geoffrey , Hill Charles E. , Xiu Joanne , Bilen Mehmet A. , Case Katherine B. , Tinsley Mazie , Carthon Bradley , Harik Lara R.
Published: June 2023

Context.—

Genetic profiling data of prostatic adenocarcinoma are derived from predominantly White patients. In African Americans, prostatic adenocarcinoma has a poorer prognosis, raising the possibility of distinct genetic alterations.

Objective.—

To investigate the genomic alterations of prostatic adenocarcinoma metastatic to regional lymph nodes in African American patients, with an emphasis on SPOP mutation.

Design.—

We retrospectively reviewed African American patients with pN1 prostatic adenocarcinoma managed with radical prostatectomy and lymph node dissection. Comprehensive molecular profiling was performed, and androgen receptor signaling scores were calculated.

Results.—

Nineteen patients were included. The most frequent genetic alteration was SPOP mutations (5 of 17; 29.4% [95% CI: 10.3–56.0]). While most alterations were associated with a high androgen receptor signaling score, mutant SPOP was exclusively associated with a low median and interquartile range (IQR) androgen receptor signaling score (0.788 [IQR 0.765–0.791] versus 0.835 [IQR 0.828–0.842], P = .003). In mutant SPOP, mRNA expression of SPOP inhibitor G3BP1 and SPOP substrates showed a significantly decreased expression of AR (33.40 [IQR 28.45–36.30] versus 59.53 [IQR 53.10–72.83], P = .01), TRIM24 (3.95 [IQR 3.28–5.03] versus 9.80 [IQR 7.39–11.70], P = .008), and NCOA3 (15.19 [IQR 10.59–15.93] versus 21.88 [IQR 18.41–28.33], P = .046).

Conclusions.—

African American patients with metastatic prostate adenocarcinoma might have a higher prevalence of mutant SPOP (30%), compared to ∼10% in unselected cohorts with lower expressions of SPOP substrates. In our study, in patients with mutant SPOP, the mutation was associated with decreased SPOP substrate expression and androgen receptor signaling, raising concern for suboptimal efficacy of androgen deprivation therapy in this subset of patients.
Behind Bars, But Ahead of the Game: Making Reading Memories with Parents Who Are Incarcerated
Authors: Verbeten Sharon
Published: June 2023

When a parent is incarcerated, that situation brings challenges not only to the parent in jail, but also to the family left at home. A program of the University of Wisconsin-Madison Extension is hoping to not only reconnect families but also to bring an element of literacy to their interactions.
Access for All: Adapted Literacy Through Low-Tech Assistive Technology
Authors: Galyon Cathy L. , Floyd Kim K. , Wood-Fields Colleen F.
Published: June 2023

Three-year-old Kasey has cerebral palsy (CP) with seizures. He often pushes books away, putting his head down instead. Kasey is learning preliteracy skills and enjoys manipulating objects but has great difficulty with fine motor abilities.Kasey’s twin, Kolby, also has CP. He enjoys having books read to him. He will often seek out books during check-out time, but he cannot interact with them on his own because of fine motor difficulties. His strengths include enjoying the computer with an adaptive switch, and he has the ability to understand key concepts in a story.Chandler is an active four-year-old with language delay, who often engages in imaginary play where he fights with ninjas during storytime. He seldom initiates looking at books, and when he does, he folds the pages, bends the corners of the book, or even tears the pages. During sensory activities such as playing in sand, finger painting, and playing with play dough, he is very attentive and will not leave that area. His strengths include his sustained attention to the sensory area and manipulatives table, his imagination, and his understanding of simple plots.
Stan Is THE Van: Mobile Makerspace a Hit in Ohio
Authors: Walsh Shawn
Published: June 2023

Stan the Tech Van is an experience on wheels belonging to Madison (OH) Public Library (MPL). It’s not just a 2022 Ram Promaster 2500 cargo van; it can hold an FDM 3D printer along with other tech on carts in the back. We chose a high roof delivery van to allow any staff member the ability to drive Stan for a program or event since it does not require a commercial driver’s license. Stan is outfitted with delivery shelving, a roof rack, and an awning package as well as a powered Gramps Aluminum Gated Commercial Van Ramp System. It’s more than a vehicle that holds enough LEGO Robotics that a staff member doesn’t have to clean out his or her car to get a classroom set out to a school. It’s a mobile makerspace that holds all types of machines that anyone can use to create all sorts of projects.
Couples who Collaborate: Mary Ann and Perry Hoberman
Authors: Sableski Mary-Kate
Published: June 2023

Though this column usually highlights couples in the more traditional sense of the word, typically in a committed relationship in any form, defining the term more widely yields a delightful collection of couples who collaborate to produce children’s books.The Pumphrey brothers were the first sibling couple discussed (see vol. 19, no. 4 (2021): 27–29). In this column, we feature a mother-son duo, Mary Ann and Perry Hoberman, who have partnered for their very first collaboration, Away with Words (2022). No stranger to family collaboration, Mary Ann describes a dream come true, partnering with her son to create a picture book, and Perry, a well-known artist in his own right, shares similar sentiments to describe collaborating with his legendary mother to create another contribution to her impressive collection of children’s books.
Research Roundup: Building in the Library: The Importance of Block Play
Authors: Diamant-Cohen Betsy , Sensale Yazdian Lisa M.
Published: June 2023

Some libraries have had puzzles, toys, and blocks as part of their children’s room offerings for more than twenty years. For others, the emphasis on play as one of Every Child Ready to Read’s five practices has inspired them to add these to their collections.Building with construction toys helps children develop many different skills—creative problem solving, engineering, learning through mistakes, language to communicate with others who are building with them, and exercising their imagination when explaining what the structure they have built is meant to be. They also may be matching colors, looking for patterns, using planning skills, learning patience and persistence, cooperating with others for group builds, having fun, and experiencing a boost in self-confidence when they finally succeed in building what they intended to build. Written materials specifically for children’s librarians and early childhood educators explain the value of these activities and provide many developmental tips for parents and caregivers. Below are a few recommended resources.
Membership Committee: Member Profiles
Authors: Zaharako Sarah Jo
Published: June 2023

Rosie Camargo, Cultural Literacy Specialist, South Holland (IL) Public LibraryAryssa Damron, Children’s Librarian, Washington, DC, Public Library SystemSally Battle, Youth Programming Librarian, Mount Prospect (IL) Public Library
HAKİKAT ÖTESİ DÖNEMDE MARKALARA YÖNELİK TÜKETİCİ ALGISI: VAKA ÇALIŞMASI
Authors: ÇELİK Betül
Published: June 2023

Son on yılda hızla gelişen teknoloji, insanların iletişim kurdukları gerçek mekanlardan ziyade çevrimiçi oldukları sanal mekanlarda daha çok vakit geçirmelerine sebep olmuştur. Markalar, tüketici potansiyelini korumak veya arttırabilmek için artık bu çevrimiçi sosyal paylaşım platformlarını aktif olarak takip etmek, gerekli zamanlarda da platformlarda ‘öncü’ rol oynamak zorundadırlar. Bu araştırmada hakikat ötesi dönemde global markaların güncel olaylardan nasıl etkilendiği, bu güncel olayların/durumların tüketici algısını nasıl şekillendirdiği, markaların tüketici sadakatini korumak ve tüketicide marka farkındalığını arttırmak için ne tür çözüm yolları geliştirmesi gerektiği üzerine sorular sorulmaktadır. Bu nedenle hakikat ötesi kavramının tüketici algısı ve marka alt basamakları kavramları sınırlılığıyla ele alınarak incelenmesi makalenin önemini oluşturmaktadır. Hakikat ötesi kavramını, tüketici algısı ve marka alt basamakları çerçevesindeki vaka çalışmalarıyla ele alıp incelemek makalenin amacını oluşturmaktadır. Araştırmada, nitel veri toplama aracı olan vaka çalışması yapılmıştır. Vaka çalışması sonucunda araştırmada global markaların, sıklıkla değişen siyasal, çevresel ve sosyolojik unsurları, kendi amaç ve hedefleri doğrultusunda kullanarak tüketicinin algısını, marka sadakatini ve marka farkındalığını yönlendirdiği elde edilen bulgulardandır. Ayrıca araştırmada markaların paylaşım ve açıklamaları ilgili olaylardaki gerçeklikten ziyade, tüketicinin satın alma davranışının sürekliliğini sağlamaktır.
Pandemi Sonrası Hızlanan Dijital Pazarlama Uygulamaları
Authors: Durukan Tülin
Published: June 2023

Üretimde büyük rol oynayan internet teknolojisi son yıllarda ürün ve hizmetlerin müşterilere ulaştırılmasında da önemli bir rol oynamaktadır. Dijital ortamlar üzerinden söz konusu ürünlerin tanıtımı ve pazarlama faaliyeti olarak tanımlanan dijital pazarlama, hızlı gelişen yöntemler ile günlük hayatın vazgeçilmezleri arasında yer almaya başlamıştır. Web siteler, sosyal medya platformları, arama motorları ve mobil uygulamalar aracılığı ile ürün ve hizmetlerin satışını sağlayan dijital pazarlama; elektronik ortamda sunulan ve yürütülen etkili bir pazarlama yöntemidir. İşletmeler, hedef kitlelere ulaşmalarını sağlayan en iyi yöntemi ve kanalı kullanarak dijital pazarlama ile daha fazla ürün satmayı ve karlılıklarını artırmayı hedeflemektedirler.
2020 yılı başlarında tüm dünyayı etkisi altına alan COVID19 salgını ekonomik ve sosyal hayatı etkisi altına alan ve hükümetleri çeşitli önlemler almaya mecbur bırakan pandemi dönemi olarak tarihe geçmiştir. Salgın döneminde insanların yaşamlarında önemli değişiklikler meydana gelmiş, büyük korku ve travmaların yaşanmasına neden olmuştur. Yüksek bulaş hızı ve mutasyon nedeniyle karantina, sosyal mesafe, evden çalışa ve maske gibi zorunlu tedbirleri de beraberinde getiren pandemik dönemde tüketiciler ihtiyaçlarını karşılamak amacıyla hızlı ve pratik bir yol olan e-ticareti tercih etmişlerdir. Dijital pazarlamanın canlanması ve hız kazanmasına neden olan COVID19 salgını tüketicilerin fiziksel ortamda gerçekleştirdikleri alışverişlerin dijital ortamlara taşınmasına neden olmuştur. 
Pandemi sonrası tüketim alışkanlıkları değişen tüketiciler için dijital kanallar yeni pazar yerleri haline gelmiş, dijital pazarlamanın başarısı oluşturulan içerikler ile ilişkilendirilmiştir. İçerik yönetimi dijital pazarlamada başarılı olmak için kritik bir rol oynamaktadır. İşletmelerin hedef kitlelere ulaşmak ve ilgisini çekmek için kaliteli içerik üretmelerinin gerekliliği zamanla tüm dijital kanallarda önemli bir uygulama haline gelmiştir. Dijital platformlarda son trendi oluşturan yapay zeka uygulamaları ise makine öğrenimi odaklı olup, yapay zeka ve dijital pazarlama arasındaki ilişkinin tüketici tercihlerini esas alarak işletme karlılığı adına gerçekleştirmesine katkı sağlamaktadır.
Son yıllarda hız kazanan dijital pazarlama uygulamaları ve uygulanan dijital kanallar tüketicilerin satın alma alışkanlıklarında gelenekselden dijitale evrilmede kolaylığı, rahatlığı ve zaman/mekan kazanımını da beraberinde getirmiştir. Pek çok kanal ile gerçekleşen yeni nesil pazarlama faaliyetlerinde içeriklerin ve yapay zeka kullanımının incelendiği bu çalışmanın alana ışık tutması ve katkı sağlaması ümit edilmektedir.
THE PROBLEMS OF SUFFERING, RETRIBUTIVE JUSTICE, AND PROPOSED MORALITY IN THE BOOK OF JOB
Authors: Irwan Irwan
Published: June 2023

Penderitaan adalah bagian dari hidup manusia. Manusia berusaha memahami  mengapa  ada penderitaan  dan  bagaimana harus menyikapinya. Kebijaksanaan Israel kuno berusaha memahami misteri penderitaan itu, salah satunya adalah Kitab Ayub. Melalui studi pustaka, artikel ini menyelidiki jawaban Kitab Ayub terhadap persoalan penderitaan manusia dan bagaimana manusia menjalani hidupnya (moralitas) tatkala penderitaan menimpanya.
THE TRUTH IS SYNTHETIC: DOGMATICS AS SYNTHESIS
Authors: Angelo Luciani Moa Dosi WODA
Published: June 2023

Pemahaman ajaran Gereja Universal mengenai keabadian jiwa, api penyucian, surga, dan neraka bukan hanya berkaitan tentang hal-hal yang terjadi pada akhir jaman. Bukan pula upaya mengelaborasi cabang teologi sistematika terakhir yang disebut eskatologi. Melainkan, upaya memahami ajaran iman Kristiani sejak permulaannya hingga keselamatan yang definitif pada hidup yang akan datang. Itu berarti melihat kesatuan teologi dalam  misteri  keselamatan  Allah  melalui  peristiwa  Yesus  Kristus  dan kuasa Roh Kudus yang hadir dalam Gereja kepada seluruh umat manusia. Itulah sebabnya, ajaran iman Gereja universal mengenai misteri hidup yang   kekal   bukanlah   suatu   utopia,   khayalan,   atau   impian   belaka, melainkan suatu realitas hidup yang bersumber dari misteri Allah Tritunggal, Yesus Kristus, dan Gereja universal.