نتایج جستجو برای: strict congestion

تعداد نتایج: 54518  

2009
YOSHIHIRO TAKEYAMA Peter A. Clarkson

We consider the generating function for a q-analogue of non-strict multiple zeta values (or multiple zeta-star values) and prove an explicit formula for it in terms of a basic hypergeometric series 3φ2. By specializing the variables in the generating function, we reproduce the sum formula obtained by Ohno and Okuda and get some relations in the case of full height.

1996
A. M. Youssef S. E. Tavares

In this paper we present asymptotic expressions for the number of functions satisfying the Strict Avalanche Criterion (SAC) with respect to one and two variables, previously developed by O’Connor. Cusick recently gave a conjecture for a lower bound on the number of functions satisfying the SAC. Here, we give a constructive proof for this conjecture. Moreover, we provide an improved lower bound.

1997
GERT DE COOMAN Etienne E. Kerre

It is shown that the notion of conditional possibility can be consistently introduced in possibility theory, in very much the same way as conditional expectations and probabilities are defined in the measureand integral-theoretic treatment of probability theory. I write down possibilistic integral equations which are formal counterparts of the integral equations used to define conditional expec...

2013
Yong-Jung Kim

The Oleinik inequality for conservation laws and AronsonBenilan type inequalities for porous medium or p-Laplacian equations are one-sided inequalities that provide the fundamental features of the solution such as the uniqueness and sharp regularity. In this paper such one-sided inequalities are unified and generalized for a wide class of first and second order equations in the form of ut = σ(t...

2009
Gregor Betz

This paper gives an explication of our intuitive notion of strength of justification in a controversial debate. It defines a thesis’ degree of justification within the bipolar argumentation framework of the theory of dialectical structures as the ratio of coherently adoptable positions according to which that thesis is true over all coherently adoptable positions. Broadening this definition, th...

Journal: :J. Log. Comput. 2015
Miika Hannula Juha Kontinen

We study the expressive power of fragments of inclusion and independence logic defined by restricting the number k of universal quantifiers in formulas. Assuming the so-called strict semantics for these logics, we relate these fragments of inclusion and independence logic to sublogics ESOf (k∀) of existential second-order logic, which in turn are known to capture the complexity classes NTIMERAM...

1996
Tatsunori Mori Hiroshi Nakagawa

This paper proposes a method of the zero pronoun resohition, which is one of the essential processes in understanding systems for Japanese manual sentences. It is based on pragmatic properties of Japanese conditionals. We examined a uumber of sentences appearing in Japanese manuals according to the classillcation based on the types of agent and the types of verb phrase. As ~ result, we obtained...

Journal: :J. Philosophical Logic 2007
Martin Smith

Our understanding of subjunctive conditionals has been greatly enhanced through the use of possible world semantics and, more precisely, by the idea that they involve variably strict quantification over possible worlds. I propose to extend this treatment to ceteris paribus conditionals – that is, conditionals that incorporate a ceteris paribus or ‘other things being equal’ clause. Although such...

2018

This paper investigates the use of an efficient bandwidth management scheme by implementing cross-layer M/M/1 queuing model. Strict Open System Interconnection (OSI) layer to layer communication problem is solved by introducing a common database that automatically synchronizes the status of each OSI layer to all the other layers. First-In-First-Out (FIFO) queuing data structure and Priority Que...

Journal: :CoRR 2016
Ioannis Avramopoulos

We show that evolutionarily stable states in general (nonlinear) population games (which can be viewed as continuous vector fields constrained on a polytope) are asymptotically stable under a multiplicative weights dynamic (under appropriate choices of a parameter called the learning rate or step size, which we demonstrate to be crucial to achieve convergence, as otherwise even chaotic behavior...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید