Tailoring approach for exploring electron densities and electrostatic potentials of molecular crystals

Experimental and theoretical studies of electron densities and the corresponding derived entities such as electrostatic potentials have been the primary means of understanding the chemical nature and electronic properties of crystalline substances. Conventional crystal calculation methods such as the embedded cluster models are capable of performing calculations on small and medium-sized molecules, while periodic ab initio methods can treat crystals with up to 200 atoms per unit cell. A linear scaling method, viz. the molecular tailoring approach, has recently been developed for obtaining ab initio quality one-electron properties. In the present study, the molecular tailoring approach is employed to generate electron density, electrostatic potential and interaction density maps with the ibuprofen crystal as a test case. The interaction density and electrostatic potential maps produced in the present work succinctly bring out the actual crystalline environment around a given reference molecule by including the interactions with atoms in its neighborhood. The results obtained from the molecular tailoring approach may thus be expected to enhance our understanding of the environment in the crystalline material with reasonably small computational effort.Contribution to the Jacopo Tomasi Honorary Issue     

Growth of ramification-like ZnO rods in the presence of polyaniline

To obtain new materials with synergetic or complementary behaviors, polyaniline composite filled with ZnO rods in ramification-like structure was prepared by a hydrothermal approach. Comparative experiments of ZnO preparation in the presence of some metal ions were also carried out. The results indicated that the morphology of ZnO was strongly affected by the preparation condition. The method to grow ZnO rods in the presence of polyaniline offers a simple approach to obtain polyaniline composite filled with linear ZnO structure. The results of X-ray photoelectron spectroscopy show that the strong interaction between ZnO and polyaniline possibly exists to cause the charge transfer.     

Nonlinear Optical Properties of Tri—nuclear Transition Metal Clusters M—（μ—S）s—M′（M=Mo,W;M′=Cu,Ag,Au）

The static polarizabilities and the second-order hyperpolarizabilities of a series of tri-nuclear metal cluster models MS4(M′PPh3)2(M′PPh3)(M=Mo,W;M′=Cu,Ag,Au)have been calculated within the first-principle theoretical framework. The model clusters have two fragments of rhombic units and it is the charge ransfer from one of these moieties to the other that is responsible for nonlinear optical property. This kind of electronic delocaization, differentiated from that of planar π-system, is very interesting and is worthy for further investigation.     

Development of an Amperometric Sensor Highly Selective For Dopamine and Analogous Compounds Determination Using Bis(2,2′‐Bipyridil) Copper(II) Chloride Complex

The use of [Cu(bipy)₂]Cl₂?6H₂O as a biomimetic catalyst in the construction of an amperometric sensor for dopamine determination is reported. The sensor was prepared modifying a glassy carbon electrode with a Nafion membrane doped with [Cu(bipy)₂]Cl₂?6H₂O complex. The sensor presented a higher response in 0.25 mol L^?1 phosphate buffer solution (pH 7.0), with an applied potential of ?50 mV (vs. SCE). In the optimized operational conditions, a linear response range between 35 and 240 μmol L^?1, with a sensitivity of 2.02±0.07 nA l μmoL^?1 cm^?2 and detection limit of 8.0 μmol L^?1 were typically observed for the sensor. The response time presented for this sensor was 0.5 s, presenting the same response for at least 40 successive measurements, with good repeatability (3.0%) expressed as relative standard deviation for n=6. The difference of the response between four sensor preparations was 4%. A detailed investigation about the sensor response for other sixteen phenolic compounds and interfering species were carried out. The sensor was applied in the determination of dopamine in pharmaceutical preparation with success.     

Semi‐classical formulation of time‐dependent discrete variable representation method

In this article, we apply a novel time‐dependent discrete variable representation (TDDVR) method proposed by Barkakaty and Adhikari to investigate tunneling through an Eckart barrier. This semi‐classical method is theoretically rigorous and straightforward to implement. Among the TDDVR formulations, this report presents the first derivation of a rigorous form of quantum force (QF) for the present perspective. The validity of this semi‐classical approach is demanded based on the excellent agreement of the tunneling probability with the corresponding quantum results. © 2004 Wiley Periodicals, Inc. Int J Quantum Chem, 2004     

