Condensed thiolane 1,1-dioxide systems. 3. Two modes of cyclization of N-substituted trans-3-chloro-4-thioureidothiolane 1,1-dioxides

Reaction of trans-3-chloro-A-aminothiolane 1,1-dioxide hydrochloride with aryl isothiocyanates gives, according to the base involved, cis-perhydrothieno[3,4-d]imidazole-2-thione 5,5-dioxides or the hitherto undescribed cis-2-aryliminoperhydrothieno 3,4-d] thiazole 5,5-dioxides.For Part 2, see [1].Deceased.Translated from Khimiya Geterotsiklicheskikh Soedinenii, No. 10, pp. 1420–1423, October, 1988.     

On The Parameterized Intractability Of Motif Search Problems*

We show that Closest Substring, one of the most important problems in the field of consensus string analysis, is W[1]-hard when parameterized by the number k of input strings (and remains so, even over a binary alphabet). This is done by giving a “strongly structure-preserving” reduction from the graph problem Clique to Closest Substring. This problem is therefore unlikely to be solvable in time O(f(k)•n^c) for any function f of k and constant c independent of k, i.e., the combinatorial explosion seemingly inherent to this NP-hard problem cannot be restricted to parameter k. The problem can therefore be expected to be intractable, in any practical sense, for k ≥ 3. Our result supports the intuition that Closest Substring is computationally much harder than the special case of Closest String, althoughb othp roblems are NP-complete. We also prove W[1]-hardness for other parameterizations in the case of unbounded alphabet size. Our W[1]-hardness result for Closest Substring generalizes to Consensus Patterns, a problem arising in computational biology. * An extended abstract of this paper was presented at the 19th International Symposium on Theoretical Aspects of Computer Science (STACS 2002), Springer-Verlag, LNCS 2285, pages 262–273, held in Juan-Les-Pins, France, March 14–16, 2002. † Work was supported by the Deutsche Forschungsgemeinschaft (DFG), research project “OPAL” (optimal solutions for hard problems in computational biology), NI 369/2. ‡ Work was done while the author was with Wilhelm-Schickard-Institut für Informatik, Universit?t Tübingen. Work was partially supported by the Deutsche Forschungsgemeinschaft (DFG), Emmy Noether research group “PIAF” (fixed-parameter algorithms), NI 369/4.     

General auxiliary problem and algorithm for a generalized multi-valued variational-like inequality problem in reflexive Banach spaces

In this article, some generalized multi-valued variational-like inequality problems and their related general auxiliary problems in real reflexive Banach spaces are introduced. An existence theorem for one of the general auxiliary problems is proved. Furthermore, by exploiting this theorem, an algorithm for the corresponding generalized multi-valued variational-like inequality problem is constructed. The theorems of this article generalize, improve and unify many known corresponding results.     

System identification based on distribution theory and wavelet transform

A review of system identification based on distribution theory is given. By the Schwartz kernel theorem, to every continuous linear system there corresponds a unique distribution, called kernel distribution. Formulae using wavelet transform to access time--frequency information of kernel distributions are deduced. A new wavelet-based system identification method for health monitoring systems is proposed as an application of a discretized formula using stationary wavelet transform.     

The biogenetic law

We develop one criterion for the selection of the content of a mathematics syllabus. We advocate the importance of the biogenetic law and stress the importance of a historical perspective in mathematical education.     

Ergodic Control of Partially Degenerate Diffusions in a Compact Domain

The problem of ergodic control of a reflecting diffusion in a compact domain is analysed under the condition of partial degeneracy, i.e. when its transition kernel after some time is absolutely continuous with respect to the Lebesgue measure on a part of the state space. Existence of a value function and a “martingale dynamic programming principle” are established by mapping the problem to a discrete time control problem. Implications for existence of optimal controls are derived.