ZnCl2 catalyzed efficient synthesis of 1,3,4-oxadiazole and 1,3,4-thiadiazole

New methods for the synthesis of 1,3,4-oxadiazole and 1,3,4-thiadiazole have been described. No cyclizations took place in the absence of ZnCl₂. 1,3,4-Thiadiazoles are formed in the presence of ZnCl₂ alone, whereas oxadiazoles are produced when a base such as Et₃N or KOH was used along with ZnCl₂. % Yields are optimized.     

Almost f-maps and almost f-rings

In the beginning of the eighties, Buskes and Holland proved that any archimedean almost f-ring is commutative. One decade later, Steinberg showed that if G and H are ? with H archimedean, then any positive bilinear map G × G ${{\begin{array}{ll} B \\ \rightarrow \end{array}}}$ H such that ${x \wedge y = 0}$ implies B(x, y) = 0 is symmetric. At first sight, the Steinberg Theorem might seem to be a considerable generalization of the Buskes and Holland result. It turns out, surprisingly enough, that these two results are equivalent. The main purpose of this paper is to establish this equivalence. A second objective is to apply the aforementioned Steinberg Theorem to prove that if R is an f-ring with a unit element e and S is an archimedean f-ring, then an ?-homomorphism R ${{{\begin{array}{ll} h \\\rightarrow \end{array}}}}$ S is a ring homomorphism if and only if h(e) is idempotent in S. This extends a well-known result by Huijsmans and de Pagter, who obtained the same conclusion for semiprime f-algebras.     

Temperature dependence of coarse-grained potentials for liquid hexane

The present molecular dynamics study is an investigation of the temperature (T) dependence of liquid hexane coarse-grained potentials optimized with the Iterative Boltzmann Inversion method. An approach for the derivation of coarse-grained potentials at temperatures T different from the optimization temperature T(0) has recently been proposed for ethylbenzene. This method is based on the use of a T-dependent scaling factor f(T) to generate ethylbenzene potentials at T≠T(0). The approach is here extended to hexane, considering different reference temperatures T(0) and functional forms for f(T). From our simulations, it appears that the accuracy of the temperature transferability depends simultaneously on the T(0) chosen and the analytic form of f(T). Such a behavior is suppressed by the use of a new 2-point interpolation formula to generate coarse-grained potentials as a function of T. This scheme employs a linear interpolation based on the optimization of coarse-grained potentials at two reference temperatures, T(L) and T(U), with T(L)≤T≤T(U). Accurate coarse-grained simulations of liquid hexane can be performed using the new interpolation scheme. The results are encouraging for the use of potential interpolations as a practical means for devising coarse-grained potentials within a wider temperature range.     

SiO2@Fe2O3 core-shell nanoparticles for covalent immobilization and release of sparfloxacin drug

Silica-coated Fe(2)O(3) nanoparticles were synthesized as carriers for the covalent immobilization and release of antimicrobial drug sparfloxacin (SPFX). SPFX-loaded nanoparticles exhibited time-dependent drug release, with no measurable in vitro cytotoxicity, making the drug@nanoparticle conjugates potentially relevant for nanomedicine applications.     

Symmetrical and Unsymmetrical Bishophonate Esters Chemistry: Synthesis,Selective Hydrolysis,Isomerization

Abstract

Over thc past few years, bisphosphonatcs have bcen receiving increased auention as a new class of pharmacologically active compound. As a continuation of our research program (1,2,3) in connection with the synthesis of bisphosphonate esw I. we present here some results about thc synthesis of symmetrical and unsymmcuical bisphosphonate esms. These compounds were selectively hydrolizcd to give the following mono, di, d and tcua acids II.     

Ultrasound-Mediated Synthesis of 3,4-Dihydropyrimidin-2-(1H)-Ones (or Thiones) with NaHSO4·H2O

Abstract