Exponential stability of discrete-time systems with slowly time-varying delays

Slowly time-varying delays are seldom, but do need to be, considered in the context of discrete-time systems. This paper addresses the exponential stability issue of discrete-time systems with slowly time-varying delays. The basic idea is to transform, by utilizing the switching transformation approach, the original system with slowly time-varying delays into an equivalent switched system with special switching signal. Different types of delays correspond to different types of switching signals, and the stability issue of the original system is converted into that of a switched system. It is the first time that the method of switched homogeneous polynomial Lyapunov function is applied to general delayed systems. Some sufficient exponential stability conditions for the original system are proposed in several situations. It is numerically shown that the conservativeness of the proposed conditions reduces as the degree of the switched homogeneous polynomial Lyapunov function increases.     

An exact algorithm for the capacitated shortest spanning arborescence

We are given a complete and loop-free digraphG=(V, A), whereV={1,...,n} is the vertex set,A={(i, j) :i, j V} the arc set, andr V is a distinguishedroot vertex. For each arc (i, j) A, letc _ij be the associatedcost, and for each vertexi, letq _i 0 be the associateddemand (withq _r =0). Moreover, a nonnegativebranch capacity, Q, is defined.A Capacitated Shortest Spanning Arborescence rooted at r (CSSA _r ) is a minimum cost partial digraph such that: (i) each vertexj r has exactly one entering arc; (ii) for each vertexj r, a path fromr toj exists; (iii) for each branch leaving vertexr, the total demand of the vertices does not exceed the branch capacity,Q. A variant of theCSSA _r problem (calledD-CSSA _r ) arises when the out-degree of the root vertex is constrained to be equal to a given valueD. These problems are strongly NP-hard, and find practical applications in routing and network design. We describe a new Lagrangian lower bound forCSSA _r andD-CSSA _r problems, strengthened in a cutting plane fashion by iteratively adding violated constraints to the Lagrangian problem. We also present a new lower bound based on projection leading to the solution of min-cost flow problems. The two lower bounds are then combined so as to obtain an overall additive lower bounding procedure. The additive procedure is then imbedded in a branch-and-bound algorithm whose performance is enhanced by means of reduction procedures, dominance criteria, feasibility checks and upper bounding. Computational tests on asymmetric and symmetric instances from the literature, involving up to 200 vertices, are given, showing the effectiveness of the proposed approach.     

Twistor holomorphic Lagrangian surfaces in the complex projective and hyperbolic planes

We completely classify all the twistor holomorphic Lagrangian immersions in the complex projective plane ², i.e. those Lagrangian immersions such that their twistor lifts to the twistor space over ² are holomorphic. This classification provides a one-parameter family of examples of Lagrangian spheres in ².Research partially supported by a DGICYT grant No. PB91-0731.     

A two-phase algorithm for the partial accessibility constrained vehicle routing problem

In the partial accessibility constrained vehicle routing problem, a route can be covered by two types of vehicles, i.e. truck or truck + trailer. Some customers are accessible by both vehicle types, whereas others solely by trucks. After introducing an integer programming formulation for the problem, we describe a two-phase heuristic method which extends a classical vehicle routing algorithm. Since it is necessary to solve a combinatorial problem that has some similarities with the generalized assignment problem, we propose an enumerative procedure in which bounds are obtained from a Lagrangian relaxation. The routine provides very encouraging results on a set of test problems.     

Retrieval and chaos in extremely dilutedQ-Ising neural networks

Using a probabilistic approach, the deterministic and the stochastic parallel dynamics of aQ-Ising neural network are studied at finiteQ and in the limitQ. Exact evolution equations are presented for the first time-step. These formulas constitute recursion relations for the parallel dynamics of the extremely diluted asymmetric versions of these networks. An explicit analysis of the retrieval properties is carried out in terms of the gain parameter, the loading capacity, and the temperature. The results for theQ network are compared with those for theQ=3 andQ=4 models. Possible chaotic microscopic behavior is studied using the time evolution of the distance between two network configurations. For arbitrary finiteQ the retrieval regime is always chaotic. In the limitQ the network exhibits a dynamical transition toward chaos.