Multivalued convexity and optimization: A unified approach to inequality and equality constraints

Multivalued functions satisfying a general convexity condition are examined in the first section. The second section establishes a general transposition theorem for such functions and develops an abstract multiplier principle for them. In particular both convex inequality and linear equality constraints are seen to satisfy the same generalized constraint qualification. The final section examines quasi-convex programmes.     

Identification problems for the damped Klein-Gordon equations

In this paper we study the identification problems for the damped Klein-Gordon equation (KG). In particular, when the diffusion parameter of KG is unknown, we prove the existence of the optimal parameter and deduce the necessary conditions on the optimal parameter by using the transposition method.     

Necessary conditions for stochastic optimal control problems in infinite dimensions

The purpose of this paper is to establish the first and second order necessary conditions for stochastic optimal controls in infinite dimensions. The control system is governed by a stochastic evolution equation, in which both drift and diffusion terms may contain the control variable and the set of controls is allowed to be nonconvex. Only one adjoint equation is introduced to derive the first order necessary optimality condition either by means of the classical variational analysis approach or, under an additional assumption, by using differential calculus of set-valued maps. More importantly, in order to avoid the essential difficulty with the well-posedness of higher order adjoint equations, using again the classical variational analysis approach, only the first and the second order adjoint equations are needed to formulate the second order necessary optimality condition, in which the solutions to the second order adjoint equation are understood in the sense of the relaxed transposition.     

Transposition invariant string matching

Given strings A=a₁a₂…a_m and B=b₁b₂…b_n over an alphabet , where is some numerical universe closed under addition and subtraction, and a distance function d(A,B) that gives the score of the best (partial) matching of A and B, the transposition invariant distance is , where A+t=(a₁+t)(a₂+t)…(a_m+t). We study the problem of computing the transposition invariant distance for various distance (and similarity) functions d, including Hamming distance, longest common subsequence (LCS), Levenshtein distance, and their versions where the exact matching condition is replaced by an approximate one. For all these problems we give algorithms whose time complexities are close to the known upper bounds without transposition invariance, and for some we achieve these upper bounds. In particular, we show how sparse dynamic programming can be used to solve transposition invariant problems, and its connection with multidimensional range-minimum search. As a byproduct, we give improved sparse dynamic programming algorithms to compute LCS and Levenshtein distance.     

Performance-based routing

In many-server systems with heterogeneous servers, the Fastest-Server-First (FSF) policy is known for its excellent performance. However, when service rates are unknown and/or time-varying, implementing FSF routing is not straightforward. We analyze an algorithm that approximates FSF routing: servers are ranked in a dynamic list, where the shorter the actual service times that a server exhibits—the closer the server is to the head of the list; a customer is then routed to the lowest-index (highest-in-the-list) idle server.     

Short proofs for cut-and-paste sorting of permutations

We consider the problem of determining the maximum number of moves required to sort a permutation of [n] using cut-and-paste operations, in which a segment is cut out and then pasted into the remaining string, possibly reversed. We give short proofs that every permutation of [n] can be transformed to the identity in at most ⌊2n/3⌋ such moves and that some permutations require at least ⌊n/2⌋ moves.     

On minimizing pattern splitting in multi-track string matching

Given a pattern string P=p₁p₂p_m and K parallel text strings over an integer alphabet Σ, our task is to find the smallest integer κ>0 such that P can be split into κ pieces P=P¹…P^κ, where each Pⁱ has an occurrence in some text track T^k_i and these partial occurrences retain the order. We study some variations of this minimum splitting problem, such as splittings with limited gaps and transposition invariance, and show how to use sparse dynamic programming to solve the variations efficiently. In particular, we show that the minimum splitting problem can be interpreted as a shortest path problem on line segments.     

Hydrostatic Stokes equations with non-smooth data for mixed boundary conditions

The main subject of this work is to study the concept of very weak solution for the hydrostatic Stokes system with mixed boundary conditions (non-smooth Neumann conditions on the rigid surface and homogeneous Dirichlet conditions elsewhere on the boundary). In the Stokes framework, this concept has been studied by Conca [Rev. Mat. Apl. 10 (1989)] imposing non-smooth Dirichlet boundary conditions.In this paper, we introduce the dual problem that turns out to be a hydrostatic Stokes system with non-free divergence condition. First, we obtain strong regularity for this dual problem (which can be viewed as a generalisation of the regularity results for the hydrostatic Stokes system with free divergence condition obtained by Ziane [Appl. Anal. 58 (1995)]). Afterwards, we prove existence and uniqueness of very weak solution for the (primal) problem.As a consequence of this result, the existence of strong solution for the non-stationary hydrostatic Navier-Stokes equations is proved, weakening the hypothesis over the time derivative of the wind stress tensor imposed by Guillén-González, Masmoudi and Rodríguez-Bellido [Differential Integral Equations 50 (2001)].     

Novel isothiocyanate transposition in 2-alkyliminothiazoles: a simple solution for regiochemical problem

Novel alkyl/aryl transposition in the reaction of 2-iminothiazoles with alkyl/aryl isothiocyanates was found out, and the reaction was very easy to handle and gave good to excellent chemical yields. Moreover, transposition reaction provided a simple but excellent solution for regiochemical problems in 2-iminothiazole synthesis.