Existence condition of state equations of linear active networks overF(z)

COERCION AND THE NATURE OF LAW argues that it is a conceptually necessary condition for something to count as a system of law according to our conceptual practices that it authorizes the imposition of coercive sanctions for violations of some mandatory norms governing non-official behavior (the Coercion Thesis). The book begins with an explication of the modest approach to conceptual analysis that is deployed throughout. The remainder of the book is concerned to show that an institutional normative system is not reasonably contrived to do anything that law must be able to do for us to make sense of why we adopt systems of law to regulate non-official behavior unless we assume that mandatory norms governing that behavior are backed by the threat of a sovereign; an institutional normative system that satisfies every other plausible existence condition for law is not reasonably contrived to give rise to either objective or subjective first-order motivating reasons to comply with mandatory norms governing non-official behavior unless they are backed by the threat of a coercive sanction. Law’s presumed conceptual normativity can be explained only by the Coercion Thesis.

Download Full-text

Integrated open service node for active networks and services

IEEE Communications Magazine ◽

10.1109/35.790972 ◽

1999 ◽

Vol 37 (9) ◽

pp. 139-146 ◽

Cited By ~ 1

Author(s):

F. Daoud

Keyword(s):

Active Networks ◽

Open Service

Download Full-text

Investigation on dynamics of an impulsive predator–prey system with generalized Holling type IV functional response and anti-predator behavior

Advances in Difference Equations ◽

10.1186/s13662-021-03324-w ◽

2021 ◽

Vol 2021 (1) ◽

Author(s):

Sekson Sirisubtawee ◽

Nattawut Khansai ◽

Akapak Charoenloedmongkhon

Keyword(s):

Periodic Solution ◽

Functional Response ◽

Impulsive Control ◽

Positive Periodic Solution ◽

Existence Condition ◽

Predator Prey ◽

Type Iv ◽

Prey System ◽

Existence And Stability ◽

Predator Behavior

AbstractIn the present article, we propose and analyze a new mathematical model for a predator–prey system including the following terms: a Monod–Haldane functional response (a generalized Holling type IV), a term describing the anti-predator behavior of prey populations and one for an impulsive control strategy. In particular, we establish the existence condition under which the system has a locally asymptotically stable prey-eradication periodic solution. Violating such a condition, the system turns out to be permanent. Employing bifurcation theory, some conditions, under which the existence and stability of a positive periodic solution of the system occur but its prey-eradication periodic solution becomes unstable, are provided. Furthermore, numerical simulations for the proposed model are given to confirm the obtained theoretical results.

Download Full-text

Discrete-Time Constrained Average Stochastic Games with Independent State Processes

Mathematics ◽

10.3390/math7111089 ◽

2019 ◽

Vol 7 (11) ◽

pp. 1089

Author(s):

Wenzhao Zhang

Keyword(s):

Discrete Time ◽

Stochastic Games ◽

Transition Probability ◽

Existence Condition ◽

Linear Program ◽

Global Minimizer ◽

Independent State ◽

Occupation Measures ◽

Best Response ◽

Mathematic Program

In this paper, we consider the discrete-time constrained average stochastic games with independent state processes. The state space of each player is denumerable and one-stage cost functions can be unbounded. In these game models, each player chooses an action each time which influences the transition probability of a Markov chain controlled only by this player. Moreover, each player needs to pay some costs which depend on the actions of all the players. First, we give an existence condition of stationary constrained Nash equilibria based on the technique of average occupation measures and the best response linear program. Then, combining the best response linear program and duality program, we present a non-convex mathematic program and prove that each stationary Nash equilibrium is a global minimizer of this mathematic program. Finally, a controlled wireless network is presented to illustrate our main results.

Download Full-text