Evidence for Morphoprosodic Alignment in Reduplication

2008 ◽  
Vol 39 (4) ◽  
pp. 589-614 ◽  
Author(s):  
Robert Kennedy
Keyword(s):  
Theoretic Model ◽  
General Constraints ◽  
Indexed Constraints ◽  
Prosodic Categories ◽  
Constraint Hierarchies

Morphoprosodic Alignment (MPA) is a nontemplatic model of reduplication designed to account for languages with multiple reduplicative subpatterns. The premise of MPA is that reduplicative morphemes can be stem-internal or stem-external and that this distinction is visible to the phonological component through general constraints on the association of stem-internal and stem-external morphemes to prosodic categories. I illustrate the model with Moronene, Klamath, and Gooniyandi, each of which has several reduplicative morphemes. MPA meets the challenge for an optimality-theoretic model to account for such systems without resorting to morpheme-specific indexed constraints or cophonological constraint hierarchies.

scholarly journals Unifying Phonotactics and Derived Environment Blocking through Prosodic Constraint Indexation

2014 ◽  
Vol 1 (1) ◽  
Author(s):  
Brian Hsu
Keyword(s):  
Blocking Effects ◽  
Domain Restrictions ◽  
Indexed Constraints ◽  
Prosodic Categories ◽  
Marked Structure

<p>This paper presents a theory of prosodic constraint indexation that derives the blocking of markedness-reducing processes at prosodic and morphological junctures. The principle claim is that markedness constraints are indexed to prosodic categories, and are violated only when a marked structure is fully contained within the span of the indexed constituent. The interaction of prosodically-indexed constraints with faithfulness constraints accounts for both<strong> </strong>static phonotactic restrictions and derived environment blocking effects. Furthermore, they account for domain restrictions that can not be derived by CrispEdge constraints, which reference only prosodic edges. Where Strict Layering is violated, prosodic constraint indexation correctly predicts that more marked segment sequences can be admitted in extraprosodic affixes than in root morphemes.</p>

Stability in the informal value transfer systems: norms of trust or institutions of control?

2017 ◽  
pp. 120-130
Author(s):  
A. Lyasko
Keyword(s):  
Social Control ◽  
Institutional Economics ◽  
Theoretic Model ◽  
Transfer System ◽  
Value Transfer ◽  
Partner Interaction ◽  
Game Theoretic ◽  
Game Theoretic Model ◽  
Informal Value Transfer System

Informal financial operations exist in the shadow of official regulation and cannot be protected by the formal legal instruments, therefore raising concerns about the enforcement of obligations taken by their participants. This paper analyzes two alternative types of auxiliary institutions, which can coordinate expectations of the members of informal value transfer systems, namely attitudes of trust and norms of social control. It offers some preliminary approaches to creating a game-theoretic model of partner interaction in the informal value transfer system. It also sheds light on the perspectives of further studies in this area of institutional economics.

Hollywood’s Movie Production Companies in Game Theoretic Model

2020 ◽  
Author(s):  
Nargiz Mammadova ◽  
Aygun Malikova ◽  
Arzu Heydarova
Keyword(s):  
Theoretic Model ◽  
Game Theoretic ◽  
Game Theoretic Model

Cloud Provider's Response to Multiple Models of Attack Behaviors

2019 ◽  
Vol 13 (4) ◽  
pp. 325-333
Author(s):  
Xu Liu ◽  
Xiaoqiang Di ◽  
Jinqing Li ◽  
Huamin Yang ◽  
Ligang Cong ◽  
...  
Keyword(s):  
Stackelberg Game ◽  
Multiple Models ◽  
Theoretic Model ◽  
Cloud Provider ◽  
Game Model ◽  
Attack Behavior ◽  
Behavior Model ◽  
Protection Strategy ◽  
Behavior Models ◽  
Optimal Protection

