نتایج جستجو برای: higher order semiotic

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

1996
F. GESZTESY

A natural algebraic approach to the KdV hierarchy and its algebro-geometric finite-gap solutions is developed. In addition, a new derivation of associated higher-order trace formulas in connection with one-dimensional Schrödinger operators is presented.

2004
GIOVANNI BELLETTINI MATTEO NOVAGA

We introduce a regularization method for mean curvature flow of a submanifold of arbitrary codimension in the Euclidean space, through higher order equations. We prove that the regularized problems converge to the mean curvature flow for all times before the first singularity.

2011
Ilya G. Klyuchnikov

The paper presents the proof of correctness of an experimental supercompiler HOSC dealing with higher-order functions. В работе приводится доказательство корректности экспериментального суперкомпилятора HOSC, работающего с функциями высших порядков.

2008
Alan R. Rogers

We reexamine Alan R. Rogers’ (1994) analysis of the biological basis of the rate of time preference. Although his basic insight concerning the derivation of the utility function holds up, the functional form he uses does not generate equilibrium evolutionary behavior. Moreover, Rogers relies upon an interior solution for a particular kind of intergenerational transfer. We show such interior sol...

2004
Péter Major József Cserti

We derive a simple three parameters conductance formula for wires with monovalent atoms. The functional form of the formula is the most general in the framework of ballistic transport through the chain. The parameters in the formula are related to the nature of the coupling of the wire to the leads and independent of the length of the atomic chain. These parameters can be determined from a firs...

Journal: :IEICE Transactions 2014
Keehang Kwon

This paper proposes a new approach to defining and expressing algorithms: the notion of task logical algorithms. This notion allows the user to define an algorithm for a task T as a set of agents who can collectively perform T . This notion considerably simplifies the algorithm development process and can be seen as an integration of the sequential pseudocode and logical algorithms. This observ...

2010
Alexander G. Melnikov

We present transformations of linearly ordered sets into ordered abelian groups and ordered fields. We study effective properties of the transformations. In particular, we show that a linear order L has a ∆2 copy if and only if the corresponding ordered group (ordered field) has a computable copy. We apply these codings to study the effective categoricity of linear ordered groups and fields.

2008
Robert W. Lurz

Recently, Peter Carruthers has advanced the debate over first-order representationalist theories (FORs) and higher-order representationalist theories (HORs) of consciousness by offering two innovative arguments in support of dispositionalist HORs. In this article, I offer a limited defense of actualist FORs by showing that Carruthers' two arguments either beg the question against such accounts,...

Journal: :European Journal of Operational Research 2007
Ali E. Abbas

This paper presents moments and cross-moments of utility functions and measures of utility dependence. We start with an interpretation of the nth moment of a utility function, and describe methods for its assessment in practice and consistency checks that need to be satisfied for any assessed moments. We then show how moments of a utility function (i) provide a new method to determine the param...

Journal: :Annals OR 2010
Jack Meyer

The application and estimation of expected utility based decision models would benefit from having additional simple and flexible functional forms to represent risk preferences. The literature so far has provided these functional forms for the utility function itself. This work shows that functional forms for the marginal utility function are as useful, are easier to provide, and can represent ...

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

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