By generalizing the notion of location of a constituent to allow discontinuous Ioctaions, one can describe the discontinuous constituents of non-configurational languages. These discontinuous constituents can be described by a variant of definite clause grammars, and these grammars can be used in conjunction with a proof procedure to create a parser for non-configurational languages.

In the last few years, various types of machine learning algorithms, such as Support Vector Machine (SVM), Regression (SVR), and Non-negative Matrix Factorization (NMF) have been introduced. The kernel approach is an effective method for increasing classification accuracy algorithms. This paper introduces a family one-parameter functions improving SVM classification. proposed function consists ...

This paper is devoted to the study of general (Laurent) polynomial modifications of moment functionals on the unit circle, i.e., associated with hermitian Toeplitz matrices. We present a new approach which allows us to study polynomial modifications of arbitrary degree. The main objective is the characterization of the quasi-definiteness of the functionals involved in the problem in terms of a ...

In this paper we present necessary conditions for global optimality for polynomial problems over box or bivalent constraints using separable polynomial relaxations. We achieve this by completely characterizing global optimality of separable polynomial problems with box as well as bivalent constraints. Then, by employing separable polynomial under-estimators, we establish sufficient conditions f...

‎this paper obtains the exact solutions of the wave equation as a second-order partial differential equation (pde)‎. ‎we are going to calculate polynomial and non-polynomial exact solutions by using lie point symmetry‎. ‎we demonstrate the generation of such polynomial through the medium of the group theoretical properties of the equation‎. ‎a generalized procedure for polynomial solution is pr...

Schmüdgen proved a Positivstellensatz about the representation of positive definite polynomials on a basic closed semialgebraic set using methods from functional analysis in connection with Stengle's Positivstellensatz. Later Wörmann gave a purely algebraic proof. The present note contains yet another proof that uses classical results by Kadison about the representation of partially ordered alg...