Background: User behavior models have been widely used to simulate attack behaviors in the security domain. We revised all patents related to response to attack behavior models. How to decide the protected target against multiple models of attack behaviors is studied. Methods: We utilize one perfect rational and three bounded rational behavior models to simulate attack behaviors in cloud computing, and then investigate cloud provider’s response based on Stackelberg game. The cloud provider plays the role of defender and it is assumed to be intelligent enough to predict the attack behavior model. Based on the prediction accuracy, two schemes are built in two situations. Results: If the defender can predict the attack behavior model accurately, a single-objective game model is built to find the optimal protection strategy; otherwise, a multi-objective game model is built to find the optimal protection strategy. Conclusion: The numerical results prove that the game theoretic model performs better in the corresponding situation.

scholarly journals Free partition functions and an averaged holographic duality

2021 ◽  
Vol 2021 (1) ◽  
Author(s):  
Nima Afkhami-Jeddi ◽  
Henry Cohn ◽  
Thomas Hartman ◽  
Amirhossein Tajdini
Keyword(s):  
Partition Function ◽  
Spectral Gap ◽  
Central Charge ◽  
Three Dimensional ◽  
Two Dimensions ◽  
Three Dimensions ◽  
Partition Functions ◽  
General Constraints ◽  
Dimensional Gravity ◽  
Holographic Duality

Abstract We study the torus partition functions of free bosonic CFTs in two dimensions. Integrating over Narain moduli defines an ensemble-averaged free CFT. We calculate the averaged partition function and show that it can be reinterpreted as a sum over topologies in three dimensions. This result leads us to conjecture that an averaged free CFT in two dimensions is holographically dual to an exotic theory of three-dimensional gravity with U(1)c×U(1)c symmetry and a composite boundary graviton. Additionally, for small central charge c, we obtain general constraints on the spectral gap of free CFTs using the spinning modular bootstrap, construct examples of Narain compactifications with a large gap, and find an analytic bootstrap functional corresponding to a single self-dual boson.

Digital Authoritarianism and the Future of Human Rights

2021 ◽  
pp. 1-27
Author(s):  
Tiberiu Dragu ◽  
Yonatan Lupu
Keyword(s):  
Human Rights ◽  
New Technologies ◽  
Theoretic Model ◽  
Human Rights Abuses ◽  
Human Rights Regime ◽  
Wide Range ◽  
The Future ◽  
Technological Developments ◽  
Game Theoretic ◽  
Strategic Context

Abstract How will advances in digital technology affect the future of human rights and authoritarian rule? Media figures, public intellectuals, and scholars have debated this relationship for decades, with some arguing that new technologies facilitate mobilization against the state and others countering that the same technologies allow authoritarians to strengthen their grip on power. We address this issue by analyzing the first game-theoretic model that accounts for the dual effects of technology within the strategic context of preventive repression. Our game-theoretical analysis suggests that technological developments may not be detrimental to authoritarian control and may, in fact, strengthen authoritarian control by facilitating a wide range of human rights abuses. We show that technological innovation leads to greater levels of abuses to prevent opposition groups from mobilizing and increases the likelihood that authoritarians will succeed in preventing such mobilization. These results have broad implications for the human rights regime, democratization efforts, and the interpretation of recent declines in violent human rights abuses.

Constrained Petri Nets. Part II: Generalizations and extensions

1983 ◽  
Vol 6 (3-4) ◽  
pp. 333-374
Author(s):  
H.J.M. Goeman ◽  
L.P.J. Groenewegen ◽  
H.C.M. Kleijn ◽  
G. Rozenberg
Keyword(s):  
Petri Nets ◽  
Petri Net ◽  
Theoretical Framework ◽  
General Constraints ◽  
Context Free ◽  
Boolean Expressions

This paper continues the investigation froll1 [Goeman et al.] concerning the use of sets of places of a Petri net as additional (to input places) constraints for granting concession. Now interpretations of more general constraints are considered and expressed as Boolean expressions. This gives rise to various classes of constrained Petri nets. These are compared in the language theoretical framework introduced in [Goeman et al.]. An upperbound for the language defining power is found in the class of context-free programmed languages.

Sign in / Sign up

Export Citation Format

Share Document