@inproceedings{18342,
  abstract     = {Finding a match between partially available deformable shapes is a challenging problem with numerous applications. The problem is usually approached by computing local descriptors on a pair of shapes and then establishing a point-wise correspondence between the two. In this paper, we introduce an alternative correspondence-less approach to matching fragments to an entire shape undergoing a non-rigid deformation. We use diffusion geometric descriptors and optimize over the integration domains on which the integral descriptors of the two parts match. The problem is regularized using the Mumford-Shah functional. We show an efficient discretization based on the Ambrosio-Tortorelli approximation generalized to triangular meshes. Experiments demonstrating the success of the proposed method are presented.},
  author       = {Pokrass, Jonathan and Bronstein, Alexander and Bronstein, Michael M.},
  booktitle    = {3rd International Conference on Scale Space and Variational Methods in Computer Vision},
  isbn         = {9783642247842},
  issn         = {1611-3349},
  location     = {Ein-Gedi, Israel},
  pages        = {592 -- 603},
  publisher    = {Springer Nature},
  title        = {{A correspondence-less approach to matching of deformable shapes}},
  doi          = {10.1007/978-3-642-24785-9_50},
  volume       = {6667},
  year         = {2012},
}

@inproceedings{18343,
  abstract     = {In this paper, we explore the use of the diffusion geometry framework for the fusion of geometric and photometric information in local heat kernel signature shape descriptors. Our construction is based on the definition of a diffusion process on the shape manifold embedded into a high-dimensional space where the embedding coordinates represent the photometric information. Experimental results show that such data fusion is useful in coping with different challenges of shape analysis where pure geometric and pure photometric methods fail.},
  author       = {Kovnatsky, Artiom and Bronstein, Michael M. and Bronstein, Alexander and Kimmel, Ron},
  booktitle    = {3rd International Conference on Scale Space and Variational Methods in Computer Vision},
  isbn         = {9783642247842},
  issn         = {1611-3349},
  location     = {Ein-Gedi, Israel},
  pages        = {616--627},
  publisher    = {Springer Nature},
  title        = {{Photometric heat kernel signatures}},
  doi          = {10.1007/978-3-642-24785-9_52},
  volume       = {6667},
  year         = {2012},
}

@inproceedings{18344,
  abstract     = {Analysis of intrinsic symmetries of non-rigid and articulated shapes is an important problem in pattern recognition with numerous applications ranging from medicine to computational aesthetics. Considering articulated planar shapes as closed curves, we show how to represent their extrinsic and intrinsic symmetries as self-similarities of local descriptor sequences, which in turn have simple interpretation in the frequency domain. The problem of symmetry detection and analysis thus boils down to analysis of descriptor sequence patterns. For that purpose, we show two efficient computational methods: one based on Fourier analysis, and another on dynamic programming.},
  author       = {Hooda, Amit and Bronstein, Michael M. and Bronstein, Alexander and Horaud, Radu P.},
  booktitle    = {Scale Space and Variational Methods in Computer Vision},
  isbn         = {9783642247842},
  issn         = {1611-3349},
  location     = {Ein-Gedi, Israel},
  pages        = {665–676},
  publisher    = {Springer Nature},
  title        = {{Shape palindromes: Analysis of intrinsic symmetries in 2D articulated shapes}},
  doi          = {10.1007/978-3-642-24785-9_56},
  volume       = {6667},
  year         = {2012},
}

