1 - 4 of 4 articles
A combinatorial method of encryption with a similarity to the classical scheme of linear coding has been suggested by the author. The general idea is to treat vertices of a graph as messages and arcs of a certain length as encryption tools. We will study the quality of such an encryption in the...
A partially observable control problem for an R
-valued jump process with counting observations is studied. The state and the observations may be strongly dependent and, in particular, the two processes may jump together. An equivalent separated problem is introduced and the existence of an...
In this paper, an extension of all Lie group actions on R
2to coordinates defined by potentials is given. This provides a new solution to the equivalence problems of curves under the projective group and two of its subgroups. The potentials correspond to integrals of higher and higher-order...
We generalize Nesterov's construction for the reduction of various classes of semi-infinite programming problems to the semidefinite programming form. In this way, we are able to consider ‘cones of squares’ of real-valued and matrix-valued functions as rather particular cases of a unifying...
Read and print from thousands of top scholarly journals.
Continue with Facebook
Log in with Microsoft
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Sign Up Log In
To subscribe to email alerts, please log in first, or sign up for a DeepDyve account if you don’t already have one.
To get new article updates from a journal on your personalized homepage, please log in first, or sign up for a DeepDyve account if you don’t already have one.