Spectrophotometric and AAS determination of trace amounts of cobalt after preconcentration by using alpha-benzilmonoxime-microcrystalline naphthalene.

The formed cobalt-a-benzilmonoxime complex was adsorbed onto microcrystalline naphthalene. Then it was determined by zero and first derivative spectrophotometry and by atomic absorption spectrophotometry (AAS) after dissolving into chloroform and methylisobutylketone (MIBK), respectively. Under optimum conditions, cobalt in the range of 1.0 - 20.0, 0.4 - 30.0 and 2.5 - 50.0 microg could be determined by spectrophotometry, first derivative spectrophotometry and AAS method, respectively. By the method, a preconcentration factor equal to approximately 30 for cobalt was obtained. The effect of diverse ions on the determination of 5.0 microg cobalt was also studied. The method was successfully applied to some pharmaceuticals and synthetic alloy samples.     

A new insight into the understanding of the collapsed form of poly(N-isopropylacrylamide) molecules

Possible collapsed forms of poly(N-isopropylacrylamide) molecules are reviewed on the basis of first principle calculations. Various configurations and associated conformations are detailed. The calculated optimized structures exhibit different possibilities of creating networks of intra-molecular bonds of the hydrogen type. We show that the most remarkable one is able to form a local, self-saturated and well ordered helix. We also indicate in which direction the synthesis of the molecule should be oriented to improve its global behavior in term of hydrophobic/hydrophilic behavior.     

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的图书馆管理系统资源访问的安全性．     

On the Linear Complexity Profile of Nonlinear Congruential Pseudorandom Number Generators with Dickson Polynomials

Linear complexity and linear complexity profile are important characteristics of a sequence for applications in cryptography and Monte-Carlo methods. The nonlinear congruential method is an attractive alternative to the classical linear congruential method for pseudorandom number generation. Recently, a weak lower bound on the linear complexity profile of a general nonlinear congruential pseudorandom number generator was proven by Gutierrez, Shparlinski and the first author. For most nonlinear generators a much stronger lower bound is expected. Here, we obtain a much stronger lower bound on the linear complexity profile of nonlinear congruential pseudorandom number generators with Dickson polynomials.     

Energy of formation for and liquid binary alloys

We have investigated the free energy of formation for Ag_xIn_1-x and Ag_xSn_1-x liquid binary alloys at temperatures 1173 and 1250 K, respectively. A microscopic theory based on the first order perturbation has been applied. The interionic interaction and a reference liquid are the fundamental components of the theory. The interionic interaction is described by a local pseudopotential. A liquid of hard spheres (HS) of two different effective diametres and charges is used to describe the reference system. The results of the calculations for energy of formation agree very well with the available experimental data. Our calculations also reveal that a simple perturbative approach along with appropriate effective pair potentials can produce nearly quantitative results for the concerned alloys.     

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.