This study investigates the creative methodology and conceptual framework underlying the visual identity design of the core graphics for the 2022 Hangzhou Asian Games. Employing a case study approach grounded in Oriental aesthetic theory, this paper examines how traditional Chinese cultural elements can be systematically integrated into contemporary sports event branding. The research contributes to the field of visual communication design by proposing a theoretical framework that synthesizes Yi Xiang (意象, imagery), Yi Jing (意境, artistic conception), and Jing Jie (境界, realm) as guiding principles for mega-event visual identity development. Through comparative analysis of international precedents including the Olympic Games visual systems, this study demonstrates how the Hangzhou Asian Games core graphics achieve a harmonious balance between cultural authenticity and global visual communication standards. The findings offer practical implications for designers and event organizers seeking to develop culturally resonant yet internationally accessible visual identity systems for major sporting events.
Erd{\H o}s (1963) initiated extensive graph discrepancy research on 2-edge-colored graphs. Gishboliner, Krivelevich, and Michaeli (2023) launched similar research on oriented graphs. They conjectured the following extension of Dirac's theorem: If $D$ is an oriented graph on $n \ge 3$ vertices with minimum degree $δ(D) \ge n/ 2$, then $D$ contains a Hamilton oriented cycle with at least $δ(D)$ arcs in the same direction. This conjecture was proved by Freschi and Lo (2024) who posed an open problem to extend their result to an Ore-type condition. We propose two conjectures for such extensions and prove results which provide support to the conjectures.
In this paper, we consider the inverse submonoids $AOR_n$ of oriented transformations and $AOP_n$ of orientation-preserving transformations of the alternating inverse monoid $AI_n$ on a chain with $n$ elements. We compute the cardinalities, describe the Green's structures and the congruences, and calculate the ranks of $AOR_n$ and $AOP_n$.
Many bird species have shown temporal changes in their migration phenology due to global warming. The phenomenon of bird species advancing their spring phenology in response to warmer spring temperatures is well-documented and extensively studied. However, autumn phenology, a crucial component of the migrating birds’ annual cycle, has garnered less attention. In contrast to spring phenology, which often exhibits consistent timing changes across the majority of species, the timing of autumn migratory events is subject to greater variability. In this research, we explored the trends in autumn migration and the impact of climate change on these patterns. Our analysis was grounded in a 39-year dataset of bird-banding records from the Changdao Raptor Migration Observatory in China, a key migration bottleneck for East Asian-Australasian Flyway. The dataset encompassed three prevalent migratory raptors: the Oriental Scops Owl (Otus sunia), the Japanese Sparrowhawk (Tachyspiza gularis), and the Eurasian Sparrowhawk (Accipiter nisus). Our analysis showed that the autumn migration timing for these three prevalent raptors has been significantly influenced by climatic changes occurring at both the breeding and stopover sites. The median passage dates for the Oriental Scops Owls and Japanese Sparrowhawks advanced significantly, whereas the Eurasian Sparrowhawks delayed their passage date significantly. The Eastern Atlantic/Western Russia Index, the North Atlantic Oscillation, and the local weather dynamics along the migration route played pivotal roles in shaping the autumn migration timings of the three common raptors. In summary, our findings, based on extensive long-term ringing data, reveal distinct temporal trends in the autumn migration patterns of three small raptors in Asia, highlighting the pivotal climate indices linked to these trends.
Tsuyoshi Urata, Manato Yokoyama, Haruki Miyaji
et al.
The C-Orientation problem asks whether it is possible to orient an undirected graph to a directed phylogenetic network of a desired network class C. This problem arises, for example, when visualising evolutionary data, as popular methods such as Neighbor-Net are distance-based and inevitably produce undirected graphs. The complexity of C-Orientation remains open for many classes C, including binary tree-child networks, and practical methods are still lacking. In this paper, we propose an exact FPT algorithm for C-Orientation that is applicable to any class C and parameterised by the reticulation number and the maximum size of minimal basic cycles, and a very fast heuristic for Tree-Child Orientation. While the state-of-the-art for C-Orientation is a simple exponential time algorithm whose computational bottleneck lies in searching for appropriate reticulation vertex placements, our methods significantly reduce this search space. Experiments show that, although our FPT algorithm is still exponential, it significantly outperforms the existing method. The heuristic runs even faster but with increasing false negatives as the reticulation number grows. Given this trade-off, we also discuss theoretical directions for improvement and biological applicability of the heuristic approach.
In 1967, Katona and Szemerédi showed that no undirected graph with $n$ vertices and fewer than $\frac{n}{2}\log_2\frac{n}{2}$ edges admits an orientation of diameter two. In 1978, Chvátal and Thomassen revealed the complexity of determining whether an undirected graph can be oriented to achieve a diameter of two, proving it to be NP-complete. This breakthrough has sparked ongoing interest in identifying sufficient conditions for graphs to be oriented with the smallest possible diameter of two -- critical for optimizing communication and network flow in larger structures. In 2019, Czabarka, Dankelmann, and Székely significantly advanced this field by establishing that the minimum degree threshold for achieving such an orientation in undirected graphs of order $n$ is $\frac{n}{2} + Θ(\ln n)$. In this paper, we extend this foundational result by determining the minimum degree threshold necessary for realizing an orientation with diameter two in mixed graphs, which contain both undirected and directed edges. Mixed graphs offer a versatile framework, representing an intermediate stage in the orientation process, making our findings a substantial generalization of previous results.
BackgroundThis study utilized recent advancements in electroencephalography (EEG) technology that enable the measurement of prefrontal event-related potentials (ERPs) to facilitate the early detection of mild cognitive impairment (MCI). We investigated two-channel prefrontal ERP signals obtained from a large cohort of elderly participants and compare among cognitively normal (CN), subjective cognitive decline (SCD), amnestic MCI (aMCI), and nonamnestic MCI (naMCI) groups.MethodsSignal processing and ERP component analyses, specifically adapted for two-channel prefrontal ERP signals evoked by the auditory oddball task, were performed on a total of 1,754 elderly participants. Connectivity analyses were conducted to assess brain synchronization, especially in the beta band involving the phase locking value (PLV) and coherence (COH). Time-frequency, time-trial, grand average, and further statistical analyses of the standard and target epochs were also conducted to explore differences among the cognition groups.ResultsThe MCI group’s response to target stimuli was characterized by greater response time variability (p < 0.001) and greater variability in the P300 latency (p < 0.05), leading to less consistent responses than those of the healthy control (HC) group (CN+SCD subgroups). In the connectivity analyses of PLV and COH waveforms, significant differences were observed, indicating a loss of synchronization in the beta band in response to standard stimuli in the MCI group. In addition, the absence of event-related desynchronization (ERD) indicated that information processing related to readiness and task performance in the beta band was not efficient in the MCI group. Furthermore, the observed decline in the P200 amplitude as the standard trials progressed suggests the impaired attention and inhibitory processes in the MCI group compared to the HC group. The aMCI subgroup showed high variability in COH values, while the naMCI subgroup showed impairments in their overall behavioral performance.ConclusionThese findings highlight the variability and connectivity measures can be used as markers of early cognitive decline; such measures can be assessed with simple and fast two-channel prefrontal ERP signals evoked by both standard and target stimuli. Our study provides deeper insight of cognitive impairment and the potential use of the prefrontal ERP connectivity measures to assess early cognitive decline.
The intricate interplay of source dynamics, unreliable channels, and staleness of information has long been recognized as a significant impediment for the receiver to achieve accurate, timely, and most importantly, goal-oriented decision making. Thus, a plethora of promising metrics, such as Age of Information, Value of Information, and Mean Square Error, have emerged to quantify these underlying adverse factors. Following this avenue, optimizing these metrics has indirectly improved the utility of goal-oriented decision making. Nevertheless, no metric has hitherto been expressly devised to evaluate the utility of a goal-oriented decision-making process. To this end, this paper investigates a novel performance metric, the Goal-oriented Tensor (GoT), to directly quantify the impact of semantic mismatches on the goal-oriented decision making. Based on the GoT, we consider a sampler-decision maker pair that work collaboratively and distributively to achieve a shared goal of communications. We formulate an infinite-horizon Decentralized Partially Observable Markov Decision Process (Dec-POMDP) to conjointly deduce the optimal deterministic sampling policy and decision-making policy. The simulation results reveal that the sampler-decision maker co-design surpasses the current literature on AoI and its variants in terms of both goal achievement utility and sparse sampling rate, signifying a notable accomplishment for a sparse sampler and goal-oriented decision maker co-design.
How efficient are computerised tools in studying women’s history? Can the field benefit from highly technicalised approaches more than qualitative approaches? Is qualitative data quantified when we analyse literary texts for women’s history with computerised tools, or are these in fact opposite? In this essay, I address these questions with examples from my research on Battal Ghazi texts from the sixteenth to the early twentieth centuries, especially looking at books written in the early 1940s and 1970s and their spatial references to Christian Greek women and Muslim men. I focus on the aforementioned methodological questions that have emerged from the ongoing research and argue that computerised data is only meaningful when in direct dialogue with textual and historical analysis of gender, thus cannot be understood in a vacuum.
Indo-Iranian languages and literature, Literature (General)
The ethnography of Nepal has much to contribute to discussions concerning the relationship of caste systems to the state and to kingship, but this material is almost entirely absent from the discussion as it has taken place in Indian ethnography. Yet the Nepal material — in particular the legal code known as the Muluki Ain of 1854 — not only throws light on dominant caste conceptions of the relations among castes and their relations to the state or to kingship, but also on the supposed distinction between caste and tribe, which appears to have had as little utility in nineteenth century Nepal as it did elsewhere on the sub-continent. This paper argues that although the study of the British Empire in India has been replaced by the area concept of South Asia, in the intellectual practice of American anthropologists (and perhaps other scholars) working in India, the modern Indian state is treated in effect as being synonymous with the concept of South Asia, and their scholarship shows little engagement with studies carried out in the other countries of the region. This approach is encouraged by the architecture of South Asian area studies, which is organized on the basis of national political boundaries.
Establishing a consistent normal orientation for point clouds is a notoriously difficult problem in geometry processing, requiring attention to both local and global shape characteristics. The normal direction of a point is a function of the local surface neighborhood; yet, point clouds do not disclose the full underlying surface structure. Even assuming known geodesic proximity, calculating a consistent normal orientation requires the global context. In this work, we introduce a novel approach for establishing a globally consistent normal orientation for point clouds. Our solution separates the local and global components into two different sub-problems. In the local phase, we train a neural network to learn a coherent normal direction per patch (i.e., consistently oriented normals within a single patch). In the global phase, we propagate the orientation across all coherent patches using a dipole propagation. Our dipole propagation decides to orient each patch using the electric field defined by all previously orientated patches. This gives rise to a global propagation that is stable, as well as being robust to nearby surfaces, holes, sharp features and noise.
Recently, Network Embedding (NE) has become one of the most attractive research topics in machine learning and data mining. NE approaches have achieved promising performance in various of graph mining tasks including link prediction and node clustering and classification. A wide variety of NE methods focus on the proximity of networks. They learn community-oriented embedding for each node, where the corresponding representations are similar if two nodes are closer to each other in the network. Meanwhile, there is another type of structural similarity, i.e., role-based similarity, which is usually complementary and completely different from the proximity. In order to preserve the role-based structural similarity, the problem of role-oriented NE is raised. However, compared to community-oriented NE problem, there are only a few role-oriented embedding approaches proposed recently. Although less explored, considering the importance of roles in analyzing networks and many applications that role-oriented NE can shed light on, it is necessary and timely to provide a comprehensive overview of existing role-oriented NE methods. In this review, we first clarify the differences between community-oriented and role-oriented network embedding. Afterwards, we propose a general framework for understanding role-oriented NE and a two-level categorization to better classify existing methods. Then, we select some representative methods according to the proposed categorization and briefly introduce them by discussing their motivation, development and differences. Moreover, we conduct comprehensive experiments to empirically evaluate these methods on a variety of role-related tasks including node classification and clustering (role discovery), top-k similarity search and visualization using some widely used synthetic and real-world datasets...
Naomi Jade Kellogg, Anton Boesgaard Andersen, Rebecca Biraschi
et al.
Changing demands of the agricultural sector, due to male out-migration, have been shown to influence power dynamics and livelihood strategies within households, communities, and broader society. These shifts have led to a rise in women’s agricultural engagement in Nepal. In hypothesizing the outcomes of what has been defined as the feminization of agriculture on the women left behind, the existing literature has created a (dis)empowerment binary. Based on field work conducted in Chitwan, we initially confirm that women do experience that increased agricultural engagement presents both the potential for an increased burden and an opportunity for empowerment. Our research then goes beyond this binary, by utilizing the concept of inevitability, revealing both the micro and macro level nexi of migration, agriculture, and gender in relation to the feminization of agriculture in Nepal. By underscoring the double inevitability of both male out-migration itself and women’s roles within their households we argue we can more accurately represent our informants’ lived realities and thereby provide an alternative to the (dis)empowerment binary for future research. This includes the recognition of a relational nature of the feminization of agriculture phenomenon, which is often overlooked in the current discourse.
Given a set $F$ of oriented graphs, a graph $G$ is an $F$-graph if it admits an $F$-free orientation. Building on previous work by Bang-Jensen and Urrutia, we propose a master algorithm that determines if a graph admits an $F$-free orientation when $F$ is a subset of the orientations of $P_3$ and the transitive triangle. We extend previous results of Skrien by studying the class of $F$-graphs, when $F$ is any set of oriented graphs of order three. Structural characterizations for all such sets are provided, except for the so-called perfectly-orientable graphs and one of its subclasses, which remain as open problems.