@inproceedings{18345,
  abstract     = {In classical signal processing, it is common to analyze and process signals in the frequency domain, by representing the signal in the Fourier basis, and filtering it by applying a transfer function on the Fourier coefficients. In some applications, it is possible to design an optimal filter. A classical example is the Wiener filter that achieves a minimum mean squared error estimate for signal denoising. Here, we adopt similar concepts to construct optimal diffusion geometric shape descriptors. The analogy of Fourier basis are the eigenfunctions of the Laplace-Beltrami operator, in which many geometric constructions such as diffusion metrics, can be represented. By designing a filter of the Laplace-Beltrami eigenvalues, it is theoretically possible to achieve invariance to different shape transformations, like scaling. Given a set of shape classes with different transformations, we learn the optimal filter by minimizing the ratio between knowingly similar and knowingly dissimilar diffusion distances it induces. The output of the proposed framework is a filter that is optimally tuned to handle transformations that characterize the training set.},
  author       = {Aflalo, Yonathan and Bronstein, Alexander and Bronstein, Michael M. and Kimmel, Ron},
  booktitle    = {3rd International Conference on Scale Space and Variational Methods in Computer Vision},
  isbn         = {9783642247842},
  issn         = {1611-3349},
  location     = {Ein-Gedi, Israel},
  pages        = {689--700},
  publisher    = {Springer Nature},
  title        = {{Deformable shape retrieval by learning diffusion kernels}},
  doi          = {10.1007/978-3-642-24785-9_58},
  volume       = {6667},
  year         = {2012},
}

@inproceedings{18346,
  abstract     = {Understanding of articulated shape motion plays an important role in many applications in the mechanical engineering, movie industry, graphics, and vision communities. In this paper, we study motion-based segmentation of articulated 3D shapes into rigid parts. We pose the problem as finding a group-valued map between the shapes describing the motion, forcing it to favor piecewise rigid motions. Our computation follows the spirit of the Ambrosio-Tortorelli scheme for Mumford-Shah segmentation, with a diffusion component suited for the group nature of the motion model. Experimental results demonstrate the effectiveness of the proposed method in non-rigid motion segmentation.},
  author       = {Rosman, Guy and Bronstein, Michael M. and Bronstein, Alexander and Wolf, Alon and Kimmel, Ron},
  booktitle    = {3rd International Conference on Scale Space and Variational Methods in Computer Vision},
  isbn         = {9783642247842},
  issn         = {1611-3349},
  location     = {Ein-Gedi, Israel},
  pages        = {725--736},
  publisher    = {Springer Nature},
  title        = {{Group-valued regularization framework for motion segmentation of dynamic non-rigid shapes}},
  doi          = {10.1007/978-3-642-24785-9_61},
  volume       = {6667},
  year         = {2012},
}

@inproceedings{18347,
  abstract     = {Multi-part shape matching is an important class of problems, arising in many fields such as computational archaeology, biology, geometry processing, computer graphics and vision. In this paper, we address the problem of simultaneous matching and segmentation of multiple shapes. We assume to be given a reference shape and multiple parts partially matching the reference. Each of these parts can have additional clutter, have overlap with other parts, or there might be missing parts. We show experimental results of efficient and accurate assembly of fractured synthetic and real objects.},
  author       = {Litany, Or and Bronstein, Alexander and Bronstein, Michael M.},
  booktitle    = {Computer Vision, ECCV 2012 - Workshops and Demonstrations},
  isbn         = {9783642338625},
  issn         = {1611-3349},
  location     = {Florence, Italy},
  number       = {Part 1},
  pages        = {1--11},
  publisher    = {Springer Nature},
  title        = {{Putting the pieces together: Regularized multi-part shape matching}},
  doi          = {10.1007/978-3-642-33863-2_1},
  volume       = {7583},
  year         = {2012},
}

@inproceedings{18348,
  abstract     = {We present a novel method for estimation of articulated motion in depth scans. The method is based on a framework for regularization of vector- and matrix- valued functions on parametric surfaces.

We extend augmented-Lagrangian total variation regularization to smooth rigid motion cues on the scanned 3D surface obtained from a range scanner. We demonstrate the resulting smoothed motion maps to be a powerful tool in articulated scene understanding, providing a basis for rigid parts segmentation, with little prior assumptions on the scene, despite the noisy depth measurements that often appear in commodity depth scanners.},
  author       = {Rosman, Guy and Bronstein, Alexander and Bronstein, Michael M. and Tai, Xue-Cheng and Kimmel, Ron},
  booktitle    = {Computer Vision, ECCV 2012 - Workshops and Demonstrations},
  isbn         = {9783642338625},
  issn         = {1611-3349},
  location     = {Florence, Italy},
  number       = {Part 1},
  pages        = {52--62},
  publisher    = {Springer Nature},
  title        = {{Group-valued regularization for analysis of articulated motion}},
  doi          = {10.1007/978-3-642-33863-2_6},
  volume       = {7583},
  year         = {2012},
}