A fast and efficient Biginelli synthesis of 3,4-dihydropyrimidin-2-(1H)-ones (or thiones) by the reaction of aromatic aldehydes, β-dicarbonyls, and urea/thiourea using NaHSO₄·H₂O/ultrasound system is presented. The reactions were carried out in refluxing n-hexane/CH₃CN (2.5:0.5 mL) to afford the products in excellent yields.     

Finger-Knuckle-Print recognition performance improvement via multi-instance fusion at the score level

Fusion of multiple instances within a modality for improving the performance of biometric verification has attracted much attention in recent years. In this letter, we present an efficient Finger-Knuckle-Print (FKP) recognition algorithm based on multi-instance fusion, which combines the left index/middle and right index/middle fingers of an individual at the matching score level. Before fusing, a novel normalization strategy is applied on each score and a fused score is generated for the final decision by summing the normalized scores. The experimental results on Poly-U FKP database show that the proposed method has an obvious performance improvement compared with the single-instance method and different normalization strategies.     

A Skew Stochastic Heat Equation

We consider a stochastic heat equation driven by a space-time white noise and with a singular drift, where a local-time in space appears. The process we study has an explicit invariant measure of Gibbs type, with a non-convex potential. We obtain existence of a Markov solution, which is associated with an explicit Dirichlet form. Moreover, we study approximations of the stationary solution by means of a regularization of the singular drift or by a finite-dimensional projection.     

The Euclidean Bottleneck Steiner Path Problem and Other Applications of (α,β)-Pair Decomposition

We consider a geometric optimization problem that arises in network design. Given a set P of n points in the plane, source and destination points s, t∈P, and an integer k>0, one has to locate k Steiner points, such that the length of the longest edge of a bottleneck path between s and t is minimized. In this paper, we present an O(nlog² n)-time algorithm that computes an optimal solution, for any constant k. This problem was previously studied by Hou et al. (in Wireless Networks 16, 1033–1043, 2010), who gave an O(n ²logn)-time algorithm. We also study the dual version of the problem, where a value λ>0 is given (instead of k), and the goal is to locate as few Steiner points as possible, so that the length of the longest edge of a bottleneck path between s and t is at most λ. Our algorithms are based on two new geometric structures that we develop—an (α,β)-pair decomposition of P and a floor (1+ε)-spanner of P. For real numbers β>α>0, an (α,β)-pair decomposition of P is a collection $\mathcal{W}=\{(A_{1},B_{1}),\ldots,(A_{m},B_{m})\}$ of pairs of subsets of P, satisfying the following: (i) For each pair $(A_{i},B_{i}) \in\mathcal {W}$ , both minimum enclosing circles of A _i and B _i have a radius at most α, and (ii) for any p, q∈P, such that |pq|≤β, there exists a single pair $(A_{i},B_{i}) \in\mathcal{W}$ , such that p∈A _i and q∈B _i , or vice versa. We construct (a compact representation of) an (α,β)-pair decomposition of P in time O((β/α)³ nlogn). In some applications, a simpler (though weaker) grid-based version of an (α,β)-pair decomposition of P is sufficient. We call this version a weak (α,β)-pair decomposition of P. For ε>0, a floor (1+ε)-spanner of P is a (1+ε)-spanner of the complete graph over P with weight function w(p,q)=?|pq|?. We construct such a spanner with O(n/ε ²) edges in time O((1/ε ²)nlog² n), even though w is not a metric. Finally, we present two additional applications of an (α,β)-pair decomposition of P. In the first, we construct a strong spanner of the unit disk graph of P, with the additional property that the spanning paths also approximate the number of substantial hops, i.e., hops of length greater than a given threshold. In the second application, we present an O((1/ε ²)nlogn)-time algorithm for computing a one-sided approximation for distance selection (i.e., given k, $1 \le k \le{n \choose2}$ , find the k’th smallest Euclidean distance induced by P), significantly improving the running time of the algorithm of Bespamyatnikh and Segal.