We propose an automatic selection of the bandwidth of the recursive kernel estimators of a probability density function defined by the stochastic approximation algorithm introduced by Mokkadem et al. (2009a). We showe...
详细信息
We propose an automatic selection of the bandwidth of the recursive kernel estimators of a probability density function defined by the stochastic approximation algorithm introduced by Mokkadem et al. (2009a). We showed that, using the selected bandwidth and the stepsizewhich minimize the MISE (mean integrated squared error) of the class of the recursive estimators defined in Mokkadem et al. (2009a), the recursive estimator will be better than the nonrecursive one for small sample setting in terms of estimation error and computational costs. We corroborated these theoretical results through simulation study.
We describe a means of presenting hierarchically organized formal definitions of programming languages using the denotational approach of D. Scott and C. Strachey. As an example of our approach, we give the semantics ...
详细信息
I present a simple recursive relation between the invariant measure for integration over SU(N) and the product of the measure for a sphere S(2N-1) times the measure for SU(N-1). I also discuss the periodicity factor t...
详细信息
This essay presents a theory of subjectivity. Blackness, a concept articulated by the form of life of its subjects, is expressed by a recursive operation whose output produces a discrete infinity. Generating different...
详细信息
This essay presents a theory of subjectivity. Blackness, a concept articulated by the form of life of its subjects, is expressed by a recursive operation whose output produces a discrete infinity. Generating different identities dependent upon context, blackness' expressions are not random but appropriate, and yet not necessarily caused by nor solely in reaction to the conditions in which it appears. In this way, we prove a continuity of blackness despite the discrete yet non-determinate set of possible variations on Black identity entailed by the names attributed or imposed upon it. I plan to illustrate the difference between subject continuity, a concept expressed by the function of an operation whose domain is a cultural endowment, and stipulations of identity that seek to enclose infinity within finitude.
A new iterative method for polynomial root-finding based on the development of two novel recursive functions is proposed. In addition, the concept of polynomial pivots associated with these functions is introduced. Th...
详细信息
recursive algebraic construction of two infinite families of polynomials in n variables is proposed as a uniform method applicable to every semisimple Lie group of rank n. Its result recognizes Chebyshev polynomials o...
详细信息
This paper proposes a new method to achieve proof construction, the basic idea of which is to construct proof with auxiliary recursive functions in the foundational logic. In this way, the workload of proof constructi...
详细信息
This paper proposes a new method to achieve proof construction, the basic idea of which is to construct proof with auxiliary recursive functions in the foundational logic. In this way, the workload of proof construction and the size of constructed proof can be reduced while maintaining the same trusted computing base. This paper also illustrates how to adapt this method to a type-based FPCC system, where the safety proof can be constructed automatically. All this work is implemented in the proof assistant Coq.
暂无评论