@inproceedings{18349,
  abstract     = {The rapid development of 3D acquisition technology has brought with itself the need to perform standard signal processing operations such as filters on 3D data. It has been shown that the eigenfunctions of the Laplace-Beltrami operator (manifold harmonics) of a surface play the role of the Fourier basis in the Euclidean space; it is thus possible to formulate signal analysis and synthesis in the manifold harmonics basis. In particular, geometry filtering can be carried out in the manifold harmonics domain by decomposing the embedding coordinates of the shape in this basis. However, since the basis functions depend on the shape itself, such filtering is valid only for weak (near all-pass) filters, and produces severe artifacts otherwise. In this paper, we analyze this problem and propose the fractional filtering approach, wherein we apply iteratively weak fractional powers of the filter, followed by the update of the basis functions. Experimental results show that such a process produces more plausible and meaningful results.},
  author       = {Kovnatsky, Artiom and Bronstein, Michael M. and Bronstein, Alexander},
  booktitle    = {Computer Vision, ECCV 2012 - Workshops and Demonstrations},
  isbn         = {9783642338625},
  issn         = {0302-9743},
  location     = {Florence, Italy},
  number       = {Part 1},
  pages        = {83--91},
  publisher    = {Springer Nature},
  title        = {{Stable Spectral Mesh Filtering}},
  doi          = {10.1007/978-3-642-33863-2_9},
  volume       = {7583},
  year         = {2012},
}

@inproceedings{18350,
  abstract     = {We introduce an (equi-)affine invariant geometric structure by which surfaces that go through squeeze and shear transformations can still be properly analyzed. The definition of an affine invariant metric enables us to evaluate a new form of geodesic distances and to construct an invariant Laplacian from which local and global diffusion geometry is constructed. Applications of the proposed framework demonstrate its power in generalizing and enriching the existing set of tools for shape analysis.},
  author       = {Raviv, Dan and Bronstein, Alexander and Bronstein, Michael M. and Kimmel, Ron and Sochen, Nir},
  booktitle    = {15th International Workshop on Theoretical Foundations of Computer Vision},
  isbn         = {9783642340901},
  issn         = {1611-3349},
  location     = {Dagstuhl, Germany},
  pages        = {177--190},
  publisher    = {Springer Nature},
  title        = {{Equi-affine invariant geometries of articulated objects}},
  doi          = {10.1007/978-3-642-34091-8_8},
  volume       = {7474},
  year         = {2012},
}

@inbook{18737,
  abstract     = {Supermassive black holes (SMBHs) are common in local galactic nuclei, and SMBHs as massive as several billion solar masses already exist at redshift z = 6. These earliest SMBHs may grow by the combination of radiation-pressure-limited accretion and mergers of stellar-mass seed BHs, left behind by the first generation of metal-free stars, or may be formed by more rapid direct collapse of gas in rare special environments where dense gas can accumulate without first fragmenting into stars. This chapter offers a review of these two competing scenarios, as well as some more exotic alternative ideas. It also briefly discusses how the different models may be distinguished in the future by observations with JWST, LISA and other instruments.},
  author       = {Haiman, Zoltán},
  booktitle    = {The First Galaxies},
  editor       = {Wiklind, Tommy and Mobasher, Bahram and Brumm, Volker},
  isbn         = {9783642323614},
  issn         = {2214-7985},
  pages        = {293--341},
  publisher    = {Springer Berlin Heidelberg},
  title        = {{The Formation of the First Massive Black Holes}},
  doi          = {10.1007/978-3-642-32362-1_6},
  year         = {2012},
}

