E. C. G. Sudarshan and Symmetry in Classical Dynamics, Optics and Quantum Mechanics

We review work initiated and inspired by Sudarshan in relativistic dynamics, beam optics, partial coherence theory, Wigner distribution methods, multimode quantum optical squeezing, and geometric phases. The 1963 No Interaction Theorem using Dirac's instant form and particle World Line Conditions is recalled. Later attempts to overcome this result exploiting constrained Hamiltonian theory, reformulation of the World Line Conditions and extending Dirac's formalism, are reviewed. Dirac's front form leads to a formulation of Fourier Optics for the Maxwell field, determining the actions of First Order Systems (corresponding to matrices of Sp(2,R) and Sp(4,R)) on polarization in a consistent manner. These groups also help characterize properties and propagation of partially coherent Gaussian Schell Model beams, leading to invariant quality parameters and the new Twist phase. The higher dimensional groups Sp(2n,R) appear in the theory of Wigner distributions and in quantum optics. Elegant criteria for a Gaussian phase space function to be a Wigner distribution, expressions for multimode uncertainty principles and squeezing are described. In geometric phase theory we highlight the use of invariance properties that lead to a kinematical formulation and the important role of Bargmann invariants. Special features of these phases arising from unitary Lie group representations, and a new formulation based on the idea of Null Phase Curves, are presented.

8-(3-methylphenoxy)-16H-dinaphtho[2,1-d;1',2'-g][1,3,2]dioxaphosphocine 8-oxide

In the title compound, C28H21O4P, the eight-membered heterocyclic dioxaphosphocine ring has a distorted boat conformation, with the phosphoryl O atom axial and the phenoxy group equatorial. The P=O distance is 1.451 (1) Angstrom and the average length of the three P-O bonds is 1.573 (1) Angstrom. The phenyl ring is nearly perpendicular to both naphthalene planes, making dihedral angles of 91.30 (3) and 97.65 (5)degrees with them. The angle between the two naphthalene planes is 67.73 (3)degrees. The crystal structure is stabilized by van der Waals interactions.

Intraloop and Interloop Interactions in the Folded-G Quartet Structure of Oxytricha Telomeric Sesquence

The antiparallel intramolecular G quartet structure for the 3.5 copy Oxytricha telomeric sequence d(G(4)T(4))(3)G4 has been established using a combination of spectroscopic and chemical probing methods. In the presence of Naf ions, this sequence exhibits a circular dichroism spectrum with a positive band at 295 nm and a negative band around 265 nm, characteristic of an antiparallel G quartet structure. Further, we show that d(G(4)T(4))(3)G(4) adopts an antiparallel intramolecular G quartet structure even in K+ unlike d(G(4)T(4)G(4)). KMnO4 probing experiments indicated the existence of intra and interloop interactions in the Na+ induced structure. We have found that K+ not only increases the thermal stability of,G quartet structure but also binds to the loop region and disrupts stacking and interloop interactions. Biological consequences of such cation-dependent conformational micro-heterogeneity in the loop region of G quartet structures is also discussed.

Popular mixed matchings

We study the problem of matching applicants to jobs under one-sided preferences; that is, each applicant ranks a non-empty subset of jobs under an order of preference, possibly involving ties. A matching M is said to be more popular than T if the applicants that prefer M to T outnumber those that prefer T to M. A matching is said to be popular if there is no matching more popular than it. Equivalently, a matching M is popular if phi(M, T) >= phi(T, M) for all matchings T, where phi(X, Y) is the number of applicants that prefer X to Y. Previously studied solution concepts based on the popularity criterion are either not guaranteed to exist for every instance (e.g., popular matchings) or are NP-hard to compute (e.g., least unpopular matchings). This paper addresses this issue by considering mixed matchings. A mixed matching is simply a probability distribution over matchings in the input graph. The function phi that compares two matchings generalizes in a natural manner to mixed matchings by taking expectation. A mixed matching P is popular if phi(P, Q) >= phi(Q, P) for all mixed matchings Q. We show that popular mixed matchings always exist and we design polynomial time algorithms for finding them. Then we study their efficiency and give tight bounds on the price of anarchy and price of stability of the popular matching problem. (C) 2010 Elsevier B.V. All rights reserved.

Resonance de-enhancement in the 2(1)A(g) state of trans-azobenzene

We analyze the origin of de-enhancement for a number of vibrational modes in the 2(1)A(g) excited state of trans-azobenzene. We have used the time-dependent wave packet analysis of the RR intensities by including the multimode damping effects in the calculation. This avoids the use of unrealistically large values for the damping parameter. It is concluded that the de-enhancement is caused by the interference between the two uncoupled electronic states, and that the intensities observed under the so-called symmetry forbidden 2(1)A(g) <-- 1(1)A(g) transition are purely due to resonance excitation. It is also observed that the use of the time-dependent approach to study the de-enhancement effects caused by multiple electronic states on the RR intensities is not necessarily useful if one is interested in the structural dynamics.

Effect of Zr4+-ion substitution in CeO2 on H2O2-assisted degradation of orange G

A series of Pd ion-substituted CeO2-ZrO2 solid solutions were synthesized using the solution combustion technique. H2O2-assisted degradation of orange G was carried out in the presence of the catalysts. The activity of the catalysts was found to increase with the introduction of the second component in the solid solution, as signified by an increase in the rate constants and lowering of activation energy. The study showed the involvement of lattice oxygen and the importance of reducibility of the compound for the reaction. (C) 2011 Elsevier B.V. All rights reserved.

Analysing Message Sequence Graph Specifications

We give a detailed construction of a finite-state transition system for a com-connected Message Sequence Graph. Though this result is well-known in the literature and forms the basis for the solution to several analysis and verification problems concerning MSG specifications, the constructions given in the literature are either not amenable to implementation, or imprecise, or simply incorrect. In contrast we give a detailed construction along with a proof of its correctness. Our transition system is amenable to implementation, and can also be used for a bounded analysis of general (not necessarily com-connected) MSG specifications.

Bounded Unpopularity Matchings

We investigate the following problem: given a set of jobs and a set of people with preferences over the jobs, what is the optimal way of matching people to jobs? Here we consider the notion of popularity. A matching M is popular if there is no matching M' such that more people prefer M' to M than the other way around. Determining whether a given instance admits a popular matching and, if so, finding one, was studied by Abraham et al. (SIAM J. Comput. 37(4):1030-1045, 2007). If there is no popular matching, a reasonable substitute is a matching whose unpopularity is bounded. We consider two measures of unpopularity-unpopularity factor denoted by u(M) and unpopularity margin denoted by g(M). McCutchen recently showed that computing a matching M with the minimum value of u(M) or g(M) is NP-hard, and that if G does not admit a popular matching, then we have u(M) >= 2 for all matchings M in G. Here we show that a matching M that achieves u(M) = 2 can be computed in O(m root n) time (where m is the number of edges in G and n is the number of nodes) provided a certain graph H admits a matching that matches all people. We also describe a sequence of graphs: H = H(2), H(3), ... , H(k) such that if H(k) admits a matching that matches all people, then we can compute in O(km root n) time a matching M such that u(M) <= k - 1 and g(M) <= n(1 - 2/k). Simulation results suggest that our algorithm finds a matching with low unpopularity in random instances.

Scan cell reordering to minimize peak power during test cycle: A graph theoretic approach

Scan circuit is widely practiced DFT technology. The scan testing procedure consist of state initialization, test application, response capture and observation process. During the state initialization process the scan vectors are shifted into the scan cells and simultaneously the responses captured in last cycle are shifted out. During this shift operation the transitions that arise in the scan cells are propagated to the combinational circuit, which inturn create many more toggling activities in the combinational block and hence increases the dynamic power consumption. The dynamic power consumed during scan shift operation is much more higher than that of normal mode operation.

Faster algorithms for all-pairs small stretch distances in weighted graphs

Abstract. Let G = (V,E) be a weighted undirected graph, with non-negative edge weights. We consider the problem of efficiently computing approximate distances between all pairs of vertices in G. While many efficient algorithms are known for this problem in unweighted graphs, not many results are known for this problem in weighted graphs. Zwick [14] showed that for any fixed ε> 0, stretch 1 1 + ε distances between all pairs of vertices in a weighted directed graph on n vertices can be computed in Õ(n ω) time, where ω < 2.376 is the exponent of matrix multiplication and n is the number of vertices. It is known that finding distances of stretch less than 2 between all pairs of vertices in G is at least as hard as Boolean matrix multiplication of two n×n matrices. It is also known that all-pairs stretch 3 distances can be computed in Õ(n 2) time and all-pairs stretch 7/3 distances can be computed in Õ(n 7/3) time. Here we consider efficient algorithms for the problem of computing all-pairs stretch (2+ε) distances in G, for any 0 < ε < 1. We show that all pairs stretch (2 + ε) distances for any fixed ε> 0 in G can be computed in expected time O(n 9/4 logn). This algorithm uses a fast rectangular matrix multiplication subroutine. We also present a combinatorial algorithm (that is, it does not use fast matrix multiplication) with expected running time O(n 9/4) for computing all-pairs stretch 5/2 distances in G. 1