We present LHIP, a system for incremental grammar development using an extended DCG formalism. The system uses a robust island-based parsing method controlled by user-defined performance thresholds.

We consider the initial value Cauchy problem for a class of evolution equations whose Hamiltonian is Weyl quantization homogeneous quadratic form with non-negative definite real part. The solution semigroup shown to be strongly continuous on several spaces: Shubin-Sobolev spaces, Schwartz space, tempered distributions, equal index Beurling type Gelfand-Shilov spaces and their dual ultradistribu...

The paper concerns worst-case compliance optimization by finding the structural topology with minimum compliance for the loading due to the worst possible acceleration of the structure and attached non-structural masses. A main novelty of the paper is that it is shown how this min-max problem can be formulated as a non-linear semi-definite programming (SDP) problem involving a small-size constr...

the phrase “hodood that are not mentioned in this code” in article 220 of islamic penal code of 2013 and “shar’i definite tazir” in article 115 of this code are ambiguous from figh and legal viewpoint, then we have to resort to interpretation for recognizing their instances, in this regard, three interpretations are possible, first, restricting “hodood” to six famous types and allocating defini...

This note outlines an algorithm for solving the complex “matrix Procrustes problem”. This is a least-squares approximation over the cone of positive semi-definite Hermitian matrices, which has a number of applications in the areas of Optimization, Signal Processing and Control. The work generalises the method of [J.C. Allwright, “Positive semidefinite matrices: Characterization via conical hull...

We look at the real positive (semi)definite matrix completion problem from the relative entropy minimization viewpoint. After the problem is transformed into the standard maxdet from, conditions are sought for existence of positive (semi)definite completions. Using basic tools of convex analysis results previously established using graph-theoretic or functional-analytic techniques are recovered...