@inproceedings{2049,
  abstract     = {We propose a new authentication protocol that is provably secure based on a ring variant of the learning parity with noise (LPN) problem. The protocol follows the design principle of the LPN-based protocol from Eurocrypt’11 (Kiltz et al.), and like it, is a two round protocol secure against active attacks. Moreover, our protocol has small communication complexity and a very small footprint which makes it applicable in scenarios that involve low-cost, resource-constrained devices.

Performance-wise, our protocol is more efficient than previous LPN-based schemes, such as the many variants of the Hopper-Blum (HB) protocol and the aforementioned protocol from Eurocrypt’11. Our implementation results show that it is even comparable to the standard challenge-and-response protocols based on the AES block-cipher. Our basic protocol is roughly 20 times slower than AES, but with the advantage of having 10 times smaller code size. Furthermore, if a few hundred bytes of non-volatile memory are available to allow the storage of some off-line pre-computations, then the online phase of our protocols is only twice as slow as AES.
},
  author       = {Heyse, Stefan and Kiltz, Eike and Lyubashevsky, Vadim and Paar, Christof and Pietrzak, Krzysztof Z},
  booktitle    = { Conference proceedings FSE 2012},
  location     = {Washington, DC, USA},
  pages        = {346 -- 365},
  publisher    = {Springer},
  title        = {{Lapin: An efficient authentication protocol based on ring-LPN}},
  doi          = {10.1007/978-3-642-34047-5_20},
  volume       = {7549},
  year         = {2012},
}

@inproceedings{1384,
  abstract     = {Software model checking, as an undecidable problem, has three possible outcomes: (1) the program satisfies the specification, (2) the program does not satisfy the specification, and (3) the model checker fails. The third outcome usually manifests itself in a space-out, time-out, or one component of the verification tool giving up; in all of these failing cases, significant computation is performed by the verification tool before the failure, but no result is reported. We propose to reformulate the model-checking problem as follows, in order to have the verification tool report a summary of the performed work even in case of failure: given a program and a specification, the model checker returns a condition Ψ - usually a state predicate - such that the program satisfies the specification under the condition Ψ - that is, as long as the program does not leave the states in which Ψ is satisfied. In our experiments, we investigated as one major application of conditional model checking the sequential combination of model checkers with information passing. We give the condition that one model checker produces, as input to a second conditional model checker, such that the verification problem for the second is restricted to the part of the state space that is not covered by the condition, i.e., the second model checker works on the problems that the first model checker could not solve. Our experiments demonstrate that repeated application of conditional model checkers, passing information from one model checker to the next, can significantly improve the verification results and performance, i.e., we can now verify programs that we could not verify before.},
  author       = {Beyer, Dirk and Henzinger, Thomas A and Keremoglu, Mehmet and Wendler, Philipp},
  booktitle    = {Proceedings of the ACM SIGSOFT 20th International Symposium on the Foundations of Software Engineering},
  location     = {Cary, NC, USA},
  publisher    = {ACM},
  title        = {{Conditional model checking: A technique to pass information between verifiers}},
  doi          = {10.1145/2393596.2393664},
  year         = {2012},
}

