Synthesis of 1-(4-substituted)benzyl-6-hydroxyisoquinolines with potential activity on NA+,K+-atpase

The synthesis of 1-(4-substituted)benzyl-6-hydroxyisoquinolines, to be evaluated in the displacement of the specific ³H-ouabain binding to Na⁺,K⁺-ATPase, is described. The key step involved a cyclization to the isoquinoline ring under Pictet-Gams conditions which was best performed with the 6-hydroxy group protected as the benzyl ether. When an unsaturated ester group was present in position 4 of the 1-benzyl group, this was best introduced before the cyclization step, since the IIeck reaction on 1-(4-bromobenzyl)-6-hydroxyisoquinoline ( 8 ) with acrylic acid derivatives was not successful in all cases.     

Reaction of ketenes with N,N-disubstituted 2-aminomethylenecycloalkanones. V. Synthesis of N,N-disubstituted 4′-aminospiro [1,3-dithiane-2,3′-(5′,6′-polymethylene-3′,4′-dihydro-α-pyrones)]

The reaction of 2-carbonyl-1,3-dithiane, a sulfene prepared in situ from 2-chloroearbonyl-1,3-dithiane and triethylamine, with N,N-disubstituted 2-aminomethylvnecycloalkanones gave the 1,4-cycloadducts, namely N,N-disubstituted 4′-aminospiro[1,3-dithiane-2,3′-(5′,6′-poly-methylene-3′,4′-dihydro-α-pyrones)].     

Fairness in ambulance routing for post disaster management

Central European Journal of Operations Research - Disaster management generally includes the post-disaster stage, which consists of the actions taken in response to the disaster damages. These...     

Solvable set/hyperset contexts: I. Some decision procedures for the pure,finite case

Hereditarily finite sets and hypersets are characterized both as algorithmic data structures and by means of a first-order axiomatization which, despite being rather weak, suffices to make the following two problems decidable:

• (1) Establishing whether a conjunction r of formulae of the form: ? y₁ ?? y_m((y₁?W₁& ?&y_m ?W_m) ←q), with q quantifier-free and involving only the relators =, ? and propositional connectives, and each y_i distinct from all w_j's, is satisfiable.
• (2) Establishing whether a formula of the form ? y q, q quantifier-free, is satisfiable.

Concerning (1), an explicit decision algorithm is provided; moreover, significantly broad subproblems of (1) are singled out in which a classification — that we call the ‘syllogistic decomposition’ of r — of all possible ways of satisfying the input conjunction r can be obtained automatically. For one of these subproblems, carrying out the decomposition results in a finite family of syntactic substitutions that generate the space of all solutions to r. In this sense, one has a unification algorithm. Concerning (2), a technique is provided for reducing it to a subproblem of (1) for which a decomposition method is available. The algorithmic complexity of the problems under study is highlighted; a generalization of the decidability results to a theory where sets are blended with free Herbrand functors is announced. © 1996 John Wiley & Sons, Inc.