Synthèse de nouveaux dérivés tétrahydroquinoléines et quinoléines via la réaction d'aza-Diels-Alder suivie d'aromatisation

The Aza-Diels-Alder reaction of aldimines with isoeugenol is described. New 1,2,3,4-tetrahydroquinoline and quinoline structures are reported. The stereo- and regioselectivities of the [4+2] cycloaddition are discussed.     

Selective double Suzuki cross-coupling reactions. Synthesis of unsymmetrical diaryl (or heteroaryl) methanes

Using a double Suzuki cross-coupling reaction ortho- or para-bromobenzyl bromides are easily transformed into unsymmetrical diaryl (or heteroaryl) methanes     

Critical Point Theorems and Applications to Differential Equations

This paper contains a generalization of the well-known Palais-Smale and Cerami compactness conditions. The compactness condition introduced is used to prove some general existence theorems for critical points. Some applications are given to differential equations.     

Studies on heterocyclic enamines: New syntheses of 4H-pyranes,pyranopyrazoles and pyranopyrimidines

The behaviour of several 2-amino-3-cyano-4H-pyran derivatives toward a variety of nucleophilic reagents is reported.     

基于Web的图书馆管理系统访问控制策略

针对基于Web的图书馆管理系统资源访问控制的动态性问题，提出了一种基于角色的访问控制策略描述方案．通过对基于Web的图书馆管理系统访问控制管理影响因素和访问控制需求的分析，结合NIST基于角色的访问控制统一模型标准，构造了一种基于角色的访问控制元模型．并在这一元模型的基础上，提出了一种紧凑的基于角色的访问控制XML策略描述语言框架．结果表明该访问控制策略描述语言框架适合表述动态环境下对图书馆资源的访问策略，提高了基于Web的图书馆管理系统资源访问的安全性．     

An improved max-flow-based lower bound for minimizing maximum lateness on identical parallel machines

In this paper, we introduce a new concept of semi-preemptive scheduling and we show how it can be used to derive a maximum-flow-based lower bound for the P|r_j|L_max which dominates the well-known preemptive lower bound. We show that, in some cases, the proposed bound strictly dominates the preemptive one while having the same complexity.     

Sinc-Galerkin method for solving linear sixth-order boundary-value problems

There are few techniques available to numerically solve sixth-order boundary-value problems with two-point boundary conditions. In this paper we show that the Sinc-Galerkin method is a very effective tool in numerically solving such problems. The method is then tested on examples with homogeneous and nonhomogeneous boundary conditions and a comparison with the modified decomposition method is made. It is shown that the Sinc-Galerkin method yields better results.