@article{1757,
  abstract     = {Self-assembled Ge wires with a height of only 3 unit cells and a length of up to 2 micrometers were grown on Si(001) by means of a catalyst-free method based on molecular beam epitaxy. The wires grow horizontally along either the [100] or the [010] direction. On atomically flat surfaces, they exhibit a highly uniform, triangular cross section. A simple thermodynamic model accounts for the existence of a preferential base width for longitudinal expansion, in quantitative agreement with the experimental findings. Despite the absence of intentional doping, the first transistor-type devices made from single wires show low-resistive electrical contacts and single-hole transport at sub-Kelvin temperatures. In view of their exceptionally small and self-defined cross section, these Ge wires hold promise for the realization of hole systems with exotic properties and provide a new development route for silicon-based nanoelectronics.},
  author       = {Zhang, Jianjun and Georgios Katsaros and Montalenti, Francesco and Scopece, Daniele and Rezaev, Roman O and Mickel, Christine H and Rellinghaus, Bernd and Miglio, Leo P and De Franceschi, Silvano and Rastelli, Armando and Schmidt, Oliver G},
  journal      = {Physical Review Letters},
  number       = {8},
  publisher    = {American Physical Society},
  title        = {{Monolithic growth of ultrathin Ge nanowires on Si(001) }},
  doi          = {10.1103/PhysRevLett.109.085502},
  volume       = {109},
  year         = {2012},
}

