http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Amy Chan Hyung Kim,Janelle E. Wells,Yu Kyoum Kim,Pakianathan Chelladurai 한국체육학회 2012 International journal of human movement science Vol.6 No.2
Over the last three decades, hosting mega-sport events have been popular due to political, cultural, and economic benefits. When it comes to maximizing the potential benefits of events, it is critical to manage and satisfy the stakeholders who affect the event or are affected by the event. For this, many management literatures have developed organizational strategies to identify and satisfy influential groups for the pursuit of organizational goals by focusing on dyadic relationships between focal organizations and stakeholder groups. Yet, embracing the fact that these studies tend to ignore the autonomous relationships among stakeholders, this study introduces the model of multi-stakeholder network in mega-sport events settings to highlight the importance of stakeholders’ interactions. The purpose of this study is: 1) to develop a conceptual framework for the model of multi-stakeholder network employing an issue-focused stakeholder management approach and social network analysis in mega-sport events settings, and 2) to simulate a model by creating a random stakeholder network from the issue categories and external stakeholder groups identified by Parent (2008) to provide empirical implications. The theoretical, methodological, and practical implications of the model, and future directions are discussed.
LONG PATHS IN THE DISTANCE GRAPH OVER LARGE SUBSETS OF VECTOR SPACES OVER FINITE FIELDS
BENNETT, MICHAEL,CHAPMAN, JEREMY,COVERT, DAVID,HART, DERRICK,IOSEVICH, ALEX,PAKIANATHAN, JONATHAN Korean Mathematical Society 2016 대한수학회지 Vol.53 No.1
Let $E{\subset}{\mathbb{F}}^d_q$, the d-dimensional vector space over the finite field with q elements. Construct a graph, called the distance graph of E, by letting the vertices be the elements of E and connect a pair of vertices corresponding to vectors x, y 2 E by an edge if ${\parallel}x-y{\parallel}:=(x_1-y_1)^2+{\cdots}+(x_d-y_d)^2=1$. We shall prove that the non-overlapping chains of length k, with k in an appropriate range, are uniformly distributed in the sense that the number of these chains equals the statistically correct number, $1{\cdot}{\mid}E{\mid}^{k+1}q^{-k}$ plus a much smaller remainder.
Long paths in the distance graph over large subsets of vector spaces over finite fields
Michael Bennett,Jeremy Chapman,David Covert,Derrick Hart,Alex Iosevich,Jonathan Pakianathan 대한수학회 2016 대한수학회지 Vol.53 No.1
Let $E \subset {\mathbb F}_q^d$, the $d$-dimensional vector space over the finite field with $q$ elements. Construct a graph, called the distance graph of $E$, by letting the vertices be the elements of $E$ and connect a pair of vertices corresponding to vectors $x,y \in E$ by an edge if $||x-y||:={(x_1-y_1)}^2+\dots+{(x_d-y_d)}^2=1$. We shall prove that the non-overlapping chains of length $k$, with $k$ in an appropriate range, are uniformly distributed in the sense that the number of these chains equals the statistically correct number, $1 \cdot {|E|}^{k+1}q^{-k}$ plus a much smaller remainder.