We consider the system of articulators “jaw – tip of the tongue” in order to investigate instant and integral optimality criteria in the variational approach to the solution of speech inverse problem “from total displacement of articulators to their controls”. The required experimental data i.e., coordinates of the tip of the tongue and lower incisor have been measured by the use of the X-ray m...

Safe Reinforcement Learning can be defined as the process of learning policies that maximize the expectation of the return in problems in which it is important to ensure reasonable system performance and/or respect safety constraints during the learning and/or deployment processes. We categorize and analyze two approaches of Safe Reinforcement Learning. The first is based on the modification of...

Age replacement of technical units has received much attention in the reliability literature over the last four decades. Mostly, the failure time distribution for the units is assumed to be known, and minimal costs per unit of time is used as optimality criterion, where renewal reward theory simplifies the mathematics involved but requires the assumption that the same process and replacement st...

This paper presents an extension to the classical Cones Intersection Technique, which was, and is, exhaustively used to estimate the spin axis direction of spin stabilized spacecraft. The resulting Optimal Cones Intersection Technique is derived from a demonstrated co-planarity condition and does not present ambiguities or singularities. The proposed method allows an optimal estimation of any o...

c 0000 American Mathematical Society 1052-1798/00 $1.00 + $.25 per page . We present a method for visualising and quantifying the relationship between a pair of gene and species trees that constructs a third tree termed the reconciled tree. Given a gene tree and a species tree the reconciled tree represents the history of the gene tree embedded within the species tree. The reconciled tree is co...

A sufficient condition is given that a certain drawing minimizes the crossing number. The condition is in terms of intersections in an arbitrary set system related to the drawing, and is like a correlation inequality.