Synthesis and structures of oxyanion encapsulated copper(I)-dppm complexes (dppm = bis(diphenylphosphino) methane)

Copper(I)-dppm complexes encapsulating the oxyanions ClO4-, NO3-, CH3C6H4CO2-, SO42-, and WO42- have been synthesized either by reduction of the corresponding Cu(II) salts and treatment with dppm, or by treating the complex [Cu-2(dppm)(2)(dmcn)(3)](BF4)(2) (1) (dmcn = dimethyl cyanamide) with the respective anion. The isolated complexes [Cu-2(dppm)(2)(dmcn)(2)(ClO4)] (ClO4) (2), [Cu-2(dppm)(2)(dmcn)(2)(NO3)] (NO3) (3), Cu-2(dppm)(2)(NO3)(2) (4), [Cu-2(dppm)(2)(CH3C6H4CO2)(2)]dmcn.2THF (5), Cu-2(dppm)(2)(SO4) (6), and [Cu-3(dppm)(3)(Cl)(WO4)] 0.5H(2)O (7) have been characterized by IR, H-1 and P-31{H-1} NMR, UV-vis, and emission spectroscopy. The solid-state molecular structure of complexes 1, 2, 4, and 7 were determined by single-crystal X-ray diffraction. Pertinent crystal data are as follows: for 1, monoclinic P2(1)/c, a = 11.376(10) Angstrom, b = 42.503(7) Angstrom, c = 13.530(6) Angstrom, beta = 108.08(2)degrees, V = 6219(3) Angstrom(3), Z = 4; for 2, monoclinic P2(1)/c, a = 21.600(3) Angstrom, b = 12.968(3) Angstrom, c = 23.050(3) Angstrom, beta = 115.97(2)degrees, V = 5804(17) Angstrom(3), Z = 4; for 4, triclinic , a = 10.560(4) Angstrom, b = 10.553(3) Angstrom, c = 22.698(3) Angstrom, alpha = 96.08(2)degrees, beta = 96.03(2)degrees, gamma = 108.31(2)degrees, V = 2362(12) Angstrom(3), Z = 2; and for 7, orthorhombic P2(1)2(1)2(1), a = 14.407(4) Angstrom, b = 20.573(7) Angstrom, c = 24.176(6) Angstrom, V = 7166(4) Angstrom(3), Z = 4. Analyses of the crystallographic and spectroscopic data of these complexes reveal the nature of interactions between the Cu-I-dppm core and oxyanion. The anchoring of the oxyanion to the Cu-n(dppm)(n) unit is primarily through coordination to the metal, but the noncovalent C-H ... O interactions between the methylene and phenyl protons of the dppm and oxygen atoms of the oxyanion play a significant role. The solid-state emission spectra for complexes 1-6 are very similar but different from 7. In CDCl3 solution, addition of ClO4- or NO3- (as their tetrabutylammonium salts) to 1 establishes a rapid equilibrium between the anion-complexed and uncomplexed forms. The association constant values for ClO4- and NO3- have been estimated from the P-31{H-1} NMR spectra.

Photodissociation dynamics of CH2ICl at 222, 236, 266, 280, and-304 nm

Dynamics of I*(P-2(1/2)) formation from CH2ICl dissociation has-been investigated at five different ultraviolet excitation wavelengths, e.g., 222, 236, 266, 280, and similar to304 nm. The quantum yield of I*((2)p(1/2)) production, phi*, has been measured by monitoring nascent I(P-2(3/2)) and I* concentrations using a resonance enhanced multiphoton ionization detection scheme. The measured quantum yield as a function of excitation energy follows the same trend as that of methyl iodide except at 236 run. The photodissociation dynamics of CH2ICl also involves three upper states similar to methyl iodide, and a qualitative correlation diagram has been constructed to account for the observed quantum yield. From the difference in behavior at 236 nm, it appears that the crossing region between the two excited states ((3)Q(0) and (1)Q(1)) is located near the exit valley away from the Franck Condon excitation region. The B- and C-band transitions do not participate in the dynamics, and the perturbation of the methyl iodide states due to Cl-I interaction is relatively weak at the photolysis wavelengths employed in this investigation.

