Prospect Theory and China's Nuclear Signaling in Territorial Disputes

학위논문(석사)--서울대학교 대학원 :국제대학원 국제학과(국제지역학전공),2019. 8. Sheen, Seong-Ho.China's growing power and attitude toward its coercive use has profound implications for regional stability in the Asia-Pacific. One critical component to that stability is China's crisis behavior in key territorial disputes throughout the region. This paper seeks to understand the nature of China's nuclear deterrent threats in the post-Cold War era by identifying the conditions under which Chinese leaders choose nuclear coercion over other viable policy alternatives. Second, the paper explores the utility of applying prospect theory to China's crisis behavior to identify those conditions within a new prospect theory model. The findings suggest that, first, the decision to engage in nuclear coercion is influenced, in large part, by considerations about the status of ones own territorial sovereignty and integrity. Second, the findings challenge realist predictions about Chinas military trajectory by suggesting that, as Chinas power grows, Beijing will be placed in fewer disadvantageous positions, thereby limiting the need to adopt coercive policies like nuclear threats. Finally, these findings suggest that prospect theory has significant explanatory and predictive power, both in international relations as well as Chinas crisis management behavior.중국의 확장하고 있는 힘과 강압적인 태도는 아시아 태평양 지역 안정에 중대한 영향을 미친다. 아시아 전역의 영토 분쟁에서 이러한 안정을 이루기 위한 중요한 요소 중 하나는 중국의 위기 행동이다. 이 논문은 중국 지도자들이 다른 실행 가능한 정책 대안이 아닌 핵 억지력을 선택하는 상황의 조건을 확인하여 냉전 후 중국의 핵 제지 위협의 성격을 이해하고자 한다. 둘째, 이 논문은 그 조건들을 확인하기 위해 중국의 위기 행동에 대한 새로운 전망 이론의 유용성을 탐구한다. 우선, 이 연구 결과는 영토의 주권과 보전이 핵 강제에 관여하기로 한 결정에 큰 영향을 미친다고 제안한다. 또한, 중국의 권력이 성장함에 따라 베이징이 불리한 위치에 놓이게 되어 핵 강제와 같은 강압적인 정책을 채택할 필요가 없다는 것을 제시함으로써 중국 군의 방향에 대한 현실주의 예측에 이의를 제기한다. 마지막으로, 이러한 결과는 전망 이론이 국제 관계와 중국의 위기 관리 행동에서 중요한 설명력과 예측력을 가지고 있음을 시사한다.CHAPTER I: INTRODUCTION 1 1. Study Background 1 2. Research Purpose and Objectives 2 3. Thesis Structure 7 4. Literature Review 8 CHAPTER II: RESEARCH DESIGN 28 1. Major Concepts: Establishing Working Definitions 28 2. Theoretical Framework 34 3. Hypotheses 55 4. Case Study Design 56 CHAPTER III: CASE STUDY 62 1. Senkaku/Diaoyu Islands Dispute 2012-2013 62 2. Senkaku/Diaoyu Islands Dispute 2014-2018 93 CHAPTER IV: ANALYSIS & CONCLUSIONS 115 1. Summary of Research Objectives, Findings and Implications 115 2. Limitations and Areas of Future Research 124Maste

Size and Scope of Morgan County Agriculture 2019

This fact sheet describes the size and scope of agriculture in Morgan County, including growing season, crop production, livestock production, farm income, and age of operator

Size and Scope of Weber County Agriculture 2019

Weber County is located in the northern part of the state and borders the Great Salt Lake. The growing season averages over 4 months, and this guide provides locations of the first and last freeze and the annual precipitation. The majority of the land is privately owned. This fact sheet explores the size and scope of agriculture in Weber County in 2019

Computer Vision Based Route Mapping

The problem our project solves is the integration of edge detection techniques with mapping libraries to display routes based on images. To do this, we used the OpenCV library within an Android application. This application lets a user import an image from their device, and uses edge detection to pull out a path from the image. The application can find the user\u27s location and uses it alongside the path data from the image to create a route using the physical roads near the location. The shape of the route matches the edges from the given image and the user can then follow along in real time. We chose this project to further explore the use of technologies like computer vision and web APIs, while also creating a useful app

Easiness Amplification and Uniform Circuit Lower Bounds