@article{17660,
  abstract     = {Many astrophysical binaries, from planets to black holes, exert strong torques on their circumbinary accretion discs, and are expected to significantly modify the disc structure. Despite the several decade long history of the subject, the joint evolution of the binary + disc system has not been modelled with self-consistent assumptions for arbitrary mass ratios and accretion rates. Here, we solve the coupled binary–disc evolution equations analytically in the strongly perturbed limit, treating the azimuthally averaged angular momentum exchange between the disc and the binary and the modifications to the density, scaleheight, and viscosity self-consistently, including viscous and tidal heating, diffusion limited cooling, radiation pressure and the orbital decay of the binary. We find a solution with a central cavity and a migration rate similar to those previously obtained for Type II migration, applicable for large masses and binary separations, and near-equal mass ratios. However, we identify a distinct new regime, applicable at smaller separations and masses, and mass ratio in the range 10−3 ≲ q ≲ 0.1. For these systems, gas piles up outside the binary's orbit, but rather than creating a cavity, it continuously overflows as in a porous dam. The disc profile is intermediate between a weakly perturbed disc (producing Type I migration) and a disc with a gap (with Type II migration). However, the migration rate of the secondary is typically slower than both Type I and Type II rates. We term this new regime ‘Type 1.5’ migration.},
  author       = {Kocsis, Bence and Haiman, Zoltán and Loeb, Abraham},
  issn         = {0035-8711},
  journal      = {Monthly Notices of the Royal Astronomical Society},
  number       = {3},
  pages        = {2660--2679},
  publisher    = {Oxford University Press},
  title        = {{Gas pile-up, gap overflow and Type 1.5 migration in circumbinary discs: General theory}},
  doi          = {10.1111/j.1365-2966.2012.22129.x},
  volume       = {427},
  year         = {2012},
}

@article{17675,
  abstract     = {In this paper, we show that Minkowski Functionals (MFs) of weak gravitational lensing (WL) convergence maps contain significant non-Gaussian, cosmology-dependent information. To do this, we use a large suite of cosmological ray-tracing N-body simulations to create mock WL convergence maps, and study the cosmological information content of MFs derived from these maps. Our suite consists of 80 independent 512^3 N-body runs, covering seven different cosmologies, varying three cosmological parameters Omega_m, w, and sigma_8 one at a time, around a fiducial LambdaCDM model. In each cosmology, we use ray-tracing to create a thousand pseudo-independent 12 deg^2 convergence maps, and use these in a Monte Carlo procedure to estimate the joint confidence contours on the above three parameters. We include redshift tomography at three different source redshifts z_s=1, 1.5, 2, explore five different smoothing scales theta_G=1, 2, 3, 5, 10 arcmin, and explicitly compare and combine the MFs with the WL power spectrum. We find that the MFs capture a substantial amount of information from non-Gaussian features of convergence maps, i.e. beyond the power spectrum. The MFs are particularly well suited to break degeneracies and to constrain the dark energy equation of state parameter w (by a factor of ~ three better than from the power spectrum alone). The non-Gaussian information derives partly from the one-point function of the convergence (through V_0, the "area" MF), and partly through non-linear spatial information (through combining different smoothing scales for V_0, and through V_1 and V_2, the boundary length and genus MFs, respectively). In contrast to the power spectrum, the best constraints from the MFs are obtained only when multiple smoothing scales are combined.},
  author       = {Kratochvil, Jan M. and Lim, Eugene A. and Wang, Sheng and Haiman, Zoltán and May, Morgan and Huffenberger, Kevin},
  issn         = {1550-7998},
  journal      = {Physical Review D},
  number       = {10},
  publisher    = {American Physical Society},
  title        = {{Probing cosmology with weak lensing Minkowski functionals}},
  doi          = {10.1103/physrevd.85.103513},
  volume       = {85},
  year         = {2012},
}

@article{1783,
  abstract     = {Nonlinearity and entanglement are two important properties by which physical systems can be identified as nonclassical. We study the dynamics of the resonant interaction of up to N=3 two-level systems and a single mode of the electromagnetic field sharing a single excitation dynamically. We observe coherent vacuum Rabi oscillations and their nonlinear √N speedup by tracking the populations of all qubits and the resonator in time. We use quantum state tomography to show explicitly that the dynamics generates maximally entangled states of the W class in a time limited only by the collective interaction rate. We use an entanglement witness and the 3-tangle to characterize the state whose fidelity F=78% is limited in our experiments by crosstalk arising during the simultaneous qubit manipulations which is absent in a sequential approach with F=91%.},
  author       = {Mlynek, Jonas A and Abdumalikov, Abdufarrukh A and Johannes Fink and Steffen, L. Kraig and Baur, Matthias P and Lang, C and Van Loo, Arjan F and Wallraff, Andreas},
  journal      = {Physical Review A - Atomic, Molecular, and Optical Physics},
  number       = {5},
  publisher    = {American Physical Society},
  title        = {{Demonstrating W-type entanglement of Dicke states in resonant cavity quantum electrodynamics}},
  doi          = {10.1103/PhysRevA.86.053838},
  volume       = {86},
  year         = {2012},
}

@inproceedings{757,
  abstract     = {Synchronous distributed algorithms are easier to design and prove correct than algorithms that tolerate asynchrony. Yet, in the real world, networks experience asynchrony and other timing anomalies. In this paper, we address the question of how to efficiently transform an algorithm that relies on synchronization into an algorithm that tolerates asynchronous executions. We introduce a transformation technique from synchronous algorithms to indulgent algorithms [1], which induces only a constant overhead in terms of time complexity in well-behaved executions. Our technique is based on a new abstraction we call an asynchrony detector, which the participating processes implement collectively. The resulting transformation works for a large class of colorless tasks, including consensus and set agreement. Interestingly, we also show that our technique is relevant for colored tasks, by applying it to the renaming problem, to obtain the first indulgent renaming algorithm.},
  author       = {Alistarh, Dan-Adrian and Gilbert, Seth and Guerraoui, Rachid and Travers, Corentin},
  pages        = {41 -- 52},
  publisher    = {Springer},
  title        = {{Generating fast indulgent algorithms}},
  doi          = {10.1007/978-3-642-17679-1_4},
  volume       = {6522 LNCS},
  year         = {2011},
}

@inproceedings{760,
  abstract     = {A randomized implementation is given of a test-and-set register with O(log log n) individual step complexity and O(n) total step complexity against an oblivious adversary. The implementation is linearizable and multi-shot, and shows an exponential complexity improvement over previous solutions designed to work against a strong adversary.},
  author       = {Alistarh, Dan-Adrian and Aspnes, James},
  pages        = {97 -- 109},
  publisher    = {Springer},
  title        = {{Sub-logarithmic test-and-set against a weak adversary}},
  doi          = {10.1007/978-3-642-24100-0_7},
  volume       = {6950 LNCS},
  year         = {2011},
}

@article{8025,
  abstract     = {Chandelier (axoaxonic) cells (ChCs) are a distinct group of GABAergic interneurons that innervate the axon initial segments of pyramidal cells. However, their circuit role and the function of their clearly defined anatomical specificity remain unclear. Recent work has demonstrated that chandelier cells can produce depolarizing GABAergic PSPs, occasionally driving postsynaptic targets to spike. On the other hand, other work suggests that ChCs are hyperpolarizing and may have an inhibitory role. These disparate functional effects may reflect heterogeneity among ChCs. Here, using brain slices from transgenic mouse strains, we first demonstrate that, across different neocortical areas and genetic backgrounds, upper Layer 2/3 ChCs belong to a single electrophysiologically and morphologically defined population, extensively sampling Layer 1 inputs with asymmetric dendrites. Consistent with being a single cell type, we find electrical coupling between ChCs. We then investigate the effect of chandelier cell activation on pyramidal neuron spiking in several conditions, ranging from the resting membrane potential to stimuli designed to approximate in vivo membrane potential dynamics. We find that under quiescent conditions, chandelier cells are capable of both promoting and inhibiting spike generation, depending on the postsynaptic membrane potential. However, during in vivo-like membrane potential fluctuations, the dominant postsynaptic effect was a strong inhibition. Thus, neocortical chandelier cells, even from within a homogeneous population, appear to play a dual role in the circuit, helping to activate quiescent pyramidal neurons, while at the same time inhibiting active ones.},
  author       = {Woodruff, A. R. and McGarry, L. M. and Vogels, Tim P and Inan, M. and Anderson, S. A. and Yuste, R.},
  issn         = {0270-6474},
  journal      = {Journal of Neuroscience},
  number       = {49},
  pages        = {17872--17886},
  publisher    = {Society for Neuroscience},
  title        = {{State-dependent function of neocortical chandelier cells}},
  doi          = {10.1523/jneurosci.3894-11.2011},
  volume       = {31},
  year         = {2011},
}

@article{1050,
  abstract     = {We present experimentally derived potential curves 1?and spin-orbit interaction functions for the strongly perturbed AΣu+ 3?and bΠu states of the cesium dimer. The results are based on data from several sources. Laser-induced fluorescence Fourier transform spectroscopy (LIF FTS) was used some time ago in the Laboratoire Aimé Cotton primarily to study the XΣg+ state. More recent work at Tsinghua University provides information from moderate 3?resolution spectroscopy on the lowest levels of the bΠ0u± state as well as additional high-resolution data. From Innsbruck University, we have precision data obtained with cold Cs2 molecules. Recent data from Temple University was obtained using the optical-optical double resonance polarization spectroscopy technique, and finally, a group at the University of Latvia has added additional LIF FTS data. In the Hamiltonian matrix, we have used analytic potentials (the expanded Morse oscillator form) with both finite-difference (FD) coupled-channel and discrete variable representation (DVR) calculations of the term values. Fitted diagonal and off-diagonal spin-orbit functions are obtained and compared with ab initio results from Temple and Moscow State universities.},
  author       = {Bai, Jianmei and Ahmed, Ergin and Beser, Bediha and Guan, Yafei and Kotochigova, Svetlana and Lyyra, Marjatta and Ashman, Seth and Wolfe, Christopher and Huennekens, John and Xie, Feng and Li, Dan and Li, Li and Tamanis, Maris and Ferber, Ruvin and Drozdova, Anastasia and Pazyuk, Elena and Stolyarov, Andrey and Danzl, Johann G and Nägerl, Hanns and Bouloufa, Nadia and Dulieu, Olivier and Amiot, Claude and Salami, Houssam and Bergeman, Thomas},
  journal      = { Physical Review A - Atomic, Molecular, and Optical Physics},
  number       = {3},
  publisher    = {American Physical Society},
  title        = {{Global analysis of data on the spin-orbit-coupled A 1Σu+ and b 3Πu inf states of Cs2}},
  doi          = {10.1103/PhysRevA.83.032514},
  volume       = {83},
  year         = {2011},
}