Snakes with Ellipse-Reproducing Property

We present a new class of continuously defined parametric snakes using a special kind of exponential splines as basis functions. We have enforced our bases to have the shortestpossible support subject to some design constraints to maximize efficiency. While the resulting snakes are versatile enough to provide a good approximation of any closed curve in the plane, their most important feature is the fact that they admit ellipses within their span. Thus, they can perfectly generate circular and elliptical shapes. These features are appropriate to delineate cross sections of cylindrical-like conduits and to outline blob-like objects. We address the implementation details and illustrate the capabilities of our snake with synthetic and real data.

Simple theoretical analysis of the Fowler-Nordheim field emission from microstructures and quantum wires of optoelectronic materials

We present a simplified theoretical formulation of the Fowler-Nordheim field emission (FNFE) under magnetic quantization and also in quantum wires of optoelectronic materials on the basis of a newly formulated electron dispersion law in the presence of strong electric field within the framework of k.p formalism taking InAs, InSb, GaAs, Hg(1-x)Cd(x)Te and In(1-x)Ga(x) As(y)P(1-y) lattice matched to InP as examples. The FNFE exhibits oscillations with inverse quantizing magnetic field and electron concentration due to SdH effect and increases with increasing electric field. For quantum wires the FNFE increases with increasing film thickness due to the existence van-Hove singularity and the magnitude of the quantum jumps are not of same height indicating the signature of the band structure of the material concerned. The appearance of the humps of the respective curves is due to the redistribution of the electrons among the quantized energy levels when the quantum numbers corresponding to the highest occupied level changes from one fixed value to the others. Although the field current varies in various manners with all the variables in all the limiting cases as evident from all the curves, the rates of variations are totally band-structure dependent. Under certain limiting conditions, all the results as derived in this paper get transformed in to well known Fowler-Nordheim formula. (C) 2011 Elsevier Ltd. All rights reserved.

Boxicity and Poset Dimension

Let G be a simple, undirected, finite graph with vertex set V (G) and edge set E(G). A k-dimensional box is a Cartesian product of closed intervals [a(1), b(1)] x [a(2), b(2)] x ... x [a(k), b(k)]. The boxicity of G, box(G), is the minimum integer k such that G can be represented as the intersection graph of k-dimensional boxes; i.e., each vertex is mapped to a k-dimensional box and two vertices are adjacent in G if and only if their corresponding boxes intersect. Let P = (S, P) be a poset, where S is the ground set and P is a reflexive, antisymmetric and transitive binary relation on S. The dimension of P, dim(P), is the minimum integer t such that P can be expressed as the intersection of t total orders. Let G(P) be the underlying comparability graph of P; i.e., S is the vertex set and two vertices are adjacent if and only if they are comparable in P. It is a well-known fact that posets with the same underlying comparability graph have the same dimension. The first result of this paper links the dimension of a poset to the boxicity of its underlying comparability graph. In particular, we show that for any poset P, box(G(P))/(chi(G(P)) - 1) <= dim(P) <= 2box(G(P)), where chi(G(P)) is the chromatic number of G(P) and chi(G(P)) not equal 1. It immediately follows that if P is a height-2 poset, then box(G(P)) <= dim(P) <= 2box(G(P)) since the underlying comparability graph of a height-2 poset is a bipartite graph. The second result of the paper relates the boxicity of a graph G with a natural partial order associated with the extended double cover of G, denoted as G(c): Note that G(c) is a bipartite graph with partite sets A and B which are copies of V (G) such that, corresponding to every u is an element of V (G), there are two vertices u(A) is an element of A and u(B) is an element of B and {u(A), v(B)} is an edge in G(c) if and only if either u = v or u is adjacent to v in G. Let P(c) be the natural height-2 poset associated with G(c) by making A the set of minimal elements and B the set of maximal elements. We show that box(G)/2 <= dim(P(c)) <= 2box(G) + 4. These results have some immediate and significant consequences. The upper bound dim(P) <= 2box(G(P)) allows us to derive hitherto unknown upper bounds for poset dimension such as dim(P) = 2 tree width (G(P)) + 4, since boxicity of any graph is known to be at most its tree width + 2. In the other direction, using the already known bounds for partial order dimension we get the following: (1) The boxicity of any graph with maximum degree Delta is O(Delta log(2) Delta), which is an improvement over the best-known upper bound of Delta(2) + 2. (2) There exist graphs with boxicity Omega(Delta log Delta). This disproves a conjecture that the boxicity of a graph is O(Delta). (3) There exists no polynomial-time algorithm to approximate the boxicity of a bipartite graph on n vertices with a factor of O(n(0.5-is an element of)) for any is an element of > 0 unless NP = ZPP.

Dilations of Gamma-contractions by solving operator equations

For a contraction P and a bounded commutant S of P. we seek a solution X of the operator equation S - S*P = (1 - P* P)(1/2) X (1 - P* P)(1/2) where X is a bounded operator on (Ran) over bar (1 - P* P)(1/2) with numerical radius of X being not greater than 1. A pair of bounded operators (S, P) which has the domain Gamma = {(z(1) + z(2), z(2)): vertical bar z(1)vertical bar < 1, vertical bar z(2)vertical bar <= 1} subset of C-2 as a spectral set, is called a P-contraction in the literature. We show the existence and uniqueness of solution to the operator equation above for a Gamma-contraction (S, P). This allows us to construct an explicit Gamma-isometric dilation of a Gamma-contraction (S, P). We prove the other way too, i.e., for a commuting pair (S, P) with parallel to P parallel to <= 1 and the spectral radius of S being not greater than 2, the existence of a solution to the above equation implies that (S, P) is a Gamma-contraction. We show that for a pure F-contraction (S, P), there is a bounded operator C with numerical radius not greater than 1, such that S = C + C* P. Any Gamma-isometry can be written in this form where P now is an isometry commuting with C and C. Any Gamma-unitary is of this form as well with P and C being commuting unitaries. Examples of Gamma-contractions on reproducing kernel Hilbert spaces and their Gamma-isometric dilations are discussed. (C) 2012 Elsevier Inc. All rights reserved.

Continuous beam of laser-cooled Yb atoms

We demonstrate the launching of laser-cooled Yb atoms in a continuous atomic beam. The continuous cold beam has significant advantages over the more-common pulsed fountain, which was also demonstrated by us recently. The cold beam is formed in the following steps: i) atoms from a thermal beam are first Zeeman-slowed to a small final velocity; ii) the slowed atoms are captured in a two-dimensional magneto-optic trap (2D-MOT); and iii) atoms are launched continuously in the vertical direction using two sets of moving-molasses beams, inclined at +/- 15 degrees to the vertical. The cooling transition used is the strongly allowed S-1(0) -> P-1(1) transition at 399 nm. We capture about 7x10(6) atoms in the 2D-MOT, and then launch them with a vertical velocity of 13m/s at a longitudinal temperature of 125(6) mK. Copyright (C) EPLA, 2013

Resolution of Singularities for a Class of Hilbert Modules

Let M be the completion of the polynomial ring C(z) under bar] with respect to some inner product, and for any ideal I subset of C (z) under bar], let I] be the closure of I in M. For a homogeneous ideal I, the joint kernel of the submodule I] subset of M is shown, after imposing some mild conditions on M, to be the linear span of the set of vectors {p(i)(partial derivative/partial derivative(w) over bar (1),...,partial derivative/partial derivative(w) over bar (m)) K-I] (., w)vertical bar(w=0), 1 <= i <= t}, where K-I] is the reproducing kernel for the submodule 2] and p(1),..., p(t) is some minimal ``canonical set of generators'' for the ideal I. The proof includes an algorithm for constructing this canonical set of generators, which is determined uniquely modulo linear relations, for homogeneous ideals. A short proof of the ``Rigidity Theorem'' using the sheaf model for Hilbert modules over polynomial rings is given. We describe, via the monoidal transformation, the construction of a Hermitian holomorphic line bundle for a large class of Hilbert modules of the form I]. We show that the curvature, or even its restriction to the exceptional set, of this line bundle is an invariant for the unitary equivalence class of I]. Several examples are given to illustrate the explicit computation of these invariants.

Sparse Recovery Methods Hold Promise for Diffuse Optical Tomographic Image Reconstruction

The sparse recovery methods utilize the l(p)-normbased regularization in the estimation problem with 0 <= p <= 1. These methods have a better utility when the number of independent measurements are limited in nature, which is a typical case for diffuse optical tomographic image reconstruction problem. These sparse recovery methods, along with an approximation to utilize the l(0)-norm, have been deployed for the reconstruction of diffuse optical images. Their performancewas compared systematically using both numerical and gelatin phantom cases to show that these methods hold promise in improving the reconstructed image quality.

Cubic Sieve Congruence of the Discrete Logarithm Problem, and fractional part sequences

The Cubic Sieve Method for solving the Discrete Logarithm Problem in prime fields requires a nontrivial solution to the Cubic Sieve Congruence (CSC) x(3) equivalent to y(2)z (mod p), where p is a given prime number. A nontrivial solution must also satisfy x(3) not equal y(2)z and 1 <= x, y, z < p(alpha), where alpha is a given real number such that 1/3 < alpha <= 1/2. The CSC problem is to find an efficient algorithm to obtain a nontrivial solution to CSC. CSC can be parametrized as x equivalent to v(2)z (mod p) and y equivalent to v(3)z (mod p). In this paper, we give a deterministic polynomial-time (O(ln(3) p) bit-operations) algorithm to determine, for a given v, a nontrivial solution to CSC, if one exists. Previously it took (O) over tilde (p(alpha)) time in the worst case to determine this. We relate the CSC problem to the gap problem of fractional part sequences, where we need to determine the non-negative integers N satisfying the fractional part inequality {theta N} < phi (theta and phi are given real numbers). The correspondence between the CSC problem and the gap problem is that determining the parameter z in the former problem corresponds to determining N in the latter problem. We also show in the alpha = 1/2 case of CSC that for a certain class of primes the CSC problem can be solved deterministically in <(O)over tilde>(p(1/3)) time compared to the previous best of (O) over tilde (p(1/2)). It is empirically observed that about one out of three primes is covered by the above class. (C) 2013 Elsevier B.V. All rights reserved.

Lovasz theta function, SVMs and Finding Dense Subgraphs

In this paper we establish that the Lovasz theta function on a graph can be restated as a kernel learning problem. We introduce the notion of SVM-theta graphs, on which Lovasz theta function can be approximated well by a Support vector machine (SVM). We show that Erdos-Renyi random G(n, p) graphs are SVM-theta graphs for log(4)n/n <= p < 1. Even if we embed a large clique of size Theta(root np/1-p) in a G(n, p) graph the resultant graph still remains a SVM-theta graph. This immediately suggests an SVM based algorithm for recovering a large planted clique in random graphs. Associated with the theta function is the notion of orthogonal labellings. We introduce common orthogonal labellings which extends the idea of orthogonal labellings to multiple graphs. This allows us to propose a Multiple Kernel learning (MKL) based solution which is capable of identifying a large common dense subgraph in multiple graphs. Both in the planted clique case and common subgraph detection problem the proposed solutions beat the state of the art by an order of magnitude.

Polymorphism and Phase Transformation Behavior of Solid Forms of 4-Amino-3,5-dinitrobenzamide

We report the preparation, analysis, and phase transformation behavior of polymorphs and the hydrate of 4-amino-3,5-dinitrobenzamide. The compound crystallizes in four different polymorphic forms, Form I (monoclinic, P2(1)/n), Form II (orthorhombic, Pbca), Form III (monoclinic, P2(1)/c), and Form IV (monoclinic, P2(1)/c). Interestingly, a hydrate (triclinic, P (1) over bar) of the compound is also discovered during the systematic identification of the polymorphs. Analysis of the polymorphs has been investigated using hot stage microscopy, differential scanning calorimetry, in situ variable-temperature powder X-ray diffraction, and single-crystal X-ray diffraction. On heating, all of the solid forms convert into Form I irreversibly, and on further heating, melting is observed. In situ single-crystal X-ray diffraction studies revealed that Form II transforms to Form I above 175 degrees C via single-crystal-to-single-crystal transformation. The hydrate, on heating, undergoes a double phase transition, first to Form III upon losing water in a single-crystal-to-single-crystal fashion and then to a more stable polymorph Form I on further heating. Thermal analysis leads to the conclusion that Form II appears to be the most stable phase at ambient conditions, whereas Form I is more stable at higher temperature.

Polynomial Decompositions in Polynomial Time

Fix a prime p. Given a positive integer k, a vector of positive integers Delta = (Delta(1), Delta(2), ... , Delta(k)) and a function Gamma : F-p(k) -> F-p, we say that a function P : F-p(n) -> F-p is (k, Delta, Gamma)-structured if there exist polynomials P-1, P-2, ..., P-k : F-p(n) -> F-p with each deg(P-i) <= Delta(i) such that for all x is an element of F-p(n), P(x) = Gamma(P-1(x), P-2(x), ..., P-k(x)). For instance, an n-variate polynomial over the field Fp of total degree d factors nontrivially exactly when it is (2, (d - 1, d - 1), prod)- structured where prod(a, b) = a . b. We show that if p > d, then for any fixed k, Delta, Gamma, we can decide whether a given polynomial P(x(1), x(2), ..., x(n)) of degree d is (k, Delta, Gamma)-structured and if so, find a witnessing decomposition. The algorithm takes poly(n) time. Our approach is based on higher-order Fourier analysis.

LOWER BOUNDS FOR BOXICITY

An axis-parallel b-dimensional box is a Cartesian product R-1 x R-2 x ... x R-b where R-i is a closed interval of the form a(i),b(i)] on the real line. For a graph G, its boxicity box(G) is the minimum dimension b, such that G is representable as the intersection graph of boxes in b-dimensional space. Although boxicity was introduced in 1969 and studied extensively, there are no significant results on lower bounds for boxicity. In this paper, we develop two general methods for deriving lower bounds. Applying these methods we give several results, some of which are listed below: 1. The boxicity of a graph on n vertices with no universal vertices and minimum degree delta is at least n/2(n-delta-1). 2. Consider the g(n,p) model of random graphs. Let p <= 1 - 40logn/n(2.) Then with high `` probability, box(G) = Omega(np(1 - p)). On setting p = 1/2 we immediately infer that almost all graphs have boxicity Omega(n). Another consequence of this result is as follows: For any positive constant c < 1, almost all graphs on n vertices and m <= c((n)(2)) edges have boxicity Omega(m/n). 3. Let G be a connected k-regular graph on n vertices. Let lambda be the second largest eigenvalue in absolute value of the adjacency matrix of G. Then, the boxicity of G is a least (kappa(2)/lambda(2)/log(1+kappa(2)/lambda(2))) (n-kappa-1/2n). 4. For any positive constant c 1, almost all balanced bipartite graphs on 2n vertices and m <= cn(2) edges have boxicity Omega(m/n).