We present new consequences of the assumption that time-bounded algorithms can be "compressed" with non-uniform circuits. Our main contribution is an "easiness amplification" lemma for circuits. One instantiation of the lemma says: if n^{1+e}-time, tilde{O}(n)-space computations have n^{1+o(1)} size (non-uniform) circuits for some e > 0, then every problem solvable in polynomial time and tilde{O}(n) space has n^{1+o(1)} size (non-uniform) circuits as well. This amplification has several consequences: * An easy problem without small LOGSPACE-uniform circuits. For all e > 0, we give a natural decision problem, General Circuit n^e-Composition, that is solvable in about n^{1+e} time, but we prove that polynomial-time and logarithmic-space preprocessing cannot produce n^{1+o(1)}-size circuits for the problem. This shows that there are problems solvable in n^{1+e} time which are not in LOGSPACE-uniform n^{1+o(1)} size, the first result of its kind. We show that our lower bound is non-relativizing, by exhibiting an oracle relative to which the result is false. * Problems without low-depth LOGSPACE-uniform circuits. For all e > 0, 1 < d < 2, and e < d we give another natural circuit composition problem computable in tilde{O}(n^{1+e}) time, or in O((log n)^d) space (though not necessarily simultaneously) that we prove does not have SPACE[(log n)^e]-uniform circuits of tilde{O}(n) size and O((log n)^e) depth. We also show SAT does not have circuits of tilde{O}(n) size and log^{2-o(1)}(n) depth that can be constructed in log^{2-o(1)}(n) space. * A strong circuit complexity amplification. For every e > 0, we give a natural circuit composition problem and show that if it has tilde{O}(n)-size circuits (uniform or not), then every problem solvable in 2^{O(n)} time and 2^{O(sqrt{n log n})} space (simultaneously) has 2^{O(sqrt{n log n})}-size circuits (uniform or not). We also show the same consequence holds assuming SAT has tilde{O}(n)-size circuits. As a corollary, if n^{1.1} time computations (or O(n) nondeterministic time computations) have tilde{O}(n)-size circuits, then all problems in exponential time and subexponential space (such as quantified Boolean formulas) have significantly subexponential-size circuits. This is a new connection between the relative circuit complexities of easy and hard problems

From Andy’s Room to Big City and Nickelodeon: Extending the Brand to New Consumers through Alternate Broadcasts of Live Sports Entertainment

The Walt Disney Company aired the Toy Story Football Funday on Sunday, October 1st, 2023. A live game between the Jacksonville Jaguars and Atlanta Falcons played in London, England aired on ESPN+ while the Toy Story-themed alternate broadcast aired on Disney+. This game followed multiple alternate broadcasts of NFL games by Nickelodeon and an NHL game themed after Big City Greens on the Disney Channel, Disney XD, and Disney+. This analysis paper discusses the use of these alternate broadcasts in an attempt to attract younger viewers and expand consumers for leagues and live sports entertainment. A brief history of sports organizations participating in fan outreach programs, including contests and alternate broadcasts is provided before an analysis and discussion of how such presentations may impact viewership, competition among studios, and the future of consumer entertainment

Streaming for the Win: The Future of Live Sports Entertainment in Direct-to-Consumer Streaming

This topical essay discusses the growing presence of live sports entertainment on direct-to-consumer streaming services, and how future research could benefit consumers and companies. A brief overview of Amazon Prime streaming NFL Thursday Night Football games is introduced, along with a background of live sports and streaming services. A call to action for future research is provided with potential areas in which investigators can focus

On the (Non) NP-Hardness of Computing Circuit Complexity

The Minimum Circuit Size Problem (MCSP) is: given the truth table of a Boolean function f and a size parameter k, is the circuit complexity of f at most k? This is the definitive problem of circuit synthesis, and it has been studied since the 1950s. Unlike many problems of its kind, MCSP is not known to be NP-hard, yet an efficient algorithm for this problem also seems very unlikely: for example, MCSP in P would imply there are no pseudorandom functions. Although most NP-complete problems are complete under strong "local" reduction notions such as poly-logarithmic time projections, we show that MCSP is provably not NP-hard under O(n^(1/2-epsilon))-time projections, for every epsilon > 0. We prove that the NP-hardness of MCSP under (logtime-uniform) AC0 reductions would imply extremely strong lower bounds: NP notsubset P/poly and E notsubset i.o.-SIZE(2^(delta * n)) for some delta > 0 (hence P = BPP also follows). We show that even the NP-hardness of MCSP under general polynomial-time reductions would separate complexity classes: EXP != NP cap P/poly, which implies EXP != ZPP. These results help explain why it has been so difficult to prove that MCSP is NP-hard. We also consider the nondeterministic generalization of MCSP: the Nondeterministic Minimum Circuit Size Problem (NMCSP), where one wishes to compute the nondeterministic circuit complexity of a given function. We prove that the Sigma_2 P-hardness of NMCSP, even under arbitrary polynomial-time reductions, would imply EXP notsubset P/poly